Title :
Theoretical analysis of bus-invert coding
Author_Institution :
Dept. of Comput. Eng. & Sci., Yuan Ze Univ., Taiwan, Taiwan
Abstract :
The closed-form formulas derived from the Markov chains depicting the bus-invert coding processes for even and odd bus widths are employed to compute switching activity and weight per bus transfer, to explain the diminishing returns with increasing bus width and to show the nonviability of partitioning a bus into smaller buses of odd number bits, etc. Probing into the codewords generated by the coding process, we obtain the same closed-form formulas as that obtained by the Markov-based approach. Our contributions form a superset over the previously published theoretical results and provide comprehensive background information for exploiting the bus-invert method for low-power applications.
Keywords :
Markov processes; VLSI; digital integrated circuits; encoding; low-power electronics; probability; switching circuits; switching theory; Markov chains; VLSI; bus partitioning; bus-invert coding processes; closed-form formulas; even bus widths; low-power applications; odd bus widths; switching activity; weight per bus transfer; Application software; Capacitance; Costs; Councils; Energy consumption; Power system interconnection; Resistors; Time to market; Very large scale integration; Voltage;
Journal_Title :
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
DOI :
10.1109/TVLSI.2002.808456