Uni-Distance Encoding scheme for reduction of Bus Transition Activity

Samta Gajbhiye*, Kamal K Mehta**, Sharma H.R***
*Sr. Lecturer, (CSE) at Shri Shankaracharya College of Engineering & Technology, Bhilai
**Assistant Professor & HoD (CSE) Shri Shankaracharya College of Engg & Tech BHILAI (C.G.).
*** Professor & HoD (CSE) Shri Chatrapathi Sivaji College of Engg & Tech Durg(C.G.).
Periodicity:April - June'2007
DOI : https://doi.org/10.26634/jse.1.4.754

Abstract

Consumption of power has become an important issue for modern COMPUTING systems [1]. Research result shows that off chip busses consumes considerable amount of power.  Researchers suggested that one effective way to reduce power consumption is to reduce bus activities [2]. Power dissipation in CMOS circuits during inactive periods (static power) has become a significant part of the total power dissipation. Transition on high capacitance busses in VLSI systems results in considerable dissipation. Various coding schemes have been proposed in literature to encode data in order to reduce the number of bus transition [3][4][5]. Few method gives tremendous result 50% reduction in I/O average power dissipation and 25% reduction in I/O average power dissipation. In this paper we derived a new coding method, which leads to extremely easy practical way, which reduces number of bus transition. In this proposed scheme all bits of communication system is considered at once, and there is no need to divide bus systems into segments. Simulation result of proposed scheme shows that our concept reduces transition activities by 24.

Keywords

Uni distance codes, Low power dissipation, bus transition, CMOS, VLSI

How to Cite this Article?

Samta Gajbhiye, Kamal K Mehta and Sharma H.R (2007). Uni-Distance Encoding scheme for reduction of Bus Transition Activity. i-manager’s Journal on Software Engineering, 1(4), 70-74. https://doi.org/10.26634/jse.1.4.754

References

[I ]. Najm F.N. "A survey of power esfimafion fechniques in VLSI circuits, . IEEE Trans. I 994, VLSI-2(4), pp 446-455.
[2]. Y. Zhang, J. Yang and R. Gupta, "Frequenf Value Locality and value cenfric Dafa Cache Design" , The ninfh Infernafional Conference on Archifecfural Support for Programming Languages and Operafing sysfems (ASPLOS IX), Pages I 50- I 59, 2000~
[3]. M.R. Sfan and WP Burleson, "Bus invert coding for low power I/O IEEE Transaction on very Large Scalelnfegrafion (VLSI) sysfems, pages 49-58, Vol.3 1 995 .
[4]. Dinesh C Suresh, Jun Yang, Chuanjun Zhang, Banif Agrawal, Walid Najjar "FV-MSB: A scheme for reducing Transition Acfivify on Dafa Busses", Inf. Conf on high performance compufing Dec. 2003 Hyderabad India.
[5]. Youngsoo Shin, Soo-Ik Chao & Kiyoung Choi "Reducfion of bus fransifion wifh partial Bus-Invert coding" .
[6]. N. Wesfe & K. Eshraghian, "Principles of CMOS VLSI Design, A Sysfems Perspecfive, Reading" MA: Addison Wesley Publishing Company, I 998 .
[7]. Hoppe B Neuendorf G & Schmiff Land!edel D "Opfimizafion of high speed CMOS logic circuits wifh analytical models for signal delay, chip area & dynamic power dissipafion", IEEE fransacfion I 990 CAD-9(3) pp. 236-247.
[8]. Hedensfern A.N. & Jeppson K.O. "CMOS circuif speed and buffer opfimizafion" , IEEE Tran. I 987 CAD-6 (2) pp. 270-281 .
[9]. AL-Khalil! A.J. Zhu Y & AL-Khalil! D: "A modular generafor optimized CMOS buffers", IEEE Transaction I 990 CAD-9 C I O) pp I 028- I 046
[I O]. Vijay Sundarajan Keshab K Parfhi "Reducing bus fransifion acfivify bylimifed weighf coding wifh code word slimming " J, Van Zanfen.
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.