SWAN: Swarm-Based Low-Complexity Scheme for PAPR Reduction
Autor: | Abanto-Leon, Luis F., Sim, Gek Hong, Hollick, Matthias, Boonkajay, Amnart, Adachi, Fumiyuki |
---|---|
Rok vydání: | 2020 |
Předmět: | |
Druh dokumentu: | Working Paper |
Popis: | Cyclically shifted partial transmit sequences (CS-PTS) has conventionally been used in SISO systems for PAPR reduction of OFDM signals. Compared to other techniques, CS-PTS attains superior performance. Nevertheless, due to the exhaustive search requirement, it demands excessive computational complexity. In this paper, we adapt CS-PTS to operate in a MIMO framework, where singular value decomposition (SVD) precoding is employed. We also propose SWAN, a novel optimization method based on swarm intelligence to circumvent the exhaustive search. SWAN not only provides a significant reduction in computational complexity, but it also attains a fair balance between optimality and complexity. Through simulations, we show that SWAN achieves near-optimal performance at a much lower complexity than other competing approaches. Comment: IEEE GLOBECOM 2020 |
Databáze: | arXiv |
Externí odkaz: |