Journal of Combinatorial Optimization

, Volume 35, Issue 2, pp 473–492 | Cite as

A low complexity semidefinite relaxation for large-scale MIMO detection

Article
  • 38 Downloads

Abstract

Many wireless communication problems is based on a convex relaxation of the maximum likelihood problem which further can be cast as binary quadratic programs (BQPs). The two standard relaxation methods that are widely used for solving general BQPs such as spectral methods and semidefinite programming problem (SDP), each have their own advantages and disadvantages. It is widely accepted that small and medium sized SDP problems can be solved efficiently by interior point methods. Albeit, semidefinite relaxation has a tighter bound for large scale problems, but its computational complexity is high. However, Row-by-Row method (RBR) for solving SDPs could be opted for an alternative for large-scale MIMO detection because of low complexity. The present work is a spectral SDP-cut formulation to which the RBR is applied for large-scale MIMO detection. A modified RBR algorithm with tighter bound is presented to specify the efficiency in detecting massive MIMO.

Keywords

Multiple-input multiple-output Maximum likelihood detection Semidefinite relaxation Spectral cut Row-by-Row method 

References

  1. Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, CambridgeCrossRefMATHGoogle Scholar
  2. Damen MO, Gamal HE, Caire G (2003) On maximum likelihood detection and the search for the closest lattice point. IEEE Trans Inf Theory 49:2389–2402MathSciNetCrossRefMATHGoogle Scholar
  3. Foschini GJ (1996) Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas. Bell Labs Tech J 1:41–59CrossRefGoogle Scholar
  4. Grant M, Boyd S (2008) Graph implementations for nonsmooth convex programs. In: Blondel V, Boyd S, Kimura H (eds) Recent advances in learning and control (a tribute to M. Vidyasagar). Lecture notes in control and information sciences, Springer, pp 95–110Google Scholar
  5. Grant M, Boyd S (2012) CVX Research, Inc. CVX: Matlab software for disciplined convex programming, version 2.0 betaGoogle Scholar
  6. Jaldén J, Ottersten B (2005) On the complexity of sphere decoding in digital communications. IEEE Trans Signal Process 53:1474–1484MathSciNetCrossRefMATHGoogle Scholar
  7. Kisialiou M, Luo X, Luo Z-Q (2009) Efficient implementation of quasimaximum likelihood detection based on semidefinite relaxation. IEEE Trans Signal Process 57:4811–4822MathSciNetCrossRefGoogle Scholar
  8. Luo Z-Q, Chang T-H (2010) SDP relaxation of homogeneous quadratic optimization: approximation bounds and applications. In: Palomar DP, Eldar YC (eds) Convex optimization in signal processing and communications, chapter 4. Cambridge University Press, CambridgeGoogle Scholar
  9. Luo Z-Q, Ma W-K, So AM-C, Ye Y et al (2010) Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process Mag 27(3):20–34CrossRefGoogle Scholar
  10. Ma W-K, Davidson TN, Wong KM et al (2002) Quasi-maximum-likelihood multiuser detection using semidefinite relaxation with application to synchronous CDMA. IEEE Trans Signal Process 50:912–922MathSciNetCrossRefMATHGoogle Scholar
  11. Ma W-K, Ching PC, Ding Z (2004) Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems. IEEE Trans Signal Process 52:2862–2872CrossRefGoogle Scholar
  12. Ma W-K, Su C-C, Jaldén J et al (2009) The equivalence of semidefinite relaxation MIMO detectors for higher order QAM. IEEE J Sel Top Signal Process 3:1038–1052CrossRefGoogle Scholar
  13. Malick J (2007) Other manifestations of the Schur complement. Linear Algebra Appl 39:609–622MathSciNetMATHGoogle Scholar
  14. Mobasher A, Taherzadeh M, Sotirov R et al (2007) A near-maximum-likelihood decoding algorithm for MIMO systems based on semidefinite programming. IEEE Trans Inf Theory 53:3869–3886CrossRefMATHGoogle Scholar
  15. Steingrimsson B, Luo Z-Q, Wong KM (2003) Soft quasi-maximumlikelihood detection for multiple-antenna wireless channels. IEEE Trans Signal Process 51:2710–2719CrossRefGoogle Scholar
  16. Sturm JF (1999) Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim Methods Softw 11:625–653MathSciNetCrossRefMATHGoogle Scholar
  17. Tan P, Rasmussen L (2001) The application of semidefinite programming for detection in CDMA. IEEE J Sel Areas Commun 19:1442–1449CrossRefGoogle Scholar
  18. Tarokh V, Seshadri N, Calderbank V (1998) Space-time codes for high data rate wireless communications: performance criterion and code construction. IEEE Trans Inf Theory 44:744–765MathSciNetCrossRefMATHGoogle Scholar
  19. Toh KC, Todd MJ, Tütüncü RH (1999) SDPT3-a Matlab software package for semidefinite programming. Optim Methods Softw 11/12:545–581MathSciNetCrossRefMATHGoogle Scholar
  20. Verdú S (1989) Computational complexity of optimum multiuser detection. Algorithmica 4:303–312MathSciNetCrossRefMATHGoogle Scholar
  21. Wai H-T, Ma W-K, So A-MC (2011) Cheap semidefinite relaxation MIMO detection using Row-by-Row block coordinate descent. In: IEEE international conference on acoustics, speech and signal processing (ICASSP), pp 3256–3259Google Scholar
  22. Wang P, Shen C, van den Hengel A (2013) A fast semidefinite approach to solving binary quadratic problems. In: Proceedings of IEEE conference on computer vision and pattern recognitionGoogle Scholar
  23. Wen Z, Goldfarb D, Ma S, Scheinberg K (2009) Row by row methods for semidefinite programming. Technical report, Department of IEOR, Columbia UniversityGoogle Scholar
  24. Zhang F (ed) (2005) The Schur complement and its applications Numerical methods and algorithms. Springer, Berlin, p 4Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Department of MathematicsInternational Institute of Information TechnologyBhubaneswarIndia
  2. 2.Department of MathematicsIndian Institute of Technology KharagpurKharagpurIndia

Personalised recommendations