CaltechAUTHORS
  A Caltech Library Service

An efficient minimum-distance decoding algorithm for convolutional error-correcting codes

Ng, W. H. and Goodman, R. M. F. (1978) An efficient minimum-distance decoding algorithm for convolutional error-correcting codes. Proceedings of the Institution of Electrical Engineers, 125 (2). pp. 97-103. ISSN 0020-3270. https://resolver.caltech.edu/CaltechAUTHORS:20190314-130608899

[img] PDF - Published Version
See Usage Policy.

937Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190314-130608899

Abstract

Minimum-distance decoding of convolutional codes has generally been considered impractical for other than 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 for 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. The paper describes the complete algorithm and its theoretical basis, and examples of its operation are given.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1049/piee.1978.0027DOIArticle
Additional Information:© 1978 Institution of Electrical Engineers. Paper 8028 E, first received 10th March and in revised form 30th August 1977.
Subject Keywords:Decoding, Error correction codes
Issue or Number:2
Record Number:CaltechAUTHORS:20190314-130608899
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20190314-130608899
Official Citation:W. H. Ng and R. M. F. Goodman, "An efficient minimum-distance decoding algorithm for convolutional error-correcting codes," in Proceedings of the Institution of Electrical Engineers, vol. 125, no. 2, pp. 97-, February 1978. doi: 10.1049/piee.1978.0027
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:93814
Collection:CaltechAUTHORS
Deposited By: George Porter
Deposited On:14 Mar 2019 20:28
Last Modified:03 Oct 2019 20:58

Repository Staff Only: item control page