Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Self-explaining Digital Systems: Technical View, Implementation Aspects, and Completeness Kapitel lesen Erstes Kapitel lesen

2020 | OriginalPaper | Buchkapitel

10. New Results on Reversible Boolean Functions Having Component Functions with Specified Properties

verfasst von : Paweł Kerntopf, Krzysztof Podlaski, Claudio Moraga, Radomir Stanković

Erschienen in: Advanced Boolean Techniques

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In the traditional logic synthesis different classifications of non-reversible Boolean functions have found many applications. Recently, some attempts to deal with classifications of reversible functions have been published. In this paper, solutions of two problems which have not been addressed yet are presented. The solutions were found by extrapolation of cycle structures for 3-and 4-variable reversible functions obtained in the course of enumerative computations.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions
Nächstes Kapitel Efficient Hardware Operations for the Residue Number System by Boolean Minimization
Literatur
1.
de Vos, A.: Reversible Computing: Fundamentals, Quantum Computing, and Applications. Wiley, Weinheim (2010)CrossRef
2.
Saeedi, M., Markov, I.L.: Synthesis and optimization of reversible circuits: a survey. ACM Comput. Surv. 45(2), 21 (2013)CrossRef
3.
Soeken, M., Wille, R., Keszocze, O., Miller, D.M., Drechsler, R.: Embedding of large Boolean functions for reversible logic. J. Emerg. Technol. Comput. Syst. 12(4), 41 (2015).; also available as preprint arXiv.​org:1408.3586, August 15, 2014CrossRef
4.
Carlet, C.: Vectorial Boolean functions for cryptography. In: Crama, Y., Hammer, P. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 398–472. Cambridge University Press, Cambridge (2010)CrossRef
5.
Tokareva, N.: Bent Functions. Results and Applications to Cryptography. Academic Press, London (2015)MATH
6.
Kerntopf, P., Moraga, C., Podlaski, K., Stanković, R.S.: Towards classification of reversible functions. In: Steinbach, B. (ed.) Proceedings of the 12th International Workshop on Boolean Problems, pp. 21–28 (2016)
7.
Kerntopf, P., Moraga, C., Podlaski, K., Stanković, R.S.: Towards classification of reversible functions with homogeneous component functions. In: Steinbach, B. (ed.) Further Improvements in the Boolean Domain, pp. 386–406. Cambridge Scholars Publishing, Newcastle upon Tyne (2018)
8.
Kerntopf, P., Podlaski, K., Moraga, C., Stanković, R.S.: Study of reversible ternary functions with homogeneous component functions. In: Proceedings of the 47th IEEE International Conference on Multiple-Valued Logic, pp. 191–196 (2017)
9.
Kerntopf, P., Stanković, R.S., Podlaski, K., Moraga, C.: Ternary/MV reversible functions with component functions from different equivalence classes. In: Proceedings of the 48th IEEE International Conference on Multiple-Valued Logic, pp. 109–114 (2018)
10.
Tsai, C.-C., Marek-Sadowska, M.: Boolean functions classification via fixed polarity Reed-Muller forms. IEEE Trans. Comput. 46(2), 173–186 (1997)CrossRef
11.
Debnath, D., Sasao, T.: Fast Boolean matching under variable permutation using representative. In: Proceedings of the Asia and South Pacific Design Automation Conference, pp. 359–362 (1999)
12.
Debnath, D., Sasao, T.: Efficient computation of canonical form for Boolean matching in large libraries. In: Proceedings of the Asia and South Pacific Design Automation Conference, pp. 591–596 (2004)
13.
Debnath, D., Sasao, T.: Fast Boolean matching under permutation by efficient computation of canonical form. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E87-A, 3134–3140 (2004)
14.
Debnath, D., Sasao, T.: Efficient computation of canonical form under variable permutation and negation for Boolean matching in large libraries. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E89-A(12), 3443–3450 (2006, Special Section on VLSI Design and CAD Algorithms)CrossRef
15.
Stanković, R.S., Astola, J.T., Steinbach, B.: Former and recent work in classification of switching functions. In: Steinbach, B. (ed.) Proceedings of the 8th International Workshop on Boolean Problems, pp. 115–126 (2008)
16.
Lorens, C.S.: Invertible Boolean Functions. Space-General Corp, El Monte (1962)MATH
17.
18.
19.
Strazdins, I.E.: On the number of types of invertible binary networks. Avtomatika Vychislitelnaya Tekhnika. 1, 30–34 (1974)MathSciNet
20.
Primenko, E.A.: Invertible Boolean functions and fundamental groups of transformations of algebras of Boolean functions. Avtomatika Vychislitelnaya Tekhnika. 3, 17–21 (1976)MathSciNet
21.
Primenko, E.A.: On the number of types of invertible Boolean functions. Avtomatika Vychislitelnaya Tekhnika. 6, 12–14 (1977)MathSciNetMATH
22.
Primenko, E.A.: On the number of types of invertible transformations in multivalued logic. Kibernetika. 5, 27–29 (1977)MathSciNetMATH
23.
Primenko, E.A.: Equivalence classes of invertible Boolean functions. Kibernetika. 6, 1–5 (1984)MathSciNetMATH
24.
Rice, J.E.: Considerations for determining a classification scheme for reversible Boolean functions. Technical report TR-CSJR2–2007, University of Lethbridge, Lethbridge (2007)
25.
Soeken, M., Abdessaied, N., de Micheli, G.: Enumeration of reversible functions and its application to circuit complexity. In: Devitt, S., Lanese, I. (eds.) Reversible Computation. Proceedings of the 8th International Conference, RC 2016, Bologna, Italy, July 7–8, 2016, Lecture Notes in Computer Science, vol. 9720, pp. 255–270, Springer, Cham (2016)CrossRef
26.
Draper, T.G.: Nonlinear complexity of Boolean permutations. PhD thesis, University of Maryland, College Park (2009)
27.
Aaronson, S., Grier, D., Schaeffer, L.: The classification of reversible bit operations. Preprint arXiv:1504.05155 [quant-ph], 68 p. (2015)
28.
Carić, M., Živković, M.: On the number of equivalence classes of invertible Boolean functions under action of permutation of variables on domain and range. Publications de l’Institut Mathématique. 100(114), 95–99 (2016)., also available as preprint arXiv:1603.04386v2 [math.CO], 9 pages, April 6, 2016MathSciNetCrossRef
29.
Jegier, J., Kerntopf, P., Szyprowski, M.: An approach to constructing reversible multi-qubit benchmarks with provably minimal implementations. In: Proceedings of the 13th IEEE International Conference on Nanotechnology, pp. 99–104 (2013)
30.
Jegier, J., Kerntopf, P.: Progress towards constructing sequences of benchmarks for quantum Boolean circuits synthesis. In: Proceedings of the 14th IEEE International Conference on Nanotechnology, pp. 250–255 (2014)
Metadaten
Titel
New Results on Reversible Boolean Functions Having Component Functions with Specified Properties
verfasst von
Paweł Kerntopf
Krzysztof Podlaski
Claudio Moraga
Radomir Stanković
Copyright-Jahr
2020
Buch
Advanced Boolean Techniques

Print ISBN: 978-3-030-20322-1

Electronic ISBN: 978-3-030-20323-8

Copyright-Jahr: 2020

DOI
https://doi.org/10.1007/978-3-030-20323-8_10

Neuer Inhalt

    Bildnachweise