JPS61227064A - Character pattern generating method - Google Patents

Abstract

PURPOSE:To enhance utilizing efficiency of a font memory and processing speed, by a method wherein only the part of a character bit pattern is scanned, when planting a character bit pattern into a bit map memory. CONSTITUTION:A bit pattern for a character 'g' is stored in a storage region Sn corresponding to a font address 'Fn' in a font ROM13. When code content of a character code signal from a host computer 10 is 'n', the font address 'Fn' is assigned, and the storage region Sn in the font ROM13 is read. Namely, values an, bn and the bit pattern for the character 'g' are read. In the bit map memory 14, horizontal scanning is conducted starting from coordinates P3a (Px+2W, Py-an) which is spaced upward by an from a new reference point P3 (Px+2W, Py) deviated by a spacing W from a reference point P2 on a reference line l1, and scanning is conducted for a number bn of scanning lines. Accordingly, the bit pattern for the character 'g' is implanted.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to a character pattern generation method for generating character pattern data in a dot matrix configuration for printing characters corresponding to character codes.

BACKGROUND ART FIG. 8 is a diagram showing a conventional storage area of the font memory 1, and FIG. 9 is a diagram showing a state in which character bit patterns stored in the font memory 1 are planted in the bitmap memory 2. . The font memory 1 has a storage area Q11 for each character corresponding to a plurality of addresses.
・gQm, ・= t Q n t...,
Bit patterns for each character are individually stored in the storage areas Ql, -q-, +-+Qnl, . . . . This store area Ql,..., Q theory.

...Qnt... all have the same memory capacity,
- It can accommodate the memory for the maximum print area of a set of character bit patterns.

For example, the bit pattern of the character rAJ is stored in the store area Q1, and the bit pattern of the character reJ is stored in the store area QZ.
It is assumed that the bit pattern of the character rgJ is stored in the In area Qn. When the address of the store area Q1 is specified, data for the store area 01 is sequentially output, and horizontal scanning is performed in the bitmap memory 2 for the area 91. As a result, as shown in FIG.
The bit pattern of the character rAJ is implanted in the bit pattern of the character rAJ. *Similarly, when the address of the store area Qn is specified, only the area corresponding to the store placement Qn is scanned, and the bit pattern of the character rgJ is planted in the bitmap memory 2.

Problems to be Solved by the Invention In the above prior art, the storage area of the font memory is 1
The memory capacity of the character bit pattern is configured to have the maximum print area in the character set. Therefore, the font memory 1 has a useless blank space, and the font memory 1 has an inefficient configuration.

An object of the present invention is to provide a character pattern generation method that solves the above-mentioned technical issues, reduces wasteful blank areas as much as possible, and improves the efficiency of using font memory. .

Means for Solving the Problems The present invention prepares a font memory, which has seven areas for each character individually corresponding to a plurality of addresses, and stores each character in this storage area. The bit pattern for each character, the bit number layer that shifts from a predetermined reference line that is common to the bit pattern to the next rank, and the total number of scanning lines for that character are stored, and then they are stored from the font memory. A bitmap memory is prepared that stores the bit pattern of the character at the position to be output, and the bitmap memory is stored based on the bit number layer stored in the store area having the font memory address corresponding to the character to be output. A character characterized in that the bit pattern of the font memory is implanted in the bitmap memory by scanning from a position shifted from the reference line by a distance in the scanning direction and scanning the bitmap memory five times. This is a pattern generation method.

Further, the present invention prepares a font memory having a storage area for each character individually corresponding to a plurality of addresses and a code conversion table, and stores a bit pattern for each character in the storage area of the font memory. Then, in the code conversion table, the address of the font memory that corresponds to the code signal, the number of bits that are shifted from the predetermined reference line that is common to the bit pattern, and the number of bits of the character are stored in the code conversion table. Next, prepare a bitmap memory to store the bit pattern from the font memory at the position where it should be output, and select the font memory corresponding to the character to be output from the code conversion table. The address, the number of bits layer, and the number of scanning lines are read out, and based on this number of bits layer, scanning is performed from a position shifted from the reference line of the bitmap memory by a distance from the next rank side in the scanning direction, and the bitmap memory is read out. This character pattern generation method is characterized in that the bit pattern of the font memory is scanned five times and the bit pattern of the font memory is implanted into the bitmap memory.

