A fast circuit similarity-based placement engine for field programmable gate arrays
Date
Author
Institution
Degree Level
Degree
Department
Supervisor / Co-Supervisor and Their Department(s)
Examining Committee Member(s) and Their Department(s)
Citation for Previous Publication
Link to Related Item
Abstract
This thesis work presents a novel and efficient circuit similarity algorithm to detect topological similarity between two circuits. Targeting placement, our proposed circuit similarity algorithm, namely CSBP, is able to significantly accelerate placement based on this similarity. Moreover, circuit similarity can also be applied to other CAD phases, such as routing and verification. We have applied CSBP to incremental design for FPGAs and design space exploration for FPGAs, respectively. For incremental design, experimental results show CSBP is averaged 31X faster than the state-of-the-art Versatile Place and Route with comparable wire length and estimated critical delay. For design space exploration, experimental results show CSBP accurately depicts the ''shape'' of a design space and pinpoints the optimal designs at both logic level and algorithm level. Moreover, a turbo version of CSBP performs an average of 30X (up to 100X) faster than VPR's while still achieving comparable placement results.