JPH08244308A - Image processing device - Google Patents

Abstract

PURPOSE: To reduce cost by processing data with a composite function at high speed and minimizing the capacity of memory for image data. CONSTITUTION: Print data from a host device is first received by a print data receiving part 20 and then is divided into band lists by a division means 21. A scheduling means 22 determines a development order by which the divided print data is developed into bit map data and a development area into page memory. Next, a means for developing data by segment unit develops the divided print data into bit map data based on schedule information or allocation information, and stores the developed bit map data in page memory. In addition, an image transfer means 24 transfers the bit map data stored in page memory sequentially to a printing mechanism part 25 by segment unit. The printing mechanism part 25 actually prints the bit map data.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention is an image in which a character code or graphic data supplied in page units from a host computer via a network is expanded into bitmap data and the bitmap information in page units is output. Regarding a processing device.

[0002]

2. Description of the Related Art Conventionally, for example, printers, copying machines,
In an image processing apparatus having a plurality of functions such as a FAX, print data (character code, figure, page, etc.) in page units supplied from a plurality of host computers via a network.
It is known that an image, a print position, a size designation, etc.) is developed into bitmap information and the bitmap information is output according to each output format. In a conventional image processing apparatus, a controller unit that receives print data from a host computer, converts the print data into a video signal, and sends the video signal to a printing mechanism unit (printer engine), and a video signal sent from the controller unit. Is formed of a printing mechanism section for forming a visible image on a sheet by using an electrophotographic process and printing the image.

Based on the print data supplied from the host computer, the controller section develops the print information for one page in the image memory as a bit map according to the performance of the printer engine, and expands it in the image memory. The bitmap information is converted into a video signal and transferred to the printing mechanism section to obtain a sustain output. Further, the printing mechanism section operates the paper feed / conveyance system in the printer engine based on the control signal from the controller section, and at the same time, sends the video signal supplied from the controller section to the laser beam / LED array / liquid crystal light emitting element An image is formed on the photosensitive drum with a photosensitive agent such as toner, and the image is transferred to the paper fed by the paper feeding / conveying system to obtain a visible image. Use to stabilize.

However, in the above-mentioned conventional image processing apparatus, when the print data is expanded into the bitmap, it is expanded by one page in accordance with the performance (speed) of the printer engine, so that the image memory is disadvantageously increased. there were. Moreover, if the performance (speed) of the printer engine is improved, continuous printing can be performed, but for that purpose, it is necessary to secure an image memory for several pages instead of one page, which leads to an increase in cost. There was a problem.

Therefore, as a method of reducing the capacity of the image memory, Japanese Patent Laid-Open No. 4-323061 has a capacity capable of dividing print data for one page into a plurality of portions and expanding the divided print data. A band control has been proposed in which at least two image memories are provided and the image is developed and printed in synchronization with the speed of the printer engine. In the image processing apparatus using the band control method, it is necessary to develop the bitmap in synchronization with the printer engine. However, since a complicated document takes too long to be developed, it may not be possible to synchronize with the printer engine and may not be printed (overrun). In order to avoid this overrun, this image processing apparatus synchronizes with the printer engine by shifting the position or size of the divided area (segment) to make the development speed to the bitmap uniform, A method is used in which a segment that cannot be synchronized with the engine, that is, a segment whose expansion time is long is predicted in advance, the segment is expanded in advance in a bitmap, and the segment is stored in an image memory or a secondary storage device. ing.

[0006]

However, in the above-described conventional image processing apparatus for predicting a segment having a long expansion time in advance, it is difficult to predict, and the expansion may not be in time, or the secondary storage device, etc. However, there is a problem that the whole operation becomes slow because of the overhead for saving the data in the. Also, if the printer engine itself has multiple functions such as network and facsimile functions, it will take a lot of processing time overhead other than the expansion time to the bitmap. There is a problem that it is difficult to accurately predict a segment that takes a long time.

In addition, a method in which unpredictable processing such as network and facsimile functions is distributed to different CPUs (central processing units), etc., and the load on the bitmap expansion processing is not considered. However, a CPU, a memory, and the like must be provided for each function, which complicates the configuration of the device itself, reduces versatility, and raises costs.