Further, the present invention provides a font memory, which has a storage area for each character individually corresponding to a plurality of addresses, and stores a bit pattern for each character and a bit pattern for each character in this storage area. The pitch 1b that is shifted toward the next rank from a common predetermined reference line, the total number of scanning lines for that character, and the character pitch c are stored, and then the bit pattern from the font memory is output. Prepare a bitmap memory to be stored at the desired position, and have an address of 7 ontonomori corresponding to the character to be output. Scanning is performed from a position shifted toward the next rank in the scanning direction, scanning the bitmap memory b times, and then shifting the reference position of the subsequent character by C in the scanning direction to change the bit pattern in the font memory to bitmap memory. This is a character pattern generation method characterized by planting it in a map memory.

Further, the present invention provides a font memory having a storage area for each character individually corresponding to a plurality of addresses, and a code conversion table, and stores a bit pattern for each character in the storage area of the font memory. The address of the font memory that individually corresponds to the code signal, the number of bits that are shifted from the predetermined reference line that is common to the bit pattern, and all of the characters are stored in the code conversion table. Once the number of scanning lines has been determined, the character pitch c is stored.Next, a bitmap memory is prepared to store the bit pattern from the font memory at the position to be output, and the bit pattern corresponding to the character to be output from the code conversion table is prepared. The address, bit number layer, scanning line number, and character pitch c of the font memory are read out, and based on the bit number layer, scanning is started from a position shifted from the reference line of the bitmap memory by a toward the next rank in the scanning direction. A character pattern generation method characterized in that the bit pattern of the font memory is implanted into the bit map memory by scanning the bit map memory b times, then shifting the reference position of the subsequent character by C in the scanning direction. It is.

The present invention also provides a font memory, which has a storage area for each character individually corresponding to a plurality of addresses, and stores a bit pattern for each character and a bit pattern for each character in this storage area. Store the number of bits that are shifted from a predetermined reference line that is common to the previous order, the total number of scanning lines of that character, and the maximum bit width d of that character along the horizontal scanning direction, Next, prepare a bitmap memory that stores the bit pattern from the font memory at the position to be output, and based on the bit number layer stored in the store area having the address of the font memory corresponding to the character to be output. It is characterized by scanning a bit width d b times from a position shifted from the reference line of the bitmap memory by a toward the forward ranking side in the scanning direction to plant a 7-ontology bit pattern in the bitmap memory. This is a method for generating character patterns.

Further, the present invention provides a font memory having a storage area for each character individually corresponding to a plurality of addresses, and a code conversion table, and stores a bit pattern for each character in the storage area of the font memory. The address of the font memory that individually corresponds to the code signal, the number of bits that are shifted from the predetermined reference line that is common to the bit pattern, and all of the characters are stored in the code conversion table. The number of scanning lines and the maximum bit width d along the horizontal scanning direction of the character are stored. Next, a bitmap memory is prepared to store the bit pattern from the font memory at the position where it should be output, and code conversion is performed. Read out the address of the font memory corresponding to the character to be output from the table, the number of bits, the number of scanning lines, the maximum bit width d along the horizontal scanning direction of that character, and set the reference line of the bitmap memory based on the pitch. This character pattern generation method is characterized in that the bit pattern of the font memory is implanted in the bitmap memory by scanning b times of bit width d from a position shifted forward in the scanning direction by only a few seconds. .

According to the first and second aspects of the invention, scanning is performed from a position shifted from the reference line of the bitmap memory by a distance from the previous ranking side in the scanning direction, the bitmap memory is scanned b times, and the font is The bit pattern of the memory is implanted into the bitmap memory.

