JPS61182088A - Front pattern development controller - 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] The present invention relates to a font pattern expansion control device when font patterns are expanded onto a storage device in various printers, word processors, and the like.

[Prior art]

Conventionally, font patterns are developed onto a font pattern memory by simply writing the font pattern for each character in sequence from a start address onto the font pattern memory.

For example, the operation of reading from the font pattern memory and the operation of writing to it are performed in units of words (for example, 1 word is 1
In the font pattern expansion control to the font pattern memory performed in 6 bits), the JIS level 1 kanji of the font pattern consisting of the dot pattern of 32 dots in the vertical and horizontal directions shown in Fig. 1 (A) is , the case where the font pattern is expanded on the font pattern memory will be explained.

As shown in Fig. 1 (CB), the 3 shown in Fig. 1 (A)
In order to send the font pattern data of a character consisting of 2 dots/) x 32 dots in units of words and store them in the font pattern memory, a data amount of 64 words is required. This 64-word font pattern data has one address for each word of data.
one is required.

First, the start address of the first word at the beginning of the font pattern is determined. The address is composed of two words, each word having 18 bits, for example, and the upper IB bits are called the upper word, and the lower 18 bits are called the lower l word. The addresses of the second and subsequent words are obtained by sequentially adding "l" to the lower l words of the starting address.

However, for example, the 1st rI! As shown in J(B).

In the address corresponding to 63 words of font pattern data, "FFFFH", which is the maximum value of the last word of the address, is
”, the first word from the bottom of the address to the top
Carry-up to word is performed. For this reason, when calculating the address of the font pattern memory, it is necessary to always calculate the address while detecting the increment of the last word.

In this way, conventionally, font patterns are sequentially written onto the font pattern memory while detecting the increment of the last word of the address, and the font pattern of the entire font is developed into the font pattern memory.

To explain this in more detail, when a character code is input from an information processing device, the start address of the font pattern corresponding to that character code is found, and "1'" is sequentially added to the l word below the start address. The address is determined while the detecting means detects whether there is a carry from the lower one word to the upper one word, and the font pattern data is transferred to the font pattern memory together with this address.

However, in this way, when calculating the address used to store the font pattern in the font pattern memory, each time one word of font pattern data is sent out, it is detected whether or not the last word of the address has an eel. Therefore, the disadvantage is that it takes a long time to process the font pattern to the font pattern memory.

When considering a printer as an input/output device, if a low-speed printer takes some processing time, it does not pose a major problem in operation, but with a high-speed printer, the response speed cannot be met unless the font pattern transfer time is increased.
The long processing time is a major problem.

〔the purpose〕

The present invention has been made in view of the above points, and it is an object of the present invention to provide a font pattern expansion control device with a quick processing time.

In order to achieve such an object, the present invention includes an input means for inputting at least a character code and a font pattern, a storage means for storing in advance the font pattern input by the input means, and a storage means for storing the font pattern input by the input means based on the character code input by the input means. A reading means for reading a font pattern from the storage means, and an additional value obtained by adding a value obtained by subtracting 1 from the number of addresses required for the one character to the lower one word of the start address when developing the font pattern of one character in the storage means. is the lowest 1
a detection means for detecting that the maximum word value is exceeded; and an update means for incrementing the lower one word of the start address and updating it as a new start address according to the output of the detection means;
The present invention is characterized by comprising a font pattern development means that develops the font pattern in the storage means based on the start address updated by the update means.

〔Example〕

Hereinafter, the present invention will be explained in detail based on the drawings.

Figure 2 shows a configuration example of the present invention, in which l is a host computer as an information processing device that generates character codes and control codes, and 2 receives and receives data and control commands from the host computer l side. This is input buffer memory. 3 is a code processing function section, which receives control codes and character codes from the input buffer memory 2 and analyzes the codes; 4 is a page buffer memory, which receives and receives control codes and character codes from the input buffer memory 2; 4 is a page buffer memory; Stores the character code for printing.

5 is an output processing function section, and page buffer memory 4
Based on the code information stored in the font pattern memory 8 storing the font pattern, print data corresponding to the width x height of the font pattern is read out and dot development is performed in the image buffer memory 6.

In addition, 9 is an arithmetic processing unit, which is composed of the above-mentioned code processing function section 3 and font pattern expansion processing function section 7, and stores the control procedure according to the present invention as shown in FIG. 3 in its internal memory. According to this control procedure, operations as described below are performed.

