Title :
The trellis complexity of convolutional codes
Author :
Mceliece, Robert J. ; Lin, Wei
Author_Institution :
California Inst. of Technol., Pasadena, CA, USA
Abstract :
We develop a theory of minimal trellises for convolutional codes, and find that the “standard” trellis need not be the minimal trellis. We have found a simple algorithm for finding a generator matrix for a convolutional code, for which the corresponding “scalar” generator matrix is in “minimal span” form
Keywords :
computational complexity; convolutional codes; matrix algebra; algorithm; convolutional codes; minimal span matrix; minimal trellis; minimal trellises; scalar generator matrix; standard trellis; trellis complexity; Block codes; Convolutional codes; Decoding; Length measurement; Viterbi algorithm;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.531335
