Abstract
In this thesis, we study the problem of performance-driven multi-level circuit clustering with application to hierarchical FPGA designs. We present an efficient three-level clustering heuristic algorithm for delay minimization. The trade-off of area and delay can be controlled by node duplications. Experiment results show that our algorithm can improve the circuit performance by 10% as compared to an area-driven clustering tool [11].