Abstract

The integrated fan out optimization/slack matching problem is the problem of jointly building fan out trees and slack matching the circuit. In particular, we insert a minimum number of asynchronous pipelined buffers to achieve a performance target while simultaneously ensuring the fan out count of all the nodes of the circuit is less than specified limits. Our result show that by solving the problem jointly up to 45% reduction in the total number of buffers can achieved compared to the state-of-the-art independent formulations.

Date

2014

Authors

Mehrdad Najibi, Peter A Beerel

Conference

2014 20th IEEE International Symposium on Asynchronous Circuits and Systems

Pages

69-76

Publisher

IEEE