Density evolution for the simultaneous decoding of LDPC-based slepian-wolf source codes

Author

Eckford, Andrew W. ; Yu, Wei

Author_Institution

E. S. Rogers Sr. Dept. of Electr. & Comput. Eng., Toronto Univ., Ont.

fYear

2005

fDate

4-9 Sept. 2005

Firstpage

1401

Lastpage

1405

Abstract

This paper deals with the design and analysis of low-density parity-check (LDPC) codes for the Slepian-Wolf problem. The main contribution is a code design method based on a density evolution (DE) analysis for the cases where multiple LDPC codes are simultaneously decoded at the decoder. Good source codes are designed both for memoryless sources and sources with Markov memory. Further, simultaneous decoding is generalized to the case of source splitting, which allows non-corner points of the Slepian-Wolf region to be achieved even for sources with equiprobable marginal distributions

Keywords

Markov processes; decoding; memoryless systems; parity check codes; source coding; LDPC code; Markov memory; Slepian-Wolf source codes; density evolution analysis; low-density parity-check codes; memoryless sources; simultaneous decoding; source splitting; Algorithm design and analysis; Channel coding; Decoding; Design engineering; Design methodology; Educational institutions; Parity check codes; Source coding; Strontium; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on

Conference_Location

Adelaide, SA

Print_ISBN

0-7803-9151-9

Type

conf

DOI

10.1109/ISIT.2005.1523573

Filename

1523573