According to the third and fourth inventions, scanning is performed from a position shifted from the reference line of the bitmap memory by an amount a toward the next rank in the scanning direction, the bitmap memory is scanned b times, and then the bitmap memory is scanned b times. The bit pattern of the font memory is implanted in the bitmap memory by shifting the reference position of the character in the scanning direction.

According to the fifth and sixth inventions, the bit pattern of the font memory is scanned b times from a position shifted from the reference line of the bitmap memory by a to the forward rank side in the scanning direction, and the bit pattern of the font memory is Planted in map memory. The font memory in the first to sixth inventions is configured to have a storage area for each character individually corresponding to a plurality of addresses. Therefore, it is possible to reduce the wasteful blank area as much as possible, and it is possible to improve the utilization efficiency of the font memory.

Embodiment FIG. 1 is a block diagram of an embodiment of the present invention. Character code signals from the host computer 10 are stored in a text buffer 15 via an interface 11, and then read out by a processing circuit 18 and provided to a code conversion table 12. This code conversion table 12
As shown in Table 1, 7 ont addresses are written in a one-to-one correspondence with the character code. For example, code 1 stores the bit pattern of the character rAJ.
It corresponds to the ont address "Fl".

(Left below) When a character code signal is given to the 181 table code conversion table 12, 7 ont 71'res corresponding to the code signal is read out from the code conversion table 12, and 7 on)
The stored contents of the ROM 13 corresponding to the given address are read out and given to the bitmap memory 14.

In the bitmap memory 14, horizontal scanning is performed based on the stored contents of the ROM 13 (7 on), and the 7 on) ROM
The character bit pattern stored in 13 is implanted. Then, the character bit patterns stored in the ROM 13 are read out for each character code signal and are planted in the bit map 14 for 17 frames. The bit pattern implanted in the bitmap memory 14 is given to the printing mechanism 17 via the interface 16,
Predetermined printing is performed.

In addition, an interface 11, a code conversion tape 12.
The 7-ont ROM 13, bitmap memory 14, text buffer 15, and interface 16 are controlled by control signals from a processing circuit 18.

FIG. 2 is a diagram showing the storage area of the 7-on) ROM 13, and FIG. 3 is a diagram showing a state in which character bit patterns stored in the 7-on) ROM 13 are planted in the bitmap memory 14.

7 on) ROMI 3 has storage areas Sl, --, S-9, for each character individually corresponding to a plurality of addresses.
....

Sn*=. (indicated by reference mark S when collectively referred to). The storage area S1 is a one-character pattern control area that includes a character pattern area R1 where character bit patterns are stored, and a character pattern control area T1 occupying the upper part of this area R1 and storing data that controls the character bit patterns. 1 and a value alybl corresponding to each character pattern are stored in T1. The value a1 indicates the number of bits shifted from the predetermined reference line 71 that is common to each character pattern, and the value b1 indicates the total number of scanning lines of the character pattern.In the 0 character pattern area R1, each character The bit pattern of is arranged in a dot matrix shape.
7, and the bit located at the top and the bit located at the bottom of this character pattern are in the character pattern area R.
1, and there is no wasted blank area in the vertical direction.
...Sm, ...tsnt=. have the same configuration as the store area S1, and the character pattern areas R2, ...
R-, . . . , Rn, .
@, . . . =, Tn, .

The operation of planting the bit pattern of each character in the bitmap memory 14 using such a 7-on FROM 13 will be explained. 7 on) 7 ont address of ROM13 “Fl
”, the bit pattern of the character rAJ is stored in the storage area S1 corresponding to “F
The bit pattern of the sentence 'F'reJ is stored in the store area S- corresponding to "-", and the character "g" is stored in the store area Sn corresponding to the 7-onto address rFnJ.
Assume that the bit pattern of is stored.

