DocumentCode
1430911
Title
A search for good convolutional codes to be used in the construction of turbo codes
Author
Benedetto, Sergio ; Garello, Roberto ; Montorsi, Guido
Author_Institution
Dipt. di Elettronica, Politecnico di Torino, Italy
Volume
46
Issue
9
fYear
1998
fDate
9/1/1998 12:00:00 AM
Firstpage
1101
Lastpage
1105
Abstract
Recursive systematic convolutional encoders have been shown to play a crucial role in the design of turbo codes. We recall some properties of binary convolutional encoders and apply them to a search for good constituent convolutional codes of turbo codes. Tables of the “best” recursive systematic convolutional encoders found are presented for various rates, together with the average bit-error probability performances of some turbo codes using them
Keywords
binary sequences; concatenated codes; convolutional codes; error statistics; finite state machines; group theory; search problems; average bit-error probability; best codes; binary convolutional encoders; convolutional codes; finite state machine; good constituent codes; group theory; recursive systematic convolutional encoders; turbo codes construction; Binary codes; Communications Society; Concatenated codes; Convolutional codes; Decoding; State-space methods; Turbo codes; Upper bound; Vectors;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.718548
Filename
718548
Link To Document