MIMO (Multiple input –Multiple Output) technology is a promising and upcoming technology for the future wireless generation system, as it has got high throughput and diversity gain. MIMO makes antennas work smarter by enabling them to combine data streams arriving from different paths and at different times to effectively increase receiver signal-capturing power. MIMO is used in modern wireless standards, including in IEEE 802.11, 3GPP LTE, and mobile WiMAX systems.Sphere decoding algorithm is a lattice reduction algorithm introduced for low complexity MIMO detection SD is a powerful and attractive tool to achieve a high performance close to the Maximum Likelihood (ML),Zero Forcing (ZF) but with less complexity. This paper presents a simulation study on the sphere decoding method and compares the performance with other classical MIMO scheme such as VBLAST and Zero forcing receivers. The simulation tool used is MATLAB communication tool box version 7.1. The performance metric considered is Bit Error Rate (BER) and the channel is assumed to be Rayleigh fading. It is inferred that detection is possible with complexity and gives a better result in terms of Bit Error Rate when comparing general sphere decoding and MMSE.

">

A simulation study on Complex Sphere Decoding for MIMO wireless communication system

G. Ranjitham*, K.R. Shankar Kumar**
* Assistant Professor, Electrical and Electronics Engineering Department, Sri Ramakrishna Engineering College, Coimbatore.
** Professor, Electrical and Communication Engineering, Ranganathan Engineering College, Thondamuthur ,Coimbatore.
Periodicity:April - June'2013
DOI : https://doi.org/10.26634/jwcn.2.1.2309

Abstract

MIMO (Multiple input –Multiple Output) technology is a promising and upcoming technology for the future wireless generation system, as it has got high throughput and diversity gain. MIMO makes antennas work smarter by enabling them to combine data streams arriving from different paths and at different times to effectively increase receiver signal-capturing power. MIMO is used in modern wireless standards, including in IEEE 802.11, 3GPP LTE, and mobile WiMAX systems.Sphere decoding algorithm is a lattice reduction algorithm introduced for low complexity MIMO detection SD is a powerful and attractive tool to achieve a high performance close to the Maximum Likelihood (ML),Zero Forcing (ZF) but with less complexity. This paper presents a simulation study on the sphere decoding method and compares the performance with other classical MIMO scheme such as VBLAST and Zero forcing receivers. The simulation tool used is MATLAB communication tool box version 7.1. The performance metric considered is Bit Error Rate (BER) and the channel is assumed to be Rayleigh fading. It is inferred that detection is possible with complexity and gives a better result in terms of Bit Error Rate when comparing general sphere decoding and MMSE.

Keywords

Complex Sphere Decoding (SD), MIMO,Zero Forcing (ZF), VBLAST ,Bit Error Rate (BER),QPSK,QAM,Wi-MAX.

How to Cite this Article?

Ranjitham, G. and Kumar, K.R.S. (2013). A Simulation Study on Complex Sphere Decoding for MIMO Wireless Communication System, i-manager’s Journal on Wireless Communication Networks. 2(1), 31-34. https://doi.org/10.26634/jwcn.2.1.2309

References

[1]. Foschini, G.J., & Gans M.J. (1998). “On limits of wireless communications in a fading environment when using multiple antennas”(1998), Wireless Personal Communications Vol 6 , pp 311–335.
[2]. Fincke U., Pohst M, (1985) “Improved methods for calculating vectors of short length in a lattice, including a complexity analysis, Mathematics of Computation” (1985), Vol 44 (170),pp 463–471.
[3]. Grotschel M., Lovasz L., & Schrijver A, (1993). “Geometric Algorithms and Combinatorial Optimization” (1993), Springer Verlag.
[4]. Stojnic.M., Vikalo.H., and Hassibi.B, (2008). Speeding up the sphere decoder with H? and SDP inspired lower bounds,” (2008), IEEE Transactions on Signal processing., Vol. 56, No. 2, pp. d
[5]. Damen, M.O., Chkeif, A. and Belfiore, J.C. (2000). “Lattice code decoder for space-time codes,” (2000), IEEE Comm. Letters, Vol. 4, No. 5,pp. 161–163,.
[6]. Jalden J., Ottersten B (2005). ”On the complexity of sphere decoding in digital communications” (2005), IEEE Transactions on Signal Processing Vol 53 ,pp 1474 – 1484.
[7]. Pohst,.M (1981). “On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications,”(1981), ACM SIGSAM Bulletin, Vol. 15, No. 1, pp. 37–44.
[8]. Fincke, U., and Pohst, M. (1985). “Improved methods for calculating vectors of short length in a lattice, including a complexity analysis,”(1985) Math. of Computation, Vol. 44, No. 170, pp. 463–471.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Online 15 15

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.