
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

A CallbyNeed Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code
Toshiyuki ISHIDA Yuichi KAJI
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E86A
No.12
pp.33063309 Publication Date: 2003/12/01 Online ISSN:
DOI: Print ISSN: 09168508 Type of Manuscript: LETTER Category: Information Theory Keyword: LogMAP decoding, linear block codes, BCJR algorithm, trellis diagram, turbo codes,
Full Text: PDF>>
Summary:
A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for lowrate codes, but the complexity grows considerably large for highrate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for highrate codes. The proposed algorithm is more efficient than the BCJR algorithm for wellknown linear block codes.

