TY - JOUR
T1 - Peak reduction in OFDM using second-order cone programming relaxation
AU - Beko, Marko
AU - Dinis, Rui Miguel Henriques Dias Morgado
AU - Šendelj, Ramo
N1 - This work was partially supported by Fundacao para a Ciencia e a Tecnologia under Projects PTDC/EEI-TEL/2990/2012-ADIN, EXPL/EEI-TEL/1582/2013-GLANC, PEst-OE/EEI/UI0066/2014 and EXPL/EEI-TEL/0969/2013-MANY2COMWIN, and Ciencia 2008 Post-Doctoral Research grant. M. Beko is a collaborative member of INESC-INOV, Instituto Superior Tecnico, University of Lisbon, Lisbon, Portugal.
PY - 2014/8/21
Y1 - 2014/8/21
N2 - In this paper, we address the problem of peak-to-average power ratio (PAPR) reduction in orthogonal frequency-division multiplexing (OFDM) systems. We formulate the problem as an error vector magnitude (EVM) optimization task with constraints on PAPR and free carrier power overhead (FCPO). This problem, which is known to be NP hard, is shown to be approximated by a second-order cone programming (SOCP) problem using a sequential convex programming approach, making it much easier to handle. This approach can be extended to the more general problem when PAPR, EVM, and FCPO are constrained simultaneously. Our performance results show the effectiveness of the proposed approach, which allows good performance with lower computational complexity and infeasibility rate than state-of-the-art PAPR-reduction convex approaches. Moreover, in the case when all the three system parameters are constrained simultaneously, the proposed approach outperforms the convex approaches in terms of infeasibility rate, PAPR, and bit error rate (BER) performances.
AB - In this paper, we address the problem of peak-to-average power ratio (PAPR) reduction in orthogonal frequency-division multiplexing (OFDM) systems. We formulate the problem as an error vector magnitude (EVM) optimization task with constraints on PAPR and free carrier power overhead (FCPO). This problem, which is known to be NP hard, is shown to be approximated by a second-order cone programming (SOCP) problem using a sequential convex programming approach, making it much easier to handle. This approach can be extended to the more general problem when PAPR, EVM, and FCPO are constrained simultaneously. Our performance results show the effectiveness of the proposed approach, which allows good performance with lower computational complexity and infeasibility rate than state-of-the-art PAPR-reduction convex approaches. Moreover, in the case when all the three system parameters are constrained simultaneously, the proposed approach outperforms the convex approaches in terms of infeasibility rate, PAPR, and bit error rate (BER) performances.
KW - Peak-to-average power ratio
KW - Orthogonal frequency-division multiplexing
KW - Second-order cone programming
KW - Semidefinite programming
KW - Free carrier power overhead
KW - Error vector magnitude
KW - Error vector magnitude
KW - Free carrier power overhead
KW - Orthogonal frequency-division multiplexing
KW - Peak-to-average power ratio
KW - Second-order cone programming
KW - Semidefinite programming
U2 - 10.1186/1687-6180-2014-130
DO - 10.1186/1687-6180-2014-130
M3 - Article
VL - 2014
SP - 1
EP - 10
JO - Eurasip Journal On Advances In Signal Processing
JF - Eurasip Journal On Advances In Signal Processing
SN - 1687-6172
IS - 1
M1 - 130
ER -