Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 1978 | Published
Journal Article Open

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

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.

Additional Information

© 1978 Institution of Electrical Engineers. Paper 8028 E, first received 10th March and in revised form 30th August 1977.

Attached Files

Published - 05253280.pdf

Files

05253280.pdf
Files (959.5 kB)
Name Size Download all
md5:6badae90bd22745b1a6ff059faea5db6
959.5 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023