Zone tree method and mechanism

Details Zone tree method and mechanism Zone tree method and mechanism

2006-08-29

2006-08-29

Kik, Phallaka (Department: 2825)

Computer-aided design and analysis of circuits and semiconductor

Nanotechnology related integrated circuit design

C716S030000, C716S030000

Reexamination Certificate

active

07100128

ABSTRACT:
A method of analyzing a design of an electronic circuit uses slices. The method includes generating one or more slices, each slice comprising a contiguous region of the design, and generating an set comprising one or more bins for each slice. A search for an object may be performed by determining a search area, and identifying slices containing at least a portion of the search area. For each identified slice, each object within the search area is associated with one of the bins of the set for the slice.

REFERENCES:
patent: 4831725 (1989-05-01), Dunham et al.
patent: 5157618 (1992-10-01), Ravindra et al.
patent: 5375069 (1994-12-01), Satoh et al.
patent: 5497334 (1996-03-01), Russell et al.
patent: 5610828 (1997-03-01), Kodosky et al.
patent: 5818729 (1998-10-01), Wang et al.
patent: 5831865 (1998-11-01), Berezin et al.
patent: 5850350 (1998-12-01), Shibuya et al.
patent: 5911061 (1999-06-01), Tochio et al.
patent: 6009250 (1999-12-01), Ho et al.
patent: 6009251 (1999-12-01), Ho et al.
patent: 6011911 (2000-01-01), Ho et al.
patent: 6253363 (2001-06-01), Gasanov et al.
patent: 6286128 (2001-09-01), Pileggi et al.
patent: 6292929 (2001-09-01), Scepanovic et al.
patent: 6324675 (2001-11-01), Dutta et al.
patent: 6349403 (2002-02-01), Dutta et al.
patent: 6415426 (2002-07-01), Chang et al.
patent: 6418551 (2002-07-01), McKay et al.
patent: 6442743 (2002-08-01), Sarrafzadeh et al.
patent: 6536024 (2003-03-01), Hathaway
patent: 6543039 (2003-04-01), Watanabe
patent: 6557145 (2003-04-01), Boyle et al.
patent: 6560505 (2003-05-01), Kikuchi et al.
patent: 6625611 (2003-09-01), Teig et al.
patent: 6637010 (2003-10-01), Yamamoto
patent: 6668365 (2003-12-01), Harn
patent: 6701306 (2004-03-01), Kronmiller et al.
patent: 6785874 (2004-08-01), Tsukuda
patent: 6792582 (2004-09-01), Cohn et al.
patent: 6829754 (2004-12-01), Yu et al.
patent: 6851099 (2005-02-01), Sarrafzadeh et al.
patent: 6859916 (2005-02-01), Teig et al.
patent: 6871328 (2005-03-01), Polk
patent: 6904584 (2005-06-01), Brenner et al.
patent: 6961916 (2005-11-01), Sarrafzadeh et al.
patent: 2001/0003843 (2001-06-01), Scepanovic et al.
patent: 2001/0010090 (2001-07-01), Boyle et al.
patent: 2002/0029370 (2002-03-01), Michalewicz et al.
patent: 2002/0038445 (2002-03-01), Yamamoto
patent: 2002/0059194 (2002-05-01), Choi et al.
patent: 2002/0116686 (2002-08-01), Shin et al.
patent: 2002/0138816 (2002-09-01), Sarrafzadeh et al.
patent: 2003/0088839 (2003-05-01), Watanabe
patent: 2003/0163297 (2003-08-01), Khaira et al.
patent: 2003/0182649 (2003-09-01), Harn
patent: 2003/0208737 (2003-11-01), Brenner et al.
patent: 2003/0217338 (2003-11-01), Holmes et al.
patent: 2004/0040007 (2004-02-01), Harn
patent: 2004/0044980 (2004-03-01), Juengling
patent: 2004/0060022 (2004-03-01), Allen et al.
patent: 2005/0204325 (2005-09-01), Fung et al.
patent: 11066111 (1999-03-01), None
Kim et al., “An Efficient CPLD Technology Mapping Under the Time Constraint”, Proceedings of the 12th International Conference on Microelectronics, Oct. 31-Nov. 2, 2000, pp. 265-268.
Zhu et al., “On the Optimal Search Problem: the Case When the Target Distribution Unknown”, Proceedings of XVII International Conference on the Chilean Computer Science Society, Nov. 10-15, 1997, pp. 268-277.
Yeh et al., “Cost-Effective VLSI Architectures and Buffer Size Optimization for Full-Search Block Matching Algorithms”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 7, No. 3, Sep. 1999, pp.345-358.
Ahuja, R.K. et al., eds.,Network Flows, Theory, Algorithms, and Applications(1993) pp. 510-542, Prentice Hall, Upper Saddle River, NJ.
Al-Yamani, A. et al. “HPTS: Heterogeneous Parallel Tabu Search for VLSI Placement”Proceedings of the 2002 Congress on Evolutionary Computation(May 12-17, 2002) 1:351-355.
Anderson, R. et al. “An O(n log n) Algorithm for 1-D Tile Compaction”ICCAD-89—International Conference on Computer-Aided Design(Nov. 5-9, 1989) pp. 144-147.
Balasa, F. et al. “Efficient Solution Space Exploration Based on Segment Trees in Analog Placement with Symmetry Constraints” inIEEE/ACM International Conference on Computer Aided Design(Nov. 10-14, 2002) pp. 497-502.
Barzaghi, M. et al, “Hierarchical Management of VLSI Cells at Different Description Levels”Proceedings of the 6thMediterranean Electrotechnical Conference(May 22-24, 1991) 1:327-330.
Benetis, R. et al. “Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects”Proceedings of the International Database Engineering and Applications Symposium(IDEAS'02) (Jul. 17-19, 2002) pp. 44-53.
Bern, J. et al. “Some Heuristics for Generating Tree-like FBDD Types”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems(Jan. 1996) 15(1):127-130.
Bhattacharya, S. and W.-T. Tsai “Area Efficient Binary Tree Layout”1stGreat Lakes Symposium on VLSI(Mar. 1-2, 1991) pp. 18-24.
Blust, G. and D.P. Mehta “Corner Stitching for L-shaped Tiles”Proceedings of the 3rdGreat Lakes Symposium on VLSI, Design Automation of High Performance VLSI Systems(Mar. 5-6, 1993) pp. 67-68.
Borah, M. et al, “An Edge-Based Heuristic for Steiner Routing”IEEE Transactions on Computer-Aided Design of Integrtaed Circuits and Systems(Dec. 1994) 13(12):1563-1568.
Brück, R. and H. Wronn “—geoADDICTION—Flexible Handling of Geometries in IC-Layout Tools”ISCAS '88—IEEE International Symposium on Circuits and Systems(Jun. 7-9, 1988) 1:723-726.
Cadence Design Systems, Inc.IC Shape-Based Technology Chip Assembly User GuideProduct Version 11.0 (Nov. 2001), 134 Pages.
Carlson, E.C. and R.A. Rutenbar “A Scanline Data Structure Processor for VLSI Geometry Checking”IEEE Transactions on Computer-Aided Design(Sep. 1987) 6(5):780-794.
Cheung, P. and J. Hesketh “Design Automation Tools for Tile-Based Analogue Cells”IEE Colloquium on New Directions in VLSI Design(Nov. 27, 1989) pp. 3/1-3/5.
Chiang, C. and C.-S. Chiang “Octilinear Steiner Tree Construction”MWSCAS-2002—The 2002 45thMidwest Symposium on Circuits and Systems(Aug. 4-7, 2002) 1:603-606.
Christian, B.S. et al. “A VLSI Interval Router for High-Speed Networks”Canadian Confernce on Electrical and Computer Engineering(May 26-29, 1996) 1:154-157.
Cong, J. et al. “Multilevel Approach to Full-Chip Gridless Routing”ICCAD 2001—IEEE/ACM International Conference on Computer-Aided Design(Nov. 4-8, 2001) pp. 396-403.
Curatelli, F. et al. “Efficient Management of Complex Elements in Physical IC Design”Proceedings of the IEEE International Symposium on Circuits and Systems(May 1-3, 1990) 1:456-459.
Das, S. and B.B. Bhattacharya “Channel Routing in Manhattan-Diagonal Model”Proceedings of the 9thInternational Conference on VLSI Design(Jan. 3-6, 1996) pp. 43-48.
Dasgupta, P. et al. “Multiobjective Search in VLSI Design”Proceedings of the 7thInternational Conference on VLSI Design(Jan. 1994) pp. 395-400.
Dasgupta, P. et al. “Searching Networks With Unrestricted Edge Costs”IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans(Nov. 2001) 31(6):497-507.
Dijkstra, E.W. “A Note on Two Problems in Connexion with Graphs”Numerische Mathematik(1959) 1:269-271.
de Dood, P. et al. “A Two-Dimensional Topological Compactor With Octagonal Geometry”28thACM/IEEE Automation Conference(1991) pp. 727-731.
Doong, K. Y.-Y. et al. “Infrastructure Development and Integration of Electrical-Based Dimensional Process Window Checking”IEEE Transactions on Semiconductor Manufacturing(May 2004) 17(2):123-141.
Dutt, S. “New Faster Kernighan-Lin-Type Graph-Partitioning Algorithms”ICCAD-93—1993 IEEE/ACM International Conference on Computer-Aided Design(Nov. 7-11, 1993) pp. 370-377.
Façanha, H.S. et al. “Layout Tool for High Speed Electronic and Optical Circuits”IEE Colloqui

Affiliated with

Also associated with

Rating

Zone tree method and mechanism does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Zone tree method and mechanism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Zone tree method and mechanism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3713458