Performance Analysis of Optimum Interleaver based on Prime Numbers for Multiuser Iterative IDMA Systems

Performance Analysis of Optimum Interleaver based on Prime Numbers for Multiuser Iterative IDMA Systems

M. Shukla (Harcourt Butler Technological Institute, India) and Ruchir Gupta (Rohelkhand University, India)
DOI: 10.4018/978-1-4666-0050-8.ch012
OnDemand PDF Download:
No Current Special Offers


In recently proposed multiple access techniques like IDMA and OFDM-IDMA, the user separation is done by user specific interleavers in contrast to the conventional CDMA scheme, where user separation is assured with user-specific signature sequences. The user specific interleavers must demonstrate minimum probability of collision amongst each other in addition to other merits, including minimal consumption of bandwidth, least hardware for their generation, and least memory requirement. In this paper, the authors propose an interleaver based on prime numbers for the generation of user specific interleavers to remove the problem of high consumption of bandwidth. The simulation results demonstrate the optimal performance of prime interleaver (PI), which is based on prime numbers, apart from other merits in comparison to random and other interleavers.
Chapter Preview

Interleavers In Digital Communication

In communication systems, most of the well-known codes have been developed to combat against the noise that is assumed to be statistically independent. Typical channel model causing this type of noise would be Additive White Gaussian Noise channel (AWGN). However, there are some physical channels that show bursty error characteristics, such as multipath fading channel, in which fading often causes the signal to fall below the noise level and, thus, results in the burst type of error. Interleaving is frequently used in digital communication and storage systems to improve the performance of forward error correcting codes. Many communication channels are not memoryless: errors typically occur in bursts rather than independently. If the number of errors within a code word exceeds the error-correcting code's capability, it fails to recover the original code word. Interleaving ameliorates this problem by shuffling source symbols across several code words, thereby creating a more uniform distribution of errors.

Interleaving is a technique commonly used to overcome correlated channel noise such as burst error or fading (Rappaport, 2002; Tse, 2005; Olavarrieta, 2004). In interleaving mechanism, the input data rearranges itself such that consecutive data are split among different blocks. At the receiver end, the interleaved data is arranged back into the original sequence by the de-interleaver. As a result of interleaving, correlated noise introduced in the transmission channel appears to be statistically independent at the receiver and thus allows better error correction.

Complete Chapter List

Search this Book: