| 摘要 |
PROBLEM TO BE SOLVED: To reduce memory for storing font data of hieroglyphic characters and related data. SOLUTION: By using character codes presenting hieroglyphic character fonts, it is possible to discriminate an address 8 in a variable length coded data stream of the pixel data of all the related fonts of the corresponding characters. This access is executed by two-levels table search. In the 1st table level, a table 1 returns a 1st offset Huff Off in the coded data stream, an average size AvSv of the character data, and pointer TB20ff to a table 2, the 2nd table. Next, an estimated value of an address generated from the information in the table 1 is corrected by searching an error value Err by searching the 2nd table, and using the error value Err and the position N where a value in the table 2, the 2nd table, coincides with the error value. The pixel bitmap of the hieroglyphic character is divided into plural small tiles, and a code is allotted to each of these tiles. These tile codes are Huffman-coded, and thereby pixel bitmap font data are efficiently compressed. |
