Cluster Computing

, Volume 22, Supplement 6, pp 13645–13652 | Cite as

A novel low complexity downlink linear precoding algorithm for massive MIMO systems

  • D. SubithaEmail author
  • J. M. Mathana


The tremendous advancements in 4G and beyond 4G wireless standards requires a high demand for the increased data rate, high spectral efficiency and minimal power requirement. Massive MIMO is a key technology that can be used to attain all the above requirements at the cost of increased complexity. The performance of this massive MIMO system can be optimized by simple linear precoding techniques, the complexity of which lies on the inversion of large size matrix. In this paper, we propose a large scale low complexity matrix inversion algorithm which is highly suitable for parallel architecture. The proposed algorithm makes use of Chebyshev polynomial and Weyl’s inequality and named as Weyl’s Chebyshev acceleration (WCA) algorithm. This algorithm is further simplified by exploiting the diagonal dominance property of the positive definite Hermitian Gram matrix that is to be inverted. The specialty of this algorithm is, it is inner product free which makes this highly suitable for parallel computing environment and thus the algorithm becomes speedy. The performance of the proposed algorithm is evaluated in urban micro cell scenario and is proven to be more efficient in terms of BER performance and complexity. Also the proposed WCA based precoding algorithm achieves approximately 50% of complexity saving in the total flop count in comparison with the existing algorithms for the micro cell scenario. The BER performance reaches the near optimal results of ZF algorithm as SNR increases.


Massive MIMO Linear precoding Zero-forcing precoding Chebyshev polynomial acceleration Weyl’s inequality 


  1. 1.
    Huawei Technologies Co., Ltd, New Air Interface and Radio Access Virtualization, Huawei White Paper, (2015)Google Scholar
  2. 2.
  3. 3.
  4. 4.
    Larsson, E.G., Edfors, O., Tufvesson, F., Marzetta, T.L.: Massive MIMO for next generation wireless systems. IEEE Commun. Mag. 52(2), 186–195 (2014)CrossRefGoogle Scholar
  5. 5.
    Marzetta, T.L.: Noncooperative cellular wireless with unlimited numbers of base station antennas. IEEE Trans. Wireless Commun. 9(11), 3590–3600 (2010)CrossRefGoogle Scholar
  6. 6.
    Huh, H., Caire, G., Papadopoulos, H.C., Ramprashad, S.A.: Achieving massive MIMO spectral efficiency with a not-so-large number of antennas. IEEE Trans. Wireless Commun. 11(9), 3266–3269 (2012)CrossRefGoogle Scholar
  7. 7.
    Rusek, F., Persson, D., Lau, B.K., Larsson, E.G., Marzetta, T.L., Edfors, O., Tufvesson, F.: Scaling up MIMO: opportunities and challenges with very large arrays. IEEE Signal Process. Mag. 30(1), 40–60 (2013)CrossRefGoogle Scholar
  8. 8.
    Lu, L., Li, G.Y., Swindlehurst, A.L., Ashikhmin, A., Zhang, R.: An overview of Massive MIMO: benefits and challenges. IEEE J. Sel. Topics. Signal Process. 8(5), 742–756 (2014)CrossRefGoogle Scholar
  9. 9.
    Gao, X., Edfors, O., Rusek, F., Tufvesson, F.: Linear pre-coding performance in measured very-large MIMO channels. IEEE Vehicular Technology Conference (VTC Fall) (2011).
  10. 10.
    Prabhu, H., Rodrigues, J., Edfors, O., Rusek, F.: Approximative matrix inverse computations for very-large MIMO and applications to linear pre-coding systems. In: Proceedings of the IEEE wireless communications and networking conference (WCNC). pp. 2710–2715 (2013)Google Scholar
  11. 11.
    Xie, T., Han, Q., Xu, H., Qi, Z., Shen, W.: A low-complexity linear precoding scheme based on SOR method for massive MIMO systems. IEEE Vehicular Technology Conference (VTC Spring) (2015).
  12. 12.
    Xie, T., Dai, L., Gao, X., Dai, X., Zhao, Y.: Low-complexity SSOR-based precoding for massive MIMO systems. IEEE Commun. Lett. 20(4), 744–748 (2016)CrossRefGoogle Scholar
  13. 13.
    Yin, B., Wu, M., Cavallaro, J. R., Studer, C.: Conjugate Gradient-based Soft-Output Detection and Precoding in Massive MIMO Systems. In: Proceedings of the IEEE Global communication conference (2014).
  14. 14.
    Saad, Y.: Polynomial preconditioners from the Hand book of Iterative algorithms for sparse linear systems, pp. 397–400. Society for Industrial and Applied Mathematics, Philadelphia (2003)CrossRefGoogle Scholar
  15. 15.
    Gutknecht, M.H., Stefan, R.: The Chebyshev iteration revisited. Parallel Computing, pp. 263–283. Elsevier, Amsterdam (2002)zbMATHGoogle Scholar
  16. 16.
    Marsli, R.: Bounds for the smallest and largest eigenvalues of Hermitian matrices. Int. J. Algebra 9(8), 379–394 (2015)CrossRefGoogle Scholar
  17. 17.
    Stankovic, V.,Haardt, M.: Genralized design of multi-user MIMO precoding matrices. In: Proceedings of the IEEE Transactions on Wireless Communication. 7(3): pp. 953–961 (2008)CrossRefGoogle Scholar
  18. 18.
    Eng, Y. L.: The use of parallel polynomial preconditioners in the solution of systems of linear equations, Ph.D Thesis, Faculty of Informatics of the University of Ulster, pp. 18–20 (2005)Google Scholar
  19. 19.
    Young, D.M.: Iterative Solution of Large Linear Systems, pp. 301–303. Academic Press, New York and London (1971)Google Scholar
  20. 20.
    Hentila, L., Kyosti, P., Kaske, M., Narandzic, M., Alatossava, M.: Matlab implementation of the WINNER phase II channel model ver 1.1 (2007)Google Scholar
  21. 21.
    Hunger, R.: Floating point operations in matrix-vector calculus, Associate Institute for Signal Processing, Version 1.3, Technical Report (2007)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Electronics and Communication Engineering, S.A. Engineering CollegeAffiliated to Anna UniversityChennaiIndia

Personalised recommendations