Re-thinking polynomial optimization: Efficient programming of reconfigurable radio frequency (RF) systems by convexification

Published

Conference Paper

© 2016 IEEE. Reconfigurable radio frequency (RF) system has emerged as a promising avenue to achieve high communication performance while adapting to versatile commercial wireless environment. In this paper, we propose a novel technique to optimally program a reconfigurable RF system in order to achieve maximum performance and/or minimum power. Our key idea is to adopt an equation-based optimization method that relies on general-purpose, non-convex polynomial performance models to determine the optimal configurations of all tunable circuit blocks. Most importantly, our proposed approach guarantees to find the globally optimal solution of the non-convex polynomial programming problem by solving a sequence of convex semi-definite programming (SDP) problems based on convexification. A reconfigurable RF front-end example designed for WLAN 802.11g demonstrates that the proposed method successfully finds the globally optimal configuration, while other traditional techniques often converge to local optima.

Full Text

Duke Authors

Cited Authors

  • Wang, F; Yin, S; Jun, M; Li, X; Mukherjee, T; Negi, R; Pileggi, L

Published Date

  • March 7, 2016

Published In

  • Proceedings of the Asia and South Pacific Design Automation Conference, Asp Dac

Volume / Issue

  • 25-28-January-2016 /

Start / End Page

  • 545 - 550

International Standard Book Number 13 (ISBN-13)

  • 9781467395694

Digital Object Identifier (DOI)

  • 10.1109/ASPDAC.2016.7428068

Citation Source

  • Scopus