Iterative Decoding With Replicas

Author

Zhang, Juntan ; Wang, Yige ; Fossorier, Marc P C ; Yedidia, Jonathan S.

Author_Institution

Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI

Volume

53

Issue

5

fYear

2007

fDate

5/1/2007 12:00:00 AM

Firstpage

1644

Lastpage

1663

Abstract

Replica shuffled versions of iterative decoders for low-density parity-check (LDPC) codes and turbo codes are presented. The proposed schemes can converge faster than standard and plain shuffled approaches. Two methods, density evolution and extrinsic information transfer (EXIT) charts, are used to analyze the performance of the proposed algorithms. Both theoretical analysis and simulations show that the new schedules offer good tradeoffs with respect to performance, complexity, latency, and connectivity

Keywords

iterative decoding; parity check codes; turbo codes; EXIT; LDPC; density evolution; extrinsic information transfer charts; iterative decoder; low-density parity-check code; replicas; turbo code; Algorithm design and analysis; Analytical models; Code standards; Convergence; Information analysis; Iterative algorithms; Iterative decoding; Parity check codes; Performance analysis; Turbo codes; Belief propagation decoding; density evolution; extrinsic information transfer (EXIT) charts; low-density parity-check (LDPC) codes; turbo codes;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2007.894683

Filename

4167737