RU2430408C1 - Device for parallel search for word inclusions and coincidence - Google Patents

Abstract

FIELD: information technology.

SUBSTANCE: characteristic matrix, which is the basic unit of the matrix search for word inclusions and coincidence, includes search cells which augment the geometric shape of the characteristic matrix to rectangular shape, which facilitates parallel search for not only inclusions, but coincidences of a sample and text.

EFFECT: high accuracy of search owing to search for conformity of text with a sample and coincidence of the sample with text.

2 cl, 7 dwg

Description

The invention relates to the field of computer engineering and informatics, can be used in high-performance search systems and data processing systems and knowledge oriented to the organization of parallel computing, in specialized computing devices and symbol information processing systems, in devices for managing data streams in computer networks or communication networks, in systems of spelling and syntactic control of texts, in training and decision-making systems, etc.

Let linear constructive objects be given x — a pattern of length n characters and y — text of length m characters, composed as chains of characters of a finite alphabet, where n> 0, m> 0 and n≤m. It is required to find the positions of all occurrences of x in y (hereinafter we will agree to call the occurrence), i.e. determine all the values of i for which y (i, i + n-1) = x (1, n), where 1≤i≤k, k = m-n + 1. It is also necessary to find the positions of all intersections of the proper start of pattern x with the proper end of the text y (hereinafter we will call “intersection 1”), i.e. determine all those i for which y (i, m) = x (1, m-i + 1), where k + 1≤i <m, k = m-n + 1, and it is necessary to find the positions of all intersections of the proper end sample x with its own beginning of text y (hereinafter we will agree to call “intersection 2”), i.e. determine all those i for which y (1, i) = x (n-i + 1, n), where 1≤i <n. Thus, in the generalized problem, it is required to find all occurrences and all indicated intersections.

Data and knowledge processing in symbolic computing systems is based not only on occurrence search operations, but also on finding the positions of “intersections 1” and “intersections 2”. When detecting occurrences of a pattern in the processed text, it is necessary to perform multiple indents (returns) in the space of both the pattern and the text. Multiple indentation in the search for occurrences and intersections of a sample is associated with the implementation of unproductive matching steps and leads to unproductive time expenditures. When implementing a technical solution, it is necessary to organize the search for positions of entries, “intersections 1” and “intersections 2” in such a way as to eliminate the need for return margins when detecting entries and thereby increase the speed of work on search operations.

A well-known search algorithm SHDIG-I, allowing you to consistently find all occurrences of the sample in the text. The essence of the algorithm is the construction and processing of characteristic vectors. The disadvantage of this algorithm is the sequential processing of m column vectors, which leads to excessive time costs due to m-times access to the text character memory to calculate the current column vector.

A device for searching for arbitrary occurrences is also known (patent No. RU 2202823 C2, MCP G06F 17/30). The disadvantage of this device is a consistent way of processing text and a pattern with indentation when processing partial occurrences.

The closest device to the claimed is a device for parallel search and data processing, consisting of two blocks for storing and comparing associative features, a logical vector memory block, an operation block and a matrix search block (patent No. RU 72771 U1, MCP G06F 12/00), performing parallel processing of a set of characteristic vectors combined in a two-dimensional search matrix.

The disadvantage of this device is its limited functionality - the device allows you to only search for all occurrences of the sample in the text. The characteristic search matrix has a geometric parallelogram shape, which does not allow this device to solve the intersection search problem.

An object of the invention is the expansion of functionality by introducing additional elements that will allow you to find not only all occurrences of the sample in the text, but also all of the above intersections of the sample with the text.

