Performance Analysis of the V-BLAST Algorithm: An Analytical Approach

Loyka, Sergey; Gagnon, François

doi:10.1109/twc.2004.830853

Cited by 178 publications

(143 citation statements)

References 14 publications

(24 reference statements)

Supporting

Mentioning

137

Contrasting

Unclassified

Order By: Relevance

“…The SNR gain of the optimum power allocation is almost the same, at high SNR, as that of the optimal ordering procedure (see [6] for details). The computational complexity, however, of the former is much less than that of the latter.…”

Section: Examplesmentioning

confidence: 80%

Performance Analysis of V-BLAST with Optimum Power Allocation

Kostina

Loyka

2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Abstract-Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to Monte-Carlo simulations for validation purposes only. High-SNR approximations for the optimized average block and total error rates are given. The SNR gain of optimization is rigorously defined and studied using analytical tools, including lower and upper bounds, high and low SNR approximations. The gain is upper bounded by the number of transmitters, for any modulation format and any type of fading. This upper bound is achieved at high SNR by the considered optimization strategies. While the average optimization is less complex than the instantaneous one, its performance is almost as good at high SNR. A measure of robustness of the optimized algorithm is introduced and evaluated, including compact closed-form approximations. The optimized algorithm is shown to be robust to perturbations in individual and total transmit powers. Based on the algorithm robustness, a pre-set power allocation is suggested as a lowcomplexity alternative to the other optimization strategies, which exhibits only a minor loss in performance over the practical SNR range.

show abstract

Section: Examplesmentioning

confidence: 80%

Performance Analysis of V-BLAST with Optimum Power Allocation

Kostina

Loyka

2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

show abstract

“…Due to the non-linear nature of interference cancellation, its performance analysis has been considered difficult and most of the existing analytical works make the assumption of perfect channel state information at the receiver (CSIR) [3][4][5][6]. However, channel estimation errors usually exist.…”

Section: Introductionmentioning

confidence: 99%

Effects of Channel Estimation Errors on V-BLAST Detection

Peng

Adachi

Ma³

et al. 2008

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

This paper investigates the effects of channel estimation errors on zero-forcing (ZF) vertical Bell laboratories layered space time (V-BLAST) detection. An analytical method is presented to derive the symbol error probability (SEP) of the signals detected at each stage. The effects of imperfect channel estimation on the SEP performance of V-BLAST detection are then studied. It is shown that ZF-VBLAST detection is very sensitive to the channel estimation errors under high signal to noise ratio (SNR). It is also shown that when optimal ordering is adopted, the effects of channel estimation errors are more significant on the latter detection stages.

show abstract

“…In this paper, we analyze the effect of ordered detection on the diversity gain per layer of the DFD in a MIMO Rayleigh-fading channel with M t transmit antennas and M r (M r ≥ M t ) receive antennas. Although this problem is important for understanding the performance of DFD (V-BLAST), only limited results are available in the literature [3][4] [5]. By relating the layer gains to the singular values of the channel matrix, we derive an upper bound to the diversity gain per layer for any detection ordering, which is D i ≤ (M r − i + 1)(M t − i + 1) for 1 ≤ i ≤ M t .…”

Section: Introductionmentioning

confidence: 99%