An integrated approach to timing-driven synthesis and placement of arithmetic circuits

ABSTRACT

In deep submicron (DSM) design, the interconnect delay becomes equally as or more important than that of logic gates. In particular, to achieve timing closure in DSM design, it is essential to consider the interconnect delay at an early stage of the synthesis process. Unfortunately, few successes of achieving a tight link of front-end synthesis to back-end layout have been reported, in a practical point of view, mainly due to the inaccuracy of predicting the layout effects during the synthesis. In this paper, we address a new approach that refines the structure and placement of the circuit by iteratively performing the two tasks, Timing-driven replacement and Timing-driven resynthesis. The iterative mechanism of the two tasks practically tightly integrates the synthesis and placement tasks so that both of the effects of placement on the results of synthesis and the effects of synthesis on the results of placement are fully and effectively taken into account. From experiments using a set of benchmark designs, it is shown that the approach is quite effective, and efficient, producing designs with 6.6%-21.4% shorter timing over the conventional method.

REFERENCES

• 1: Keshab K. Parhi, High-level algorithm and architecture transformations for DSP synthesis, Journal of VLSI Signal Processing Systems, v.9 n.1-2, p.121-143, Jan. 1995 [doi>10.1007/BF02406474]
• 2: Martin Janssen , Francky Catthoor , Hugo De Man, A specification invariant technique for operation cost minimisation in flow-graphs, Proceedings of the 7th international symposium on High-level synthesis, p.146-151, May 18-20, 1994, Niagra-on-the-Lake, Ontario, Canada
• 3: T. Kim, W. Jao, and S. Tjiang, "Circuit Optimization using Carry-Save-Adder Cells", IEEE TCAD, 1998.
• 4: Vojin G. Oklobdzija , David Villeger , Simon S. Liu, A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach, IEEE Transactions on Computers, v.45 n.3, p.294-306, March 1996 [doi>10.1109/12.485568]
• 5: Paul F. Stelling , Charles U. Martel , Vojin G. Oklobdzija , R. Ravi, Optimal Circuits for Parallel Multipliers, IEEE Transactions on Computers, v.47 n.3, p.273-285, March 1998 [doi>10.1109/12.660163]
• 6: Anmol Mathur , Sanjeev Saluja, Improved merging of datapath operators using information content and required precision analysis, Proceedings of the 38th conference on Design automation, p.462-467, June 2001, Las Vegas, Nevada, United States [doi>10.1145/378239.378562]
• 7: Junhyung Um , Taewhan Kim, An Optimal Allocation of Carry-Save-Adders in Arithmetic Circuits, IEEE Transactions on Computers, v.50 n.3, p.215-233, March 2001 [doi>10.1109/12.910813]
• 8: Zhan Yu , Meng-Lin Yu , Alan N. Willson, Jr., Signal representation guided synthesis using carry-save adders for synchronous data-path circuits, Proceedings of the 38th conference on Design automation, p.456-461, June 2001, Las Vegas, Nevada, United States [doi>10.1145/378239.378560]
• 9: C. S. Wallace, "A Suggestion for a Fast Multiplier", IEEE TC, 1964.
• 10: Kai Hwang, Computer Arithmetic: Principles, Architecture and Design, John Wiley & Sons, Inc., New York, NY, 1979
• 11: Earl E. Swartzlander, Jr., Computer Arithmetic I (Tutorial), IEEE Computer Society Press, Los Alamitos, CA, 1990
• 12: N. D. Dutt, "High-Level Synthesis Design Repositiories", http://www.ics.uci.edu/dutt.
• 13: C. M. Fiduccia , R. M. Mattheyses, A linear-time heuristic for improving network partitions, Proceedings of the 19th conference on Design automation, p.175-181, January 1982
• 14: Synopsys Inc., Design Compiler User Guide, 2000.
• 15: LSI Logic Inc., G10-p Cell-Based ASIC Products Databook, 1996.