Parallel Viterbi algorithm implementation: breaking the ACS-bottleneck
暂无分享,去创建一个
[1] G. Ungerboeck,et al. Adaptive Maximum-Likelihood Receiver for Carrier-Modulated Data-Transmission Systems , 1974, IEEE Trans. Commun..
[2] Keshab K. Parhi,et al. Concurrent cellular VLSI adaptive filter architectures , 1987 .
[3] J. S. Snyder,et al. High-speed Viterbi decoding of high-rate codes , 1983 .
[4] Plessis Robinson,et al. TDM-FDM Transmultiplexer: Digital Polyphase and FFT , 1974 .
[5] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.
[6] C. Rader. Memory Management in a Viterbi Decoder , 1981, IEEE Trans. Commun..
[7] Thomas Kailath,et al. Locally connected VLSI architectures for the Viterbi algorithm , 1988, IEEE J. Sel. Areas Commun..
[8] Hans Burkhardt,et al. Contributions to the application of the Viterbi algorithm , 1985, IEEE Trans. Inf. Theory.
[9] M. Bellanger,et al. TDM-FDM Transmultiplexer: Digital Polyphase and FFT , 1974, IEEE Trans. Commun..
[10] Christian Müller-Schloer,et al. Design of VLSI Circuits , 1987 .
[11] G. David Forney,et al. Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.