Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
JPEG 2000: Image Compression Fundamentals, Standards and Practice
JPEG 2000: Image Compression Fundamentals, Standards and Practice
Journal of Global Optimization
Turbo and Trellis-Based Constructions for Source Coding with Side Information
DCC '03 Proceedings of the Conference on Data Compression
Compression with Side Information Using Turbo Codes
DCC '02 Proceedings of the Data Compression Conference
Design of Trellis Codes for Source Coding with Side Information at the Decoder
DCC '01 Proceedings of the Data Compression Conference
High-rate quantization and transform coding with side information at the decoder
Signal Processing - Special section: Distributed source coding
Near-capacity dirty-paper code design: a source-channel coding approach
IEEE Transactions on Information Theory
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Nested linear/lattice codes for structured multiterminal binning
IEEE Transactions on Information Theory
Distributed source coding using syndromes (DISCUS): design and construction
IEEE Transactions on Information Theory
Duality between source coding and channel coding and its extension to the side information case
IEEE Transactions on Information Theory
A close-to-capacity dirty paper coding scheme
IEEE Transactions on Information Theory
Superposition coding for side-information channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Layered Wyner–Ziv Video Coding
IEEE Transactions on Image Processing
Near-capacity dirty-paper code design: a source-channel coding approach
IEEE Transactions on Information Theory
Compress-forward coding with BPSK modulation for the half-duplex Gaussian relay channel
IEEE Transactions on Signal Processing
Brief paper: Min-max optimal data encoding and fusion in sensor networks
Automatica (Journal of IFAC)
Hi-index | 0.07 |
This paper considers trellis coded quantization (TCQ) and low-density parity-check (LDPC) codes for the quadratic Gaussian Wyner-Ziv coding problem. After TCQ of the source X, LDPC codes are used to implement Slepian-Wolf coding of the quantized source Q(X) with side information Y at the decoder. Assuming 256-state TCQ and ideal Slepian-Wolf coding in the sense of achieving the theoretical limit H(Q(X)|Y), we experimentally show that Slepian-Wolf coded TCQ performs 0.2 dB away from the Wyner-Ziv distortion-rate function DWZ(R) at high rate. This result mirrors that of entropy-constrained TCQ in classic source coding of Gaussian sources. Furthermore, using 8,192-state TCQ and assuming ideal Slepian-Wolf coding, our simulations show that Slepian-Wolf coded TCQ performs only 0.1 dB away from DWZ(R) at high rate. These results establish the practical performance limit of Slepian-Wolf coded TCQ for quadratic Gaussian Wyner-Ziv coding. Practical designs give performance very close to the theoretical limit. For example, with 8,192-state TCQ, irregular LDPC codes for Slepian-Wolf coding and optimal non-linear estimation at the decoder, our performance gap to DWZ(R) is 0.20 dB, 0.22 dB, 0.30 dB, and 0.93 dB at 3.83 bit per sample (b/s), 1.83 b/s, 1.53 b/s, and 1.05 b/s, respectively. When 256-state 4-D trellis-coded vector quantization instead of TCQ is employed, the performance gap to DWZ(R) is 0.51 dB, 0.51 dB, 0.54 dB, and 0.80 dB at 2.04 b/s, 1.38 b/s, 1.0 b/s, and 0.5 b/s, respectively.