| 摘要 |
PROBLEM TO BE SOLVED: To reduce the number of bit map patterns and to reduce the amount of storage elements for character data by arranging the bit map patterns on bit map data and generating bit maps by logical operations. SOLUTION: If one wishes to construct a character 'H', two bit map patterns are arranged with bit map data having 8×8 bit size. Base bit map data 20 use all black base bit map data that are represented by the sections all of which are used for printing. There are two bit map patterns, and one has the size of 3×4 bits and is generated by arranging a bit map patterns 22, which is represented by all no printing sections, at a coordinate (2, 0) and executing AND logical operations. The other has the size of 3×4 bits and is generated by arranging the pattern 22, which is represented by all no printing sections, at a coordinate (2, 5) and executing AND logical operations.
|
