VLSI Structures for Viterbi Receivers: Part I— General Theory and Applications

IEEE Journal on Selected Areas in Communications

Volumn 4, Issue 1, 1986, Pages 142-154

  Glenn Gulak, P ^a   Shwedyk, Edward ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC; INTEGRATED CIRCUITS, VLSI; MATHEMATICAL PROGRAMMING, DYNAMIC; SIGNAL PROCESSING - DIGITAL TECHNIQUES; SIGNAL RECEIVERS;

INTERCONNECTION PATTERNS; INTERSYMBOL INTERFERENCE; VITERBI RECEIVERS; VLSI IMPLEMENTATION;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0021289737     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.1986.1146304     Document Type: Article

References (30)

1. K. O. Brown, “Dynamic programming in computer science,” Dep. Comput. Sci., Carnegie-Mellon University, Pittsburgh, PA, Rep. No., CMU-CS-79-106, Feb. 1979.
2. L. Ciminera, C. Dermartin, A. Serra, and A. Valenzano, “ VLSI structures for speech analysis and pattern recognition,” in IEEE Conf. Pattern Recognition Image Processing, 1982, pp. 692–697.
3. L. J. Guibas, H. T. Kung, and C. D. Thompson, “Direct VLSI implementation of combinatorial algorithms,” in Proc. Caltech Conf. Very Large Scale Integration, Jan. 1979, pp. 509–525.
4. K. H. Chu and K. S. Fu, “VLSI architectures for high-speed recognition of context-free languages,” 9th Annual Symp. Comput. Architecture, Apr. 1982, 43–49.
5. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Information Theory, vol. IT-13, pp. 260–269, Apr. 1967.
6. G. D. Forney Jr., “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Trans. Information Theory, vol. IT-18, no. 3, pp. 363–378, May 1972.
7. J. K. Omura, “On the Viterbi decoding algorithm,” IEEE Trans. Information Theory, vol. IT-15, pp. 117–179, Jan. 1969.
8. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
9. G. D. Forney, “ The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268–279, Mar. 1973.
10. R. W. Lucky, J. Salz, and E. J. Weldon, Principles of Data Communication. Toronto, Canada: McGraw-Hill, 1968.
11. C. M. Rader, “Memory management in a Viterbi decoder,” IEEE Trans. Commun., vol. COM-29, no. 9, pp. 1399–1401, Sept. 1981.
12. K. S. Gilhousen, J. A. Heller, I. M. Jacobs, and A. J. Viterbi, “Coding systems study for high data rate telemetry links,” NASA Rep., Jan. 1971, prepared under Contract NAS2-6024, Linkabit Corp., San Diego, CA, 235
13. S. Crozier et al.,”Microprocessor-based implementation and testing of a simple Viterbi detector,” Canadian Elec. Eng. J., vol. 6, no. 3, pp. 3–8, 1981.
14. J. Conan, “An F8 microprocessor-based breadboard for the simulation of communication links using rate 1/2 convolutional codes and Viterbi decoding,” IEEE Trans. Commun., vol. COM-31, no. 2, pp. 165–171, Feb. 1983.
15. N. J. P. Frenette “VLSI design and implementation of a Viterbi detector for time-dispersive communication channels,” M.Sc. thesis, Dep. Elec. Eng., Queen's University, Kingston, Canada, Dec. 1983, 183
16. R. M. Orndorff et al., “Viterbi decoder VLSI integrated circuit for bit-error correction,” presented at the 16th Annual Asilomar Conf. Circuits, Systems, and Computers, Nov. 8–10, 1982.
17. C. D. Thompson, “A complexity theory for VLSI,” Ph.D. dissertation, Dep. Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, 1980.
18. P. G. Gulak, “VLSI structures for digital communication receivers,” Ph.D. dissertation, Dep. Elec. Eng., Univ. of Manitoba, Winnipeg, Canada, 1984.
19. H. S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Comput., vol. C-20, no. 2, pp. 153–161, Feb. 1971.
20. D. Kleitman, F. T. Leighton, M. Lepley, and G. L. Miller, “New layouts for the shuffle-exchange graph,” in Proc. 13th ACM Symp. Theory Comput., May 1981, pp. 278–292.
21. F. T. Leighton and G. L. Miller, “Optimal layouts for small shuffle exchange graphs”, in VLSI 81, J. P. Gray, Ed. New York: Academic, pp. 289–300.
22. N. Frenette, L. E. Peppard, and J. H. Lodge, “A CMOS implementation of a binary correlator for digital communication,” in 1983 Conf. Very Large Scale Integration, Univ. of Waterloo, Waterloo, Ont., Oct. 24–25, 1983, pp. 108–111.
23. G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE Trans. Information Theory, vol. IT-28, no. 1, pp. 55–67, Jan, 1982.
24. D. L. Peltzer “Wafer-scale integration: The limits of VLSI?,” VLSI Design, pp. 43–47, Sept. 1983.
25. J. Grinberg, G. R. Nudd, and R. D. Etchells, “A cellular VLSI architecture,” Computer, pp. 69–81, Jan. 1984.
26. J. W. Goodman, F. J. Leonberger, K. Sun-Yuan, and R. A. Athale, “Optical interconnections for VLSI systems,” Proc.IEEE, vol. 72, no. 7, pp. 850–866, July 1984.
27. F. P. Preparata and J. E. Vuillemin, “The cube-connected cycles: A versatile network for parallel computation,” Commun. ACM, vol. 24, no. 5, pp. 300–309, May 1981.
28. J. B. Cain, G. C. Clark, and J. M. Geist, “Punctured convolutional codes of rate (n —1)/n and simplified maximum likelihood decoding,” IEEE Trans. Information Theory, vol. IT-25, no. 1, pp. 97–100, Jan. 1979.
29. P. J. McLane, “ The Viterbi receiver for correlative encoded MSK signals,” IEEE Trans. Commun., vol. COM-31, no. 2, pp. 290–295, Feb. 1983.
30. A. E. Gamal, J. W. Greene, and K. F. Pang, “VLSI complexity of coding,” in Proc. 1984 Conf. Advanced Research in VLSI, Artech House, Inc., 1984, pp. 150–158.