JPS58171169A - Method for receiving coin of public telephone set - Google Patents

Abstract

PURPOSE:To remove the limitation of the duration of a call, by receiving a coin accumulated on the lowermost position of a route during the call when the unreceived charge of the call exceeds the amount of said coin and the route is filled with coins, and calculating exactly the total charge for the call at the end of the call. CONSTITUTION:When a transmitter/receiver of a telephone circuit 10 is unhooked, a control part 20 is actuated and the operation is started by power supply from a power supply part 15. A coin processing part 30 discriminates the kinds of injected coins and that the injected coins are real one or nor, accumulates the injected coins on one accumulation route and stores the kinds of coins and the injected order of the coins in the RAM 24. After starting the call, the CPU 22 counts up charging signals from a station and stores the counted value in the RAM 24 as an unreceived charge. When the route is filled with coins and the unreceived charge exceeds the amount of the coin located on the lowermost position of the route, the CPU 22 designates the reception of the lowermost coin to the coin processing part 30 to enable the sucdeeding coin to be injected. After completing the call, the CPU 20 selects the kinds of accumulated coins so that the user's loss of change is minimized and designates the reception of the coins to the coin processing part 30.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a coin storage system in a public telephone that stores a plurality of types of coins in one storage track in the order in which they are inserted.

Conventionally, public telephones with one storage track have adopted a method of storing coins sequentially starting from the lowest coin according to the arrival of a billing signal. Therefore, when using different types of coins together, such as low denomination coins and high denomination coins, for example, Priority is given to low denomination coins, high denomination coins, or a minimum damage method that minimizes the damage to the user's change, and it is not possible to adopt an arbitrary storage method.

As a means to solve this problem, coins are not stored during a call, and after the call ends, a combination of stored coins is selected to settle uncollected call charges using various storage methods, and the stored coins are sequentially stored and returned according to the selection results. There is a way to sort it out.

However, when using such a method, on the other hand, it is impossible to make a call that exceeds the storage capacity of the storage track, and since the storage capacity has its own limit, there is a drawback that the call time is limited.

The present invention has been made in view of the above situation, and its purpose is to adopt any storage method while storing a mixture of multiple types of coins in one storage track. Moreover, it is an object of the present invention to provide a coin storage system for public telephones that does not impose restrictions on call time.

In order to achieve this object, the present invention is provided with a coin detection means for detecting the insertion of a coin and a means for determining the type of the lowest accumulated coin. In addition, when additional coins are inserted when the unaccumulated call charge is larger than the coin amount of the lowest accumulated coin, the lowest accumulated coin is stored. In addition, it is equipped with a storage lever that distributes the input coins into the storage track and the return path, and when the lowest coin is stored under the conditions described above in response to additional coin insertion, the storage track is full. If additional specie coins are inserted at a time when the coins are not in use, the accumulation lever is operated to permit accumulation of the specie coins. Hereinafter, the present invention will be explained in detail using Examples.

DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 is a circuit diagram showing an embodiment of the present invention applied to a central power supply type public telephone.

In this embodiment, the line with the exchange is established by disconnecting the handset (off-hook) without waiting for coins to be inserted, and after a certain number of calls have been made, the telephone charges for that period are calculated. This is an example in which a so-called front loop/rear storage method is adopted to store coins, and a minimum damage method is adopted that causes the least damage to the user's change.The overall configuration can be roughly divided into a normal telephone circuit section 10, A control section 20 receives a billing signal from an exchange (not shown) through the telephone circuit section 10 and controls coin storage, return, etc. and actually detects and sorts coins based on instructions from the control unit 20, stores them in a safe (not shown),
Alternatively, it consists of a coin processing section 30 that performs returns. Also,
In addition, hook switch 40, relay control circuit 50,
It has a display circuit 6o1 and a numeric keypad keyboard 70 having a 3×4 matrix configuration.

The telephone circuit 10 is connected to an exchange (not shown) via a central office line through central office line terminals Ll and L2. Then, the station line terminal L1. L2 includes a bell circuit 11 that notifies that there is an incoming call, a billing signal receiving circuit 12 that detects a billing signal from the exchange, a diode bridge circuit 13, and a relay contact gBz dial pulse sending and forced disconnection circuit 14.
, a power supply circuit 15, and a communication circuit 16 are sequentially arranged and connected.

In the above configuration, in the on-hook state with the handset placed, the contact gs is in the state shown in the figure, but if you go off-hook in this state, the hook switch 40 is turned on, the relay control circuit 50 is activated, and the contact gs is in the state shown in the figure. Switching to the opposite side from that shown in the diagram (hereinafter referred to as operating or turning on, and returning to the state shown in the diagram is referred to as turning on or off)
. Accordingly, the central line terminal L1. A DC loop including dial pulse sending and forced disconnection circuit 14 and speech circuit 16 is closed for L2.

Here, a transistor is inserted in the circuit 14 in series with the DC loop, and although it is always on, it is repeatedly turned on and off in response to a dial signal from the control section 20. In addition to transmitting a dial pulse to the switching equipment side to notify the other party's subscriber number, the switch also receives continuous off signals from the control unit 20, so that it is continuously turned off and the contact gs is turned off. The DC loop can be forcibly cut off while remaining in the operating state.

