An efficient SF-ISF approach for the Slepian-Wolf source coding problem

DOI10.1155/ASP.2005.961MaRDI QIDQ2570525zbMATH OpenFDO

Authors Zhenyu Tu, Rick S. Blum, Jing Li Tiffany

Publication date 28 October 2005

Published in EURASIP Journal on Applied Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/ASP.2005.961

zbMATH Keywords

code binningcompression with side information at the decoderdistributed source codingparallelly concatenated convolutional codesserially concatenated convolutional codesSlepian-Wolf coding

Mathematics Subject Classification ID

Source coding (94A29) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Review text

Summary: A simple but powerful scheme exploiting the binning concept for asymmetric lossless distributed source coding is proposed. The novelty in the proposed scheme is the introduction of a syndrome former (SF) in the source encoder and an inverse syndrome former (ISF) in the source decoder to efficiently exploit an existing linear channel code without the need to modify the code structure or the decoding strategy. For most channel codes, the construction of SF-ISF pairs is a light task. For parallelly and serially concatenated codes and particularly parallel and serial turbo codes where this appear less obvious, an efficient way for constructing linear complexity SF-ISF pairs is demonstrated. It is shown that the proposed SF-ISF approach is simple, provenly optimal, and generally applicable to any linear channel code. Simulation using conventional and asymmetric turbo codes demonstrates a compression rate that is only 0.06 bit/symbol from the theoretical limit, which is among the best results reported so far.

Recommendations

• A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding
• Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression
• Distributed source coding using syndromes (DISCUS): design and construction
• Approaching the Slepian-Wolf boundary using practical channel codes
• On code design for the Slepian-Wolf problem and lossless multiterminal networks

Cited in

(3)

• Approaching the Slepian-Wolf boundary using practical channel codes
• A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding
• Distributed source coding using syndromes (DISCUS): design and construction

This page was built for publication: An efficient SF-ISF approach for the Slepian-Wolf source coding problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2570525)