Performance Analysis of IDMA Scheme Using Quasi-Cyclic Low Density Parity Check Codes

Authors: Anurag Saxena, Alkesh Agrawal, Dinesh Kumar

Abstract:

The next generation mobile communication systems i.e. fourth generation (4G) was developed to accommodate the quality of service and required data rate. This project focuses on multiple access technique proposed in 4G communication systems. It is attempted to demonstrate the IDMA (Interleave Division Multiple Access) technology. The basic principle of IDMA is that interleaver is different for each user whereas CDMA employs different signatures. IDMA inherits many advantages of CDMA such as robust against fading, easy cell planning; dynamic channel sharing and IDMA increase the spectral efficiency and reduce the receiver complexity. In this, performance of IDMA is analyzed using QC-LDPC coding scheme further it is compared with LDPC coding and at last BER is calculated and plotted in MATLAB.

Keywords: 4G, QC-LDPC, CDMA, IDMA.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1339247

References:

[1] Kuldeep choudhary1, P S Sharma2 “Interleavers for IDMA Technology: A Comparison Survey” International Journal of Advanced Research in Computer and Communication Engineering vol. 1, no. 2, April 2012.
[2] Deepti Sahu1, Avinash Shukla2, Dayanand yadav3 Department of Electronics and Communication, PSIT College Of Engineering, Kanpur, India “Generation of Interleaver for IDMA” International Journal of Engineering Science Invention Research & Development; Vol. I, no.2, August 2014.
[3] Li Ping, Member, IEEE, Lihai Liu, Student, IEEE, Keying Wu, Student, IEEE, and W. K. Leung “Interleave-Division Multiple-Access” IEEE transactions on wireless communications, vol. 5, no. 4, April 2006.
[4] P. Niroopan, Yeon -ho Chung “A User-Spread Interleave Division Multiple Access System” International Journal of Advanced Research in Computer and Communication Engineering vol. 1, no. 10, December 2010.
[5] R. G. Gallager, “Low Density Parity Check Codes,” IRE Trans. Inform. Theory, vol. IT-8, no. 1, pp. 21–28, Jan. 1962.
[6] T. Kasami, “A Gilbert-Varshamov Bound For Quasi-Cycle Codes Of Rate 1/2,” IEEE Trans. Inform. Theory, vol. IT-20, no. 5, p. 679, Sep. 1974.
[7] Z. Li, L. Chen, L. Zeng, S.Lin, and W. H. Fong, “Efficient Encoding of Quasi-Cyclic Low- Density Parity-Check Codes”, IEEE Transactions on Communications, vol. 54, no. 1, Jan. 2006.
[8] Abid Yahya, Othman Sidek, MohdFadzli, Sardar Ali “An Efficient Encoding- Decoding of Large Girth LDPC Codes Based on Quasi-Cyclic” Australian Journal of Basic and Applied Sciences, 3(3): 1734-1739, 2009.
[9] Ajit Singh and Rajan Mishra “Design of IDMA Scheme Using LDPC Coding” VSRD-IJEECE, vol. 1 (7), 2011. K. Wesolowski, “Channel Coding” in Introduction to Digital Communication Systems, UK, Wiley-IEEE Press, 2009.
[10] Ryan, W.E. and S. Lin, “Channel Codes: classical and modern” 2009, Cambridge, UK: Cambridge University Press.
[11] Qiuju Diao; Shu Lin; Abdel-Ghaffar, K, 2011, “Cyclic and Quasi-Cyclic LDPC Codes” New developments, Information Theory and Applications Workshop (ITA), via IEEE.
[12] Naveed Nizam “On The Design Of Cyclic QC LDPC Codes”, Phd thesis, School Of Engineering And Information Technology Charles Darwin University, June, 2013.
[13] Thesis – “On The Design of Cyclic QC LDPC Codes” and Electronics Engineers, Inc. (IEEE), New York.
[14] D. J. C. MacKay, “Good Error-Correcting Codes Based On Very Sparse Matrices,” IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399–432, Mar. 1999.
[15] Nikoleta Andreadou, Fotini-Niovi Pavlid, Stylianos Papaharalabos, P. Takis Mathiopoulos “Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) Codes for Deep Space and High Data Rate Applications” IEEE 2009.
[16] D. J. C. MacKay and R. M. Neal, “Near Shannon Limit Performance of Low Density Parity-Check Codes,” Electro. Lett. vol. 32, pp. 1645-1646, Aug. 1996.
[17] R. Lucas, M. P. C. Fossorier, Y. Kou, and S. Lin, “Iterative Decoding of One-Step Majority Logic Decodable Codes Based On Belief Propagation,” IEEE Trans. Commun, vol. 48, pp. 931–937, June 2000.