Multistage MIMO detection using reduced basis optimality tests

Reducing the computational complexity of well-performing Multiple Inputs Multiple Outputs (MIMO) detection schemes is a crucial step toward designing high-throughput, low-cost MIMO receivers. In this paper we present a general multistage approach to MIMO detection, where a low complexity detector processes the received signal, and only few selected symbols are reprocessed using a more efficient, but more complex scheme. The global complexity is hence reduced while achieving near optimal symbol-space performance. Extending the work that was presented in [9], data that need further processing are identified using a reduced basis optimality test. Performing the test in the reduced lattice space diminishes the probability of false alarm of our test at no extra cost in terms of complexity, except during initialization. Usage of the secondary detector is thus more efficient as almost no data are unnecessarily reprocessed.