Font pattern information sent from the host computer 1 is transferred to the font pattern development processing section 7 by the code processing section 3 via the input buffer memory 2. The font pattern expansion processing function unit 7 stores the transferred font pattern f[ in the font pattern memory 8 in order from the designated storage area of the start address.

However, at this time, the font pattern memory 8 reads and writes the font pattern in word units (for example, 18 bits). For example, when a font pattern for characters is written to the font pattern memory 8,
The address used to store the font pattern should not include an address whose lower 1 words include "FFFFH", which is the maximum value of one word.

Therefore, when the address is sandwiched, the start address used when expanding the font pattern to the font pattern memory 8 is the address at which the lower one word was undone, that is, the lower part of the start address. Font pattern expansion processing is performed using an address where the l word is 0001b+" (for example, address "10000M"). Because 1
When the address used to write a font pattern for characters contains the maximum value of l words "FFFFM" as the lower l word, sandwiching the address ° means carrying up the lower l word of the address, and therefore This is because it is necessary to detect the presence or absence of. As explained in this example, if the address to be used does not include an address that includes "FFFFu", which is the maximum value of one word, as the lower word, an eel rise in the lower word of the address will be detected during address calculation. There is no need to do so.

Next, with reference to the flowchart of FIG.
! An example of the operation of the device of the present invention in I will be described in detail.

First, in step Sl, when the need data etc. sent from the host computer 1, which is an information generation source, is taken into the input buffer memory 2, in step S2, the code processing function unit 3 determines whether this input is to be code processed. Or it is determined whether the font pattern should be developed. If the code should be processed, the process proceeds to step S3, where the code processing function unit 3 calculates the start address of the image buffer memory 6 when dot-expanding the character code and the character code into the image puffer memory 6. This calculation result is transferred to page buffer memory 4.
Store it in After storing it, the process returns to step Sl.

Next, the operation when code data etc. sent from the host computer I side is subjected to font pattern development processing will be described.

Now, in step s2, input buffer memory 2
When the code processing function section 3 determines that the input taken in is the one that should be subjected to font pattern development processing, the process moves to the next step S4, and the font pattern development processing section 7 develops the font pattern for one character. Find the starting address.

Next, the process proceeds to step S5, and in step S5, the font pattern development processing function section 7 adds a value obtained by subtracting "1" from the number of addresses for the font pattern for one character to the value of the lower l word of the start address. . For example, when one character is composed of 32 dots x 32 dots, 63, which is obtained by subtracting 1 from the address number 84, is added to the value of one word below the start address.

In the next step S8, the added value and the maximum value of one word "FFFFH" are compared in the font pattern development processing function section 7. The result of addition is the comparison value “FF
If the result of addition is greater than or equal to the address "FFFFH", the lower l words of the address are not carried, and only the lower l words of the address change, so the process advances to step S8, and when the result of addition is greater than the address "FFFFH", the process advances to step S7. move on.

In step S7, the font pattern development processing function unit 7
Change the start address with ``10000M'', that is, move the lower 1 word of the start address to the upper 1 word from the start address before updating by ``1''.
The storage area of the font pattern memory 8 up to the address including "FFFFH" which is the address immediately before is made a free storage area.

As a result, the start address is the address obtained by incrementing the lower one word of the start address calculated by the font pattern start processing function section 7 by "l" to the upper l word, that is, the lower one word is "0OOOH". The address will be changed to the one shown below.

This changed address has the lower 1 word of the address raised in advance, so the value of the lower 1 word of the new starting address is "0000M", and the lower 1 word of this address is "00008". Even if you add the value obtained by subtracting 1 from the number of addresses for the font pattern for one character, the result is still not equal to the value of C of the last word.

Therefore, when calculating an address when expanding a font pattern into the font pattern memory 8, it is not necessary to detect the carry of the lower one word.

Next, the process proceeds from step S7 to step S8, and the font pattern expansion processing function section 7 sequentially provides the font pattern memory 8 with addresses obtained by sequentially adding "1" to the obtained start address and the font pattern data. After writing and developing the font pattern for one character in the font pattern memory 8, the process returns to step S1 again for the next data processing, and the above-described processing procedure is repeated.

After the font patterns of all fonts are stored in the font pattern memory 8 in this way, the output function unit 5 reads out the font patterns from the font pattern memory 8 and stores them in the 1-image buffer memory 6. will be explained in detail. First, the second
As shown in the figure, the output function section 5 reads out the required font pattern from the font pattern memory 8 based on the code information stored in the page buffer memory 4, and the output processing function section 5 sequentially reads out the addresses for reading. The font pattern memory 8 is provided with the required font pattern, that is, print data is extracted.

Next, the print data taken out above is stored in a storage location corresponding to the address of the image buffer memory 6 sent from the output function section 6. At this time, 1 image buffer memory 6
The write start address of is read from the page buffer memory 4 by the output function unit 5. Note that the address used when the output function unit 5 reads the font pattern of one character from the font pattern memory 8 does not carry up from the bottom word in this example as described above, so it is necessary to detect the upward movement. This makes it possible to perform the above-described processing at high speed.

In the above explanation, it is assumed that the font pattern data is sent from the host computer, but it is of course possible to send it from an input medium such as a magnetic tape or floppy disk. .

Alternatively, the font pattern memory 8 may not be included in the control device, but may be provided in an external storage/storage device, and the external storage device and the input/output control device may be connected and used only when the font pattern memory 8 is used. It is clear that the present invention can be applied to developing the font pattern onto the external storage device at that time.

FIG. 4 shows an example in which the present invention is constructed from functional means. As shown in this figure, a signal a is input to the start address calculation means 1 through the input means 108 in response to an instruction from an external device (not shown).
01, and in response to this signal a, the start address calculation means 101 calculates a 1 start address AD1, which is used when developing a font pattern of one character in the storage means 10B.

Next, the lower l word HAD l of the start address AD signal outputted from the start address calculation means 101 and the value W-1 obtained by subtracting 1 from the number of addresses of the font pattern of one character stored in the fixed storage means 105. and adding means 104
Enter and add. The added value uao, +W−t added by the adding means 104 and the maximum value A of one word
The comparison and determination means 10B compares and determines the size with D■. Added value UAD, +W-1 is the maximum value AD of 1 word
When the comparison and determination means 10B determines that the address is below the layer, a signal is given from the comparison and determination means 10111 to the address output means 102. In response to this signal, the address output means 102 selects and uses the start address AD given from the start address calculation means 101 as the start address for font pattern development. The address C calculated using the given start address ADt as the above-mentioned start address is sequentially sent to the storage means 109. On the other hand, in response to this address C, input means 10 is sent from an external device.
Font pattern data for one character is sequentially applied to the storage means 108 via the memory 1o8, and the font pattern is developed and stored in advance in the storage means 1o8.

Added value HAD l+ W -t Maximum value A of card 17-
If the comparing and determining means 10B determines that Dm is exceeded, the updating means 107 into which this determination result is input updates the start address AD.
Outputs 2. The latter start address AD2 is an address obtained by incrementing the lower l word of the former start address AD, and this start address AD2 is the address when the lower l word of the former start address AD is carried forward.
07 to the address output means 102, and the address output means 102 uses this start address AD2 as the start address for font pattern expansion and expands the geond pattern onto the storage means 107 in the same manner as described above.

In this way, you can store multiple font patterns in advance! 09, then the input means 108
An address for reading a font pattern corresponding to the character code given from the data reading means 11G is given to the storage means 109.

Based on this address, the required font pattern is read out from the storage means 109 as printing data, and this read data is transferred to another storage means (not shown) (corresponding to an image buffer memory) by the data reading means 110.

). In addition, calculation determination means 1 surrounded by a broken line in the figure
11, start address calculation means 101, fixed storage means 1;
05, addition means 104, and comparison and determination means 10B.

