Least stringent sufficient condition on the optimality of suboptimally decoded codewords

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

Research output: Contribution to conferencePaper

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
Number of pages1
Publication statusPublished - Jan 1 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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Least stringent sufficient condition on the optimality of suboptimally decoded codewords'. Together they form a unique fingerprint.

  • Cite this

    Kasami, T., Koumoto, T., Takata, T., Fujiwara, T., & Lin, S. (1995). Least stringent sufficient condition on the optimality of suboptimally decoded codewords. Paper presented at Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, BC, Can, .