Search arXivSearch

arXiv · 1004.4826

Impact of Channel Asymmetry on Base Station Cooperative Transmission with Limited Feedback

Abstract

Base station (BS) cooperative transmission, also known as coordinated multi-point transmission (CoMP), is an effective way to avoid inter-cell interference in universal frequency reuse cellular systems. To gain the promised benefit, however, huge feedback overhead is in demand to gather the channel information. In this paper, we analyze the impact of channel asymmetry, which is inherent in CoMP systems, on downlink BS cooperative transmission with limited feedback. We analyze the per-user rate loss of a multi-user CoMP system led by quantization. Per-cell quantization of multicell channels is considered, which quantizes the local channel and cross channel separately and is more feasible in practice. From both the analytical and simulation results, we provide a whole picture on various critical factors that lead to the performance loss. Specifically, we show that the per user rate loss led by limited feedback depends on the location of its paired users, except for relying on its own signal to noise ratio and the quantization errors as in single cell multi-user multiple antenna systems. This implies that the quantization accuracy required for local and cross channel of each user depends on the locations of its own as well as its paired users.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xueying Hou, Chenyang Yang. 2010-04-27. Impact of Channel Asymmetry on Base Station Cooperative Transmission with Limited Feedback. https://arxiv.org/abs/1004.4826

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