Method for determining a matched routing arrangement for...

Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C716S030000, C716S030000

Reexamination Certificate

active

10926573

ABSTRACT:
The present invention relates to a method for determining a matched routing netlist for a semiconductor device. In a particular embodiment, a topological plan for the microelectronic device is compiled and used to calculate a population of netlists. The netlists are then dynamically modified using a genetic algorithm to generate a matched netlist for the device.

REFERENCES:
patent: 4935877 (1990-06-01), Koza
patent: 5136513 (1992-08-01), Sol et al.
patent: 5239643 (1993-08-01), Blount et al.
patent: 5329464 (1994-07-01), Sumic et al.
patent: 5343554 (1994-08-01), Koza et al.
patent: 5535134 (1996-07-01), Cohn et al.
patent: 5550839 (1996-08-01), Buch et al.
patent: 5651099 (1997-07-01), Konsella
patent: 5742738 (1998-04-01), Koza et al.
patent: 5867397 (1999-02-01), Koza et al.
patent: 6226776 (2001-05-01), Panchul et al.
patent: 6292929 (2001-09-01), Scepanovic et al.
patent: 6424959 (2002-07-01), Bennett et al.
patent: 6493658 (2002-12-01), Koford et al.
patent: 6578176 (2003-06-01), Wang et al.
patent: 6711720 (2004-03-01), Chen
patent: 6785662 (2004-08-01), Guy et al.
patent: 6789233 (2004-09-01), Gore et al.
Christensen, Heather L., Roger L. Wainwright, and Dale A. Schoenefeld. “A Hybrid Algorithm For The Point To Multipoint Routing Problem.” ACM 1997: 263-268.
Davidenko, Vladimir N., Victor M. Kureichik, and Victor V. Miagkikh. “Genetic Algorithm For Restrictive Channel Routing Problem.” 1997.
Esbensen, Henrik, and Ernest S. Kuh. “A Performance-Driven IC/MCM Placement Algorithm Featuring Explicit Design Space Exploration.”ACM Transactions on Design Automation of Electronic Systems, vol. 2, No. 1, Jan. 1997: 62-80.
Goni, B. M., T. Arslan, and B. Turton. “A Genetic Algorithm For Over-The-Cell and Channel Area Optimization.” Proceedings of the 2000 Congress on Evolutionary Computation, Jul. 16-19, 2000. La Jolla, California: 586-592.
Kahng, Andrew B., and Chung-Wen Albert Tsao. “Practical Bounded-Skew Clock Routing.” 1-25, no date.
Koza, J. R., F. H. Bennett III, D. Andre, and M. A. Keane. “Synthesis of topology and sizing of analog electrical circuits by means of genetic programming.” Computer Methods in Applied Mechanics and Engineering. 186, 2000: 459-482.
Mostafa, Mohamed E., and Saad M. A. Eid. “A Genetic Algorithm for Joint Optimization of Capacity and Flow Assignment in Packet Switched Networks.” Seventeenth National Radio Science Conference, Feb. 22-24, 2000, Minufiya University, Egypt: C5 1-C5 6.
Munetomo, Masaharu, Yoshiaki Takai, and Yoshiharu Sato. “An Adaptive Network Routing Algorithm Employing Path Genetic Operators,” no date.
Sinha, K., S. Sur-Kolay, P.S. Dasgupta, and B. B. Bhattacharya. “Partitioning Routing Area into Zones with Distinct Pins.” IEEE, 2000: 345-350.
Skok, Minea, Davor {hacek over (S)}krlec, and Slavko Krajcar. “The Non-Fixed Destination Multiple Depot Capacitated Vehicle Routing Problem and Genetic Algorithms.” Twenty-Second International Conference Information Technology Interfaces ITI, Jun. 13-16, 2000, Pula, Croatia.
Tan, K. C., L. H. Lee, and K. Q. Zhu. “Heuristic Methods for Vehicle Routing Problem with Time Windows.” Sep. 10, 1999: 1-34.
Tan, K. C., T. H. Lee, K. Ou, and L. H. Lee. “A Messy Genetic Algorithm for the Vehicle Routing Problem with Time Window Constraints.” Proceedings of the 2001 Congress on Evolutionary Computation. May 27-30, 2001, COEX, Seoul, Korea: 679-686.
Tang, Maolin, Kamran Eshraghian, and Daryoush Habibi. “Knowledge-based Genetic Algorithm for Layer Assignment.” IEEE, 2001: 184-190.
Tang, Maolin, Kamran Eshraghian, and Hon Nin Cheung. “A Genetic Algorithm For Constrained VIA Minimization.” IEEE 1999: 435-440.
Zhou, Xianwei, Chen Changjia, and Zhu Gang. “A Genetic Algorithm for Multicasting Routing Problem,” no date.
Zhu, Kenny Qili. “A New Genetic Algorithm For VRPTW.” National University of Singapore, Apr. 13, 2000: 1-10.
Zhu, Liming, Roger L. Wainwright, and Dale A. Schoenefeld. “A Genetic Algorithm for the Point to Multipoint Routing Problem with Varying Number of Requests.” IEEE 1998: 171-176.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method for determining a matched routing arrangement for... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for determining a matched routing arrangement for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for determining a matched routing arrangement for... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3800664

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.