Emerging reconfigurable nanotechnologies allow the implementation of self-dual functions with a fewer number of transistors as compared to traditional CMOS technologies. To achieve better area results for Reconfigurable Field-Effect Transistors (RFET)-based circuits, a large portion of a logic representation must be mapped to self-dual logic gates. This, in turn, depends upon how self-duality is preserved in the logic representation during logic optimization and technology mapping. In the present work, we develop Boolean size-optimization methods– a rewriting and a resubstitution algorithms using Xor-Majority Graphs(XMGs) as a logic representation aiming at better preserving self-duality during logic optimization. XMGs are more compact for ...
Self-timed logic design methods are developed using Threshold Combinational Reduction (TCR) within t...
Traditional logic synthesis faces challenges of meeting the requirements demanded by the many emergi...
Complementary symmetry (CS) Boolean logic utilizes both p- and n-type field-effect transistors (FETs...
Majority-inverter graphs (MIGs) are a logic representation with remarkable algebraic and Boolean pro...
Majority-inverter graphs (MIGs) are a multi-level logic representation of Boolean functions with rem...
Although contemporary logic synthesis performs well on random logic, it may produce subpar results i...
Abstract—We present a novel class of decision diagrams, called Bicon-ditional Binary Decision Diagra...
Based on explicit numerical constructions for Kolmogorov’s superpositions (KS) linear size circuits ...
Typical operators for the decomposition of Boolean functions in state-of-the-art algorithms are AND,...
In this paper we propose a novel and efficient method for majority gate-based design. The basic Bool...
Typical operators for the decomposition of Boolean functions in state-of-the-art algorithms are AND,...
Self-timed logic design methods are developed using Threshold Combinational Reduction (TCR) within t...
In this thesis, new algorithms for logic synthesis areexplored. Our work is motivated by two observa...
Natural computers exploit the emergent properties and massive parallelism of interconnected networks...
The end of Moore's law for CMOS technology has prompted the search for low-power computing alternati...
Self-timed logic design methods are developed using Threshold Combinational Reduction (TCR) within t...
Traditional logic synthesis faces challenges of meeting the requirements demanded by the many emergi...
Complementary symmetry (CS) Boolean logic utilizes both p- and n-type field-effect transistors (FETs...
Majority-inverter graphs (MIGs) are a logic representation with remarkable algebraic and Boolean pro...
Majority-inverter graphs (MIGs) are a multi-level logic representation of Boolean functions with rem...
Although contemporary logic synthesis performs well on random logic, it may produce subpar results i...
Abstract—We present a novel class of decision diagrams, called Bicon-ditional Binary Decision Diagra...
Based on explicit numerical constructions for Kolmogorov’s superpositions (KS) linear size circuits ...
Typical operators for the decomposition of Boolean functions in state-of-the-art algorithms are AND,...
In this paper we propose a novel and efficient method for majority gate-based design. The basic Bool...
Typical operators for the decomposition of Boolean functions in state-of-the-art algorithms are AND,...
Self-timed logic design methods are developed using Threshold Combinational Reduction (TCR) within t...
In this thesis, new algorithms for logic synthesis areexplored. Our work is motivated by two observa...
Natural computers exploit the emergent properties and massive parallelism of interconnected networks...
The end of Moore's law for CMOS technology has prompted the search for low-power computing alternati...
Self-timed logic design methods are developed using Threshold Combinational Reduction (TCR) within t...
Traditional logic synthesis faces challenges of meeting the requirements demanded by the many emergi...
Complementary symmetry (CS) Boolean logic utilizes both p- and n-type field-effect transistors (FETs...