Search arXivSearch

arXiv · 1009.4128

Asymptotic Spectral Efficiency of Multi-antenna Links in Wireless Networks with Limited Tx CSI

Abstract

An asymptotic technique is presented for finding the spectral efficiency of multi-antenna links in wireless networks where transmitters have Channel-State-Information (CSI) corresponding to their target receiver. Transmitters are assumed to transmit independent data streams on a limited number of channel modes which limits the rank of transmit covariance matrices. This technique is applied to spatially distributed networks to derive an approximation for the asymptotic spectral efficiency in the interference-limited regime as a function of link-length, interferer density, number of antennas per receiver and transmitter, number of transmit streams and path-loss exponent. It is found that targeted-receiver CSI, which can be acquired with low overhead in duplex systems with reciprocity, can increase spectral efficiency several fold, particularly when link lengths are large, node density is high or both. Additionally, the per-link spectral efficiency is found to be a function of the ratio of node density to the number of receiver antennas, and that it can often be improved if nodes transmit using fewer streams. These results are validated for finite-sized systems by Monte-Carlo simulation and are asymptotic in the regime where the number of users and antennas per receiver approach infinity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Siddhartan Govindasamy, Daniel W. Bliss, David H. Staelin. 2010-09-21. Asymptotic Spectral Efficiency of Multi-antenna Links in Wireless Networks with Limited Tx CSI. https://arxiv.org/abs/1009.4128

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