Title
Algorithms for MIS Vector Generation and Pruning
Abstract
Ignoring the effect of simultaneous switching for logic gates causes silicon failures for high performance microprocessor designs. The main reason to omit this effect is the run time penalty and potential over-conservatism. Run times are directly proportional to the vector sizes. Efficient algorithms are presented that prune the multiple input switching (MIS) vector set to a worst-case covering using a boolean logic abstraction of the gate. This non-physical representation reduces the vector size to approximately n vectors for an n-input gate. This is effectively the same vector set size as the optimal single input switching vector set. There are no errors for 88% the simulations using a Monty-Carlo coverage on a 90nm static library, and the magnitude of the errors are less than 5% on average.
Year
DOI
Venue
2006
10.1109/ICCAD.2006.320066
San Jose, CA
Keywords
Field
DocType
Boolean algebra,Monte Carlo methods,logic design,logic gates,microprocessor chips,vectors,90 nm,Monte-Carlo coverage,boolean logic abstraction,logic gates,microprocessor designs,multiple input switching,silicon failures,vector generation
Logic synthesis,Magnitude (mathematics),Static library,Monte Carlo method,Logic gate,Computer science,Microprocessor,Algorithm,Electronic engineering,Real-time computing,Decoupling capacitor,Boolean algebra
Conference
ISSN
ISBN
Citations 
1092-3152 E-ISBN : 1-59593-389-1
1-59593-389-1
1
PageRank 
References 
Authors
0.37
5
2
Name
Order
Citations
PageRank
Kenneth S. Stevens118525.65
Florentin Dartu237368.79