The technical problem is solved in that in a device for parallel search and processing of data containing the first and second blocks for storing and comparing associative signs, a memory block of logical vectors and an operation block, the information inputs of the first and second blocks for storing and comparing associative signs are the first and the second information inputs of the device, and the outputs of the storage units and comparison of associative features are connected respectively with the first and second address inputs of the memory unit logical vectors, the inputs of the job modes of the first and second blocks of storage and comparison of associative signs and the write-read input of the memory block of the logical vectors are the first, second and third inputs of the job of the device modes, and the fourth, fifth, sixth inputs of the job of the device modes are respectively connected to three the inputs of the operation unit operation codes, the first output of which is the first output of the device, the first input of the initial installation of the device is connected to the input of the initial installation of the opera unit, the second input of the initial installation - to the inputs of the initial installation of the first and second blocks for storing and comparing associative features, the first and second outputs of the logical vector memory block are connected respectively to the first and second information inputs of the device’s operating unit, additionally, firstly, the unit matrix search for entries and intersections of words, having four inputs and three outputs, secondly, an additional single-bit output (second output) of the operating unit, and the first input of the block is matrix The first search for occurrences and intersections of words is connected to the first input of the initial installation of the device, the second input is connected to the second output of the operation unit, the third and fourth inputs of the matrix search block for occurrences and intersections of words are, respectively, the third and fourth information inputs of the device, the first, second and third the outputs of the block matrix search for occurrences and intersections of words are, respectively, the second, third and fourth outputs of the device. The matrix block for the entries and intersections of words contains one delay element, n sample symbol code registers with a bit width of p bits each character, m text symbol code registers with a width of p bits each character, and also a characteristic matrix consisting of search cells, the geometric shape of which is a rectangle size m * n, where n is the length of the sample, m is the length of the text, k triggers of the position of occurrences, triggers of the position of intersection of the sample with text of 2 * (n-1), including n-1 triggers of the position of “intersection 1”, and n-1 t igers of the “intersection 2” position, with each register of the symbol code of the sample and each register of the code of the symbol of the text respectively have three inputs (the first and second control inputs and the third information p-bit input) and one p-bit output, each search cell has three information inputs (the first and second inputs of each bit are p bits, the third is a single-bit input) and one output, each entry position trigger, each intersection 1 position trigger and each intersection 2 position trigger have three inputs respectively and (the first and second control inputs and the third information input) and one output, each search cell contains a two-input comparison scheme for the equality of p-bit character codes of the sample and text and a two-input element And, and the first p-bit input of the search cells of the i-th line (i = 1 ... n) is connected to the p-bit output of the i-th register of the sample symbol code, the second p-bit input of the search cells of the j-th column (j = 1 ... m) is connected to the p-bit output of the j-th code register character of the text, the output of the (i, j) -th (i = 2 ... n, j = 2 ... m) search cell is connected to the third input (i-1, j-1) of the search cell, the output of the (i, j) -th (i = 1, j = 1 ... k) search cell is connected to the third input of the j-th trigger of the entry position, the output of (i, j) -th (i = 1, j = k + 1 ... m) of the search cell is connected to the third input of the (jk) th trigger of the “intersection 1” position, the output of the (i, j) th (i = 2 ... n, j = 1) search cell is connected with the third input of the (i-1) th trigger of the “intersection 2” position, the third input of the (i, j) th (i = n, j = 1 ... ml and i = 1 ... n, j = m) search cells, those. the bottom row and the right column of the characteristic matrix, designed to supply the initial value - logical "1" - to organize the search, the initial installation input is connected to the first input of n-1 triggers of the "intersection 1" position, with the first input of n-1 triggers of the "intersection 1" position 2 ", with the first input of n registers of the symbol code of the sample and m registers of the code of the symbol of the text, as well as with the first input of k triggers of the entry positions, the input" Record strings "is connected to the second input of n registers of the code of the symbol of the sample and m registers of the code of the text symbol, and also with the input of the delay element, the output of which is connected to the second input of n-1 triggers of the position of "intersection 1", with the second input of n-1 triggers of the position of "intersection 2" and with the second input of k triggers of the entry position, outputs k of triggers of the entry position, n-1 triggers of the “intersection 1” position and n-1 triggers of the “intersection 2” position are, respectively, the first k-bit, second n-1-bit and third n-1-bit information outputs of the matrix for finding entries and word intersections, the third input block matrix search for entries and intersection words consists of n groups of p bits each group encoding sample characters, and the i-th group of bits (i = 1 ... n) is fed to the third p-bit input of the i-th register of the code of the sample symbol, the fourth input of the matrix search entry block and word intersection consists of m groups of digits of p digits each group encoding text characters, the j-th group of digits (j = 1 ... m) being fed to the third p-bit input of the j-th register of the text symbol code, search cells containing p two-input comparison elements (the sum modulo 2 with inversion), the first in the course of the lth (l = 1 ... p) comparison element is connected to the lth digit of the p-bit output of the sample symbol code register, the second input of the lth (l = 1 ... p) comparison element is connected to the lth discharge of p the bit output of the register of the text symbol code, the output of the l-th (l = 1 ... p) comparison element is connected to the p-input element And whose output, which is the output of the two-input comparison circuit for equality, is connected to the first input of the two-input element And, the second input of which is the third input of the search cell, and the output of the two-input element And is the output of the search cells.

