Placement based multiplier rewiring for cell-based designs

We present an algorithm for improving the performance of Carry-Save-Adder (CSA) style multipliers. Based on placement information, the algorithm exploits the arithmetic equivalence in the CSA multipliers and rewires to improve the slack of the multiplier.

[1]  Carl Sechen,et al.  Timing Driven Placement for Large Standard Cell Circuits , 1995, 32nd Design Automation Conference.

[2]  Earl E. Swartzlander,et al.  A comparison of Dadda and Wallace multiplier delays , 2003, SPIE Optics + Photonics.

[3]  Vojin G. Oklobdzija,et al.  A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach , 1996, IEEE Trans. Computers.

[4]  S. K. Nandy,et al.  Automatic generation of tree multipliers using placement-driven netlists , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[5]  D. H. Jacobsohn,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[6]  R. Ravi,et al.  Design strategies for optimal multiplier circuits , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[7]  Taewhan Kim,et al.  Tight integration of timing-driven synthesis and placement of parallel multiplier circuits , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  L.P.P.P. van Ginneken,et al.  Buffer placement in distributed RC-tree networks for minimal Elmore delay , 1990, IEEE International Symposium on Circuits and Systems.

[9]  Taewhan Kim,et al.  Layout-aware synthesis of arithmetic circuits , 2002, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).

[10]  Wolfgang Kunz,et al.  Placement driven retiming with a coupled edge timing model , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[11]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[12]  Jarrod A. Roy,et al.  Capo: robust and scalable open-source min-cut floorplacer , 2005, ISPD '05.