2026-09-19T03:24:12.052818400Zhttps://opus.uleth.ca/server/oai/request

oai:opus.uleth.ca:10133/37292015-11-04T22:56:41Zcom_10133_3346com_10133_1com_10133_296col_10133_3347col_10133_298

Rice, Jacqueline E. Law, Jayati J. University of Lethbridge. Faculty of Arts and Science 2015-08-27T21:45:54Z 2015-08-27T21:45:54Z 2015 https://hdl.handle.net/10133/3729 Reversible computing has been theoretically shown to be an efficient approach over conventional computing due to the property of virtually zero power dissipation. A major concern in reversible circuits is the number of circuit lines or qubits which are a limited resource. In this thesis we explore the line reduction problem using a decision diagram based synthesis approach and introduce a line reduction algorithm— Minimization of lines using Ordered Kronecker Functional Decision Diagrams (MOKFDD). The algorithm uses a new sub-circuit for a positive Davio node structure in addition to the existing node structures. We also present a shared node ordering for OKFDDs. OKFDDs are a combination of OBDDs and OFDDs. The experimental results shows that the number of circuit lines and quantum cost can be reduced with our proposed approach. NSERC en_CA Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science Arts and Science Department of Mathematics and Computer Science Thesis (University of Lethbridge. Faculty of Arts and Science) Ordered Kronecker Functional Decision Diagrams OKFDDs reversible logic Boolean function logic synthesis line reduction Minimization of lines in reversible circuits Thesis Masters 0984 0544 Yes No open.access