KR940006511B1 - Chain dialing method in telephone - Google Patents

Abstract

checking whether an initially desired dial number is a busy state; if so, checking whether a chain dial mode is received; if so, automatically performing redialing by increasing a final digit of the dialed number by 1, thereby implementing a chain dialing function without an addition memory.

Description

How to dial in a phone

1 is a system diagram applied to the present invention.

2 is a conventional memory map diagram.

3 is a conventional flow chart.

4 is a flow chart according to the present invention.

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a chain dialing method in a telephone, and in particular, a method of dialing a telephone number as if the telephone numbers are continuously connected in a chain by dialing the first telephone number and the number is busy. The case is about how to automatically redial and dial the next number automatically.

As shown in FIG. 1, a telephone generally includes a telephone line interface 100 and a central processing unit 200, a dialing unit 300 for dialing, a memory 500 for chain dialing, and a chain dial for It consists of a key input unit (400) consisting of buttons for storage and various buttons for dialing. Also, a call path (600) for making a call after dialing, and a tone check unit (700) for busy tone check; It is composed of a sound generator 800 and a speaker for generating sound.

Referring to FIG. 2 and FIG. 3, the prior art will be described with reference to the process of registering in the flowchart of FIG. In step (3a), when a button corresponding to registration is input through the key input unit 400, the central processing unit 200 accepts a key for designating a storage location of step (3b). Assuming that there are three locations that can be designated as shown in FIG. 2, the phone number in step (3c) is registered, but stored in the storage location 500 as in the phone number 1 of the storage location 1. In step (3e), after the input of the telephone number to dial, the specific code for chain dialing is input through the key input unit 400, and the key data is transformed into a specific code in the central processing unit 200 to store the memory. Record it right after phone number 1 in step 1, and then enter step 3 again to enter phone number 2. When the phone number registration is completed by repeating steps (3c)-(3e) several times as described above, the key corresponding to the end of registration is entered in step 3d to exit the registration state.

On the other hand, the dialing method (3f) is a check process of the off-hook, and (3g) is a process of checking whether the storage button for the chain dial is input in the off-hook state, that is, storage 1 in FIG. Checks the input of the storage location button such as storage location 2, step (3h) is the dialing process of the first phone number of the entered storage location, and step (3i) ends the dialing of step (3h), In the process of checking whether there is a code, if there is a specific code, it checks whether the telephone number just dialed is busy as in step (3j). At this time, if the call is in progress (3k) step 2-3 seconds after the automatic redial and dial the next phone number, repeat steps (3i)-(3k) until there is no specific code behind the phone number.

For this reason, in the related art, a separate storage place for the chain dial is required, and a phone number must be registered before use according to a predetermined format, and when one telephone number is long when trying to dial by connecting several telephone numbers in a chain. It takes up a lot of memory and there is a problem because it repeats the same process several times during registration.

Accordingly, an object of the present invention is to provide a method for eliminating this problem because the existing chain dialing method takes up a lot of memory, and there is a limit to the telephone number to be stored for chain dialing when using a limited memory.

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

4 is a flow chart according to the present invention, in the method of chain dialing, when a designated button for chain dialing is input by using the last dialed telephone number, the number dialing the last number of the telephone number is increased by one. In the case of automatic redialing, the number is incremented by one.

That is, according to the method of the chain dial of the present invention, for example, a company uses 123-4567 as its representative phone and has several more phone numbers, which is the first time a person calls the company. When you call -4567, if the phone number is busy, it automatically hangs up and dials another phone number that your company has, so you don't have to redial every time and try to dial the next number. To provide convenience. In this case, the present invention is that most companies have several more phone numbers sequentially increasing only the last digit from the representative phone number, and the first dialed number automatically dials the number after the user dials the first number automatically It is a technology that makes it possible to easily achieve the original purpose without increasing the amount of memory and memory to be stored by dialing only the last digit of the phone number.

At this time, the memory of the buffer for dialing is mostly 32 digits. The buffer is a buffer memory in which data to be dialed in one touch dial or speed dial or in general when pressing a key corresponding to a number on a dial keypad, i. to be.

4 shows the process of chain dialing data in the dial buffer.

Step (4a) is a process of dialing the telephone number of the place where the user wants to talk. At this time, the input telephone number is sequentially recorded in the dial buffer and dialed in the recorded order. For example, if a user dials 888-7000, the dial buffer records the moment the key is entered and the telephone number is terminated when the number is finished. On the other hand, since the dial takes a predetermined time, the dial cannot be processed at the same time as the key input time.

In step (4b), when the user finishes dialing the telephone number and the number just dialed is busy, the user inputs the designated button indicating the chain dial to automatically dial the next telephone number. The processor 200 accepts the chain dial state. The reason why the control button designated for the chain dial is accepted after dialing (step 4a), i.e., after the user checks the status of the call to the speaker or handset of the speaker prior to the busy check in step (4c), is performed. This is for the sake of brevity, and the case of using the steps (4a) and (4b) in reverse order does not depart from the scope of the present invention.

In step (4c), if the designated button indicating the chain dial is input by checking the busy, the busy processing check is performed in the central processing window 200, and the busy dial check is performed immediately after the chain dial designation button is input.

As described above, there is a problem of registering a phone number before use by securing a separate storage area and a predetermined format, which is a problem of the prior art, and when one phone number is long, to use it as a chain dial, a lot of memory must be secured. It was cumbersome by repeating the same process during registration, but this problem is simply set by the user's instant judgment because the final dialed data is used without specifying a separate memory location. The advantage is that it does not require memory.

Claims (2)

A method for chain dialing in a telephone, the method comprising: checking whether the first desired dial number is busy, checking a chain dial mode input when the call is busy, and a final digit of the dialed number when the chain dial mode is used. Chain dialing method for a telephone, characterized in that the process of automatic redialing by incrementing by one. The method of claim 1, wherein the automatic redialing process is performed a given number of times.