DocumentCode :
593211
Title :
Quadratic permutation polynomial interleaver for LTE turbo coding
Author :
Ching-Lung Chi ; Chih-Hsiao Kuo
Author_Institution :
Dept. of Comput. & Commun., SHU-TE Univ., Kaohsiung, Taiwan
fYear :
2012
fDate :
14-16 Aug. 2012
Firstpage :
313
Lastpage :
316
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.
Keywords :
Long Term Evolution; communication complexity; error correction codes; interleaved codes; polynomials; turbo codes; LTE QPP interleaver; LTE turbo coding; computing complexity; contention-free interleaver; error correcting performance; long term evolution turbo codes; parallel turbo decoder implementation; quadratic permutation polynomial interleaver; Bit error rate; Computers; Long Term Evolution; Measurement; Polynomials; Turbo codes; Long Term Evolution (LTE); Quadratic permutation polynomial (QPP) interleaver; largest-spread QPP interleaver; maximum-spread QPP interleaver;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Security and Intelligence Control (ISIC), 2012 International Conference on
Conference_Location :
Yunlin
Print_ISBN :
978-1-4673-2587-5
Type :
conf
DOI :
10.1109/ISIC.2012.6449769
Filename :
6449769
Link To Document :
بازگشت