DocumentCode :
2060884
Title :
On equivalent convolutional encoders and decoding complexity
Author :
Geyer, Alexander ; Vinck, A. J Han
Author_Institution :
Essen Univ., Germany
fYear :
2002
fDate :
2002
Firstpage :
397
Abstract :
We discuss the classical definition of equivalent convolutional codes. We extend the definition to allow delay over digits in a serial output description. Then we propose the definition of encoders that generate different codes but with the same code spectrum. We conclude with some examples of encoder implementations that do not give the same code but the same code spectrum for encoders with less memory elements.
Keywords :
computational complexity; convolutional codes; decoding; matrix algebra; polynomials; D-polynomial generator matrix; code spectrum; decoding complexity; encoder implementations; equivalent convolutional codes; Conferences; Convolutional codes; Decoding; Delay; Encoding; IEEE Press; Information theory; Sequential circuits;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
Type :
conf
DOI :
10.1109/ISIT.2002.1023669
Filename :
1023669
Link To Document :
بازگشت