Name
Abstract | ||
|---|---|---|
In this work, we present a low-complexity linear precoding scheme for downlink large-scale multiple-input multiple-output (MIMO) systems. The proposed scheme can achieve near minimum mean square error (MMSE) precoding performance in terms of the sum rate and is based on a matrix polynomial instead of matrix inversion. Simulation results show that matrix polynomials consisting of only a few terms are sufficient to closely approach the sum rate of the classical MMSE precoder and to perform orders of magnitude better than the simple conjugate beamforming (BF) precoder. We derive exact expressions for the computational complexity of the proposed scheme in terms of the number of additions and multiplications and compare it to the complexity of the BF and MMSE precoders. Our complexity analysis shows that for large number of base station antennas N compared to the number of generated transmit symbols τ per channel estimate and large number of users K, the proposed polynomial precoder has a lower complexity than the classical MMSE precoder. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/PIMRC.2013.6666306 | PIMRC |
Keywords | Field | DocType |
computational complexity,precoding | Mathematical optimization,Polynomial,Matrix (mathematics),MIMO,Algorithm,Minimum mean square error,Real-time computing,Zero-forcing precoding,Matrix polynomial,Precoding,Mathematics,Computational complexity theory | Conference |
ISSN | Citations | PageRank |
2166-9570 | 23 | 0.91 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shahram Zarei | 1 | 60 | 6.63 |
| Wolfgang H. Gerstacker | 2 | 358 | 43.05 |
| R. Muller | 3 | 1206 | 124.92 |
| Robert Schober | 4 | 8448 | 488.41 |