Document Type
Article
Subject Area(s)
Electrical and Computer engineering
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.
Publication Info
Postprint version. Published in IEEE Transactions on Communications, Volume 44, Issue 2, 1996, pages 121-126.
© IEEE Transactions on Communications, 1996, IEEE
Matolak, D., Wilson, S. (1996). Variable-Complexity Trellis Decoding of Binary Convolutional Codes. IEEE Transactions on Communications, 44(2), 121-126.
http://dx.doi.org/10.1109/26.486598
Rights
© IEEE Transactions on Communications, 1996, IEEE
Matolak, D., Wilson, S. (1996). Variable-Complexity Trellis Decoding of Binary Convolutional Codes. IEEE Transactions on Communications, 44(2), 121-126.
http://dx.doi.org/10.1109/26.486598