JPH04103370A - Storing method of character dot pattern data - Google Patents

Abstract

PURPOSE:To make a memory capacity necessary for storing character pattern small by storing the character pattern in such a manner that printing is not performed up to certain dots laterally from a corner of one character area and printing is performed for next certain dots. CONSTITUTION:In the first data 6F, 6 and F is a hexadecimal notation of 4-bit unit. If this is expressed by binary 8 bits, it will be 01101111. As the first bit is O, a continuation of non-printing is indicated. The consecutive number represents that the non-printing will continue for 111 dots as the number of remaining 7 bits indicates 111. The numeral 83 represents that printing will continue for 3 dots with 10000011. The numeral 1B expresses that non-printing will continue for 27 dots with 00011011. An area occupied by 1 character on a memory varies at every character and it will be inconvenient to read out a data for 1 character from character code. Therefore, an index area is provided in the memory so as to stored previously a correspondence table of character codes and character storing areas.

Description

[Detailed description of the invention] [Industrial application field]

The present invention relates to a method for storing bitmap character data.

[Conventional technology]

When printing characters on a computer, a font memory that stores the dot pattern of each character is used, and on this font memory, the character pattern at the location corresponding to the character code is extracted and printed as a 0 character pattern. teeth,
Since it is possible to use 1 and 0 to identify whether or not to print on a dot on a matrix of dots arranged in a constant number of rows and columns, it is possible to control each dot with one bit of data, and the character pattern can be As shown in Figure 2,
Created using the dot matrix data of that character,
Store the dot matrix data of all created characters in the font memory. Now, if we calculate the number of memory bits of the character constituent bit matrix for one character, for example, for a character represented by a matrix of 32x48 dots as shown in Figure 2, 32x48 = 1536 bits per character. In order to store the dot pattern data of a large number of characters, a large capacity memory was required.

[Problem to be solved by the invention]

The present invention provides for storing character dot pattern data.
The purpose is to avoid requiring too large a storage capacity.

[Means to solve the problem]

For example, 8 is the method of storing character data in font memory.
Displaying information on whether or not to print on the first 1 bit out of 8 bits, with bits as 1 unit, and storing the number of consecutive dots with the same information regarding whether or not to print on the remaining 7 bits, A dot map of a character pattern is displayed by combining the above 8-bit print data.

[For use]

When the dot pattern of a character is scanned horizontally or vertically, there will be a number of dots that are not printed, followed by a number of dots that will be printed. Therefore, 1 of 1 character area
It is possible to store a character pattern in the form of printing the next number of dots without printing the number of dots from the corner to the side. For this reason, for example, in units of 8 bits, the first bit of 0.1 indicates whether to print or not, and the remaining 7 bits indicate the number of consecutive dots to print or not to print. Dot patterns can be memorized.

【Example】

FIG. 1 shows an embodiment of the present invention. In Figure 1, A
B is an example stored in the font memory when there are 19 consecutive printed dots in the dot scanning direction, and B is an example when there are 76 consecutive non-printed dots. When the character pattern of 0 and 1 shown in FIG. 2 is displayed as 8-dot data using this method, it becomes as shown in Table 1. For example, for the first data 6F, 6 and F are 4-bit units, or 1
Since this is expressed in hexadecimal notation, if this is expressed as 8 bits in binary, it becomes 01101111, and since the first bit is O, it indicates a series of no prints, and the number of consecutive numbers is 111 in the remaining 7 bits. This means that there are 111 consecutive no-print dots. Below, 83 is 100
00011 indicates that 3 dots are printed consecutively, and IB
indicates that 00011011 is 27 consecutive dots without printing. In this method, the area occupied by one character on the memory differs for each character, making it troublesome to read the data of one character from the character code. . Therefore, memory has
In the example shown in Table 1, where an index area is provided and a correspondence table is stored between the code of each character and the storage location of that character (the starting address of the storage area for that character and the number of exclusive bytes), 0C00 is Since 0C82 is the storage start address for data "0" and 0C82 is the storage start address for data "1", store the start address of the above character pattern and the number of exclusive bytes in correspondence with the character code in the inte x area. put. The present invention is particularly effective for characters with a small number of strokes, such as Roman characters with one digit and kana characters. Also, this method is disadvantageous for characters with many lines perpendicular to the bit scanning direction in memory, but since kanji have many horizontal lines, there are many characters for which this method is advantageous. It is preferable to configure the font memory by dividing the characters into characters for which this method is advantageous and characters for which the conventional method is advantageous. Effect E: According to the present invention, the storage capacity required to store character patterns has been reduced.

[Brief explanation of the drawing]

Fig. 1 is a memory display diagram of an embodiment of the present invention, Fig. 2 is a display diagram of a character pattern, A is a display diagram of "0", and Fig. B is a display diagram of a character pattern.
is a display diagram of "1". CB) Figure (A) Figure 112

Claims (1)

[Claims] Multiple bits are considered as one unit, information on whether or not to print is displayed on one bit in one unit, and the number of consecutive dots with the same information is stored in the remaining bits, so that the dot pattern of the character is A method for storing character dot pattern data, characterized in that it is displayed by a combination of print data of a plurality of bits.