RussianPatents.com

Logic computer. RU patent 2504826.

Logic computer. RU patent 2504826.
IPC classes for russian patent Logic computer. RU patent 2504826. (RU 2504826):

G06F7/57 - Methods or arrangements for processing data by operating upon the order or content of the data handled (logic circuits H03K0019000000)
Another patents in same IPC classes:
Programmable logic device Programmable logic device / 2503993
Device includes groups of D flip-flops, function calculating units, a counter, a decoder, conjunction units, conjunction value units, wherein the function calculating units, conjunction units and conjunction value units are based on 2·2NOT-AND-OR elements which execute the function
Method of facilitating multiplication of floating-point numbers represented in residue number system Method of facilitating multiplication of floating-point numbers represented in residue number system / 2500018
Method comprises steps of: concurrently writing the remainder on base p1 of a multiplicand in memory elements; concurrently counting the number of units bi in each column of the i-th matrix; shifting the binary number b1 one bit to the right; summing with a number b2; shifting the obtained sum b 2 s one bit to the right and summing with a number b3. Similarly, the obtained sums are shifted and summed with subsequent numbers to obtain a sum b 2 * m − 1 s , wherein the least significant bit of the number b1 is the first multiplication bit s1, the least significant bit of each obtained sum b i s is the i-th multiplication bit. The binary number b 2 * m − 1 s is shifted; the least significant bit of the obtained number is the (2*m)-th bit of the determined product s2*m. If s is greater than p1, the obtained product s is corrected by successive subtraction of the base p1 from s until s is less than p1, otherwise correction is not performed; similarly, products of m-bit residues on the rest of the bases are calculated and corrected; the powers of multipliers are simultaneously summed up and the resultant sum is the power of the determined product.
Method of exact division of integer binary numbers, starting from least significant bit Method of exact division of integer binary numbers, starting from least significant bit / 2498393
Method includes stages, at which a divisor is recorded in parallel into matrix cells on memory elements, the first bit of the quotient becomes equal to the sum of module two of the least significant bit in the first column of the matrix and the first bit of the dividend, other bits of the quotient become equal to zero; the number of units b2 is counted in a vector equal to bit-by-bit logical multiplication of the appropriate bits of the second column of the matrix and bits of the quotient, at the same time the second bit of the quotient becomes equal to the sum of module two for the least significant bit b2 and the second bit of the dividend; similarly, the number of units bi is counted in a vector, which is equal to the bit-by-bit logical multiplication of the appropriate bits of the i column of the matrix and quotient bits, afterwards the sum ci of the vector bi and the vector bi-1 shifted by one bit to the right is calculated, at the same time the i bit of the quotient becomes equal to the sum of module two of the least significant bit ci and the i bit of the dividend, as a result the m-bit quotient of initial numbers will be generated.
Device to predict exceptional situation Device to predict exceptional situation "accuracy loss" of "multiplication with accumulation" operation unit / 2498392
Device comprises a subblock of prediction of a sum of fractional parts, a counter of senior zeros of the sum of fractional parts, registers of fractional parts of numbers, input registers of number exponents, a counter of junior zeros of the summand fractional parts, a subblock of calculation of a shift of levelling and prediction of a shift of preliminary normalisation, a comparator of early loss of accuracy, a counter of junior zeros of a sum of fractional parts, a comparator of late loss of accuracy.
Logic module Logic module / 2497181
Logic module has six closing switches and six opening switches.
Apparatus for boundary composite coding in interval computations Apparatus for boundary composite coding in interval computations / 2497180
Apparatus includes flip-flops, registers, ROM, subtractors, adders, multiplexers, shifters, a comparator unit, modulo two adders, AND and OR elements and a priority encoder.
Apparatus for decoding jointly stored boundaries in interval computations Apparatus for decoding jointly stored boundaries in interval computations / 2497179
Apparatus includes an encoder, a decoder unit, ROM, shifters, subtractors, multiplexers, an adder, modulo two adders, an inverter, AND and OR elements.
Method by kuvyrkov for information processing and calculation (versions) and device Method by kuvyrkov for information processing and calculation (versions) and device "generaliser" for method realisation / 2494445
In one of versions the method includes parallel-serial processing of a signal in a block of triggers of an input register; in a matrix device; in a unit of logical elements, preferably logical elements "AND"; in a unit of triggers of an output register. At the same time the signal processing in the matrix device is performed in accordance with the geometric model of the signal processing, representing a combination of graphs that forms at least one right triangle, which is divided into three parts, with lines stretching from the tops of the triangle angles.
Logic processor Logic processor / 2491613
Disclosed is a logic processor designed to execute eight simple symmetrical Boolean functions which depend on eight arguments - input binary signals, which can be used in digital computer systems as a code converting means, and also having nineteen computational cells (11,…,119), each having an OR element (2) and an AND element (3).
System and method for adaptive prioritisation of antivirus scanning objects System and method for adaptive prioritisation of antivirus scanning objects / 2491611
System for adaptive prioritisation of antivirus scanning objects includes a rule setting device which sets rules for prioritising antivirus scanning objects, a rule database for storing prioritisation rules and providing rule data to a queuing device. The system also includes an analyser which determines parameters of antivirus scanning objects required for prioritisation and sends said parameters to the queuing device. The queuing device is designed to assign priority and a scanning method with defined parameters in accordance with set rules. The queuing device also constructs a queue in accordance with the assigned priorities and sends the queue to a malicious object detecting device. The malicious object detecting device performs antivirus scanning of the scanning queue in accordance with the scanning method assigned for each object and sends the scanning results to a scanning result analyser.
Pulse code transformer Pulse code transformer / 2248607
Device has information input device, clock generator, connected to address counter with decoder, outputs of which are connected to inputs of recording device, inputs of which are connected to output of programming device, signal generator and multiplexers. Device for recording object sate is connected to output of decoder of cells address of device. Signal generator includes cells for recording checksum. First input of signals generator is connected to output of decoder of address of cells of checksum, second input - to output of recording device, first output - to first inputs of multiplexers, and second output - to first input of binary adder, by its output connected to third input of signal generator and checksum. Outputs of decoder of checksum cells address and decoder of object state recording device cells addresses are connected to second output of address counter, which is connected to second inputs of multiplexers. Recording device is programmable.
Homogenous substance cell Homogenous substance cell / 2251140
In a cell, containing seven inputs, eight OR elements, ten AND elements, three outputs by its adjustment different combination variants of connections of inputs to cell outputs are provided, to provide for calculation of Boolean formulae systems from classes of non-repeated orderly and disorderly formulae.
Homogenous substance cell Homogenous substance cell / 2251141
Cell has eight outputs, forty-five AND elements, three OR elements, three inputs.
Method for automatic detection of current state during multi- parameter comparison Method for automatic detection of current state during multi- parameter comparison / 2255368
Method includes forming parameters aij for each object, where i - object number, , and j - parameter number , normalization of values of objects parameters relatively to maximal value for each object and calculation of value of vector Vi in space of n parameters according to formula , where with following recording and comparison of vectors values. Normalization relatively to value of maximal parameter allows to exclude wrong estimation of object state.
Logical module Logical module / 2262733
Device has two majority elements, while output of first majority element is connected to second input of second majority element, connected by first, third inputs and an output respectively to second superstructure, third information inputs and output of logical module, first, second information and first superstructure inputs of which are formed by respectively second, third and first inputs of first majority element.
Logical calculator Logical calculator / 2262734
Device has n logical modules, each of which has two AND elements, OR element and two D-triggers.
Device for correcting order of a result of summing of floating point numbers Device for correcting order of a result of summing of floating point numbers / 2267806
Device has order correction adder, block for forming scaling signal, resolution inputs for scaling result, limiting and order correction codes of which are, respectively, first, second, and third inputs of device, and output is connected to first information input of order correction adder, second information input of which is fourth input of device, third input of device is connected to third information input of order correction adder, output of which is device output.
Spatial commutation structure Spatial commutation structure / 2270474
Spatial commutation structure has programmable commutation environment, groups of outputs of which are electrically connected to groups of outputs for connecting typical replacement elements. It is made in form of a polyhedron with n sides, on which groups of outputs are mounted for connecting typical replacement elements, while programmable commutation environment is positioned in the center of polyhedron. Second variant is different because spatial commutation structure is made in form of polyhedron with n sides, circling line of which approaches a spheroid shape. Groups of outputs of programmable commutation environment in accordance to both variants are electrically connected to groups of outputs for connecting typical replacement elements by means of conductors, positioned in appropriate radially positioned channels.
Combination type adder Combination type adder / 2275676
Device has two RS-triggers, seven AND elements, seven OR elements, four NOT elements, seven control buses, transfer bus.
Logical calculator Logical calculator / 2276399
Logical calculating device for realization of n simple Boolean functions depending on n arguments - input binary signals contains (n-1) elements AND, (n-1) OR elements and (n-1) D-triggers.

