PAPR Reduction of an OFDM Signal by Use of PTS With Low Computational Complexity

2006 ◽  
Vol 52 (1) ◽  
pp. 83-86 ◽  
Author(s):  
L. Yang ◽  
R.S. Chen ◽  
Y.M. Siu ◽  
K.K. Soo
Keyword(s):  
Computational Complexity ◽  
Papr Reduction ◽  
Low Computational Complexity ◽  
Ofdm Signal

scholarly journals Chicken Swarm Optimization for PTS based PAPR Reduction in OFDM Systems

2020 ◽  
Vol 16 (3) ◽  
pp. 224-231
Author(s):  
Saruti Gupta ◽  
Ashish Goel
Keyword(s):  
Computational Complexity ◽  
Optimal Solution ◽  
Papr Reduction ◽  
Ofdm Systems ◽  
Ofdm System ◽  
Swarm Optimization ◽  
Threshold Limit ◽  
Trade Offs ◽  
Ofdm Signal ◽  
Chicken Swarm Optimization

Partial transmit sequence (PTS) is a well-known PAPR reduction scheme for the OFDM system. One of the major challenge of this scheme is to find an optimal phase vector using exhaustive search over all the allowed phase factor combinations. This leads to increased search complexity which grows exponentially as the number of sub-blocks is increased. In this paper, chicken swarm optimization (CSO) based PTS system is designed that aims to find an optimal solution in less number of average iterations and therefore results in reduced computational complexity of the system. We have proposed two categories of the algorithm: (i) CSO-PTS system without threshold limit on PAPR (ii) CSO-PTS system with threshold limit on PAPR. Both the schemes offer effective trade-offs between the computationalcomplexity and the PAPR reduction capability of the system. Simulation results confirm that our proposed schemes perform well in terms of low computational complexity, lesser number of average iterations and improved PAPR reduction capability of the OFDM signal without any loss in BER performance of the system.

scholarly journals PAPR Reduction with Low Computational Complexity for OFDM Systems

2012 ◽  
Vol 33 ◽  
pp. 1401-1407 ◽  
Author(s):  
Jing gao ◽  
Jinkuan Wang ◽  
Xin Song ◽  
Bin Wang
Keyword(s):  
Computational Complexity ◽  
Papr Reduction ◽  
Ofdm Systems ◽  
Low Computational Complexity

PAPR Reduction of OFDM Signals Using Partial Transmit Sequences With Low Computational Complexity

2007 ◽  
Vol 53 (3) ◽  
pp. 719-724 ◽  
Author(s):  
Tao Jiang ◽  
Weidong Xiang ◽  
P.C. Richardson ◽  
Jinhua Guo ◽  
Guangxi Zhu
Keyword(s):  
Computational Complexity ◽  
Papr Reduction ◽  
Low Computational Complexity ◽  
Partial Transmit Sequences ◽  
Ofdm Signals

scholarly journals Boosted PTS Method with Mu-Law Companding Techniques for PAPR Reduction in OFDM Systems

2021 ◽  
Author(s):  
Zeyid Ibraheem ◽  
Kawakib k ◽  
Yousef Fazea ◽  
Mohammed Madi ◽  
Fathey Mohammed ◽  
...  
Keyword(s):  
Computational Complexity ◽  
Communication System ◽  
Communication Systems ◽  
Orthogonal Frequency Division Multiplexing ◽  
Average Power ◽  
Diffusion Method ◽  
Papr Reduction ◽  
Ofdm Systems ◽  
Low Computational Complexity ◽  
Block Partition

Abstract Perpendicular rate of recurrence splitting up a group of numeral television or radio channels that are mixed together for broadcast Orthogonal Frequency Division Multiplexing which can be a potential diffusion method for elevating the transmission capacity of the communication systems. In spite of the significance of OFDM, the primary issue of the peak-to-average power ratio (PAPR) which augments communication system complications, reduces the effectiveness of the communication system, resulting in low performance of bit-error-rate (BER), and making OFDM perceptive toward non-linear distortion within a broadcast. Various techniques were projected for treating PAPR issues, inclusive of partial transmit sequence (PTS) which captivated great interest. Thus, this paper proposed a hybrid method inclusive of a boosted PTS scheme with Mu-law compressing and expanding approach. The PTS approach was boosted through boosting its sub-block partitioning scheme, the place where the aggrandized partitioning scheme consolidated a conventional interleaved partitioning into an adjacent partitioning scheme. The present merger concerning Mu-Law characteristic in time domain for PAPR reduction in OFDM fundamentally boosts PAPR diminution performance. Accordingly, though the simulated pseudorandom sub-block partition method improved PAPR diminution supplementary further than other sub-block partition schemes appertaining to conventional PTS, while maintaining low computational complexity. The findings show that the boosted PTS scheme with Mu-law expanding approach, whilst upholding low computational complexity, achieves considerably superior to the pseudorandom partitioning PTS with regard to various type of modulation format and subcarriers.

Sign in / Sign up

Export Citation Format

Share Document