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

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.

[1]  Willy Sansen,et al.  Analog Circuit Design Optimization based on Symbolic Simulation and Simulated Annealing , 1989, ESSCIRC '89: Proceedings of the 15th European Solid-State Circuits Conference.

[2]  Ahmad Mirzaei,et al.  Highly Integrated and Tunable RF Front Ends for Reconfigurable Multiband Transceivers: A Tutorial , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[3]  Rekha R. Thomas,et al.  Semidefinite Optimization and Convex Algebraic Geometry , 2012 .

[4]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[5]  Zhi-Quan Luo,et al.  A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints , 2010, SIAM J. Optim..

[6]  Xin Li,et al.  Finding Deterministic Solution From Underdetermined Equation: Large-Scale Performance Variability Modeling of Analog/RF Circuits , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Helmut E. Graeb,et al.  Constraint-Based Layout-Driven Sizing of Analog Circuits , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Constantine Caramanis,et al.  Geometry , Moments , and Semidefinite Optimization , 2002 .

[9]  Rob A. Rutenbar,et al.  MAELSTROM: efficient simulation-based synthesis for custom analog cells , 1999, DAC '99.

[10]  Jean B. Lasserre,et al.  Convergent SDP-Relaxations for Polynomial Optimization with Sparsity , 2006, ICMS.

[11]  Georges G. E. Gielen,et al.  Simulation-based automatic generation of signomial and posynomial performance models for analog integrated circuit sizing , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[12]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[13]  Stephen P. Boyd,et al.  GPCAD: a tool for CMOS op-amp synthesis , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[14]  Constantine Caramanis,et al.  Enabling efficient analog synthesis by coupling sparse regression and polynomial optimization , 2014, 2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC).

[15]  Peng Li,et al.  Yield-aware hierarchical optimization of large analog integrated circuits , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[16]  Andrea Baschirotto,et al.  A Fully Reconfigurable Software-Defined Radio Transceiver in 0.13μm CMOS , 2007, 2007 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.

[17]  Lawrence T. Pileggi,et al.  Toward efficient programming of reconfigurable radio frequency (RF) receivers , 2014, 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC).