Minimization of lines in reversible circuits

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.

Grantor dc:publisher

Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science

Year dc:date.issued

2015

Authors dc:creator

• Law, Jayati J.
• University of Lethbridge. Faculty of Arts and Science

Advisor dc:contributor.supervisor

• Rice, Jacqueline E.

• Ordered Kronecker Functional Decision Diagrams
• OKFDDs
• reversible logic
• Boolean function
• logic synthesis
• line reduction

Language dc:language.iso

en_CA

Identifier

hdl:10133/3729

OAI record oai:identifier

https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F3729