When the code content of the character code signal from the host computer 10 is "1", the code conversion table 12 specifies the 7 ont address "Fl" for the cram school, and based on this address specification, the 7 ont) 71 of the ROM 13 [Area S1 is read. i.e. the values al, b1 and the letter r
AJ is read. This allows bitmap/mori 1
4, the position 11 of the predetermined reference point P1 on the predetermined reference line 71 common to the bit pattern of each character (PXIPF
) above the position P 1 a (Px*Py-al
), scanning is performed in the horizontal direction, and this horizontal scanning is sequentially shifted in the vertical direction to perform scanning by the number of scanning lines b1. As a result, a pattern of characters rAJ is planted on the bitmap memory 14 as shown in the third diagram.

When the character code signal of the second code "Mackerel" is given to the code conversion table 12 from the host computer 10 via the interface 11, the 7-ont address "FII" is specified to Hiragi, and thereby the 7-ont ROM
13 store areas S@ are read out. i.e. the value amt
The bit pattern of b so and the character reJ is read.

As a result, in the bitmap memory 14, the reference #17
A new reference point P on i and moved to the right by a predetermined interval W from the reference point P 1 (Px, Py)
2 (P x + W t P y) The seat 111 P 2 a (P x 10 W t P F
Scanning is performed in the horizontal direction from a), and scanning is performed by the number of scanning lines b-, as shown in FIG.
is planted.

Furthermore, the code content of the 13th character code signal is rnJ
When 7 ont address "FnJ" is specified,
As a result, the store area Sn of the ROM 13 is read out. That is, the bit patterns of the values an, bn and the character rgJ are read out. As a result, the bitmap/mori 14 creates a new reference point P 3 (Px+2 W=P
Coordinate P3 a(Px+2 W
*Py an), horizontal scanning is performed, and the number of scanning lines b
Scanning is performed by n. As a result, the bit pattern of the character rgJ is implanted as shown in FIG.

7 on corresponding to the character code signal sequentially in the same manner)
The bit pattern of each character in the ROM 13 is planted on the bitmap memory 14, and the planting is performed for one frame.

The stored contents of the bitmap memory 14, which have been planted for one frame in this way, are given to the printing mechanism 17 via the interface 16, and predetermined printing is performed.

In this way, the 7-on) ROM 13 used to generate the character bit pattern does not require wasted blank space as in the conventional case, and therefore the 7-on) ROM 13 is used to generate character bit patterns.
13 usage efficiency is improved.

Also, since there is no wasted blank space, processing time is shortened.
High-speed processing becomes possible.

FIG. 4 is a diagram showing a storage area of another embodiment of the ROM. It should be noted that in this example, 7 on) R
The OM 13a is not provided with a character pattern control area T, however, the values a and b stored in the character pattern control area T in the above embodiment are written in the code conversion table 12m. That is, for example, when the code content of the character code signal is "1", the code conversion table 12m reads out the 7-onto address "Xl" and the value al=bl as shown in Table 2.

(Margin below) Table 2 For example, when a character code signal indicating "1" is given from the host computer 10 to the code conversion table 12a via the interface 11, the 7 ont address "Xl" and the values al and bl are read out. be done. In 7-on FROM13, the character r corresponding to 7-on address 1
The bit pattern of AJ is read out, and the bit pattern of the character rAJ is planted in the bit map memory 14 based on the value al=b1 as shown in FIG. 3 by the same procedure as described above. Also, when the code content of the second character code signal is "-", the 7 ont address "
-'' and the values am, b- are read out. This results in 7
The bit pattern of the character reJ stored in the storage area S- of the on-FROM 13m is read out, and the values am and b are read out.
The bit pattern of the character reJ is implanted based on the meal using the same procedure as described above, as shown in FIG.

Furthermore, the code content of the third character code signal is "n"
, 7 on F in the code conversion table 12a
The address "Xn" and the V value Intbn are successively output. As a result, the bit pattern of the character rgJ stored in the storage area Sn of the ROM 13a is read out, and based on the values an and bo, the bit pattern of the character rgJ is read as shown in FIG. are planted and kicked out.