The present invention has been made in view of the above circumstances, and provides an image processing apparatus capable of simultaneously processing complex functions at a high speed, reducing the capacity of an image memory, and reducing costs. Is intended.

[0009]

In order to solve the above-mentioned problems, in the invention according to claim 1, in an image processing apparatus having a plurality of functions and processing a plurality of output processes in parallel, at least the input Has a capacity capable of storing an image of one page of data that has been input, and stores the storage data divided into a plurality of areas and the output data corresponding to each of the plurality of partial areas that form the input one page. ,
Management means for managing the expansion order for each of the plurality of partial areas, and determining to which area of the plurality of areas of the storage means the image is to be expanded.

According to the second aspect of the invention, the priority order setting means for dynamically setting the priority order for each image expanded in the storage means according to the processing status, and the priority order setting means set the priority order. And a developing means for developing an image of the data for each of the plurality of partial areas based on the priority order.

Further, in the invention according to claim 3, when the image development times of the plurality of partial areas are held and the storage means has no free area, the priority order is low,
In addition, it is characterized by comprising an erasing means for erasing an image having a short image development time to make it an empty area.

[0012]

According to the present invention, the output data corresponding to each of the plurality of input partial areas constituting one page is managed by the management means for each of the plurality of partial areas, and is stored. A region in which the image is to be developed is determined from a plurality of regions of the means. The input data for one page is image-developed in the development order determined by the management means and stored in a predetermined area of the plurality of areas of the storage means. As a result, it is possible to simultaneously process the composite functions at high speed, reduce the capacity of the image memory, and reduce the cost.

[0013]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described with reference to the drawings. A. Configuration of Example A-1. Block Configuration FIG. 1 is a block diagram showing the configuration of an image processing apparatus according to an embodiment of the present invention. In the figure, reference numeral 1 denotes a host device such as a computer on a network, which prints print data in a predetermined format on a host interface 2
Supply to The print data is composed of character codes for actually performing print processing, data such as figures and images, print data for designating a print position and size, and control data for the print mechanism unit. The control data is, for example, data for designating the paper feed mode switching control. The host interface 2 receives the print data supplied via various interfaces such as serial, Centronics, and net, and the microprocessor 3
Supply to The microprocessor 3 executes a predetermined program and controls each unit. In particular, in this embodiment, the print data is divided into predetermined segments, the processing order is scheduled, and the page memory 7 to be described later is operated. An area is secured, and the divided print data is bit-mapped in the work area based on the priority set dynamically according to the scheduling. The above program is stored in the program ROM 4. The memory 5 is used as a working area of the microprocessor 3.

Next, a DMA (Direct Memory Access) controller 6 transfers image data between memories at high speed without going through the microprocessor 5. As described above, the page memory 7 is divided in units of segments and is divided into predetermined areas so as to store bitmap data that has been bit map expanded, and at least one page of bit map data is stored. It has become so. The bitmap data expanded in the page memory 7 is stored in the buffer memory 8 in segment units.
The bit addressing unit 9 generates a read address of the bitmap data and sequentially supplies it to the parallel-serial converter 10 in order to sequentially output the bitmap data stored in the buffer memory 8 as serial data. The parallel-serial converter 10 reads the bitmap data from the buffer memory 8 according to the read address, converts the bitmap data into serial data, and the printing unit 1
Output to 1. The printing unit 11 is formed by a laser output unit, a photoconductor, an optical system that forms a latent image corresponding to bitmap data on the photoconductor by a laser beam, a conveyance unit that conveys a paper from a paper tray, and an optical system. The transfer unit is configured to transfer the toner applied to the latent image onto the sheet.

