Par reduction in OFDM through convex programming

Chao Wang; Shu Hung Leung

doi:10.1109/ICASSP.2008.4518430

Par reduction in OFDM through convex programming

Chao Wang
, Shu Hung Leung

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

9 Citations (Scopus)

Abstract

The high peak-to-average power ratio (PAR) encountered in OFDM system has been a major obstacle in the implementation of power efficient transmitter. In this paper, we present a new active constellation extension (ACE) based convex optimization algorithm which reduces PAR through convex programming. In comparison with previous convex programming method, our method greatly reduces the complexity and keeps the bit-error-rate (BER) performance. Moreover, our method can be combined with other clipping based ACE algorithms to further reduce the complexity with a slight performance degradation. Simulation results are given in this paper which show our method outperforms other ACE-based algorithms. ©2008 IEEE.

Original language	English
Title of host publication	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Pages	3597-3600
DOIs	https://doi.org/10.1109/ICASSP.2008.4518430
Publication status	Published - 2008
Event	2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP - Las Vegas, NV, United States Duration: 31 Mar 2008 → 4 Apr 2008

Publication series

Name
ISSN (Print)	1520-6149

Conference

Conference	2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Place	United States
City	Las Vegas, NV
Period	31/03/08 → 4/04/08

Research Keywords

Iterative methods
Newton method
Optimization methods
Power control

Access Output

10.1109/ICASSP.2008.4518430

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{1c7ee15dcc444d4791b65e968da6e6b6,

title = "Par reduction in OFDM through convex programming",

abstract = "The high peak-to-average power ratio (PAR) encountered in OFDM system has been a major obstacle in the implementation of power efficient transmitter. In this paper, we present a new active constellation extension (ACE) based convex optimization algorithm which reduces PAR through convex programming. In comparison with previous convex programming method, our method greatly reduces the complexity and keeps the bit-error-rate (BER) performance. Moreover, our method can be combined with other clipping based ACE algorithms to further reduce the complexity with a slight performance degradation. Simulation results are given in this paper which show our method outperforms other ACE-based algorithms. {\textcopyright}2008 IEEE.",

keywords = "Iterative methods, Newton method, Optimization methods, Power control",

author = "Chao Wang and Leung, \{Shu Hung\}",

year = "2008",

doi = "10.1109/ICASSP.2008.4518430",

language = "English",

isbn = "1424414849",

pages = "3597--3600",

booktitle = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

note = "2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP ; Conference date: 31-03-2008 Through 04-04-2008",

}

Wang, C & Leung, SH 2008, Par reduction in OFDM through convex programming. in ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings., 4518430, pp. 3597-3600, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, Las Vegas, NV, United States, 31/03/08. https://doi.org/10.1109/ICASSP.2008.4518430

TY - GEN

T1 - Par reduction in OFDM through convex programming

AU - Wang, Chao

AU - Leung, Shu Hung

PY - 2008

Y1 - 2008

N2 - The high peak-to-average power ratio (PAR) encountered in OFDM system has been a major obstacle in the implementation of power efficient transmitter. In this paper, we present a new active constellation extension (ACE) based convex optimization algorithm which reduces PAR through convex programming. In comparison with previous convex programming method, our method greatly reduces the complexity and keeps the bit-error-rate (BER) performance. Moreover, our method can be combined with other clipping based ACE algorithms to further reduce the complexity with a slight performance degradation. Simulation results are given in this paper which show our method outperforms other ACE-based algorithms. ©2008 IEEE.

AB - The high peak-to-average power ratio (PAR) encountered in OFDM system has been a major obstacle in the implementation of power efficient transmitter. In this paper, we present a new active constellation extension (ACE) based convex optimization algorithm which reduces PAR through convex programming. In comparison with previous convex programming method, our method greatly reduces the complexity and keeps the bit-error-rate (BER) performance. Moreover, our method can be combined with other clipping based ACE algorithms to further reduce the complexity with a slight performance degradation. Simulation results are given in this paper which show our method outperforms other ACE-based algorithms. ©2008 IEEE.

KW - Iterative methods

KW - Newton method

KW - Optimization methods

KW - Power control

UR - https://www.scopus.com/pages/publications/51449110676

UR - https://www.scopus.com/pages/publications/51449110676#tab=impact

U2 - 10.1109/ICASSP.2008.4518430

DO - 10.1109/ICASSP.2008.4518430

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 1424414849

SN - 9781424414840

SP - 3597

EP - 3600

BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

T2 - 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP

Y2 - 31 March 2008 through 4 April 2008

ER -

Par reduction in OFDM through convex programming

Abstract

Publication series

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this