In this way, the DC loop is closed and closed via relay contact g8.
The reason why the release was made so effective is that since this public phone uses a retractable system, even when the hook switch 40 is turned off, a power supply is required to settle uncollected call charges. . That is, the circuit 13 forcibly disconnects the DC loop, notifies the exchange that the call has ended, and after recovery, turns on again, using the power source of the power supply circuit 15, which is charged by the current from the exchange. You can perform payment processing using

Note that while the dial pulse is being sent out, the telephone call circuit 16:
Since the dial shunt signal inputted from the control section 20 creates a short circuit state, the calling party is not affected by noise caused by the dial pulse.

Further, the power supply circuit 15 includes a constant voltage diode ZD1. Backflow blocking diodes DI, D2, D3, D4, D due to the Zener voltage of ZD2
5, capacitors CI, C2, and C3 are individually charged, and their terminal voltages are set to the power supply voltages VEE, VMG, and VD.
The capacitor C1 is charged only when off-hook, but the capacitors C2 and C3 are charged even when on-hook. The power supply voltage VER, which is always necessary for backing up the variable memory 240 (described later), the power supply, which is heavily consumed to operate the electromagnet when processing coins, and the diode bridge circuit 1.
3 is for keeping the polarity of the voltage applied to the circuit 15 and the communication circuit 16 constant regardless of the polarity of the DC voltage from the exchange applied between the office line terminals Ll and L2.

The control unit 20 includes a well-known input/output port 21. Central processing unit (hereinafter referred to as CPU) 22. Fixed memory (hereinafter referred to as ROM)23. In addition to a variable memory (hereinafter referred to as RAM) 24, a timing circuit 25 and a variable condition setting circuit 26 are further provided. This timing circuit 25 has a length of 25 m.
It is composed of an oscillation circuit that generates pulses of 5 cycles, and is used to give an interrupt signal to the CPU 22 to interrupt the main program processing at 25 m1B, as will be described later. Further, the variable condition setting circuit 26 is used to arbitrarily set, for example, the call time per unit charge in a local call or the unit call charge per charge, that is, the tariff, and is configured by a digital switch or the like. be done.

In the above configuration, the off-hook shift switch 4
0 suddenly turns on, the contact gs is operated by the relay control circuit 50, the DC loop is closed, and the power supply circuit 1
5 capacitor C1 is charged. As a result, CPU2
2K power supply voltage VDD is supplied, and the CPU 22 operates the RA according to the processing program stored in the ROM 23 in advance.
A predetermined control operation is executed while writing and reading necessary data to and from M24. This operation will be explained in detail later using a flowchart.

The coin processing section 30 includes a coin sorting device 31. Storage magnet 32. It is composed of a storage magnet 33 and a return magnet 34.

