Abstract
Based on the original recursive MLD algorithm (RMLD), “top-down RMLD” has been proposed to reduce the average decoding complexity by a lazy evaluation strategy. In this paper, a revised version of top-down RMLD, called adaptive RMLD, is surveyed. In the adaptive RMLD, the coarsest parallel concatenation decomposition is adopted as the basis of recursion, and a new sufficient condition that a currently best candidate is the optimum at the current level of recursion is used as an early termination condition of the recursion. Preliminary simulation results for the (128, 64) Reed-Muller code are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Y.S. Han, C.R.P. Hartmann, and C.-C. Chen, “Efficient priority first search maximum-likelihood soft-decision decoding of linear block codes,” IEEE Trans. Inform. Theory vol. 39, pp. 1514–1523, Sept. 1993.
T. Kaneko, T. Nishijima, H. Inazumi, and S. Hirasawa, “An efficient maximum-likelihood decoding algorithm for linear block codes with algebraic decoder,” IEEE Trans. Inform. Theory vol. 40, pp. 320–327, Mar. 1994.
T. Fujiwara, H. Yamamoto, T. Kasami and S. Lin, “A trellis-based recursive maximum likelihood decoding algorithm for linear codes,” IEEE Trans. Inform. Theory vol. 44, pp. 714–729, Mar. 1998.
Y. Kaji, T. Fujiwara and T. Kasami, “An efficient call-by-need algorithm for the maximum likelihood decoding of a linear code,” 2000 International Symposium on Information Theory and Its Applications pp. 335–338, Honolulu, HI, Nov. 2000.
A. Lafourcade and A. Vardy, “Optimum sectionalization of a trellis,” IEEE Trans. Inform. Theory vol. 42, pp. 689–703, May 1996.
T. Kasami, H. Tokushige, T. Fujiwara, H. Yamamoto and S. Lin, “A recursive maximum likelihood decoding algorithm for some transitive invariant binary block codes,” IEICE Trans. Fundamentals vol. E81-A, pp. 1916–1924, Sept. 1998.
T. Koumoto, and T. Kasami, “Top-down recursive maximum likelihood decoding using ordered statistics information for half rate codes,” Technical Report of IEICE, IT2002–29, The Institute of Electronics, Information and Communication Engineers, pp. 13–18, Japan, Sept. 2002.
T. Koumoto and T. Kasami, “Top-down recursive maximum likelihood decoding using ordered statistics information,” Proc of the IEEE Inform. Theory Workshop pp. 202, Bangalore, India, Oct. 2002.
M.P.C. Fossorier and S. Lin, “Soft-decision decoding of linear block codes based on ordered statistics,” IEEE Trans. Inform. Theory vol. 41, pp. 1379–1396, Sept. 1995.
S. Lin, T. Kasami, T. Fujiwara and M. Fossorier, “Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes,” Kluwer Academic Publishers Norwell, MA, 1998.
T. Kasami, T. Fujiwara, Y. Kaji and T. Koumoto, “Adaptive recursive maximum likelihood decoding based on parallel concatenation decomposition,” Technical Report of IEICE IT2002–66, March, 2003.
T. Koumoto, Y. Kaji, T. Fujiwara and T. Kasami, “Implementation and simulation results of adaptive recursive maximum likelihood decoding,” Technical Report of IEICE IT2003–28, July 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Basel AG
About this paper
Cite this paper
Kasami, T. (2004). Adaptive Recursive MLD Algorithm Based on Parallel Concatenation Decomposition for Binary Linear Codes. In: Feng, K., Niederreiter, H., Xing, C. (eds) Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic, vol 23. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7865-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7865-4_2
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9602-3
Online ISBN: 978-3-0348-7865-4
eBook Packages: Springer Book Archive