Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2305.15926

Joint Precoding Design and Resource Allocation for C-RAN Wireless Fronthaul Systems

Peng Jiang·Jiafei Fu·Pengcheng Zhu·Jiamin Li·Xiaohu You
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper investigates the resource allocation problem combined with fronthaul precoding and access link sparse precoding design in cloud radio access network (C-RAN) wireless fronthaul systems.Multiple remote antenna units (RAUs) in C-RAN systems can collaborate in a cluster through centralized signal processing to realize distributed massive multiple-input and multiple-output (MIMO) systems and obtain performance gains such as spectrum efficiency and coverage.Wireless fronthaul is a flexible, low-cost way to implement C-RAN systems, however, compared with the fiber fronthaul network, the capacity of wireless fronthaul is extremely limited.Based on this problem, this paper first design the fronthaul and access link precoding to make the fronthaul capacity of RAUs match the access link demand.Then, combined with the precoding design problem, the allocation optimization of orthogonal resources is studied to further optimize the resource allocation between fronthaul link and access link to improve the performance of the system.Numerical results verify the effectiveness of the proposed precoding design and resource allocation optimization algorithm.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peng Jiang, Jiafei Fu, Pengcheng Zhu, Jiamin Li, Xiaohu You. 2023-05-25. Joint Precoding Design and Resource Allocation for C-RAN Wireless Fronthaul Systems. https://arxiv.org/abs/2305.15926

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↗