Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/2696
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorMazumdar, Bodhisatwa-
dc.contributor.advisorHubballi, Neminath-
dc.contributor.authorAalam, Umar-
dc.date.accessioned2021-01-11T15:47:15Z-
dc.date.available2021-01-11T15:47:15Z-
dc.date.issued2020-10-14-
dc.identifier.urihttps://dspace.iiti.ac.in/handle/123456789/2696-
dc.description.abstractOn account of their simplicity, homogeneous logic representations have drawn attention in the domain of logic synthesis. In such representations, combinational circuits are often modeled as Directed Acyclic Graph (DAG) wherein terminal nodes represent primary inputs and other nodes represent same Boolean logic operation. The edges in DAGs can be complemented where the nodes have a complemented output, which renders a functionally universal representation. Such homogeneous logic representations simplify optimization algorithms significantly, hence, assist in e⇥cient implementation. This thesis performs an analysis into the inversion optimization of a homogeneous logic representation, referred to as majority inverter graph (MIG) using minority operations. MIG is a logic representation structure that along with its algebraic properties and Boolean transformation methods synthesizes circuits with significant optimization in terms of size, depth, and switching activity. In this work, we first propose rules and properties for logic representations with minority and inversion operations referred to as mIG logic synthesis. Subsequently, we propose synthesis techniques based on minority, majority, and inversion operations, referred to as mMIG synthesis. We propose an algorithm based on the rules and properties to achieve an optimization in terms of area reduction and inversion reduction in mMIG-based circuit synthesis. We present comparison of resource consumption in mMIG logic synthesis with existing MIG synthesis techniques, and present some important observations towards inverter optimization. These propsed methods have been tested on various standard benchmark circuits, such as EPFL benchmark suites, ISCAS’85 and also on lightweight cryptographic block ciphers and cryptoprimitives. Analysis of the implementation results demonstrates that the proposed mMIG structure outperforms the existing MIG structure mainly in term of reduction in inversion count which can have major impact in emerging technologies such as quantum dot cellular automata (QCA) and spin wave devices (SWDs), and inversion intensive circuits such as RAM address-decoding circuits. Keywords: Minority logic, Inversion, Boolean algebra, Majority logic, Inversion Optimizationen_US
dc.language.isoenen_US
dc.publisherDepartment of Computer Science and Engineering, IIT Indoreen_US
dc.relation.ispartofseriesMSR003-
dc.subjectComputer Science and Engineeringen_US
dc.titleInversion optimization in majority inverter graph with minority operations : A novel approachen_US
dc.typeThesis_MS Researchen_US
Appears in Collections:Department of Computer Science and Engineering_ETD

Files in This Item:
File Description SizeFormat 
MSR003_Umar_Aalam_1804101007.pdf4.59 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: