Computationally efficient fixed complexity LLL algorithm for lattice-reduction-aided multiple-input–multiple-output precoding

Wei Wang; Meixia Hu; Yongzhao Li; Hailin Zhang; Zan Li

Computationally efficient fixed complexity LLL algorithm for lattice-reduction-aided multiple-input–multiple-output precoding

View Fulltext

Author(s): Wei Wang ¹ ; Meixia Hu ¹ ; Yongzhao Li ¹ ; Hailin Zhang ¹ ; Zan Li ¹
- Affiliations: 1: State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, People's Republic of China
Source: Volume 10, Issue 17, 24 November 2016, p. 2328 – 2335
DOI: 10.1049/iet-com.2016.0062 , Print ISSN 1751-8628, Online ISSN 1751-8636

Received 13/02/2016, Accepted 14/07/2016, Revised 13/07/2016, Published 24/11/2016

In multiple-input–multiple-output broadcast channels, lattice reduction (LR) preprocessing technique can significantly improve the precoding performance. Among the existing LR algorithms, the fixed complexity Lenstra–Lenstra–Lovasz (fcLLL) algorithm applying limited number of LLL loops is suitable for the real-time communication system. However, fcLLL algorithm suffers from higher average complexity. Aiming at this problem, a computationally efficient fcLLL (CE-fcLLL) algorithm for LR-aided (LRA) precoding is developed in this study. First, the authors analyse the impact of fcLLL algorithm on the signal-to-noise ratio performance of LRA precoding by a power factor (PF) which is defined to measure the relation of reduced basis and transmit power of LRA precoding. Then, they propose a CE-fcLLL algorithm by designing a new LLL loop and introducing new early termination conditions to reduce redundant and inefficient LR operation in fcLLL algorithm. Finally, they define a PF loss factor to optimise the PF threshold and the number of LLL loops, which can lead to a performance-complexity tradeoff. Simulation results show that the proposed algorithm for LRA precoding can achieve better bit-error-rate performance than the fcLLL algorithm with remarkable complexity savings in the same upper complexity bound.

References

1. 1)
  - 22. Chen, Z., Dai, X.: ‘A fast complex lattice reduction algorithm for SIC-based MIMO detection’. Proc. IEEE Int. Conf. Communications, London, June 2015, pp. 2283–2288.
2. 2)
  - 24. Yang, H.J., Chun, J., Choi, Y., et al: ‘Codebook-based lattice-reduction-aided precoding for limited-feedback coded MIMO systems’, IEEE Trans. Commun., 2012, 60, (2), pp. 510–524 (doi: 10.1109/TCOMM.2011.122111.100489).
3. 3)
  - 13. Zu, K., de Lamare, R.C., Haardt, M.: ‘Generalized design of low-complexity block diagonalization type precoding algorithms for multiuser MIMO systems’, IEEE Trans. Commun., 2013, 61, (10), pp. 4232–4242 (doi: 10.1109/TCOMM.2013.090513.130038).
4. 4)
  - 21. Zhou, Q., Ma, X.: ‘An improved LR-aided K-best algorithm for MIMO detection’. Proc. IEEE WCSP, Huangshan, October 2012, pp. 1–5.
5. 5)
  - 15. Korkine, A., Zolotareff, G.: ‘Sur les formes quadratiques’, Math. Ann., 1873, 6, (3), pp. 366–389 (doi: 10.1007/BF01442795).
6. 6)
  - 1. Telatar, I.E.: ‘Capacity of multi-antenna Gaussian channels’. Technical Report, AT&T Bell Labs, 1995.
7. 7)
  - 1. Caire, G., Shamai, S.: ‘On the achievable throughput of a multi-antenna Gaussian broadcast channel’, IEEE Trans. Inf.. Theory, 2003, 49, (7), pp. 1691–1706 (doi: 10.1109/TIT.2003.813523).
8. 8)
  - 4. Yu, W., Cioffi, J.M.: ‘Sum capacity of Gaussian vector broadcast channels’, IEEE Trans. Inf. Theory, 2004, 50, (9), pp. 1875–1892 (doi: 10.1109/TIT.2004.833336).
9. 9)
  - 18. Vetter, H., Ponnampalam, V., Sandell, M., et al: ‘Fixed complexity LLL algorithm’, IEEE Trans. Signal Process., 2009, 57, (4), pp. 1634–1637 (doi: 10.1109/TSP.2008.2011827).
10. 10)
  - 8. Windpassinger, C., Fischer, R.F.H., Vencel, T., et al: ‘Precoding in multiantenna and multiuser communications’, IEEE Trans. Wirel. Commun., 2004, 3, (4), pp. 1305–1316 (doi: 10.1109/TWC.2004.830852).
