Estimation of average switching activity in combinational and sequential circuits
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Low power state assignment targeting two-and multi-level logic implementations
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Error control systems for digital communication and storage
Error control systems for digital communication and storage
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Achievable bounds on signal transition activity
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Entropic bounds on FSM switching
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low power electronics and design
Theoretical bounds for switching activity analysis in finite-state machines
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on low-power electronics and design
SYCLOP: Synthesis of CMOS Logic for Low Power Applications
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Computation of Lower and Upper Bounds for Switching Activity: A Unified Approach
VLSID '98 Proceedings of the Eleventh International Conference on VLSI Design: VLSI for Signal Processing
Statistical estimation of average power dissipation using nonparametric techniques
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hi-index | 0.00 |
This paper obtains lower and upper bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven by typical input sequences. More specifically, the paper provides bounds on the average Hamming distance which is in turn proportional to the switching activity and the overall power dissipation in the system. By introducing the concepts of a distance matrix and a weight matrix, and by exploiting the symmetry of the distance matrix, we are able to obtain bounds that are provably tighter than existing bounds and, as demonstrated by our experimental results, they can offer significant improvements in many cases of interest. Since our bounds are independent of the state assignment and the actual implementation, they can be used at an early stage of the FSM design to indicate the largest/smallest possible power consumption.