Performance analysis of modified tent map interleaver in IDMA systems

Aasheesh Shukla – Vinay Kumar Deolia

   In the last years, Interleave Division Multiple Access (IDMA) has been presented as a potential alternate of Code Division Multiple Access (CDMA) system. In IDMA systems, the interleavers are used to separate the users of the system in multiple access environments. Random interleaver is popular and basic taxonomy, which scrambles information bits of craving users with different patterns. However the indispensable characteristics of a random interleaver such as bandwidth requirement, computational complexity, and memory restraint at both transmitter and receiver end is uttermost. Further, it has also been observed that the study of role of chaos in interleaver design is very limited in literature. Hence, in this paper, a low complexity chaos based interleaver named as modified Tent map interleaver is designed for further performance improvement of IDMA system and the characteristic parameters are compared with the random interleaver. The IDMA system model uses a BPSK modulation and repetition coder with a code rate of $1/2$. The system is simulated in MATLAB and results show that the better BER performance without the need of extra memory resources.

Keywords: IDMA, tent map, chaos, random interleaver, computational complexity

[full-paper]