Map channel decoding: Algorithm and VLSI architecture
暂无分享,去创建一个
[1] Jr. G. Forney,et al. The viterbi algorithm , 1973 .
[2] Peter Adam Hoeher,et al. Separable MAP "filters" for the decoding of product and concatenated codes , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[3] Gerhard Fettweis,et al. Minimized method Viterbi decoding: 600 Mbit/s per chip , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.
[4] H. Meyr,et al. High-speed parallel Viterbi decoding: algorithm and VLSI-architecture , 1991, IEEE Communications Magazine.
[5] J. Bibb Cain,et al. Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[6] Van Nostrand,et al. Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm , 1967 .
[7] Shuji Kubota,et al. Ultra-high-speed and universal-coding-rate Viterbi decoder VLSIC-SNUFEC VLSI , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[8] Joachim Hagenauer,et al. A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.
[9] Peter Adam Hoeher. TCM on frequency-selective fading channels: a comparison of soft-output probabilistic equalizers , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.
[10] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[11] G. Ungerboeck. Nonlinear Equalization of Binary Signals in Gaussian Noise , 1971 .