基于±1二次规划的低复杂度球形解码算法

从MIMO检测的±1二次规划模型出发,推导了最大似然MIMO检测最优解的必要条件。在此基础上提出了一种基于必要条件的球形解码改进算法,该算法在球形解码剪枝策略的基础上利用必要条件对树型搜索的节点进行进一步剪枝,从而明显降低了运算复杂度,而不降低球形解码检测算法的误比特率性能。

A Tabu Search Algorithm for Quadratic 0-1 Programming Problem

In this paper,quadratic 0-1 programming problem (I) is considered, in terms of its features quadratic 0-1 programming problem is solved by linear approxity heurstic algrothm and a developed tabu search ahgrothm .