The Expected Complexity of Standard Sphere Decoding Algorithm in Transmit Correlated MIMO Channels
Jibo Wei · Signal Processing · 2008
The sphere decoding (SD) algorithm is widely considered to be an efficient approach to obtain maximum likelihood (ML) performance in MIMO detection.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 change the complexi- ty of the SD algorithm.In this paper,we study the standard SD algorithm in transmit correlated MIMO channels;the exact expression of the expected complexity is derived.Simulations show the effect of transmit correlation on the complexity of the algorithm,for different sig- nal to noise ratios (SNR) and numbers of antennas.