1 |
A. K. Yeung and J. Rabaey, 'A 210-Mb/s, radix-4 bit-level pipelined Viterbi decoder,' ISSCC Dig. Tech. Papers, pp. 88 - 89, Feb. 1995
|
2 |
H. Dawid, S. Bitterlich, and H. Meyr, 'Trellis pipeline-interleaving: A novel method for efficient Viterbi decoder implementation,' in Proc IEEE Int. Symp. Circuits and Systems, vol. 4, San Diego, CA, May 1992, pp. 1875-1878
|
3 |
C. M. Rader, 'Memory management in a Viterbi decoder,' IEEE Trans. Commun., vol. 29, pp. 1399 - 1401, Sept. 1981
DOI
|
4 |
J. Sparso, H. N. Jorgensen, E. Paaske, S. Pedersen, and T. Rubner-Petersen, 'An areaefficient topology for VLSI implementation of Viterbi decoders and other shuffle-exchange type structures,' IEEE J. Solid-State Circuits, vol. 26, pp. 90 - 96, Feb. 1991
DOI
ScienceOn
|
5 |
IEEE Std. 1076-1993, 'VHDL language reference manual', IEEE Press, New Jersey 1994
|
6 |
Y. N. Chang, H. Suzuki, and K. K. Parhi, 'A 2-Mb/s 256-State 10-mW Rate-1/3 Veterbi Decoder', IEEE Journal of Solid-State Circuits, Vol. 35, No.6, June. 2000
|
7 |
A. J. Viterbi, 'Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,' IEEE Trans. Inform. Theory, vol. IT-13, pp. 260 - 269, Apr. 1967
|
8 |
G. D. Forney, Jr., 'The Viterbi algorithm,' Proc. IEEE, Vol. 61, No.3, pp. 268-278, Mar. 1973
|
9 |
J. K. Hinderling et al., 'CDMA mobile station modem ASIC,' IEEE J. Solid-State Circuits, vol. 28, pp. 253 - 260, Mar. 1993
DOI
ScienceOn
|
10 |
R. Cyper and C. B. Shung, 'Generalized trace-back techniques for survivor memory management in the Viterbi algorithm,' Proc. GLOBECOM, vol. 2, pp. 1318 - 1322, Dec. 1990
|