JPH11215334A - Facsimile equipment - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a facsimile equipment that sends at first a cover page to a receiver side by reading data sequentially, even if a memory capacity is fully occupied so that reading can be continued. SOLUTION: This facsimile equipment reads originals sequentially from an N-th page which is a final page, and when a memory is fully occupied in an n-th page, the originals up to (n-1)-th pages are read. Then original data on the N-th page are deleted from the memory to release the memory full state. Then the n-th page original which is a next original is read, and data are stored in an idle memory area. While repeating the processing above, the originals up to the 1st page and a coverage page being the 1st page is transmitted.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a facsimile apparatus, and more particularly, to a facsimile apparatus equipped with an automatic document feeder (ADF) for conveying and reading a document from the last page.

[0002]

2. Description of the Related Art In a facsimile apparatus in which an ADF is mounted, a large number of documents set in the ADF are sequentially sent to a reading unit, and the read document data is temporarily stored in a memory and then transmitted, the memory full, There is a facsimile apparatus having a function of sending a file to a read position without erasing even if the capacity of the memory becomes full due to accumulated document data.

[0003]

As described above, even when the memory becomes full, a facsimile apparatus that transmits a file (page) without reading the file without erasing the file is an ADF mounted on the facsimile apparatus. In the case of the method of feeding the document from the bottom side, that is, the method of feeding the document from the last page, if the memory becomes full during the feeding of the document, the document is sent from the middle to the last page. . Therefore, this facsimile machine has a page ordering function in the memory (reverse order management by reading).
However, the cover page is generally placed at the top of the manuscript, so the sender cannot send the cover page first.

Japanese Unexamined Patent Application Publication No. 7-298016 discloses a facsimile function that can continue transmission effectively even when memory full occurs during memory transmission. For documents that cannot be sent at once, edit the document data that has been read halfway and additional data that informs the receiving side that it is in the middle, and send it out automatically. Techniques have been proposed for eliminating interruption of operation. However, this only prevents confusion on the receiving side by notifying the receiving side user that the transmission is partial from the subsequent page, and does not solve the above-described problem.

SUMMARY OF THE INVENTION It is an object of the present invention to provide a facsimile apparatus capable of first sending a cover page to a receiving side by performing ordering and continuing reading even when the memory becomes full. It is.

[0006]

According to a first aspect of the present invention, there is provided a facsimile apparatus equipped with an automatic document feeder for conveying and reading a document from the last page. If the memory for storing the original data becomes full while reading the original data, the function to delete the original data in the memory sequentially from the last page, which is the first page read, and continue reading It is characterized by having.

[0007] To achieve the above object, the present invention provides a second aspect.
According to the invention described in the first aspect, when a page is deleted due to a memory full condition, the user is notified of the deleted page by a message to the operation unit or a storage result report. It is assumed that.

According to the first aspect of the present invention, when the memory is full, the original data in the memory is sequentially deleted from the last page which is the first page read, and reading is continued, so that the first page of the original is read. Page can be sent as long as the page is not full of memory.

According to the second aspect of the present invention, the number of pages that cannot be read after the memory becomes full is displayed on the operation unit or printed on the storage result report, so that the user can recognize the memory full state.

[0010]

Embodiments of the present invention will be described below with reference to the accompanying drawings. FIG. 1 is a block diagram of forward link management, and FIG. 2 is a block diagram of backward link management. In the forward link management shown in FIG. 1, a pointer link is provided from the file management unit 1 for managing all pages to the page management unit 2 for managing the first page, and a link is provided from the first page to the second page. The operation is repeated, and a link is provided from the (N−1) th page to the final Nth page to the page management unit 2. And the final N
From the page, a link is provided to the file management unit 1.

In the backward link management shown in FIG. 2, a pointer link is provided from the file management unit 1 for managing all pages to the page management unit 2 for managing the Nth page, which is the last page. A link is provided to the N-1th page which is the previous page, and a link is provided to the file management unit 1 from the first page. FIG. 1 and FIG.
The entire file is managed by the two types of links shown in FIG.

