{'fraction_non_alphanumeric': 0.016605166051660517, 'fraction_numerical': 0.0, 'mean_word_length': 5.06145251396648, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
FSM decomposition for power gating design automation in sequential circuits

Power gating is one of the most effective techniques for low power design because it reduces both dynamic and static power simultaneously. This paper proposes a circuit architecture to implement power gating in sequential circuits based on finite state machine (FSM) decomposition, which is implemented by partition the state transition graph (STG). The FSM is partitioned into two or more sub-machines, only one of which is active most of the time, and the power supply of other sub-machines can be cut off to save energy. Since adjustment of supply voltage may not finish instantly, the voltage of the submachine that will be activated need to be raised ahead of time, which makes the problem complicated. We propose a simulated annealing algorithm to perform the decomposition without timing penalty. Experimental results have shown the effectiveness of our approach, and it is expected that power gating will show superior power saving to clock gating due to the increasing significance of static power.