Abstract
Minimum distance decoding of convolutional codes has generally been considered impractical for other then relatively short constraint length codes, because of the exponential growth in complexity with increasing constraint length. The minimum distance decoding algorithm proposed in the paper, however, uses a sequential decoding approach to avoid an exponential growth in complexity with increasing constraint length, and also utilises the distance and structural properties of convolutional codes to considerably reduce the amount of tree searching needed to find the minimum distance path. In this way the algorithm achieves a complexity that does not grow exponentially with increasing constraint length, and is efficient for both long and short constraint length codes. The algorithm consists of two main processes. Firstly, a direct mapping scheme which automatically finds the minimum distance path in a single mapping operation, is used to eliminate the need fcr all short back-up tree searches. Secondly, when a longer back-up search is required, an efficient tree searching scheme is used to minimise the required search effort. By extending the approach used in the paper to the effective utilisation of soft-decision decoding, the algorithm offers the possibility of maximum-likelihood decoding long convolutional codes.
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
WOZENCRAFT, J.M., and REIFFEN, B.: ‘Sequential decoding’ (John Wiley and Sons, 1961).
FANO, R.M.: ‘A heuristic discussion on probabilistic decoding’, IEEE Trans., 1963, IT-9, pp. 64–67.
JELINEK, F.: ‘A fast sequential decoding algorithm using a stack’, IBM J. Res. Develop., 1969.
NG, W.H., and GOODMAN, R.M.F.: ‘An efficient minimum distance decoding algorithm for convolutional error correcting codes, Proc. IEE, Vol. 125, No. 2, Feb. 1978.
NG, W.H.: ‘An upper bound on the back-up depth for maximum likelihood decoding of convolutional codes’, IEEE Trans., 1976, IT-22, pp. 354–357.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer-Verlag Wien
About this chapter
Cite this chapter
Goodman, R.M.F. (1979). Towards the maximum-likelihood decoding of long convolutional codes. In: Longo, G. (eds) Algebraic Coding Theory and Applications. International Centre for Mechanical Sciences. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-39641-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-39641-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-38752-8
Online ISBN: 978-3-662-39641-4
eBook Packages: Springer Book Archive