FIELD: information technology.

SUBSTANCE: device includes n D flip-flops, n NOR elements, n opening switches and n closing switches.

EFFECT: reduced hardware costs.

2 dwg, 1 tbl

 

The invention relates to the computer engineering and may be used for construction of facilities of automation of the functional units of control systems and other

Known logic solvers (see, e.g., patent of the Russian Federation 2248035, cl. G06F 7/38, 2005), which implement any of the n simple symmetric Boolean functions that depend on n arguments binary input signals.

The reasons that impede the achievement of specified below a technical result, when using the well-known logic solvers, refers to the dependence of the quantum duration calculation of the number of binary input signals.

The closest device to the same destination to the claimed invention by a combination of traits is taken as a prototype logic solver (RF patent 2336555, cl. G06F 7/57, 2008), which contains n D-flip-flops, n elements OR-NO, n closing and the n NC keys and implements any of the n simple symmetric Boolean functions that depend on n arguments binary input signals, when there is no relationship between the length of quantum computing and number last.

The reasons that impede the achievement of specified below technical result, when using the prototype, are large hardware expenses, due to the fact that the prototype additionally contains n+1 resistors.

The technical result of the invention is to reduce hardware costs while maintaining the functionality of the prototype.

This technical result in the implementation of the present invention is achieved by the logic solver, containing n constrictors, n NC keys n D-flip-flops and n elements OR NOT, the second inputs which are combined to form the first control input logic solver connected the second Manager and i-m

