Dissertation/Thesis Abstract

Computer Aided Design of Permutation, Linear, and Affine-Linear Reversible Circuits in the General and Linear Nearest-Neighbor Models
by Schaeffer, Ben, M.S., Portland State University, 2013, 163; 1541050
Abstract (Summary)

With the probable end of Moore's Law in the near future, and with advances in nanotechnology, new forms of computing are likely to become available. Reversible computing is one of these possible future technologies, and it employs reversible circuits. Reversible circuits in a classical form have the potential for lower power consumption than existing technology, and in a quantum form permit new types of encryption and computation.

One fundamental challenge in synthesizing the most general type of reversible circuit is that the storage space for fully specifying input-output descriptions becomes exponentially large as the number of inputs increases linearly. Certain restricted classes of reversible circuits, namely affine-linear, linear, and permutation circuits, have much more compact representations. The synthesis methods which operate on these restricted classes of reversible circuits are capable of synthesizing circuits with hundreds of inputs. In this thesis new types of synthesis methods are introduced for affine-linear, linear, and permutation circuits, as well as a synthesizable HDL design for a scalable, systolic processor for linear reversible circuit synthesis.

Indexing (document details)
Advisor: Perkowski, Marek
Commitee: Hall, Douglas, Song, Xiaoyu
School: Portland State University
Department: Electrical and Computer Engineering
School Location: United States -- Oregon
Source: MAI 52/01M(E), Masters Abstracts International
Subjects: Electrical engineering
Keywords: Circuit, Computing, Linear, Quantum, Reversible, Synthesis
Publication Number: 1541050
ISBN: 978-1-303-22973-2
Copyright © 2020 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy