Selection of search centers in iterative soft-decision decoding algorithms

Hitoshi Tokushige, Kentaro Nakamaye, Takuya Koumoto, Yuansheng Tang, Tadao Kasami

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)2397-2403
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number10
Publication statusPublished - Oct 2001
Externally publishedYes


  • BCH code
  • Bounded-distance decoding
  • Iterative decoding
  • Soft-decision decoding

ASJC Scopus subject areas

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


Dive into the research topics of 'Selection of search centers in iterative soft-decision decoding algorithms'. Together they form a unique fingerprint.

Cite this