DocumentCode :
3037383
Title :
A butterfly structure for rate k/n convolutional codes
Author :
Kuo, Tsung-Sheng ; Hsu, Chau-Yun
Author_Institution :
Graduate Inst. of Commun. Eng., Tatung Univ., Taipei
fYear :
2005
fDate :
21-21 Dec. 2005
Firstpage :
528
Lastpage :
533
Abstract :
In this paper, we propose a butterfly structure for Viterbi decoder which works for convolutional codes of all rates R = k/n. It provides an efficient way to find the inherent symmetry of trellis branches. By exploiting the symmetry, only a part of branch metric need to be computed and the others can be derived from the computed branches. Consequently, the computational complexity of Viterbi decoder can be reduced significantly with no error performance loss. In the best case, the butterfly structure can reduce the branch metric computation by a factor of 4
Keywords :
Viterbi decoding; computational complexity; convolutional codes; Viterbi decoder; butterfly structure; computational complexity; convolutional codes; trellis branches; Bandwidth; Block codes; Computational complexity; Convolution; Convolutional codes; Decoding; Performance loss; Redundancy; Shift registers; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing and Information Technology, 2005. Proceedings of the Fifth IEEE International Symposium on
Conference_Location :
Athens
Print_ISBN :
0-7803-9313-9
Type :
conf
DOI :
10.1109/ISSPIT.2005.1577153
Filename :
1577153
Link To Document :
بازگشت