Application of Graph Theory Algorithms in Non-disjoint Functional Decomposition of Speciﬁc Boolean Functions

Functional decomposition is a technique that allows to minimize Boolean functions that cannot be optimally minimized using other methods, such as variable reduction and linear decomposition. A heuristic method for finding non-disjoint decomposition has been proposed lately. In this paper, we examine...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of Telecommunications and Information Technology Jg. 3; H. 2020; S. 67 - 74
1. Verfasser:	Mazurkiewicz, Tomasz
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Warsaw Instytut Lacznosci - Panstwowy Instytut Badawczy (National Institute of Telecommunications) 01.10.2020 National Institute of Telecommunications
Schlagworte:	Algebra Algorithms Boolean Boolean algebra Boolean functions Decomposition Field programmable gate arrays functional decomposition Functionals Graph coloring Graph theory Heuristic Heuristic methods index generation functions logic synthesis non-disjoint decomposition Variables
ISSN:	1509-4553, 1899-8852
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!