PROSPECTS OF THE MULTI-PURPOSE COMPUTER PLATFORM OPPORTUNITIES DEVELOPMENT

2018 ◽  
pp. 42-46
Author(s):  
M. I. Cheldiev ◽  
L. S. Libman
Keyword(s):  
Boolean Functions ◽  
Profit Center ◽  
Optical Module ◽  
Video Card ◽  
Optical Processor ◽  
Purpose Computer

In the article possibilities of increase of speed for solving a certain class of problems with the help of a profit center created in NIIVK named after М. А. Kartsev. As such capabilities are considered video cards and an optical module InLight256, the dimensions of which allow it to be included in the structure of the profit center. As an example of the use of video cards to improve the speed of implementation of algorithms, an algorithm is considered for finding the shortest coverings of Boolean matrices and further use of the results of this algorithm to find the minimal forms of weakly defined Boolean functions. The article shows that the use of a video card for the class of problems under consideration makes it possible to obtain a gain in time several times. The optical module InLight256, developed by the Israeli company Lenslet, is currently the only optical processor that is commercially available, which can be purchased. The module is equipped with software and is compatible with modern electronic modules. The article lists the advantages of optical modules in comparison with electronic modules and the main characteristics of the above module. In addition, the possible areas of application of the module for both peaceful purposes and military are indicated.

CLASS OF BOOLEAN FUNCTIONS CONSTRUCTED USING SIGNIFICANT BITS OF LINEAR RECURRENCES OVER THE RING ℤ2n

2019 ◽  
Vol 6 (2) ◽  
pp. 90-94
Author(s):  
Hernandez Piloto Daniel Humberto
Keyword(s):  
Linear Function ◽  
Boolean Functions ◽  
Hamming Distance ◽  
Linear Recurrences ◽  
Maximum Period ◽  
Non Linear ◽  
The Given ◽  
Class Of Functions

In this work a class of functions is studied, which are built with the help of significant bits sequences on the ring ℤ2n. This class is built with use of a function ψ: ℤ2n → ℤ2. In public literature there are works in which ψ is a linear function. Here we will use a non-linear ψ function for this set. It is known that the period of a polynomial F in the ring ℤ2n is equal to T(mod 2)2α, where α∈ , n01- . The polynomials for which it is true that T(F) = T(F mod 2), in other words α = 0, are called marked polynomials. For our class we are going to use a polynomial with a maximum period as the characteristic polyomial. In the present work we show the bounds of the given class: non-linearity, the weight of the functions, the Hamming distance between functions. The Hamming distance between these functions and functions of other known classes is also given.

On the Signal-to-Noise Ratio for Boolean Functions

2020 ◽  
Vol E103.A (12) ◽  
pp. 1659-1665
Author(s):  
Yu ZHOU ◽  
Wei ZHAO ◽  
Zhixiong CHEN ◽  
Weiqiong WANG ◽  
Xiaoni DU
Keyword(s):  
Boolean Functions ◽  
Signal To Noise Ratio ◽  
Signal To Noise ◽  
Noise Ratio
Sign in / Sign up

Export Citation Format

Share Document