Title :
On (n, n-1) convolutional codes with low trellis complexity
Author :
Tang, Hung-Hua ; Lin, Mao-Chao
Author_Institution :
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fDate :
1/1/2002 12:00:00 AM
Abstract :
We show that the state complexity profile of a convolutional code C is the same as that of the reciprocal of the dual code of C in case that minimal encoders for both codes are used. Then, we propose an optimum permutation for any given (n, n-1) binary convolutional code that will yield an equivalent code with the lowest state complexity. With this permutation, we are able to find many (n, n-1) binary convolutional codes which are better than punctured convolutional codes of the same code rate and memory size by either lower decoding complexity or better weight spectra
Keywords :
Viterbi decoding; binary codes; computational complexity; convolutional codes; dual codes; trellis codes; Viterbi decoding algorithm; binary convolutional code; code rate; decoding complexity; dual code reciprocal; low trellis complexity; memory size; optimum permutation; punctured convolutional codes; state complexity profile; trellis codes; weight spectra; Block codes; Communication systems; Communications Society; Convolutional codes; Councils; Decoding; Information theory; Parity check codes; Viterbi algorithm; Wireless communication;
Journal_Title :
Communications, IEEE Transactions on
