Results 11 - 20
of
8,701
1Bounds on FSM Switching Activity
"... This paper obtains lower and upper bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven with typical input sequences. More specifically, the paper bounds the average Hamming distance which is in turn proportional to the switching activity and the overal ..."
Abstract
- Add to MetaCart
This paper obtains lower and upper bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven with typical input sequences. More specifically, the paper bounds the average Hamming distance which is in turn proportional to the switching activity
ANALYSIS AND ALGORITHMS FOR SCHEDULING WITH MINIMAL SWITCHING ACTIVITIES
"... Switching activities are one of the important factors in power minimization. This paper studies the scheduling problem which minimizes switching activities. We show that to find the schedule which minimizes switching activities only or minimizes latency and switching activities with or without resou ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Switching activities are one of the important factors in power minimization. This paper studies the scheduling problem which minimizes switching activities. We show that to find the schedule which minimizes switching activities only or minimizes latency and switching activities with or without
An Efficient Approach to Switching Activity Estimation
- in Finite State Machines, IEEE International Workshop on Design, Test and Applications
, 1998
"... Abstract- This paper presents a methodology for determining the average power consumption of sequential CMOS circuits based on a ‘high-level ’ FSM description. Starting from a exercised symbolic FSM description, a Monte Carlo simulation is used to estimate the average switching activity of all circu ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
Abstract- This paper presents a methodology for determining the average power consumption of sequential CMOS circuits based on a ‘high-level ’ FSM description. Starting from a exercised symbolic FSM description, a Monte Carlo simulation is used to estimate the average switching activity of all
Probabilistic Modeling of Dependencies During Switching Activity Analysis
, 1998
"... This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretical contribution, we extend the previous work done on switching activity estimation to explicitly account for complex spatiot ..."
Abstract
-
Cited by 34 (6 self)
- Add to MetaCart
This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretical contribution, we extend the previous work done on switching activity estimation to explicitly account for complex
Statistical estimation of the switching activity in digital circuits
- in 31 st ACM/IEEE Design Automation Conference
"... Abstract{Higher levels of integration have led to a generation of integrated circuits for which power dissipation and reliability are major design concerns. In CMOS circuits, both of these problems are directly related to the extent of circuit switching activity. The average number of transitions pe ..."
Abstract
-
Cited by 55 (12 self)
- Add to MetaCart
Abstract{Higher levels of integration have led to a generation of integrated circuits for which power dissipation and reliability are major design concerns. In CMOS circuits, both of these problems are directly related to the extent of circuit switching activity. The average number of transitions
Switching activity minimization in combinational logic design
- Proc. of 2004 International Conf. on Embedded Systems and Applications, 2004
"... Abstract: In this paper we focus on the reduction of switching activity in combinational logic circuits. An algorithmic approach using k-map has been proposed which modifies the normal optimal solution obtained from k-map to reduce its switching activity. More than 10 % reduction in switching activi ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract: In this paper we focus on the reduction of switching activity in combinational logic circuits. An algorithmic approach using k-map has been proposed which modifies the normal optimal solution obtained from k-map to reduce its switching activity. More than 10 % reduction in switching
LOOP SCHEDULING FOR MINIMIZING SCHEDULE LENGTH AND SWITCHING ACTIVITIES
"... Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activities for applications with loops. We show that to find a schedule that has the minimal switching activities among all minimu ..."
Abstract
- Add to MetaCart
Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activities for applications with loops. We show that to find a schedule that has the minimal switching activities among all
BDD Techniques to Reduce Switching Activity in Logic Circuits
"... This paper presents several techniques to synthesize logic circuits for low power based on split BDDs. The objective is to generate 2-input multiplexer circuits with reduced switching activity, since switching activity is an important contribution to power dissipation. Keywords--- switching activit ..."
Abstract
- Add to MetaCart
This paper presents several techniques to synthesize logic circuits for low power based on split BDDs. The objective is to generate 2-input multiplexer circuits with reduced switching activity, since switching activity is an important contribution to power dissipation. Keywords--- switching
Exploration of Switching Activity Behavior of Addition Algorithms
- ACCEPTED FOR PUBLICATION AT MWSCAS 2009
, 2009
"... Total energy consumption of a micro-architecture directly depends on the switching factors of the internal nodes. Weinberger and Ling are the most widely used binary addition algorithms that are used in microprocessor adders. In this paper, the switching activity behaviors of those well known additi ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
Total energy consumption of a micro-architecture directly depends on the switching factors of the internal nodes. Weinberger and Ling are the most widely used binary addition algorithms that are used in microprocessor adders. In this paper, the switching activity behaviors of those well known
Upper And Lower Bounds On Fsm Switching Activity
"... This paper obtains upper and lower bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven with typical input sequences. By exploiting the symmetries between the Hamming distances of state encodings, we obtain tight bounds on the average Hamming distance, ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
This paper obtains upper and lower bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven with typical input sequences. By exploiting the symmetries between the Hamming distances of state encodings, we obtain tight bounds on the average Hamming distance
Results 11 - 20
of
8,701