DocumentCode
923275
Title
Bootstrap trellis decoding
Author
Jelinek, Frederick
Volume
21
Issue
3
fYear
1975
fDate
5/1/1975 12:00:00 AM
Firstpage
318
Lastpage
325
Abstract
A new hybrid coding scheme is introduced that bears the same relation to Viterbi decoding as bootstrap hybrid decoding [3] bears to sequential decoding. Bounds on the probability of error are developed and evaluated for some examples. In high-rate regions of interest, the computed exponents are more than three times as large as those for Viterbi decoding. Results of simulations are also presented.
Keywords
Convolutional codes; Decoding; Trellis codes; Binary sequences; Computational modeling; Concatenated codes; Convolutional codes; Iterative decoding; Logic; NASA; Parity check codes; Shift registers; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1975.1055377
Filename
1055377
Link To Document