The invention is illustrated by drawings, in which Fig. 1 shows a block diagram of a device for parallel search of occurrences and intersections of words, Fig. 2 is a functional diagram of a block matrix search for entries and intersections of words, Fig. 3 is a functional diagram of a search cell of a characteristic matrix, figure 4 is an example of a parallel search for occurrences and intersections of words, figure 5 is a timing diagram of the operation on the operation "SEARCH FOR ENTRANCE AND INTERSECTION" ("PVP").

A device for the parallel search of occurrences and intersections of words (Fig. 1) contains blocks 1 ₁ and 1 ₂ for storing and comparing associative signs, a logical vector memory block 2, an operation block 3, a matrix search block 4 for occurrences and intersections, information inputs 4 ₁ 4 ₂ , 4, _3, and 4 ₄ , information outputs 5 ₁ –5 ₄ , inputs 6 ₁ –6 _{6 for} setting the operating mode, inputs 7 ₁ and 7 _{2 for the} initial installation.

Blocks 1 ₁ , 1 ₂ , 2, 3 strictly correspond to the prototype device in structural and functional terms, consist of matching elements and the connections between them.

Block 4 of the matrix search contains two control inputs: “Initial installation” 7 ₁ (first input) and input “Record lines” (second input), third and fourth information inputs for supplying sample characters and text in parallel code through information inputs 4 ₃ and 4 ₄ devices, as well as three information outputs, which are the second 5 ₂ , third 5 ₃ and fourth 5 ₄ output of the device. In this case, the second control input of unit 4 is connected to the second output of the operation unit 3.

Block 4 of the matrix search for occurrences and intersections of words contains a delay element 31 consisting of n pairs of inverters, n registers 32 ₁ ... 32 _n sample character codes, m registers 33 ₁ ... 33 _m text character codes, a characteristic matrix of search cells 34 _n ... 34 _nm , k triggers 37 ₁ ... 37 _k entry positions, n-1 triggers 41 ₁ ... 41 _n-1 positions of “intersection 2”, n-1 triggers 40 ₁ ... 40 _n-1 positions of “intersection 1”, and register 32 _i ( i = 1 ... n) and register 33 _j (j = 1 ... m) contain the first and second control inputs, the third p-bit information input and one output, respectively. The first and second inputs of n registers 32 ₁ ... 32 _n sample character codes and the first and second inputs of m registers 33 of text character codes are connected respectively to the first and second control inputs of block 4 of the matrix search for occurrences and intersections of words, the third input of which is p · n bits it is intended for parallel recording of the sample in registers 32 ₁ ... 32 _n and consists of n groups of bits of p bits each group encoding the characters of the sample, and the i-th group of bits (i = 1 ... n) is fed to the third p-bit input of the register 32 _i (i = 1 ... n), fourth block input 4 m An atric search for occurrences and intersections of words with bits of p-m bits is intended for parallel text writing in registers 33 _i ... 33 _m and consists of m groups of bits of p bits each group encoding text characters, and the j-th group of bits (j = 1 ... m) is fed to the third p-bit input of register 33j (j = 1 ... m). The second control input of the block 4 matrix search for occurrences and intersections of words is also connected to the input of the delay element 31.

