Variable-complexity trellis decoding of binary convolutional codes

Author

Matolak, David W. ; Wilson, Stephen G.

Author_Institution

Dept. of Electr. Eng., Virginia Univ., Charlottesville, VA, USA

Volume

44

Issue

2

fYear

1996

fDate

2/1/1996 12:00:00 AM

Firstpage

121

Lastpage

126

Abstract

Considers trellis decoding of convolutional codes with selectable effort, as measured by decoder complexity. Decoding is described for single parent codes with a variety of complexities, with performance “near” that of the optimal fixed receiver complexity coding system. Effective free distance is examined. Criteria are proposed for ranking parent codes, and some codes found to be best according to the criteria are tabulated, Several codes with effective free distance better than the best code of comparable complexity were found. Asymptotic (high SNR) performance analysis and error propagation are discussed. Simulation results are also provided

Keywords

computational complexity; convolutional codes; decoding; error analysis; trellis codes; SNR performance analysis; binary convolutional codes; decoder complexity; effective free distance; error propagation; performance; ranking; selectable effort; single parent codes; variable-complexity trellis decoding; AWGN channels; Convolutional codes; Costs; Decoding; Delay effects; Design optimization; Performance analysis; State estimation; USA Councils; Viterbi algorithm;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.486598

Filename

486598