A low complexity PAPR reduction scheme based on radix-II IFFT

Citation

Kazemian, Mohsen and Varahram, Pooria and Mohd Ali, Borhanuddin and Mohammady, Somayeh (2015) A low complexity PAPR reduction scheme based on radix-II IFFT. In: 2015 IEEE International Conference on Consumer Electronics (ICCE), 9-12 Jan. 2015, Las Vegas, Nevada, United States. (pp. 420-421).

Abstract

Due to no feedback process and simplicity in searching algorithm, conventional selected mapping (CSLM) is an efficient crest factor reduction (CFR) technique in orthogonal frequency division multiplexing (OFDM) systems. However high number of inverse fast Fourier transform (IFFT) block is required to achieve the desired PAPR reduction performance. In this paper a PAPR reduction method based on N point radix-2 IFFT is proposed in which the number of IFFTs is reduced to one. The gist of the proposed method is based on storing a part of calculations and using them for the next searching operation results in elimination of the redundant calculations. Simulation results show at least 46.8% complexity reduction compared to CSLM by comparable PAPR performance.

Download File

Preview

PDF (Abstract)
A low complexity PAPR reduction scheme based on radix-II IFFT.pdf
Download (35kB) | Preview

Additional Metadata

Item Type:	Conference or Workshop Item (Paper)
Divisions:	Faculty of Engineering
DOI Number:	https://doi.org/10.1109/ICCE.2015.7066469
Publisher:	IEEE
Keywords:	PAPR reduction; Radix-2 inverse fast Fourier transform; OFDM; IFFT
Depositing User:	Nabilah Mustapa
Date Deposited:	07 Jun 2017 04:41
Last Modified:	07 Jun 2017 04:41
Altmetrics:	http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1109/ICCE.2015.7066469
URI:	http://psasir.upm.edu.my/id/eprint/53999
Statistic Details:	View Download Statistic

Actions (login required)

View Item