Search arXivSearch

arXiv · 2503.20223

Phase-Only Zero-Forcing for Secure Wireless Communication in Multi-User Systems

Abstract

Artificial noise (AN) transmission is a physical layer security technique in multi-antenna wireless communication systems. Synthetic noise is broadcast to all receivers except designated legitimate users via beamforming in the legitimate users' null space. We consider AN transmission employing a single RF chain and analog beamforming, where beamforming vectors maintain constant magnitude while allowing arbitrary phases. Our primary objective is to design a constant-magnitude vector capable of nullifying multiple users' channel vectors simultaneously. To tackle this zero-forcing problem, we propose a novel successive partition zero-forcing (SPZF) scheme, which transforms the multi-user zero-forcing task into optimizing channel partitioning to minimize outage probability. The SPZF scheme can be generalized to any number of users, but our analysis focuses on the two-user case. Theoretical analysis reveals that our proposed SPZF scheme can attain arbitrarily low outage probability in the limit of large number of transmit antenna. We present three partition algorithms (random, iterative, and genetic) to minimize the outage probability. The outage probabilities and secrecy rates of the three partition algorithms are compared via numerical simulations. We find that the more advanced partition algorithms (iterative and genetic) achieve higher secrecy rates than the random algorithm, particularly under conditions of high signal-to-noise ratio (SNR), large number of eavesdroppers, or small number of transmit antennas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jordan Hong, Safwan Jamal, Ashish Khisti. 2025-03-26. Phase-Only Zero-Forcing for Secure Wireless Communication in Multi-User Systems. https://arxiv.org/abs/2503.20223

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