A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes

Takuya Kusaka, Toyoo Takata, Tadao Kasami, Shu Lin

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper presents a new low-weight trellis-based softdecision iterative decoding algorithm for binary linear block codes. The algorithm is devised based on a set of optimality conditions and the generation of a sequence of candidate codewords for an optimality test. The initial candidate codeword is generated by a simple decoding method. The subsequent candidate codewords, if needed, are generated by a chain of low-weight trellis searches, one at a time. Each search is conducted through a low-weight trellis diagram centered around the latest candidate codeword and results in an improvement over the previous candidate codewords that have been already tested. This improvement is then used as the next candidate codeword for a test of optimality. The decoding iteration stops whenever a candidate codeword is found to satisfy a sufficient condition on optimality or the latest low-weight trellis search results in a repetition of a previously generated candidate codeword. A divide-and-conquer technique is also presented for codes that are not spanned by their minimum-weight codewords. The proposed decoding algorithm has been applied to some well-known codes of lengths 48, 64, and 128. Simulation results show that the proposed algorithm achieves either practically optimal error performance for the example codes of length 48 and 64 or near optimal error performance for the (128, 29, 32) RM code with a significant reduction in computational decoding complexity.

Original languageEnglish
Pages (from-to)731-741
Number of pages11
JournalIEEE Transactions on Information Theory
Volume45
Issue number2
DOIs
Publication statusPublished - 1999
Externally publishedYes

Fingerprint

Block codes
Decoding
candidacy
Iterative decoding
performance
simulation

Keywords

  • Iterative decoding
  • Low-weight subtrellis
  • Optimality

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Information Systems

Cite this

A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes. / Kusaka, Takuya; Takata, Toyoo; Kasami, Tadao; Lin, Shu.

In: IEEE Transactions on Information Theory, Vol. 45, No. 2, 1999, p. 731-741.

Research output: Contribution to journalArticle

@article{0f92b87c63cb44838e663f75e607f4c0,
title = "A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes",
abstract = "This paper presents a new low-weight trellis-based softdecision iterative decoding algorithm for binary linear block codes. The algorithm is devised based on a set of optimality conditions and the generation of a sequence of candidate codewords for an optimality test. The initial candidate codeword is generated by a simple decoding method. The subsequent candidate codewords, if needed, are generated by a chain of low-weight trellis searches, one at a time. Each search is conducted through a low-weight trellis diagram centered around the latest candidate codeword and results in an improvement over the previous candidate codewords that have been already tested. This improvement is then used as the next candidate codeword for a test of optimality. The decoding iteration stops whenever a candidate codeword is found to satisfy a sufficient condition on optimality or the latest low-weight trellis search results in a repetition of a previously generated candidate codeword. A divide-and-conquer technique is also presented for codes that are not spanned by their minimum-weight codewords. The proposed decoding algorithm has been applied to some well-known codes of lengths 48, 64, and 128. Simulation results show that the proposed algorithm achieves either practically optimal error performance for the example codes of length 48 and 64 or near optimal error performance for the (128, 29, 32) RM code with a significant reduction in computational decoding complexity.",
keywords = "Iterative decoding, Low-weight subtrellis, Optimality",
author = "Takuya Kusaka and Toyoo Takata and Tadao Kasami and Shu Lin",
year = "1999",
doi = "10.1109/18.749023",
language = "English",
volume = "45",
pages = "731--741",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes

AU - Kusaka, Takuya

AU - Takata, Toyoo

AU - Kasami, Tadao

AU - Lin, Shu

PY - 1999

Y1 - 1999

N2 - This paper presents a new low-weight trellis-based softdecision iterative decoding algorithm for binary linear block codes. The algorithm is devised based on a set of optimality conditions and the generation of a sequence of candidate codewords for an optimality test. The initial candidate codeword is generated by a simple decoding method. The subsequent candidate codewords, if needed, are generated by a chain of low-weight trellis searches, one at a time. Each search is conducted through a low-weight trellis diagram centered around the latest candidate codeword and results in an improvement over the previous candidate codewords that have been already tested. This improvement is then used as the next candidate codeword for a test of optimality. The decoding iteration stops whenever a candidate codeword is found to satisfy a sufficient condition on optimality or the latest low-weight trellis search results in a repetition of a previously generated candidate codeword. A divide-and-conquer technique is also presented for codes that are not spanned by their minimum-weight codewords. The proposed decoding algorithm has been applied to some well-known codes of lengths 48, 64, and 128. Simulation results show that the proposed algorithm achieves either practically optimal error performance for the example codes of length 48 and 64 or near optimal error performance for the (128, 29, 32) RM code with a significant reduction in computational decoding complexity.

AB - This paper presents a new low-weight trellis-based softdecision iterative decoding algorithm for binary linear block codes. The algorithm is devised based on a set of optimality conditions and the generation of a sequence of candidate codewords for an optimality test. The initial candidate codeword is generated by a simple decoding method. The subsequent candidate codewords, if needed, are generated by a chain of low-weight trellis searches, one at a time. Each search is conducted through a low-weight trellis diagram centered around the latest candidate codeword and results in an improvement over the previous candidate codewords that have been already tested. This improvement is then used as the next candidate codeword for a test of optimality. The decoding iteration stops whenever a candidate codeword is found to satisfy a sufficient condition on optimality or the latest low-weight trellis search results in a repetition of a previously generated candidate codeword. A divide-and-conquer technique is also presented for codes that are not spanned by their minimum-weight codewords. The proposed decoding algorithm has been applied to some well-known codes of lengths 48, 64, and 128. Simulation results show that the proposed algorithm achieves either practically optimal error performance for the example codes of length 48 and 64 or near optimal error performance for the (128, 29, 32) RM code with a significant reduction in computational decoding complexity.

KW - Iterative decoding

KW - Low-weight subtrellis

KW - Optimality

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

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

U2 - 10.1109/18.749023

DO - 10.1109/18.749023

M3 - Article

VL - 45

SP - 731

EP - 741

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 2

ER -