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

February 16, 2024 ยท Declared Dead ยท ๐Ÿ› 2024 26th International Conference on Digital Signal Processing and its Applications (DSPA)

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Andrey Ivanov, Alexander Osinsky, Roman Bychkov, Vladimir Kalinin, Dmitry Lakontsev arXiv ID 2404.02160 Category cs.OH: Other CS Cross-listed cs.IT Citations 1 Venue 2024 26th International Conference on Digital Signal Processing and its Applications (DSPA) Last Checked 2 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Other CS

Died the same way โ€” ๐Ÿ‘ป Ghosted