JPH077393B2 - Kanji code conversion method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Outline] The present invention relates to a kanji code conversion system, and an object of the present invention is to reduce the memory capacity of a conversion table. The first kanji code of the first code system is used as an address in the second kanji code. In the kanji code conversion method for converting the first kanji code into the second kanji code based on the conversion table storing the second kanji code corresponding to the code system,
A combination conversion table in which the conversion tables of the respective specified sections of the plurality of sections obtained by dividing the first Kanji code group by the predetermined high-order bits of
A pointer table is provided which has areas corresponding to the respective divided areas, and the pointer values of the conversion tables of the respective areas in the combined conversion table are stored in the corresponding areas, and the first kanji code for which conversion is instructed. An address is calculated based on the high-order bit to search the pointer table, and based on the detected corresponding pointer value and an offset value in the corresponding section calculated by the low-order bits of the first Kanji code excluding the high-order bit. A conversion processing unit that searches the combination conversion table, generates the combination conversion table based on the specified predetermined upper bit and the section information to be combined, calculates the pointer value corresponding to each section, and outputs the pointer. A conversion table generating unit for storing the table, combining the conversion tables of a specified section The conversion table and the pointer table are generated, the address of the pointer table and the offset value are calculated based on the first Kanji code instructed to be converted, and the combined conversion is performed based on the obtained pointer value and the offset value. The table is searched and configured to be converted into the corresponding second kanji code.

[Industrial application field]

 The present invention relates to improvement of a kanji code conversion system.

JIS (Kanji) code is set as the Kanji code,
Due to the difference in processing method, each company has adopted its own code system based on JIS code.

Therefore, when a system combining models of different code systems is constructed, for example, when a Kanji code is exchanged between a host computer and a terminal of different models, the Kanji code conversion is performed on the host side.

In this Kanji code conversion, a conversion table that associates mutual Kanji codes is provided to perform the conversion process. Conventionally, a conversion table area is provided for all Kanji codes secured by the code system. However, if there is an unused area in a Kanji code that is not supported by the system or an undefined Kanji code,
There is a problem that the memory area for loading the conversion table is wasted.

Therefore, there is a demand for a kanji code conversion method that can reduce the amount of memory corresponding to the system.

[Conventional technology]

FIG. 4 is a diagram showing a memory map of Kanji code, and FIG. 5 is an explanatory diagram of a conventional Kanji code conversion system.

The Kanji code is composed of 2 bytes, and FIG. 4 shows the memory map with the upper 1 byte and the lower 1 byte of this Kanji code.

Among these, JIS code is JIS first level, JIS second level, JI
A code is set for non-Kanji characters and is represented by the area shown in FIG.

On the other hand, the Kanji code of Company A is provided with user-defined areas, extended non-Kanji, and extended Kanji in addition to the above JIS code.
The kanji code is represented by the EBCIDIC code, and the upper 1 bit of the upper byte and the lower byte of the EBCIDIC code is set to 1, respectively, and as a result, the area shown in FIG. 4 is obtained on the memory map.

Similarly, the Kanji code of company B is also set uniquely with due consideration in processing, and is allocated to a different area from that of company A as shown in FIG. 4, for example.

As described above, because of the convenience of processing, each company sets its own Kanji code, so when connecting different models, you must convert the Kanji code.

FIG. 5 shows a kanji code conversion method on the host side when the host of company A and the terminal of company B are connected.

Here, 13 is a Kanji code conversion table, which is a 2-byte data storing the Kanji code (second Kanji code) 10a of company B corresponding to the Kanji code (first Kanji code) 10 of company A as an address. Area is provided and has a table area for all of the Kanji code areas (for example, A414 to FEFE) secured by the company A, and is transferred to the main memory by the conversion program 12 for retrieval during conversion processing.

When the Kanji code 10a of Company B is transferred from the terminal, it is converted back to the Kanji code 10 of Company A by the reverse conversion table.

[Problems to be Solved by the Invention]

As described above, since the conventional kanji code conversion table has a 2-byte table area for each of the reserved kanji code areas, it is not used in the system such as extended kanji or user-defined characters. If there is a code area, for example, an area that is undefined at the second level, there is a problem that memory is wasted.

In view of the above problems, it is an object of the present invention to provide a Kanji code conversion method capable of flexibly dealing with the Kanji code supported by the system and reducing the memory amount of the conversion table.

[Means for Solving the Problems]

