Sponsor
Portland State University. Department of Electrical and Computer Engineering
First Advisor
Marek Perkowski
Date of Publication
1-1-2010
Document Type
Dissertation
Degree Name
Doctor of Philosophy (Ph.D.) in Electrical and Computer Engineering
Department
Electrical and Computer Engineering
Language
English
Subjects
Quantum electronics, Quantum computers, Logic circuits
DOI
10.15760/etd.366
Physical Description
1 online resource (ix, 261 p.) : ill. (some col.)
Abstract
This dissertation is devoted to efficient automated logic synthesis of reversible circuits using various gate types and initial specifications. These Reversible circuits are of interest to several modern technologies, including Nanotechnology, Quantum computing, Quantum Dot Cellular Automata, Optical computing and low power adiabatic CMOS, but so far the most important practical application of reversible circuits is in quantum computing. Logic synthesis methodologies for reversible circuits are very different than those for classical CMOS or other technologies. The focus of this dissertation is on synthesis of reversible (permutative) binary circuits. It is not related to general unitary circuits that are used in quantum computing and which exhibit quantum mechanical phenomena such as superposition and entanglement. The interest in this dissertation is only in logic synthesis aspects and not in physical (technological) design aspects of reversible circuits. Permutative quantum circuits are important because they include the class of oracles and blocks that are parts of oracles, such as comparators or arithmetic blocks, counters of ones, etc. Every practical quantum algorithm, such as the Grover Algorithm, has many permutative circuits. These circuits are also used in Shor Algorithm (integer factorization), simulation of quantum systems, communication and many other quantum algorithms. Designing permutative circuits is therefore the major engineering task that must be solved to practically realize a quantum algorithm. The dissertation presents the theory that leads to MP (Multi-Path) algorithm, which is currently the top minimizer of reversible circuits with no ancilla bits. Comparison of MP with other 2 leading software tools is done. This software allows to minimize functions of more variables and with smaller quantum cost that other CAD tools. Other software developed in this dissertation allows to synthesize reversible circuits for functions with "don't cares" in their initial specifications. Theory to realize functions from relational representations is also given. Our yet other software tool allows to synthesize reversible circuits for new types of reversible logic, for which no algorithm was ever created, using the so-called "pseudo-reversible" gates called Y-switches.
Rights
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Persistent Identifier
http://archives.pdx.edu/ds/psu/6826
Recommended Citation
Alhagi, Nouraddin, "Synthesis of Reversible Functions Using Various Gate Libraries and Design Specifications" (2010). Dissertations and Theses. Paper 366.
https://doi.org/10.15760/etd.366
Comments
Portland State University. Dept. of Electrical and Computer Engineering