Skip to main content
Springer Nature Link
Log in

A Modified Euclidean Norm Computation for Complexity Reduction in MIMO Decoder

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In this paper, we propose a modified Euclidean norm computation for breadth-first signal decoder (BSIDE) that reduces the computational complexity without sacrificing the performance. We exploit the reordered channel representation and rewrite the Euclidean norm computation in a simpler form, which results at significant reduction in number of operations required to decode the transmitted symbols. Also from the simulation results, it is observed that the reduction in complexity is 59 % for 2 × 2 and 75 % for the 4 × 4 multiple-input multiple output systems when compared to BSIDE.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Wolniansky, P. W., Foschini, G. J., Golden, G. D., & Valenzuela R. A. (1998). V-BLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel. In The Union of Radio Science (USRI) international symposium on signals, systems and electronics (ISSSE) (pp. 295–300).

  2. Dai, X., Zou, R., Sun, S., & Wang, Y. (2013). Reducing the complexity of quasi-ML detectors for MIMO systems through simplified branch metric and accumulated branch metric based detection. IEEE Communications Letters, 17(5), 916–919.

    Article  Google Scholar 

  3. Shen, C., Eltawil, A. M., Salama, K. N., & Mondal, S. (2012). A best-first soft/hard decision tree searching MIMO decoder for a 4×4 64-QAM system. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 20(8), 1537–1541.

  4. Roger, S., Gonzalez, A., Almenar, V., & Vidal, A. M. (2011). Practical aspects of preprocessing techniques for K-Best tree search MIMO detectors. International Journal of Computers and Electrical Engineering, 37(4), 451–460.

  5. Chen, R. H., & Chung, W. H. (2012). Reduced complexity MIMO detection scheme using statistical search space reduction. IEEE Communications Letters, 16(3), 292–295.

    Article  MathSciNet  Google Scholar 

  6. Zhang, Y. (2012). Effective reduction for sphere decoder in linear multi-input multi-output channel systems. IET Communications, 6(11), 1573–1578.

    Article  MathSciNet  Google Scholar 

  7. Han, S., Cui, T., & Tellambura, C. (2012). Improved K-best sphere detection for uncoded and coded MIMO systems. IEEE Wireless Communications Letters, 1(5), 472–475.

    Article  Google Scholar 

  8. Shen, C., & Eltawil, A. M. (2010). A radius adaptive K-best decoder with early termination algorithm and VLSI architecture. IEEE Transaction on Circuits and Systems, 57(9), 2476–2486.

    Article  MathSciNet  Google Scholar 

  9. Gamba, M. D., & Masera, G. (2011). Look-ahead sphere decoding algorithm and VLSI architecture. IET Communications, 5(9), 1275–1285.

    Article  MathSciNet  MATH  Google Scholar 

  10. Gukung, H., Song, L., Oh, J., Lee, J., & Yoon, S. (2008). Breadth-first signal decoder: A novel maximum likelihood scheme for multi input multi output systems. IEEE Transactions on Vehicular Technology, 57, 1576–1583.

    Article  Google Scholar 

  11. Azzam, L., &Ayanoglu, E. (2009). Reduced complexity sphere decoding via a reordered lattice representation. IEEE Transactions on Communications, 57(9), 2564–2569.

  12. Ramya, J., & Nakkeeran, R. (2013). A novel complexity reduction using similarity property of QAM for combined ML-ZF detection of MIMO systems. IEICE Communication Express, 2(7), 300–306.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Communication Engineering, Pondicherry Engineering College, Puducherry, 605014, India

    Ramya Jothikumar

  2. Department of Electronics Engineering, School of Engineering and Technology, Pondicherry University, Puducherry, 605014, India

    Nakkeeran Rangaswamy

Authors
  1. Ramya Jothikumar
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Nakkeeran Rangaswamy
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ramya Jothikumar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jothikumar, R., Rangaswamy, N. A Modified Euclidean Norm Computation for Complexity Reduction in MIMO Decoder. Wireless Pers Commun 85, 1251–1259 (2015). https://doi.org/10.1007/s11277-015-2838-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-015-2838-8

Keywords