Search arXivSearch

arXiv · 2510.16792

Non-Orthogonal Pilot Sequence Design for Multi-Cells Interference Networks

Abstract

In wireless communications, the performance of non-orthogonal sequence sets significantly affects the level of multi-user interference when the number of users surpasses the sequence length. The design of non-orthogonal sequences plays a crucial role in both the non-orthogonality of the pilots in multi-cell systems and the signature sequences in overloaded code-division multiple-access (CDMA) systems. In multi-cell systems, considering the strength disparity between channels originating from the home cell and the neighboring cells, the extended total squared correlation (ETSC) is proposed as a new sequence design criterion, which is defined as the sum of squares of the weighted correlations among sequences. In this paper, we derive a closed-form expression for the lower bound of ETSC for multi-cell systems with a given sequence length $τ$, where $τ\leq K$ and $K$ is the number of users per cell. This can be regarded as a generalization of the well-known Welch bound (Welch, 1974, IEEE TIT) and the extended Welch bound (Wang et al., 2021, IEEE TWC). Additionally, from the necessary conditions of the bound, the optimal sequence set can be easily obtained when the interference power factor matrix is positive definite. On the other hand, to address the lack of sequence generation methods under certain parameter conditions, we propose the ETSC-MM algorithm, which generates sequence sets with low ETSC based on a Majorization-Minimization (MM) optimization framework.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhi Gu, Wai Ho Mow. 2025-10-19. Non-Orthogonal Pilot Sequence Design for Multi-Cells Interference Networks. https://arxiv.org/abs/2510.16792

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