PAPR Reduction Using Fireworks Search Optimization Algorithm in MIMO-OFDM Systems
Autor: | Ali Elyaakoubi, Abdelmoumen Kaabal, Adel Asselman, Kamal Attari, Saida Ahyoud, Lahcen Amhaimar |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2018 |
Předmět: |
Computer engineering. Computer hardware
Article Subject General Computer Science Computational complexity theory Computer science 020208 electrical & electronic engineering MIMO Evolutionary algorithm Particle swarm optimization 020206 networking & telecommunications 02 engineering and technology MIMO-OFDM Swarm intelligence Reduction (complexity) TK7885-7895 Signal Processing Simulated annealing 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering Algorithm |
Zdroj: | Journal of Electrical and Computer Engineering, Vol 2018 (2018) |
ISSN: | 2090-0155 2090-0147 |
Popis: | 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). |
Databáze: | OpenAIRE |
Externí odkaz: |