Download:
|
by Kenneth Zeger
IEEE Trans. Inform. Theory
http://www.code.ucsd.edu/~zeger/publications/journals/MeZe-IT-Structured/submitted.ps.gz
Add To MetaCart
Abstract:
Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for the cascade of asymptotically good channel codes and asymptotically good vector quantizers the end-to-end distortion decays to zero exponentially fast as a function of the overall transmission rate, and is achieved by choosing a channel code rate that is independent of the overall transmission rate. We show that for certain families of practical channel codes and binary lattice vector quantizers, the overall distortion can still be made to decay to zero exponentially fast as the transmission rate grows, although the exponent is a sub-linear function of the transmission rate. This is achieved by carefully choosing a channel code rate that decays to zero as the transmission rate grows. Explicit channel code rate schedules are obtained for several wellknown families of channel codes. Index Terms: lattice vector quantization, source and channel coding, linear error correcting codes, data compression.
Citations
|
1287
|
The Theory of Error-Correcting Codes
– MacWilliams, Sloane
- 1978
|
|
1097
|
Vector Quantization and Signal Compression
– Gersho, Gray
- 1992
|
|
771
|
Information Theory and Reliable Communication
– Gallager
- 1968
|
|
125
|
Coding theorems for a discrete source with a fidelity criterion
– Shannon
- 1959
|
|
101
|
Asymptotic quantization error of continuous signals and the quantization dimension
– Zador
- 1982
|
|
55
|
Tradeoff between source and channel coding
– Hochwald, Zeger
- 1997
|
|
49
|
Spectra of Quantized Signals
– Bennett
- 1948
|
|
43
|
Modular curves, shimura curves and Goppa codes, better than the Varshamov-Gilbert bound
– Tsfasman, Vladut, et al.
- 1982
|
|
25
|
Modular curves and codes with a polynomial construction
– Katsman, Tsfasman, et al.
- 1984
|
|
19
|
Asymptotic bounds on optimal noisy channel quantization via random coding
– Zeger, Manzella
- 1994
|
|
17
|
Optimal binary index assignments for a class of equiprobable scalar and vector quantizers
– McLaughlin, Neuhoff, et al.
- 1995
|
|
11
|
Robust vector quantization by linear mappings of block-codes
– Hagen, Hedelin
- 1993
|
|
10
|
Binary lattice vector quantization with linear block codes and affine index assignments
– Méhes, Zeger
- 1998
|
|
8
|
An Explicit Construction of a Sequence of Codes Attaining the Tsfasman-Vladut-Zink Bound The First Steps
– Voss, Høholdt
- 1997
|
|
6
|
Design methods for VQ by linear mappings of block codes
– Hagen, Hedelin
- 1994
|
|
5
|
Randomly Chosen Index Assignments Are Asymptotically Bad for Uniform Sources
– Mehes, Zeger
- 1999
|
|
4
|
Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman–Vlădut¸–Zink bounds
– Méhes, Zeger
- 2000
|
|
2
|
Polar Quantization Revisited." submitted to
– Moo, Neuhoff
|
|
1
|
Randomly Chosen Index Assigments Are Asymptotically Bad for Uniform Sources
– M'ehes, Zeger
|
