Adjustable Reduced Metric-First Tree Search

Tree search is an important kind of detection method. It can be used in multiple-input multiple-output systems detection and the multi-user detection. In this paper, a novel adjustable reduced metric-first sphere decoding algorithm for tree search has been proposed. By setting a suitable and adjustable threshold, the proposed algorithm cuts nodes whose partial Euclidean distances are larger than it. Simulation results show that the algorithm can reduce the complexity of the MFSD and the performance and complexity can be adjusted according QoS.