New Iterative Detector of MIMO Transmission Using Sparse Decomposition
Authors:
- Yasser FadlallahYFYasser Fadlallah
- Abdeldjalil Aissa-El-BeyAAAbdeldjalil Aissa-El-Bey
- Karine AmisKAKarine Amis
- Dominique PastorDPDominique Pastor
- Ramesh PyndiahRPRamesh Pyndiah
- 29 September 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 64 (8) , 3458-3464
Abstract
This paper addresses the problem of decoding in large-scale multiple-input–multiple-output (MIMO) systems. In this case, the optimal maximum-likelihood (ML) detector becomes impractical due to an exponential increase in the complexity with the signal and the constellation dimensions. This paper introduces an iterative decoding strategy with a tolerable complexity order. We consider a MIMO system with finite constellation and model it as a system with sparse signal sources. We propose an ML relaxed detector that minimizes the Euclidean distance with the received signal while preserving a constant $\ell_{1} $ -norm of the decoded signal. We also show that the detection problem is equivalent to a convex optimization problem, which is solvable in polynomial time. Two applications are proposed, and simulation results illustrate the efficiency of the proposed detector.Keywords
This publication has 17 references indexed in Scilit:
- Massive MIMO for next generation wireless systemsIEEE Communications Magazine, 2014
- Scaling Up MIMO: Opportunities and Challenges with Very Large ArraysIEEE Signal Processing Magazine, 2012
- Graph Implementations for Nonsmooth Convex Programs2007
- On the sphere-decoding algorithm I. Expected complexityIEEE Transactions on Signal Processing, 2005
- An efficient generalized sphere decoder for rank-deficient MIMO systemsIEEE Communications Letters, 2005
- On the complexity of sphere decoding in digital communicationsIEEE Transactions on Signal Processing, 2005
- Optimal sparse representations in general overcomplete bases2004
- Convex Optimization2004
- An O(n 3 L) primal interior point algorithm for convex quadratic programmingMathematical Programming, 1990
- A new polynomial-time algorithm for linear programming1984