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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of Telecommunications and Information Technology Vol. 3; no. 2020; pp. 67 - 74
Main Author:	Mazurkiewicz, Tomasz
Format:	Journal Article
Language:	English
Published:	Warsaw Instytut Lacznosci - Panstwowy Instytut Badawczy (National Institute of Telecommunications) 01.10.2020 National Institute of Telecommunications
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!