Locally Connected Vlsi Architectures for the Viterbi Algorithm

IEEE Journal on Selected Areas in Communications

Volumn 6, Issue 3, 1988, Pages 527-537

  Gulak, P Glenn ^a   Kailath, Thomas ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC - DECODING; COMPUTER ARCHITECTURE; INTEGRATED CIRCUITS, VLSI;

SYSTOLIC ARCHITECTURE; THREE-STAGE TRELLIS DIAGRAM; VITERBI ALGORITHM;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0023995238     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.1921     Document Type: Article

References (20)

1. C.L. Seitz, “Concurrent VLSI architectures,” IEEE Trans. Comput., vol. C-33, pp. 1247–1265, Dec. 1984.
2. M. Pollack and W. Wiebenson, “Solutions to the shortest-route problem-A review,” Oper. Res., no. 8, pp. 224–230, 1960.
3. J.K. Omura, “On the Viterbi decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 177–179, Jan. 1969.
4. A.J. Viterbi and J.K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
5. G.D. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268–279, Mar. 1973.
6. H.S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Comput., vol. C-20, pp. 153–161, Feb. 1971.
7. P. Diaconis, R.L. Graham, and W.M. Kantor, The Mathematics of Perfect Shuffles, Advances in Applied Mathematics, Vol. 4. New York: Academic, 1983, pp. 175–196.
8. C.M. Rader, “Memory management in a Viterbi decoder,” IEEE Trans. Commun., vol. COM-29, pp. 1399–1401, Sept. 1981.
9. P.G. Gulak and e. Shwedyk, “VLSI structures for Viterbi receivers: Part I-General theory and applications,” IEEE J. Select. Areas Commun., vol. SAC-4, pp. 142–154, Jan. 1986.
10. C.D. Thompson, “A complexity theory for VLSI,” Ph.D. dissertation, Dept. Comput. Sci., Carnegie Mellon Univ., 1980.
11. F.T. Leighton, Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks. Cambridge, MA: MIT Press, 1983, 139 pages.
12. K.O. Brown, “Dynamic programming in computer science,” Dept. of Comput. Science, Carnegie-Mellon Univ., Pittsburg, PA, Rep. CMU-CS-79–106, Feb. 1979.
13. N. Weste, D.J. Burr, and B.D. Ackland, “Dynamic time warp pattern matching using an integrated multiprocessor array,” IEEE Trans. Comput., vol. C-32, pp. 731–744, Aug. 1983.
14. K.H. Chu and K.S. Fu, “VLSI architectures for high speed recognition of context-free languages,” in Proc. 9th Annu. Symp. Comput. Architec., Apr. 1982, pp. 43–49.
15. 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.
16. G. Ungerboeck, “Trellis-coded modulation with redundant signal sets, Part I: Introduction, Part II: State of the art,” IEEE Commununications, vol. 25, pp. 5–21, Feb. 1987.
17. S.C. Glinski, T.M. Lalumia, D.R. Cassiday, T. Koh, C.M. Gerveshi, G.A. Wilson, and J. Kumar, “A processor for graph search algorithms,” in Proc. ISSCC 87, New York, Feb. 1987, pp. 162163.
18. C.Y. Chang and K. Yao, “Viterbi decoding by systolic array,” in Proc. Twenty-Third Annu. Allerton Conf. Commun., Cont. Comput., Allerton House, Monticello, IL, Oct. 2-4, 1985, pp. 430–439.
19. C. Mead and L. Conway, Introduction to VLSI Systems. Menlo Park, CA: Addison-Wesley, 1980, p. 275.
20. W. Bliss, J. Girard, J. Avery, M. Lightner, and L. Scharf, “A mod-