A-2. Functional Configuration Next, FIG. 2 is a block diagram showing the functions of the image processing apparatus described above and the flow of print data or bitmap data. In the figure, the print data receiving unit 20 is
The print data supplied from the host computer is received via the network, and the print data is supplied to the segment dividing means 21. The print data, as described above,
It is composed of character codes for actual print processing, data such as figures and images, print data for specifying the print position and size, and control codes for the print mechanism unit. The control data is, for example, data for designating paper size and paper feed mode switching control that defines the paper feed direction. The segment dividing unit 21 takes out print data for one page from the print data and further divides it into segment units. Here, the print data divided into units of one segment will be referred to as a band list. The means after the segment dividing means 21 manages and processes the band list unit. In addition, since all the images described in any page description language such as print data supplied from a computer, image data read by an image reading device, and facsimile data supplied for facsimile are divided into band lists. , The types are narrowed down.

Next, the scheduling means 22 performs scheduling for determining in what order the print data divided into the band list is expanded into bitmap data, and which area of the page memory 7 is used for bitmap expansion. A memory allocation process is performed to decide whether or not to execute. The schedule information and the allocation information are supplied to the segment unit expansion means 23. The segment unit expansion means 23 expands the print data divided into segment units into bitmap data based on the schedule information and the allocation information, and stores the bitmap data in the page memory 7. The image transfer unit 24 also sequentially transfers the bitmap data stored in the page memory 7 to the printing mechanism unit 25 in units of segments. The printing mechanism unit 25 is configured to actually print the bitmap data supplied in segment units.

A-3. Functional Block of Print Processing Next, FIG. 3 is a block diagram showing each function in the print processing by the image processing apparatus described above. In the figure, 1
Reference numerals a, 1b, 1c, 1d and 1e are the above-mentioned host computer 1, the host computer 1a is connected to the interface 2a of the image processing apparatus, and the host computers 1b to 1e are interfaces via a network (line). 2b or interface 2c
It is connected to the. The interfaces 2a, 2b,
Reference numerals 2c correspond to the above-mentioned host interfaces 2, respectively, and receive print data supplied from a host computer or a network connected to each, and are supplied to the print job management units 30a, 30b, 30c.

Print job management units 30a, 30b, 30c
Controls the entire processing of print data supplied from each interface, and sets the print data supplied via the interface to the priority setting unit 31.
a, 31b, 31c. Priority setting unit 31
a, 31b, and 31c set job priority orders that specify the print data to be processed first, or the print data to be processed first, according to the supply order of the print data and the usage status of the resource (function) of the image processing apparatus. To do. When the job priority order is set in the supply order, for example, the job priority order is sequentially increased from the supplied print data so that the print data is expanded into the bitmap data first. When the job priority is set according to the resource usage status, for example, when the print data is facsimile data and the facsimile function is not used in the image processing apparatus, the job priority of the print data is set. If the facsimile function is used, the job priority of the print data is lowered so that the job is processed later.

The job priority order is dynamically set for each band list. For example, the job priority order of the print data of the band list transferred to the printing unit can be lowered. Has become. The processing regarding the job priority order will be described later. The print data to which the job priorities are assigned are supplied to the segment dividing units 32a, 32b, 32c, respectively. The segment dividing units 32a to 32c divide print data in units of a predetermined segment (band list) in the order of higher job priority, and supply the print data divided into band lists to the predicting units 33a, 33b, and 33c. .

The predicting units 33a to 33c predict, for each print data divided into the band list, the expansion time required for expansion into bitmap data based on the time measured by the timer unit 34, and calculate the expansion time. The divided print data is supplied to the control unit 35 in association with each other. The timer unit 34 measures time, supplies the measured time to the prediction units 33a to 33c, and also supplies the time to the queuing unit 36. The control unit 35 sequentially supplies each print data divided into the band list to the queue unit 36 based on the job priority and the predicted development time. The queue unit 36 holds each print data that is sequentially supplied in a queue, and supplies the print data to the print processing control unit 37 sequentially from the previously supplied print data. The print processing control unit 37 expands the print data divided into band lists, which is held in the queue unit 36, into bitmap data, and prints the print data (facsimile data, etc.) that does not require expansion to the print unit 39. An area (segment) for storing the supplied and expanded bitmap data is acquired in the page memory 7, etc.
8 and the printing unit 39 are controlled. The decoder 38 expands the print data into bitmap data, and the page memory 7
Store in the segment acquired in.

