Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms

Hitoshi TOKUSHIGE; Takuya KOUMOTO; Marc P.C. FOSSORIER; Tadao KASAMI

Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms

Hitoshi TOKUSHIGE, Takuya KOUMOTO, Marc P.C. FOSSORIER, Tadao KASAMI

Full Text Views

0

Share
Cite this

Summary :

We consider a soft-decision iterative bounded distance decoding algorithm for binary linear block codes. In the decoding algorithm, bounded distance decodings are carried out with respect to successive input words, called the search centers. A search center is the sum of the hard-decision sequence of a received sequence and a sequence in a set of test patterns which are generated beforehand. This set of test patterns has influence on the error performance of the decoding algorithms as simulation results show. In this paper, we propose a construction method of a set of candidate test patterns and a selection method of test patterns based on an introduced measure of effectiveness of test patterns. For several BCH codes of lengths 127, 255 and 511, we show the effectiveness of the proposed method by simulation.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.10 pp.2445-2451

Publication Date: 2003/10/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Coding Theory

Cite this

Copy

Hitoshi TOKUSHIGE, Takuya KOUMOTO, Marc P.C. FOSSORIER, Tadao KASAMI, "Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms" in IEICE TRANSACTIONS on Fundamentals, vol. E86-A, no. 10, pp. 2445-2451, October 2003, doi: .
Abstract: We consider a soft-decision iterative bounded distance decoding algorithm for binary linear block codes. In the decoding algorithm, bounded distance decodings are carried out with respect to successive input words, called the search centers. A search center is the sum of the hard-decision sequence of a received sequence and a sequence in a set of test patterns which are generated beforehand. This set of test patterns has influence on the error performance of the decoding algorithms as simulation results show. In this paper, we propose a construction method of a set of candidate test patterns and a selection method of test patterns based on an introduced measure of effectiveness of test patterns. For several BCH codes of lengths 127, 255 and 511, we show the effectiveness of the proposed method by simulation.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e86-a_10_2445/_p

Copy

@ARTICLE{e86-a_10_2445,
author={Hitoshi TOKUSHIGE, Takuya KOUMOTO, Marc P.C. FOSSORIER, Tadao KASAMI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms},
year={2003},
volume={E86-A},
number={10},
pages={2445-2451},
abstract={We consider a soft-decision iterative bounded distance decoding algorithm for binary linear block codes. In the decoding algorithm, bounded distance decodings are carried out with respect to successive input words, called the search centers. A search center is the sum of the hard-decision sequence of a received sequence and a sequence in a set of test patterns which are generated beforehand. This set of test patterns has influence on the error performance of the decoding algorithms as simulation results show. In this paper, we propose a construction method of a set of candidate test patterns and a selection method of test patterns based on an introduced measure of effectiveness of test patterns. For several BCH codes of lengths 127, 255 and 511, we show the effectiveness of the proposed method by simulation.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2445
EP - 2451
AU - Hitoshi TOKUSHIGE
AU - Takuya KOUMOTO
AU - Marc P.C. FOSSORIER
AU - Tadao KASAMI
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2003
AB - We consider a soft-decision iterative bounded distance decoding algorithm for binary linear block codes. In the decoding algorithm, bounded distance decodings are carried out with respect to successive input words, called the search centers. A search center is the sum of the hard-decision sequence of a received sequence and a sequence in a set of test patterns which are generated beforehand. This set of test patterns has influence on the error performance of the decoding algorithms as simulation results show. In this paper, we propose a construction method of a set of candidate test patterns and a selection method of test patterns based on an introduced measure of effectiveness of test patterns. For several BCH codes of lengths 127, 255 and 511, we show the effectiveness of the proposed method by simulation.
ER -