A Novel Evolutionary Method for Designing Optimized Multifunctional Logic Modules
Publish place: 7th Sympozium on Advances in Sience & Technology
Publish Year: 1391
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,192
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
SASTECH07_125
تاریخ نمایه سازی: 30 تیر 1392
Abstract:
In this paper, we proposed a novel heuristic method based on Imperialist competitive Algorithm (ICA) to design logic modules which performing different arithmetic functions. In conventional methods, for designing multi functional circuit, for each specific function, a distinct circuit is designed and then all of them will be combined together with multiplexer(s) to have desired circuit but in our proposed method the whole structure of circuit is designed and then optimized in one procedure by ICA Algorithm. We tried to optimize the area of circuit by reducing the number of transistors forming logic gates. To show the validity of this method, we design two circuits, first a full adder-subtractor circuit with a control bit and second a multi-function circuit which performs addition, subtraction, multiplication and comparison operation at the same time. Simulation was done in MATLAB 2009 and results shows that our method significantly reduces the number of transistors and gates and accordingly the area of circuits. Using such circuits in Arithmetic logic unit (ALU) of Central Processing Unit (CPU) can reduce the surface and power consumption of IC.
Keywords:
Authors
Mehdi Anjomshoa
South Pars Gas Complex
Ali Mahani
University of Kerman
Shahin Bahonar
University of Kerman
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :