Depth-first tree search algorithms provide a promising approach to solve the detection problems in MIMO systems. Realizations like the List Sphere Detector (LSD) or the Single Tree Search (STS) enable near max-log detection at reduced but still high complexity. In this paper we show how the complexity of List Sphere Detection can be significantly reduced by MMSE preprocessing in combination with a novel unbiased and separated candidate handling. Therefor, we propose an extension of the LSD by search tuples. Without any performance loss, the resulting Tuple Search (TS) algorithm enables major reduction of sphere sizes and enables moreover a detection with flexible performance respectively complexity. Avoiding loss of useful status information, caused by unbiased MMSE preprocessing or small candidate storage, is provided by a novel matched candidate determination, leading also to reduced hardware complexity. The combination of these methods enable highperformance soft-out detection at very low complexity. More specifically, this enables a performance improvement up to 1 dB at half the complexity of common LSD or STS algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.