At this time, the segment of the page memory 7 is divided so as to have a capacity capable of storing the bit map data of the print data divided into the band list. When the print data divided into the band list is expanded into bitmap data, the page memory 7 may have an empty segment or a segment in which bitmap data having a job priority lower than itself is stored. In some cases, it is expanded into bitmap data based on the job priority. In addition, about this processing,
The operation will be described in detail. Further, the segment of the page memory 7 in which the bitmap data transferred to the printing unit 39 is stored has the job priority lowered, and is released after printing is completed. When outputting a plurality of copies of print data of a plurality of pages, it is necessary to internally perform a so-called electronic sort in which bitmap data is internally sorted in page units. In this case, once the printed bitmap data is transferred to the printing unit 39 again, if the segment of the page memory 7 is released,
Since it has to be expanded to bitmap data again and it takes time, the priority is simply lowered without releasing the segment. The printing unit 39 corresponds to the printing unit 11 described above, and conveys the paper from the laser output unit, the photoconductor, the optical system that forms a latent image corresponding to the bitmap data on the photoconductor by the laser light, and the paper tray. Transport section,
The transfer unit is configured to transfer the toner applied to the latent image formed by the optical system onto the sheet.

B. Operation of Embodiment Next, the operation of the above-described embodiment will be described. Here, FIG. 4 is a flow chart for explaining the operation of the present embodiment, and FIG. 5 is a schematic diagram for explaining the bitmap data expansion processing according to the present embodiment. First, the host computer 1 via the host interface 2
When the print data is supplied from the microprocessor 3,
Sets the job priority order that determines which print data is processed first or the processing order according to the print data supply order and the usage status of the resources (functions) of the image processing apparatus (priority order setting). Parts 31a, 31b, 31c). For example, when setting the job priority order in the supply order, as shown in FIG. 5, when four print data are supplied, the job priority order is increased from the supplied print data. In this case, the job priorities are jobs A, B, C,
The order is D. Therefore, the print data corresponding to the job A is preferentially expanded into the bitmap data. In addition, as described above, when the job priority is set according to the resource usage status, for example, when the print data of the job B is facsimile data, the facsimile function must be used in the image processing apparatus. For example, the job priority of the print data is increased so that the print data is processed first.

Next, the print data to which the job priority is assigned is divided by the microprocessor 3 in units of a predetermined segment (band list) in descending order of the job priority (segment dividing units 32a, 3).
2b, 32c). Further, for each print data divided into the band list, the microprocessor 3 predicts the expansion time required for expansion into bitmap data based on the time measured by the timer unit 34 (prediction unit 33a to
33c). The predicted development time is associated with each divided print data. After that, the print data divided into the band list is sequentially held in the queue based on the job priority and the predicted expansion time, as shown in FIG. 5 (queue unit 36). In FIG. 5, the print data of job A is divided into band lists A1 to A4, and the print data of job B is divided into band lists B1 to B4, and the process waits for expansion into bitmap data.

In the above-mentioned state, first, in step S1 shown in FIG. 4, it is determined whether or not there is a free segment in the page memory 7. If there is no free segment in the page memory 7, the determination result in step S1 is "N.
"O" and the process proceeds to step S2. The case where there is no free segment in the page memory 7 is, for example, the case where the bitmap data developed in the job before this time occupies the page memory 7. However, even if there is no such empty segment, if the bitmap data has already been transferred to the printing unit, it is faster to use the segment to expand the whole process depending on the situation. Therefore, the segment is released and used for expansion into bitmap data. Therefore,
If there is no free segment, in step S2, the segment having the lowest job priority for the bitmap data expanded in the segment and the minimum expansion time among the segments of the page memory 7 is released.

In the present embodiment, the bitmap data expanded in the page memory 7 is left in the page memory 7 as it is even after being transferred to the printing unit 11 in a predetermined order, and the job priority is simply lowered. This is the printing unit 11
If the bitmap data expanded in a predetermined segment of the page memory 7 is discarded as it is after transferring the data to the page memory, that is, if the segment is released, when a paper jam (jam) described later or electronic sorting is performed, This is because it needs to be expanded into bitmap data, which takes time. Therefore, if there is no free segment, as described above, the segment having the lowest job priority and the minimum development time is released and used for the next job. The bitmap data of the released segment must be expanded into bitmap data again when jamming or electronic sorting is performed. However, since this bitmap data has the minimum expansion time actually measured at the time of expansion, even if it is expanded again, it can be expanded in the shortest time among the bitmap data expanded in the page memory 7 at the present moment. It is possible.
Therefore, as a whole, it is possible to develop the bitmap data in a short time. When the predetermined segment is released, the process proceeds to step S3.

