Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1303.5947

Effect of Receive Spatial Diversity on the Degrees of Freedom Region in Multi-Cell Random Beamforming

Hieu Duy Nguyen·Rui Zhang·Hon Tat Hui
View original source ↗Read source document ↗Export metadata ↓

Abstract

The random beamforming (RBF) scheme, jointly applied with multi-user diversity based scheduling, is able to achieve virtually interference-free downlink transmissions with only partial channel state information (CSI) available at the transmitter. However, the impact of receive spatial diversity on the rate performance of RBF is not fully characterized yet even in a single-cell setup. In this paper, we study a multi-cell multiple-input multiple-output (MIMO) broadcast system with RBF applied at each base station (BS) and either the minimum-mean-square-error (MMSE), matched filter (MF), or antenna selection (AS) based spatial receiver employed at each mobile terminal. We investigate the effect of different spatial diversity receivers on the achievable sum-rate of multi-cell RBF systems subject to both the intra- and inter-cell interferences. We first derive closed-form expressions for the distributions of the receiver signal-to-interference-plus-noise ratio (SINR) with different spatial diversity techniques, based on which we compare their rate performances at finite signal-to-noise ratios (SNRs). We then investigate the asymptotically high-SNR regime and for a tractable analysis assume that the number of users in each cell scales in a certain order with the per-cell SNR as SNR goes to infinity. Under this setup, we characterize the degrees of freedom (DoF) region for multi-cell RBF systems with different types of spatial receivers, which consists of all the achievable DoF tuples for the individual sum-rate of all the cells. The DoF region analysis provides a succinct characterization of the interplays among the receive spatial diversity, multiuser diversity, spatial multiplexing gain, inter-/intra-cell interferences, and BSs' collaborative transmission.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hieu Duy Nguyen, Rui Zhang, Hon Tat Hui. 2013-06-19. Effect of Receive Spatial Diversity on the Degrees of Freedom Region in Multi-Cell Random Beamforming. https://doi.org/10.1109/wcnc.2013.6555044

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