Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Y. Y. Lankevich"'
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
Autor:
P. N. Bibilo, Y. Y. Lankevich
Publikováno v:
Informatika, Vol 0, Iss 2(54), Pp 45-57 (2017)
A locally optimal algorithm is proposed to form a permutation of variables, which are used to obtain successive Shannon decompositions of a system of disjunctive normal forms of completely specified Boolean functions. The goal of it is a multilevel r
Externí odkaz:
https://doaj.org/article/3b56a87838b745769ce023e02985aa20
Autor:
V. I. Romanov, Y. Y. Lankevich
Publikováno v:
Informatika, Vol 0, Iss 3, Pp 87-95 (2016)
One of the possible ways to reorganize of graphical information describing the set of topology layers of modern VLSI. The method is directed on the use in the conditions of the bounded size of video card memory. An additional effect, providing high p
Externí odkaz:
https://doaj.org/article/5a5834acd9fa44178a4852bd79a025f4
Autor:
Y. Y. Lankevich
Publikováno v:
Informatika, Vol 0, Iss 3, Pp 29-41 (2016)
We consider problem of assembling a common image of VLSI layout. Common image is composedof frames obtained by electron microscope photographing. Many frames require a lot of computation for positioning each frame inside the common image. Employing g
Externí odkaz:
https://doaj.org/article/614d3362f98d48bd9c5ff16d29476f3e