JPS59217387A - Method of generating printed pattern - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a print pattern generation method, and more particularly to a print pattern generation method suitable for a rusk scan printing method.

In the rask scan printing method that uses a light beam such as a laser beam, the print pattern (characters, codes, images, etc.), that is, dot information on the rask is stored in a font memory. Here, font memory means 1
This is a memory that stores each print pattern as 1'' for each print pattern and 0'' for the other parts. As is well known, in the rask scan printing method, a print pattern is represented as a set of dots, so if the dot information in the font memory is sequentially read out, one print pattern can be constructed.

Now, in such a printing method, when it is desired to print patterns of different sizes in one line, there are two methods for achieving this. One method is to store dot information for each pattern size in a font memory. This method has the advantage that since there is a one-to-one correspondence between the size of the pattern and the dot information, the original form of the pattern is not destroyed during printing and can be expressed extremely accurately. However, on the other hand, since it is necessary to store dot information for each size of patterns of different sizes, there is a drawback that the capacity of the font memory becomes enormous.

Another method is to have only one type of dot information for a pattern, and to change the size by enlarging or reducing the pattern represented by the dot information, that is, the basic pattern.

Since this method requires only one type of dot information, the font memory capacity can be saved.

However, even if the pattern is simple,
A problem arises in that the more complex the pattern, the more difficult it becomes to accurately represent and cover the original pattern during printing.

For example, if there is a diagonal i line, the diagonal line will become distorted when it is enlarged, or the pattern will be distorted when it is reduced.

SUMMARY OF THE INVENTION An object of the present invention is to solve the drawbacks of conventional methods and to provide a printing pattern generation method that can print patterns of different sizes on one line while effectively using font memory. It is in.

To achieve the above object, the present invention includes a page memory for storing the size and code of the print pattern, a font memory for storing the print pattern, and a line memory for storing the effective address on the font memory of the print pattern. , specifies the effective address in the font memory of the print pattern based on the size and code of the print pattern] - code conversion pointer, and specifies the effective address in the font memory of the print pattern according to the specification of the code conversion pointer. A 1h method that stores an address in a line memory and reads a print pattern from a font memory based on the stored contents, and is characterized by a print pattern generation method that updates the contents of a code conversion pointer in arbitrary print units. It is.

In the present invention, instead of fixing and cutting dot information for each pattern size on the memory, the fin 1 on the memory is determined by the size of the pattern and the code representing it. By setting a code conversion pointer that specifies an effective address and updating the contents of the code conversion pointer in arbitrary printing units, for example, in units of the number of printed pages determined by the printing cycle, the driver 1 for each pattern size can be updated. ~Information is allocated (pushed) to an arbitrary address on the fin 1~memory.However, in order to print, for example, information must be assigned in size and code from a storage device such as a magnetic tape device. , it is necessary to read out the information from the driver 1 of the printed pattern that is printed, but it is necessary to read the information from the fin 1 to
When storing the dot information in memory, if you update the contents of the code conversion pointer used in the previous print unit, you can allocate the dot information for each pattern size to any address from A1 to memory. That is why it is possible.

To explain the method of the present invention in more detail, FIG.
First, print 1 from a storage device such as a magnetic tape device.
For example, print data in page units is read into the page memory. This print data is a collection of a plurality of data for one line as shown in FIG. 2. The above-mentioned one line of data indicates the size of the pattern, and includes data 2 of 2 by 1-, for example, and data 3 of 2 bytes, which represents the pattern, and these data 2.3 are plural. Together they represent one row of data. Maruko, part 1 (For example, at the end of 1 minute of data, 2 bytes of line feed data 4
is set.

Next, the code analysis unit 5 retrieves data for each pattern to be printed from the page memory 1, and refers to the code conversion pointer 6 based on data 2 representing the size and data 3 representing the code. At the same time, the effective address on the 7-ont memory 8 regarding the above pattern is written into the row memory 7. The same process is repeated for one line of data until the line feed data 4 is reached, completing the loading of one line of data into the line memory 7. The line memory 7 reads dot information, that is, print data, from the font memory 8 based on its effective address and sends it to the printing device (see 1).

When printing next time, there is no problem if the font memory 8 address allocation (=J is the same as the previous printing, but if it is different, the contents of the code conversion pointer 6 will be updated. For example, if the pattern From a state where there are 3 thicknesses and 4000 types of patterns, the number of types of patterns of a certain size is reduced from 4000 to 2000.
4. Reduce the pattern to another size. When the number of types increases from OO0 to 6000, the contents of the code conversion pointer 6 are updated according to the increase/decrease value of the type for each pattern size. Then, prior to printing, the driver 1 information to be printed at that time is read from the storage device, and the driver 1 information is written in the font method 8 while referring to the two-word conversion pointer 6 as in the above printing.

As explained above, the print pattern generation method of the present invention has a code conversion pointer whose data can be rewritten, and prior to writing drum mill information to the memory, the current contents of the code conversion pointer are Since the font is updated according to the type of pattern used for printing, patterns of different sizes can be printed in one line using a limited font memory.

[Brief explanation of the drawing]

FIG. 1 is a schematic block diagram for explaining the present invention in detail, and FIG. 2 is an explanatory diagram of one row of data. 1: Page memory 2: Data indicating pattern size 3: Indicating ]-code of pattern J data 4; Line break data 5: Code analysis section 6: Code conversion pointer 7: Line memory 8: Font memory Patent applicant Higashi shiku yk company

Claims (1)

[Claims] a page memory that stores the print pattern size and code;
A font memory that stores the print pattern, a line memory that stores the effective address of the print pattern on the font memory, and a code conversion pointer that specifies the effective address of the print pattern on the font memory based on the size and code of the print pattern. This method stores the effective address on the font memory of the print pattern in the line memory according to the specification of the code conversion pointer, and reads the print pattern from the font memory based on the stored contents, and the code conversion A printing pattern generation method characterized by updating the contents of a pointer in arbitrary printing units.