JPH0677835A - Coding method and coder - Google Patents

Abstract

PURPOSE:To reduce a time till a code number is obtained by adding a node number to each node of a tree structure so as to obtain a node to be advanced next based on an inputted text and a number of the node currently located. CONSTITUTION:Text data input terminals TD0, TD1 and node number input terminals ND0, ND1-ND3 are provided to a coincidence detection circuit section 20. Data inputted from the node number input terminals are inputted to a node number setting circuit 22. Then, a node number data output 26 from a coding circuit section 25 is connected to the node number setting circuit 22 and an output changeover terminal SW1 selects an output. Then, a node number is given to each node of a tree structure, and based on the inputted text and a node number of a node currently located, the node to be advanced next is obtained. Thus, even when lots of branches are extended from the node currently located, a node to be advanced next is immediately obtained by one retrieval.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a coding method and a coding apparatus suitable for rapidly obtaining and outputting a code number determined by the order of arrangement of a plurality of texts arranged in a tree structure.

[0002]

2. Description of the Related Art Conventionally, a method of arranging a plurality of texts in a tree structure by allowing them to reappear and obtaining a predetermined code number according to the arrangement order of the texts has been conventionally considered. There is. Here, a conventional technique will be described using a specific example.

[0003]

[Table 1]

[0004]

[Table 2] Table 1 shows each text T0, T1, T2, T3
And a text code consisting of 2 bits which is equated with each of these texts T0, T1, T2 and T3. Table 2 is a text chain in which texts are arranged and the text chains are attached to the text chain. It is a correspondence table with different code numbers. The 10-bit chain code is a code number represented by a binary code.

FIG. 9 is a diagram showing an example of texts arranged in a tree structure. First, two branches extend from the top node (vertex) of the figure, and texts T0 and T1 are arranged at the nodes at the ends of the branches. Of these, the code number C1 is attached to the node where the text T0 is arranged, while the code number is not attached to the node where the text T1 is arranged. Three branches further extend from the node where the text T0 is arranged among these nodes, and the texts T0, T1, and T3 are arranged at the nodes ahead of these three branches, respectively. Moreover, code numbers C3, C4, and C5 are assigned to the respective nodes. Two branches further extend from the node in which the text T0 is arranged among these nodes.
Texts T1 and T2 are provided at the nodes at the end of the book branch, respectively.
Are arranged, and code numbers C8 and C9 are attached to the respective nodes. Also at the top,
Two branches extend from the node where the text T1 is arranged, and the texts T0 and T2 are arranged at the nodes at the ends of the two branches, respectively. Of these nodes, the text T2 is arranged. Code number C for the selected node
7 is attached. Furthermore, these texts T0, T2
One and two branches respectively extend from the node in which is placed, and the text T0 is placed at the node at the end of the branch extending from the node in which the text T0 is placed, and the code number C10 is attached. , T2 are arranged at the nodes at the ends of the two branches extending from the node at which the text T2 is arranged, and code numbers C11, C12 are attached to these nodes.

A case will now be described in which the code number C4 corresponding to the text chain T0 → T1 in which the texts T0 and T1 are arranged in this order is obtained. First, when the first text T0 (text code '00') is input, the addresses storing the texts T0 and T1 arranged in the first two nodes of the tree-structured data are sequentially stored in the storage device. Give that text code '0
0'and '01' are output sequentially, and the output text code '00' and '01' are input text code '0
Compare with 0's sequentially. Here, it is assumed that the text T0 (text code "00") is stored at the first address of the storage device, and in that case, the input text T0 is obtained by one address access and one comparison operation.
The address at which the text T0 on the storage device that matches is stored is specified. This means that of the two branches in the top row shown in FIG.
Means to go to the node where is placed.

