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

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.

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.

Nature-Inspired-Based PTS for PAPR Reduction in OFDM Systems

2020 ◽  
pp. 57-88
Author(s):  
Mohamed Mounir ◽  
Mohamed Bakry El Mashade ◽  
Gurjot Singh Gaba
Keyword(s):  
Computational Complexity ◽  
System Performance ◽  
Reduction Technique ◽  
High Data Rate ◽  
Papr Reduction ◽  
Ofdm Systems ◽  
High Data ◽  
Single Solution ◽  
Suboptimal Solution ◽  
Better Than

OFDM is widely used in high data rate applications due to its ability to mitigate frequency selectivity. However, OFDM suffers from high PAPR problem. This degrades the system performance. PTS is a promising PAPR reduction technique. However, its computational complexity is large; to reduce it, different suboptimal solution (heuristics) were presented in literature. Heuristics PTS algorithms can be categorized into descent-heuristics and metaheuristics. In this chapter, descent-heuristics-based PTS and metaheuristics-based PTS are compared. Results showed that RS-PTS is the best one among descent-heuristics algorithms. Metaheuristics algorithms can also be classified into single solution-based methods and nature-inspired methods. Among metaheuristics algorithms, two natural inspired algorithms and one single solution-based methods, namely PSO, ABC, and SA, were selected to be compared with descent-heuristics algorithms. Results showed that PTS based on nature-inspired methods is better than PTS based on descent heuristics and PTS based on single-solution metaheuristics method.

scholarly journals PAPR Reduction Using Fireworks Search Optimization Algorithm in MIMO-OFDM Systems

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Lahcen Amhaimar ◽  
Saida Ahyoud ◽  
Ali Elyaakoubi ◽  
Abdelmoumen Kaabal ◽  
Kamal Attari ◽  
...  
Keyword(s):  
Computational Complexity ◽  
Communication Systems ◽  
Orthogonal Frequency Division Multiplexing ◽  
Multiple Input Multiple Output ◽  
Average Power ◽  
Papr Reduction ◽  
Main Concern ◽  
Ofdm Systems ◽  
Fireworks Algorithm ◽  
Mimo Ofdm

The transceiver combination technology, of orthogonal frequency division multiplexing (OFDM) with multiple-input multiple-output (MIMO), provides a viable alternative to enhance the quality of service and simultaneously to achieve high spectral efficiency and data rate for wireless mobile communication systems. However, the high peak-to-average power ratio (PAPR) is the main concern that should be taken into consideration in the MIMO-OFDM system. Partial transmit sequences (PTSs) is a promising scheme and straightforward method, able to achieve an effective PAPR reduction performance, but it requires an exhaustive search to find the optimum phase factors, which causes high computational complexity increased with the number of subblocks. In this paper, a reduced computational complexity PTS scheme is proposed, based on a novel swarm intelligence algorithm, called fireworks algorithm (FWA). Simulation results confirmed the adequacy and the effectiveness of the proposed method which can effectively reduce the computation complexity while keeping good PAPR reduction. Moreover, it turns out from the results that the proposed PTS scheme-based FWA clearly outperforms the hottest and most important evolutionary algorithm in the literature like simulated annealing (SA), particle swarm optimization (PSO), and genetic algorithm (GA).

Sign in / Sign up

Export Citation Format

Share Document