Arighna Deb
Robert Wille
Rolf Drechsler
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 n-input circuit module, we show that it admits a universal test set of constant cardinality (=3) for any value of n. Thus, considering both the cost and testability issues, this approach provides a superior option for synthesizing symmetric functions compared to existing designs.
- A. Barenco, C. Bennett, R. Cleve, D. DiVinchenzo, M. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter. 1995. Elementary gates for quantum computation. Physical Review A 52, 5, 3457--3467.Google Scholar
Cross Ref
- R. Cuykendall and D. R. Andersen. 1987. Reversible optical computing circuits. Optical Letters 12, 7, 542--544.Google ScholarCross Ref
- K. Datta, G. Rathi, I. Sengupta, and H. Rahaman. 2014. An improved reversible circuit synthesis approach using clustering of ESOP cubes. Journal on Emerging Technologies in Computing Systems 11, 2, 15:1--15:16. Google ScholarDigital Library
- A. Deb, D. K. Das, H. Rahaman, and B. B. Bhattacharya. 2013a. Reversible synthesis of symmetric Boolean functions based on unate decomposition. In Proceedings of ACM International Conference on Great Lake Symposium. 351--352. Google ScholarDigital Library
- A. Deb, D. K. Das, H. Rahaman, B. B. Bhattacharya, R. Wille, and R. Drechsler. 2013b. Reversible circuit synthesis of symmetric functions using a simple regular structure. In Reversible Computation. Lecture Notes in Computer Science, Vol. 7948. 182--195. Google ScholarDigital Library
- B. Desoete and A. De Vos. 2002. A reversible carry-look-ahead adder using control gates. Integration, the VLSI Journal 33, 1--2, 89--104. Google ScholarDigital Library
- S. Ghosh, B. B. Bhattacharya, and S. Sensarma. 2009. Reversible synthesis of symmetric functions: A hierarchical approach. In Proceedings of the Reed Muller Workshop. 53--62.Google Scholar
- J. P. Hayes, I. Polian, and B. Becker. 2004. Testing for missing-gate faults in reversible circuits. In Asian Test Symposium 100--105. Google ScholarDigital Library
- O. Keren, I. Levin, and S. R. Stankovic. 2007. Use of gray decoding for implementation of symmetric functions. In International Conference on VLSI. 25--30.Google Scholar
- E. Knill, R. Laflamme, and G. J. Milburn. 2001. A scheme for efficient quantum computation with linear optics. Nature 46--52.Google Scholar
- C. Lauradoux and M. Videau. 2008. Matriochka symmetric Boolean functions. In IEEE ISIT. 1631--1635.Google Scholar
- D. Maslov. 2006. Efficient reversible and quantum implementations of symmetric Boolean functions. IEEE Proceedings of Circuits, Devices and Systems 153, 5, 467--472.Google ScholarCross Ref
- R. C. Merkle. 1993. Reversible electronic logic using switches. Nanotechnology 4, 21--40.Google ScholarCross Ref
- C. Moraga and F. Z. Hadjam. 2012. On double gates for reversible computing circuits. In Proceedings of the International Workshop on Boolean Problems.Google Scholar
- N. M. Nayeem and J. E Rice. 2011. A shared-cube approach to ESOP-based synthesis of reversible logic. Facta Universitatis-Series: Electronics and Energetics 24, 3, 385--402.Google ScholarCross Ref
- M. Nielsen and I. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press, New York, NY. Google ScholarDigital Library
- M. Perkowski, P. Kerntopf, A. Buller, M. Chrzanowska-Jeske, A. Mishchenko, X. Song, A. Al-Rabadi, L. Jozwiak, A. Coppola, and B. Massey. 2001b. Regular realization of symmetric functions using reversible logic. In EUROMICRO Symposium on Digital Systems Design. 245--252. Google ScholarDigital Library
- M. Perkowski, P. Kerntopf, A. Buller, M. Chrzanowska-Jeske, A. Mishchenko, X. Song, A. Al-Rabadi, L. Jozwiak, A. Coppola, and B. Massey. 2001a. Regularity and symmetry as a base for efficient realization of reversible logic circuits. In IWLS. 245--252.Google Scholar
- P. Picton. 1994. Modified Fredkin gates in logic design. Microelectronics Journal 25, 437--441.Google ScholarCross Ref
- I. Polian, T. Fiehn, B. Becker, and J. P. Hayes. 2005. A family of logical fault models for reversible circuits. In Asian Test Symposium. 422--427. Google ScholarDigital Library
- H. Rahaman, D. K. Das, and B. B. Bhattacharya. 2006. Implementing symmetric functions with hierarchical modules for stuck-at and path-delay fault testability. Journal of Electronic Testing: Theory and Applications 22, 2, 125--142. Google ScholarDigital Library
- C. Rovetta and M. Mouffron. 2011. De Bruijan sequences and complexity of symmetric functions. Cryptography and Communications Journal 3, 4, 207--225. Google ScholarDigital Library
- M. Saeedi and I. L. Markov. 2013. Synthesis and optimization of reversible circuits--a survey. ACM Computing Surveys 45, 2, 21:1--21:34. Google ScholarDigital Library
- M. Saeedi, M. S. Zamani, M. Sedighi, and Z. Sasanian. 2010. Reversible circuit synthesis using a cycle-based approach. Journal on Emerging Technologies in Computing Systems 6, 4, 13:1--13:26. Google ScholarDigital Library
- M. Soeken, L. Tague, G. W. Dueck, and R. Drechsler. 2014. Ancilla-free synthesis of large reversible functions using binary decision diagrams. CoRR abs/1408.3955.Google Scholar
- H. Thapliyal and M. B. Srinivas. 2005. The need of DNA computing: Reversible designs of adders and multipliers using Fredkin gate. In Proceedings of SPIE, Optomechatronic Micro/Nano Devices and Components.Google Scholar
- T. Toffoli. 1980. Reversible computing. Tech Memo MIT/LCS/TM-151, MIT Lab for Computer Science, Cambridge, MA.Google Scholar
- R. Wille and R. Drechsler. 2009. BDD-based synthesis of reversible logic for large functions. In Design Automation Conference. 270--275. Google ScholarDigital Library
- R. Wille, R. Drechsler, C. Oswald, and A. Garcia-Ortiz. 2012. Automatic design of low-power encoders using reversible circuit synthesis. In DATE. 1036--1041. Google ScholarDigital Library
- R. Wille, H. Zhang, and R. Drechsler. 2011. ATPG for reversible circuits using simulation, Boolean satisfiability, and pseudo Boolean optimization. In IEEE Annual Symposium on VLSI. 120--125. Google ScholarDigital Library
- R. Wille, H. Zhang, and R. Drechsler. 2013. Fault ordering for automatic test pattern generation of reversible circuits. In International Symposium on Multiple-Valued Logic. 29--34. Google ScholarDigital Library
- S. N. Yanushekvich, J. T. Butler, G. W. Dueck, and V. P. Shmerko. 2000. Experiments on FPRM expressions for partially symmetric logic functions. In IEEE International Symposium on Multiple Valued Logic. 141--146. Google ScholarDigital Library
Index Terms
- Reversible Synthesis of Symmetric Functions with a Simple Regular Structure and Easy Testability
Recommendations
A recursive method for synthesizing quantum/reversible quaternary parallel adder/subtractor with look-ahead carry
Multiple-valued quantum logic circuits are a promising choice for future quantum computing technology since they have several advantages over binary quantum logic circuits. Adder/subtractor is the major component of the ALU of a computer and is also ...
Synthesis of quaternary reversible/quantum comparators
Multiple-valued quantum circuits are promising choices for future quantum computing technology, since they have several advantages over binary quantum circuits. Quaternary logic has the advantage that classical binary functions can be very easily ...
BDD-based synthesis of reversible logic for large functions
DAC '09: Proceedings of the 46th Annual Design Automation ConferenceReversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like low-power design and nanotechnologies. However, current methods for the synthesis ...
Comments