Next, the processing operation of the present invention when the memory is full will be described. FIGS. 3, 4 and 5 are block diagrams showing the first, second and third steps of the basic processing operation when the memory is full. The case where the memory becomes full when the number of documents is N and the n-th document is read will be described. First, the storage of the document data in the memory is started, and the data is read from the Nth page to the (n-1) th page in order (see FIG. 3).

During the reading of the n-th page, a memory full at which the memory capacity becomes the limit is detected. Here, before an image is input from the scanner, a memory amount expected to be used is reserved. When there is no free space at that time, the memory becomes full. When the memory full is detected, the document data of the N-th page, which is the last page, is deleted from the memory as shown in FIG.

Then, as shown in FIG. 5, the document of the nth page is read using the memory area vacated by the page deletion, and the data is stored. At this time, if there is not enough memory (if the memory becomes full), the document data of the (N-1) th page is deleted from the memory. By repeating the above processing steps, the cover page for the first page can be finally transmitted.

FIG. 6 is a flow chart of a processing operation when the memory is full according to the embodiment of the present invention. First, ADF
The first page (N page), which is the first document fed from the printer, is read (S1). Next, it is determined whether a memory full occurs (S2). If a memory full occurs (Y in S2), the document data of the Nth page, which is the last page, is deleted from the memory (S3), and the page is stored (S4).

If the memory full has not occurred (N in S2), it is next determined whether or not the reading of the original has been completed (S5). If the reading has been completed (Y in S5), then the remaining original is read. It is determined whether or not there is (S6). If there is a remaining document (Y in S6), the next page is read (S7), and the process returns to step S2.

If there is no remaining document (N in S6), the memory storage is terminated (S8). If the memory full has not occurred (N in S9), this flow ends. If the memory is full (Y in S9), a page that is not stored in the operation unit or the storage result report, that is, a page that cannot be read is displayed to notify the user (S10), and this flow ends. I do.

The facsimile apparatus according to the embodiment of the present invention reads an original in order from the Nth page, which is the last page, and reads up to the (n-1) th page when the nth page becomes full. Then, the memory full state is canceled by deleting the document data of the Nth page from the memory. Then, the next document, the n-th document, is read, and the data is stored in an empty memory area. While repeating such processing, the first page is read and a cover page, which is the first page, is transmitted. Therefore, even if the memory becomes full during the reading of the document, the cover sheet can be sent to the other party, which is excellent in usability.

[0019]

According to the first aspect of the present invention, when the memory is full, original data in the memory is sequentially deleted from the last page which is the first page read, and reading is continued. Since the cover page, which is the first page of the document, can be transmitted as long as the page does not become full, the usability can be improved.

According to the second aspect of the present invention, the number of pages that cannot be read after the memory becomes full is displayed on the operation unit or printed on the accumulation result report.
The user can recognize the memory full state, and can improve the usability.

[Brief description of the drawings]

FIG. 1 is a block diagram of forward link management.

FIG. 2 is a block diagram of backward link management.

FIG. 3 is a block diagram showing a first step of a basic processing operation when the memory is full.

FIG. 4 is a block diagram showing a second step of the basic processing operation when the memory is full.

FIG. 5 is a block diagram showing a third step of the basic processing operation when the memory is full.

FIG. 6 is a flowchart of a processing operation when a memory is full according to the embodiment of the present invention.

[Explanation of symbols]

 1 File management section 2 Page management section

Claims (2)

[Claims] In a facsimile apparatus equipped with an automatic document feeder for conveying and reading a document from the last page, a memory for storing document data while reading document data of a predetermined page is in a memory full state. If it becomes
A facsimile apparatus having a function of sequentially deleting original data in a memory from the last page, which is the first page read, and continuing reading. 2. The apparatus according to claim 1, wherein when a memory full occurs and a page is deleted, the user is notified of the deleted page by a message to the operation unit or a storage result report. Facsimile machine.