System and method for unfolding/replicating logic paths to...

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

Reexamination Certificate

active

11054903

ABSTRACT:
A system and method for unfolding/replicating logic paths to facilitate propagation delay modeling are provided. With the system and method, nets of an integrated circuit design are unfolded and logic of these nets is replicated such that each leg of a fanout can be driven independently from the signal source. In order to unfold the nets, the nets and logic are replicated in the netlist and connected to replicated source and endpoints. These new nets in the netlist may then be driven separately such that a different propagation delay along different nets from the same source may be simulated. In this way, a level of propagation delay may be abstracted into the modeling by driving or delaying each path separately. The transitioning value will then appear to have differing arrival times from the perspective of the sinks.

REFERENCES:
patent: 4011465 (1977-03-01), Alvarez, Jr.
patent: 5287289 (1994-02-01), Kageyama et al.
patent: 5396435 (1995-03-01), Ginetti
patent: 5452239 (1995-09-01), Dai et al.
patent: 5499192 (1996-03-01), Knapp et al.
patent: 5504690 (1996-04-01), Kageyama et al.
patent: 5586047 (1996-12-01), Imahashi
patent: 5659484 (1997-08-01), Bennett et al.
patent: 5958077 (1999-09-01), Banerjee et al.
patent: 5966523 (1999-10-01), Uchino
patent: 6071003 (2000-06-01), Ashuri et al.
patent: 6321184 (2001-11-01), Baumgartner et al.
patent: 6374393 (2002-04-01), Hirairi
patent: 6516449 (2003-02-01), Masud
patent: 6553514 (2003-04-01), Baumgartner et al.
patent: 6643829 (2003-11-01), Borkovic et al.
patent: 6643832 (2003-11-01), Ray et al.
patent: 6816825 (2004-11-01), Ashar et al.
patent: 6868535 (2005-03-01), Podkolzin et al.
patent: 6959271 (2005-10-01), Ballam
patent: 6973632 (2005-12-01), Brahme et al.
patent: 7020589 (2006-03-01), Datta Ray et al.
patent: 7086016 (2006-08-01), Matsuzaki et al.
patent: 2001/0020289 (2001-09-01), Pavisic et al.
patent: 2004/0103387 (2004-05-01), Teig et al.
patent: 2004/0233742 (2004-11-01), Morzano
patent: 2004/0250226 (2004-12-01), Lin et al.
patent: 2005/0246673 (2005-11-01), Charlebois et al.
patent: 2005/0273748 (2005-12-01), Hetzel et al.
patent: 2006/0095879 (2006-05-01), Brahme et al.
patent: 2006/0190860 (2006-08-01), Ng et al.
patent: 2007/0033551 (2007-02-01), Greaves et al.
Xie et al., “Design of Robust-Path-Delay-Fault-Testable Combinational Circuits by Boolean Expansion”, IEEE 1992 International Conference on Computer Design: VLSI in Computers and Processors, Oct. 11-14, 1992, pp. 482-485.
Miyamoto et al., “An Efficient Algorithm for Deriving Logic Functions of Asynchronous Circuits”, Proceedings of Second International Symposium on Advanced Research in Asynchronous Circuits and Systems, Mar. 18-21, 1996, pp. 30-35.
Gharaybeh et al., “False-Path Removal Using Delay Fault Simulation”, Proceedings of Seventh Asian Test Symposium, Dec. 2-4, 1998, pp. 82-87.
U.S. Appl. No. 11/360,906, filed Feb. 23, 2006, Hidvegi et al.
U.S. Appl. No. 11/457,865, filed Jul. 17, 2006, Gass et al.

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

System and method for unfolding/replicating logic paths to... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for unfolding/replicating logic paths to..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for unfolding/replicating logic paths to... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3806305

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