Sufficient conditions for ruling-out useless iterative steps in a class of iterative decoding algorithms

Tadao Kasami, Yuansheng Tang, Takuya Koumoto, Toru Fujiwara

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


In this paper, we consider sufficient conditions for ruling out some useless iteration steps in a class of soft-decision iterative decoding algorithms for binary block codes used over the AWGN channel using BPSK signaling. Sufficient conditions for ruling out the next single decoding step, called ruling-out conditions and those for ruling out all the subsequent iteration steps, called early termination conditions, are formulated in a unified way without degradation of error performance. These conditions are shown to be a type of integer programming problems. Several techniques for reducing such an integer programming problem to a set of subprograms with smaller computational complexities are presented. As an example, an early termination condition for Chase-type decoding algorithm is presented. Simulation results for the (64, 42, 8) Reed-Muller code and (64, 45, 8) extended BCH code show that the early termination condition combined with a ruling-out condition proposed previously is considerably effective in reducing the number of test error patterns, especially as the total number of test error patterns concerned grows.

Original languageEnglish
Pages (from-to)2061-2072
Number of pages12
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number10
Publication statusPublished - Jan 1 1999
Externally publishedYes


  • Binary block codes
  • Early termination conditions
  • Iterative decoding
  • Ruling-out conditions
  • Soft-decision

ASJC Scopus subject areas

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


Dive into the research topics of 'Sufficient conditions for ruling-out useless iterative steps in a class of iterative decoding algorithms'. Together they form a unique fingerprint.

Cite this