DocumentCode
2929213
Title
Improving the constituent codes of turbo encoders
Author
Ho, Mark S C ; Pietrobon, Steven S. ; Giles, Tim
Author_Institution
Mobile Commun. Res. Centre, Univ. of South Australia, SA, Australia
Volume
6
fYear
1998
fDate
1998
Firstpage
3525
Abstract
The performance of turbo codes can be improved by choosing the best constituent encoder. Previous lists of the best constituent codes were found based on maximising the input weight, two effective free distance d2. We show that minimising the number of nearest neighbours N2 is also an important requirement. If there are multiple codes having the same d2 and N2, we show that the minimum distance dmin can be a useful criteria to identify the best code. A list of generator polynomials suitable for turbo codes are presented in this paper which satisfy the criteria mentioned above. The previously published results are also extended to include larger memory
Keywords
convolutional codes; polynomials; turbo codes; code search results; constituent codes; effective free distance; generator polynomials; maximum input weight; memory; minimum distance; multiple codes; nearest neighbours; recursive systematic convolutional codes; turbo codes; turbo encoders; Australia; Bit error rate; Convolutional codes; Electronic mail; Hamming weight; Iterative decoding; Polynomials; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE
Conference_Location
Sydney,NSW
Print_ISBN
0-7803-4984-9
Type
conf
DOI
10.1109/GLOCOM.1998.775855
Filename
775855
Link To Document