Abstract
Interleaver is an important component of turbo code and has a strong impact on its error correcting performance. Quadratic permutation polynomial (QPP) interleaver is a contention-free interleaver which is suitable for parallel turbo decoder implementation. To improve the performance of LTE QPP interleaver, largest-spread and maximum-spread QPP interleavers are analyzed for Long Term Evolution (LTE) turbo codes in this paper. Compared with LTE QPP interleaver, those algorithms have low computing complexity and better performances from simulation results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
