Open AccessN ‐PTS scheme with low complexity for PAPR reduction
Author(s) -
Wei Shanlin,
Shen Ying
Publication year - 2016
Publication title -
the journal of engineering
Language(s) - English
Resource type - Journals
ISSN - 2051-3305
DOI - 10.1049/joe.2016.0270
Subject(s) - reduction (mathematics) , computational complexity theory , algorithm , fast fourier transform , scheme (mathematics) , block (permutation group theory) , computer science , signal (programming language) , sequence (biology) , distortion (music) , mathematics , inverse , time domain , telecommunications , bandwidth (computing) , computer vision , mathematical analysis , geometry , amplifier , biology , genetics , programming language
Partial transmit sequence (PTS) is a promising technology for peak‐to‐average power ratio (PAPR) reduction because it introduces no distortion. However, the high computational complexity is the main drawback of PTS scheme. A low‐complexity PTS scheme, called N ‐PTS, is proposed for PAPR reduction. By constructing some sequences, the time‐domain signals are obtained by combining the original signal with two circular signals. Thus, only one inverse fast Fourier transform block is required to implement. Analyses and simulation results show that the N ‐PTS scheme achieves extremely low computational complexity while sacrificing a little bit of performance compared with the conventional PTS.