Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.15993

Truncated Channel Inversion Power Control to Enable One-Way URLLC with Imperfect Channel Reciprocity

Chunhui Li·Shihao Yan·Nan Yang·Xiangyun Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose to use channel inversion power control (CIPC) to achieve one-way ultra-reliable and low-latency communications (URLLC), where only the transmission in one direction requires ultra reliability and low latency. Based on channel reciprocity, our proposed CIPC schemes guarantee the power of received signal that is used to decode the information to be a constant value $Q$, by varying the transmit signal and power, which relaxes the assumption of knowing channel state information (CSI) at the user. Thus, the CIPC schemes eliminate the overhead of CSI feedback, reduce communication latency, and explore the benefits of multiple antennas to significantly improve transmission reliability. We derive analytical expressions for the packet loss probability of the proposed CIPC schemes, based on which we determine a closed interval and a convex set for optimizing $Q$ in CIPC with imperfect and perfect channel reciprocity, respectively. Our results show that CIPC is an effective means to achieve one-way URLLC. The tradeoff among reliability, latency, and required resources (e.g., transmit antennas) is further revealed, which provides novel principles for designing one-way URLLC systems.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chunhui Li, Shihao Yan, Nan Yang, Xiangyun Zhou. 2022-02-21. Truncated Channel Inversion Power Control to Enable One-Way URLLC with Imperfect Channel Reciprocity. https://arxiv.org/abs/2006.15993

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↗