{'fraction_non_alphanumeric': 0.01767015706806283, 'fraction_numerical': 0.0, 'mean_word_length': 5.215447154471545, '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}}
A theoretical approach to estimation of bounds on power consumption in digital multipliers

This paper presents a systematic theoretical approach for the analysis of bounds on power consumption in digital multipliers. This is because in many applications the maximum value of power consumption and not just the average power may be of importance to the designer. The maximum values can be used to predict the maximum battery life in portable applications and also determine the nature of heat sinks in nonportable applications. The proposed approach involves the development of state transition diagrams (stds) for the subcircuits making up the digital multipliers. The std is comprised of states and edges, with the edges representing a transition (switching activity) from one state to another in the subcircuit. Then, maximum (minimum) energy values associated with the edges constituting the stds are used to derive the upper (lower) bound. The multipliers analyzed in this paper include the Baugh Wooley multiplier, the binary tree multiplier, and the Wallace tree multiplier. The analysis is performed for both nonpipelined and p-bit-level pipelined multipliers. It is theoretically shown that there is a significant reduction in upper bound as p is decreased, with the lower bound being unaffected by the level of bit-pipelining. Experimental results are presented to show that the average power consumption values indeed lie within the predicted theoretical bounds, and that the theoretical upper bounds are quite tight.