JPS59184941A - Kanji code converting method - Google Patents

Abstract

PURPOSE:To reduce both the capacity of a conversion table as well as the arithmetic time by reading out the memory contents from a converting code table by means of one of two bytes of a KANJI (chinese character) code and adding said memory contents to the other byte of the KANJI code. CONSTITUTION:The KANJI code input JC of a 2-byte structure is supplied directly to an adder 30 with a lower one byte and to a conversion table 20 with an upper one byte respectively via an input register 10. The table 20 has the memory capacity corresponding to the number of patterns that can be obtained by the upper one byte, and each memory area stores each constant code corresponding to the input upper byte. An adder 30 adds the memory contents converted by the table 20 to the lower one byte of the KANJI code JC and applies the result of this addition to a pointer memory 2 in the form of an address signal CC. The memory 2 reads out the corresponding memory contents in accordance with the signal CC and delivers an address signal FA to a font memory 1. Thus the KANJI code becomes continuous, which reduces the arithmetic time.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a method for converting Kanji codes, and more particularly to a method for converting Kanji codes such as J-Ko-S Kanji codes into predetermined continuous codes.

The Japanese Industrial Standard (rxs) specifies graphic characters used in the notation of ordinary Japanese sentences based on predetermined codes. This code specifies special characters,
They are numbers, Roman letters, hiragana, katakana, Greek letters, Russian letters, and kanji, and most of them are kanji. As shown in Figure 1, this code (hereinafter referred to as JIS Kanji code) consists of 2 bytes, the upper 1 byte and the lower 1 byte.In particular, r 2121 (1
Hexadecimal representation" to r 2171n (hexadecimal representation)"・r
2221 (hexadecimal expression) to r 22711 (hexadecimal expression), ... r 71!21 (hexadecimal expression)” to “7F!711 (hexadecimal expression)” is the above J Engineering S Kanji code. This is the defined area (the shaded area in Figure 1).Other areas are undefined areas.In this way, in the JI8 Kanji code, for example, the next definition code for "217]l!" is r22.
21 J, and the codes from 21υ- to r2220J are undefined codes. Therefore, the J-Kanji S Kanji code is not a completely continuous code system.

In addition to this J-KS kanji code system, there is also a kanji code system that stipulates that the most significant bit of each byte in a 2-byte code is always set to "l", but in any case, Not all 2-byte codes are defined as a defined area (nor is there a complete continuous code system).

#iV 212H, the above-mentioned Han prison)" K
1112 graphic characters per 4HH have actual shape ((The memory contents of the font memory stored in the corresponding form Y
Shows one general configuration for producing Hk'r.

Since one character in the font memory l is composed of, for example, 24 x 24 bits or 32 x 32 bits, it usually requires a storage area of several to several tens of bits to store one character. Therefore, the various characters stored across multiple addresses (C) are n'fI!
When outputting, FC is the address signal FA indicating the first number jjlj4'7 of the valley-shaped character in the i-bay font memory l, and the fit occupied by one graphic character: ! Information indicating bet KY and VC
Based on this, the final address of the font memory IFc is calculated. In the pointer memory 2, the address signals FA, which do not indicate the top 1:c starting point, are stored in corresponding -r address areas corresponding to the manually entered continuous code aO.

Now, if the kanji code JO, which is not completely consecutive as described above, is to be input as an address signal to the pointer memory 2 and read out the stored contents corresponding to the address signal, then the pointer memory 2 must be stored in a manner corresponding to the kanji code, and an empty area corresponding to the undefined area is created in the storage area of the pointer memory 2.
The cost of the pointer memory 2 increases, and the impact on the cost of the device is also significant (depending on l).

Therefore, in general, after converting the discontinuous kanji code JC' (!l - a continuous code 00 based on a predetermined value) by some kanji code conversion means 3, the continuous code aa
By inputting data into the pointer memory 2, continuous storage is possible in the pointer memory 2, and the storage area is reduced.

Now, as such a Kanji code conversion means 3, two methods as shown below have conventionally been adopted.

(1) If the relationship between the input kanji code and the continuous code to be output is expressed numerically, then an operation equivalent to the function: a method of converting using a device (2) The input kanji code is A conversion table having separate storage areas corresponding to all possible patterns is adopted, and the kanji code is input as address 4a into the conversion table and the corresponding continuous code is read out. A method for reading the contents of memory.

However, the above method (1) is a code conversion method that lacks general versatility because it uses a dedicated arithmetic unit that corresponds to the functional expression of the 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.

Furthermore, the above method (2) has the disadvantage that the conversion table requires separate storage areas corresponding to all the patterns that the input Kanji code can take, requiring a large amount of storage area.

The present invention has been made in view of the above-mentioned circumstances, and an object thereof is to provide a Kanji code conversion method that eliminates the above-mentioned drawbacks by using a simple adder and a conversion table with a small storage capacity.

That is, the present invention reads the stored contents of a conversion table in which predetermined constant codes are stored at different addresses based on, for example, the upper byte of a kanji code composed of 2 bytes, and converts the stored contents and the lower order of the kanji code. By performing an addition operation with a byte, a continuous code to be added to a pointer memory as an address signal, for example, is obtained. This allows the storage capacity of the conversion table to be equivalent to the number of patterns that can be taken by the upper byte of the Kanji code.

Hereinafter, the Kanji code conversion method according to the present invention will be explained in detail with reference to the 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 Figure 3, the input kanji code JO is 2 bytes (・1
・Assume that Y is established. The input register 1o is a 2-byte register (:1q) corresponding to the kanji code JcK, and the lower 1 byte of the kanji code JO is assigned to the adder 3, O
K is output, and the upper 1 byte is output to the conversion table 2o. The conversion table 2° has storage areas corresponding to the number of possible patterns of the upper byte, and each storage area stores a different constant code corresponding to the upper byte to be input. Adder 3o&′! , the stored contents of the conversion table and the kanji code Jo via the input register 2o
The lower 1 byte of n is input and appropriate addition is performed.
The result of the addition is added to the above intermemory 2 as the address signal CO.

The pointer memory 2 then reads out the stored contents corresponding to the address signal cc and outputs it to the font memory l as the address signal FA for the font memory 1.

Next, the case where the embodiment shown in FIG. 1 is applied to :rxs@ character code conversion will be described in detail.

The J Engineering S kanji code is from 2121 (hexadecimal representation) to r71! Near E! (
The predetermined portion up to "Hexadecimal expression)" is the foot prosthesis area. Therefore, the conversion formula for converting this J Engineering 8 Kanji code into a continuous code starting from "0" is as follows.

N=(H-21)・51! l-1-(TJ-21)
......(1) In the above conversion formula, N is a continuous code, ■( is the upper byte of the J Engineering 8'l'l + character code, L is the lower byte of the J Engineering S rowing code, Above (1
) "21" and "5E" used in the formula are constants for expressing the same continuous code N in hexadecimal.

Based on this formula (1), the conversion table 20 and addition 37,
The conversion table 20 has the above (1↑).
)2 1st term (H-21)・5] 11 is at least 21≦
A total of q and 1 gamma values are input in the range of H≦7El.
It is stored in advance in separate address areas corresponding to the upper byte value of the IS Kanji code. Therefore, the storage capacity of the translation table requires at least 94 (decimal) words. According to the conventional conversion table reference method described above, the storage capacity of the conversion table is at least 8836 (9
4X94) word was needed.

Next, the adder 30 calculates the first term (H-21) of the above equation (1).
- Configure so that addition of 51C and the second term (L-21) is performed. For example, an addition q- with an initial value of r-21J is performed in advance, and the contents of the conversion table 20 are added to the lower pi)L of the J-engineer-S kanji code via the input register 10. do it.

With such a configuration, the JI Nichiyu character code is input to the adder 3 as a continuous code CC corresponding to (1) 2 above.
0, and the continuous code C0 is output from pointer memory 2.
added to.

Next, we will explain the embodiment of FIG.
The following describes the case where this is applied to the code method set in . The conversion formula for converting this Kanji code into a continuous code starting from "0" as described above is as follows.

N, -, (H-Al)・sg+(b-Ax)...
... (2) In the above conversion formula (2), N is a continuous code, H is the upper byte of the kanji code, L is the lower byte of the kanji code, and 1 used in the above formula (2)
' p, I J and "5E" are the same consecutive code N as 1
It is a digit for hexadecimal expression.

In other words, in this case, the conversion table 20 contains the above (2) substitution 1 term (i(-AI)・5E at least Al6) I≦
FI! ! The adder 30 stores the calculated value of Jγ in the range 1, . (You only need to complete 1.7.)

In addition, in the embodiment described above, the adder 3o has r-21, for example.
With the initial values of J, r-AIJ, the desired 7JI+
)'r- is performed, but the conversion table 20
Let the memory contents of r8+r′, I be a value including the initial value
'! Of course, it is also possible to do so.

In addition, in the embodiment described above, the continuous code to be output;
．． In order to make the code start from 1, constants such as the constant "21" in the above formula (1) or the constant "A1" in the above (2) 2 were used in the 1 variable j#L formula, but by changing the constant value, A continuous code starting from the desired number can be obtained. Of course, a continuous code starting from a predetermined value can also be obtained by using a conversion formula that excludes the constant value. In this case, it is no longer necessary to provide the adder 30 with an initial value corresponding to the constant value, and the adder 30
0 can be simple.

Furthermore, it goes without saying that the continuous character code to which this invention is applied is not limited to the above-mentioned JIS Kanji code, etc., but may be any other line/single character code system.

As explained above, according to the kanji code conversion method according to the present invention, (1) The storage area of the conversion table can be significantly reduced by simple groove formation.

(2) Since the calculation is only a simple addition, the calculation time is b''
--Decrease.

etc. to wither the excellent effects.

[Brief explanation of the drawing]

Figure 1 shows the code system of the JIS Kanji code, Figure 2
The figure is a block diagram showing an example of a general groove configuration for reading out a font memory, and FIG. 3 is a block diagram showing an embodiment of the Kanji code conversion method according to the present invention.

Claims (1)

[Claims] In a kanji code conversion method for converting a 2-byte kanji code into a predetermined continuous code, the storage contents of a conversion table in which the predetermined code to be converted is stored are read based on one byte of the kanji code; A kanji code conversion method, wherein the continuous code is obtained by adding the content and the other byte of the kanji code.