|
Logical calculator |
|
IPC classes for russian patent Logical calculator (RU 2260837):
![]()
Device has n calculating cells, each of which consists of AND element and XOR element, n AND elements, n D-triggers.
![]()
Device has closing and opening keys, register and calculating cells, each of which consists of OR element, AND element.
![]()
Device has n computing cells, each of which has AND element, OR element, D-trigger.
![]()
Identifier has twenty two cells, each of which has two inputs, two outputs, AND, XOR elements, while all cells are grouped as a matrix of four rows and seven columns in such a way, that i-numbered (i=1,4) string and j-numbered (j=1,4) column contain respectively 8-i and j cells.
![]()
Device has majority elements, grouped in V+1 group in such a way, that i-numbered (I = 1, V) and V+1 numbered groups contain respectively n and V-1 majority element groups.
![]()
Logic module has And element, first, second majority elements, OR element, three data inputs and two adjustment inputs.
![]()
Module has n D-triggers, n AND elements and n OR elements, while output of i-numbered
![]()
Device has eleven majority elements, four information inputs, two adjustment inputs.
![]()
System has first memory element for storing metrics of basic states, multiplexer, capable of selection between first and second operating routes on basis of even and odd time step, adding/comparing/selecting mechanism, which calculates metrics of end states for each state metric. Second memory element, connected to adding/comparing/selecting mechanism and multiplexer is used for temporary storage of end states metrics. Multiplexer selects first operating route during even time steps and provides basic states metrics, extracted from first memory element, to said mechanism to form end state metrics. During odd cycles multiplexer picks second operating route for access to second memory element and use of previously calculated end state metrics as metrics of intermediate source states.
![]()
System has first memory element for storing metrics of basic states, multiplexer, capable of selection between first and second operating routes on basis of even and odd time step, adding/comparing/selecting mechanism, which calculates metrics of end states for each state metric. Second memory element, connected to adding/comparing/selecting mechanism and multiplexer is used for temporary storage of end states metrics. Multiplexer selects first operating route during even time steps and provides basic states metrics, extracted from first memory element, to said mechanism to form end state metrics. During odd cycles multiplexer picks second operating route for access to second memory element and use of previously calculated end state metrics as metrics of intermediate source states.
![]()
Device has eleven majority elements, four information inputs, two adjustment inputs.
![]()
Module has n D-triggers, n AND elements and n OR elements, while output of i-numbered
![]()
Logic module has And element, first, second majority elements, OR element, three data inputs and two adjustment inputs.
![]()
Device has majority elements, grouped in V+1 group in such a way, that i-numbered (I = 1, V) and V+1 numbered groups contain respectively n and V-1 majority element groups.
![]()
Identifier has twenty two cells, each of which has two inputs, two outputs, AND, XOR elements, while all cells are grouped as a matrix of four rows and seven columns in such a way, that i-numbered (i=1,4) string and j-numbered (j=1,4) column contain respectively 8-i and j cells.
![]()
Device has n computing cells, each of which has AND element, OR element, D-trigger.
![]()
Device has closing and opening keys, register and calculating cells, each of which consists of OR element, AND element.
![]()
Device has n calculating cells, each of which consists of AND element and XOR element, n AND elements, n D-triggers.
|
FIELD: computer science. SUBSTANCE: device has five OR elements, five AND elements, register, six closing and six opening keys. EFFECT: higher speed of operation. 2 dwg
The invention relates to computer technology and can be used for building automation, functional units of the control systems and other Known logic solvers (see, for example, in figure 1 the description of the invention to the patent of the Russian Federation 2172980, CL G 06 G 7/25, 2001), which can be used to implement six simple symmetric Boolean functions that depend on six arguments - input binary signals x1,..., x6∈{0,1}. For the reason that impede the achievement of specified following technical result when using known logic solvers, is the low speed, because the implementation of these functions will require ten cycles of computation. The closest device to the same destination to the claimed invention by the combination of features is adopted for the prototype logic solver (see figure 2 in the article Savchenko YG, Hop A.V. methods consistent implementation of symmetric Boolean functions// Automatic control and computer engineering. 1974. No. 3. P.24-29), which contains the register n-1 elements And n-1 elements OR when n=6 implements six simple symmetric Boolean functions that depend on six arguments - input binary signals x1,..., x6∈{0,1}. For the reason that impede the achievement of specified below technical the second result when using prototype is poor performance, because of the implementation of these functions will require six cycles of calculation, and the minimum duration of each beat is determined by the amount of ΔtP+5ΔtEwhere ΔtPand ΔtEthere is duration of the delay introduced respectively by the register and the parallel cascade triggered elements OR I. The technical result of the invention is to improve performance. This technical result in the implementation of the invention is achieved by the logic solver, which contains five elements OR five elements And the register, the first and second inputs of the r-th ( Figure 1 and figure 2 presents respectively the proposed scheme logic solver and time diagrams of signals settings. Logic solver contains elements OR 11,..., 15elements And 21,..., 25, register 3, trailing keys 41,..., 46release keys 51,..., 56and the first and second inputs of the element 1r( The work of the proposed logic solver is as follows. On his first,...,sixth information and the first, second tuning inputs are given correspondingly binary signals x1,..., x6∈{0,1} and y 1,2∈{0,1} (figure 2). Loading data into the register 3 is on the positive difference (from "0" to "1") signal at the input record, so the register can be hardware implemented using, for example, chip CIR. If the control input keys 4i, 5i( Duration Δt a high level signal at1and the period T of the signal y2must satisfy the conditions Δt≥2ΔtEand T≥ΔtP+2ΔtEwhere ΔtPand ΔtEthere is duration of the delay introduced respectively by the register 3 and the parallel cascade triggered elements OR I. as described in the recurrent expressions get The above data allow us to conclude that the proposed logic solver implements six simple symmetric Boolean functions that depend on six arguments - input binary signals, and has higher compared to the prototype performance, since it performs only three quantum computing, and the minimum duration of each beat is determined by the amount of ΔtP+2ΔtE. Logic solver, designed for the implementation of the six simple symmetric Boolean functions that depend on six arguments - input binary signals containing five elements OR five elements "And" register, and the first and second inputs of the r-th (
|
© 2013-2014 Russian business network RussianPatents.com - Special Russian commercial information project for world wide. Foreign filing in English. |