The characteristic matrix of the search cells 34 ₁₁ -34 _nm in size m * n cells has the shape of a rectangle, which ensures the direction of the search along all diagonals passing through the cells as follows:

The l-th (l = 1 ... n-1) diagonal along which the search for “intersections 1” takes place passes through l search cells 34 _ij , where i = l ... 1, j = m ... m-l + 1;

the f-th (f = n ... m) diagonal along which the search for entries occurs passes through n search cells 34 _ij , where i = n ... 1, j = m-f + n ... m-f + 1;

the gth (g = m + 1 ... m + nl) diagonal along which the search for “intersections 2” takes place passes through n + mg of the search cells 34 _ij , where i = n ... g-m + 1, j = g- n + 1 ... m.

The first p-bit inputs m of the search cells of the i-th row of the characteristic matrix (i = 1 ... n) are connected to the p-bit output of the register 32 _i . The output of the p-bit register 33 _j (j = 1 ... m) is connected to the second p-bit inputs of all the search cells included in the j-th column of the matrix. The output of each search cell 34 _ij , except for i = 1, j = 1 ... n (the top row of the characteristic matrix), except for i = 2 ... m, j = 1 (the left column of the characteristic matrix), is connected to the third input of the search cell 34 _{i- 1j-1} . The output of the search cell 34 _ij (i = 2 ... m, j = 1) located in the left column of the characteristic matrix is connected to the information input 3 of the trigger 41 _{ji of} the “intersection 2” position, the output of the search cell 34 _ij (i = 1, j = 1 ... k) located in the upper row of the characteristic matrix, connected to the information input 3 of the trigger 37 _{j of} the entry position, the output of the search cell 34 _ij (i = 1, j = k + 1 _... m), connected to the information input 3 of the trigger 40 _jk position "crossing 1", a third input of each search cell located in the lower n-th row of the matrix in the right and m-th column mattresses gical, for supplying the logic values "1", thereby setting the initial value for searching for the corresponding diagonal line from the lower characteristic matrix in an upper line.

Triggers 37 ₁ -37 _{k of} entry position, triggers 41 ₁ -41 _{n-1 of} intersection 2 position, triggers 40 ₁ -40 _{n-1 of} intersection 1 position store the search result in the form of k-bit, n-1-, respectively bit, n-1-bit codes, in which the value of the logical “1” marks the position of the beginning of occurrences of the pattern in the text, “intersections 2” and “intersections 1”, respectively. Triggers 37 _{i of} the entry position (i = 1 ... k), triggers 41 _{j of the} position of "intersection 2" (j = 1 ... n-1), triggers 40 _{j of the} positions of "intersection 1" (j = 1 ... n-1) contain three inputs (first and second control, third one-bit information input) and one output, respectively. The first input of block 4 of the matrix search for occurrences and intersections of words is connected to the first inputs of k triggers 37 of the entry position, n-1 triggers 41 of the “intersection 2” position, n-1 triggers of 40 positions of the “intersection 1”, second inputs of k triggers 37 of the entry positions, n-1 flip-flops 41 positions of "intersection 2", n-1 flip-flops 40 positions of "intersection 1" are connected to the output of the delay element 31. The outputs of the triggers 37 ₁ -37 _k entry positions form the first k-bit information output of the block 4 of the matrix search for occurrences and intersections of words, the outputs of the triggers 41 ₁ -41 _n-1 positions of the "intersection 2" form the second n-1-bit information output of the block 4 matrix search for occurrences and intersections of words, outputs of triggers 40 ₁ -40 _n-1 positions of “intersection 1” form the third n-1-bit information output of block 4 of the matrix search for occurrences and intersections of words, which are outputs 5 ₂ , 5 ₃ and 5 ₄ , respectively devices.

