The reviewed record of science sign in
Pith

arxiv: 2404.02160 · v1 · pith:HXNAAEOS · submitted 2024-02-16 · cs.OH · cs.IT· math.IT

Trainable Least Squares to Reduce PAPR in OFDM-based Hybrid Beamforming Systems

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:HXNAAEOSrecord.jsonopen to challenge →

classification cs.OH cs.ITmath.IT
keywords paprcomplexitydigitalbeamformingreductiontrainablealgorithmhybrid
0
0 comments X
read the original abstract

In this paper, we propose a trainable least squares (LS) approach for reducing the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals in a hybrid beamforming (HBF) system. Compared to digital beamforming (DBF), in HBF technology the number of antennas exceeds the number of digital ports. Therefore, PAPR reduction capabilities are restricted by both a limited bandwidth and the reduced size of digital space. The problem is to meet both conditions. Moreover, the major HBF advantage is a reduced system complexity, thus the complexity of the PAPR reduction algorithm is expected to be low. To justify the performance of the proposed trainable LS, we provide a performance bound achieved by convex optimization using the CVX Matlab package. Moreover, the complexity of the proposed algorithm can be comparable to the minimal complexity of the digital ``twin'' calculation in HBF. The abovementioned features prove the feasibility of the trained LS for PAPR reduction in fully-connected HBF.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.