DocumentCode
2281180
Title
A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding
Author
Hu, Ruiyuan ; Viswanathan, Ramesh ; Li, Jing Tiffany
Author_Institution
Electr. & Comput. Eng. Dept., Lehigh Univ., Bethlehem, PA, USA
Volume
1
fYear
2004
fDate
29 Nov.-3 Dec. 2004
Firstpage
51
Abstract
A new scheme for solving the Slepian-Wolf problem over noisy channels using serially concatenated codes is proposed. An outer low density parity check code is used to perform distributed source coding, and an inner convolutional code adds error protecting capability to the compressed data. A soft iterative joint source-channel decoder is performed, where the decoder side information is provided to the sub outer decoder instead of the sub inner decoder. The scheme is attractive since separate refining of compression rate (outer code) and error protection power (inner code) makes the design easy and the performance controllable, and joint iterative decoding exploits the power of the serial concatenated structure as much as possible. Simulations reveal encouraging joint decoding gain especially at low signal-to-noise ratios.
Keywords
combined source-channel coding; concatenated codes; convolutional codes; error correction codes; iterative decoding; parity check codes; compressed data; compression rate; decoding gain; distributed source coding; error protection power; inner convolutional code; joint decoding; joint source-channel decoder; noisy-channel Slepian-Wolf problem; outer low density parity check code; serially concatenated codes; signal-to-noise ratios; soft iterative decoder; sub outer decoder; Channel coding; Concatenated codes; Convolutional codes; Design engineering; Error correction codes; Iterative decoding; Parity check codes; Protection; Source coding; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE
Print_ISBN
0-7803-8794-5
Type
conf
DOI
10.1109/GLOCOM.2004.1377911
Filename
1377911
Link To Document