Computer Science – Information Theory
Scientific paper
2011-03-19
IEEE International Symposium on Signals, Circuits and Systems - ISSCS 2011, pp. 403-406, June 30-July 1, 2011, Iasi, Romania
Computer Science
Information Theory
IEEE International Symposium on Signals, Circuits and Systems - ISSCS 2011, pp. 403-406, June 30-July 1, 2011, Iasi, Romania
Scientific paper
10.1109/ISSCS.2011.5978745
This paper proposes and proves a theorem which stipulates sufficient conditions the coefficients of two quadratic permutation polynomials (QPP) must satisfy, so that the permutations generated by them are identical. The result is used to reduce the search time of QPP interleavers with lengths given by Long Term Evolution (LTE) standard up to 512, by improving the distance spectrum over the set of polynomials with the largest spreading factor. Polynomials that lead to better performance compared to LTE standard are found for several lengths. Simulations show that 0.5 dB coding gains can be obtained compared to LTE standard.
Munteanu Valeriu
Tărniceriu Daniela
Trifina Lucian
No associations
LandOfFree
Improved QPP Interleavers for LTE Standard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Improved QPP Interleavers for LTE Standard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved QPP Interleavers for LTE Standard will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-198818