DocumentCode
2391951
Title
An efficient MAP decoding algorithm using a section trellis diagram
Author
Shibuya, Ryujiro ; Kaji, Yuichi ; Kasami, Tadao
Author_Institution
Nara Inst. of Sci. & Technol., Japan
fYear
2000
fDate
2000
Firstpage
424
Abstract
An efficient algorithm for the MAP decoding is presented. The proposed algorithm is a hybrid of the conventional BCJR algorithm and the recursive-MAP (r-MAP) algorithm which has been proposed by the authors. The r-MAP algorithm uses structural properties of linear codes to reduce the decoding complexity, but does not work well for high-rate codes. The proposed algorithm overcomes this defect, and achieves smaller decoding complexity than BCJR and r-MAP algorithms for any code
Keywords
binary codes; computational complexity; linear codes; maximum likelihood decoding; trellis codes; BCJR algorithm; decoding complexity; efficient MAP decoding algorithm; high-rate codes; linear codes; r-MAP algorithm; recursive-MAP Algorithm; section trellis diagram; structural properties; Algorithm design and analysis; Decoding; Linear code; Switches; Turbo codes; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866722
Filename
866722
Link To Document