Algorithm and Program for Block-Recurred Function Decomposition Using q-Minterm Partitioning Method

Set-theoretical Constructions of Boolean Functions and theirs Applications in Logic Synthesis

“…for resolving of different optimization problems of logic synthesis of digital devices and systems. Efficiency of the ST approach is presented in new optimization methods and algorithms of logic synthesis of digital devices and systems and confirmed experimentally [5]- [8]. The method proposed in this article, in a smaller number of operations than other analytical methods and Curtis maps, gives the same result [8]- [11].…”

“…Efficiency of the ST approach is presented in new optimization methods and algorithms of logic synthesis of digital devices and systems and confirmed experimentally [5]- [8]. The method proposed in this article, in a smaller number of operations than other analytical methods and Curtis maps, gives the same result [8]- [11]. This paper systematizes a ST approach presented in previous works and presents the comparison of new results obtained on the basis of the proposed approach with the results obtained by means of commercial software Quartus II of Altera.…”

“…The usage of ST constructions was presented on the example of the fully defined Boolean function. Moreover, the clones may be used for systems of Boolean functions, incomplete Boolean functions or Boolean functions written in a noncanonical way [6,7,8].…”

“…4. ): f (x 1 , x 2 , x 3 , x 4 ) = ϕ(ϕ 1 (x 1 , x 2 ), ϕ 2 (x 3 , x 4 )) On the basis of the algorithm presented above, the decomposition program BRASh, that performs tht searches all types of functional decomposition has been elaborated [8].…”