Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2004-11-30
2008-01-01
Whitmore, Stacy A (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000, C716S030000, C703S013000, C703S014000, C714S718000, C714S738000
Reexamination Certificate
active
07315993
ABSTRACT:
The present invention provides a method of verification of a RRAM tiling netlist. The method may include steps as follows. Properties “memory_number”, “clock_number” and “netlist_part” of all nets and cells of a RRAM tiling netlist are set to a value 0. A boolean value 0 is assigned to all ground nets of the RRAM tiling netlist, and a boolean value 1 is assigned to all power nets of the RRAM tiling netlist. The RRAM tiling netlist is verified for each customer memory Memk, k=1, 2, . . . , N.
REFERENCES:
patent: 5680332 (1997-10-01), Raimi et al.
patent: 5734798 (1998-03-01), Allred
patent: 5812414 (1998-09-01), Butts et al.
patent: 5910958 (1999-06-01), Jay et al.
patent: 5940603 (1999-08-01), Huang
patent: 6078735 (2000-06-01), Baxter
patent: 6115300 (2000-09-01), Massoumi et al.
patent: 6151568 (2000-11-01), Allen et al.
patent: 6181614 (2001-01-01), Aipperspach et al.
patent: 6195776 (2001-02-01), Ruiz et al.
patent: 6249901 (2001-06-01), Yuan et al.
patent: 6295627 (2001-09-01), Gowni et al.
patent: 6345379 (2002-02-01), Khouja et al.
patent: 6523155 (2003-02-01), Ruedinger
patent: 6618311 (2003-09-01), Becker
patent: 6667917 (2003-12-01), Templeton et al.
patent: 6823502 (2004-11-01), Wingren et al.
patent: 6964029 (2005-11-01), Poznanovic et al.
patent: 6993731 (2006-01-01), Whitaker et al.
patent: 7069522 (2006-06-01), Sluss et al.
patent: 7149142 (2006-12-01), Fisher et al.
patent: 7155685 (2006-12-01), Mori et al.
patent: 7155688 (2006-12-01), Andreev et al.
patent: 7171640 (2007-01-01), Terai et al.
patent: 7181359 (2007-02-01), Goyal
patent: 2003/0172055 (2003-09-01), Prakash et al.
patent: 2004/0123262 (2004-06-01), Shirota et al.
patent: 2004/0261044 (2004-12-01), Yonezawa
patent: 2005/0097416 (2005-05-01), Plunkett
patent: 2005/0125707 (2005-06-01), Bonaccio et al.
patent: 2005/0240746 (2005-10-01), Nikitin et al.
patent: 2005/0273683 (2005-12-01), Cote et al.
patent: 2006/0061795 (2006-03-01), Walmsley
patent: 2006/0064664 (2006-03-01), Faber et al.
Haddad et al.; “Increased throughput for the testing and repair of RAMs with redundancy”, Feb. 1991, Computers, IEEE Transactions on, vol. 40, Issue 2, pp. 154-166.
Low et al.; “Minimum fault coverage in memory arrays: a fast algorithm and probabilistic analysis”, Jun. 1996, Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol. 15, Issue 6, pp. 681-690.
Lin et al.; “An efficient algorithm for reconfiguring shared spare RRAM”, Oct. 11-13, 2004, Computer Design: VLSI in Computers and Processors, Proceedings. IEEE International Conference on, pp. 544-546.
Andreev Alexander E.
Nikitin Andrey A.
Scepanovic Ranko
LSI Logic Corporation
Rossoshek Helen
Suiter Swantz PC LLO
Whitmore Stacy A
LandOfFree
Verification of RRAM tiling netlist does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Verification of RRAM tiling netlist, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Verification of RRAM tiling netlist will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3963008