IEICE TRANSACTIONS on Fundamentals
A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding
Summary :
The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. Based on the decoding algorithms both of Battail and Fang and of its generalized version suggested by Valembois and Fossorier, we propose a new method for reducing the space complexity of the heuristic search methods for MLD including the well-known decoding algorithm of Han et al. If the heuristic function satisfies a certain condition, the proposed method guarantees to reduce the space complexity of both the Battail-Fang and Han et al. decoding algorithms. Simulation results show the high efficiency of the proposed method.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.10 pp.2721-2733
- Publication Date
- 2005/10/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.10.2721
- Type of Manuscript
- Special Section PAPER (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, "A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 10, pp. 2721-2733, October 2005, doi: 10.1093/ietfec/e88-a.10.2721.
Abstract: The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. Based on the decoding algorithms both of Battail and Fang and of its generalized version suggested by Valembois and Fossorier, we propose a new method for reducing the space complexity of the heuristic search methods for MLD including the well-known decoding algorithm of Han et al. If the heuristic function satisfies a certain condition, the proposed method guarantees to reduce the space complexity of both the Battail-Fang and Han et al. decoding algorithms. Simulation results show the high efficiency of the proposed method.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.10.2721/_p
Copy
@ARTICLE{e88-a_10_2721,
author={Hideki YAGI, Toshiyasu MATSUSHIMA, Shigeichi HIRASAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding},
year={2005},
volume={E88-A},
number={10},
pages={2721-2733},
abstract={The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. Based on the decoding algorithms both of Battail and Fang and of its generalized version suggested by Valembois and Fossorier, we propose a new method for reducing the space complexity of the heuristic search methods for MLD including the well-known decoding algorithm of Han et al. If the heuristic function satisfies a certain condition, the proposed method guarantees to reduce the space complexity of both the Battail-Fang and Han et al. decoding algorithms. Simulation results show the high efficiency of the proposed method.},
keywords={},
doi={10.1093/ietfec/e88-a.10.2721},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2721
EP - 2733
AU - Hideki YAGI
AU - Toshiyasu MATSUSHIMA
AU - Shigeichi HIRASAWA
PY - 2005
DO - 10.1093/ietfec/e88-a.10.2721
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2005
AB - The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. Based on the decoding algorithms both of Battail and Fang and of its generalized version suggested by Valembois and Fossorier, we propose a new method for reducing the space complexity of the heuristic search methods for MLD including the well-known decoding algorithm of Han et al. If the heuristic function satisfies a certain condition, the proposed method guarantees to reduce the space complexity of both the Battail-Fang and Han et al. decoding algorithms. Simulation results show the high efficiency of the proposed method.
ER -
English
