A Computationally Efficient Tree-PTS Technique for PAPR Reduction of OFDM Signals

Authors:
Byung Moo Lee;Rui J. Figueiredo;Youngok Kim
Affiliations:
Central R&D Laboratory, Korea Telecom (KT), Seoul, Korea 137-792;Laboratory for Intelligent Signal Processing and Communications, The Henry Samueli School of Engineering, University of California, Irvine, USA 92697-2625;Department of Electronic Engineering, Kwangwoon University, Seoul, Korea 139-701
Venue:
Wireless Personal Communications: An International Journal
Year:
2012

Citing 3
Cited 0

Selected mapping without side information for PAPR reduction in OFDM

IEEE Transactions on Wireless Communications
A New Peak-to-Average Power-Ratio Reduction Algorithm for OFDM Systems via Constellation Extension

IEEE Transactions on Wireless Communications
Complement block coding for reduction in peak-to-average power ratio of OFDM signals

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

The high peak-to-average power ratio (PAPR) of time domain signals has been a major problem in orthogonal frequency division multiplexing (OFDM) systems, and thus various PAPR reduction algorithms have been introduced. Partial transmit sequence (PTS) is one of the most attractive solutions because of its good performance without distortion. However, it is considered as an impractical solution for the realization of high-speed data transmission systems due to its high computational complexity. In this paper, a novel PAPR reduction algorithm based on a tree-structured searching technique is proposed to reduce the PAPR with low complexity. In the proposed scheme, the computational complexity of searching process is decreased by adjusting the size of tree with two parameters, width and depth, while preserving good performance. The simulation results show that proposed scheme provides similar performance with optimum case with remarkably reduced computational complexity.