JPH0516605B2 - - Google Patents

Description

[Detailed description of the invention]

This invention relates to a kanji code conversion method, particularly
This invention relates to a method of converting a kanji code such as a JIS kanji code into a predetermined continuous code. The Japanese Industrial Standards (JIS) specifies graphic characters used to express ordinary Japanese sentences based on predetermined codes. This code specifies special characters, numbers, Roman characters, hiragana, katakana, Greek characters, Russian characters, and kanji, most of which are kanji. As shown in Figure 1, this code (hereinafter referred to as JIS Kanji code) consists of 2 bytes, 1 byte at the top and 1 byte at the bottom.
Especially in these 2 bytes, "2121 (hexadecimal expression)" to "217E (hexadecimal expression)", "2221 (hexadecimal expression) to "227E (hexadecimal expression)"......"7E21 (hexadecimal expression)""7E7E (hexadecimal representation)" is the defined area of the above JIS Kanji code (shaded area in Figure 1).Other areas are undefined areas.In this way, for example, "217E" in the JIS Kanji code The next defined code after `` is 2221'', and the codes from ``217F'' to ``2220'' are undefined codes.Therefore, the JIS Kanji code is not a completely continuous code system. In addition to this JIS Kanji code system,
There are some Kanji code systems that specify that the most significant bit of each byte in a 2-byte code is always set to "1," but in any case, not all 2-byte codes are defined as a defined area; It has not yet become a continuous chord system. FIG. 2 shows a general configuration for reading out the contents of a font memory in which the above-mentioned graphic characters are stored in a form corresponding to their actual shape based on the above-mentioned Kanji code. Since one character in the font memory 1 is composed of, for example, 24.times.24 bits or 32.times.32 bits, a storage area of several to several tens of addresses is usually required to store one character. Therefore, when reading out various characters stored across multiple addresses in this way, an address signal indicating the first address of each graphic character in the font memory 1 is generally used.
Information indicating the storage capacity occupied by FA and one graphic character
The address finally added to font memory 1 is calculated based on KY. In the pointer memory 2, the address signal FA indicating the start address is stored in corresponding address areas corresponding to the input continuous code CC. Now, as mentioned above, if the kanji code JC, which is not completely consecutive, is to be input as an address signal to the pointer memory 2, and the stored contents corresponding to the address signal are read out,
The storage format of the pointer memory 2 must correspond to the kanji code, and an empty area corresponding to the undefined area is created in the storage area of the pointer memory 2. In such a case,
The cost of the pointer memory 2 increases, and the influence on the cost of the device also increases. Therefore, generally, after converting the discontinuous kanji code JC into a continuous code CC based on a predetermined value by some kanji code conversion means 3, the continuous code CC is input into the pointer memory 2. Therefore, a method is adopted to enable continuous storage in the pointer memory 2 and to reduce the storage area. Now, when converting kanji code like this,
First, it is necessary to identify whether or not the input kanji code is within the defined area.Normally, the above 2-byte code is divided into 1-byte units, and each byte is designated as an upper limit value and a lower limit value. The above identification was made by comparison. In short, the comparison operation was performed four times. After this identification, the above-mentioned Kanji code is converted into a continuous code. Conventionally, the following two methods have been used. (1) When the relationship between the input kanji code and the continuous code to be output is expressed as a function, a method of converting using an arithmetic unit equivalent to the function. (2) Adopting a conversion table having separate storage areas corresponding to all possible patterns of the input kanji code, inputting the kanji code as an address signal to the conversion table and reading the corresponding continuous code; A method of reading the stored contents of a pointer memory, for example, using the continuous code. However, method (1) above is a code conversion method that lacks general versatility because it uses a dedicated arithmetic unit that corresponds to the relational expression between input code and output code, and the above relational expression is generally complex. This method requires a complicated arithmetic unit, which has disadvantages such as an increase in calculation time. In addition, the above method (2) requires a separate storage area for each of the possible patterns of the input kanji code for the conversion table, which has the disadvantage of requiring a large amount of storage area. The present invention has been made in view of the above-mentioned circumstances, and it is an object of the present invention to provide a Kanji code conversion method that eliminates the above-mentioned drawbacks by using two conversion tables of small storage capacity and an adder. That is, the present invention reads out the stored contents of a first conversion table in which predetermined constant codes are stored at different addresses based on the upper byte of a 2-byte kanji code, and reads out the contents of a first conversion table in which predetermined constant codes are stored at different addresses based on the upper byte of a kanji code consisting of 2 bytes. After reading the storage contents of the second conversion table in which predetermined constant codes are stored at different addresses based on the following, the storage contents of the first conversion table and the second conversion table are read out. For example, an address signal to be added to the pointer memory is obtained as a continuous code by one addition operation. As a result, the above 2
The total storage capacity of the two conversion tables may be at least equivalent to the sum of the number of patterns that can be taken by the upper byte of the Kanji code and the number of patterns that can be taken by the lower byte of the Kanji code. Note that the stored contents of the first and second conversion tables are changed to constant codes so that the signs of the continuous codes to be outputted are different positive/negative signs corresponding to the difference between defined/undefined of the kanji code. By setting, for example, the code bit of the continuous code, it is possible to immediately identify whether the input Kanji code is a defined code or not. DESCRIPTION OF THE PREFERRED EMBODIMENTS The kanji code conversion method according to the present invention will be described in detail below with reference to embodiments shown in the accompanying drawings. FIG. 3 shows an example of a configuration for implementing the kanji code conversion method according to the present invention. In FIG. 3, it is assumed that the input kanji code JC has a 2-byte structure. The input register 10 has a 2-byte register configuration corresponding to the Kanji code JC, and the upper byte of the Kanji code JC is output to the upper byte conversion table 20, and the lower byte is output to the lower byte conversion table 30. The upper byte conversion table 20 has storage areas corresponding to at least the number of possible patterns of the upper byte, and each storage area stores a different constant code corresponding to the input upper byte. . The lower byte conversion table 30 has storage areas corresponding to at least the number of possible patterns of the lower 1 byte, and each storage area stores a different constant code corresponding to the input lower byte. There is. The stored contents of these conversion tables 20 and 30 will be explained in detail later. The adder 40 receives the stored contents of the upper byte conversion table 20 and the lower byte conversion table 40, performs an addition operation, and adds the addition result to the output register 50. The output register 50 has the number of bits corresponding to the continuous code output from the adder 40, and adds the continuous code CC to the pointer memory 2 shown in FIG. 2 as, for example, an address signal. In addition, in this embodiment, by appropriately setting the storage contents of the conversion tables 20 and 30, when the input kanji code JC is a definition code, the output continuous code CC will be a code with a zero or positive sign, and the input kanji code JC will be a code with a positive sign. If the kanji code JC is an undefined code, the output continuous code CC will be a code with a negative sign. By searching, for example, the sign bit of the code output from the adder 40 by the sign identifying means 60, it is determined whether the input Kanji code JC is defined or undefined. Next, the case where the embodiment shown in FIG. 3 is applied to conversion of JIS Kanji code will be described in detail. As shown in Figure 1, the JIS kanji code is from ``2121 (hexadecimal expression)'' to ``7E7E (hexadecimal expression)'' in 2 bytes.
The predetermined portion up to is the defined area. Therefore,
The conversion formula for converting this JIS Kanji code into continuous codes starting from "0" is as follows. N=(H-21)・5E+(L-21)...(1) In the above conversion formula, N is a continuous code,
H is the upper byte of the JIS Kanji code, L is the lower byte of the JIS Kanji code, and "21" and "5E" used in the above formula (1) are hexadecimal representations of constants. Based on this formula (1), the upper byte conversion table 20
and a constant code to be stored in the lower byte conversion table 30. The upper byte conversion table 20 contains the first term (H-21) and 5E of the above equation (1) as 21≦H.
Calculated values calculated in the range ≦7E are stored in advance in separate address areas corresponding to the upper byte value of the input JIS Kanji code. Similarly, in the lower byte conversion table 30, the second term (L-21) of the above equation (1) is written as 21
The calculated value calculated within the range of ≦L≦7E is input.
It is stored in advance in separate address areas corresponding to the lower byte value of the JIS Kanji code. The table below shows an example of the storage contents of the upper byte conversion table 20 and the lower byte conversion table 30.

