DocumentCode
1246458
Title
Shuffled iterative decoding
Author
Zhang, Juntan ; Fossorier, Marc P C
Author_Institution
Dept. of Electr. Eng., Univ. of Hawaii, Honolulu, HI, USA
Volume
53
Issue
2
fYear
2005
Firstpage
209
Lastpage
213
Abstract
Shuffled versions of iterative decoding of low-density parity-check codes and turbo codes are presented. The proposed schemes have about the same computational complexity as the standard versions, and converge faster. Simulations show that the new schedules offer better performance/complexity tradeoffs, especially when the maximum number of iterations has to remain small.
Keywords
computational complexity; iterative decoding; parity check codes; scheduling; turbo codes; belief propagation; computational complexity; low-density parity-check code; scheduling; shuffled iterative decoding; turbo code; AWGN; Belief propagation; Code standards; Computational complexity; Computational modeling; Iterative decoding; Parity check codes; Processor scheduling; Turbo codes; Very large scale integration; Belief propagation (BP); iterative decoding; low-density parity-check (LDPC) codes; scheduling; turbo codes;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2004.841982
Filename
1402639
Link To Document