Reduced complexity maximum likelihood detection for V-BLAST systems

Authors:
Lei He;Hongya Ge
Affiliations:
Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ;Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ
Venue:
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Year:
2003

Citing 4
Cited 0

On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas

Wireless Personal Communications: An International Journal
A universal lattice code decoder for fading channels

IEEE Transactions on Information Theory
Group detection for synchronous Gaussian code-division multiple-access channels

IEEE Transactions on Information Theory
Simplified processing for high spectral efficiency wireless communication employing multi-element arrays

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proposed and studied in this work is a reduced complexity maximum likelihood (ML) detection scheme, which uses a pre-decoder guided local exhaustive search, for VBLAST 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 pre-decoder'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.