JPH01226026A - Retrieving circuit - Google Patents

Abstract

PURPOSE:To speed up retrieval and to reduce the number of bits in a data input line by providing the title circuit with a counter means for outputting a discriminator corresponding to data to be retrieved and a storing and comparing circuit means for applying parallel processing to update the storing states of plural data to be retrieved. CONSTITUTION:The retrieving circuit 10 is provided with the counter 20 for executing counting operation synchronously with the input of data to be retrieved and outputting a discriminator and the storing and comparing circuit 30. The circuit 30 compares the size of the data to be retrieved with that of every input of the data to be retrieved together with its corresponding discriminator and updates the storing states of the plural data to be retrieved in accordance with the compared results while maintaining correspondence to respective discriminators. Consequently, the data to be retrieved can be automatically combined with its corresponding discriminator in a retrieving circuit and the retrieval of plural data to be retrieved combined with respective discriminators can be rapidly retrieved.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a search circuit that retrieves a predetermined number of data from a group of data to be searched in order of increasing or decreasing data size.

[Prior Art] Conventional search circuits of this type typically use features extracted from input characters in the class classification process, as is well known. Corresponding input data is successively compared with reference data corresponding to multiple types of features extracted from multiple types of reference characters.

This comparison is usually performed by digital matching between the input data and many types of reference data, and this matching process produces a match that represents the degree of matching of the input data to the reference data, that is, the degree of similarity. Ching data can be obtained respectively. At this time, each matching data is paired with predetermined reference data, in other words, a code (identifier) that corresponds one-to-one with a predetermined reference character.

Then, in the search circuit, a large amount of the obtained matching data is combined with the identifier, compared in size, and ranked among them. This allows the search circuit to:
For example, high-level groups having a high degree of similarity are narrowed down as recognition candidate data, and these are targeted for identification. In this case, the identification candidate characters can be known by tracing the identifiers that are combined with the recognition candidate data and serve as search indicators. − Conventionally,
The above-mentioned ranking of a large number of matching data in the search circuit is as follows: 1) Matching data is paired with the identifier by making the identifier correspond to the address of the computer's storage device, and using the code corresponding to this address as the identifier. This is done either by sequential processing by computer software, or by generating identifiers in correspondence with the matching data by an identifier generation circuit, and sending the identifiers together with the corresponding matching data to the search circuit. There is.

[Problems to be Solved by the Invention] However, the above-described conventional search circuit has the following problems.

That is, in the case of ■, the search for a data group such as matching data is processed sequentially by computer software, so it is necessary to prepare the data group in advance before starting the search, and this requires high-speed processing. is difficult to realize.

Furthermore, in case (2), since the identifier and matching data are supplied together to the search circuit, there is a problem that the number of signal lines connected to the search circuit increases.

In addition to this, regardless of whether methods ① or ② are adopted, conventional search circuits do not have a means to generate an identifier, and they receive an externally supplied identifier and perform a correspondence with this identifier. It simply ranks data groups while maintaining the same, and is not necessarily functionally sufficient.

The present invention has been made in view of such problems, and includes:
It is an object of the present invention to provide a search circuit that is equipped with a counting means for generating an identifier and can realize high-speed processing.

[Means for Solving the Problems] A search circuit according to the present invention includes a counter means that performs a counting operation every time searched data is input and outputs the count output as an identifier, and a Each time a new input is made along with an identifier, the size of the searched data is compared in parallel with a plurality of pieces of searched data that have already been stored in order of size, and the size of the searched data is compared in parallel with a plurality of pieces of searched data that are already stored in order of size. The present invention is characterized by comprising a memory comparison circuit means for updating the memory state in order of size while associating search target data with each identifier.

[Operation] According to the search circuit according to the present invention configured as described above, the counter means performs a counting operation every time search target data is input, and outputs the count output as an identifier. For this purpose, an identifier is automatically output upon input of searched data, and forms a pair with this searched data. Furthermore, by providing this counting means, there is no need for a dedicated signal line for supplying the identifier, and since there is no need to input the searched data with an identifier added to the search circuit, the number of bits on the data input line can be reduced. can be reduced.

Further, the memory comparison circuit means compares the newly input search data in parallel with a plurality of search data already stored in the order of size, and selects a plurality of search data according to the comparison result. The storage state of the searched data is updated in order of size while associating the searched data with each identifier. Therefore, when all the searches for the searched data group are completed, a plurality of predetermined pieces of searched data are retrieved and stored in the storage comparison circuit in order of the largest or smallest data size. Since this storage comparison circuit introduces parallel processing to update the storage state as described above, it is possible to search a plurality of pieces of search target data at high speed.

[Embodiments] Hereinafter, embodiments of the present invention will be specifically described with reference to the accompanying drawings.