This device, like the prototype device, works in the “Record” and “Operation” modes. The Record mode strictly corresponds to the algorithm described in the prototype device.

In the algorithm of the “Operation” mode, the operation performed in the device, previously designated as “PV”, is called “PVP” (search for the occurrence and intersection of words). It has an operation code that matches the operation code "PV", which is fed to the corresponding input of the operating mode code. To implement this additional functionality, the following additions are made to the algorithm of the “Operation” mode.

Let the device perform the “Operation” mode with the operation code “PVP”. Input 7 ₁ “Initial setting” of block 4 of the matrix search for occurrences and intersections of words is supplied with a pulse signal of the initial setting, which resets k triggers 37 entry positions, n-1 triggers 41 positions of “intersection 2”, n-1 triggers 40 positions “Intersection 1” at their input 1, n registers 32 at their input 1 and m registers 33 at their input 1. After the initial signal is completed, the pulse “signal” is sent to the second input “Record lines” of block 4 of the matrix search for occurrences and intersections of words operating unit. This pulse signal at the “Record strings” input of block 4 of the matrix search for occurrences and intersections of words is supplied respectively to the second recording permission inputs of n registers 32 character codes codes and the second write permission inputs of m registers 33 text character codes, thereby recording n character patterns and m characters of text in parallel code from inputs 4 ₃ and 4 _{4 of the} device, respectively. Also, the pulse signal at the “Record lines” input of block 4 of the matrix search for occurrences and intersections of words through the delay element 31 is supplied respectively to the second recording permission inputs of k triggers 37 entry positions, n-1 triggers 41 “intersection 2” positions, n-1 triggers 40 intersection 1 positions. The delay element 31, made in the form of n pairs of inverters, is necessary to complete the parallel search of occurrences and intersections along the diagonals of the characteristic matrix, consisting of search cells 34 ₁₁ -34 _nm .

подаются соответственно на третьи входы поисковых ячеек n-ной (нижней) строки матрицы и на третьи входы поисковых ячеек m-ного (правого) столбца характеристической матрицы, которые соединены с входом логической «1», определяя тем самым направление параллельного поиска по всем диагоналям характеристической матрицы от поисковых ячеек нижней строки и правого столбца к поисковым ячейкам верхней строки и левого столбца характеристической матрицы включительно. Время параллельного поиска вхождений не зависит от количества диагоналей, а определяется величиной T=τ_комп+nτ_и, где τ_и - время задержки в элементе 36 И, τ_комп - время задержки в схеме сравнения 35. По завершении процессов поиска импульсный сигнал с выхода элемента 31 задержки через время T'=n2τ_инв (2τ_инв - время задержки на паре инверторов) записывает k-битовый результат поиска начала вхождений в триггеры 37₁-37_k позиций вхождения, n-1-битовый результат поиска «пересечения 2» в триггеры 41₁…41_n-1, n-1-битовый результат поиска «пересечения 1» в триггеры 40₁…40_n-1. Выходы триггеров 37₁…37_k позиций вхождения являются k-разрядным выходом блока 4 матричного поиска вхождений и пересечений слов и образуют первый выход устройства 5₂, n-1-разрядные выходы триггеров 41₁-41_n-1 позиций «пересечения 2» и n-1-разрядные выходы триггеров 40₁…40_n-1 позиций «пересечения 1» образуют второй и третий выходы устройства 5₃ и 5₄ соответственно. Наличие логических «1» в разряде информационного выхода 5₂ указывает на позиции вхождений образца в текст. Наличие логических «1» разряде информационного выхода 5₃ указывает позицию «пересечения 2» в тексте. Наличие логических «1» в разряде информационного выхода 5₄ указывает позицию «пересечения 1» в тексте. На фиг.4 (в) проиллюстрирована интерпретация результатов обработки характеристической матрицы.The search begins with the cells of the bottom row and the right column of the characteristic matrix. The initial m-bit and n-bit characteristic vectors, respectively equal

