Least stringent sufficient condition on the optimality of suboptimally decoded codewords

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

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 conference › Paper › peer-review

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 Cond_h for 1 ≤ h ≤ 3 is evaluated by simulation.

Original language	English
Pages	470
Number of pages	1
Publication status	Published - 1995
Externally published	Yes
Event	Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: Sep 17 1995 → Sep 22 1995

Other

Other	Proceedings of the 1995 IEEE International Symposium on Information Theory
City	Whistler, BC, Can
Period	9/17/95 → 9/22/95

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Cite this

@conference{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 Koumoto and Toyoo Takata and Toru Fujiwara and Shu Lin",

year = "1995",

language = "English",

pages = "470",

note = "Proceedings of the 1995 IEEE International Symposium on Information Theory ; Conference date: 17-09-1995 Through 22-09-1995",

}

TY - CONF

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

AU - Kasami, Tadao

AU - Koumoto, 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 - Paper

AN - SCOPUS:0029179920

SP - 470

T2 - Proceedings of the 1995 IEEE International Symposium on Information Theory

Y2 - 17 September 1995 through 22 September 1995

ER -

Least stringent sufficient condition on the optimality of suboptimally decoded codewords

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this