A convex programming solution for gate-sizing with pipelining constraints

DOI10.1007/S11081-021-09616-0MaRDI QIDQ2147929zbMATH OpenOpenAlexFDO

Authors Srinath R. Naidu

Publication date 20 June 2022

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11081-021-09616-0

zbMATH Keywords

convex programminggate-sizingpipeliningretiming

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Digital Circuit Optimization via Geometric Programming
• Approximation scheme for restricted discrete gate sizing targeting delay minimization
• VLSI circuit performance optimization by geometric programming
• GATE RESIZING TO REDUCE POWER CONSUMPTION
• Retiming synchronous circuitry

Cites work

• A simultaneous projections method for linear inequalities
• Digital Circuit Optimization via Geometric Programming
• scientific article; zbMATH DE number 3845501 (Why is no real title available?)
• On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
• Retiming synchronous circuitry

Cited in

(2)

• Approximation scheme for restricted discrete gate sizing targeting delay minimization
• Statistical static timing analysis via modern optimization lens. I: Histogram-based approach

Describes a project that uses

Uses Software

• TILOS

This page was built for publication: A convex programming solution for gate-sizing with pipelining constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147929)