Here, the coin sorting device 31 is used to determine whether or not the inserted coin is a genuine coin that is scheduled to be used in this new machine, and to determine whether the coin is a genuine coin or not. For example, a coin outer diameter identification device equipped with an optical sensor consisting of a light emitting element and a light receiving element t arranged opposite to each other across the falling trajectory of the coin, and a coin outer diameter identification device equipped with an optical sensor consisting of a light emitting element and a light receiving element t arranged opposite to each other across the falling trajectory of the coin; The coin material sorting device includes a detection coil consisting of a transmitter coil and a receiver coil that are electromagnetically coupled. In other words, the former emits light and
The latter utilizes the fact that the time it takes a falling coin to follow the optical path between the light receiving elements differs depending on the outer diameter of the coin. Although different materials are utilized, all of these are known, and in the application of the present invention, the structure of this coin sorting device [31 is not limited to this, and any other arbitrary structure may be used. Since a sorting means can be used, detailed explanation will be omitted.

Based on the selection results of the outside diameter and material selection device, a determination is made as to whether the coin is a genuine coin or a counterfeit coin. If the coin is a genuine coin, a selection signal corresponding to the type is sent to the CPU 22 and stored in a certain area of the RAM 24. For example, the coin used is 10
If there are four coins of 0 yen, 50 yen, 20 yen, and 10 yen, the memory area with a capacity of 8 bits having a specific memory address in RAM 24 is used as the coin input memory, and the lower 4 coins are
The bits are made to correspond to each denomination, and if a sorting signal indicating a 100 yen coin is input, the fifth bit from the top is selected, and the sixth, seventh, and eighth bits are selected from the top as the denomination decreases. 1'', it is possible to confirm which denomination of genuine coin has been inserted by checking the contents of this coin insertion memory. Note that the signal line from the coin sorting device 31 to the control unit 20 is shaded and the number @4# is attached next to it to indicate that signal lines for sending out sorting signals are provided for each of the four denominations. It is something that

The detection and sorting of inserted coins as described above is carried out every 25 m5 in an edge detection processing step placed at the beginning of the interrupt processing program, as will be described later.

Storage magnet 32. Storage magnet 33. The return magnet 34 operates a storage lever, a storage lever, and a return lever, which will be described later, respectively, and is operated by an operation command signal from the control unit 20.

A supplementary explanation of these will be given later using FIG. 2.

It is composed of a display with an index display method and a display control circuit that controls the display, and under the control of the control unit 20, displays the amount of unused coins obtained by subtracting the uncollected call charges from the total amount of accumulated coins, that is, the value of credits. , inform the caller. Although the configuration of the display 60 is not particularly limited, a liquid crystal display, for example, is suitable from the viewpoint of suppressing power consumption.

The overall circuit configuration of the public telephone according to this embodiment has been described above, and FIG. 2 shows an outline of its track configuration.

In FIG. 2, coins 101 inserted from a coin input port 100 are sorted by a coin sorting device 31 while moving down an inclined sorting track 102.

The lower end of the sorting track 102 leads to a return port (not shown) as indicated by arrow A, and a storage lever 103 is disposed in the middle thereof, and this storage lever 103 connects to the storage magnet 32.
When the coin 101 is attracted by the excitation of the coin 101 and withdraws from the orbit, the coin 101 enters the storage orbit 104. Accumulation trajectory 10
It consists of a 4-ton inclined track, with 3 storage magnets at the bottom end.
3, and a storage lever 105 and a return lever 106 that are attracted and operated by the excitation of the return magnet 34 are arranged.

When the storage lever 105 and the return lever 106 are in full operating condition, the coins 101 are stored in this storage track 104. In this embodiment, the storage capacity is 5 sheets.

On the other hand, when the storage lever 105 is operated and withdrawn from the track, the coin 101 is stored in a safe (not shown) as shown by arrow B. Further, when the return lever 106 is operated and withdrawn from the track, the coin 101 is guided to the return port as shown by arrow C.

Note that the specific configurations of each of the above magnets and levers are arbitrary.

Explanation of operation Next, the operation of the public telephone having the above configuration will be explained as shown in Figs.
This will be explained using the flowchart shown in FIG. Note that the explanation here is limited to the scope necessary for understanding the flow of processing specific to the present invention, and details of well-known processing operations that are naturally required for control using a CPU are not provided. It is omitted.

Overall Operational Description First, the overall operational flow of the main routine shown in FIG. 3 and the interrupt routine shown in FIG. 4 will be explained.

As mentioned above, in this embodiment, an interrupt signal is input to the main routine shown in FIG. 3 at a cycle of 25 m5, and the routine shown in FIG. 4 is interrupted. Although the time actually required for processing the interrupt routine is not constant in some cases, processing is started every 25 mB, and the operation of returning to the main routine processing after a series of steps is repeated.

That is, first, when the caller removes the handset from the on-hook state, the contact gs operates as described above, and the DC loop is closed, making it possible to supply the power supply voltage VDD.

Therefore, when the control section 20 is supplied with the predetermined power supply voltage VDD, the initialization processing step 1 in FIG.
Execute. That is, the CPU 22 accesses the ROM 23 and stores data in each memory area of the RAM 24 and the input/output board 21.
Initialize the backup memory, etc. At the final stage of this initialization process, the operation of the coin sorting device 31 is permitted, and interrupts are also permitted, and the timing circuit 25 starts sending out an interrupt signal. Therefore, from now on, the CPU 22 executes the process shown in the interrupt routine in FIG. 4 every 25 m5, regardless of the progress of the main routine in FIG.

Next, an outline of this interrupt routine will be explained.

That is, when the execution of the program shifts to interrupt processing, edge detection processing step 2000 is executed first.

Here, the telephone circuit unit 10 via the input/output boat 21
and each input signal inputted from the coin processing unit 3o, and stores data representing the results in a predetermined memory area of the RAM 24. For example, the billing signal receiving circuit 12
When a billing signal is input through the charger, the content of the billing flag memory is set to "1" and a billing flag indicating the arrival of the billing signal is set. Further, data indicating the insertion of the coin is written into the coin insertion memory of the coin sorting device 31.

Next, the program execution is dial control processing step 2.
Move to 001. That is, if there is an input from the push-button dial configured by the keyboard TOK, the type of dialed number is determined depending on the input, such as whether it is within the city or outside the city, and whether it is a toll-free or prohibited number. Since it is not directly related to the gist of the above, detailed explanation will be omitted.

When the dial control process is finished, the program execution is
Next, the process moves to display processing step 2002. Here, as described above, processing is performed to display the amount of credit on the display device constituting the display circuit 60, but since this is not directly related to the gist of the present invention, further explanation will be omitted.

Next, the program is executed in billing calculation processing step 20.
Move to 03. Here, it is checked whether or not a flag is set in the money flag memory, and if it is set, the contents of the uncollected call charge memory provided in a part of the RAM 24 are updated to 0, that is, this memory is used to store data indicating uncollected call charges, therefore, the tariff is added for each charge. Similarly, the tariff is subtracted from the contents of the credit memory indicating credits. Note that if the credit becomes less than 0 as a result of this subtraction, the content of the hook processing flag memory provided in the specific area of the RAM 24 is set to "1" and the hook processing flag is set. On the other hand, if the billing flag is not set, the program execution immediately moves to the next coin insertion process step 2004.

In this coin insertion processing step 2004, as will be described in detail later using the flowchart of FIG. 5, coin insertion is checked based on the contents of the coin insertion memory, and the storage magnet 32 is operated under certain conditions. , allowing the accumulation of coins.

In the next timer processing step 2005, RAM2
Depending on the content of each food timer request flag memory provided in 4, if the flag is set, the same <RAM
The contents of each timer provided in 24 are incremented by "1". That is, while the timer request flag is set, the contents of the timer are incremented every 25 m5, so that time can be measured based on the contents of this timer.

Program execution then moves to dialing processing step 2006. Here, in response to input from the keyboard 70, a dial signal indicating the number of the called party is sent to the exchange and notified.

After completing the interrupt routine once in this way, the program execution returns to the main routine again and processing is resumed from the interrupted position.

Now, in the main routine shown in FIG. 3, when the initialization processing step 1000 is completed, the execution of the program shifts to the self-diagnosis processing step 1001. This is to self-diagnose the presence or absence of coin jamming or other failures using various sensors (not shown) placed on the coin track, but the actual output state of the sensor system is detected in the edge detection processing step 2000. A flag indicating the diagnosis result is set in a predetermined flag memory.

Therefore, the process itself in step 1001 is to check the contents of a predetermined flag register, but since it is not directly related to the gist of the present invention, a detailed explanation will be omitted.

If it is confirmed that there is no abnormality, the execution of the program moves to call permission processing step 1002, and the return magnet 34 is operated to set the return lever 106 in a coin return inhibiting state, so that coins can be stored.

Therefore, if the calling party inserts a coin and performs a dialing operation, and the called party answers, a telephone conversation is started.

Next, the execution of the program moves to step 1003 to determine whether or not the hook is on-hook, and if the continuation of off-hook is confirmed by checking the input signal from the hook switch 40, the process moves to step 1004 to determine whether the hook is on-hook. do. On the other hand, if on-hook is confirmed, the process moves to step 1008, where a hook processing flag is set, and then the process moves to hook processing step 1009, which will be described later.

In storage determination processing step 1004, it is determined whether or not the lowest accumulated coin should be stored, according to certain conditions, as will be explained in detail later with reference to the flowchart of FIG.

Next, program execution moves to step 1005, which determines whether the hook processing flag is set, and if the flag is set, hook processing step 1 is performed.
Transition to 009. If the flag is not set,
The process moves to the next storage processing step 1006.

In this storage processing step 1006, the lowest coin is actually stored based on the result previously determined in the storage determination processing step 1004, as will be described in detail later with reference to the flowchart of FIG.

Next, the execution of the program moves to step 1001, which determines whether the hook processing flag is set, and if the flag is set, the process proceeds to hook processing step 10.
Move to 09. If the flag is not set, the process returns to step 10o3. Thereafter, as long as the call continues effectively, the processes from step 1003 to step 1ooy are repeatedly executed.

In the hook processing step 1009, by turning off the transistor of the dial pulse sending and forced disconnection circuit 14, the 800
The DC loop is disconnected for only mB. As a result, the end of the call can be notified to the exchange, and the power circuit can proceed to the next payment processing step 1010 while maintaining the same state as when off-hook. Note that at this point, the exchange will be restored, so there will be no more calls or billing signals.

In the settlement processing step 1010, as will be explained later with reference to the flowchart of FIG. 8, a combination of accumulated coins is selected to settle the uncollected call charges in a manner that minimizes the loss of change for the user.

Next, the program is executed in storage processing step 1011.
to move to. Here, the above-mentioned payment processing step 1010
According to the combination selected in , each accumulated coin is stored or returned in order starting from the lowest coin. The program itself is similar to the storage processing step 1006 described above, and will be explained in detail later using the flowchart of FIG.

Next, program execution moves to termination processing step 1012. Here, it is confirmed that the final predetermined display time for return items determined in the payment process has elapsed,
After confirming that the power supply voltage VMG has been charged to 4.5V or higher and further confirming that the on-hook state continues, the contact gs is restored.

Next, as mentioned earlier, for each step of coin insertion processing, storage judgment processing, storage processing, and payment processing, some particularly important memories are listed in the table below and their configuration is summarized. Let me explain. These memories are provided using specific areas of the RAM 24, and each has a capacity of 8 bits, similar to the coin insertion memory, uncollected call charge memory, credit memory, etc. described above.

First, the storage memory stores data indicating which denomination of coins are stored at the tongue storage position of the storage track 104. Here, the storage capacity of the storage orbit 104 is 5
Since there are 5 storage memories (O) to (4),
Each corresponds to five storage positions from the lowest position to the highest position, and stores data indicating the amount of each stored coin. As mentioned earlier, if the four denominations of coins used in this telephone are 100 yen, 50 yen, 20 yen, and 10 yen coins, data indicating the denominations of these coins,
In other words, in hexadecimal notation, °64" (100 yen), "32" (
50 yen), @14" (20 yen), and '"OA" (10 yen). The sixth memory (5) is a spare memory.

