Compare the Performance of Heuristic Algorithms GA, IPO and PSO for Optimal Design of the LEVEL SHIFTER Circuit

Message:
Abstract:
The powerfulness and effectiveness of the optimization methods are motivations of the researchers to use them in complex engineering problems. In this paper, the performance of the three optimization algorithms based on swarm intelligence ( IPO, PSO) and evolutionary technique (GA) for calculation the channel's widths of the transistors were evaluated compared with each others. The fitness functions are defined in order to the better integration and to improve the power consumption and delay of Level Shifter circuit (LS) with changing the voltage level of 0.4 to 3 volts using 0.35-um CMOS technology .Simulation results for the sample circuit show that it reach a power consumption of 0.222pW and a delay value of 9.113ns with PSO algorithm, a power consumption of 0.39 nW and delay value of 3.741 ns with IPO algorithm, and values of 0.235 nW and 3.711 ns whit GA algorithm. In addition to a dramatic improvement in power and delay, minimum of channel's widths also were obtained. All implementations of paper were performed in MATLAB and HSPICE.
Language:
Persian
Published:
Journal of Soft Computing and Information Technology, Volume:5 Issue: 2, 2016
Pages:
40 to 50
magiran.com/p1718056  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!