A Sufficient Condition for Ruling Out Some Useless Test Error Patterns in Iterative Decoding Algorithms
Summary :
In an iterative decoding algorithm, such as Chase Type-II decoding algorithm and its improvements, candidate codewords for a received vector are generated for test based on a bounded-distance decoder and a set of test error patterns. It is desirable to remove useless test error patterns in these decoding algorithms. This paper presents a sufficient condition for ruling out some useless test error patterns. If this condition holds for a test error patterns e, then e can not produce a candidate codeword with a correlation metric larger than those of the candidate codewords generated already and hence e is useless. This significantly reduces the decoding operations in Chase type-II decoding algorithm or decoding iterations in its improvements.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.2 pp.321-326
- Publication Date
- 1998/02/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Information Theory and Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takuya KOUMOTO, Tadao KASAMI, Shu LIN, "A Sufficient Condition for Ruling Out Some Useless Test Error Patterns in Iterative Decoding Algorithms" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 2, pp. 321-326, February 1998, doi: .
Abstract: In an iterative decoding algorithm, such as Chase Type-II decoding algorithm and its improvements, candidate codewords for a received vector are generated for test based on a bounded-distance decoder and a set of test error patterns. It is desirable to remove useless test error patterns in these decoding algorithms. This paper presents a sufficient condition for ruling out some useless test error patterns. If this condition holds for a test error patterns e, then e can not produce a candidate codeword with a correlation metric larger than those of the candidate codewords generated already and hence e is useless. This significantly reduces the decoding operations in Chase type-II decoding algorithm or decoding iterations in its improvements.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_2_321/_p
Copy
@ARTICLE{e81-a_2_321,
author={Takuya KOUMOTO, Tadao KASAMI, Shu LIN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Sufficient Condition for Ruling Out Some Useless Test Error Patterns in Iterative Decoding Algorithms},
year={1998},
volume={E81-A},
number={2},
pages={321-326},
abstract={In an iterative decoding algorithm, such as Chase Type-II decoding algorithm and its improvements, candidate codewords for a received vector are generated for test based on a bounded-distance decoder and a set of test error patterns. It is desirable to remove useless test error patterns in these decoding algorithms. This paper presents a sufficient condition for ruling out some useless test error patterns. If this condition holds for a test error patterns e, then e can not produce a candidate codeword with a correlation metric larger than those of the candidate codewords generated already and hence e is useless. This significantly reduces the decoding operations in Chase type-II decoding algorithm or decoding iterations in its improvements.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - A Sufficient Condition for Ruling Out Some Useless Test Error Patterns in Iterative Decoding Algorithms
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 321
EP - 326
AU - Takuya KOUMOTO
AU - Tadao KASAMI
AU - Shu LIN
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 1998
AB - In an iterative decoding algorithm, such as Chase Type-II decoding algorithm and its improvements, candidate codewords for a received vector are generated for test based on a bounded-distance decoder and a set of test error patterns. It is desirable to remove useless test error patterns in these decoding algorithms. This paper presents a sufficient condition for ruling out some useless test error patterns. If this condition holds for a test error patterns e, then e can not produce a candidate codeword with a correlation metric larger than those of the candidate codewords generated already and hence e is useless. This significantly reduces the decoding operations in Chase type-II decoding algorithm or decoding iterations in its improvements.
ER -
English
