An Exclusion and Equivalence Algorithm for Reduction of Bus Transitions in Low Power VLSI

Padma Priya K*, Paradesi Rao D. V**
Periodicity:January - March'2008
DOI : https://doi.org/10.26634/jse.2.3.553

Abstract

The power consumption is one of the most important design criteria in on-chip bus design. In VLSI design using deep sub micron technology, the bus energy reduction has become more and more important. As technology is scaling down, the increased interconnect wire aspect ratio and the reduced spacing between the individual wires within the bus result in increased cross coupling capacitances. They also increase cross talk noise and power dissipation in the data buses. In addition there is also a self-capacitance introduced between two adjacent data lines. We have developed an encoding algorithm that reduces the coupling transitions (1 to 0 or 0 to 1 state transition) and also the self-transitions in the data buses to minimize the energy dissipation. The technique requires 2 extra bits for sending coding information regardless of the bit width of the bus and does not assume anything about the nature of the data.

Keywords

Coupling Transitions, Self Transitions, Odd Group Transitions, Even Group Transitions

How to Cite this Article?

Padma Priya K and Paradesi Rao D. V (2008). An Exclusion and Equivalence Algorithm for Reduction of Bus Transitions in Low Power VLSI. i-manager’s Journal on Software Engineering, 2(3),78-82. https://doi.org/10.26634/jse.2.3.553

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.