2019 · 13 citations · 14 references
EngineeringComputer EngineeringComputer ScienceComputer-aided DesignDesign AutomationDesign OptimizationDigital Logic DesignLayout OptimizationPhysical DesignRoutingRouting AlgorithmsStandard Cell DesignBoolean SatisfiabilityBoolean Satisfiability ProblemCell Layout DesignCell Layout OptimizationDensitySatisfiability ProblemStandard Cell PlacementStandard Cells
In this paper, we propose a routing flow for nets within a standard cell that generates layout of standard cells without any design rule violations. Design rules, density rules for metal fill, and pin-access requirements are modeled via Boolean formulas for discrete layout objects on grids. Formulas are translated into a single Boolean satisfiability problem (SAT). Having constraints on net connectivity and candidate routes, the SAT solver produces legal and complete routing concurrently for all nets satisfying mandatory pin-access and density requirements. A SAT-based optimization engine minimizes undesired layout patterns such as DFM (design-for-manufacturing) hot spots.
14
Tejas Jhaveri, Vyacheslav Rovner, Lars W. Liebmann et al. · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 2010 · 98 citations
Engineering, Computer Engineering, Electrical Engineering +17
Standard cell routing via boolean satisfiability
Nikolai Ryzhenko, Steven M. Burns · 2012 · 55 citations
Standard Cell Layout Regularity and Pin Access Optimization Considering Middle-of-Line
Wei Ye, Bei Yu, David Z. Pan et al. · 2015 · 42 citations