Loading...
Search for:
reversible-computing
0.01 seconds
Function simulation, graph grammars and colourings
, Article International Journal of Computer Mathematics ; 2013 ; 00207160 (ISSN) ; Rahimi, A ; Taati, S ; Sharif University of Technology
Abstract
We prove that to any partial function φ{symbol} defined on a finite set, there corresponds an infinite class of graphs that could be generated by a graph grammar such that each graph in the class represents the function in the sense that evaluation of the function at any point x of its domain can be simulated by finding the unique extension of a partial vertex colouring of the graph specified by x. We show that in the proposed setup, generating such simulator graphs as well as finding the colouring extensions can be computed effectively in polynomial time. We also discuss some applications of this scenario in producing instances of the graph colouring problem near its phase transition that...
Evaluating and Improving the Reliability of Reversible Adiabatic Logic Styles
, M.Sc. Thesis Sharif University of Technology ; Ejlali, Alireza (Supervisor)
Abstract
Adiabatic logic families are a group of logic circuits which operate based on adiabatic principles to tremendously reduce power consumption. These families have basic difference with common logic families in transistor level structure and there signals are not quadrangular but trapezoidal. Also, in these systems the source lines and clock pulse are the same. Research on Adiabatic families needs theoretical information in reversible computing. So we will start this project with explaining fundamental information in this field. After that some of these logic families are introduced and three important and widely used of them (SCRL-RERL-2LAL) are chosen to simulate. In each of these families...