By Topic

Reduced complexity maximum likelihood detection for V-BLAST 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)
Lei He ; Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA ; Ge, H.

Proposed and studied in this work is a reduced complexity maximum likelihood (ML) detection scheme, which uses a predecoder guided local exhaustive search, for V-BLAST systems. A polygon searching algorithm and an ordered successive interference cancellation (O-SIC) sphere searching algorithm are major components of the proposed multistep ML detectors. The effects of predecoder's performance on the total decoding complexity was studied by simulation. The complexity of the proposed algorithm depends on the operating signal to noise ratio (SNR) of the system. At reasonable high SNRs, its complexity is comparable to that of O-SIC algorithm, a commonly used decoding algorithm for V-BLAST. For V-BLAST systems using a large number of transmit antennas, we also propose a new detection algorithm termed ordered group-wise interference cancellation (O-GIC) to further reduce decoding complexity. The O-GIC based detection scheme is not a ML detection scheme, however, its performance is shown to outperform that of the O-SIC.

Published in:

Military Communications Conference, 2003. MILCOM '03. 2003 IEEE  (Volume:2 )

Date of Conference:

13-16 Oct. 2003