DocumentCode
843700
Title
Locally connected VLSI architectures for the Viterbi algorithm
Author
Gulak, P. Glenn ; Kailath, Thomas
Author_Institution
Dept. of Electr. Eng., Stanford Univ., CA, USA
Volume
6
Issue
3
fYear
1988
fDate
4/1/1988 12:00:00 AM
Firstpage
527
Lastpage
537
Abstract
The Viterbi algorithm is a well-established technique for channel and source decoding in high-performance digital communication systems. Implementations of the Viterbi algorithm on three types of locally connected processor arrays are described. The restriction is motivated by the fact that both the cost and performance metrics of VLSI favour architectures in which on-chip interprocessor communication is localized. Each of the structures presented can accommodate arbitrary alphabet sizes and algorithm memory lengths
Keywords
VLSI; cellular arrays; decoding; digital communication systems; VLSI architectures; Viterbi algorithm; channel decoding; digital communication systems; locally connected processor arrays; on-chip interprocessor communication; source decoding; Costs; Decoding; Digital communication; Measurement; Operations research; Parallel processing; Shift registers; Very large scale integration; Viterbi algorithm; Wiring;
fLanguage
English
Journal_Title
Selected Areas in Communications, IEEE Journal on
Publisher
ieee
ISSN
0733-8716
Type
jour
DOI
10.1109/49.1921
Filename
1921
Link To Document