DocumentCode
1324398
Title
Chase-type and GMD coset decodings
Author
Fossorier, Marc P C ; Lin, Shu
Author_Institution
Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA
Volume
48
Issue
3
fYear
2000
fDate
3/1/2000 12:00:00 AM
Firstpage
345
Lastpage
350
Abstract
In this letter, Chase decoding algorithms are generalized into a family of bounded distance decoding algorithms, so that the conventional Chase algorithm-2 and Chase algorithm-3 become the two extremes of this family. Consequently, more flexibility in the tradeoffs between error performance and decoding complexity is provided by this generalization, especially for codes with large minimum distance. Finally this approach is extended to decoding with erasures
Keywords
codes; computational complexity; decoding; Chase algorithm-2; Chase algorithm-3; Chase decoding algorithms; Chase-type decodings; GMD coset decodings; bounded distance decoding algorithms; decoding complexity; erasures; error performance; generalization; generalized minimum distance decoding; large minimum distance codes; AWGN; Additive white noise; Binary phase shift keying; Block codes; Communications Society; Hamming distance; Iterative algorithms; Iterative decoding; Performance evaluation; Testing;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.837034
Filename
837034
Link To Document