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

Tadao Kasami, Yuansheng Tang, Takuya Kusaka, Toru Fujiwara

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

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
VolumeE82-A
Issue number10
Publication statusPublished - 1999
Externally publishedYes

Fingerprint

Iterative Decoding
Iterative decoding
Integer programming
Early Termination
Decoding
Sufficient Conditions
Block codes
Integer Programming
Computational complexity
BCH Codes
Reed-Muller Codes
Iteration
Degradation
Block Codes
Binary Code
Class
Computational Complexity
Simulation

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

Sufficient conditions for ruling-out useless iterative steps in a class of iterative decoding algorithms. / Kasami, Tadao; Tang, Yuansheng; Kusaka, Takuya; Fujiwara, Toru.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E82-A, No. 10, 1999, p. 2061-2072.

Research output: Contribution to journalArticle

@article{04f917f9356a49a09a900273c7ca292e,
title = "Sufficient conditions for ruling-out useless iterative steps in a class of iterative decoding algorithms",
abstract = "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.",
keywords = "Binary block codes, Early termination conditions, Iterative decoding, Ruling-out conditions, Soft-decision",
author = "Tadao Kasami and Yuansheng Tang and Takuya Kusaka and Toru Fujiwara",
year = "1999",
language = "English",
volume = "E82-A",
pages = "2061--2072",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "10",

}

TY - JOUR

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

AU - Kasami, Tadao

AU - Tang, Yuansheng

AU - Kusaka, Takuya

AU - Fujiwara, Toru

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

KW - Binary block codes

KW - Early termination conditions

KW - Iterative decoding

KW - Ruling-out conditions

KW - Soft-decision

UR - http://www.scopus.com/inward/record.url?scp=33746797407&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746797407&partnerID=8YFLogxK

M3 - Article

VL - E82-A

SP - 2061

EP - 2072

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 10

ER -