A Modified Shuffled Frog Leaping Algorithm for PAPR Reduction in OFDM Systems

Publication Type:
Journal Article
Citation:
IEEE Transactions on Broadcasting, 2015, 61 (4), pp. 698 - 709
Issue Date:
2015-12-01
Full metadata record
Files in This Item:
Filename Description Size
581313.pdfAccepted Manuscript1.52 MB
Adobe PDF
© 2015 IEEE. Significant reduction of the 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). MCCSFLA is inspired by natural clonal selection of a frog colony, it is based on the chaos theory. We also analyze MCCSFLA using the Markov chain theory and prove that the algorithm can converge to the global optimum. Simulation results show that the proposed algorithm achieves better PAPR reduction than using others 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: