NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Real-time minimal-bit-error probability decoding of convolutional codesA recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.
Document ID
19740039607
Document Type
Reprint (Version printed in journal)
Authors
Lee, L.-N. (Notre Dame, University Notre Dame, Ind., United States)
Date Acquired
August 7, 2013
Publication Date
February 1, 1974
Publication Information
Publication: IEEE Transactions on Communications
Volume: COM-22
Subject Category
COMPUTERS
Funding Number(s)
CONTRACT_GRANT: NGL-15-004-026
Distribution Limits
Public
Copyright
Other