Title :
Adjustable Reduced Metric-First Tree Search
Author :
Mao, Xinyu ; Ren, Shubo ; Xiang, Haige
Author_Institution :
Sch. of Electr. & Comput. Eng., Peking Univ., Beijing, China
Abstract :
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.
Keywords :
MIMO communication; communication complexity; decoding; multiuser detection; tree searching; QoS; metric-first sphere decoding algorithm; multiple-input multiple-output system; multiuser detection; partial Euclidean distance; reduced metric first tree search; Complexity theory; Lattices; MIMO; Matrix decomposition; Multiuser detection; Noise; Quality of service;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-6250-6
DOI :
10.1109/wicom.2011.6040103
