SAT-based algorithms for internal cell routing in nanoelectronic circuits

Abstract

This thesis presents the extension of a routing framework for the internal routing of standard cells. We extend the original Boolean formulation and modify a SAT-solver to take advantage of the new variables. Our aim is to make big and complex cells become more tractable

    Similar works

    Full text

    thumbnail-image

    Available Versions