Low-Complexity Groupwise OSIC-ZF Detection for $N \times N$ Spatial Multiplexing Systems

In this paper, we present a low-complexity groupwise ordered successive interference canceler (OSIC) with the zero-forcing (ZF) criterion for N × N spatial multiplexing systems. The proposed detection is composed of a number of processing stages, and at each stage, a fraction of the transmitted data streams are nulled to zero. In this way, the original matrix-inverse operations are replaced by a series of inversions with smaller sizes, and the computational complexity can then be largely reduced. We show that this groupwise OSIC-ZF approach can provide a good tradeoff between the computational complexity and the error-rate performance and, therefore, is very attractive as a new detection method standing between the linear ZF detection and the optimal OSIC-ZF detection.