respectively, are fed to the third inputs of the search cells of the nth (lower) row of the matrix and to the third inputs of the search cells of the mth (right) column of the characteristic matrix, which are connected to the input of logical “1”, thereby determining the direction of parallel search on all diagonals of the characteristic matrices from the search cells of the bottom row and the right column to the search cells of the top row and the left column of the characteristic matrix inclusive. The parallel search time for entries does not depend on the number of diagonals, but is determined by the value T = τ _comp + nτ _and , where τ _and is the delay time in the element 36 I, and τ _comp is the delay time in the comparison circuit 35. Upon completion of the search processes, the pulse signal from the output of the delay element 31 through the time T '= n2τ _inv (2τ _inv is the delay time on the pair of inverters) records the k-bit search result of occurrences of triggers 37 ₁ -37 _k entry positions, the n-1-bit search result of “intersection 2” in triggers 41 ₁ ... 41 _n-1 , n-1-bit search result of "intersection 1" in the trigger s 40 ₁ ... 40 _n-1 . The outputs of the triggers 37 ₁ ... 37 _k entry positions are the k-bit output of the block 4 of the matrix search for entries and intersections of words and form the first output of the device 5 ₂ , n-1-bit outputs of the triggers 41 ₁ -41 _n-1 positions of the "intersection 2" and n-1-bit outputs of flip-flops 40 ₁ ... 40 _n-1 of the “intersection 1” positions form the second and third outputs of the device 5 ₃ and 5 _4, respectively. The presence of logical “1” in the category of information output 5 ₂ indicates the position of occurrences of the sample in the text. The presence of logical “1” category of information output 5 ₃ indicates the position of “intersection 2” in the text. The presence of logical “1” in the category of information output 5 ₄ indicates the position of “intersection 1” in the text. Figure 4 (c) illustrates the interpretation of the processing results of the characteristic matrix.

The execution of the algorithm in the "Operation" mode on the remaining operations strictly corresponds to the prototype device.

Thus, it is possible to expand the functionality of the device by introducing additional elements of the characteristic search matrix, which allows you to search in one operation for all entry positions, all positions of “intersection 1” and all positions of “intersection 2”.

Claims (2)

