Constraint Symbolization Method for Analog Layout Retargeting with Geometric Programming

To satisfy the requirements of complex and special analog layout constraints, a constraint symboliza- tion method based on geometric programming for analog layout retargeting is presented in this paper. Our ap- proach is to build symbolic template for layouts, then uses Geometric programming （GP） to achieve new technology design rules, implement device symmetry and matching constraints, and manage parasitics optimization. The GP, a class of non-linear optimization problem, can be trans- ferred or fitted into a convex optimization problem. There- fore, a global optimum solution can be achieved. The sym- bolization method ensures the layout retargeting automati- cally. The efficiency and effectiveness of the proposed algo- rithm, as compared with the other existing methods, are demonstrated by a basic case-study example and a two- stage Miller-compensated operational amplifier.