|
Volumn 8, Issue 3, 2000, Pages 335-339
|
Theoretical bounds for switching activity analysis in finite-state machines
a a b |
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
ELECTRIC NETWORK TOPOLOGY;
ELECTRIC POWER SUPPLIES TO APPARATUS;
MARKOV PROCESSES;
PROBABILITY;
SWITCHING THEORY;
THEOREM PROVING;
FINITE STATE MACHINE;
HAMMING DISTANCE;
STATE ASSIGNMENT ALGORITHM;
STATE ENCODING;
SWITCHING ACTIVITY ANALYSIS;
INTEGRATED CIRCUIT MANUFACTURE;
|
EID: 0033692171
PISSN: 10638210
EISSN: None
Source Type: Journal
DOI: 10.1109/92.845899 Document Type: Article |
Times cited : (9)
|
References (14)
|