Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms

Hitoshi TOKUSHIGE  Takuya KOUMOTO  Marc P.C. FOSSORIER  Tadao KASAMI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E86-A   No.10   pp.2445-2451
Publication Date: 2003/10/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
soft-decision decoding,  iterative decoding,  algebraic decoding,  BCH code,  covering code,  

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




Summary: 
We consider a soft-decision iterative bounded distance decoding algorithm for binary linear block codes. In the decoding algorithm, bounded distance decodings are carried out with respect to successive input words, called the search centers. A search center is the sum of the hard-decision sequence of a received sequence and a sequence in a set of test patterns which are generated beforehand. This set of test patterns has influence on the error performance of the decoding algorithms as simulation results show. In this paper, we propose a construction method of a set of candidate test patterns and a selection method of test patterns based on an introduced measure of effectiveness of test patterns. For several BCH codes of lengths 127, 255 and 511, we show the effectiveness of the proposed method by simulation.