DocumentCode :
2567499
Title :
Reduced Computational Complexity PTS Scheme for PAPR Reduction of OFDM Signals
Author :
Wang, Lingyin ; Liu, Ju ; Zhang, Guowei
Author_Institution :
Sch. of Inf. Sci. & Eng., Shandong Univ., Jinan, China
fYear :
2010
fDate :
23-25 Sept. 2010
Firstpage :
1
Lastpage :
4
Abstract :
As a promising scheme, partial transmit sequences (PTS) provides an effective solution for peak-to-average power ratio (PAPR) reduction of orthogonal frequency division multiplexing (OFDM) signals. However, the main drawback of original PTS (O-PTS) is the large computational complexity. In this paper, a reduced computational complexity partial transmit sequences (RCC-PTS) is proposed. In RCC-PTS, a low complexity phase weighting process is implemented, where the relationship between phase weighting sequences is considered and the computation for candidate signals is simplified by making use of this inherent feature. Theoretical analysis and simulation results show that, compared with O-PTS, our RCC-PTS can not only reduce computational complexity clearly but also has an advantage of no loss in PAPR reduction performance.
Keywords :
OFDM modulation; communication complexity; OFDM signals; orthogonal frequency division multiplexing signal; partial transmit sequences; peak-to-average power ratio reduction; phase weighting process; reduced computational complexity; Computational complexity; Partial transmit sequences; Peak to average power ratio; Simulation; Time domain analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-3708-5
Electronic_ISBN :
978-1-4244-3709-2
Type :
conf
DOI :
10.1109/WICOM.2010.5601394
Filename :
5601394
Link To Document :
بازگشت