JPH04177972A - Facsimile communication system - Google Patents

Abstract

PURPOSE:To prevent overflow of a receiver side memory in picture transmission by providing a means calculating the quantity to be consumed of the receiver side memory when a data of a succeeding line is sent to the system so as to control the system such that a fill data is added before the quantity to be consumed of the memory of the receiver side exceeds the full capacity. CONSTITUTION:A control section (CPU) 10 has a means 33 comparing a reception memory capacity 31 and a full capacity 32 and processes a fill control section 17 so that the quantity to be consumed in the reception memory does not always exceed a limit. That is, when the accumulated value of the transmission time of the succeeding line is larger than the accumulated value of a recording time, fill data are added. Moreover, even when the accumulated value of the transmission time of the succeeding line is smaller than the accumulated value of the recording time, the quantity to be consumed by the memory of the receiver when the data of the succeeding line is sent is calculated, and when the quantity to be consumed by the memory exceeds the full capacity, the fill data are added. Thus, number of times of the addition of the fill data is reduced and the overflow of the receiver side memory possibly caused is effectively precluded.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to an improvement of a 7-axis communication system that increases the communication speed by controlling the addition of fill data to encoded scanning lines on the transmitting side. It is something.

[Conventional technology]

In recent years, in view of the increase in #J[m
There is a desire to shorten image transmission time.

In conventional 9, for example, ASH facsimile apparatuses, an international standard (CCITT) stipulates a minimum transmission time for one line of encoded documents when transmitting a document. If this is not sufficient, fill data is filled in as shown in the flowchart of the conventional example in FIG. On the receiving side, data is recorded with a recording time equal to this minimum transmission time.

In response to this problem, the present inventor proposed a method for increasing the transmission speed by reducing the above-mentioned fill data as much as possible in Japanese Patent Application No. 1-2985N6 entitled "Facsimile Transmission System".

FIG. 5 is a low-level explanatory diagram of the 7Axismi9 device of the conventional example and the proposed example, and the cpvt is shown with a double frame.

Common except for internal controls.

In the figure, in the conventional example, a device 11 is a cpvl.

Function settings are made on the operation unit 11 under the control of the original T-reader 12 during transmission, and the document is inserted into the T-reading unit 12 and scanned and read for each line. The image data control unit 15 performs encoding compression,
For example, a code string compressed using the Modified Huffman (ME) method is transmitted to the modem 1 under the control of cpvlo.
5, the signal is modulated into a carrier wave, and transmitted to the destination device 1 through the line (by the line control unit 16).

Conversely, during reception, the code string received from the line control section 16 is demodulated by the modem 15 under the control of the CPU 10, restored by the image data control section 15, and printed on paper by the recording section 14. Note that the above is a general basic configuration, although there may be minor changes due to the addition of various functions.

On the other hand, in the proposed example, as shown in the flowchart of FIG. 7, fill data is inserted for each line, and since the transmission time is delayed, we considered shortening this. That is, as shown in the double frame in FIG. 5, when transmitting a document, the transmission time cumulative value up to the previous line of the encoded scanning line stored in the L cumulative section 21 in cpv1a and the received The comparator 26 compares the accumulated recording time value stored in the P accumulator 22 on the side, and determines that even if the transmission time of the long line is smaller than the minimum transmission time, the accumulated transmission time 1 is the accumulated recorded time. If the value is large, the fill data is not added, and if the value is small, the fill data is added only.
The configuration is controlled by 7.

FIG. 6 is a flowchart showing the operation of the proposed example.

In the figure, encoding of image data and calculation of transmission time for each line are the same as in the conventional example. The subsequent processing is
Using the configuration of the proposed example in PU 1a, the cumulative value of the transmission time is calculated, and for the recording time, the cumulative total of one shift equal to the preset minimum transmission time is calculated, and the two are compared.

As a result of the comparison, if the cumulative transmission time (1t) is greater than the cumulative recording time, proceed without fill data,
If it is small, ID0L is added. This is 9L over multiple lines due to the length of transmission time for each line. It is possible to move from L=P without fill data.

Considering the conventional method for each line, fill data must be added to some of the lines, so the present invention can reduce the addition of fill data by that amount. This operation is repeated until the final line, and as a result, the number of times fill data is added decreases.

[Problem to be solved by the invention]

In the above method, when MH encoding is performed, if a line with a long transmission time is first followed by a line with a short transmission time, such as an all-day line, from the middle, this line is naturally encoded without adding a fill. Take the method of sending a line. However, on the receiving side, the received ME-encoded data is once stored in a memory, and each piece of data is restored to create data to be sent to the printer. Therefore, if the capacity of the receiving memory is small, there is a possibility that C) MH row encoded data may accumulate before being restored, resulting in an overflow. In order to prevent this, the inventor of the present invention considered adding a fill before over 70- by monitoring the reception memory usage since adding a fill has the effect of delaying over 70-. be.

