Joint PAPR Reduction and Over-the-Air Computing in Multi-User OFDMA Systems

We consider the peak-to-average power ratio (PAPR) reduction challenge of orthogonal frequency division multiplexing (OFDM) systems utilizing tone reservation (TR) under an over-the-air computing constraint, such that the signals placed in the reserved tones simultaneously enable distributed computation at the receiver. To that end, the problem is cast as a fractional programming problem and solved via the iterative quadratic transform (QT), which guarantees convergence to a stationary point. A key contribution is the decomposition of the reserved-tone vector into an orthogonal pair of components: one satisfying the sum-computation constraint and the other providing the remaining degrees of freedom for PAPR reduction. This decomposition reveals that the proposed method and the benchmark sacrifices the same number of degrees of freedom. However, the proposed design distributes the computational payload across all reserved tones, yielding superior robustness against multi-user interference and quantization noise. Analytical and simulation results confirm that the proposed method matches the benchmark in PAPR reduction while outperforming it in computation accuracy, particularly in multi-user scenarios.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-02
DOI
https://doi.org/10.48550/arxiv.2611.02343
Primary Topic
PAPR reduction in OFDM
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Joint PAPR Reduction and Over-the-Air Computing in Multi-User OFDMA Systems

Giuseppe Thadeu Freitas de Abreu, Kuranage Roche Rayan Ranasinghe, Getuar Rexhepi, David González G
arXiv (Cornell University)
PAPR reduction in OFDM
preprint

Joint PAPR Reduction and Over-the-Air Computing in Multi-User OFDMA Systems

Giuseppe Thadeu Freitas de Abreu, Kuranage Roche Rayan Ranasinghe, Getuar Rexhepi, David González G
preprint en

Abstract

We consider the peak-to-average power ratio (PAPR) reduction challenge of orthogonal frequency division multiplexing (OFDM) systems utilizing tone reservation (TR) under an over-the-air computing constraint, such that the signals placed in the reserved tones simultaneously enable distributed computation at the receiver. To that end, the problem is cast as a fractional programming problem and solved via the iterative quadratic transform (QT), which guarantees convergence to a stationary point. A key contribution is the decomposition of the reserved-tone vector into an orthogonal pair of components: one satisfying the sum-computation constraint and the other providing the remaining degrees of freedom for PAPR reduction. This decomposition reveals that the proposed method and the benchmark sacrifices the same number of degrees of freedom. However, the proposed design distributes the computational payload across all reserved tones, yielding superior robustness against multi-user interference and quantization noise. Analytical and simulation results confirm that the proposed method matches the benchmark in PAPR reduction while outperforming it in computation accuracy, particularly in multi-user scenarios.

arXiv (Cornell University)
PAPR reduction in OFDM
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon