A modified shuffled frog leaping algorithm for PAPR reduction in OFDM systems

Zhou, J; Dutkiewicz, E; Liu, RP; Fang, G; Liu, Y; Huang, X

A modified shuffled frog leaping algorithm for PAPR reduction in OFDM systems

Zhou, J Dutkiewicz, E

Liu, RP

Fang, G Liu, Y Huang, X

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE Region 10 Annual International Conference, Proceedings/TENCON, 2015, 2015-January
Issue Date:: 2015-01-26

Closed Access

	Filename	Description	Size
	Conference 4.pdf	Published version	160.26 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhou, J	en_US
dc.contributor.author	Dutkiewicz, E https://orcid.org/0000-0002-4268-9286	en_US
dc.contributor.author	Liu, RP https://orcid.org/0000-0001-7001-6305	en_US
dc.contributor.author	Fang, G	en_US
dc.contributor.author	Liu, Y	en_US
dc.contributor.author	Huang, X https://orcid.org/0000-0001-6869-5732	en_US
dc.date.issued	2015-01-26	en_US
dc.identifier.citation	IEEE Region 10 Annual International Conference, Proceedings/TENCON, 2015, 2015-January	en_US
dc.identifier.isbn	9781479940752	en_US
dc.identifier.issn	2159-3442	en_US
dc.identifier.uri	http://hdl.handle.net/10453/43229
dc.description.abstract	© 2014 IEEE. Reducing peak-to-average power ratio (PAPR) is an implementation challenge in orthogonal frequency division multiplexing (OFDM) systems. One way to reduce PAPR is to apply a set of selected partial transmission sequence (PTS) to the transmit signals. However, PTS selection is a highly complex NP-hard problem and the computational complexity is very high when a large number of subcarriers are used in the OFDM system. In this paper, we propose a new heuristic PTS selection method, the modified chaos clonal shuffled frog leaping algorithm (MCCSFLA-PTS). The MCCSFLA-PTS is inspired by natural clonal selection of frog colony and based on chaos theory. Simulation results show that the proposed MCCSFLA-PTS achieves better PAPR reduction than genetic, quantum evolutionary and selective mapping algorithms. Furthermore, the proposed algorithm converges faster than the genetic and quantum evolutionary algorithms.	en_US
dc.relation.ispartof	IEEE Region 10 Annual International Conference, Proceedings/TENCON	en_US
dc.relation.isbasedon	10.1109/TENCON.2014.7022479	en_US
dc.title	A modified shuffled frog leaping algorithm for PAPR reduction in OFDM systems	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2015-January	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	2015-January	en_US

Abstract:

© 2014 IEEE. Reducing peak-to-average power ratio (PAPR) is an implementation challenge in orthogonal frequency division multiplexing (OFDM) systems. One way to reduce PAPR is to apply a set of selected partial transmission sequence (PTS) to the transmit signals. However, PTS selection is a highly complex NP-hard problem and the computational complexity is very high when a large number of subcarriers are used in the OFDM system. In this paper, we propose a new heuristic PTS selection method, the modified chaos clonal shuffled frog leaping algorithm (MCCSFLA-PTS). The MCCSFLA-PTS is inspired by natural clonal selection of frog colony and based on chaos theory. Simulation results show that the proposed MCCSFLA-PTS achieves better PAPR reduction than genetic, quantum evolutionary and selective mapping algorithms. Furthermore, the proposed algorithm converges faster than the genetic and quantum evolutionary algorithms.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/43229