Complexity reduction of the Viterbi algorithm using doubly complementary convolutional codes

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/spl les/R/spl les/7/8 codes show that the error performances are strictly identical between the Viterbi algorithm and the new procedure.