SU780043A1 - Associative storage - Google Patents

Description

(54) ASSOCIATIVE STORAGE DEVICE

The invention relates to the field of storage devices. . An associative memory device is known that contains memory registers, a poll register, detectors and comparators 1. The disadvantage of this device is the limited set of search conditions. The closest technical solution to this invention is an associative memory device containing a drive, the inputs of which are connected to the output of the polling register and the first output of the control unit, the second output of which is connected to the input of the polling register, bit buses. The disadvantage of this device is a large amount of equipment and reduced speed. The device calculates the differences between associative features and the indication of the survey as a whole, which leads to the indicated disadvantages. The aim of the invention is to simplify the device and increase its speed. The goal is achieved by the fact that the device contains groups of elements I, local control blocks, additional drives and search result output blocks — by the number of storage cells of the accumulator, with the inputs of additional drives connected to the outputs of the corresponding local control blocks, and outputs respectively to the inputs of the search result blocks one of the inputs of the elements And the inputs of the first group of blocks of local control, bit bus connection with the outputs of the elements And the inputs of the second group of blocks the local control, the other inputs of the AND elements and the inputs of the third group of local control blocks are connected to the accumulator outputs, the third output of the control block is connected to the outputs of the fourth group of local control blocks. In this case, the local control unit may contain AND elements and OR elements, the outputs of which are the outputs of the local control unit, and the outputs of the OR elements are connected to the outputs of the AND elements, the inputs of which are the inputs of the local control unit. The search result display block can contain an AND element and an element

OR, the first input of the AND element and the inputs of the OR element are the inputs of the search result output block, and the output of the OR element is connected to the second input of the AND element whose output is the output of the search result output block.

Let given a set of binary associative signs-J., where

,, 2-- -.v, and J.

And the sign of the poll X and it is required to find some sign such that VE-1, nUX) t) l ().) I. closest to the poll sign. Let us assume that the highest bits are the first and the bit numbers increase in order of decreasing their weight.

. We introduce the value of Yu (-j) - (j) -Y (j), where ..., x ...-, -,

J-- i) 4 | OiCo)) ecliD, (p, Dp ((o - otherwise.: .-: -.- - /.

It can be shown that in an associative search, the failure to fulfill certain restrictions on the values of D (j) and tj / f, depending on a particular search condition, at any step of the search, excludes the i-th associative feature from the list of features that can satisfy a given query character. .

On the contrary, features that do not violate the restrictions on D (and di, e (j) at any step, as well as restrictions on) (VM) (after m steps) satisfy the given indication of a survey on this condition.

From this definition of the closest one follows (x - - the closest kU) .l (cli, e (.v «) 50) (vv,) o. ({) Then it is true: vv. (I) o (T) eCi) o- (d,

vt (DH (jHO) ACDg (j) 0) (j) 0) v

() () gtj) -0) - ((3) 0) v (2) (d, j (.j) i2) v (D, (b1) - 0) (a, - (n) o) l-: (vi € lbx., where B is the set of signs that do not satisfy the given attribute, the survey according to the condition nearest, BC.

From (2) it follows that it is enough to search for the nearest one at each step:

1) the allocation of the associative features of the larger and smaller features of the survey; .

2) the search for the smallest among the largest and the greatest among the smaller (the rest, except equal, are blocked, i.e. excluded from further consideration);

3) fixing two values of Pi (j / | | D. (. J) j - (and | D (j) i

4) fixing of two values a (, - fj / and a (j) -1.

where) m, us dige. t Р, signs with d (-j)% 2 b7 are localized.

Among the unblocked after m search steps there can be three different signs: Xp is equal, Xj is the closest and u) (f is the closest smaller (or several are the same). In turn, J Г L can be either equally spaced from the poll sign (then (yM)) - 0), or one of them, for example, closer to one, i .e. 6 J - () - I,.

Thus, the unlocked feature (or features), which has 0 and d (rt) -0, is the closest after all m steps.

FIG. 1 shows a block diagram of the device; in fig. 2 is a prior, respectful embodiment of a part of the device relating to one feature.

The device contains (s; m. Fig.1) drive 1, which includes n memory registers 2, poll register 3, bit buses 4, groups of I elements, n local control blocks b, n additional drives 7, n blocks 8 output results, block 9 control

