DocumentCode :
892670
Title :
Systolic array processing of the Viterbi algorithm
Author :
Chang, Chih-Yung ; Yao, Kung
Author_Institution :
Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA
Volume :
35
Issue :
1
fYear :
1989
fDate :
1/1/1989 12:00:00 AM
Firstpage :
76
Lastpage :
86
Abstract :
Results on efficient forms of decoding convolutional codes based on the Viterbi algorithm by using systolic arrays are presented. Various properties of convolutional codes are discussed. A technique called strongly connected trellis decoding is introduced to increase the efficient utilization of all the systolic array processors. Issues dealing with the composite branch metric generation, survivor updating, overall system architecture, throughput rate, and computational overhead ratio are also investigated. The scheme is applicable to both hard and soft decoding of any rate b/n convolutional code. It is shown that as the length of the code becomes large, the systolic Viterbi decoder maintains a regular and general interconnection structure as well as moderate throughput rate gain over the sequential Viterbi decoder
Keywords :
cellular arrays; decoding; error correction codes; Viterbi algorithm; composite branch metric generation; computational overhead ratio; convolutional codes; decoding; hard decoding; overall system architecture; rate b/n code; soft decoding; strongly connected trellis decoding; survivor updating; systolic array processors; throughput rate; Computer architecture; Convolutional codes; Decoding; Helium; NASA; Sparse matrices; Systolic arrays; Throughput; Very large scale integration; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.42179
Filename :
42179
Link To Document :
بازگشت