An improvement to GMD-like decoding algorithms

Hitoshi Tokushige, Yuansheng Tang, Takuya Koumotq, Tadao Kasami

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

For binary linear block codes, we introduce multiple GMD decoding algorithm. In this algorithm, GMDlike decoding is iterated around a few appropriately selected search centers. The original GMD decoding by Forney [1] 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.

Original languageEnglish
Pages (from-to)1963-1965
Number of pages3
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE83-A
Issue number10
Publication statusPublished - Jan 1 2000
Externally publishedYes

Keywords

  • Binary block codes
  • Early termination conditions
  • Multiple GMD decoding
  • Soft-decision iterative decoding

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'An improvement to GMD-like decoding algorithms'. Together they form a unique fingerprint.

  • Cite this