FIG. 5 is a diagram showing a storage area of yet another embodiment of the ROM. It should be noted that in this embodiment, the character pattern control area T1 of the ROM 13b has the values al and bl stored therein, as well as the character pitch cl.
(indicated by reference mark C when collectively referred to) and data width d
i (indicated by reference numeral d when used generically) are stored. Remaining character pattern control area T2. ..., T-
,...,Tn,... is the character pattern control area T1
It has the same structure as , and corresponding parts are marked with suffix 2. ...
, --,..., n,... The zero character pitch C is
The data width d indicates the amount of movement of the reference position for the next character when the character pattern is planted in the bitmap memory 14, and the data width d indicates the number of bytes of the character pattern along the horizontal direction from the left end reference line 12. The area S consists of 32 bits in the horizontal direction, and the number of bits in the horizontal direction of each character is set in advance to be a multiple of bytes.

As shown in Table 3, the code conversion table 12b in the embodiment in which the ROM 13b is used has the same structure as the code conversion table 12 used in the embodiment shown in the second figure.

(The following is a margin) Table 3 is a diagram for explaining the state in which character bit patterns are planted in the bitmap memory 14.

When the code content of the first character code signal from the host computer 10 is "1", the 7-onto address "Yl" is read out from the code conversion table 12b.

As a result, the values of ROM13b (al, bl)
, el, and dl are read out, and based on this value a1, a data width d1 is read out from the reference line 72 in the character pattern region R1. As a result, in the bitmap memory 14, a predetermined reference point P on the reference line 71 is set.
1 The locus above al from (Px, Py) [P 1 a
cPx′tPy al ), a horizontal scan is performed to the right by d1 bytes, and as a result, the character pattern area R
The bitmap memory 14 is populated by one first scanning line. Then, such horizontal scanning is repeated bl times while moving down one by one in the vertical direction, thereby completely filling the character pattern area R1, and in the bitmap memory 14, as shown in FIG. 6, the characters rAJ A bit pattern is planted.

Next, when the content of the second character code signal is [resistant, the 7-on address "Y plow" is read out, and the stored content of the store area SL1 is read out in the 7-on ROM 13b. That is, the values as, bs+, em,
The d ring is read out, and based on the data width d theory, the reference #I! is read out in the character pattern area Rm. Only da bytes are read from 2. This allows the bitmap memory 14 to use the reference line! The position moved to the right by cl from the reference point P1 on 1 is the next new reference point P2 (Px+cl
, Py), and this criterion/! r, P2 to a
The position above P2 (P x + a1, Py-am)
A horizontal scan is performed d-bytes to the right. Such horizontal scanning is repeated b-times, resulting in the sixth
The bit pattern of the letter "e" is implanted as shown in the figure.

When the code content of the third character code signal is rnJ, 7 ont address [YnJ is read out from the code conversion table 12b. By this, 7 ont R
Store 1N area Sn of OM13b is read. That is, the value &ngbng6ntdn is read out, and based on the value in, the character pattern area Rn is read out from reference #172 to d.
Only n bytes are read. In the bitmap memory 14, the reference line! 1, a new reference point P 3 (Px+
cl +ca*Py) is set. Place II above this reference point P3 by an amount! P3a (Px+cl 10cm
y Py-an) to the right by dn bytes, and this scanning is sequentially shifted in the vertical direction one by one and repeated scanning is performed bn times, thereby t! The bit pattern of the character rgJ is implanted on the map memory 14 as shown in FIGS.

Thereafter, character bit patterns corresponding to the character code signals are similarly planted on the bitmap memory 14 for 17 frames. Thereafter, printing is performed by the printing mechanism 17 in the same manner as described above. In this way, when reading the character bit pattern stored in the storage area of ROMI 3h (in this embodiment, 7 on), the data width d is read out, so that the bits of each character are stored on the bitmap memory 14. It becomes possible to plant patterns, thereby further reducing processing time.

FIG. 7 is a diagram showing a storage area of another embodiment of the ROM. This 7-on) ROM 13e is replaced with the 7-on ROM 13b shown in Figure 5! li, similar parts are given the same reference numerals, it is noteworthy that this 7-on) ROM
13e is not provided with the character pattern control area T, and instead, the code conversion table 12c contains the value afbfe along with the font address as shown in Table 4.
ld is stored.

