Low-Complexity Parallel QPP Interleaver Based on Permutation Patterns

Bongjin Kim

doi:10.1109/TCSII.2013.2240911

Low-Complexity Parallel QPP Interleaver Based on Permutation Patterns

2013-03-01

4

PRE

AI

DOI：10.1109/TCSII.2013.2240911

Original

Original request for help

Save

Abstract

En 中文

In this brief, we present how parallel-interleaved addresses generated by a quadratic permutation polynomial (QPP) interleaver are related to each other and propose a low-complexity parallel QPP interleaver based on the relationship. While a conventional parallel turbo decoder employs a number of interleavers as many as the parallel factor, the proposed method, which benefits from the arithmetic relationship denoted as the permutation pattern (PP), supports the parallel interleaving using only a single interleaver, resulting in a notable reduction of complexity. The strength of the proposed method stems from the fact that the PP is fully determined by only the decoding parameters, such as block size, parallel factor, and QPP coefficients. Experiment results on the Long Term Evolution turbo codes show that the proposed interleaver can significantly reduce the hardware complexity compared with conventional implementations.

Keywords:

Parallel architecture

permutation pattern (PP)

quadratic permutation polynomial (QPP) interleaver

turbo decoder

Low-Complexity Parallel QPP Interleaver Based on Permutation Patterns

Abstract

Journal

Organization