Zobrazeno 1 - 10
of 908
pro vyhledávání: '"Disjunctive normal form"'
Autor:
Leonid Y. Bystrov, Egor V. Kuzmin
Publikováno v:
Моделирование и анализ информационных систем, Vol 29, Iss 2, Pp 78-91 (2022)
One of the problems of modern discrete mathematics is R. Dedekind problem on the number of monotone boolean functions. For other precomplete classes, general formulas for the number of functions of the classes had been found, but it has not been foun
Externí odkaz:
https://doaj.org/article/2c60fa9a019f44e3b19192b1df69d67d
Autor:
P. N. Bibilo, I. P. Loginova
Publikováno v:
Informatika, Vol 19, Iss 2, Pp 26-55 (2022)
Objectives. Methods, algorithms and programs for solving problems of minimizing the DNF representations of Boolean functions are widely used in the design of digital systems to reduce the complexity (crystal area) of functional combinational blocks o
Externí odkaz:
https://doaj.org/article/08b09e9c29fd4d9db6f1cb04613b7860
Autor:
Yu. V. Pottosin
Publikováno v:
Informatika, Vol 18, Iss 2, Pp 33-47 (2021)
The orthogonal disjunctive normal forms (DNFs) of Boolean functions have wide applications in the logical design of discrete devices. The problem of DNF orthogonalization is to get for a given function such a DNF that any two its terms would be ortho
Externí odkaz:
https://doaj.org/article/3a09ceb9f3204a7193792be027f23a2b
Autor:
P. N. Bibilo, V. I. Romanov
Publikováno v:
Informatika, Vol 18, Iss 2, Pp 7-32 (2021)
In the systems of digital VLSI design (Very Large Integrated Circuits), the BDD (Binary Decision Diagram) is used for VLSI verification, as well as for technologically independent optimization as the first stage in the synthesis of logic circuits in
Externí odkaz:
https://doaj.org/article/63ab044967f44491ab5abea2a98851ca
Publikováno v:
Informatika, Vol 18, Iss 1, Pp 7-24 (2021)
The paper describes the research results of application efficiency of minimization programs of functional descriptions of combinatorial logic blocks, which are included in digital devices projects that are implemented in FPGA. Programs are designed f
Externí odkaz:
https://doaj.org/article/4816939589b344399a1051889db550b9
Autor:
P. N. Bibilo, A. M. Pazniak
Publikováno v:
Informatika, Vol 17, Iss 1, Pp 63-77 (2020)
One of the directions of logical optimization of multilevel representations of systems of Boolean functions is the methods based on the search of subsystems of functions that have the same parts in the domains of functions of selected subsystems. Suc
Externí odkaz:
https://doaj.org/article/ab447030f0b64342903d9b41de250f82
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
P. N. Bibilo, Yu. Y. Lankevich
Publikováno v:
Informatika, Vol 16, Iss 2, Pp 73-89 (2019)
A synthesis of logical circuits, comprising functional combination blocks of very large scale integration circuits, is one of the most important tasks of computer-aided design. As the data size of design tasks increases, the execution time of synthes
Externí odkaz:
https://doaj.org/article/e0e15946d37c4d6894d32388b7037530
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Informatika, Vol 15, Iss 3, Pp 56-70 (2018)
The results of experimental study of the effectiveness of optimization procedures for systems of Boolean functions which are used in the synthesis of combinational circuits are described. The procedures use algorithms for partitioning systems of func
Externí odkaz:
https://doaj.org/article/f535847ee3d74f0cbf3af96b1a070026