1# When the code content of the first character code signal is "1", the code conversion table 12e has the 7 ont address "Zl" and the value ml -bl ycl -dl
is read. As a result, the data width d1 is read from the reference #172 in the 71N area S1 of the ROM 13C. In the bitmap memory 14, the value +rl,
Based on bl, cl, and di, the bit pattern of the character rAJ is planted on the bitmap memory 14 as shown in FIG. 6 by the same operation as in the embodiment shown in FIG. Also, when the code content of the second character code signal is "brass", the code conversion table 12c
7 ont address 'ZIIJ and value aII, tll
ll, c ugly, and d ugly are read out. 7onto ROM13e
Then store area S corresponding to 7onto address [Z export]
The data width d is read from the reference line 2, and the bitmap memory 14 stores these values a, b, eel,
Based on d-, the bit pattern of the character reJ is implanted as shown in FIG. Similarly, when the code content of the third character code signal is rnJ, the bit pattern of the character rgJ stored in the 7 area Sn of the ROM 13c is planted as shown in FIG. . By storing the values a@b, c, and d in the code conversion table 12C instead of storing them in the 7-on FROM 13e, character bit patterns can also be planted in the bitmap memory 14 at high speed. It becomes possible. Also 7 on) ROM13c
7 on) ROM1
3c usage efficiency is improved.

In the above embodiment, the bitmap memory 14 is configured to store only one frame, but it may be configured to store 27 frames or more.

Effects As described above, according to the present invention, there is no need for wasteful blank areas in the font memory, and therefore the efficiency in using the font memory can be improved.

Further, when a character bit pattern is to be implanted in a bitmap memory, it is possible to implant the character bit pattern by simply scanning only the portion of the character bit pattern, thereby making it possible to improve the processing speed.

[Brief explanation of drawings]

FIG. 1 is a block diagram of an embodiment of the present invention, FIG. 2 is a diagram showing a storage area of a 7-on ROM 13 used in the present invention, and FIG. Figure 4 is a diagram showing a state in which a bit pattern is planted on 14, and Figure 4 is another embodiment of 7) RO.
M13a strike. Figure 5 is a diagram showing the area 7 of another embodiment)
Figure 6 shows the storage area of ROMI 3b.
A diagram showing a state in which a character bit pattern is planted on the bitmap memory 14 by the 7-on) ROM 13b shown in the figure, FIG.
Figure 8 shows the conventional 7-on) RO
Figure 9 shows the storage area of M. (Figure 9 is the conventional 7-on)
FIG. 3 is a diagram showing a state in which a character bit pattern is planted on a bitmap memory by OM. 12112m=12b@12c...:+-code conversion table, 13*13m=13b*13e-7 on) ROM
, 14...Bitmap memory, S...7 on)
ROM store area, R...Character pattern area, T...
...Character pattern control area, 71.72...Reference line,
P1-P3... Reference point agent Patent attorney Function Keiichi - Figure 1 Figure 2 Figure 3 Figure 1 5riA Figure 6 1 Figure 7 Figure 8 Figure 9

Claims (6)

