Vol. 69, n° 5-6, May-June 2014
Content available on Springerlink
Improved method for searching interleavers from a certain set using Garello’s method with applications for the LTE standard
Lucian Trifina, Daniela Tarniceriu
Technical Iniversity Gh. Asachi, Iasi, Romania
Abstract In this paper, we propose a method for searching interleavers within a certain class, with the aim of designing turbo codes with good distance spectrum. The method is based on a modified version of Garello’s algorithm and consists in the calculation of frame error rate truncated upper bound. Here, it is applied to quadratic permutation polynomial (QPP) interleavers able to outperform those chosen for the long-term evolution (LTE) standard, for lengths up to 1,504 bits.» Read the summary