Thumbnail
Access Restriction
Subscribed

Author Deb, Arighna ♦ Das, Debesh K. ♦ Rahaman, Hafizur ♦ Wille, Robert ♦ Drechsler, Rolf ♦ Bhattacharya, Bhargab B.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2016
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Synthesis ♦ Quantum logic ♦ Reversible logic ♦ Symmetric function ♦ Testing
Abstract In this article, we introduce a novel method of synthesizing symmetric Boolean functions with reversible logic gates. In contrast to earlier approaches, the proposed technique deploys a simple, regular, and cascaded structure consisting of an array of Peres and CNOT gates, which results in significant reduction with respect to the quantum cost. However, the number of circuit inputs may increase slightly when such cascades are used. In order to reduce their number, we next propose a postsynthesis optimization phase that allows judicious reuse of circuit lines. In addition to offering a cost-effective synthesis methodology, the proposed reversible logic structure supports elegant testability properties. With respect to all single or partial missing gate faults (SMGFs and PMGFs), or repeated gate faults (RGFs) in such an $\textit{n}-input$ circuit module, we show that it admits a universal test set of constant cardinality (=3) for any value of $\textit{n}.$ Thus, considering both the cost and testability issues, this approach provides a superior option for synthesizing symmetric functions compared to existing designs.
ISSN 15504832
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2016-06-01
Publisher Place New York
e-ISSN 15504840
Journal ACM Journal on Emerging Technologies in Computing Systems (JETC)
Volume Number 12
Issue Number 4
Page Count 29
Starting Page 1
Ending Page 29


Open content in new tab

   Open content in new tab
Source: ACM Digital Library