| 摘要 |
A depth-first tree search method for the tree search-based detection of received signals in multiple-input multiple-output (MIMO) channels is proposed. In said method, leaf nodes of a search tree represent potential transmitted bits. The method includes determining bits that have most likely been transmitted and determining reliability values for said bits, said reliability values being determined on the basis of status data on the leaf nodes determined during the tree search. A search sphere for the tree search is limited on the basis of status data on the leaf nodes determined during the tree search. According to the invention, the search sphere for the tree search is limited independently of the status data being processed to calculate the reliability values, namely by means of an n-tuple of status data on leaf nodes determined during the tree search, a maximum value of the status data in the tuple being defined as the radius of the search sphere. The proposed method allows the number and the extent of the operations and hardware units required for limiting the search sphere to be significantly reduced, thus increasing the performance and coverage efficiency of the detection and allowing the method to be used in mobile systems. |
