Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search

Jun ASATANI  Takuya KOUMOTO  Kenichi TOMITA  Tadao KASAMI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E86-A   No.10   pp.2596-2600
Publication Date: 2003/10/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
minimum distance search,  near optimality condition,  Reed-Muller code,  iterative decoding,  

Full Text: PDF(558.1KB)>>
Buy this Article




Summary: 
In this letter, we propose (1) a new sub-optimum minimum distance search (sub-MDS), whose search complexity is reduced considerably compared with optimum MDSs and (2) a termination criterion, called near optimality condition, to reduce the average number of decoding iterations with little degradation of error performance for the proposed decoding using sub-MDS iteratively. Consequently, the decoding algorithm can be applied to longer codes with feasible complexity. Simulation results for several Reed-Muller (RM) codes of lengths 256 and 512 are given.