First, the configuration of this embodiment will be explained with reference to FIG.

The search circuit 10 includes a counter 20 that performs a counting operation in synchronization with the input of searched data and outputs an identifier, and a counter 20 that performs a counting operation in synchronization with the input of searched data and outputs an identifier. The size is compared in parallel with multiple pieces of searched data that are already stored, and the storage state of the pieces of searched data is updated according to the comparison results while maintaining the correspondence with each identifier. A storage comparison circuit 30 is provided.

Further, the reset signal line 11 is connected to the counter 20 and the memory comparison circuit 30.
When a reset signal is supplied to these via the counter 20 and the memory comparison circuit 30, the operations of the counter 20 and the storage comparison circuit 30 are initialized. Reference numeral 12 denotes a data input line for sequentially inputting search target data to the memory comparison circuit 30. The input control line 13 is connected to the counter 20 and the memory comparison circuit 30, and input control signals are sequentially supplied to these via the input control line 13, thereby controlling the counting operation of the counter 20 and the memory comparison circuit 30. The memory comparison processing of is controlled respectively.

Reference numeral 14 denotes an identifier input line that supplies the identifier output from the counter 20 to the storage comparison circuit 30 in synchronization with the input of search target data. The read control line 15 is connected to the memory comparison circuit 30, and after the input of the data group to be searched is completed, a read control signal is supplied to the memory comparison circuit via the read control line 15, so that the data can be read out. is controlled. 1
6゜17 are a data output line and an identifier output line, respectively;
The searched data read from the memory comparison circuit 30 and the identifier paired therewith are outputted via the data output line 16 and the identifier output line 17, respectively.

Next, the operation of the search circuit 10 according to this embodiment configured as described above will be explained.

First, both the counter 20 and the memory comparison circuit 30 are initialized by supplying reset signals to the counter 20 and the memory comparison circuit 30 through the reset signal line 11, respectively. Then, via the input control line 13, the counter 20
An input control signal is supplied to the storage comparison circuit 30 and the search data number of the search data group is sequentially input to the storage comparison circuit 30 via the data input line 12. At this time, the counter 20 sends the counter output as an identifier to the storage comparison circuit 3 via the identifier input line 14 in synchronization with the input of the searched data.
0 sequentially. The counter 20 counts up each time the data to be searched is input to the storage comparison circuit 30, and prepares for inputting the next data to be searched.

The memory comparison circuit 30 compares the searched data with a plurality of already stored searched data in parallel every time the searched data is newly inputted together with an identifier, and compares the searched data with the searched data that has already been stored. Accordingly, the storage order of the searched data is updated while maintaining the correspondence with each identifier. When the input of the searched data group is completed, the memory comparison circuit 30, for example, associates n pieces of searched data (n≧2.n is a natural number) with each identifier, and determines whether the data is large (or small). I remember the order.

Then, when a read control signal is supplied to the memory comparison circuit 30 via the read control line 15, the n pieces of search target data stored in order of size and the corresponding n pieces of identifiers are transferred to the memory comparison circuit 30. are outputted from the data output line 16 and the identifier output line 17, respectively.

Next, referring to FIG. 2, the above-mentioned memory comparison circuit 30
An example of the configuration will be explained.

In this case, the storage comparison circuit 30 stores n data registers 211 to 211, identifier registers 22 corresponding to these, and n data registers 211 to 211, respectively, in order to store n pieces of search target data in the order of size in correspondence with each identifier. to 22. and comparators 23□ to 23. , and a control circuit 25.

The reset signal line 11 is connected to data registers 211 to 21°, respectively, and the data input line 12 is connected to data registers 211 to 217 and comparators 231 to 23. are connected to each other. The data registers 211 to 21a and the comparators 23 to 23 are further connected to the data sending line 271.
to 27, respectively. Identifier input line 14 is connected to identifier registers 221 to 228, respectively.

Both the input control line 13 and the read control line 15 are connected to one side of the control circuit 25.

Comparison output lines 241 to 24fi drawn out from the comparator are connected to the other side of the control circuit 25, respectively, and a register control line 26 drawn out from the other side of the control circuit 25 is connected to the other side of the control circuit 25.
1 to 26. are data registers 211 to 21. and each pair of identifier registers.

Furthermore, the data output line 16 is connected to the registers 211 to 21. through gates 281 to 28i. The identifier output line 17 is connected to the identifier registers 22 and 22I, respectively, via gates 291 to 29fi.

Here, the operation of the storage comparison circuit 30 configured as above will be explained.

Data and registers 21□ to 21° can be configured by inputting a reset signal through the reset signal line 11, respectively.
It has been initialized beforehand. Then, m search data groups (m>n) are sequentially input to the memory comparison circuit 30 via the data input line 12, and identifiers corresponding to the search data are input to the search data. The information is sequentially input to the same circuit 30 via the identifier input line 14 in synchronization with the identifier input line 14.

