Search arXivSearch

arXiv · 0811.2525

Amendment to "Performance Analysis of the V-BLAST Algorithm: An Analytical Approach." [1]

Abstract

An analytical technique for the outage and BER analysis of the nx2 V-BLAST algorithm with the optimal ordering has been presented in [1], including closed-form exact expressions for average BER and outage probabilities, and simple high-SNR approximations. The analysis in [1] is based on the following essential approximations: 1. The SNR was defined in terms of total after-projection signal and noise powers, and the BER was analyzed based on their ratio. This corresponds to a non-coherent (power-wise) equal-gain combining of both the signal and the noise, and it is not optimum since it does not provide the maximum output SNR. 2. The definition of the total after-projection noise power at each step ignored the fact that the after-projection noise vector had correlated components. 3. The after-combining noises at different steps (and hence the errors) were implicitly assumed to be independent of each other. Under non-coherent equal-gain combining, that is not the case. It turns out that the results in [1] hold also true without these approximations, subject to minor modifications only. The purpose of this note is to show this and also to extend the average BER results in [1] to the case of BPSK-modulated V-BLAST with more than two Rx antennas (eq. 18-20). Additionally, we emphasize that the block error rate is dominated by the first step BER at the high-SNR mode (eq. 14 and 21).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergey Loyka, Francois Gagnon. 2008-11-15. Amendment to "Performance Analysis of the V-BLAST Algorithm: An Analytical Approach." [1]. https://arxiv.org/abs/0811.2525

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT