Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1909.04259

Performance of Analog Beamforming Systems with Optimized Phase Noise Compensation

Vishnu V. Ratnam
View original source ↗Read source document ↗Export metadata ↓

Abstract

Millimeter-wave and Terahertz frequencies, while promising high throughput and abundant spectrum, are highly susceptible to hardware non-idealities like phase-noise, which degrade the system performance and make transceiver implementation difficult. While several phase-noise compensation techniques have been proposed, there are limited results on the post-compensation system performance. Consequently, in this paper, a generalized reference-signal (RS) aided low-complexity phase-noise compensation technique is proposed for high-frequency, multi-carrier systems. The technique generalizes several existing solutions and involves an RS that is transmitted in each symbol, occupies adjacent sub-carriers, and is separated from the data by null sub-carriers. A detailed theoretical analysis of the post-phase-noise compensation performance is presented for an analog beamforming receiver under an arbitrary phase-noise model. Using this analysis, the performance-impact of several system parameters is examined and the throughput-optimal designs for the RS sequence, RS bandwidth, power allocation, number of null sub-carriers, and the number of estimated phase-noise spectral components are also derived. Simulations performed under 3GPP compliant settings suggest that the proposed scheme is robust to phase-noise modeling errors and can, with the optimized parameters, achieve better performance than several existing solutions.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vishnu V. Ratnam. 2020-09-07. Performance of Analog Beamforming Systems with Optimized Phase Noise Compensation. https://doi.org/10.1109/tsp.2020.3023583

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↗