Bounded Selective Spanning With Extended Fast Enumeration for MIMO-OFDM Systems Detection

Abstract

Sphere decoders allow receivers in multiple-input multiple-output (MIMO) communications systems to detect QAM symbols with quasi-optimal accuracy and low complexity compared with the ideal maximum likelihood detector. However, their high complexity relative to simple linear detectors means that the latter are still usually adopted, despite their lower detection performance. Configurable sphere decoders, such as selective spanning fast enumeration (SSFE), allow complexity to be reduced at the cost of lower performance and are hence ideal for transceivers for Internet-of-Things equipment, where scale, operating context and resource, and energy budgets vary dramatically. However, SSFE still suffers performance limitations due to the internal heuristics employed for symbol selection and enumeration and real time, and software-defined realizations for even moderately demanding MIMO standards, such as 802.11n, have not been recorded. This paper presents a new variant of SSFE which, by employing novel fast symbol enumeration and modulation dictionary spanning heuristics, increases performance and computational efficiency to the point where very substantial reductions in resource can be achieved without impacting detection accuracy relative to SSFE. This is demonstrated via a series of field programmable gate array-based detectors $2 \times 2$ and $4 \times 4$ , 16-QAM 802.11n MIMO.