By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yinman Lee ; Grad. Inst. of Commun. Engi neering, Nat. Chi Nan Univ., Nantou, Taiwan ; Hong-Wei Shieh

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.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:60 ,  Issue: 4 )