Fast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding
Summary :
We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. In this paper, we propose a new method for reducing the time complexity of generating candidate codewords by storing some already generated candidate codewords. Simulation results show that the increase of memory size is small.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.10 pp.2676-2683
- Publication Date
- 2006/10/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e89-a.10.2676
- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)
- Category
- 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
Hideki YAGI, Toshiyasu MATSUSHIMA, Shigeichi HIRASAWA, "Fast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 10, pp. 2676-2683, October 2006, doi: 10.1093/ietfec/e89-a.10.2676.
Abstract: We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. In this paper, we propose a new method for reducing the time complexity of generating candidate codewords by storing some already generated candidate codewords. Simulation results show that the increase of memory size is small.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.10.2676/_p
Copy
@ARTICLE{e89-a_10_2676,
author={Hideki YAGI, Toshiyasu MATSUSHIMA, Shigeichi HIRASAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding},
year={2006},
volume={E89-A},
number={10},
pages={2676-2683},
abstract={We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. In this paper, we propose a new method for reducing the time complexity of generating candidate codewords by storing some already generated candidate codewords. Simulation results show that the increase of memory size is small.},
keywords={},
doi={10.1093/ietfec/e89-a.10.2676},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - Fast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2676
EP - 2683
AU - Hideki YAGI
AU - Toshiyasu MATSUSHIMA
AU - Shigeichi HIRASAWA
PY - 2006
DO - 10.1093/ietfec/e89-a.10.2676
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2006
AB - We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. In this paper, we propose a new method for reducing the time complexity of generating candidate codewords by storing some already generated candidate codewords. Simulation results show that the increase of memory size is small.
ER -
English
