1994 · 103 citations · 9 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureFault-tolerant ComputingMicroelectronicsCircuit SwitchingLookup TablesSequential Logic DescriptionSwitching TechniquesTiming AnalysisEfficient EstimationPerformance Analysis Of Circuit SwitchingSequential Logic DesignSwitching Activity AnalysisSwitching Activity EstimationSwitching BehaviorSwitching Circuits
W e describe a computationally ecient s c heme to approximate average switching activity in sequential circuits which requires the solution of a non-linear system of equations of size N, where the variables correspond to state line probabilities. W e show that the approximation method is within 3% of the exact Chapman-Kolmogorov method, but is orders of magnitude faster for large circuits. Previous sequential switching activity estimation methods can have signicantly greater inaccuracies.
9
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Probability, Random Variables, and Stochastic Processes
Irwin Miller, Anthanasios Papoulis · Technometrics · 1966 · 6.5K citations
Engineering, Mathematics, Physics +14