On the other hand, if there is a free segment, the result of the determination in step S1 is "YES", and the process proceeds directly to step S3. In step S3, an empty segment or a released segment is acquired for print data of the band list to be developed at the present time.
Next, in step S4, bitmap data is expanded in the segment acquired in step S3. For example, in the example shown in FIG. 5, the band list A1 is stored in the page memory 7
It is expanded to the segment Seg2 of. Next, step S
In step 5, it is determined whether or not the expansion for one page is completed (or whether the remaining expansion time is sufficient for printing even if the printing unit 11 is activated). If the expansion for one page is not completed (or if the expansion time is sufficiently long for printing), the determination result in step S5 is "NO", and the process returns to step S1. Less than,
By repeating steps S1 to S5, the band lists A2, A3, A4 of the job A are expanded in the order of the empty segment or the released segment of the page memory 7. In the example shown in FIG. 5, the band list A2 is expanded in the segment Seg4 of the page memory 7, the band list A3 is expanded in the segment Seg1, and the band list A4 is expanded in the segment Seg3. When the bit map data is expanded, the actual expansion time required for actual expansion is measured, and the actual expansion time is replaced with the above-mentioned predicted expansion time. This actual development time is the same as the above-mentioned step S2.
And is used when searching for a segment with the minimum expansion time.

When the expansion for one page is completed,
The determination result in step S5 is "YES", and the process proceeds to step S6. As described above, step S
5, when the printing unit 11 is activated, if the remaining development time is sufficiently in time for printing, for example, the band list A
If the expansion of band list A4 is completed while the bitmap data of band lists A1, A2, and A3 are printed at the time when the expansion to the end of 3, the printing unit 11 is started, the band list A3 When the expansion of is completed, the process proceeds to step S6. The predicted development time is estimated whether the development time is in time for printing. And step S
In 6, the bitmap data that is the expanded print data of job A is transferred to the printing unit 11 in the order of the band list. The printing unit 11 forms a latent image corresponding to the bitmap data on the photoconductor by a laser beam from the transferred bitmap data, and the toner applied to the latent image is applied to the paper conveyed from the paper tray. Transfer and eject.

The job priority of the bitmap data stored in the segment transferred to the printing unit 11 is first lowered. Then, after one page is completely printed, the segment for the band list of that page is released. Further, during the printing process described above, development into bitmap data is performed. In the example shown in FIG. 5, the band list B1 of job B is the band list A4 of job A.
Print data is expanded in the expanded segment Seg3. As described above, the job B having a low job priority is
When a job with a high job priority does not use the microprocessor 3 and there is an empty segment, or when the microprocessor 3 is not used, and the job priority is lower than itself. It is expanded into bitmap data only when there is a segment that the job has acquired. As described above, even if the segment with the lowest job priority and the minimum expansion time is released, this bitmap data has the minimum actual expansion time, so it is necessary to expand it again. However, it can be deployed in the shortest time.

Normally, when printing in page units, when a paper jam (jam) occurs, one page must be printed again. In this case, either (a) usually, all the images are stored until the end of printing, or (b) it is re-developed from the beginning. In the method (a), the recovery is fast, but one page of image must be held until the output is completed.
It is necessary to provide page memory for pages. Further, in the above method (b), the image acquisition amount can be small, but the bitmap data must be expanded again, which requires a recovery time. On the other hand, according to the above-described embodiment, the image transferred to the printing unit 11 has its job priority lowered and is released only after the printing is completed. That is, the corresponding segment of the page memory 7 becomes empty. Therefore, only the bitmap data (image) of the segment assigned to the next job need be restored (developed). Also, the printing unit 1
The bitmap data transferred to 1 is only lowered in job priority until the paper is ejected, and when segments are used, the one with the fastest expansion time is used first. , If you need the bitmap data of the segment, you need only expand the bitmap data, you can quickly recover (recovery), and not waste the next image that has already been expanded. become.