【table】

Claims (1)

[Scope of Claims] 1. In a kanji code conversion device that converts a 2-byte kanji code including a defined code and an undefined code into a continuous code, the lower byte of the kanji code is set as an input address, and the lower byte of the kanji code is The kanji code for converting the kanji code into a continuous code for a storage area having a number of storage areas corresponding to the number of possible patterns, and having an address whose lower byte is a definition code. A lower byte conversion table in which conversion codes related to lower bytes are respectively stored and outputs a conversion code corresponding to an input address, and a lower byte conversion table that corresponds to the number of patterns that the upper byte of the kanji code can take when the upper byte of the kanji code is the input address. A conversion code regarding the upper byte of the kanji code for converting the kanji code into a continuous code for a storage area having an address where the upper byte of the storage area is a definition code. The upper byte conversion table that is stored and outputs the conversion code corresponding to the input address, and each conversion code output from the lower and upper byte conversion tables are added, and a continuous code of either positive or negative polarity is obtained. an addition means for outputting; and a storage area having an address where the lower byte of the kanji code is an undefined code and the upper byte of the kanji code is an undefined code among the storage areas of the lower and upper byte conversion tables. Predetermined numeric data that, for a storage area having an address that is an undefined code, causes the polarity of the addition result of the addition means when the kanji code is an undefined code to be different from the polarity when the kanji code is a defined code. and determining means for determining whether the input kanji code is a defined code or an undefined code by determining the positive or negative polarity of the output of the adding means, respectively. A kanji code conversion device featuring: