论文信息 - Bootstrap trellis decoding

Bootstrap trellis decoding

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.

Frederick Jelinek

[1] R. Gallager. Information Theory and Reliable Communication , 1968 .

[2] Jr. G. Forney,et al. The viterbi algorithm , 1973 .

[3] Frederick Jelinek. Upper bounds on sequential decoding performance parameters , 1974, IEEE Trans. Inf. Theory.

[4] John Cocke,et al. Bootstrap Hybrid Decoding for Symmetrical Binary Input Channels , 1971, Inf. Control..

[5] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[6] Andrew J. Viterbi,et al. Further results on optimal decoding of convolutional codes (Corresp.) , 1969, IEEE Trans. Inf. Theory.