Selection of Search Centers in Iterative Soft-Decision Decoding Algorithms

Hitoshi TOKUSHIGE  Kentaro NAKAMAYE  Takuya KOUMOTO  Yuansheng TANG  Tadao KASAMI  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E84-A   No.10   pp.2397-2403
Publication Date: 2001/10/01
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
iterative decoding,  bounded-distance decoding,  soft decision decoding,  BCH code,  

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

We consider iterative soft-decision decoding algorithms in which bounded distance decodings are carried out with respect to successively selected input words, called search centers. Their error performances are degraded by the decoding failure of bounded distance decoding and the duplication in generating candidate codewords. To avoid those weak points, we present a new method of selecting sequences of search centers. For some BCH codes, we show the effectiveness by simulation results.