Next, the text T1 (text data '0
1 ') is input, the contents of the address specified above in the storage device are referred to, and the texts T0, T1, T3 at each node at the branch destination of the text T0 indicated by this contents are referred to. The addresses T0, T1, T stored in the storage device are sequentially given to the storage device.
3 are sequentially obtained, and these sequentially obtained texts T0, T1,
T3 is sequentially compared with the input text T1. Assuming that the texts T0, T1, and T3 are stored in the storage device in this order, the stored text T1 is the second one, so the input text T1 is obtained by two address accesses and two coincidence comparison operations. The address at which the text T1 on the storage device that matches is stored is specified. This means that the text T1 constituting the second row from the top of FIG.
Means that the code number C4 assigned to this node is obtained, and this code number C4 is output.

Although the text chain T0 → T1 has been described here, in this case, the code number C4 is obtained by a total of three address accesses and three coincidence comparisons.

[0009]

The above conventional example shows a considerably simplified example. In the case of the tree structure shown in FIG. 8 in which each stage has an extremely large number of nodes, a very large number of times is required. There is a problem that the desired code number can be obtained only after the address access and the coincidence comparison are performed, and it takes a long time to obtain the code number.

The present invention solves the above-mentioned problems, and even if a large number of nodes are arranged in each stage of a tree structure, the time until the code number is obtained is extremely short, and an encoding method and It is an object of the present invention to provide an encoding device that implements the method.

[0011]

The encoding method of the present invention for achieving the above object is arranged such that a plurality of texts are arranged in each node of a tree structure while allowing re-appearance, and each node optionally The code chain is assigned a code number, and the code number attached to the node existing at the end of the branch of the tree structure is obtained, thereby coding the text chain in which the above text is arranged in the order along the traced path. In the encoding method for converting into a number, a node number is given to each node of the tree structure, and when the above text is input, the next node is added based on the input text and the node number of the node currently located. It is characterized by finding a node to be advanced to.

Here, in principle, each node of the tree structure is given a different node number in order to identify each node from each other. If the same text or text chain with the same code number is present at the tip side of the node, the tip side is arranged so that a branch extends from the plurality of nodes to the same node on the tip side. It is preferable that the texts or the text chains of 1 are combined into one, and the same node number is given to the plurality of nodes that branch to the same node.

Further, in the encoding apparatus of the present invention for implementing this encoding method, a plurality of texts are arranged in each node of the tree structure while allowing reappearance, and each node is coded as necessary. Numbers are added, and the code number assigned to the node existing at the end of the branch of the tree structure is obtained, and the text chain in which the above texts are arranged in the order along the traced path is used as the code number. In a coding device for conversion, a text input unit for inputting the above text and a node number input unit for inputting the latched node number to the latch circuit, which has a latch circuit for latching the node number assigned to each node And a node that matches a node defined by the input text and node number based on the input text and node number. Coincidence detecting circuit unit that includes a detection unit,
And a node number output section for outputting the node number attached to the node detected by the coincidence detection section and inputting it to the latch circuit, and a code number attached to the node detected by the coincidence detection section And an encoding circuit section having a code number output section for outputting the code number.

In this encoding device, the coincidence detecting section has a number of coincidence comparing circuits each having a buffer or an inverter and a plurality of transistors connected in series with each other between the input side of the buffer or the inverter and the ground. , And the input side of each of the buffers or inverters of the plurality of match comparison circuits is configured to have a precharge circuit for charging prior to the search of the next node, and by combining different texts and different node numbers, Exclude some match comparison circuits of the above-mentioned many match comparison circuits so that the buffer or inverter input side of any one of the match comparison circuits is discharged by any one of the different bit patterns defined. The gate of the transistor of the other match comparison circuit is It is connected to the input section and the node number input section, and at least one transistor of each of the transistors forming the part of the match comparison circuit is turned off. In addition, it is preferable that the gates of at least one transistor are connected to the power supply or the ground.

[0015]

According to the encoding method of the present invention, a node number is attached to each node of the tree structure, and a node to be advanced to the next is obtained based on the input text and the node number of the node currently located. Therefore, even if a large number of branches extend from the node currently located, unlike the case of the above-described conventional example in which the branches are sequentially searched, a node that should immediately proceed to the next is obtained by one search operation, and therefore, Text chains are converted to code numbers in a very short time.

In the present invention, even if the same text or text chain with the same code number is present at the tip side of the plurality of nodes after the branch is once branched, the present invention Even the same text or text chain with the same code number may be treated as different nodes or node sequences once the branch has been split, but branch from these multiple nodes to the same node When the tree structure is configured as described above, and the same node number is given to the plurality of nodes that extend the branch to this same node, the tree structure is simplified as a whole, and if this is implemented as hardware, the circuit scale is reduced. It can be miniaturized.

Further, in the encoding device of the present invention, in the coincidence detection circuit, the node number of the current node is latched in the node number input section, and when the text is input from the text input section, the input text and The node to be advanced to the next is detected based on both of the latched node numbers, and then the encoding circuit unit outputs the node number of the node detected for the search operation of the next stage to output the node number. Since the code number is set in the input section and the code number is output, the code number corresponding to the text chain of sequentially input texts can be obtained in an extremely short time.

Considering that the encoding device of the present invention is integrated into a circuit, the circuit pattern is configured so that it can be commonly used for various tree structures, and the coincidence detecting section is provided for each specific tree structure. It is preferable that only the wiring is changed. The wiring of the coincidence detecting unit determines which node to proceed to when the text and the node number are input to the partial detecting unit, that is, which address of the encoding circuit unit is designated.

In this case, since the circuit pattern of the coincidence detecting unit is configured to handle various tree structures, some circuits may remain unused when a specific tree structure is configured. The problem is how to deal with this part of the circuit so as not to adversely affect the operation of the entire coding device at least. Here, in the encoding device of the present invention, when the coincidence detection unit has the above-mentioned numerous coincidence detection circuits and the precharge circuit and has the above-mentioned predetermined connection function, the output of the buffer or inverter Can be stably and unambiguously determined, and by using this output as a signal indicating that the node is not specified, even if some circuits are left over due to the tree structure, some of the circuits become unstable in overall operation. It is not a factor, and the entire encoding device can be operated stably.

[0020]

EXAMPLES Examples of the present invention will be described below.
In this case, Tables 1 and 2 in the above-mentioned conventional example are used as they are. FIG. 1 is a diagram showing a data structure (tree structure) according to an embodiment of the present invention. This Figure 1
9 corresponds to FIG. 9 in the above-mentioned conventional example, and the difference from FIG. 9 is that each node is given a node number (number in parentheses in the figure).

Here, the encoding method using the tree-structured data will be specifically described as follows. First, consider the case where the text chain T0 → T1 is input. At this time, the desired output chain code is '0000000100' as defined in Table 1.
Is.

To obtain this result, first the text T0
The text code '00' corresponding to is input. The text T0 on the tree structure is arranged at the node at the branch destination of the node number (0) (node number (0) is the first node number of encoding). Text T connected to the end of the branch extending from the node with node number (0)
Although there is only one 0, there are some other nodes in which the text T0 is arranged, which are connected to nodes other than the node with the node number (0).

Therefore, here, in order to recognize that the text input to this tree structure data is the first text T0 of the tree structure, this text data '00' is used.
In addition to that, node number (0) (data '000
0 ') is searched. The text T at the end of this branch
Although the code number C1 (chain code '0000000001') is given to the node in which 0 is arranged,
This time it is not the code number that should be requested.

Next, when the text data "01" corresponding to the text T1 is input, the node number (1) (data "0001") of the text T0 immediately before the text data "01" and the text data "01" input this time are input. The tree structure database is searched by both. As a result, it is possible to clearly distinguish the text T1 at the other branch end and the text T1 at the branch end of the node with the node number (1).

With this, the branch of the text chain T0 → T1 is determined, and the code number C4 (chain code '00000000100') attached to the end of the branch of the T1 is output as the code number to be obtained. Similarly, any chain code C1, ... Defined in Table 1
..., C12 can be obtained. FIG. 2 is a diagram showing an example of an encoding device in which the tree structure database is implemented as hardware.

The coincidence detection circuit section 20 of this encoding device is provided with text data input terminals TD0 and TD1 and node number input terminals ND0, ND1, ND2 and ND3. This node number input terminal ND0, ND1, N
The data input from D2 and ND3 is input to the node number setting circuit 22. Also, this node number setting circuit 22
Node number data output 26 from the encoding circuit 25
Is also connected, and its output is switched by the output switching terminal SW1.

The numbers written at the leftmost end of the coincidence detection circuit section 20 represent the node numbers (1), (2), (3), ..., (12) of each node of the tree structure shown in FIG. ing. For example, the node number (1) in the bottom line represents the node in which the text T0 is arranged in the upper row of the tree structure data in FIG. In the match detection circuit unit 20, line segments corresponding to each node extending to the match detection circuit 21 in the left-right direction and data lines from the text data input terminals TD0 and TD1 and node numbers set in the vertical direction are set. The data lines from circuit 22 intersect. A black circle is displayed at this intersection when the data of the data line is the normal data "1", and a black circle is displayed when the data line is the inverted data "0". The output of 21 is configured to be "1" (active). That is, the node number (1) is
When all the outputs from the text data input terminals TD0 and TD1 and the node number setting circuit 22 are "0", the output of the match detection circuit 21 corresponding to the node number (1) is "1".
Becomes

Here, in the node number setting circuit 22,
Node number (0) of the vertex node shown in (data '00
00 ') is set and the data' 00 'of the text T0 is inputted from the text data input terminals TD0 and TD1 in that state, the output of the coincidence detection circuit 21 corresponding to the node number (1) becomes'1'. Become. Then, the bottommost row of the encoding circuit section 25 on the right side of FIG.
The output of the output circuit 28 having an intersection point where there is is "1". Specifically, from the node number data output 26 to '00
01 ', code valid bit output 29 to' 1 ', and chain code data output 30 to' 000000
0001 'is output. Here, the code valid bit output 29 indicates whether the data output from the chain code output 30 is valid or invalid, that is, the node with the node number output from the node number data output 26 has a code number It indicates whether or not it is attached. Here, this code valid bit output 29 is'
Since it is 1 ', the data output from the chain code data output 30 is valid, but the data output from the chain code output 30 is not used as the code number to be obtained here. The data “0001” output from the node number data output 26 is input to the node number setting circuit 22.

Next, the text data input terminals TD0, T
When the data '01' of the text T1 is input to D1,
Since the output of the node number setting circuit 22 is the value "0001" from the previous search result of the text T0, the input of the match detection circuit unit 20 is "010001" this time. The match in this pattern is the node number (4) in which the text T1 is arranged (see FIG. 1). As a result, the output of the match detection circuit 21 corresponding to the node number (4) becomes "1", and the fourth row from the bottom of the encoding circuit section 25 becomes active. Therefore, the code valid bit output is "1" and the chain code data output is "000".
0000100 ', and finally this chain code is obtained as a code number. At this time, node number data "0100" is obtained at the same time, but this is not used here.

As described above, by referring to both the input data and the node number, even when a large number of branches are branched from each node, high-speed search and match comparison are performed, and eventually the code is Speeding up is realized. here,
It is desirable that the match detection circuit unit 20 be configured so that only the output of the match detection circuit 21 in one row is always “1” for each search data. If this is not realized,
When the outputs of the plurality of coincidence detection circuits 21 are simultaneously set to 1 ', the method of determining the data in the encoding circuit unit 25 becomes complicated. Of course, it is also possible to allow the outputs of the plurality of coincidence detection circuits 21 to be "1" at the same time, and to configure the hardware so that the plurality of outputs that simultaneously become "1" are sequentially output one by one. However, the hardware cost can be reduced by devising the method of creating the tree-structured data so that only one output is '1' at the same time.

FIG. 3 is a circuit diagram showing a part of the encoding device shown in FIG. 2, and FIG. 4 is a circuit diagram further embodying the circuit shown in FIG. These FIGS. 3 and 4 show '110
For the input data of 111 '(text data' 11 'and output from the node number setting circuit 22 is'0111'), the output of the match detection circuit 21 is' 1 '.
6 is a circuit diagram corresponding to the node number (12) of FIG.

As shown in FIG. 4, the match detection circuit section 20
Is a match detection circuit 21 and seven transistors Tr1, Tr2, Tr3, Tr4 connected in series with each other.
It is composed of a number of coincidence comparison circuits 201 composed of Tr5, Tr6; Tr11, and these seven transistors Tr1, Tr2, Tr3, Tr4, Tr5, Tr6;
6 transistors of Tr11, Tr1, Tr2, T
Data line D is provided to each gate of r3, Tr4, Tr5, Tr6.
L1, DL2, DL3, DL4, DL5, DL6 and data bar lines DBL1, DBL2, DBL3, DBL
Any one of 4, DBL5 and DBL6 is connected.
Further, a precharging transistor Tr10 is provided, and the transistor Tr10 is a P-channel transistor for precharging the potential at the point A. The transistor Tr11 is an N-channel transistor provided between the transistor Tr1 and the ground line, and suppresses discharge of the potential at the point A during precharge. The coincidence detection circuit 21 is composed of an inverter 20 'and a feedback P-channel transistor Tr12.

In the encoding circuit section 25, the output of the inverter 20 'is the memory transistors MTr1 and MTr.
2, the gates of MTr3 and MTr4 are connected.
These memory transistors MTr1, MTr2, MTr
One of the data output lines DOL3, DO
The other of L4, DOL5, and DOL6 is connected to the ground line.

Further, the respective data output lines DOL1, ...
, DOL15 has precharge channel transistors Tr1, ..., PTr15 at one end, and an inverter 21 'and a feedback P-channel transistor Tr13 at the other end. First, the precharge control terminal 31 for initialization is set to '
When 0'is applied, the potential at the point A is set to '1'.
Along with this, the output of the coincidence detection circuit 21, which is the inverter output of the point A potential, becomes "0". When the output of the coincidence detection circuit 21 becomes "0", the memory transistors MTr1, MTr2, MTr3, MTr4 are turned off, and when "0" is applied to the precharge control terminal 31, the precharge P The channel transistors PTr1, ..., PTr15 are turned on, the data output lines DOL1, ..., DOL15 maintain the state of "1", and the output of the inverter 21 ', which is the inverter output thereof, maintains the state of "0". At this time, the code valid bit output also outputs "0". By this signal output, it can be known that the output of the chain code data is invalid data.

Then, the text data input terminals TD0,
When desired input data is applied from TD1 and the output from the node number setting circuit 22 is determined, and then "1" is applied to the precharge control terminal 31, the search state is entered. By repeating the initialization state and the search state in synchronization with the application of each input data, a desired chain code data, that is, a code number can be obtained.

Although the above is one embodiment of the present invention, the tree structure data stored in this encoding device does not necessarily have to be of one type, and a plurality of tree structure data may be included at the same time. However, even in this case, in principle, it is desirable that the node numbers given to the respective nodes of the respective tree structures are different from each other across all the nodes of all the tree structures.

The coincidence comparison circuit 201 shown in FIG. 4 is standardly pre-fabricated in a large number, and has a transistor Tr.
The gate 11 of 11 is connected to the precharge control terminal 31, and each of the six transistors Tr1, Tr2, Tr3, T
The gates of r4, Tr5 and Tr6 are connected to the data lines DL.
1, DL2, DL3, DL4, DL5, DL6 or each data bar line DBL1, DBL2, DBL3, DBL
It is connected to any one of 4, DBL5 and DBL6. Six transistors Tr of each match comparison circuit 201
1, Tr2, Tr3, Tr4, Tr5, Tr6 are connected to the data lines DL1, DL2, DL3, DL4, DL5, respectively.
Connect to DL6 or data bar lines DBL1, D
Depending on whether it is connected to BL2, DBL3, DBL4, DBL5, DBL6, the bit pattern determined by the input text data and the node number set in the node number setting circuit 22 and the input side of the inverter 20 'are discharged. The coincidence comparison circuit 201 in which the output of the inverter 20 'becomes active (H level)
Correspondence with is defined.

Here, as described above, since a large number of match comparison circuits 201 as shown in FIG. 4 are standardly built in advance, depending on the scale of the search system (tree structure) configured therein, In some cases, some match comparison circuits 201 may be left over. In this case, the excess match comparison circuit 2
01 transistors Tr1, Tr2, Tr3, Tr4
The gates of Tr5 and Tr6 are appropriately connected to the bit lines DL1 and DL.
2, DL3, DL4, DL5, DL6 or bit bar lines DBL1, DBL2, DBL3, DBL4, DBL
5, if it is connected to DBL6, the inverter 20 'of the coincidence comparison circuit 201 inadvertently outputs an H level signal, which is not preferable. On the other hand, the transistor Tr1,
The gates of Tr2, Tr3, Tr4, Tr5, Tr6 are connected to the bit lines DL1, DL2, DL3, DL4, DL5, DL.
6 also has bit bar lines DBL1, DBL2, DBL3, D
If it is left floating without being connected to BL4, DBL5, and DBL6, the potential on the input side of the inverter 20 ′ is not stably and uniquely determined when the transistor Tr11 becomes conductive, and the operation is unsuccessful. It may be stable.

FIG. 5 is a diagram showing a coincidence comparison circuit provided with this measure. In FIG. 5A, the gate of the transistor Tr11 is connected to the ground, and in FIG. 5B, the gate of the transistor Tr6 is connected to the ground. In this way, the seven transistors Tr1, Tr2, Tr3, Tr4, Tr5, Tr6, T connected in series are connected.
By ensuring that the gate of at least one transistor of r11 is connected to ground and held in a non-conducting state, the precharged charge on the input side of the inverter 20 'will not be discharged and thus the inverter 20'. The output of is always stably maintained at the L level (inactive).

Although a NAND type dynamic decoder in which transistors are connected in series and which consumes relatively little power has been described as an example of the coincidence comparison circuit, the encoding device of the present invention does not necessarily have this structure. The circuit configuration is not limited, and may be a general associative memory type circuit configuration. Next, an example in which the same node number is assigned to a plurality of nodes will be described.

FIG. 6 is a diagram showing a data structure (tree structure) according to another embodiment of the present invention. The difference from the data structure (tree structure) shown in FIG. 1 is that the branch extending from the node of the node number (6) where the text T0 is arranged and the text T2.
The only difference is that the data of the branch point extending from the node having the node number (7) in which is allocated is different. However, the same code number C11 as the code number C11 given to the node having the node number (11) is given to the node having the node number (13).

That is, in this tree structure, the same text is provided at the tip of the node having the node number (2) in which the text T1 is arranged and branched to the node having the node number (6) and the node having the node number (7). Two nodes (a node having a node number (11) and a node having a node number (13)) to which T1 is arranged and to which the same code number C11 is attached are arranged. In such a case, a more compact structure can be achieved by changing the data structure (tree structure) as follows.

FIG. 7 is a diagram showing a changed data structure (tree structure). In the tree structure shown in FIG. 7, instead of the node of the node number (13) shown in FIG. 6 where the text T1 is arranged and the code number C11 is attached, the node number (6 ), The node number of the node of (7)
The node number is changed to the same node number (7) as that of the node No., and this node and the node of the node number (11) where the text T1 is arranged are connected by a branch. in this way,
The same text T1 is arranged and the same code number C11
The number of nodes can be reduced by combining the nodes marked with.

FIG. 8 is a diagram showing an example of an encoding device in which the tree structure database shown in FIG. 7 is implemented as hardware. The difference between the circuit shown in FIG. 8 and the circuit shown in FIG. 1 is that there is no node number 10 and node number 12 and that the node number (6) shown in FIG. 1 is rewritten as (7). Regarding the point, there is no change in the substance of the circuit structure), and the white circle 27a is added to the circuit shown in FIG.

As described above, instead of hardware of the tree structure shown in FIG. 6 as it is, a tree structure in which the same text T1 is arranged and the nodes having the same code number C11 are gathered into one (see FIG. By configuring 7), equivalent functions can be realized with a small-scale circuit configuration. In this embodiment, the text data has been described as an example, but it goes without saying that this may be any other data.

[0046]

As described above, the coding method and the coding apparatus of the present invention are configured to determine the node to be advanced to next by referring to the node number together with the input text. Therefore, it is not necessary to perform successive comparison as in the conventional case, and even in the case of a tree structure in which a large number of branches branch from one node, it is possible to proceed to the next node with one search operation. The code number (chain code data) can be obtained extremely quickly.

[Brief description of drawings]

FIG. 1 is a data structure (tree structure) according to an embodiment of the present invention.
It is the figure which showed.

FIG. 2 is a diagram illustrating an example of an encoding device in which a tree structure database is implemented as hardware.

FIG. 3 is a circuit diagram showing a part of the encoding device shown in FIG.

FIG. 4 is a circuit diagram in which the circuit shown in FIG. 3 is further embodied.

FIG. 5 is a diagram showing an unused coincidence comparison circuit.

FIG. 6 is a diagram showing a data structure (tree structure) according to another embodiment of the present invention.

FIG. 7 is a diagram showing a changed data structure (tree structure).

8 is a diagram illustrating an example of an encoding device in which the tree-structure database illustrated in FIG. 7 is implemented as hardware.

FIG. 9 is a diagram showing an example of text arranged in a tree structure.

[Explanation of symbols]

 20 Match Detection Circuit Section 21 Match Detection Circuit 22 Node Number Setting Circuit 25 Encoding Circuit Section 26 Node Number Data Output 29 Code Valid Bit Output 30 Chain Code Data Output 201 Match Comparison Circuit

[Procedure amendment]

[Submission date] April 20, 1993

[Procedure Amendment 1]

[Document name to be amended] Statement

[Name of item to be corrected] 0003

[Correction method] Change

[Correction content]

[0003]

[Table 1]

[Procedure Amendment 2]

[Document name to be amended] Statement

[Correction target item name] 0004

[Correction method] Change

[Correction content]

[0004]

[Table 2] In Table 1, each text T0, T1, T2, T3 is identified with each text T0, T1, T2, T3.
Table 2 is a correspondence table with a text code consisting of bits.
Is a correspondence table of a text chain in which texts are arranged and code numbers attached to the text chain. The 10-bit chain code is a code number represented by a binary code.

Claims (5)

[Claims] 1. A plurality of texts are arranged at each node of a tree structure allowing reappearance, a code number is given to each node as needed, and the text exists at a destination after tracing a branch of the tree structure. In the encoding method for converting the text chain in which the texts are arranged in the order along the traced path into the code number by obtaining the code number assigned to the node, the node number is assigned to each node of the tree structure. Note that, when the text is input, a node to be advanced to the next is obtained based on the input text and the node number of the node currently located. 2. The encoding method according to claim 1, wherein different nodes are assigned to the respective nodes of the tree structure. 3. The encoding method according to claim 1, wherein when there are a plurality of nodes whose branches extend to the same node on the leading end side, the same node number is assigned to the plurality of nodes. 4. A plurality of texts are arranged at each node of a tree structure allowing re-appearance, a code number is given to each node as necessary, and the text exists at the end of the branch of the tree structure. By finding the code number attached to the node,
In a coding device for converting a text chain, in which the texts are arranged in a sequence along a traced path, into code numbers, a text input unit for inputting the texts, and a latch for latching node numbers assigned to the respective nodes A node number input section having a circuit for inputting the node number latched in the latch circuit, and based on the input text and the node number, coincides with a node defined by the input text and the node number A coincidence detection circuit section including a coincidence detection section for detecting a node, and a node number output section for outputting the node number attached to the node detected by the coincidence detection section and inputting it to the latch circuit; Code number that outputs the code number when the code number is attached to the node detected by the match detection unit An encoding device comprising an encoding circuit unit having an output unit. 5. A large number of coincidence comparison circuits, wherein the coincidence detection unit has a buffer or an inverter and a plurality of transistors connected in series with each other between an input side of the buffer or the inverter and a ground, and the large number of coincidence comparison circuits. Match comparator circuit has a precharge circuit that charges the input side of each buffer or inverter prior to the search of the next node, and different bits determined by the combination of the different text and the different node number In order to discharge the input side of the buffer or the inverter of any one of the match comparison circuits by any one of the bit patterns of the patterns, other than some match comparison circuits of the plurality of match comparison circuits, The gate of the transistor of the match comparison circuit is connected to the text input section. And the node number input section, and at least one transistor of each of the transistors forming the part of the match comparison circuit is turned off. 5. The encoding device according to claim 4, wherein the at least one transistor gate is connected to a power supply or a ground.