Partial Optimal MIMO Detection for BPSK Communication System

The maximum likelihood (ML) MIMO detector for BPSK communication system can be posed as a binary quadratic programming. The computation for optimal solution has exponential complexity in terms of the number of transmit antennas in general. It becomes a barrier to ML detector for its applications in the real time communication environment, especially in the case that the number of transmit antenna is large. In this paper, we proposed a novel MIMO detection algorithm. Using the novel algorithm, part of globally optimal solution of ML detector can be decided with low computational complexity, and then we can substitute them into the original binary quadratic programming and obtain a smaller-scale binary quadratic programming for the undecided information sequences. Finally we can use some conventional sub-optimal detectors to solve the smaller-scale problem so that the novel algorithm can achieve better performance than that of conventional ones with lower computational complexity. Simulation results verify the validity of the algorithm.