DocumentCode
3279796
Title
An improved search algorithm for the adaptive and recursive MLD algorithm
Author
Kaji, Yuichi ; Tokushige, Hitoshi ; Kasami, Tadao
Author_Institution
Nara Inst. of Sci. & Technol., Japan
fYear
2001
fDate
2001
Firstpage
334
Abstract
An efficient algorithm for the soft-decision maximum likelihood decoding of linear block codes is presented. The algorithm makes use of the structural properties of linear block codes, and a call-by-need computing strategy to reduce the time and space complexity
Keywords
adaptive decoding; binary codes; block codes; computational complexity; linear codes; maximum likelihood decoding; search problems; adaptive MLD algorithm; binary linear block codes; efficient algorithm; recursive MLD algorithm; search algorithm; soft-decision maximum likelihood decoding; space complexity reduction; structural properties; time complexity reduction; Block codes; Error correction codes; Linear code; Maximum likelihood decoding; Vectors; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location
Washington, DC
Print_ISBN
0-7803-7123-2
Type
conf
DOI
10.1109/ISIT.2001.936197
Filename
936197
Link To Document