A low complexity semidefinite relaxation for large-scale MIMO detection

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.