DocumentCode
1031005
Title
Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks
Author
Radosavljevic, Branko ; Arikan, Erdal ; Hajek, Bruce
Author_Institution
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
Volume
38
Issue
6
fYear
1992
fDate
11/1/1992 12:00:00 AM
Firstpage
1833
Lastpage
1839
Abstract
Decoding algorithms in which unpruned codeword trees are generated from an ordered list of parity checks are investigated. The order is computed from the received message, and low-density parity-check codes are used to help control the growth of the tree. Simulation results are given for the binary erasure channel. They suggest that for the small erasure probability, the method is computationally feasible at rates above the computational cutoff rate
Keywords
block codes; decoding; error correction codes; trees (mathematics); adaptive reordering; binary erasure channel; computational cutoff rate; linear block codes; low-density parity-check codes; parity checks; sequential decoding; small erasure probability; unpruned codeword trees; Computational modeling; Decoding; Frequency; Information theory; Notice of Violation; Parity check codes; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.165462
Filename
165462
Link To Document