Method and apparatus for pre-tabulating sub-networks

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, C716S030000

Reexamination Certificate

active

07100143

ABSTRACT:
Some embodiments of the invention provide a method for pre-tabulating sub-networks. This method (1) generates a sub-network that performs a function, (2) generates a parameter based on this function, and (3) stores the sub-network in a storage structure based on the generated parameter. In some embodiments, the generated sub-network has several circuit elements. Also, in some embodiments, the generated sub-network performs a set of two or more functions. Some embodiments store each generated sub-network in an encoded manner. Some embodiments provide a method for producing a circuit description of a design. This method (1) selects a candidate sub-network from the design, (2) identifies an output function performed by the sub-network, (3) based on the identified output function, identifies a replacement sub-network from a storage structure that stores replacement sub-networks, and (4) replaces the selected candidate sub-network with the identified replacement sub-network in certain conditions. In some embodiments, this method is performed to map a design to a particular technology library. Some embodiments provide a data storage structure that stores a plurality of sub-networks based on parameters derived from the output functions of the sub-networks.

REFERENCES:
patent: 4703435 (1987-10-01), Darringer et al.
patent: 5003487 (1991-03-01), Drumm et al.
patent: 5311442 (1994-05-01), Fukushima
patent: 5349250 (1994-09-01), New
patent: 5357153 (1994-10-01), Chiang et al.
patent: 5365125 (1994-11-01), Goetting et al.
patent: 5493504 (1996-02-01), Minato
patent: 5519630 (1996-05-01), Nishiyama et al.
patent: 5521835 (1996-05-01), Trimberger
patent: 5526276 (1996-06-01), Cox et al.
patent: 5537330 (1996-07-01), Damiano et al.
patent: 5537341 (1996-07-01), Rose et al.
patent: 5610828 (1997-03-01), Kodosky et al.
patent: 5610829 (1997-03-01), Trimberger
patent: 5649165 (1997-07-01), Jain et al.
patent: 5668732 (1997-09-01), Khouja et al.
patent: 5696694 (1997-12-01), Khouja et al.
patent: 5696974 (1997-12-01), Agrawal et al.
patent: 5574441 (1998-05-01), Tokunoh et al.
patent: 5752000 (1998-05-01), McGeer et al.
patent: 5754441 (1998-05-01), Tokunoh et al.
patent: 5787010 (1998-07-01), Schaefer et al.
patent: 5889411 (1999-03-01), Chaudhary
patent: 5892678 (1999-04-01), Tokunoh et al.
patent: 5903466 (1999-05-01), Beausang et al.
patent: 5991524 (1999-11-01), Belkhale et al.
patent: 6023566 (2000-02-01), Belkhale et al.
patent: 6035107 (2000-03-01), Kuehlmann et al.
patent: 6038386 (2000-03-01), Jain
patent: 6080204 (2000-06-01), Mendel
patent: 6086626 (2000-07-01), Jain et al.
patent: 6102964 (2000-08-01), Tse et al.
patent: 6134705 (2000-10-01), Pedersen et al.
patent: 6140839 (2000-10-01), Kaviani et al.
patent: 6150838 (2000-11-01), Wittig et al.
patent: 6216252 (2001-04-01), Dangelo et al.
patent: 6298472 (2001-10-01), Phillips et al.
patent: 6301687 (2001-10-01), Jain et al.
patent: 6301696 (2001-10-01), Lien et al.
patent: 6311317 (2001-10-01), Khoche et al.
patent: 6333918 (2001-12-01), Hummel
patent: 6334205 (2001-12-01), Iyer et al.
patent: 6336208 (2002-01-01), Mohan et al.
patent: 6356863 (2002-03-01), Sayle
patent: 6378112 (2002-04-01), Martin et al.
patent: 6389586 (2002-05-01), McElvain
patent: 6397170 (2002-05-01), Dean et al.
patent: 6421818 (2002-07-01), Dupenloup et al.
patent: 6446240 (2002-09-01), Iyer et al.
patent: 6453447 (2002-09-01), Gardner et al.
patent: 6470478 (2002-10-01), Bargh et al.
patent: 6470486 (2002-10-01), Knapp
patent: 6473884 (2002-10-01), Ganai et al.
patent: 6490717 (2002-12-01), Pedersen et al.
patent: 6496972 (2002-12-01), Segal
patent: 6519609 (2003-02-01), Touzet
patent: 6519754 (2003-02-01), McElvain et al.
patent: 6523156 (2003-02-01), Cirit
patent: 6539536 (2003-03-01), Singh et al.
patent: 6543037 (2003-04-01), Limquenco et al.
patent: 6546539 (2003-04-01), Lu et al.
patent: 6546541 (2003-04-01), Petranovic et al.
patent: 6574779 (2003-06-01), Allen et al.
patent: 6587990 (2003-07-01), Andreev et al.
patent: 6594808 (2003-07-01), Kale et al.
patent: 6618835 (2003-09-01), Garlapati et al.
patent: 6687883 (2004-02-01), Cohn et al.
patent: 2001/0013113 (2001-08-01), Matsunaga
patent: 2002/0079921 (2002-06-01), Kaviani et al.
patent: 2002/0157063 (2002-10-01), Besson
patent: 2002/0178432 (2002-11-01), Kim et al.
patent: 2003/0145288 (2003-07-01), Wang et al.
patent: 2003/0154210 (2003-08-01), Teig et al.
patent: 2003/0154280 (2003-08-01), Teig et al.
patent: 2003/0154448 (2003-08-01), Teig et al.
patent: 2003/0154449 (2003-08-01), Teig et al.
patent: 2003/0159115 (2003-08-01), Teig et al.
patent: 2003/0159116 (2003-08-01), Teig et al.
patent: 2003/0217026 (2003-11-01), Teig et al.
patent: 2003/0217339 (2003-11-01), Teig et al.
patent: 2003/0217340 (2003-11-01), Teig et al.
patent: 2003/0217350 (2003-11-01), Teig et al.
patent: 2004/0019857 (2004-01-01), Teig et al.
Dreesen J., Standard Cell Development Flow, IEEE, 1990, pp. 450-455.
Krishnamoorthy et al., Boolean Matching of Sequential Elements, Proceedings of the 31st annual conference on Design automation conference, pp. 691-697, Jun. 6-10, 1994, San Diego, California, United States.
Andersen, H. R., An Introduction to Binary Decision Diagrams, Oct. 1997 (minor revisions Apr. 1998), pp. 1-36.
Bryant, R. E., Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams, CMU CS Tech Report CMU-CS-92-160, pp. 1-33.
Burch, J. R. et al., Efficient Boolean Function Matching, Proc. ICCAD 1992, 408-411.
Chaudhary K. et al., A Near Optimal Algorithm for Technology Mapping Minimizing Area under Delay Constraints, Proceedings of the 29th Design Automation Conference, 492-498, 1992.
Crastes, M. et al., A Technology Mapping Method Based on Perfect and Semi-Perfect Matchings, Design Automation Conference, 1991, 28th ACM/IEEE, Jun. 17-21, 1991, pp. 93-98.
Czech, Z. J. et al., An Optimal Algorithm for Generating Minimal Perfect Hashing Functions, Information Processing Letters, 43(5); 257-264, Oct. 1992.
Devadas, S. et al., Synthesis and Optimization for Robustly Delay-Fault Testable Combinational Logic Circuits, Design Automation Conference, 1990, 27th ACM/IEEE, Jun. 24-28, 1990, pp. 221-227.
Fishburn, J. P., A Depth-Decreasing Heuristic for Combinational Logic; or How to Convert Ripple-Carry Adder into a Carry-Lookahead Adder or Anything In-Between, Proceedings of the 27th Design Automation Conference, 361-364, 1990.
Hinsberger, U. et al., Boolean Matching for Large Libraries, Proceedings of the 35th Design Automation Conference, 206-211, Jun. 1998.
Jongeneel, D.-J. et al., Area and Search Space Control for Technology Mapping, 37th Design Automation Conference, 86-91, 2000.
Keutzer, K., DAGON: Technology Binding and Local Optimization by DAG Matching, Proceedings of the 24th Design Automation Conference, 341-347, 1987.
Krishnamoorthy et al., Boolean Matching of Sequential Elements, 31stACM/IEEE Design Automation Conference, 1994, pp. 691-697.
Kukimoto, Y. et al., Delay-Optimal Technology Mapping by DAG Covering, Dept. of Electrical Engineering and Computer Science, University of California, Berkeley, Strategic CAD Laboratories, Intel Corp., Oct. 1997.
Markovic et al., “FPGA to ASIC Conversion Design Methodology with the Support for Fast Retargetting to Different CMOS Implementation Technologies”, Proceedings of 2002 22ndInternational Conference on Microelectronics, vol. 2, May 14, 2000, pp. 703-706.
NN78055443, “Automatic Remap”, IBM Technical Disclosure Bulletin, vol. 20, No. 12, May 1978, pp. 5443-5445.
NN9411291, “Design of Portable Library using Parameterized Cells”, IBM Technical Disclosure Bulletin, Vo.. 37, No. 11, pp. 291-292.
Ruiz et al., “Design and Prototyping of DSP Custom Circuits Based on a Library of Arithmetic Components”, vol. 1, Nov. 9, 1997, pp. 191-196.
Tamlya, Y., “Delay Estimation for Technology Independent Synthesis”, 1997 Proceedings of the ASP- DAC '97, Asia and South Pacific Design Automation Conference, Jan. 28, 1997, pp. 31-36.
Yi, J. H. et al., Technology Mapping for Storage Elements Based on BDD m

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 and apparatus for pre-tabulating sub-networks 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 and apparatus for pre-tabulating sub-networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for pre-tabulating sub-networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3645362

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