An Improvement to GMD-Like Decoding Algorithms

Hitoshi TOKUSHIGE  Yuansheng TANG  Takuya KOUMOTO  Tadao KASAMI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E83-A   No.10   pp.1963-1965
Publication Date: 2000/10/25
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: 
soft-decision iterative decoding,  multiple GMD decoding,  early termination conditions,  binary block codes,  

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




Summary: 
For binary linear block codes, we introduce "multiple GMD decoding algorithm. " In this algorithm, GMD-like decoding is iterated around a few appropriately selected search centers. The original GMD decoding by Forney is a GMD-like decoding around the hard-decision sequence. Compared with the original GMD decoding, this decoding algorithm provides better error performance with moderate increment of iteration numbers. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.