The n pieces of searched data al to a11 are stored in the memory comparison circuit 30.
When the data is input to the data register 21. and the search is performed, the storage comparison circuit 30 compares the size of the data and updates the stored contents as appropriate.
to 21. The searched data al to aI are stored, for example, in descending order of data.

That is, the searched data a1 * a2 * a 3 +・
....

In a, a 1 > a 2 > a s >
-> a If n, data registers 21□, 212
．． 213.

−・−・・・・, 21. is searched data a1 + a
3, a31..., afi are stored in this order. At this time, the identifier register 221.222.223
,...

22, these searched data a1 + a2 r
a3. ..., identifiers bl, b2゜b3 . . . corresponding to a6, respectively. . . , bfi are stored respectively.

In this state, the (n+1)th searched data an+1 (corresponding identifier data is b
ll) is input to the memory comparison circuit 3o, the comparator 23
1 to 23.1, this searched data an+1 is inputted, respectively, and in parallel, the data register 211
to 21. Searched data a1 to at
t are respectively input. Comparators 231 to 23. Then, the size of the searched data a6+1 and the searched data al to a
, are compared in parallel. Then, n pieces of comparison data corresponding to each comparison result are outputted to the control circuit 25 via comparison output lines 241 to 24°, respectively.

When the control circuit 25 receives the n pieces of comparison data, it analyzes the contents of each of these data and registers the n control signals according to the analysis results! ! 261 to 26. Data registers 21□ to 21□ and identifier registers 221 to 22. Enter each. data register 2
11 to 2111 and identifier registers 22 to 223
When receiving each control signal, the memory contents are updated according to the contents of the control signal.

Here, n pieces of searched data a1 to a1 and (n+1
)th searched data a and +1, at-
1>an+1>at (If i<n+2>, the storage contents of data registers 211 to 21 to 1 and identifier registers 221 to 221-1 are not updated, and data registers 21+ to 21 and identifier register 22
+ to 22. Only the memory contents of are updated.

That is, the stored contents of the data registers 21+ to 21-1 and the identifier registers 22+ to 22-t are the data registers 211+1 to 21. and identifier register 2
2++1 to 22n, respectively, and the searched data a fi+ l and its identifier b01 are input to the data register 21+ and the identification register 22, respectively. At this time, data register 21. and an identifier register 22. The searched data a and the identifier bfi stored in the search data a and the identifier bfi are respectively cancelled.

Thereafter, similar processing is performed on the searched data an+2 to a and their corresponding identifiers 1)6+3 to data registers 211 to 21 and identifier registers 221 to 22. The stored contents of the higher-order data register and identifier register are respectively input to the register. As a result, when all the searches for the m pieces of searched data a1 to am are completed, the data registers 211 to 21. The searched data a1 to a are stored in descending order of data, and the identifier registers 221 to 22° store identifiers bl to 22 in correspondence with the storage order of the searched data a1 to a. .

Then, when the read control signal is input to the control circuit 25 via the continuous control line 15, the control circuit 25 connects the gates 28 to 28 . and gates 291 to 29, respectively, and data registers 211 to 21. and identifier registers 221-22. The register outputs are controlled respectively.

As a result, data register 21. to 21. n pieces of searched data and identifier registers 221 to 22 . The n identifiers stored in are sequentially outputted via the data output line 16 and the identifier output line 17, respectively.

[Effects of the Invention] As explained above, according to the search circuit of the present invention, parallel processing is introduced in the counter means for outputting the identifier corresponding to the searched data and in updating the storage states of the plurality of searched data. Since the search circuit is equipped with a memory comparison circuit means, it is possible to automatically combine the searched data and the identifier within the search circuit, and also perform a high-speed search for a plurality of pieces of searched data in which each identifier is combined. be able to. In particular, by incorporating the counting means, there is no need for a dedicated signal line for supplying an identifier, and there is no need to input data with an identifier added to the searched data into the search circuit, so data input is possible. The number of line bits can be reduced.

Therefore, the present invention is extremely useful because it can greatly improve the functionality of the search circuit by providing a combination of the counter means and the storage comparison circuit means.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an embodiment of the present invention, and FIG. 2 is a block diagram showing an example of the configuration of the storage comparison circuit in FIG. 1.

Claims (1)

[Claims] (1) Counter means that performs a counting operation each time searched data is input and outputs the count output as an identifier, and each time the searched data is newly inputted together with the corresponding identifier, the searched data and multiple pieces of searched data that have already been stored in the order of size, and also compares the sizes of the pieces of searched data while corresponding each identifier according to the comparison result. 1. A search circuit comprising: memory comparison circuit means for sequentially updating memory states.