Reduced-complexity detection algorithms for systems using multi-element arrays

Abstract

In BLAST (Bell-Laboratories LAyered Space Time) systems, multiple transmit and receive antennas are employed to achieve very high spectral efficiencies. The ideal detection method for such systems is the maximum-likelihood (ML) algorithm. However, the ML complexity increases exponentially with the number of transmit antennas and the number of bits per modulation symbol. A reduced-complexity detection method has been suggested, using ordered successive interference cancellation. We consider two other suboptimum techniques: channel-based adaptive group detection and multistep reduced-constellation detection. The goal is to reduce the two aforementioned complexity exponentials. The algorithms efficiently combine linear processing with local ML search. We limit the complexity by maintaining small ML searching areas, while maximizing the performance under the complexity constraint by optimizing the front-end linear processing and the selection of the search areas.