Low-Complexity PTS Scheme for PAPR Reduction in FBMC-OQAM Systems
| Autor: | Zongmiao He, Xiang Ling, Lingyu Zhou, Yiou Chen |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Scheme (programming language)
Sequence Computational complexity theory Orthogonal frequency-division multiplexing Computer science Phase (waves) 020206 networking & telecommunications 02 engineering and technology Filter bank Computer Science Applications Power (physics) Reduction (complexity) Modeling and Simulation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Electrical and Electronic Engineering computer Algorithm computer.programming_language |
| Zdroj: | IEEE Communications Letters. 22:2322-2325 |
| ISSN: | 2373-7891 1089-7798 |
| DOI: | 10.1109/lcomm.2018.2871263 |
| Popis: | Most of the peak-to-average power ration (PAPR) reduction techniques, such as partial transmit sequence (PTS) algorithm and selective mapping algorithm, for conventional OFDM systems are not directly applied to filter bank multi-carrier with offset quadrature amplitude modulation (FBMC-OQAM) systems because of the overlapping structure of FBMC-OQAM signals. Furthermore, the complexity of the existing algorithms based on PTS is very high for the FBMC-OQAM systems. In this letter, we propose a low-complexity PTS based on hybrid processing algorithm (H-PTS) to reduce the PAPR values of FBMC-OQAM systems. Firstly, the proposed algorithm processes phase factors of the PTS by double-layer search. As a result, the complexity of searching the optimal phase factors is simplified. Moreover, an efficient algorithm of estimating the PAPR values of the FBMC-OQAM signals is employed to further reduce computational complexity. Simulation results show that, compared with the conventional PTS algorithm and segmental PTS algorithm, the proposed H-PTS algorithm could achieve a better PAPR reduction as well as lower computational complexity. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|