Results 1 -
8 of
8
On quadratic inverses for quadratic permutation polynomials over integer rings
- IEEE Trans. Inf. Theory
, 2006
"... ar ..."
(Show Context)
A parallel interleaver design for IDMA systems
- IEEE 2009 International Conference on Wireless Communications and Signal Processing, WCSP09
, 2009
"... Abstract—In this paper, we propose a parallel interleaver design for interleave-division multiple-access (IDMA) systems. The advantages of our approach are the low complexity induced from an algebraic solution and the parallel processing with negligible performance degradations against random interl ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we propose a parallel interleaver design for interleave-division multiple-access (IDMA) systems. The advantages of our approach are the low complexity induced from an algebraic solution and the parallel processing with negligible performance degradations against random interleavers. It is specially suitable for parallel implementation of multiple user detections and decoding of IDMA signals, resulting in efficient improvements of system throughput. Simulation results show that the parallel interleavers perform as well as the random interleavers in an IDMA system. Keywords-IDMA; parallel interleavers I.
Pruned Bit-Reversal Permutations: Mathematical Characterization, Fast Algorithms and Architectures
, 2014
"... A mathematical characterization of serially-pruned permutations (SPPs) employed in variable-length permuters and their associated fast pruning algorithms and architectures are proposed. Permuters are used in many signal processing systems for shuffling data and in communication systems as an adjunct ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
A mathematical characterization of serially-pruned permutations (SPPs) employed in variable-length permuters and their associated fast pruning algorithms and architectures are proposed. Permuters are used in many signal processing systems for shuffling data and in communication systems as an adjunct to coding for error correction. Typically only a small set of discrete permuter lengths are supported. Serial pruning is a simple technique to alter the length of a permutation to support a wider range of lengths, but results in a serial processing bottleneck. In this paper, parallelizing SPPs is formulated in terms of recursively computing sums involving integer floor and related functions using integer operations, in a fashion analogous to evaluating Dedekind sums. A mathematical treatment for bit-reversal permutations (BRPs) is presented, and closed-form expressions for BRP statistics including descents/ascents, major index, excedances/descedances, inversions, and serial correlations are derived. It is shown that BRP sequences have weak correlation properties. Moreover, a new statistic called permutation inliers that characterizes the pruning gap of pruned interleavers is proposed. Using this statistic, a recursive algorithm that computes the minimum inliers count of a pruned BR interleaver (PBRI) in logarithmic time complexity is presented. This algorithm enables parallelizing a serial PBRI algorithm by any desired parallelism factor by computing the pruning gap in lookahead rather than a serial fashion, resulting in significant reduction in interleaving latency and memory overhead. Extensions to 2-D block and stream interleavers, as well as applications to pruned fast Fourier transforms and LTE turbo interleavers, are also presented. Moreover, hardware-efficient architectures for the proposed algorithms are developed. Simulation results of interleavers employed in modern communication standards demonstrate 3 to 4 orders of magnitude improvement in interleaving time compared to existing approaches.
Further results on quadratic permutation polynomial-based interleavers for turbo codes
, 2011
"... ..."
Remarks on Self-Inverse Quadratic Permutation Polynomials
, 2010
"... Abstract Conditions for a quadratic permutation polynomial (QPP) to be self-inverse over the ring Z m of modular integers are given. If m = 2 n , necessary and sufficient conditions for a QPP to be self-inverse are determined. Additional properties of QPP over modular integers as well as examples o ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract Conditions for a quadratic permutation polynomial (QPP) to be self-inverse over the ring Z m of modular integers are given. If m = 2 n , necessary and sufficient conditions for a QPP to be self-inverse are determined. Additional properties of QPP over modular integers as well as examples of monomial permutation polynomials are also provided. Mathematics Subject Classification: 12E10, 11B83
CYCLE STRUCTURE OF PERMUTATION FUNCTIONS OVER FINITE FIELDS AND THEIR APPLICATIONS
, 2012
"... ..."
(Show Context)
NEW PSEUDO-RANDOM INTERLEAVER WITH INCREASED PARAMETERS
, 2010
"... Abstract: This paper presents a new algorithm of obtaining a pseudo-random code-matched interleaver leading both to very good interleaver parameters and performance. The difference between the proposed permutation and other code matching techniques is that not only the distance spectrum is improved ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: This paper presents a new algorithm of obtaining a pseudo-random code-matched interleaver leading both to very good interleaver parameters and performance. The difference between the proposed permutation and other code matching techniques is that not only the distance spectrum is improved but also the parameters of the interleaver. The design procedure is described in depth, and the benchmarking is done against the High Spread-Random and the deterministic Long Term Evolution (LTE) standard interleavers.
