JPH01116656A - Sequence control system for copying machine - Google Patents

Abstract

PURPOSE:To unify control system and to attain the control, etc., of an erase lamp by constructing a pointer which shows compared data and an sub routine head address or a head address arranged to be capable of relating with the data on a RAM. CONSTITUTION:The random access memory (RAM) 1 provides a numerical table which is sequentially compared with a pulse counted value, the table for the pointer 2 which shows the sub routine head address or the head address, which is executed corresponding to the respective numerical values, the pointer 2 which instructs the execution position of a table equal to the maximum number of copied sheets conveyed in a copying path at the same time in copying actions and a counter 3 for counting the pulse counted value, and rearranges the numerical table and an address table so as to control in series on the table according to a copying mode. Thus, the control of a resist clutch and the erase lamp can be possible in the same control system.

Description

DETAILED DESCRIPTION OF THE INVENTION Technical Field The present invention relates to a sequence control system for a copying machine.

Prior Art Conventional copying machine sequence control methods (e.g.
According to Japanese Unexamined Patent Publication No. 61-107261), there is a sequence control table on the ROM, so
It is not possible to control the timing that changes depending on the mode, such as resist clutch on/off, erase lamp on/off control, etc., and these are separate controls.
There was a drawback that the program was complicated.

Purpose The present invention was made in view of the above-mentioned circumstances.
In particular, the purpose of this invention is to move the sequence control table, which was conventionally located on the ROM, onto the RAM, thereby making it possible to control the resist clutch and erase lamp using the same control method.

Configuration In order to achieve the above object, the present invention provides a copying apparatus that uses a microcomputer to count the pulses of a pulse generator and executes sequence control based on the counted value.
A numerical value table that is sequentially compared with the pulse count value, a table of pointers indicating the start address or the start address of a subroutine to be executed corresponding to each of the numerical values, and a table of pointers that are conveyed within the copying path at the same time during the copying operation. A pointer pointing to the execution position of the table for the maximum number of copies and a counter for counting the pulse count value are provided, the numerical table and the address table are rearranged according to the copy mode, and parallel control is performed on the table. It is characterized by this. Hereinafter, the present invention will be explained based on examples.

Registration (alignment of the image on the photoconductor with the transfer paper) roller control requires adjustment to compensate for variations between machines, and depending on the mode that creates the binding margin, the transfer paper is aligned with the image. advance or lag behind. The same goes for controlling the erase lamp (a function that erases excess images on the photoconductor (not reflected on the transfer paper)), which requires adjustment and changes depending on the binding margin mode. Depending on the function, on/off control is variable. Such control can only be performed at fixed timings by comparing fixed data on the ROM with timing pulse values. Therefore, in the present invention, variable timing is obtained by constructing data to be compared and a subroutine start address or a pointer indicating the start address arranged so as to be associated with the data on the RAM.

