New Iterative Detector of MIMO Transmission Using Sparse Decomposition

IEEE Transactions on Vehicular Technology

Volumn 64, Issue 8, 2015, Pages 3458-3464

  Fadlallah, Yasser ^a   Aissa El Bey, Abdeldjalil ^a   Amis, Karine ^a   Pastor, Dominique ^a   Pyndiah, Ramesh ^a  

^a UNIVERSITÉ EUROPÉENNE DE BRETAGNE   (France)

Author keywords

Convex optimization; low complexity detector; maximum likelihood (ML) detector; multiple input multipleoutput (MIMO) systems; sparse decomposition

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CONVEX OPTIMIZATION; MAXIMUM LIKELIHOOD; MIMO SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

CONVEX OPTIMIZATION PROBLEMS; DETECTION PROBLEMS; EUCLIDEAN DISTANCE; EXPONENTIAL INCREASE; MAXIMUM LIKELIHOOD DETECTORS; MIMO TRANSMISSION; MULTIPLE-INPUT-MULTIPLE-OUTPUT SYSTEMS; SPARSE DECOMPOSITION;

ITERATIVE DECODING;

EID: 84939433647     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVT.2014.2360687     Document Type: Article

References (23)

1. E. Telatar, "Capacity of multi-antenna Gaussian channels," Eur. Trans. Telecommun., vol. 10, no. 6, pp. 585-595, Nov./Dec. 1999.
2. M. O. Damen, H. E. Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2389-2402, Oct. 2003.
3. B. Hassibi and H. Vikalo, "On the sphere decoding algorithm I. expected complexity," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2806-2818, Aug. 2005.
4. J. Jalden and B. Ottersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Process., vol. 53, no. 4, pp. 1474-1484, Apr. 2005.
5. T. P. Ren, Y. L. Guan, C. Yuen, and E. Y. Zhang, "Block-orthogonal space time code structure and its impact on QRDM decoding complexity reduction," IEEE J. Sel. Topics Signal Process., vol. 5, no. 8, pp. 1438-1450, Dec. 2011.
6. S. Boyd and L. Vandenberghe, Convex Optimization. New York, NY, USA: Cambridge Univ. Press, 2004.
7. Y. Fadlallah, A. Aissa-El-Bey, K. Amis, D. Pastor, and R. Pyndiah, "New decoding strategy for underdetermined MIMO transmission using sparse decomposition," in Proc. EUSIPCO, Marrakech, Morocco, Sep. 2013, pp. 1-5.
8. A. Aissa-El-Bey, D. Pastor, S. M. Aziz-Sbai, and Y. Fadlallah, "Recovery of finite alphabet solutions of underdetermined linear system," IEEE Trans. Inf. Theory, submitted for publication.
9. D. Donoho, "For most large underdetermined systems of linear equations, the minimal L1 norm solution is also the sparsest solution," Commun. Pure Appl. Math., vol. 59, no. 6, pp. 797-829, Jun. 2006.
10. D. M. Malioutov, M. Cetin, and A. S. Willsky, "Optimal sparse representations in general overcomplete bases," in Proc. IEEE ICASSP, 2004, vol. 2, pp. ii-793-1-ii-793-6.
11. N. Karmarkar, "A new polynomial-time algorithm for linear programming," in Proc. 16th Annu. ACM Symp. Theory Comput., 1984, pp. 302-311.
12. D. Goldfarb and S. Liu, "An o (n 3 l) primal interior point algorithm for convex quadratic programming," Math. Programm., vol. 49, no. 1-3, pp. 325-340, Nov. 1990.
13. MIT Lecture, Big O Notation, 2003. [Online]. Available: http://web.mit. edu/16.070/www/lecture/
14. E. G. Larsson, O. Edfors, F. Tufvesson, and T. L. Marzetta, "Massive MIMO for next generation wireless systems," IEEE Commun. Mag., vol. 52, no. 2, pp. 186-195, Feb. 2014.
15. F. Rusek et al., "Scaling up MIMO: Opportunities and challenges with very large arrays," IEEE Signal Process. Mag., vol. 30, no. 1, pp. 40-60, Jan. 2012.
16. M. Grant and S. Boyd, CVX: Matlab software for disciplined convex programming version 2.0 beta, Sep. 2012. [Online]. Available: http://cvxr. com/cvx
17. M. Grant and S. Boyd, "Graph implementations for nonsmooth convex programs," in Recent Advances in Learning and Control. London, U.K.: Springer-Verlag, 2008, ser. Lecture Notes in Control and Information Sciences, pp. 95-110.
18. Gurobi Optimizer Reference Manual, Gurobi Optimization, Inc., Bad Homburg, Germany, 2012.
19. T. Cui and C. Tellambura, "An efficient generalized sphere decoder for rank-deficient MIMO systems," IEEE Commun. Lett., vol. 9, no. 5, pp. 423-425, May 2005.
20. A. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inf. Theory, vol. IT-13, no. 2, pp. 260-269, Apr. 1967.
21. B. Hassibi, "An efficient square-root algorithm for blast," in Proc. IEEE ICASSP, 2000, vol. 2, pp. II737-II740.
22. E. Landau, Handbuch der Lehre von der Verteilung der Primzahlen. New York, NY, USA: AMS Chelsea, 1909.
23. D. Wubben, R. Bohnke, V. Kuhn, and K.-D. Kammeyer, "MMSE extension of v-blast based on sorted QR decomposition," in Proc. IEEE 58th VTC-Fall, 2003, vol. 1, pp. 508-512.