Generalized trace-back techniques for survivor memory management in the Viterbi algorithm
暂无分享,去创建一个
[1] G. David Forney,et al. Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.
[2] J. Omura,et al. On the Viterbi decoding algorithm , 1969, IEEE Trans. Inf. Theory.
[3] Franco P. Preparata,et al. An approach to artificial nonsymbolic cognition , 1972, Inf. Sci..
[4] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.
[5] P. G. Gulak,et al. Survivor sequence memory management in Viterbi decoders , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.
[6] C. Rader. Memory Management in a Viterbi Decoder , 1981, IEEE Trans. Commun..
[7] C. Thomborson,et al. A Complexity Theory for VLSI , 1980 .
[8] F. Pollara,et al. Memory management in traceback Viterbi decoders , 1989 .
[9] Jr. G. Forney,et al. The viterbi algorithm , 1973 .
[10] J. Bibb Cain,et al. Error-Correction Coding for Digital Communications , 1981 .