11. 11)
  - 19. Kim, N., Park, H.: ‘Improved lattice reduction aided detections for MIMO systems’. Proc. IEEE VTC, Montreal, Quebec, September 2006, pp. 1–5.
12. 12)
  - 14. Windpassinger, C., Fischer, R.F.H., Huber, J.B.: ‘Lattice-reduction-aided broadcast precoding’, IEEE Trans. Commun., 2004, 52, (12), pp. 2057–2060 (doi: 10.1109/TCOMM.2004.838732).
13. 13)
  - 23. Wubben, D., Seethaler, D., Jalden, J., Matz, G.: ‘Lattice reduction’, IEEE Signal Process. Mag., 2011, 30, (1), pp. 70–91 (doi: 10.1109/MSP.2010.938758).
14. 14)
  - 23. Shao, Z.Y., Cheung, S.W., Yuk, T.I.: ‘Lattice-reduction-aided semidefinite relaxation detection algorithms for multiple-input multiple output systems’, IET Commun., 2014, 8, (4), pp. 448–454 (doi: 10.1049/iet-com.2013.0108).
15. 15)
  - 15. Gan, Y.H., Ling, C., Mow, W.H.: ‘Complex lattice reduction algorithm for low-complexity full-diversity MIMO detection’, IEEE Trans. Signal Process., 2009, 57, (7), pp. 2701–2710 (doi: 10.1109/TSP.2009.2016267).
16. 16)
  - 11. Taherzadeh, M., Mobasher, A., Khandani, A.K.: ‘Communication over MIMO broadcast channels using lattice-basis reduction’, IEEE Trans. Inf. Theory, 2007, 53, (12), pp. 4567–4582 (doi: 10.1109/TIT.2007.909095).
17. 17)
  - 17. Jaldén, J., Seethaler, D., Matz, G.: ‘Worst-and average-case complexity of lll lattice reduction in MIMO wireless systems’. Proc. IEEE ICASSP, Las Vegas, NV, April 2008, pp. 2685–2688.
18. 18)
  - 9. Hochwald, B.M., Peel, C.B., Swindlehurst, A.L.: ‘A vector-perturbation technique for near-capacity multiantenna multiuser communication – part II: perturbation’, IEEE Trans. Commun., 2003, 53, (1), pp. 537–544.
19. 19)
  - 14. Minkowski, H.: ‘Ueber die positiven quadratischen formen und Ãijber kettenbruch Ãdhnliche algorithmen’, J. fÃijr Reine Angew. Math., 1891, 1891, (107), pp. 278–297 (doi: 10.1515/crll.1891.107.278).
20. 20)
  - 7. Windpassinger, C., Fischer, R.F.H.: ‘Precoding and loading for blast-like systems’. Proc. IEEE Int. Conf. Communication, Anchorage, AK, May 2003, pp. 3061–3065.
21. 21)
  - 5. Spencer, Q., Peel, C., Swindlehurst, A., et al: ‘An introduction to the multi-user MIMO downlink’, IEEE Commun. Mag., 2004, 42, (10), pp. 60–67 (doi: 10.1109/MCOM.2004.1341262).
22. 22)
  - 13. Minkowski, H.: ‘Ueb er positive quadratische formen’, J. fÃijr Reine Angew. Math., 1886, 1886, (99), pp. 1–9 (doi: 10.1515/crll.1886.99.1).
23. 23)
  - 18. Kazemi, M., Aghaeinia, H.: ‘Approximate ergodic capacity of multiuser massive multiple input multiple output in a Rayleigh fading uplink channel with variance profile’, IET Commun., 2015, 9, (6), pp. 844–852 (doi: 10.1049/iet-com.2014.0566).
24. 24)
  - 2. Peel, C., Hochwald, B., Swindlehurst, L.: ‘A vector-perturbation technique for near-capacity multi-antenna multi-user communication. Part I: Channel inversion and regularization’, IEEE Trans. Commun., 2005, 53, (1), pp. 195–202 (doi: 10.1109/TCOMM.2004.840638).
25. 25)
  - 20. Zhao, K., Du, S.: ‘Full-diversity approximated lattice reduction algorithm for low-complexity MIMO detection’, IEEE Commun. Lett., 2014, 18, (6), pp. 1079–1082 (doi: 10.1109/LCOMM.2014.2323235).
26. 26)
  - 13. Lenstra, A., Lenstra, H., Lovasz, L.: ‘Factoring polynomials with rational coefficients’, Math. Ann., 1982, 261, pp. 515–534 (doi: 10.1007/BF01457454).

Login

Not registered yet?

Share

Tools

Login to add to favourites

Key

Computationally efficient fixed complexity LLL algorithm for lattice-reduction-aided multiple-input–multiple-output precoding

References

Related content