Least stringent sufficient condition on the optimality of suboptimally decoded codewords

Tadao Kasami, Takuya Kusaka, Toyoo Takata, Toru Fujiwara, Shu Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

The number of iterations of an iterative optimal or suboptimal decoding scheme for binary linear block codes without any effect on its error performance can be reduced by testing a sufficient condition on the optimality of a candidate codeword. In this paper, the least stringent sufficient condition on the optimality of a decoded codeword is investigated under the assumption that the available information on the code is restricted to the minimum weight or the distance profile and for a given positive integer h, h or fewer already generated candidate codewords. The least stringent sufficient conditions of optimality for 1 ≤ h ≤ 3 are presented. As examples, the Chase Algorithm (Chase, 1972) and two iterative decoding algorithms (from Kasami et al., 1995) are considered. Majority-logic decoding with randomly breaking ties is used to generate candidate codewords. The effectiveness of Condh for 1 ≤ h ≤ 3 is evaluated by simulation.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE
Pages470
Number of pages1
Publication statusPublished - 1995
Externally publishedYes
EventProceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can
Duration: Sep 17 1995Sep 22 1995

Other

OtherProceedings of the 1995 IEEE International Symposium on Information Theory
CityWhistler, BC, Can
Period9/17/959/22/95

Fingerprint

Decoding
Optimality
Majority logic
Iterative decoding
Sufficient Conditions
Block codes
Iterative Decoding
Block Codes
Linear Codes
Tie
Testing
Logic
Binary
Iteration
Integer
Simulation
Profile

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Applied Mathematics
  • Modelling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Kasami, T., Kusaka, T., Takata, T., Fujiwara, T., & Lin, S. (1995). Least stringent sufficient condition on the optimality of suboptimally decoded codewords. In IEEE International Symposium on Information Theory - Proceedings (pp. 470). IEEE.

Least stringent sufficient condition on the optimality of suboptimally decoded codewords. / Kasami, Tadao; Kusaka, Takuya; Takata, Toyoo; Fujiwara, Toru; Lin, Shu.

IEEE International Symposium on Information Theory - Proceedings. IEEE, 1995. p. 470.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kasami, T, Kusaka, T, Takata, T, Fujiwara, T & Lin, S 1995, Least stringent sufficient condition on the optimality of suboptimally decoded codewords. in IEEE International Symposium on Information Theory - Proceedings. IEEE, pp. 470, Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, BC, Can, 9/17/95.
Kasami T, Kusaka T, Takata T, Fujiwara T, Lin S. Least stringent sufficient condition on the optimality of suboptimally decoded codewords. In IEEE International Symposium on Information Theory - Proceedings. IEEE. 1995. p. 470
Kasami, Tadao ; Kusaka, Takuya ; Takata, Toyoo ; Fujiwara, Toru ; Lin, Shu. / Least stringent sufficient condition on the optimality of suboptimally decoded codewords. IEEE International Symposium on Information Theory - Proceedings. IEEE, 1995. pp. 470
@inproceedings{c08b82cfd31d4570929c86782d38e1de,
title = "Least stringent sufficient condition on the optimality of suboptimally decoded codewords",
abstract = "The number of iterations of an iterative optimal or suboptimal decoding scheme for binary linear block codes without any effect on its error performance can be reduced by testing a sufficient condition on the optimality of a candidate codeword. In this paper, the least stringent sufficient condition on the optimality of a decoded codeword is investigated under the assumption that the available information on the code is restricted to the minimum weight or the distance profile and for a given positive integer h, h or fewer already generated candidate codewords. The least stringent sufficient conditions of optimality for 1 ≤ h ≤ 3 are presented. As examples, the Chase Algorithm (Chase, 1972) and two iterative decoding algorithms (from Kasami et al., 1995) are considered. Majority-logic decoding with randomly breaking ties is used to generate candidate codewords. The effectiveness of Condh for 1 ≤ h ≤ 3 is evaluated by simulation.",
author = "Tadao Kasami and Takuya Kusaka and Toyoo Takata and Toru Fujiwara and Shu Lin",
year = "1995",
language = "English",
pages = "470",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Least stringent sufficient condition on the optimality of suboptimally decoded codewords

AU - Kasami, Tadao

AU - Kusaka, Takuya

AU - Takata, Toyoo

AU - Fujiwara, Toru

AU - Lin, Shu

PY - 1995

Y1 - 1995

N2 - The number of iterations of an iterative optimal or suboptimal decoding scheme for binary linear block codes without any effect on its error performance can be reduced by testing a sufficient condition on the optimality of a candidate codeword. In this paper, the least stringent sufficient condition on the optimality of a decoded codeword is investigated under the assumption that the available information on the code is restricted to the minimum weight or the distance profile and for a given positive integer h, h or fewer already generated candidate codewords. The least stringent sufficient conditions of optimality for 1 ≤ h ≤ 3 are presented. As examples, the Chase Algorithm (Chase, 1972) and two iterative decoding algorithms (from Kasami et al., 1995) are considered. Majority-logic decoding with randomly breaking ties is used to generate candidate codewords. The effectiveness of Condh for 1 ≤ h ≤ 3 is evaluated by simulation.

AB - The number of iterations of an iterative optimal or suboptimal decoding scheme for binary linear block codes without any effect on its error performance can be reduced by testing a sufficient condition on the optimality of a candidate codeword. In this paper, the least stringent sufficient condition on the optimality of a decoded codeword is investigated under the assumption that the available information on the code is restricted to the minimum weight or the distance profile and for a given positive integer h, h or fewer already generated candidate codewords. The least stringent sufficient conditions of optimality for 1 ≤ h ≤ 3 are presented. As examples, the Chase Algorithm (Chase, 1972) and two iterative decoding algorithms (from Kasami et al., 1995) are considered. Majority-logic decoding with randomly breaking ties is used to generate candidate codewords. The effectiveness of Condh for 1 ≤ h ≤ 3 is evaluated by simulation.

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

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

M3 - Conference contribution

SP - 470

BT - IEEE International Symposium on Information Theory - Proceedings

PB - IEEE

ER -