information inputs respectively stepping input and input data of i-D-a trigger, reset input and non-inverting the output of which is connected accordingly with the release of the i-th element OR NOT and control input (i-x, normally closed, normally open key outputs are combined, and the output of the previous NC key connected to the input of the subsequent NC key feature is that the inputs of the i-x, normally closed, normally open keys, first entrance and exit for the n-th NC keys are connected respectively to the first input of the i-th element OR NOT, exit of i-D-flip-flop, bus master zero potential and output logic solver.

On figure 1 and figure 2 are presented respectively scheme proposed logic solver and timing signals.

Logic solver contains D-triggers 1 1 , ..., 1 n , elements OR NOT 2 1 , ..., 2 n , NC keys 3 1 , ..., 3 n and closing keys 4 1 , ..., 4 n and the yield of the previous NC key connected to the input of the subsequent NC key, key outputs 3 and 4 i

combined, and key inputs 3 i , 3 1 and key output 3 n connected respectively to the first input element 2 i , bus master zero potential and output logic solver, first, second managers and the i-th information inlets of which are connected respectively with a second entrance item 2 i , clock input and the input data (D-trigger 1 i connected reset input and output accordingly to the exit item 2 i and the joint control input keys 3 i 4 i , input key 4 i .

The operation of the proposed logic solver is as follows. On his first, ..., n-th information and the first, second control inputs are served respectively binary signals x 1 , ..., x n belongs to{0,1} and pulse signals y 1 , y 2 let{0,l} (figure 2), and the period T and duration Dt ∗ pulse signal y 1 must satisfy the conditions T>Dt and Dt ∗ <Dt OR NOT +Dt Tp , where Dt=Dt OR NOT +Dt Tp +Dt CL , as Dt OR NOT , Dt Tp and Dt CL is the duration of the delay introduced element OR NOT, D-trigger and key. Key 4 i (

closed or open, key 3 i open or closed when their control input is present, respectively logic «1» or a logical «0». The following table lists the default signal current output of the proposed logic solver at time t j

for all the possible sets of values of the input signal x 1 ,...x n if n=4.

x 1 x 2 x 3 x 4 Z j=1 j=2 j=3 j=4 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 1 0 0 0 0 0 1 1 1 1 0 0 0 1 0 0 1 0 0 0 0 1 0 1 1 1 0 0 0 1 1 0 1 1 0 0 0 1 1 1 1 1 1 0 1 0 0 0 1 0 0 0 1 0 0 1 1 1 0 0 1 0 1 0 1 1 0 0 1 0 1 1 1 1 1 0 1 1 0 0 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1

With regard to the data given in the table, you can write

where j is the number of the moment of time t j (figure 2). Thus, the output of the proposed logic solver get

Here τ 1 , ..., t n is a simple symmetric Boolean functions (see .126 in the book Pospelov D.A. Logical methods of analysis and synthesis schemes. M: Energiya, 1974). The duration of quantum computation does not exceed the Level.

The above data allow to draw a conclusion that the proposed logic solver implements any of the n simple symmetric Boolean functions that depend on n arguments binary input signals, when there is no relationship between the length of quantum computation and the number of the last and has a smaller compared with the prototype instrumental composition. An additional advantage of the proposed logic solver is the lack of available in the prototype functional connection with the bus of a single building.

Logic solver designed to implement any of the n simple symmetric Boolean functions that depend on n arguments binary input signals containing n constrictors, n NC keys n D-flip-flops and n elements OR NOT, the second inputs which are combined to form the first control input logic solver connected the second Manager and i-m

information inputs respectively stepping input and input data of i-D-a trigger, reset input and non-inverting the output of which is connected respectively with the release of the i-th element OR NOT and control input (i-x, normally closed, normally open key outputs are combined, and the output of previous NC key connected to the input of the subsequent NC key, wherein the inputs of the i-x, normally closed, normally open keys, first entrance and exit for the n-th NC keys are connected respectively to the first input of the i-th element OR NOT, exit of i-D-flip-flop, bus master zero potential and output logic solver.

 

© 2013-2014 Russian business network RussianPatents.com - Special Russian commercial information project for world wide. Foreign filing in English.