کد مقاله کد نشریه سال انتشار مقاله انگلیسی ترجمه فارسی نسخه تمام متن
4970607 1365329 2018 14 صفحه PDF ندارد دانلود کنید
عنوان انگلیسی مقاله
Optimum transistor sizing of CMOS logic circuits using logical effort theory and evolutionary algorithms
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر سخت افزارها و معماری
پیش نمایش صفحه اول مقاله
Optimum transistor sizing of CMOS logic circuits using logical effort theory and evolutionary algorithms
چکیده انگلیسی

•The paper introduces an automated approach for determining optimum transistor sizes of CMOS logic circuits for target specifications or minimum power-delay-area product (PDAP).•The proposed methodology is a hybrid approach which utilizes logical effort theory and recently proposed evolutionary algorithms viz. Interior Search Algorithm (ISA) and Gravitational Search Algorithm (GSA) for the optimization process.•In the proposed methodology, logical effort (LE) theory addresses the dual purpose of estimating the minimum delay and upper bound on transistor sizes early in the design cycle. The subsequent stage of optimization minimizes power dissipation and area based on the constraints obtained from LE theory and utilizing evolutionary algorithms.•MATLAB-EldoSPICE (Mentor Graphics) interface has been developed using Tool Command Language (Tcl) for keeping the values of power dissipation and area using SPICE simulations in the optimization loop for each iteration.•Standard combinational and sequential circuits (benchmark Transmission Gate Flip-flop) have been used for comparison of the proposed methodology with the conventional LE based approach and upto 35.1% and 63.8% reduction has been obtained in power-delay product (PDP) and PDAP respectively.•PVT analysis and Monte Carlo simulations for optimized set of widths have been included to validate the effectiveness of the proposed methodology.

Most existing methodologies use either Logical Effort (LE) theory or stand-alone optimization algorithms for automated transistor sizing of CMOS logic circuits. LE theory optimizes a logic circuit only with respect to speed while it completely ignores power and area. Whereas heuristic algorithms when used as a stand-alone approach for optimization lead to huge computational effort since there is no predefined technique to apply constraints on transistor sizes in order to limit the design space for target specifications. The problem has been resolved in this paper by utilizing delay sensitivity factor based on LE theory proposed by Alioto et. al. [1] for estimating the highest operating speed of a logic circuit and determining the upper bound on the size of transistors. Recently proposed heuristic algorithms viz. Interior Search Algorithm (ISA) [2] and Gravitational Search Algorithm (GSA) [3] have been utilized further to converge towards minimum power-delay-area product (PDAP). Simulation results for various test circuits indicate upto 35.1% and 63.8% improvement in power-delay product (PDP) and PDAP respectively in 130 nm/1.2 V TSMC CMOS technology. PVT analysis and Monte Carlo simulations have been used to further validate the effectiveness of the proposed methodology.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Integration, the VLSI Journal - Volume 60, January 2018, Pages 25-38
نویسندگان
, , , , , , ,