Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1909.03958

An Uplink Control Channel Design with Complementary Sequences for Unlicensed Bands

Alphan Sahin·Rui Yang
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, two modulation schemes based on complementary sequences (CSs) are proposed for uplink control channels in unlicensed bands. These schemes address high peak-to-average-power ratio (PAPR) under non-contiguous resource allocation in the frequency domain and reduce the maximum PAPR to 3 dB. The first scheme allows the users to transmit a small amount of uplink control information (UCI) such as acknowledgment signals and does not introduce a trade-off between PAPR and co-channel interference (CCI). The second scheme, which enables up to 21 UCI bits for a single user or 11 UCI bits for three users in an interlace, is based on a new theorem introduced in this paper. This theorem leads distinct CSs compatible with a wide variety of resource allocations while capturing the inherent relationship between CSs and Reed-Muller (RM) codes, which makes CSs more useful for practical systems. The numerical results show that the proposed schemes maintain the low-PAPR benefits without increasing the error rate for non-contiguous resource allocations in the frequency domain.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alphan Sahin, Rui Yang. 2020-06-29. An Uplink Control Channel Design with Complementary Sequences for Unlicensed Bands. https://arxiv.org/abs/1909.03958

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↗