[Claims] (1) Prepare a font memory, and this font memory has a storage area for each character that individually corresponds to multiple addresses, and this storage area contains a bit pattern for each character and a bit pattern common to the bit pattern. The number of bits a shifted from a predetermined reference line to the next rank side and the total number of scanning lines b of that character are stored, and then the bit pattern from the font memory is stored at the position where it should be output. A bit map memory is prepared, and based on the number of bits a stored in the store area having the address of the font memory corresponding to the character to be output, the bit map memory is selected from the reference line of the bit map memory on the ranking side a distance ahead in the scanning direction. 1. A character pattern generation method characterized in that a bit pattern of a font memory is implanted into a bit map memory by scanning from a position shifted from the font memory and scanning the bit map memory b times. (2) Prepare a font memory having a store area for each character individually corresponding to a plurality of addresses and a code conversion table, and store a bit pattern for each character in the store area of the font memory. , in the code conversion table, the address of the font memory that individually corresponds to the code signal, the number a of bits shifted from a predetermined reference line that is common to the bit pattern to the previous rank side, and all scanning lines of the character. Next, prepare a bitmap memory to store the bit pattern from the font memory at the position where it should be output, and select the font memory address and bit number corresponding to the character to be output from the code conversion table. A and the number of scanning lines b are read out, and based on this bit number 1, scanning is performed from a position shifted from the reference line of the bitmap memory by an amount a from the next ranking side in the scanning direction, and the data is stored in the bitmap memory b times. Scan and
A character pattern generation method characterized by planting a bit pattern of a font memory into a bitmap memory. (3) Prepare a font memory, and this font memory has a storage area for each character that individually corresponds to multiple addresses, and this storage area contains bit patterns for each character and bit patterns common to the bit patterns. The number of bits a that deviates from a predetermined reference line to the next rank, the total number of scanning lines b for that character, and the character pitch c are stored, and then the bit pattern from the font memory should be output. A bit map memory is prepared for storing at a position, and the bit map memory is stored by a distance a in the scanning direction from the reference line of the bit map memory based on the bit number layer stored in the store area having the address of the font memory corresponding to the character to be output. Scanning is performed from a position shifted toward the previous rank, and the bitmap memory is scanned b times.Then, the reference position of the subsequent character is shifted by c in the scanning direction, and the bit pattern in the font memory is transferred to the bitmap memory. A method for generating a character pattern characterized by planting the character pattern in the character pattern. (4) Prepare a font memory having a store area for each character individually corresponding to a plurality of addresses and a code conversion table, and store a bit pattern for each character in the store area of the font memory. , in the code conversion table, the address of the font memory that individually corresponds to the code signal, the number of bit layers that are shifted from a predetermined reference line that is common to the bit pattern, and all the scanning lines of the character. Store the number b and the character pitch c, then prepare a bit map memory to store the bit pattern from the font memory at the position where it should be output, and create the font memory corresponding to the character to be output from the code conversion table. The address, number of bits a, number of scanning lines b, and character pitch c are read out, and based on the number of bits a, scanning is performed from a position shifted by a from the reference line of the bit map memory to the next rank in the scanning direction. The character pattern generation method is characterized in that the bit pattern of the font memory is implanted in the bit map memory by scanning the bit map memory b times, and then shifting the reference position of the subsequent character by c in the scanning direction. (5) Prepare a font memory, and this font memory has a storage area for each character that individually corresponds to multiple addresses, and this storage area contains a bit pattern for each character and a bit pattern common to the bit pattern. The number of bits a that deviates from a predetermined reference line toward the next rank, the total number of scanning lines b of the character, and the maximum bit width d of the character along the horizontal scanning direction.
Next, prepare a bit map memory to store the bit pattern from the font memory at the position where it should be output, and store it in the store area having the address of the font memory corresponding to the character to be output. Based on the number of bits a, the bit pattern of the font memory is transferred to the bitmap memory by scanning b times with a bit width d from a position shifted by a distance from the reference line of the bitmap memory toward the next rank in the scanning direction. A character pattern generation method characterized by planting. (6) Prepare a font memory having a store area for each character individually corresponding to a plurality of addresses and a code conversion table, and store a bit pattern for each character in the store area of the font memory. , in the code conversion table, the address of the font memory that individually corresponds to the code signal, the number a of bits shifted from a predetermined reference line that is common to the bit pattern to the previous rank side, and all scanning lines of the character. The number b and the maximum bit width d along the horizontal scanning direction of the character are stored. Next, a bit map memory is prepared to store the bit pattern from the font memory at the position where it should be output, and the bit pattern from the code conversion table is stored. Read out the address of the font memory corresponding to the character to be output, the number of bits a, the number of scanning lines b, and the maximum bit width d along the horizontal scanning direction of the character. A character pattern generation method characterized in that a bit pattern of a font memory is implanted into a bitmap memory by scanning b times of a bit width d from a position shifted toward the next rank in the scanning direction.