Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2005-11-01
2005-11-01
Siek, Vuthe (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000, C716S030000, C716S030000
Reexamination Certificate
active
06961916
ABSTRACT:
The present invention, generally speaking, provides a placement method for the physical design of integrated circuits in which natural topological feature clusters (topo-clusters) are discovered and exploited during the placement process. Topo-clusters may be formed based on various criteria including, for example, functional similarity, proximity (in terms of number of nets), and genus. Genus refers to a representation of a netlist in terms of a number of planar netlists—netlists in which no crossing of nets occurs. Topo-clusters drive initial placement, with all of the gates of a topo-cluster being placed initially in a single bin of the placement layout or within a group of positionally-related bins. The portion of a topo-cluster placed within a given bin is called a quanto-cluster. An iterative placement refinement process then follows, using a technique referred to herein as Geometrically-Bounded FM (GBFM), and in particular Dual GBFM. In GBFM, FM is applied on a local basis to windows encompassing some number of bins. From iteration to iteration, windows may shift position and vary in size. When a region bounded by a window meets a specified cost threshold in terms of a specified cost function, that region does not participate. The cost function takes account of actual physical metrics—delay, area, congestion, power, etc. “Dual” refers to the fact that each iteration has two phases. During a first phase, FM is performed within a region on a quanto-cluster basis. During a second phase, FM is performed within the region on a gate basis. GBFM occurs in the context of recursive quadrisection. Hence, after GBFM has been completed, a further quadrisection step is performed in which each bin is divided into four bins, with a quarter of the gates of the original bin being placed in the center of each of the resulting bins. GBFM then follows, and the cycle repeats until each bin contains a fairly small number of gates. Following the foregoing global placement process, the circuit is then ready for detailed placement in which cells are assigned to placement rows.
REFERENCES:
patent: 5418728 (1995-05-01), Yada
patent: 5491641 (1996-02-01), Scepanovic et al.
patent: 5493507 (1996-02-01), Shinde et al.
patent: 5495419 (1996-02-01), Rostoker et al.
patent: 5526517 (1996-06-01), Jones et al.
patent: 5557533 (1996-09-01), Koford et al.
patent: 5636125 (1997-06-01), Rostoker et al.
patent: 5661663 (1997-08-01), Scepanovic et al.
patent: 5682321 (1997-10-01), Ding et al.
patent: 5682322 (1997-10-01), Boyle et al.
patent: 5696693 (1997-12-01), Aubel et al.
patent: 5699265 (1997-12-01), Scepanovic et al.
patent: 5712793 (1998-01-01), Scepanovic et al.
patent: 5748844 (1998-05-01), Marks
patent: 5787268 (1998-07-01), Sugiyama et al.
patent: 5836585 (1998-11-01), Scepanovic et al.
patent: 5854752 (1998-12-01), Agrawal
patent: 5857243 (1999-01-01), Champion
patent: 5870313 (1999-02-01), Boyle et al.
patent: 5903461 (1999-05-01), Rostoker et al.
patent: 5909376 (1999-06-01), Scepanovic et al.
patent: 5914887 (1999-06-01), Scepanovic et al.
patent: 5955776 (1999-09-01), Ishikawa
patent: 6030110 (2000-02-01), Scepanovic et al.
patent: 6067409 (2000-05-01), Scepanovic et al.
patent: 6099580 (2000-08-01), Boyle et al.
patent: 6146117 (2000-11-01), Eng
patent: 6286128 (2001-09-01), Pileggi et al.
patent: 6301694 (2001-10-01), Lee et al.
patent: 6442743 (2002-08-01), Sarrafzadeh et al.
Kim et al. “An Improved Hierarchical Placement Technique Using Clustering & Region Refinement,” IEEE, Nov. 1996, pp. 393-396.
Jang et al., “A Grid-Based Approach for Connectivity Binding with Geometric Costs,” IEEE, 1993, pp. 94-99.
Jin-Tai Yan, “Connection-Oriented Net Model and Fuzzy Clustering Techniques for K-Way Circuit Partitioning,” IEEE, 1995, pp. 236-241.
Yeh et al., “A General Purpose, Multiple-Way Partitioning Algorithm,” IEEE, Dec. 1994, pp. 1480-1488.
Boyle Douglas B.
Chakraborty Abhijeet
Malik Sharad
Pileggi Lawrence
Raje Salil R.
Bever Hoffman & Harms LLP
Kubodera John M.
Siek Vuthe
LandOfFree
Placement method for integrated circuit design using... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Placement method for integrated circuit design using..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Placement method for integrated circuit design using... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3509078