An approach to placement-coupled logic replication

We present a set of techniques for placement-coupled, timing driven logic replication. Two components are at the core of the approach. First is an algorithm for optimal timing driven fanin tree embedding; the algorithm is very general in that it can easily incorporate complex objective functions (e.g., placement costs) and can perform embedding on any graph-based target. Second we introduce the Replication nee which allows us to induce large fanin trees from a given circuit which can then be optimized by the embedder. We have built an optimization engine around these two ideas and report promising results for the FPGA domain including clock period reductions of up to 36% compared with a timing-driven placement from VPR [12] and almost double the average improvement of local replication from [I]. These results are azhieved with modest area and runtime overhead.