A new effective branch-and-bound algorithm to the high order MIMO detection problem

作者：Tian, Ye; Li, Ke; Yang, Wei; Li, Zhiyong^*

来源：Journal of Combinatorial Optimization, 2017, 33(4): 1395-1410.

DOI：10.1007/s10878-016-0045-5

• MIMO detection problem
• Quadratic Programming
• New convex reformulation
• Branch-and-Bound algorithm

This paper develops a branch-and-bound method based on a new convex reformulation to solve the high order MIMO detection problem. First, we transform the original problem into a constrained quadratic programming problem with the smallest size. The size of the reformulated problem is smaller than those problems derived by some traditional transformation methods. Then, we propose a new convex reformulation which gets the maximized average objective value as the lower bound estimator in the branch-and-bound scheme. This estimator balances very well between effectiveness and computational cost. Thus, the branch-and-bound algorithm achieves a high total efficiency. Several simulations are used to compare the performances of our method and other benchmark methods. The results show that this proposed algorithm is very competitive for high accuracy and relatively good efficiency.

• 出版日期2017-5
• 单位西南财经大学