Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICCD
2001
IEEE

favoriteEmaildiscussreport

71views Hardware» more ICCD 2001»

Lower Bound Based DDD Minimization for Efficient Symbolic Circuit Analysis

14 years 1 months ago

Lower Bound Based DDD Minimization for Efficient Symbolic Circuit Analysis

Download mixedsignal.eleg.uark.edu

Alicia Manthe, C.-J. Richard Shi

Real-time Traffic

Hardware | ICCD 2001 |

claim paper

Related Content

» Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reach...

» Modular static scheduling of synchronous dataflow networks an efficient symbolic represent...

» The epsilonapproximation to discrete VT assignment for leakage power minimization

» Fast statistical timing analysis handling arbitrary delay correlations

» Power Dissipation in Deep Submicron CMOS Digital Circuits

» Density gradient minimization with couplingconstrained dummy fill for CMP control

» More on Noncommutative Polynomial Identity Testing

» Analysis and Optimization of Power Control in Multiuser Cognitive Wireless Networks

» Cooperative communications protocol for multiuser OFDM networks

Post Info
More Details (n/a)

Added	16 Mar 2010
Updated	16 Mar 2010
Type	Conference
Year	2001
Where	ICCD
Authors	Alicia Manthe, C.-J. Richard Shi

Comments (0)