Reduced complexity maximum likelihood detection for V-BLAST systems
He, L.
Ge, H.
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA;
This paper appears in: Military Communications Conference, 2003. MILCOM 2003. IEEE
Publication Date: 13-16 Oct. 2003
Volume: 2,
On page(s): 1386- 1391 Vol.2
ISSN:
ISBN: 0-7803-8140-8
INSPEC Accession Number: 8047143
Digital Object Identifier: 10.1109/MILCOM.2003.1290429
Current Version Published: 2004-05-04
Abstract
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