Also, calculate the magnitude of the value obtained by subtracting "1" from the number of addresses used when developing font pattern data for one character from the maximum value of one word of the address, and the lower one word of the start address. The comparison process can be substituted for the processes in steps S5 and S8.

〔effect〕

As explained above, according to the present invention, the value obtained by subtracting 'l'' from the number of addresses for one character's font pattern is added to the lower l word of the start address calculated by the font pattern expansion processing function section. When the value exceeds the maximum address that can be expressed in one word, the carried address is used as the new starting address, so when expanding a font pattern to the font pattern memory or dot expansion to the image buffer memory. When reading a font pattern from the font pattern memory for a font pattern, all you have to do is add 1" to the last word of the pattern address in sequence, and you can simply add 1" to the last word of the pattern address.
Since it is not necessary to detect the rise of a word, the effect of 1. that the processing time for developing a font pattern can be shortened can be obtained.

[Brief explanation of the drawing]

Figure 1 (A) is an explanatory diagram showing an example of a font pattern of 32 dots in the vertical and horizontal directions, and Figure 1 (CB) is an explanatory diagram showing an example of a font pattern of 32 dots in the vertical and horizontal directions.
A) Font pattern starting address “FFFOH”
Figure 2 is a block diagram showing a configuration example of the device of the present invention; Figure 3 is a flowchart showing an example of its operation; The figure is a block diagram showing another functional example of the device of the present invention. l...Host computer, 2...Input buffer memory, 3...Code processing function unit, 4...Page buffer. 5... Output processing function section, 6... Image/<rough memory -, 7... Font pattern expansion processing function section, 8... Font pattern memory. Figure 1 Figure 3 Figure 4

Claims (1)

[Scope of Claims] An input means for inputting at least a character code and a font pattern, a storage means for storing in advance the font pattern input by the input means, and a font based on the character code input by the input means. reading means for reading a pattern from the storage means; a value obtained by subtracting 1 from the number of addresses required for one character to the lower one word of the start address when developing the font pattern for one character in the storage means; detecting means for detecting that the added value exceeds the maximum value of the lower one word; and updating means for incrementing the lower one word of the start address and updating it as a new start address in accordance with the output of the detecting means; A font pattern expansion control device comprising: font pattern expansion means for expanding the font pattern into the storage means based on the start address updated by the updating means.