Search arXivSearch

arXiv · 1705.05252

Joint Transmission with Limited Backhaul Connectivity

Abstract

Downlink beamforming techniques with low signaling overhead are proposed for joint processing coordinated (JP) multi-point transmission. The objective is to maximize the weighted sum rate within joint transmission clusters. As the considered weighted sum rate maximization is a non-convex problem, successive convex approximation techniques, based on weighted mean-squared error minimization, are applied to devise algorithms with tractable computational complexity. Decentralized algorithms are proposed to enable JP even with limited backhaul connectivity. These algorithms rely provide a variety of alternatives for signaling overhead, computational complexity and convergence behavior. Time division duplexing is exploited to design transceiver training techniques for two scenarios: stream specific estimation and direct estimation. In the stream specific estimation, the base station and user equipment estimate all of the stream specific precoded pilots individually and construct the transmit/receive covariance matrices based on these pilot estimates. With the direct estimation, only the intended transmission is separately estimated and the covariance matrices constructed directly from the aggregate system-wide pilots. The impact of feedback/backhaul signaling quantization is considered, in order to further reduce the signaling overhead. Also, user admission is being considered for time-correlated channels. The enhanced transceiver convergence rate enables periodic beamformer reinitialization, which greatly improves the achieved system performance in dense networks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jarkko Kaleva, Antti Tölli, Markku Juntti, Randall Berry, Michael Honig. 2017-05-15. Joint Transmission with Limited Backhaul Connectivity. https://arxiv.org/abs/1705.05252

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