Efficient programming of reconfigurable radio frequency (RF) systems

Reconfigurable radio frequency (RF) system has recently emerged as a promising solution to cope with multiple communication standards and high spectrum density. In this paper, we propose a novel optimization framework to efficiently program a reconfigurable RF system. In particular, two novel techniques, including (i) search space reduction by adaptive resolution and (ii) global polynomial optimization based on branch and bound, are developed. When combined with a relaxation iteration scheme, our proposed method offers superior performance when programming a large-scale reconfigurable RF system designed for the WLAN 802.11g standard.

[1]  Xin Li,et al.  Correlated Bayesian model fusion: Efficient performance modeling of large-scale tunable analog/RF integrated circuits , 2016, 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[2]  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).

[3]  Nikolaos V. Sahinidis,et al.  Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..

[4]  Xin Li,et al.  Robust Analog/RF Circuit Design With Projection-Based Performance Modeling , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  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.

[6]  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).

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

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

[9]  Micael Gallego,et al.  A branch and bound algorithm for the maximum diversity problem , 2010, Eur. J. Oper. Res..

[10]  Lawrence T. Pileggi,et al.  Re-thinking polynomial optimization: Efficient programming of reconfigurable radio frequency (RF) systems by convexification , 2016, 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC).

[11]  Georges Gielen,et al.  Analog Circuit Design Optimization based on Symbolic Simulation and Simulated Annealing , 1989 .

[12]  Nikolaos V. Sahinidis,et al.  Mixed integer nonlinear programs: theory, algorithms and applications , 2001 .

[13]  G. Rote,et al.  Sandwich approximation of univariate convex functions with an application to separable convex programming , 1991 .

[14]  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.

[15]  F. Glover,et al.  Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming* , 1993 .

[16]  Xin Li,et al.  Phase Noise Impairment and Environment-Adaptable Fast (EAF) Optimization for Programming of Reconfigurable Radio Frequency (RF) Receivers , 2014, GLOBECOM 2014.

[17]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..