MAP and LogMAP Decoding Algorithms for Linear Block Codes Using a Code Structure

Yuichi KAJI  Ryujiro SHIBUYA  Toru FUJIWARA  Tadao KASAMI  Shu LIN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E83-A   No.10   pp.1884-1890
Publication Date: 2000/10/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
MAP decoding,  BCJR algorithm,  turbo codes,  trellis diagram,  linear block codes,  

Full Text: PDF>>
Buy this Article

New algorithms for the MAP (also known as the APP) decoding and the MAX-LogMAP decoding of linear block codes are presented. The algorithms are devised based on the structural properties of linear block codes, and succeeds in reducing the decoding complexity without degrading the error performance. The proposed algorithms are suitable for the parallel and pipeline processing which improves the throughput of the decoder. To evaluate the decoding complexity of the proposed algorithms, simulation results for some well-known codes are presented. The results show that the algorithms are especially efficient than the conventional BCJR-based algorithms for codes whose rate are relatively low.