Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1702.03911

On the Transport Capability of LAN Cables in All-Analog MIMO-RoC Fronthaul

Syed Hassan Raza Naqvi·Andrea Matera·Lorenzo Combi·Umberto Spagnolini
View original source ↗Read source document ↗Export metadata ↓

Abstract

Centralized Radio Access Network (C-RAN) architecture is the only viable solution to handle the complex interference scenario generated by massive antennas and small cells deployment as required by next generation (5G) mobile networks. In conventional C-RAN, the fronthaul links used to exchange the signal between Base Band Units (BBUs) and Remote Antenna Units (RAUs) are based on digital baseband (BB) signals over optical fibers due to the huge bandwidth required. In this paper we evaluate the transport capability of copper-based all-analog fronthaul architecture called Radio over Copper (RoC) that leverages on the pre-existing LAN cables that are already deployed in buildings and enterprises. In particular, the main contribution of the paper is to evaluate the number of independent BB signals for multiple antennas system that can be transported over multi-pair Cat-5/6/7 cables under a predefined fronthauling transparency condition in terms of maximum BB signal degradation. The MIMO-RoC proves to be a complementary solution to optical fiber for the last 200m toward the RAUs, mostly to reuse the existing LAN cables and to power-supply the RAUs over the same cable.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Syed Hassan Raza Naqvi, Andrea Matera, Lorenzo Combi, Umberto Spagnolini. 2017-05-16. On the Transport Capability of LAN Cables in All-Analog MIMO-RoC Fronthaul. https://doi.org/10.1109/wcnc.2017.7925638

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↗