Minimal bends connection models for wire density calculation

Details Minimal bends connection models for wire density calculation Minimal bends connection models for wire density calculation

2006-07-11

2006-07-11

Rodriguez, Paul L. (Department: 2123)

Data processing: structural design, modeling, simulation, and em

Modeling by mathematical expression

C716S030000

Reexamination Certificate

active

07076406

ABSTRACT:
A method of accurately estimating horizontal and vertical wire densities in a datapath or hardmac. The method provides that the datapath or hardmac is divided into areas, and mathematical expectations are calculated for full and partial horizontal and vertical segments for each of the areas. The mathematical expectations are summed for both the horizontal and vertical segments, and this is done for each connection within the datapath or hardmac in order to estimate both horizontal and vertical wire densities. A congestion map can be created, and 100% detail routing is effectively guaranteed as a result of using the method. Preferably, a model with minimum bends is used in areas with low wire density, and models with more bends are used in areas with middle and high wire density.

REFERENCES:
patent: 5311443 (1994-05-01), Crain et al.
patent: 5587923 (1996-12-01), Wang
patent: 5701255 (1997-12-01), Fukui
patent: 5784289 (1998-07-01), Wang
patent: 6067409 (2000-05-01), Scepanovic et al.
patent: 6348813 (2002-02-01), Agrawal et al.
patent: 6442745 (2002-08-01), Arunachalam et al.
patent: 6480991 (2002-11-01), Cho et al.
patent: 2003/0005398 (2003-01-01), Cho et al.
Lou et al, “Estimating Routing Congestion Using Probabilistic Analysis”, Proceedings of the 2001 International Symposium on Physical Design, pp. 112-117, Apr. 1-4, 2001.
Bazargan et al, “Fast and accurate estimation of floorplans in logic/high-level synthesis”, Proceedings of the 10th Great Lakes symposium on VLSI, pp. : 95-100,2000.
Burstein et al, “Hierarchical Wire Routing”, Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol. : 2 , Issue: 4 , Oct. 1983,pp. :223-234.
Vijayan, Gopalakrishnan, “Partitioning logic to optimize routability on graph structures”, Circuits and Systems, 1990., IEEE International Symposium on, May 1-3, 1990, pp. :2638-2641 vol. 4.
Sarrafzadeh et al., “Single-Layer Global Routing” IEEE 1994 p. 38-47.

Affiliated with

Also associated with

Rating

Minimal bends connection models for wire density calculation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Minimal bends connection models for wire density calculation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal bends connection models for wire density calculation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3590924