This will be discussed later.

Next, the storage number memory stores data indicating how many coins of which denomination are stored in the entire storage trajectory, and each memory (0) to (4) stores the highest denomination coin. (100 yen) to the lowest denomination coin (10 yen). In other words, the contents of the storage memory are rewritten for each denomination.

On the other hand, the storage number memory stores data indicating the number of coins to be stored among the accumulated coins by denomination, and each memory (0) to (4) stores the highest denomination coin (
100 yen) to the lowest denomination coin (10 yen).

In addition, the storage/return memory corresponds to the storage positions (0) to (4) from the lowest to the highest, and stores data indicating whether the coins at each storage position should be stored or returned. There is. In other words, if it is storage, '''01
' (in hexadecimal notation, the same applies below), in case of return, ``01#
, if neither is the case, "nl" is used as the processing end data.
Each data is stored. Therefore, the contents of this storage/return memory are the number of coins to be stored, which is shown in the contents of the storage number memory, and are assigned to the coins at each storage position. Allocation is performed, for example, starting from the lowest level. For example, if 10 yen coins are stored at the lowest and highest positions, and the number of coins stored is 1, storage data @01# is written to the storage/return memory (0) corresponding to the lowest position. 0 Coin Insertion Process FIG. 5 is a flowchart showing the coin insertion process routine. This coin insertion processing routine is executed following the billing calculation processing in the interrupt routine that is started every %25m5 period as described above.

When the program execution moves to the coin insertion process, first,
In step 2010, a determination is made as to whether new specie coins have been inserted. This is done by checking the data stored in the coin input memory. That is, if the bit corresponding to each denomination in the coin insertion memory is @1'', it means that a genuine coin of that denomination has been inserted.

Now, the denomination itself does not matter, but if the input of specie coins is confirmed, the program execution moves to step 2011,
Determine whether the storage orbit is full. This can be determined by whether or not coin amount data is written in the storage memory (4) corresponding to the topmost one.

If it is not full, the process immediately proceeds to storage magnet processing step 2013, where the storage magnet 32 is moved to retract the storage lever 103 from the track and guide the input coins 101 falling from the transfer to the storage track 104.

When accumulation is permitted in this manner, the contents of the credit memory and accumulation memory are then updated in coin insertion calculation processing step 2014. That is, the coin amount of the newly accumulated coin is added to the contents of the credit memory, and the coin amount data is written to the storage memory corresponding to the lowest storage position among the storage memories in which no coin amount data is written.

On the other hand, if the accumulation trajectory is already lζ full, the program execution moves from step 2011 to the next step 2012, where it is determined whether the uncollected call charge exceeds the lowest coin amount. be judged.

This includes the contents of the uncollected call charge memory and the accumulated memory (0
) by comparing the contents of

If the uncollected call charge already exceeds the lowest coin amount, step 2013 is subsequently executed and the inserted coins are accumulated; however, if the uncollected call charge is still below the lowest coin amount. , no accumulation is allowed and the inserted coins are returned directly to the return slot in an overflow state. As explained in the next storage judgment process and storage process, coins are not stored as long as the call continues, and the coins are not stored when the storage track is full and the uncollected call charge has already reached the lowest coin amount. This is due to the system in which the lowest coin is stored only when additional specie coins are inserted. That is, only when the above conditions are met, the storage of additionally inserted coins is allowed, and the lowest coin is stored. In this way, when storage is permitted in a full state, data indicating the coin amount of the additional coins to be inserted is provisionally written into the spare storage memory (5). In addition, when allowing accumulation when the coin is full, the storage of the lowest coin is done separately in the main routine, so if it is necessary to store it later, and there is a risk that the accumulation will not be carried out smoothly, It is sufficient to set the actual capacity of the storage orbit to 6 sheets.

Further, when executing step 2010, if additional insertion of genuine coins is not detected, this coin insertion processing routine is ended without any further substantive processing.

Next, storage determination processing will be explained.

Storage Judgment Process FIG. 6 is a flowchart showing the storage judgment processing routine. As described above, this storage determination process determines whether or not the lowest coin should be stored while the call continues.

When the program execution moves to storage determination processing, first,
In step 1020, the command "set the contents of storage return memory to 'FF'" is executed. Here, the process end data FF'' is stored in all five storage/return memories.
Similarly to 0, it is determined whether or not specie coins have been inserted.

If insertion of specie coins is detected, program execution moves to step 1022 and proceeds to step 20 as previously described.
Similarly to 11, it is determined whether the storage orbit is full or not.

If the storage is full, it is determined in step 1023 whether the uncollected call charge exceeds the lowest coin amount, similarly to step 2012 described above.

If the uncollected call charge exceeds the lowest coin amount, in the next step 1024, data @01# indicating collection is written in the storage/return memory (0) corresponding to the lowest coin.

On the other hand, if there is no input of specie coins, if the accumulation orbit is not full even if there is input, or if the unaccumulated call charge is less than the lowest coin amount even if it is full, the subsequent The storage determination processing routine ends without performing any processing.

Next, storage processing will be explained.

Storage Processing FIG. 7 is a flowchart showing the storage processing routine. As mentioned earlier, in this storage process, the storage/return of each accumulated coin is determined in the storage judgment process described above or the settlement process described in detail next, and data indicating the judgment result is written to the storage/return memory. This is done when each accumulated coin is actually stored and returned based on the data after being stored. However, as mentioned above, only the lowest coin is stored while the call is continuing.

When the program execution moves to storage processing, step 1
At 030, the storage/return memory (
0) is stored data.

If this is storage data, the process moves to the next coin storage processing step 1031, where the storage magnet 33 is operated to retract the storage lever 105 from the storage track, and the lowest coin is placed in the storage path leading to the safe. let it fall. In this case, a stop bin is operated by a well-known escape mechanism (not shown in the figure) in conjunction with the storage lever 105 to prevent the accumulated coins from falling down.

When coins are stored in this manner, the process then moves to coin calculation processing step 1032. Here, the contents of the storage memory are shifted down and the contents of the uncollected call charge memory are updated. In other words, each storage memory (1) to (51) from the second lowest to the lowest is
The coins are transferred to storage memories (0) to (4) corresponding to lower levels, and the amount of stored coins is subtracted from the contents of the uncollected call charge memory.

On the other hand, if the contents of storage/return memory (0) are not storage data, the program execution is performed in step 1.
The process moves from step 030 to step 1033, where it is determined whether the contents of the memory are return data.

If it is return data, the process moves to the next coin return processing step 1034, the return magnet 34 is operated to retract the return lever 106, and the lowest coin is dropped into the return path leading to the return slot. In this case as well, return lever 1
A stop bin operates in conjunction with 06 to prevent subsequent coins from falling.

Both the storage magnet 33 and the return magnet 34 have an operating time of 300 m+1, and are restored after 300 mB, and the storage lever 105 and the return lever 106 are also restored. Since the stop bin is also restored at the same time, the subsequent coin falls to the position where it is stopped by the storage lever 105 and the return lever 106 and becomes the lowest coin.

After the coin calculation processing step 1032 or the coin return processing step 1034 is completed, the program execution moves to an interval processing step 1035. This means that after operating the storage or return magnet to store or return the item, it will take 30 minutes until the next storage or return operation.
This is to set an interval of 0m5, and after the end, the program execution moves to step 1030 again.
The storage/return memory updated by the previous storage or return (
Check the contents of 0). Then, the same process as described above is repeated until the contents of the storage/return memory (0) become the process end data "FF".

That is, if the content of the storage/return memory (0) is "FF", steps 1030 and 10 are executed.
Immediately after step 33, the storage processing routine ends.

Therefore, while the call is continuing, as mentioned above, in one storage judgment processing routine, storage data @01'' is only written to one storage/return memory (0) depending on the case. The storage-processing routine either ends with one lowest coin stored or ends without storing or returning the coin at all.

On the other hand, after the end of the call, all accumulated coins are either stored or returned in accordance with the decision result in the payment processing described below.

Therefore, the payment processing will be explained next.

Settlement Processing FIG. 8 is a flowchart showing the settlement processing routine. As mentioned earlier, this settlement process is carried out after the call ends.
That is, this is to determine the combination of accumulated coins for settling uncollected call charges after hook processing step 1009 is completed.

When the program execution moves to payment processing, step 1
At 040, data indicating the number of accumulated coins for each denomination is stored in each accumulated quantity memory. This is done by counting the accumulated number of coins in order from the highest denomination coin according to the contents of the accumulated memory as described above, and storing the result in the corresponding accumulated number memory as the accumulated number of coins of the relevant denomination.

Next, in step 1041, a process is performed to round up the fraction of the uncollected call charge to the unit of the lowest coin amount.

That is, although the uncollected call charges are not necessarily an integral multiple of the minimum amount in coins, the amount that can actually be collected is based on the minimum amount in coins. Specifically, it is calculated by dividing the uncollected call charges by the minimum amount in coins, and if there is a remainder, add "1" to the quotient, and if there is no remainder, multiply the quotient itself by the minimum amount in coins. can.

Next, in step 1042, data indicating uncollected call charges is stored in a working memory provided in a specific area of the RAM 24. Thereafter, based on the data stored in the working memory, a combination of accumulated coins corresponding to the uncollected call charges is selected, but this is done in such a way that high value coins are stored preferentially.

That is, first, the presence or absence of coins is checked in order from the highest denomination coin. First, it is determined whether the coin is 1 or not. If the coin is not completed, in step 1044, the accumulated coins are checked from the accumulated coin amount (0) corresponding to the highest denomination coin. The operation starts by specifying the coins in order and checking the presence or absence of coins.

Therefore, if it is confirmed in step 1045 that coins of the relevant denomination are accumulated, step 1045
At step 46, the uncollected call charge as the content of the working memory is divided by the amount of the coin to find the permitted number of storages, that is, the maximum number of times the coin is stored that number of times without exceeding the uncollected call charge.

However, in reality, it cannot be stored unless there is actually that much accumulation. Therefore, in step 1047, it is determined whether or not the number of accumulated sheets is equal to or greater than the number of storage permissions.

In the first case, if the accumulated number is equal to or greater than the number of permitted storages, the total amount of coins for the number of permitted storages is subtracted from the uncollected call charge in step 1048, and it is assumed that the coins of the relevant denomination have been stored. Calculate the remaining uncollected call charges.

On the other hand, in the second case, when the accumulated number of coins is less than the permitted number of times of storage, in step 1049, the total amount of coins corresponding to the accumulated number of coins, which is the number of coins that can actually be stored, is subtracted from the uncollected call charges.

After one of the above subtraction processes is completed, data indicating the number of sheets stored is written in the storage memory in step 105G. That is, in the first case, the number of permitted storages is written as is, and in the second case, the number of accumulated sheets is written.

Next, in step 1051, it is determined whether or not the uncollected call charge has become zero as a result of the above-mentioned subtraction. If it is zero, the process moves to the next step 1052, but if it is not zero, the process returns to step 1043, and the steps are sequentially performed. Repeat the same process for low denomination coins. Note that in step 1045,
If it is confirmed that there is no accumulation of coins of the relevant denomination, the execution of the program immediately moves to step 1043 to perform processing on coins of lower denominations.

As a result, if the processing for Plenary Session 1 is completed even though the uncollected call charges do not become exactly zero, that is, if there is no combination of accumulated coins that exactly corresponds to the uncollected call charges, the program The execution moves from step 1043 to step 1053, where the minimum coin amount is added to the uncollected call charges, and the same processing as described above is repeated from step 1042 for the uncollected call charges after the addition. As a result, if a combination of accumulated coins with an amount matching the uncollected call charges cannot be selected, the minimum amount of coins is further added and the same process is repeated.

If a combination of accumulated coins that matches the uncollected call charges can be selected as shown in FIG. , and according to the contents of the number of stored sheets memory and storage memory,
The storage or return data is written to the storage/return memory. As mentioned above, this is a task of allocating the number of stored coins for each denomination to each coin actually stored as indicated by the contents of the storage memory, and the allocation is performed with priority given to the lower order.

Therefore, for example, the accumulated coins are 20 yen from the lowest,
If it is 20 yen or 100 yen, each storage memory (0) to (5
) are "14" (20 yen) and "14" respectively.

"64" (100 yen), "oo", "oo".On the other hand, the contents of the storage number memories (0) to (3) are "1", respectively.

rOJ, rlJ, rOJ, i.e. 10
If one 0 yen coin and one 20 yen coin should be stored, it is determined that the third 100 yen coin from the bottom and the lowest 20 yen coin should be stored, and the second 20 yen coin should be stored.
The yen must be returned. As a result, storage/return memo') (0) to (2) are "01" and -oo, respectively.
.

@Of" data is written.Remaining coin storage/return memory 1 corresponding to the storage position where no coins are actually stored.
The contents of 31 and +41 remain @FF'.

After it is determined whether to store or return each K of all accumulated coins and the data is written in the storage/return memory, the program execution moves to step 1011, where the storage process described above is performed. .

The operation of one embodiment of the present invention shown in FIGS. 1 and 2 has been explained in detail using the 70-charts in FIGS. 3 to 8. As such, this embodiment has the following effects.

In other words, as a general rule, coins are not stored while the call is ongoing.
At the end of a call, a combination of accumulated coins that is equal to or greater than the uncollected call charge and whose total sum is closest to the uncollected call charge is selected and stored, so that damage to the user's change can be minimized.

Additionally, even if the call is continuing, the lowest accumulated coins will be stored under the condition that additional specie coins are inserted when the accumulated orbit is full and the uncollected call charge is greater than the lowest accumulated coin amount. At the same time, by accepting the genuine coins into the storage track, it is possible to avoid restrictions on the callable time due to the capacity of the storage track. In particular, by making it a rule to accept only specie coins into the storage orbit, including when the storage orbit is not full, and to avoid accumulating invalid coins.
It is possible to continue the call more smoothly.

Similarly, it is effective to program the storage determination processing routine as follows as a means to avoid the restriction on call time.

The second embodiment, ie, FIG. 9 is a flowchart showing a storage determination processing routine in another embodiment of the present invention.

In the figure, when the execution of the program moves to storage determination processing, an instruction to set the contents of the storage/return memory to "FF" is executed in step 1060.

Next, in step 1061, specie was inserted.
- If there is an input, it is determined in step 1D82 whether the accumulation orbit is full or not, and if it is full, it is further determined in step 1063 whether the uncollected call charge exceeds the lowest accumulated coin amount. It is determined whether the
The flow of the process is the same as that of the first embodiment described with reference to FIG. 6, in which data indicating the storage of the lowest coin is written in the storage area, and if the storage value is exceeded, the storage determination processing routine is terminated.

However, if the insertion of a specie coin is not detected in step 1061, and if the accumulation track is not full in step 1062, the program execution moves to step 1065, and the lowest coin amount, i.e., the accumulation memory It is determined whether the contents of (0) are equal to the highest coin amount, and if they are equal, it is further determined in step 1066 whether the uncollected call charge exceeds the highest coin amount, that is, the lowest coin amount. and if it is above, step 10
If the lowest coin amount is not equal to the highest coin amount in step 1065, and if the uncollected call charge is less than or equal to the highest coin amount in step 1066, proceed to If so, the storage determination processing routine is immediately terminated.

In other words, regardless of the conditions of additional specie input and full accumulation, if the lowest value coin is the highest value coin, the lowest value coin is stored at 9:00 when the uncollected call charge still exceeds the coin amount. However, under the above conditions, collection while the call is continuing will be subject to settlement using the least damage method at the end of the call. It is clear that it has no effect at all.

Other Embodiments In the above-described embodiments, a sorting signal indicating the insertion of specie coins is taken into the CPU, and an operation command signal is given from the cPU to the storage magnet that moves the storage lever under certain conditions. The storage lever may be moved by applying a selection signal indicating the insertion of genuine coins to the storage magnet via a dedicated logic circuit.

In that case, for example, if the storage track is not full, or even if it is full but the uncollected call charge is larger than the lowest coin amount, the gate constituting the logic circuit may be opened by a signal from the CPU. Very good.

In addition, in the above-mentioned embodiment, a storage lever that is normally closed is provided, and this applies only to specie coins, but the input end of the storage track is kept open at all times, unless the storage track is full and overflows. Even if a method is used in which all input coins are stored, the effect of escaping the call time restriction remains the same.In other words, in this case, for example, it is stored in memory that the coin in question is a counterfeit currency. However, the coins can be treated as unconditionally returned. However, it goes without saying that a smoother process is possible if only specie coins are stored in the storage orbit from the beginning.

Further, in the above-mentioned embodiment, only the case where the user pays and stores the fishing scissors in a manner that minimizes the damage caused to the user after the end of the call is explained, but the application of the present invention is not limited to this. For example, any storage method can be adopted, such as giving priority to low-denomination coins or giving priority to high-value coins.

Effects of the present invention According to the present invention, in a public telephone that stores a mixture of coins of multiple types in one storage track, coins are not stored as a general rule while a call is continuing, but the coins are not stored until the storage track is full. If additional coins are inserted when the unstored call charge becomes larger than the coin amount of the lowest accumulated coin, the lowest accumulated coin is stored, thereby cleverly reducing the call time restriction due to the accumulated capacity. Payment can be made using any method while avoiding the above. In particular, by limiting the above-mentioned storage to only the cases in which specie coins are inserted and accumulating only specie coins by operating the accumulation lever, much smoother processing is possible.

[Brief explanation of drawings]

FIG. 1 is a circuit configuration diagram showing a public telephone to which an embodiment of the present invention is applied, FIG. 2 is an explanatory diagram showing the configuration of the coin track of the public telephone in FIG. 1, and FIG. A flowchart showing an example of the main routine program in the control section of the telephone, FIG. 4 is a flowchart showing an example of the interrupt routine program, FIG. 5 is a flowchart showing an example of the coin insertion processing routine program, and FIG. 6 is a flowchart showing an example of the coin insertion processing routine program. A flowchart showing an example of a routine program, FIG. 7 is a flowchart showing an example of a storage judgment processing routine program, FIG. 8 is a flowchart showing an example of a payment processing routine program, and FIG. 9 is another example of a storage judgment processing routine program. It is a flowchart which shows. 10...Telephone circuit, 20...Control unit, 21...
...I/O boat, 22--Central processing unit, 23
・・Fixed memory, 24・・・・Variable memory, 30・
. . . Coin processing section, 31 . . . Coin sorting device, 32.
...Storage magnet, 33...-Storage magnet,
34... Return magnet, 102... Sorting track, 103... φ Accumulation lever, 104... Accumulation track, 105... Storage lever, 106... Return lever. Patent applicant Tamura Electric Manufacturing Co., Ltd. Agent Masaki Yamakawa (and one other person) 2900 Figure 5 Figure 6 Figure 7

Claims (1)

[Claims] (In a coin storage system of a public telephone in which a plurality of types of coins are placed in an old storage track in the order of insertion Kls[, a coin detection means for detecting the insertion of coins, and a type of coins stored in the lowest order) and storing the lowest coin in response to additional coin insertion when the storage orbit is full and the unstored call charge is larger than the lowest accumulated coin amount while the call is continuing. (2) A coin storage system for a public phone that stores coins of a plurality of types in one storage track in the order in which they are inserted, which detects the insertion of coins. a detection means, a coin sorting means for sorting whether or not an inserted coin is a genuine coin, a storage lever for sorting the inserted coins into a storage track and a return passage, and a coin discrimination means for determining the type of the lowest accumulated coin. The storage track is full and the unaccumulated call charge is larger than the lowest accumulated coin amount while the call is continuing, and the lowest accumulated coin is stored in response to additional insertion of specie coins. A coin storage system for a public telephone, wherein the lever operates in response to storage of the lowest coin and addition of specie coins when the storage track is not full, and guides additionally inserted specie coins to the storage track.