On the construction of turbo code interleavers based on graphs with large girth
- 25 June 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1408-1412
- https://doi.org/10.1109/icc.2002.997082
Abstract
We discuss how interleavers for parallel concatenated turbocodes with good minimum distance can be derived from graphs havinglarge girth, i.e. graphs whose length of the shortest cycle is large.Keywords
This publication has 10 references indexed in Scilit:
- A logarithmic upper bound on the minimum distance of turbo codesIEEE Transactions on Information Theory, 2004
- New turbo-like codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from MargulisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applicationsIEEE Journal on Selected Areas in Communications, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- On error floor and free distance of turbo codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- New deterministic interleaver designs for turbo codesIEEE Transactions on Information Theory, 2000
- Some Applications of Modular FormsPublished by Cambridge University Press (CUP) ,1990
- Ramanujan graphsCombinatorica, 1988
- Explicit constructions of graphs without short cycles and low density codesCombinatorica, 1982