A New Low Power-Delay-Product, Low-area, Parallel Prefix Adder With Reduction of Graph Energy

سال انتشار: 1390
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 1,400

فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

ICEE19_323

تاریخ نمایه سازی: 14 مرداد 1391

چکیده مقاله:

In this paper the graph energy and electrical power consumption of various parallel prefix adders (PPA) are measured and investigated. By comparison the graph energy of PPAs with their power consumption, a linear relation between them is considered. Moreover, the measurements represent direct relation between arcs number and graph energy in PPA structures. Using these results a new PPA (proposed І) is introduced that it is achieved from Sklansky adder with reduction of graph energy and limiting the recursive stages to maximum 8 steps. A new standard, product of arc numbers and logic depth, is applied to compare the performance of proposed adder І with other PPAs. In addition using even and odd cells in proposed adder І resulted in proposed adder ІІ. All the simulations are done with Hspice and CMOS technology 180nm. Simulation results represent that power-delay-product of our 32-bit proposed adder І and ІІ come with about 17% and 35% improvement compared with Sklansky adder, respectively.

نویسندگان

M. Moghaddam

Dept. of Electrical Engineering Shahed University Tehran – IRAN

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • N. H.E. West, D.Harri. _ CMOS VLSI design, " 3" ...
  • P. Kogge , H. Stone , "A parallel algorithm for ...
  • R. P. Brent and , T. Kung, _ regular layout ...
  • Y. Sun, D. Zheng, M.Zhang, and S.Li, "High Performance Low-Power ...
  • R .Zimmermann, Binary Adder Architectures for Cell-Based VLSI and their ...
  • S.Knowles, "A Family of Adders, " IEEE Computer Society, _ ...
  • P.Ramanathan and P.T.Vanathi, _ Power Delay Optimized 32- bit ParallelPrefix ...
  • K.Vitoroulis, A.J.Al-Khalili, "Performance of Parallel Prefix Adders implemented with technology, ...
  • D. Patil, O. Azizi, M. Horowitz, R.Ho and R .Ananthraman, ...
  • J. Liu, Y.Zhu, H.Zhu. Ch-K.Cheng and J.Lillis, "Optimum Prefix Adders ...
  • R.Bapat and S. Pati, "Energy of a graph is never ...
  • R.A. Brualdi, "Energy of a Graph, "AIM Workshop , October ...
  • I.Gutman, E.Gudino, D.Quiroz, "Upper bound for the energy of graphs ...
  • 765 200.875 26.165 268.130 223.364 175.164 ...
  • 51 160.70 246.94 291.44 194.23 ...
  • نمایش کامل مراجع