SUMMARY OF THE INVENTION An object of the present invention is to provide a facsimile communication system that uses a fill data addition method to prevent overflow of a receiving side memory during image transmission.

[Rounding method to solve the problem]

Ninth to achieve the above objective, as shown in the M1#Ao principle explanatory diagram, when transmitting a document, the cumulative value of transmission time up to the previous line of the encoded scanning line on the transmitting side and the cumulative recording time on the receiving side Only if the cumulative transmission time value is smaller than the cumulative recording time value (■).

■) In a facsimile transmission system that controls the addition of fill data and transmits images, means for calculating the amount of memory used on the receiving side when transmitting the next line of data.■
, and the configuration is such that fill data is added before the amount of memory used on the receiving side exceeds the full capacity (■, ■).

[For production]

The usage of the memory on the receiving side is monitored, and the fill data is added before the full capacity is overflowed to prevent the overflow of the fill data in the proposed example. This has been corrected by the following.

〔Example〕

FIG. 2 is an explanatory diagram of the configuration of an embodiment of the present invention.

In the figure, the difference from the proposed example in Figure 5 is that the control unit (
It has means 53 in the CPU) 10 for comparing the reception memory usage amount 51 and the total capacity 32, and performs the geography of the fill control section 17 so that the reception memory usage amount does not always exceed the limit value. be.

FIG. 5 is a flowchart showing the operation of the embodiment.

In the same figure, according to the procedure of the proposed example shown in FIG. 6, when the cumulative value of the transmission time of the next line becomes larger than the cumulative value of the recording time, fill data is added.

Furthermore, even if the cumulative value of the transmission time of the next line is smaller than the cumulative value of the recording time, the present invention calculates the memory usage of the receiving device when transmitting the data of the next line. If the memory usage exceeds the full capacity, fill data is added as described above. Of course, if it does not exceed the limit, there is no need to add fill data. Repeat this until the final line.

FIG. 4 is a chart showing the operation of the embodiment as a line application, a proposed example, and a concrete example of the state of the present invention.

The elements of the proposed example are the cumulative transmission time it'i and the cumulative recording time P on the receiving side, as well as the memory usage A and total memory capacity B of the receiving device of the present invention, and the relationship L≧F, A
≧J, the presence or absence of addition of fill data is graphed as a judgment item. The minimum transmission time is 2. %a, the usage up to the reception memory line is t-5 lines (j), and the total capacity is 15 minutes.

Here, up to the 6th line, L≧P is YE! i, A≧B−
fiNo is established, and fill data is unnecessary in both cases. If the transmission time of the next 4th line is 1sa, then L≧P is N
Since it becomes O, fill data is added.

As a result, in the fifth line, L≧P becomes YES, but now, OA≧B of the present invention is reversed to YES. That is, it can be seen that the receiving side memory exceeds 70- in the next line. Therefore, add fill data in advance to prevent this.

When the transmission time of the next 6th line is 788, L≧P is reversed to YE'l and A≧B is reversed to No, so there is no need for cipher data that is in the same state as the ig1 line.

Geography is done in the same manner from the 7th line onwards.

In this way, when L≧P and A≧B are YE:S and No, fill data is not added, and when either is reversed, processing is performed rather than adding fill data.

〔Effect of the invention〕

As explained above, according to the present invention, according to the proposed example, 1
By comparing and determining the transmission time for each line and the recording time on the receiving side, the number of additions of fill data O can be reduced. Memory overflow 70- can be effectively prevented. Moreover, since the same file data can be added to the control A, control becomes extremely easy.

[Brief explanation of drawings]

Fig. 1 is a basic fIA diagram of the present invention, Fig. 2 is an example tV
Figure 5 is a flowchart showing the operation of the embodiment;
The figure is a diagram explaining a specific example of the operation of the embodiment, the fifth decoy is an explanatory diagram of the conventional example and the proposed example, FIG. 6 is a flowchart showing the operation of the proposed example, and FIG. 7 is a flowchart showing the operation of the conventional example. In the figure, 10 is a control unit (CPU), 11 is an operation control unit, 12 is a reading unit,
15 is an image data control section, 14 is a recording section, 15 is a modem,
16 is a time control section, 17 is a fill control section, and 21 is a transmission T.
IAtt*, 22 indicates the total number of recorded T, 25.55 indicates the soft part, 51 indicates the amount of reception memory used, and 52 indicates the total amount of data.

Claims (1)

[Claims] When transmitting a document, the cumulative transmission time up to the previous encoded scanning line on the transmitting side is compared with the cumulative recording time on the receiving side, and the cumulative transmission time is recorded. In a facsimile transmission method for transmitting an image while controlling to add file data only when it is smaller than a time cumulative value, the receiving side comprises means for calculating the amount of memory used on the receiving side when transmitting the next line of data. A facsimile communication method that controls the addition of file data before memory usage exceeds the full capacity.