On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers

@article{Rosnes2012OnTM,
  title={On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers},
  author={Eirik Rosnes},
  journal={IEEE Transactions on Information Theory},
  year={2012},
  volume={58},
  pages={4781-4795}
}
An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementations. Also, the recently proposed quadratic permutation polynomial (QPP)-based interleavers by Sun and Takeshita have provided excellent performance for short-to-medium block lengths, and have been selected for the 3GPP LTE standard. In this paper, we derive some upper bounds… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Permutation polynomial based interleavers for turbo codes over integer rings: Theory and applications

  • J. Ryu
  • Ph.D. dissertation, Ohio State Univ., Columbus…
  • 2007
Highly Influential
3 Excerpts

Computing the minimum distance of turbo-codes using iterative decoding techniques

  • S. Crozier, P. Guinand, A. Hunt
  • inProc. 22th Biennial Symp. Commun., Kingston, ON…
  • 2004
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…