JPS58223177A - Graphic japanese character pattern generator - Google Patents

Abstract

(57) [Abstract] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] Technical Field of the Invention The present invention relates to a kanji pattern generation device used in a kanji processing terminal, a kanji printer, etc. The present invention relates to a kanji pattern generator for efficiently extracting kanji patterns.

Technical background Most of the kanji display terminals or kanji printers used in modern kanji data processing equipment are
It is of a dot type and is equipped with a Kanji pattern generator CG or a Kanji pattern memory to convert the Kanji code output from the processing device into a Kanji dot pattern.

Normally, the types of Kanji used in Kanji data processing are about 44 to 64 characters, but in order to be able to handle special data such as personal names, about 10,000 to 20,000 characters are required. Also, the pattern for one character is 14X14
Alternatively, since it is composed of 24×24 dots, the storage capacity is as large as IOM or 20 Mbits. Preparing all of these in ROM or RAM poses a problem in terms of cost, and if an external memory such as a floppy disk is used, there is a problem in that the processing speed becomes slow.

OBJECTS AND STRUCTURE OF THE INVENTION An object of the present invention is to provide an economical kanji pattern generator that is capable of high-speed processing. It is managed in a hierarchical structure so that the nokturns of kanji that are used frequently are always arranged in the internal memory.

As a specific configuration for this purpose, the present invention includes, in a kanji output device, an external storage device that stores a kanji pattern table referenced by a kanji code, and a plurality of kanji patterns selected from the kanji pattern table. An internal storage device managed by a cell number, and a kanji pattern referenced by a kanji code corresponding to the kanji pattern table to determine whether or not the kanji pattern is stored in the internal storage device for each kanji pattern in the table. If so, a kanji code management table that holds the cell number, a means for managing the access information for each kanji code in the kyō kanji code management table, and a means for managing the access information for each kanji code in the kyō kanji code management table; The present invention is characterized in that it includes a means for replacing the current kanji pattern with another appropriate kanji pattern.

Embodiments of the Invention First, the basic configuration of an embodiment of the invention will be explained with reference to FIG.

In the figure, 1 is an external storage device that holds a kanji butter/table 2 containing kanji patterns for all kanji codes available in the system.

Reference numeral 3 denotes an internal storage device that stores only a certain number of frequently used kanji patterns, and each kanji pattern is access-controlled not by a kanji code but by a cell number.

4 is a kanji code management table, and as shown enlarged in 4a, each kanji code of the input data is stored in the internal storage device R3.
It converts into a cell number for the corresponding Kanji pattern position, and records the number of accesses to that Kanji pattern. Note that the kanji code management table 4 is created in one-to-one correspondence with the kanji pattern table 2. Therefore, no cell number is assigned to a kanji code for which a kanji pattern is not placed in the internal storage device 3.

A kanji total access counter 5 counts the total number of accesses to the kanji code management table 4 and provides reference data for evaluating access circuits for each kanji code in terms of usage rate.

Reference numeral 6 indicates an empty cell string, and 7 indicates a cell request Kanji code string, which is used for cell management for replacing Kanji patterns arranged in the internal storage device 3 according to their usage rates.

In operation, when data is input in (■), the Kanji code management table 4 is referred to according to the Kanji code, and the Kanji pattern cell number is checked.

When a kanji pattern cell number is placed, the corresponding kanji pattern cell is stored in the internal storage device 3 as shown by ■.
Read from and output.

At this time, the usage rate is evaluated by adding 1 to the number of accesses. When the usage rate is below a certain reference value, the kanji pattern is returned from the internal storage device 3 to the external storage device, and the cell is registered in the empty cell column.

On the other hand, regarding input data, Kanji code tube! table 4
When the kanji pattern cell number is not found at the corresponding kanji code position, the corresponding kanji pattern is read out from the kanji pattern table 2 of the external storage device 1 and output as shown by ■.