The composition of accumulator 1 also includes AND 10 bit comparison circuits. The inputs of the accumulators 7 are connected to the outputs of the corresponding blocks 6, and the outputs are respectively to the inputs of blocks 8, one of the inputs of elements I of group 5 and the inputs of the first group of blocks 6, the bit buses 4 are connected to the outputs of elements I of group 5 and the inputs of the second group of blocks b , other inputs of elements And group 5 and the inputs of the third group of blocks b are connected to the outputs of drive 1. Let's arrive, the second and third outputs of the block

9connected respectively to the inputs of accumulator 1, register 3 polling and outputs of the fourth group of blocks b. Block b (see Fig.2) has a bus 11 initial installation and bus 12 synchronization. Block 7 contains triggers 1317. Each group of 5 elements AND, contains separate elements AND 18. The block contains elements AND 19 and 20 (elements AND 20 are made with one inverse input), elements OR 21, the outputs of which are outputs of block b The outputs of elements OR 21 are connected

to the outputs of elements I19 and 20, the inputs of which are the inputs of the block b.

Circuit 10 contains the elements NOT 22. Signals are given to the inputs 23 and 24 of the block 10 | and ju where

SU - to, -,,

Block 8, having an outlet 25, which is an output of the device, comprises an element AND 26 and an element. OR 27. The first input element And 26 and the inputs of the element

OR 27 are the inputs of block 8, and the output of the element OR 21 is connected to a BTO eye of the input of the element AND 19, the output of which is the output of the block 8. The device operates as follows

In the storage registers 2 accumulator 1, associative features are inserted. For each feature, the results of comparing the current bit and the corresponding bit of the polling feature are received from the bit 10 bit comparison circuit to the inputs of the AND elements of groups 5 and blocks 6. The signals from their outputs are fed to eight bit buses 4 to the inputs of five triggers 13, respectively. 17 of the accumulator 1. The states of the triggers 13-17 control the elements of AND groups 5 and the blocks 6. At the output 25 of the block, the signal is a logical function of the states of the triggers 13-17 and means that this symptom is the closest at this comparison step.

Depending on the functional features of accumulator 1, the input of the 10-bit comparison circuit can be received at each step, or signals

 -iiV j

or part of them, if registers 2 and 3 are shift registers or drive 1 (and register. 3) is used with a bit; 1m read, or signals

OV, (as shown in FIG. 2) or signals

1.0

(then block 10 is absent) if for: remembering registers 2 have the property of boundary associative. search.

The nearest search is carried out in m cycles, i.e. its time linearly depends on the sign size, in contrast to the degrees of dependence in the known device 2 The number of equipment units (not counting accumulator 1) does not depend on m, in the known device 2 there is a logarithmic (for sufficiently large m) dependence. Thus, the described device is simpler and has improved speed.

Claims (3)

Claim 1. An associative memory device comprising a drive, the inputs of which are connected to the output of the polling register and the first output of the control unit, the second output of which is connected to the input of the polling register, bit buses, in order to simplify the device and improve its speed It contains the groups of elements I, blocks of the public control, additional drives and blocks of the output of the search result — according to the number of storage cells of the drive, and the inputs of the additional storage unit are: to the outputs of the corresponding local control blocks, and the outputs respectively to the inputs of the search result output blocks, one of the inputs of the And elements and the inputs of the first group of local control blocks, the bit buses are connected to the outputs of the And elements and the inputs of the second group of local control blocks, the other inputs of the elements Both the inputs of the third group of local control units are connected to the accumulator outputs, the third output of the control unit is connected to the outputs of the fourth group of local control units. 2. The device according to Claim 1, which is localized so that the local control block contains AND elements and OR, whose outputs are the outputs of the local control block, and the inputs of the OR elements are connected to the outputs of the AND elements, the inputs of which are the inputs of the local control unit. 3. The device according to paragraphs. 1 and 2, characterized in that the block for outputting the search result contains an AND element and an OR element; the first input of the AND element and the inputs of the OR element are the inputs of the search result output block, and the output of the OR Element is connected to the second input of the AND element whose output is the output of the search result output block. Sources of information accepted. Attention in the examination 1. USSR author's certificate No. 277857, cl. G 11 C 15/00, 1968. 2. USSR author's certificate No. 332502, cl. G 11 C 15/00, 1970 (prototype). 80043