Sizing Digital Circuits Using Convex Optimization Techniques

• Published in: Computational Intelligence in Digital and Network Designs and Applications pp. 3 - 32
• Main Authors: Rakai, Logan, Farshidi, Amin
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Subjects: Convex Optimization; Digital Circuit; Geometric Programming; Robust Optimization; Stochastic Programming
• ISBN: 3319200704; 9783319200705
• DOI: 10.1007/978-3-319-20071-2_1

This chapter collects recent advances in using convex optimization techniques to perform sizing of digital circuits. Convex optimization techniques provide an undeniably attractive promise: The attained solution is the best available. In order to use convex optimization techniques, the target optimization problem must be modeled using convex functions. The gate sizing problem has been modeled in different ways to enable the use of convex optimization techniques, such as linear programming and geometric programming. Statistical and robust sizing methods are included to reflect the importance of optimization techniques that are aware of variations. Applications of multi-objective optimization techniques that aid designers in evaluating the trade-offs are described.