Abstract
Research on synthesis of reversible circuits has found substantial consideration in the past. Corresponding methods can be categorized into functional approaches (which often require a prior embedding step) and structural ones (which are often based on mapping). While functional approaches are less scalable and yield circuits with significantly larger costs, structural approaches typically yield circuits where the number of circuit lines is magnitudes above the minimum. Recently, also the idea of a one-pass design flow has been proposed, which aims to overcome the contradictory shortcomings of both approaches by combining the embedding and the synthesis step of the functional design flow. While this yields further opportunities for a more efficient synthesis, the actually available degree of freedom has not fully been explored yet—not to mention fully exploited. In this work-in-progress-report, we are discussing this issue and explore in detail the potential offered by the one-pass design flow. To this end, we consider the implementation of this flow using QMDD-based synthesis as a representative. The conducted investigations provide a more detailed understanding of this recently proposed flow and demonstrate its potential to be exploited in future work.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
In the following we denote a mapping from input \(x_i\) to output \(x_i'\) by a variable \(x_i\).
- 2.
How this can be done efficiently is e.g. discussed in [7].
- 3.
Note that this is always possible since the additionally inserted variables ensure that \(\left| \overline{P}_1\right| \ge \left| P_2\right| \) and \(\left| \overline{P}_4\right| \ge \left| P_3\right| \).
- 4.
Note that this is possible if all occurring gates are self-inverse (which is e.g. the case for Toffoli or Fredkin gates).
References
Kozlowski, T., Dagless, E.L., Saul, J.M.: An enhanced algorithm for the minimization of exclusive-or sum-of-products for incompletely specified functions. In: International Conference on Computer Design, pp. 244–249 (1995)
Mishchenko, A., Perkowski, M.: Fast heuristic minimization of exclusive-sums-of-products. In: International Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pp. 242–250 (2001)
Niemann, P., Wille, R., Miller, D.M., Thornton, M.A., Drechsler, R.: QMDDs: efficient quantum function representation and manipulation. IEEE Trans. CAD Integr. Circ. Syst. 35(1), 86–99 (2016)
Soeken, M., Wille, R., Hilken, C., Przigoda, N., Drechsler, R.: Synthesis of reversible circuits with minimal lines for large functions. In: Asia and South Pacific Design Automation Conference, pp. 85–92 (2012)
Song, N., Perkowski, M.A.: Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions. IEEE Trans. CAD Integr. Circ. Syst. 15(4), 385–395 (1996)
Zulehner, A., Wille, R.: Improving synthesis of reversible circuits: Exploiting redundancies in paths and nodes of QMDDs. In: International Conference of Reversible Computation, pp. 232–247 (2017)
Zulehner, A., Wille, R.: Make it reversible: efficient embedding of non-reversible functions. In: Design, Automation and Test in Europe, pp. 458–463 (2017)
Zulehner, A., Wille, R.: One-pass design of reversible circuits: combining embedding and synthesis for reversible logic. IEEE Trans. CAD Integr. Circ. Syst. 37(5), 996–1008 (2018)
Acknowledgements
This work has partially been supported by the European Union through the COST Action IC1405.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Zulehner, A., Wille, R. (2018). QMDD-Based One-Pass Design of Reversible Logic: Exploring the Available Degree of Freedom (Work-in-Progress Report). In: Kari, J., Ulidowski, I. (eds) Reversible Computation. RC 2018. Lecture Notes in Computer Science(), vol 11106. Springer, Cham. https://doi.org/10.1007/978-3-319-99498-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-99498-7_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99497-0
Online ISBN: 978-3-319-99498-7
eBook Packages: Computer ScienceComputer Science (R0)