{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/3729"},"canonical_url":"https://search.dev.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/3729","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"Minimization of lines in reversible circuits","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Law, Jayati J.","University of Lethbridge. Faculty of Arts and Science"],"institution":"Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Rice, Jacqueline E."],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015","date_published":"2015","updated_at":"2026-08-21T16:45:58Z","subjects":["Ordered Kronecker Functional Decision Diagrams","OKFDDs","reversible logic","Boolean function","logic synthesis","line reduction"],"languages":["en_CA"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:10133/3729"],"render_values":[{"text":"hdl:10133/3729","href":null,"code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/10133/3729","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"source_record":{"url":"https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F3729","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Rice, Jacqueline E."]},{"key":"dc:creator","label":"Author","values":["Law, Jayati J.","University of Lethbridge. Faculty of Arts and Science"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-08-27T21:45:54Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-08-27T21:45:54Z"]},{"key":"dc:date.issued","label":"Date","values":["2015"]},{"key":"dc:publisher","label":"Institution","values":["Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics and Computer Science"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Ordered Kronecker Functional Decision Diagrams","OKFDDs","reversible logic","Boolean function","logic synthesis","line reduction"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_CA"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:10133/3729"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10133/3729"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.other","label":"Dc Description Other","values":["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."]},{"key":"dc:title","label":"Title","values":["Minimization of lines in reversible circuits"]}]}],"canonical_facts":{"dc:contributor.supervisor":["Rice, Jacqueline E."],"dc:creator":["Law, Jayati J.","University of Lethbridge. Faculty of Arts and Science"],"dc:date.accessioned":["2015-08-27T21:45:54Z"],"dc:date.available":["2015-08-27T21:45:54Z"],"dc:date.issued":["2015"],"dc:description.abstract":["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."],"dc:description.other":["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."],"dc:identifier":["hdl:10133/3729"],"dc:identifier.uri":["https://hdl.handle.net/10133/3729"],"dc:language.iso":["en_CA"],"dc:publisher":["Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science"],"dc:publisher.department":["Department of Mathematics and Computer Science"],"dc:subject":["Ordered Kronecker Functional Decision Diagrams","OKFDDs","reversible logic","Boolean function","logic synthesis","line reduction"],"dc:title":["Minimization of lines in reversible circuits"],"dc:type":["Thesis"]},"updated_at":"2026-08-21T16:45:58Z"}