DocumentCode
3255106
Title
Complexity reduction of the Viterbi algorithm using doubly complementary convolutional codes
Author
Haccoun, David ; Caron, Mario ; Nabli, Mehdi
Author_Institution
Ecole Polytech., Montreal, Que., Canada
fYear
1999
fDate
1999
Firstpage
408
Lastpage
411
Abstract
It has been shown that the use of doubly complementary convolutional codes of coding rate R=1/V allows a savings of approximately 1/3 of the real time operations over the usual Viterbi decoding algorithm (VA). Computer simulation results using R=1/2 and punctured 2/3⩽R⩽7/8 codes show that the error performances are strictly identical between the Viterbi algorithm and the new procedure
Keywords
Viterbi decoding; computational complexity; convolutional codes; error statistics; Viterbi algorithm; Viterbi decoding; compare-select-add operation; complexity reduction; computer simulation results; doubly complementary convolutional codes; error performance; punctured codes; Computational complexity; Computational modeling; Computer errors; Computer simulation; Convolutional codes; Costs; Decoding; Partitioning algorithms; Shift registers; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Computers and Signal Processing, 1999 IEEE Pacific Rim Conference on
Conference_Location
Victoria, BC
Print_ISBN
0-7803-5582-2
Type
conf
DOI
10.1109/PACRIM.1999.799562
Filename
799562
Link To Document