KR950004056A - How to Expand Input Buffers for Your Printer - Google Patents

Abstract

The present invention relates to a method of expanding an input buffer of a printer. In the related art, all data are stored in order even when the same data is input, thereby degrading memory use efficiency and hardware area for storing a large amount of data. In the case of processing the stored data, there is a problem of causing time loss because the same data cannot be processed in a batch and must be processed one by one.

In view of this, in the present invention, when the same data is input, the number of the same data is counted to store only the corresponding input data and the count value, so that the storage area of the buffer can be expanded, thereby improving the use efficiency and processing the same data. The processing speed can be shortened by repeating the count as much as the count value.

Description

How to Expand Input Buffers for Your Printer

Since this is an open matter, no full text was included.

Figure 2 is a block diagram of the printer of the present invention, Figure 3 is an exemplary view showing the compression of the input data according to the present invention.

Claims (3)

When data is input, the current data is compared with the next input data. If the data is the same, the number of identical data is counted, and only the input data and the count value are stored, and the current processing when the data stored in the buffer is processed. And a data processing step of repeating the current processing data by a count value if the data is matched with the following processing data. The method of claim 1, wherein the data storing step comprises: a first step of storing the input data in the buffer TEMBF and comparing whether the data comparison flag EQFG is "1", and in the first step, the data comparison flag EQFG is " If not 1 ", the second data is stored in the buffer TEMBF in the buffer PREBF, and the data comparison flag EQFG and the count value COUNT are set to " 1 " Step 3, if the data comparison flag (EQFG) is "1" in the first step, and the third step of determining whether the stored data of the buffer (TEMBF) (PREBF) is the same, and in the third step of the buffer (TEMBF) (PREBF) If the stored data coincides, the fourth step of increasing the count value (1) to "1" and determining whether the count value (COUNT) is "255", and if the count value (COUNT) is not "255" in the fourth step, When the first step is repeated and the count value COUNT is 255, the buffer PREBF stores two bytes of stored data. The fifth step of repeating the first step after storing the value COUNT, clearing the data comparison flag EQFG to "0", and the stored data of the buffer TEMBF and PREBF coincide in the third step. If not, compare the count value to "1" and if it is "1", save 1 byte of data in buffer (PREBF) and repeat step 2. If not, "1", data in buffer (PREBF) And a sixth step of repeating the second step after storing two bytes and storing a count value (COUNT). The data processing step of claim 1, wherein the data processing step comprises storing the data of the current address TEMADD in a buffer TEMDATA and comparing the data of the next address TEMADD + 1 with the current data in the first step. If the next data does not match, the second step of processing the data of the buffer (TEMDATA) and repeating the first step with the next address (TEMADD + 1) as the current address (TEMADD), and in the first step If the current data and the next data coincide, the data of the next address (TEMADD + 2) is used as the count value (COUNT), and the data of the buffer (TEMDATA) is repeatedly processed by the count value (COUNT) and the next address (TEMADD + 3). And a third step of repeating the first step with the current address (TEMADD). ※ Note: The disclosure is based on the initial application.