Search arXivSearch

arXiv · 2001.00607

Integer-Forcing Architectures for Uplink Cloud Radio Access Networks

Abstract

Consider an uplink cloud radio access network where users are observed simultaneously by several base stations, each with a rate-limited link to a central processor, which wishes to decode all transmitted messages. Recent efforts have demonstrated the advantages of compression-based strategies that send quantized channel observations to the central processor, rather than attempt local decoding. We study the setting where channel state information is not available at the transmitters, but known fully or partially at the base stations. We propose an end-to-end integer-forcing framework for compression-based uplink cloud radio access, and show that it operates within a constant gap from the optimal outage probability if channel state information is fully available at the base stations. We demonstrate via simulations that our framework is competitive with state-of-the-art Wyner-Ziv-based strategies.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Islam El Bakoury, Bobak Nazer. 2020-01-06. Integer-Forcing Architectures for Uplink Cloud Radio Access Networks. https://arxiv.org/abs/2001.00607

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