 |
Free and accessible knowledge |
Conference papers
Low-complexity detector for very large and massive MIMO transmission
Abstract : Maximum-Likelihood (ML) joint detection has been proposed as an optimal strategy that detects simultaneously the transmitted signals. In very large multiple-input-multiple output (MIMO) systems, the ML detector becomes intractable due the computational cost that increases exponentially with the antenna dimensions. In this paper, we propose a relaxed ML detector based on an iterative decoding strategy that reduces the computational cost. We exploit the fact that the transmit constellation is discrete, and remodel the channel as a MIMO channel with sparse input belonging to the binary set {0, 1}. The sparsity property allows us to relax the ML problem as a quadratic minimization under linear and l1-norm constraint. We then prove the equivalence of the relaxed problem to a convex optimization problem solvable in polynomial time. Simulation results illustrate the efficiency of the low-complexity proposed detector compared to other existing ones in very large and massive MIMO context.
Cited literature [18 references]
https://hal.archives-ouvertes.fr/hal-01203097
Contributor : Bibliothèque Télécom Bretagne Connect in order to contact the contributor
Submitted on : Tuesday, September 22, 2015 - 11:58:50 AM
Last modification on : Monday, March 14, 2022 - 11:08:11 AM
Long-term archiving on: : Tuesday, December 29, 2015 - 7:14:44 AM
Contributor : Bibliothèque Télécom Bretagne Connect in order to contact the contributor
Submitted on : Tuesday, September 22, 2015 - 11:58:50 AM
Last modification on : Monday, March 14, 2022 - 11:08:11 AM
Long-term archiving on: : Tuesday, December 29, 2015 - 7:14:44 AM
File
edas.paper-1570110597.pdf
Files produced by the author(s)