At this time, as in the previous case, the access circuit is increased by +1 to evaluate the utilization rate, and if it is below a certain reference value, the kanji code is registered in the cell request kanji code string 7. If there is a punched cell in the empty cell column 6, the kanji pattern that successively follows from the kanji pattern table 2 is written in that cell, and the cell number is registered at the corresponding position in the kanji code management table 4.

Furthermore, the used empty cells and cell requested kanji codes are removed from the empty cell string 6 and the cell requested kanji code string, respectively. Note that there is a possibility that items that are not accessed due to an extremely low utilization rate remain in the internal storage device 3, but these can be checked at regular intervals and eliminated.

In this way, among the kanji patterns stored in the internal storage device 3, those with a low usage rate are dynamically replaced by those with a high usage rate, and the types of kanji patterns existing in the internal storage device 3 are is maintained at a high level of efficiency considering the latest utilization rate.

FIG. 2 is a system configuration diagram of the apparatus of this embodiment. In the same figure, reference numbers 1 to 7 correspond to the components shown in FIG. 1, 8 is a kanji pattern access control device,
Reference numeral 9 represents a control section, 10 a replacement algorithm processing section, 11 a data buffer, and 12 a drive buffer.

Output data as a result of processing by a kanji data processing device (not shown), such as a word processor, is input to a data buffer 11 . Note that the data buffer 11 may be replaced by another storage device. The kanji pattern access control device 8 is the main part that realizes the functions of the present invention explained in FIG.

Then, corresponding kanji patterns are successively retrieved from the internal storage device 3 or external storage device 1 and set in the drive buffer 12. In addition, the access count data for each kanji code in Table 4 and the kanji total access counter 5
According to the value of , the replacement algorithm processing unit 10
It determines whether or not the replacement is appropriate, and if necessary, controls the empty cell string 6 and cell requested kanji code string 7, and updates the kanji code management table 4 and internal storage device 3.

The kanji code management table 4, empty cell string 6, and cell request kanji code string 7 are placed on a suitable storage device.

The Kanji code management table 4 is accessed by the Kanji code of the input data, but necessary address conversion is performed depending on the location on the storage device. The empty cell string 6 and the cell request Kanji code string 7 can be made into a stack structure using pointers.

The replacement algorithm processing unit 1o calculates an appropriate reference value for determining the replacement of the kanji pattern at that time, according to the value of the kanji total access counter 5. During operation, this reference value is compared with the number of accesses for each Kanji code in the management table 4, and replacement is controlled based on the magnitude relationship. The above-mentioned replacement algorithm strongly depends on the cumulative number of past uses, but it also uses LRU (Least RRU) where the last light replaces the earliest one.
It is also possible to use the recentlyUsed) replacement algorithm, the first-in-f1rst-out method in which the oldest setting is replaced first, or the random replacement method, either alone or in combination. .

Effects of the Invention As described above, according to the present invention, it is possible to provide a highly efficient kanji output device that can handle a large number of character types at a low cost.

[Brief explanation of the drawing]

Figure 1 is a 3rd diagram of the basic development of the embodiment of the present invention, and Figure 2 is a 5th diagram.
)! , is a configuration diagram of an application device. In the figure, 1 is an external storage device, 2 is a kanji pattern table,
3 is the internal eye "", memory ogicho, 4 is Kanji code management-r-pull, 5 is Kanji total access counter, 6 is empty cell string, 7
displays the cell request kanji code string. Patent applicant: t±Tsu Co., Ltd. Representative Patent Attorney Fumihiro Hase (1 other person)

Claims (1)

[Claims] A kanji output device includes an external storage device that stores a kanji pattern table referenced by a kanji code, and a plurality of kanji patterns selected from the kanji pattern table that are managed by cell numbers. an internal storage device,
Corresponding to the above kanji pattern table, it is referenced by the kanji code, and for each kanji pattern in the table, whether or not the kanji pattern is stored in the internal storage device, and if so, its cell number is retained. a means for managing access information for each kanji code in the kanji code management table; and a means for managing access information for each kanji code in the kanji code management table; A kanji pattern generator characterized by having a means for replacing with .