| | 講 題 | Low Complexity QPP Interleavers of Turbo Coding | | | 講 者 | Dept. of Computer and Communication SHU-TE University Kaohsiung City 824, Taiwan-Chien-Lung Kuo | | | 日 期 | 2014/10/24 | 長 度 | 00:11:21 | 人 氣 | 426 次 | | | 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. | | | 提 供 | TANET台灣網際網路研討會-TANET2014 | | |
|
