{'fraction_non_alphanumeric': 0.01006036217303823, 'fraction_numerical': 0.0, 'mean_word_length': 5.2974683544303796, '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}}
Activity-driven Register Assignment for Low Power Design

Power consumption in a set of registers is a function of switching activity at the inputs of these registers which is in turn affected by the sharing of registers among compatible data values. Data streams that are input to a circuit have probability distributions. Based on the assumption that the joint probability density function of the primary input variables is known or that a sufficiently large number of input vectors has been given so that this information can be derived, the register assignment problem for minimum power consumption is formulated as a minimum cost clique covering of an appropriately defined compatibility graph (which is shown to be transitively orientable). The problem is then solved optimally using a max-cost flow algorithm. Experimental results confirm the effectiveness of the proposed approach in minimizing power consumption during the register assignment phase of the behavioral synthesis process.