Date Added: May 2010
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing self-timed combinational logic can be complex and expensive. This paper presents a complete synthesis flow that generates self-timed combinational networks from conventional Boolean networks. The boolean network is partitioned into small function blocks which are then synthesized using self-timed techniques. The procedure employs relaxation optimizations to distribute the overheads associated with self-timed networks between function-blocks. Relaxation is incorporated into the function block synthesis procedures, meaning the optimizations can be applied at a much finer granularity than previously possible.