In order to achieve the above object, the Kanji code conversion system of the present invention has a first Kanji code group at a predetermined upper bit of the first Kanji code (10) as shown in the principle diagram of FIG. A combination of the conversion tables (4a) storing the second Kanji code (10a) corresponding to the first Kanji code (10) of each specified section among the plurality of divided sections A conversion table (3) and areas corresponding to the divided sections, respectively, and pointer tables (8) stored in the corresponding areas of the conversion table pointer values (50a) of the sections in the combined conversion table. ), And an address (51) is calculated based on the upper bits of the first Kanji code instructed to be converted, the pointer table (8) is searched, and the detected corresponding pointer value (50a) and the first Kanji Offset value of the corresponding ward calculated in the lower bits except for the upper bits of the over-de (50
a conversion processing unit (2) for searching the combination conversion table (3) based on (b), and generating the combination conversion table (3) based on the designated predetermined upper bit and the section information to be combined, And a conversion table generation unit (9) for calculating the pointer value (50b) corresponding to the section and storing it in the pointer table (8).

[Work]

The conversion table generation unit 9 is the first Kanji code to be converted.
All 10 areas are divided into a plurality of areas "districts" 20 based on the predetermined high-order bits of the specified first kanji code 10, and the conversion tables 4a of the specified divisions are combined to combine the conversion table 3 To create.

At the same time, the pointer value (hereinafter, pointer) 50a of the conversion table 4a of each section in the combined conversion table 3 is calculated and stored in a predetermined address area of the pointer table 8.

The pointer table 8 is provided with an area for storing a 2-byte pointer 50a for each section, and an address (pointer) 51 corresponding to the upper bit used for division is assigned to each area.

As described above, the combined conversion table 3 corresponding to the system is generated.

When converting the Kanji code based on the generated combined conversion table 3, the conversion processing unit 2 doubles the predetermined upper bit of the first Kanji code 10 instructed to be converted (since the pointer value is 2 bytes, ) To calculate the address 51 of the pointer table 8 and read the corresponding pointer 50a, and double the lower bits except the upper bit (since each area of the combined conversion table 3 is 2 bytes) to calculate the offset 50b. Then, the combination conversion table 3 is searched by the pointer 50a + the offset 50b + (the start address on the memory of the combination conversion table).

As described above, the conversion table of the unnecessary section is deleted to create the combined conversion table 3, and the address 51 of the pointer table storing the pointer 50a in the combined conversion table 3 of each section and the offset 50b are set to the first kanji. The second Kanji code 10a can be converted by calculating based on the code 10 and searching the combination conversion table 3.

〔Example〕

An embodiment of the present invention will be described in detail with reference to FIGS.

FIG. 1 is a principle diagram of the present invention, FIG. 2 is a search operation flowchart diagram, and FIG. 3 is a processing device block diagram of an embodiment.

In this embodiment, the upper 1 byte of the first kanji code 10 is 256
The following shows an example of division into wards.

FIG. 3 shows a kanji conversion processing part of a kanji code conversion processing device such as a host computer. In the figure, 2 is a conversion processing part (kanji conversion program), which is a main memory 5.
The above transmission data 6 (Kanji code to be converted) is converted into the second Kanji code 10a based on the conversion process described later,
What is stored in the main memory 5 as the conversion data 7. 3 is a combined conversion table in which the conversion tables 4a of the specified areas 2, 4, and n (area number) are combined and edited out of 256 areas. , Which is loaded and retrieved in the main memory 5 during conversion processing, 4 is a master conversion table, which stores the Kanji code conversion tables of all areas secured by the code system used in this processing device. 5 is a main memory, and the transmission data 6, the conversion data 7, the combined conversion table 3 and the pointer table 8 are loaded and used for conversion processing. 6 is the transmission composed of the first Kanji code 10. Data, 7 is conversion data obtained by converting the transmission data 6 into the second Kanji code 10a, which is transmitted to a terminal of a different model via a communication control unit (not shown), 8 is a pointer table , Which is filed together with the join conversion table 3 and transferred to the main memory 5 for reference during the conversion processing, and 9 is a conversion table generation unit which creates the connection conversion table 3 and the pointer table 8 by the generation processing described later. , 1 is a processor for controlling each unit.

The master conversion table 4 is equivalent to the conventional Kanji conversion table 13 shown in FIG. 5, and has 2 bytes each corresponding to the first Kanji code 10 as an address.
It stores the Kanji code 10a of and is provided as an external file.

Further, the pointer table 8 is provided with a 2-byte area for storing the pointer value 50a of the conversion table 4a for each section for each of the divided sections 1 to 256,
It has a total area of 256 x 2 bytes (actually, except for A1 to FE in the above-mentioned Kanji code example of company A, except for A1 to FE), and each area contains the upper 1 byte of the first Kanji code 10 to be converted. The doubled address (pointer) is allocated and searched.

The combination conversion table 3 is a combination of the conversion tables 4a of the designated sections and is edited.
Corresponding second kanji code of 2 bytes each for
An area for storing 10a is provided, the pointer 50a indicates the head address of the conversion table 4a of the section, and the inside of the section is addressed by the offset 50b obtained by doubling the lower byte of the first Kanji code 10.

The following processing is performed by the processing device having the above configuration.

(Combination Conversion Table Generation Processing) The numbers of the sections constituting the combination conversion table 3 are input from the operation unit or setting memory (not shown) at the time of various settings of the processing device,
Here, Ward 1, Ward 2 and Ward n are designated.

As a result, the conversion table generation unit 9 reads and combines the conversion tables 4a for the sections 1, 2 and n from the master conversion table 4 and calculates the pointers 50a of the sections in the combined conversion table 3 to calculate the pointer table 8 In the corresponding address area (value obtained by doubling the upper 1 byte).

The created pointer table 8 and the combined conversion table 3 are filed and incorporated in the system of the processing device.

(Kanji code conversion processing) The transmission data 6 transmitted to the terminal is transferred to the main memory 5, and the conversion processing unit 2 is notified of the conversion processing instruction.

The conversion processing unit 2 transfers the pointer table 8 and the combined conversion table 3 to the main memory 5, holds the notified start addresses of the respective load destinations, and converts the transmission data 6 as follows while sequentially reading the transmission data 6. Perform processing.

(1) The pointer table address [“aa” × 2 + start address of pointer table 8 in main memory] is calculated from the upper byte of the first kanji code (denoted as “aabb”), and stored in main memory 5. The pointer table 8 is searched and the pointer value (denoted as "eeff") is read.

(2) The offset [“bb × 2] is calculated from the lower 1 byte of the first Kanji code 10, and the [start address on the main memory of the combined conversion table 3+
“Eeff” + “bb” × 2] is used as an address to search the binding conversion table 3.

(3) As a result, "xxyy" is read as the corresponding second Kanji code 10a and is stored in the main memory 5 as the conversion data 7.

As described above, the division tables are divided into a plurality of divisions and the unused divisions are deleted, and the conversion tables 4a of the divisions are combined and edited, and the first kanji code 10 to be converted is used as the address of the pointer table 8 and the combined conversion table. By calculating the offset of the corresponding section in 3, the join conversion table 3 can be easily searched.

Therefore, since the conversion table corresponding to the system can be arbitrarily created and set, the memory amount for the conversion table can be significantly reduced.

In the embodiment, the conversion processing unit 9 searches for the pointer value 50a. However, if the application table that instructs the code conversion has the pointer table 8 and the kanji code and the pointer are passed to the conversion program, There is an advantage that the conversion table used by each application program can be managed.

〔The invention's effect〕

INDUSTRIAL APPLICABILITY According to the present invention, the kanji code is divided into a plurality of divisions, a conversion table in which unused divisions are deleted is created, and the conversion table can be searched. Therefore, it is possible to flexibly support the system. In addition to being able to do so, the amount of memory can be reduced, so that the cost reduction effect of the device is great.

[Brief description of drawings]

 FIG. 1 is a principle diagram of the present invention, FIG. 2 is a search operation flowchart diagram, FIG. 3 is a processing device block diagram of an embodiment, FIG. 4 is a diagram showing a memory map of Kanji code, and FIG. An explanatory diagram of the kanji code conversion method. In the figure, 1 is a processor, 2 is a conversion processing unit, 3 is a combined conversion table, 4 is a master conversion table, 4a is a conversion table of a section, 5 is a main memory, 6 is transmission data, 7 is conversion data, and 8 is a pointer. A table, 9 is a conversion table generation unit, 50a is a pointer value, a pointer, 50b is an offset value, an offset, 51 is a pointer table address, and 20 is a section.

Claims (1)

[Claims] 1. A first kanji code (1) of a first code system.
0) as an address and the corresponding second of the second code system
In the kanji code conversion method for converting the first kanji code into the second kanji code based on the conversion table storing the kanji code (10a) of the first kanji code, the first kanji code is determined by a predetermined upper bit of the first kanji code. A group conversion table (3) in which the conversion table (4a) of each specified section is combined among a plurality of sections (20) into which the group is divided, and an area corresponding to each of the divided sections. A pointer table (8) stored in the area corresponding to the pointer value (50a) of the conversion table for each section in the combined conversion table, and based on the upper bits of the conversion instruction first kanji code The address (51) is calculated and the pointer table (8) is searched, and the detected corresponding pointer value (50a) and the lower bit of the first Kanji code excluding the upper bit. In the offset value of the calculated appropriate ward (50
a conversion processing unit (2) for searching the combination conversion table (3) based on (b), and generating the combination conversion table (3) based on the designated predetermined upper bit and the section information to be combined, And a conversion table generation unit (9) for calculating the pointer value (50b) corresponding to the section and storing it in the pointer table (8), combining the conversion table (4a) of the specified section The binding conversion table (3) and the pointer table (8) are generated, and the address (5
1) which is instructed to convert 1) and the offset value (50b)
It is calculated based on the Kanji code (10), and the combined conversion table (3) is searched based on the obtained pointer value and the offset value and converted into the corresponding second Kanji code (10a). Kanji code conversion method.