PAPR Reduction via Constellation Extension in OFDM Systems Using Generalized Benders Decomposition and Branch-and-Bound Techniques

In this paper, a novel constellation extension (CE)-based approach is presented to address the high peak-to-average power ratio (PAPR) problem at the transmitter side, which is an important drawback of orthogonal frequency-division multiplexing (OFDM) systems. This new proposal is formulated as a mi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology Vol. 65; no. 7; pp. 5133 - 5145
Main Authors: Paredes Paredes, Martha C., Escudero-Garzas, Jose Joaquin, Fernandez-Getino Garcia, M. Julia
Format: Journal Article
Language:English
Published: New York IEEE 01.07.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Benders decomposition
Bit error rate
Branch-and-bound (BB)
constellation extension (CE)
Constellations
generalized benders decomposition (GBD)
Minimization
Nonlinear programming
Optimization
Orthogonal Frequency Division Multiplexing
orthogonal frequency-division multiplexing (OFDM)
peak power reduction
Peak to average power ratio
Predistortion
Proposals
Reduction
Symbols
Time-domain analysis
ISSN:0018-9545, 1939-9359
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a novel constellation extension (CE)-based approach is presented to address the high peak-to-average power ratio (PAPR) problem at the transmitter side, which is an important drawback of orthogonal frequency-division multiplexing (OFDM) systems. This new proposal is formulated as a mixed-integer nonlinear programming optimization problem, which employs generalized Benders decomposition (GBD) and branch-and-bound (BB) methods to determine the most adequate extension factor and the optimum set of input symbols to be extended within a proper quarter plane of the constellation. The optimum technique based on GBD, which is denoted as GBD for constellation extension (GBDCE), provides a bound with relevant improvement in terms of PAPR reduction compared with other CE techniques, although it may exhibit slow convergence. To avoid excessive processing time in practical systems, the suboptimum BB for constellation extension (BBCE) scheme is proposed. Simulation results show that BBCE achieves a significant PAPR reduction, providing a good tradeoff between complexity and performance. We also show that the BBCE scheme performs satisfactorily in terms of power spectral density and bit error rate in the presence of a nonlinear high-power amplifier.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2015.2450178