In the case of performing electronic sorting, either (c) the expanded bitmap data is stored separately in a secondary storage device or the like, or (d) expansion is performed once. However, in the method (c), the cost is high, and in the method (d), the processing is delayed because the expansion is performed once. On the other hand, according to the present embodiment, when a document having a small number of pages is electronically sorted, only bitmap data (segment) having a short expansion time is released from the page memory 7 except when the number of pages is large. Since the bitmap data (segment) having a long expansion time is resident, the expansion time is short and the high speed processing can be performed again. Further, when the number of pages is large, the method of (d) is naturally approached gradually, so that the method can be realized without being aware of the number of sheets to be sorted, etc., and the processing can be performed at high speed depending on the number of sheets to be sorted.

Further, the page memory 7 is divided into segments, and the segment release processing described above cannot be applied to one-page compression coded data as in the facsimile. However, the K line is calculated based on the size of the segment, and MR (Modified Read) is performed.
When converting to a system and expanding again, if the MR code is expanded according to the K line, it can be treated in the same way as other codes. In other words, the MR system K line may be used as a segment unit code, that is, a band list. As a result, all data can be handled in the same way, and parallel operation is possible.

[0032]

As described above, according to the present invention, when one page of print data is divided into a plurality of areas and each area is expanded into bitmap data, the bitmap data is converted into the bitmap data. Since the priority order that dynamically changes according to the overall processing status is set and the expansion processing is sequentially performed based on the priority order and the expansion time, it is possible to simultaneously process the composite functions at high speed, and The advantage is that the capacity of the image memory can be reduced.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of an image processing apparatus according to an embodiment of the present invention.

FIG. 2 is a block diagram showing the functions of the image processing apparatus according to the present embodiment and the flow of print data or bitmap data.

FIG. 3 is a block diagram showing each function in print processing of the image processing apparatus according to the present embodiment.

FIG. 4 is a flowchart for explaining the operation of the image processing apparatus according to the present embodiment.

FIG. 5 is a schematic diagram for explaining a bitmap data expansion process in the image processing apparatus according to the present embodiment.

[Explanation of symbols]

1 host device 2 host interface 3 microprocessor (management means, priority setting means, expansion means, erasing means) 4 program ROM 5 memory 6 DMA controller 7 page memory (storage means) 8 buffer memory 9 bit addressing section 10 parallel serial Converter 11 Printing unit 20 Print data receiving unit 21 Segment dividing unit 22 Scheduling unit (Management unit) 23 Segment unit expansion unit (Expansion unit) 24 Image transfer unit 25 Printing mechanism unit 1a, 1b, 1c, 1d, 1e Host computer 2a , 2b, 2c Interfaces 30a, 30b, 30c Print job management sections 31a, 31b, 31c Priority order setting sections (priority order setting means) 32a, 32b, 32c Segment dividing sections 33a, 33b, 33c Part 34 timer unit 35 control unit 36 queue unit 37 print processing control unit 38 decoder 39 printing unit

Claims (3)

[Claims] 1. An image processing apparatus having a plurality of functions and processing a plurality of output processes in parallel, having at least a capacity capable of storing an image of input data for one page, and having a plurality of areas. Divided storage means, and output data corresponding to each of the plurality of input partial areas constituting one page, for each of the plurality of partial areas,
An image processing apparatus comprising: a management unit that manages the expansion order and determines in which of the plurality of areas of the storage unit the image is to be expanded. 2. A priority order setting means for dynamically setting a priority order according to a processing situation for each image expanded in the storage means, and the priority order set by the priority order setting means. The image processing apparatus according to claim 1, further comprising a developing unit that develops an image of data for each of the plurality of partial areas. 3. The image development times of the plurality of partial areas are held, and when the storage area runs out of space, the images having the low priority and the short image development time are erased to become empty. 3. The image processing apparatus according to claim 2, further comprising erasing means for setting the area.