Performance of Matrix Decomposition Algorithms in 5G NR MIMO Precoding
Authors:
- 24 August 2022
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 145-149
Abstract
This paper presents a trade-off analysis associated with different matrix decomposition algorithms in the application of MIMO precoding. A scenario of 5G New Radio (NR) Multi-User MIMO (MU-MIMO) downlink involving one base station (BS) equipped with 64 antennas which serves multiple users simultaneously is studied. The channel model follows the 3GPP TDL-C with various levels of antenna correlation. Six different matrix decomposition algorithms are studied, namely QR Modified Gram-Schmidt (QR-MGS), QR householder, Cholesky, LDL, SVD Bidiagonalization, and SVD. An evaluation of the computational complexity of the algorithms is presented and the system performance compared. These analyses allow us to make an informed trade-off between performance and hardware complexity.Keywords
This publication has 14 references indexed in Scilit:
- Hardware architecture for positive definite matrix inversion based on LDL decomposition and back-substitution2017
- On fixed-point implementation of symmetric matrix inversion2015
- On the matrix inversion approximation based on neumann series in massive MIMO systems2015
- Toward the synthesis of fixed-point code for matrix inversion based on Cholesky decomposition2014
- Hardware efficient approximative matrix inversion for linear pre-coding in massive MIMO2014
- Approximative matrix inverse computations for very-large MIMO and applications to linear pre-coding systems2013
- Scaling Up MIMO: Opportunities and Challenges with Very Large ArraysIEEE Signal Processing Magazine, 2012
- Efficient Complex Matrix Inversion for MIMO Software Defined Radio2007
- An introduction to the multi-user MIMO downlinkIEEE Communications Magazine, 2004
- A Transmit Preprocessing Technique for Multiuser MIMO Systems Using a Decomposition ApproachIEEE Transactions on Wireless Communications, 2004