Various types of tables can be constructed on the RAM, and for example, they can be constructed as shown in FIGS. 4 to 7. FIG. 4 shows the comparison data (na'nd) to be compared with the pulse count value and the start address (address a to address d) of the program to be executed as a result of comparing the comparison data. An example of arranging them as a pair, FIG. 5 shows an example of arranging them separately, and FIGS. address a
- An example in which the pointer pointing to address b is replaced with a mill pointer d, and the case where the example shown in FIG. 4 is used will be described below.

FIG. 1 is a configuration diagram for explaining one embodiment of the present invention. As shown in FIG. A pointer 2 indicating the execution position of the table and a pulse counter 3 for counting pulses from the pulse generator 4 are provided on the RAM.

Figure 2 is a time chart when the RAM table shown in Figure 1 is executed, and Figures 3 (a) to (f) are subroutines for address routes arranged in the RAM table shown in Figure 1. FIG.

Next, the operation of the present invention will be explained. When the copying operation is started by pressing the print key, the pointer is set to indicate the top position of the table, and the pulse counting counter is initialized to 0.

The pulse value in the table indicated by the pointer is compared with the contents of the pulse count counter, and if the conditions for the pulse count count pulse value (table) are met, the pointer is advanced to the next pulse value position and JAMP to the subroutine address. Now, the pulse count counter is “0”
'', compare it with the first pulse value "0" and the condition is met, so set the pointer to the pulse value "4" and JAMP to address C.

Subroutine C (FIG. 3(C)) is executed. Next, the pulse value II 417 will be compared with the counting counter. If it is a pulse count counter (pulse value (table)), the pointer remains unchanged and the subroutine is not executed.

In this way, by sequentially executing from the top of the table, the load is turned on and off as shown in FIG.

Up to this point, only one sheet of transfer paper is present in the copying path; however, since a copying apparatus normally performs continuous copying operations, a plurality of copying sheets are present in the copying path at the same time. For example, when a certain transfer paper starts feeding, the previously fed transfer paper may be in the process of transferring an image, or the previous transfer paper may be in the process of being fixed. Controls in such cases are shown in Figures 8 to 1 below.
This will be explained with reference to FIG.

In FIG. 8, the number of pointers and the number of pulse counting counters are added to those shown in FIG. 1. The number of pointers and counters is determined by how many times the entire process of the copying operation is completed than the number of pulses required for the repeat operation shown in the time chart shown in Fig. 9. In the case of Fig. 9, the number of repeat pulses =8. Total process, process = 21, so 21÷
8≠3, therefore, three are required. Next, the operation of the embodiment shown in FIG. 8 will be explained.

When the number of copies is set to 3, for example, and the print key is pressed, the motor of the copying machine rotates, and synchronized pulses are output from the pulse generator to the microcomputer. Further, when the copying operation is started by pressing the print key, the pointer is set to indicate the top position of the table, and the pulse counting counter is initialized to 0.

Typically, a pulse signal from a pulse generator is connected to an interrupt input terminal of a microcomputer.

Therefore, the pulse counting routine shown in FIG.

It is included in this interrupt processing program. Further, the pulse control routine shown in FIG. 11 can be included in the above-mentioned interrupt program or in the main routine.

The following description will be made assuming that the main routine includes a pulse control routine.

When the pulse count counter 31 is "0't," the subroutine C (FIG. 3(C)) at address C is executed according to the pulse control routine of FIG. 11, and the load 1 is turned on.

At this time, the pointer 21 is incremented once to put the paired address C into the register of the CPU, and incremented once more to indicate the next pulse value u 4 yt.

When the counter 31 reaches ``4'', subroutine d (Fig. 3 (d)) is executed, and the load 2 is turned on by subroutine e (Fig. 3 (e)). .

Next, when 11g II is reached, it is the repeat timing, so the contents of the pointer 21 are moved to the pointer 2□ by the pulse counting routine shown in FIG.

Counter 3. The contents of are transferred to counter 32, and pointer 2□
and the counter 31 is initialized. Therefore, the control for copying the first copy is transferred to the pointer 2□ and the counter 32, and the control for copying the second copy is performed by the pointer 2□ and the counter 31. By controlling in this way, parallel control as shown in FIG. 9 becomes possible. Pointers 21 to 2 at point a in FIG. The table position indicated by is shown in FIG.

Then, at the first repeat timing, in FIG. 10, the pointer 22 changes to the pointer 23 . Pointer 2° is pointer 2
2, counter 32 goes to counter 3.2. , counter 3□ is moved to counter 3□, pointer 2□ and counter 31
is initialized, and control of the first copy is controlled by pointer 2.
and counter 33, and pointer 2 controls the second copy.
2 and counter 3□, and the third copy is controlled by pointer 21 and counter 3□.Furthermore, at the next repeat timing, the set number of copies (3 copies) has already been set.
= The number of sheets fed is the same, so the repeat ends? Y at the discretion of
es, the pointer and counter cannot be moved, the subsequent processing is executed, and the process is stopped.

Next, with reference to FIGS. 12 to 15, the above RA
A method for creating a table on M will be explained. First, the table described so far corresponds to control table B in FIG. Table A is obtained by rearranging this table B in descending order of pulse values.

How table A is created is that, as shown in FIG. 13, only the addresses are set when the copying machine is first powered on. Thereafter, after the print key is pressed, only the pulse values are calculated and each data is stored in the memory. This is FIG. 14.

When the calculated pulse values are written into table A, table B is created and copy 0 processing (copy operation control) is started. For details on creating table B, see Chapter 15.
As shown in the figure, the pulse values in the memories 7 to 12 are compared in magnitude, and the pulse values and addresses are written in order from the smallest pulse value to create the memory.

By doing this, it becomes possible to execute the same processing format using a composite table of variable data and fixed data.

effect As is clear from the above description, according to the present invention.

(b) The control method can be unified, making the program cleaner.

(b) Pulse comparison programs can be shared.

(c) Unifying the control method makes debugging easier.

There are advantages such as

[Brief explanation of the drawing]

FIG. 1 is a block diagram of main parts for explaining one embodiment of the present invention, FIG. 2 is a time chart for explaining the operation of FIG. 1, and FIG. 3 is a subroutine of FIG. 1. Figures 4 to 7 are diagrams each showing a configuration example of a table used in implementing the present invention, and Figure 8 is a diagram showing the main part configuration for explaining another embodiment of the present invention. 9 is a time chart for explaining the operation of the embodiment shown in FIG. 8, and FIGS. 10 and 11 are flow charts for explaining the operation of the embodiment shown in FIG. 12 to 15 are diagrams for explaining a method of creating a RAM table. 1...RAM, 2...Pointer, 3...Pulse counting counter, 4...Pulse generator. 1st Prisoner Figure 2 (0) 11-Russ Counting i 0I23456789
101112131415161718192021 3rd El 'RAM' 6E Figure 7 Figure 10 Figure 14 gA Figure 15

Claims (1)

[Claims] In a copying machine that uses a microcomputer to count pulses from a pulse generator and performs sequence control based on the counted value, a numerical value table that is sequentially compared with the pulse counted value is stored in a RAM (random access memory); A table of pointers indicating the start address or start address of a subroutine to be executed corresponding to each numerical value, and a table of pointers indicating the execution position of the table for the maximum number of copy sheets conveyed within the copy path at the same time during copying operation. A sequence control method for a copying machine, characterized in that a pointer and a counter for counting the pulse count value are provided, the numerical value table and the address table are rearranged according to a copy mode, and parallel control is performed on the table.