DocumentCode
379456
Title
On the construction of turbo code interleavers based on graphs with large girth
Author
Vontobel, Pascal O.
Author_Institution
Eidgenossische Tech. Hochschule, Zurich, Switzerland
Volume
3
fYear
2002
fDate
2002
Firstpage
1408
Abstract
We discuss how interleavers for parallel concatenated turbo codes with good minimum distance can be derived from graphs having large girth, i.e. graphs whose length of the shortest cycle is large.
Keywords
concatenated codes; convolutional codes; graph theory; interleaved codes; turbo codes; convolutional codes; large girth graphs; parallel concatenated codes; turbo code interleavers; Concatenated codes; Convolutional codes; Intersymbol interference; Parity check codes; Turbo codes; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2002. ICC 2002. IEEE International Conference on
Print_ISBN
0-7803-7400-2
Type
conf
DOI
10.1109/ICC.2002.997082
Filename
997082
Link To Document