By Topic

Theoretical analysis of bus-invert coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Rung-Bin Lin ; Dept. of Comput. Eng. & Sci., Yuan Ze Univ., Taiwan, Taiwan

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.

Published in:

Very Large Scale Integration (VLSI) Systems, IEEE Transactions on  (Volume:10 ,  Issue: 6 )