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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of Telecommunications and Information Technology Ročník 3; číslo 2020; s. 67 - 74
Hlavní autor:	Mazurkiewicz, Tomasz
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Warsaw Instytut Lacznosci - Panstwowy Instytut Badawczy (National Institute of Telecommunications) 01.10.2020 National Institute of Telecommunications
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!