DocumentCode
2055946
Title
Soft-decision decoding of linear block codes using preprocessing
Author
Wu, Yingquan ; Koetter, Ralf ; Hadjicostis, Christoforos
Author_Institution
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
259
Abstract
In this paper, two universally applicable preprocessing rules are developed to improve iterative receding algorithms that utilize the most reliable basis (MRB), while focusing on order-w reprocessing. Simulation results show that the proposed algorithm successfully decodes the Reed-Solomon concatenated code in near optimal manner at a block-error-rate with the maximum number of candidate codewords.
Keywords
Reed-Solomon codes; block codes; error statistics; iterative decoding; linear codes; Reed-Solomon concatenated code; block-error-rate; candidate codewords; iterative receding algorithms; linear block codes; soft-decision decoding; universally applicable preprocessing rules; Binary phase shift keying; Block codes; Error correction; Hamming distance; Iterative algorithms; Iterative decoding; Memoryless systems; Modulation coding; Redundancy; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365298
Filename
1365298
Link To Document