DocumentCode
2058564
Title
Reduced complexity decoding algorithms for linear block codes
Author
Ponnampalam, Vishakan ; Evans, Jamie ; Vucetic, Branka
Author_Institution
Sch. of Electr. & Inf. Eng., Sydney Univ., NSW, Australia
fYear
2002
fDate
2002
Firstpage
314
Abstract
We present an efficient soft decision maximum likelihood decoding algorithm for linear binary block codes. As in the Chase algorithms, test error patterns are generated, added to the received sequence and decoded, using a hard decision decoder. However, the set of test error sequences is adaptively chosen. This significantly reduces decoding complexity. Furthermore a sub-optimal decoding algorithm is developed by introducing constraints on the set of test error patterns used.
Keywords
binary codes; block codes; computational complexity; linear codes; maximum likelihood decoding; Chase algorithms; binary block codes; hard decision decoder; linear block codes; maximum likelihood decoding; reduced complexity decoding algorithms; soft decision decoding; sub-optimal decoding algorithm; test error patterns; Australia; Bit error rate; Block codes; Hamming weight; Maximum likelihood decoding; Test pattern generators; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023586
Filename
1023586
Link To Document