Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/14261
Title: | Dynamic Power Optimization of 1-Bit CMOS Full Adder Using Genetic Algorithm |
Authors: | SINGH, MEHARBAN |
Keywords: | VLSI CIRCUITS |
Issue Date: | 11-Jul-2013 |
Series/Report no.: | TD-1164; |
Abstract: | With every passing day, integrated circuits are gaining importance, the size of components is reducing and the number of elements that can be fabricated on a single chip has increased many folds in the past decade. With the ongoing globalization and technology the power requirements of mankind are rising at an extremely high rate. Here we are making an attempt to optimize the power consumed by VLSI circuits. The circuit under consideration is a simple full adder implemented using CMOS technology. The circuit utilizes 28 transistors and runs on a high frequency in the range of MHz. The circuit has three inputs (A,B & C) and two outputs(Sum and Carry) We have implemented Genetic algorithm to solve the given problem. The thesis is mainly divided in to two portions. In the first half we try to find out the maximum and minimum acceptable values and other constraints on which power depends. We utilized the Cadence, Virtuso- 4 software to manually find these values. In the second half the values obtained in previous step are utilized to create the initial population. We define the fitness function and other necessary parameters. MATLAB applies the genetic algorithm and finds us an optimum solution. Since Genetic algorithm is heuristic in nature it might not give us the ideal result but surely the outputs are reasonably good. |
URI: | http://dspace.dtu.ac.in:8080/jspui/handle/repository/14261 |
Appears in Collections: | M.E./M.Tech. Electronics & Communication Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1_a_Front_Meharban.docx | 130.8 kB | Microsoft Word XML | View/Open | |
1_a_Meharban Thesis_Power_Optimization.docx | 1.68 MB | Microsoft Word XML | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.