1. A device for parallel search and data processing, containing the first and second blocks for storing and comparing associative signs, a memory block of logical vectors and an operation block, the information inputs of the first and second blocks for storing and comparing associative signs are the first and second information inputs of the device, and the outputs of the blocks for storing and comparing associative signs are connected, respectively, with the first and second address inputs of the logical vector memory block, the presses of the first and second blocks for storing and comparing associative signs and the write-read input of the logical vector memory block are the first, second, and third inputs of the device mode settings, and the fourth, fifth, and sixth device mode settings inputs are respectively connected to the three inputs of the operation unit operation codes the first output of which is the first output of the device, the first input of the initial installation of the device is connected to the input of the initial installation of the operating unit, the second input is settings - to the inputs of the initial installation of the first and second blocks of storage and comparison of associative signs, the first and second outputs of the logical vector memory block are connected respectively to the first and second information inputs of the device operation block, characterized in that an additional matrix search block for entries and word intersections is introduced, having four inputs and three outputs, an additional one-bit output (second output) of the operating unit is introduced, the first input of the matrix of entries and entries crossing words is connected to the first input of the initial installation of the device, the second input is connected to the second output of the operating unit, the third and fourth inputs of the matrix search block of entries and intersections of words are, respectively, the third and fourth information inputs of the device, the first, second and third outputs of the matrix search block occurrences and intersections of words are, respectively, the second, third and fourth outputs of the device. 2. The device according to claim 1, characterized in that the matrix search block for occurrences and intersections of words contains one delay element, n sample code symbol registers with a capacity of p bits each character, m text character code registers with a capacity of p bits each character, and also a characteristic matrix consisting of search cells, the geometric shape of which is a rectangle of size m × n, where n is the length of the sample, m is the length of the text, k = m-n + 1 triggers of the position of occurrences, triggers of the position of the intersection of the sample with text of 2 · (n -1), including e n-1 triggers of the “intersection 1” position, and n-1 triggers of the “intersection 2” position, with each sample character code register and each text character code register each having three inputs (the first and second control inputs and the third information input -digit input) and one p-bit output, each search cell has three information inputs (the first and second inputs are each bit bit, the third is a single-bit input) and one output, each entry position trigger, each “intersection 1” position trigger, and each trigger of the “ne Cutoffs 2 ”have three inputs, respectively (first and second control inputs and a third information input) and one output, each search cell contains a two-input comparison scheme for the equality of p-bit character codes of a sample and text, and a two-input element And, and the first p-bit the input of the search cells of the i-th row (i = 1 ... n) is connected to the p-bit output of the i-th register of the code of the sample symbol, the second p-bit input of the search cells of the j-th column (j = 1 ... m) is connected to p- bit output of the j-th register of the text symbol code, the output of the (i, j) -th (i = 2 ... n, j = 2 ... m) cell is connected to the third input of the (i-1, j-1) -th search cell, the output of the (i, j) -th (i = 1, j = 1 ... k) search cell is connected to the third input of the j-th position trigger occurrences, the output of the (i, j) th (i = 7, j = k + 1 ... m) search cell is connected to the third input of the (ik) th trigger of the “intersection 1” position, the output of the (i, j) th ( i = 2 ... n, j = 1) of the search cell is connected to the third input of the (i-1) th trigger of the “intersection 2” position, the third input of the (i, j) th (i = n, j = 1 ... m- 1 and i = 1 ... n, j = m) of the search cell, i.e. the bottom row and the right column of the characteristic matrix, designed to supply the initial value - logical "1" - to organize the search, the initial installation input is connected to the first input of n-1 triggers of the "intersection 1" position, with the first input of n-1 triggers of the "intersection 1" position 2 ", with the first input of n registers of the code of the symbol of the sample and m registers of the code of the symbol of the text, as well as with the first input to the triggers of the entry position, the input" Record strings "is connected to the second input of n registers of the code of the symbol of the sample and m registers of the code of the text symbol, and also with the input of the delay element, the output of which is connected to the second input of n-1 triggers of the “intersection 1” position, with the second input of n-1 triggers of the “intersection 2” position and with the second input to the triggers of the entry position, outputs to the triggers of the entry position, n-1 the triggers of the position “intersection 1” and n-1 the triggers of the position “intersection 2” are, respectively, the first k-bit, the second n-1 - bit and the third n-1 - bit information outputs of the block for the matrix search for occurrences and intersections of words, the third input block matrix search entries and word sequences consists of n groups of p bits each group encoding sample characters, and the i-th group of bits (i = 1 ... n) is fed to the third p-bit input of the i-th code register of the sample character code, the fourth input of the matrix entry search block and word intersection consists of m groups of bits of p bits each group encoding text characters, the j-th group of bits (j = 1 ... m) being fed to the third p-bit input of the j-th code symbol code register, search cells containing p two-input comparison elements (sum modulo 2 with inversion), first input One of the 1st (l = 1 ... p) comparison element is connected to the 1st digit of the p-bit output of the sample symbol code register, the second input of the 1st (l = 1 ... p) comparison element is connected to the 1st discharge of p- bit output of the register of the text symbol code, the output of the 1st (l = 1 ... p) comparison element is connected to the p-input element And whose output, which is the output of the two-input comparison circuit for equality, is connected to the first input of the two-input element And, the second input of which is the third input of the search cell, and the output of the two-input element And is the output of the search cell hers.

Images