The expected complexity of sphere decoding algorithm in spatial correlated MIMO channels

Authors:
Lan Xing;Wei Ji-bo
Affiliations:
National University of Defense Technology, Changsha, China;National University of Defense Technology, Changsha, China
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 2
Cited 0

On the sphere-decoding algorithm I. Expected complexity

IEEE Transactions on Signal Processing - Part I
Spatial multiplexing in correlated fading via the virtual channel representation

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The sphere decoding (SD) algorithm is widely considered to be an efficient approach to obtain maximum likelihood (ML) performance in MIMO detection. At present, almost all of the research about the SD algorithm is based on the assumption of independent and identically distributed channel coefficients. However, the channel coefficients are often correlated in practice, which cause the complexity of the SD algorithm to vary. In this paper, we give a theoretical analysis of the complexity of Fincke and Pohst's(FP) SD algorithm in spatial correlated MIMO channels; the exact expression of the expected complexity is derived. We present simulation results obtained from this expression to show the effect of spatial correlation on the complexity of the algorithm, for different Signal-to-Noise Ratios (SNR) and level of spatial correlations.