FPGA Implementation of Sphere Detector for Spatial Multiplexing MIMO System

• Autorzy: Mohamed Asma , Zekry Abdel Halim , Ibrahim Reem

Identyfikatory

DOI

10.24425/ijet.2019.126307

• Języki publikacji: EN

Abstrakty

EN

Multiple Input Multiple Output (MIMO (techniques use multiple antennas at both transmitter and receiver for increasing the channel reliability and enhancing the spectral efficiency of wireless communication system.MIMO Spatial Multiplexing (SM) is a technology that can increase the channel capacity without additional spectral resources. The implementation of MIMO detection techniques become a difficult mission as the computational complexity increases with the number of transmitting antenna and constellation size. So designing detection techniques that can recover transmitted signals from Spatial Multiplexing (SM) MIMO with reduced complexity and high performance is challenging. In this survey, the general model of MIMO communication system is presented in addition to multiple MIMO Spatial Multiplexing (SM) detection techniques. These detection techniques are divided into different categories, such as linear detection, Non-linear detection and tree-search detection. Detailed discussions on the advantages and disadvantages of each detection algorithm are introduced. Hardware implementation of Sphere Decoder (SD) algorithm using VHDL/FPGA is also presented.

Słowa kluczowe

EN

multiple input multiple output; MIMO; Spatial Multiplexing(SM); zero-forcing; ZF; Minimum Mean Square Estimator (MMSE); Sorted QR Decomposition (SQRD); Sphere Decoder (SD)

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2019
• Tom: Vol. 65, No. 2
• Strony: 245--252
• Opis fizyczny: Bibliogr. 23 poz., rys.

Twórcy

autor

Mohamed Asma

• Electronics and Electrical Communications Engineering Department, ASU University, Cairo, Egypt

autor

Zekry Abdel Halim

• Electronics and Electrical Communications Engineering Department, ASU University, Cairo, Egypt

autor

Ibrahim Reem

• Design Department managerVLSI Design Center Electronics Factory, Cairo, Egypt

Bibliografia

• [1] JeffreyG.Andrews, ArunabhaGhosh, and Rais Mohamed, “Fundamentals of WiMAX: Understanding Broadband Wireless Networking”, Prentice Hall, 2007.
• [2] JanMietzner, RobertSchober, Lutz Lampe, Wolfgang H. Gerstacker, Peter A. Hoeher, “Multiple-Antenna Techniques for Wireless Communications – A Comprehensive iterature Survey,” IEEE communications survey and tutorials, Vol II No 2, Second quarter 2009.
• [3] G. J. Foschini, “Layered space-time architecture for wireless communication in a fading environment when using multielement antennas,” Bell Syst. Tech. J., pp. 41–59, Autumn 1996.
• [4] G. J. Foschini and M. J. Gans, “On limits of wireless communications in a fading environment when using multiple antennas,” Kluwer Wireless Pers. Commun., vol. 6, pp. 311–335, Mar. 1998.
• [5] W. Van Etten, “Maximum likelihood receiver for multiple channel transmission systems,” IEEE Trans. on Communications, pp. 276-283, Feb. 1976.
• [6] Z. Xu and R. D. Murch, “Performance analysis of maximum likelihood detectionin a MIMO antenna system,” IEEE Trans. Commun., vol. 50, no. 2, pp. 187– 191, Feb. 2002
• [7] P. Wolniansky, G. Foschini, G. Golden, and R. Valenzuela, “V-BLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel,” in Proc. URSI International Symposium on Signals, Systems, and Electronics, pp. 295-300, Oct.
• [8] J. Paulraj, D. A. Gore, R. U. Nabar, and H. Boelcskei, “Anoverview of MIMO communications – A key to gigabit wireless,” Proc. IEEE, vol. 92, no. 2, pp. 198–218, Feb. 2004.
• [9] P. W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela, “VBLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel,” URSI Int. Symp. on Signals, Systems and Electronics, (Pisa, Italy), pp. 295300, Sep. 1998
• [10] D. Shiu and J.M. Kahn, nLayered Space-Time Codes for Wireless Communications using Multiple TransmitAntennas,” in IEEE Proceedings of International Conference on Communications (ICC’99), Vancouver, B.C.,June 6-10 1999.
• [11] D. Wubben, J. Rinas, R. Bohnke, V. K¨uhn, and K.D. Kammeyer, “Efficient Algorithm for Detecting Layered Space-Time Codes”, 4thInt. ITG Conference on Source and Channel Coding, Berlin, January 2002.
• [12] U. Finke, and M. Pohst, “Improved methods for calculating vectors of short length in a lattice, including a complexity analysis,” Mathematics of Computation, vol.44, no. 170, pp. 463-471, April 1985.
• [13] E. Viterbo and E. Bigleri, “A universal lattice decoder,” In 14eme Colloque GRETSI, pp. 611-614, September 1993.
• [14] E. Viterbo and J. Boutros, “A universal lattice code decoder for fading channels,” IEEE Trans. Inform. Theory, vol. 45, no. 5, pp. 1639–1642, July 1999.
• [15] M. O. Damen, H. E. Gamal, and G. Caire, “On maximum likelihood detection and the search for the closest lattice point,” IEEE Trans. Inform. Theory, vol. 49, no.10, pp. 2389–2402, Oct. 2003.
• [16] B. Hassibi and H. Vikalo, “On Sphere Decoding algorithm. Part I,the expected complexity,”IEEE Transactions on Signal Processing,vol. 54, no. 5, pp. 2806–2818, August 2005.
• [17] Z. Guo and P. Nilsson, “Algorithm and implementation of the K-BestSphereDecoding for MIMO Detection,”IEEE Journal on SelectedAreas in Communications, vol. 24, no. 3, pp. 491–503, March 2006.
• [18] M. O. Damen, H. E. Gamal, and G. Caire, “On Maximum-Likelihood detection and the search for the closest lattice point,”IEEE Transactions on Information Theory, vol. 49, no. 10, pp. 2389–2402, October 2003.
• [19] K. Su, “Efficient Maximum Likelihood detection for communicationover MIMO channels,” University of Cambridge, Technical Report, February 2005.
• [20] C. P. Schnorr and M. Euchner, “Lattice basis reduction: Improved practical algorithms and solving subset sum problems,” Math. Program., vol. 66,pp. 181–191,1994.
• [21] E. Agrell, T. Eriksson, A. Vardy, and K. Zegar, “Closet point search in lattices,”IEEE Trans. Inf. Theory, vol. 48, pp. 2201–2214, Aug. 2002.
• [22] A. D. Murugan, H. E. Gamal, M. O. Damen, and G. Caire, “A unified frameworkfortree search decoding: rediscovering the sequential decoder,” IEEE Trans. Inf.Theory, vol. 52, no. 3, pp. 933–953, Mar. 2006.
• [23] B. Hassibi and H. Vikalo, “On Sphere Decoding algorithm. Part I, the expected complexity,”IEEE Transactions on Signal Processing, vol. 54, no. 5, pp. 2806–2818, August 2005.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).