JPH0278352A - Communication terminal equipment - Google Patents

Abstract

PURPOSE:To facilitate redialing by storing inputted opposite numbers in the order of access, weighting the data depending on number of dialing and clearing sequentially the minimum data. CONSTITUTION:Opposite number data from an operation section 1 are stored in a number registration section 6 by a control section 4 in the input order or the access order of dialing order. Moreover, the weighting of number of dialing is added and the result is stored in a number storage section 7, in which the data with minimum weighting is cleared sequentially resulting in being aborted completely. When two digits in an opposite number are entered depending on the content of the number registration section 6 and the number holding section 7, the control section 4 reads out the relevant number and gives it to a signal generating section 2. Thus, automatic dialing for redialing and abbreviated number dialing is attained.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a communication terminal device having a function of dialing a destination number.

[Conventional technology]

In communication terminal devices that have a dialing function for the other party's number, general KIJ dialing and speed dialing are possible, and redialing stores only one set of the party's number that was most recently dialed, and is used for the next dialing. The memory contents are updated in response to a dial call.

In addition, speed dialing is a system in which multiple sets of destination numbers are registered in advance in correspondence with a two-digit abbreviated number, and then the corresponding destination number is automatically dialed in response to the input operation of the abbreviated number. There is.

[Problem to be solved by the invention]

However, conventionally, in the case of redialing, the memory contents are updated sequentially in response to dialing, so it is inconvenient that it is not possible to dial another party's number and then re-dialing the previous party's number. In addition, in the case of 1-speed dialing, when changing the registered contents according to the frequency of outgoing calls, a registration operation must be performed each time, which has the disadvantage of being troublesome.

[Means to solve the problem]

In order to solve the above-mentioned problem, the present invention uses the following means)
It is configured as follows.

In other words, there is a number registration section that sequentially stores a fixed number of input party numbers according to the access order and transfers the oldest one sequentially, and a number registration section that sequentially stores a fixed number of input party numbers according to the access order and sequentially transfers the oldest number, and a predetermined number of party numbers that are to be transferred from now on by weighting them according to the number of calls. There is a number reservation section that stores and sequentially clears the one with the lowest weighting, and when less than all digits of the other party's number is entered, the corresponding number is searched from the number registration section and number reservation section and the corresponding number is dialed. The system is provided with a control section that controls outgoing calls and controls storage, transfer, and clearing of a number registration section and a number reservation section.

[Effect]

Therefore, a certain number of entered party numbers are stored by the number registration unit according to the access order of input order or dialing order, and the oldest party number is weighted by the number of calls and sent to the number reservation unit. In addition to being forwarded and stored, the ones with the lowest weighting are cleared in sequence. Frequently dialed numbers are stored in the number storage section, while the most recent and relatively new numbers are stored in the number registration section. The accessed number is stored, and when about two digits of the other party's number are entered, a particularly corresponding one is searched and a dial call is made using this number.

〔Example〕

Hereinafter, the present invention will be explained in detail with reference to figures showing examples.

FIG. 1 is a block diagram of the main parts. A destination number inputted using an operating section 1 such as a keyboard is converted into a dial signal in a signal generating section 2, and this is sent to a transmission line by a transmitting section 3. Then, the dialing is performed.

Further, the data indicating the number of the other party from the operation section 1 is given to the control section 4 such as a processor, and is also given to the display section 5. 4, the memory-based number registration unit 6 stores up to a certain number in sequence according to the input order or the access order of the dialing position, and the oldest ones are sequentially cleared, and at the same time, the memory-based number They are transferred to the holding unit T, weighted according to the number of outgoing calls, and stored up to a predetermined number in the holding unit T. Those with the lowest weighting are sequentially cleared and completely It is to be disposed of.

The contents of the number registration section 6 and the number reservation section T are used by the control section 4 to search for the corresponding party number when, for example, two digits of the party's number are input via the operation section 1. If there is a corresponding number, the control section 4 reads it and gives it to the signal generation section 2, thereby making a dial call, and the control section 4 receives this number from the dialing section 2.
This is further stored in the number registration section 6, while the read number is displayed on the display section 5.
Therefore, automatic outgoing calls equivalent to redial and speed dialing are performed.

FIG. 2 is a diagram showing the contents of the number registration section 6, in which a certain number of latest addresses (transfer) to oldest addresses (1) are stored in the access φ counter 8, which indicates the number of outgoing calls, and in the number storage area 9. As the latest one is divided and stored in addresses (!), the oldest one is transferred from address (1) and cleared, and accordingly, addresses (!1) to (2) are sequentially stored. ) has addresses (!1-1) to (1
).

FIG. 3 is a diagram showing the contents of the number reservation section 7, in which a predetermined number of addresses (m) to (1) are each divided into a check 0 counter 10 indicating the number of calls, and a number storage area 11. When something to be transferred occurs in the number registration section 6 of FIG. 2, it is transferred to one of the number storage areas 11 among addresses (t!i) to (1) and stored therein.

However, at this time, the one with the lowest weighting indicated by the value of the check 0 counter 10 is cleared and discarded, and the number newly transferred to this address is stored,
And the check counter 10 of this is "Number of outgoing calls - 1"
” is stored.

In addition, when selecting the one with the lowest weight, compare the number of outgoing calls for the number to be newly stored with the smallest value among the values in the check counter 10, and clear the smaller number. It has become.

FIG. 4 is a flowchart showing the storage, transfer, and clearing control status performed by the control unit 4 on the number registration unit 6 and the number reservation unit T.
In response to 10IK, this number is 1J10 in the number registration department.
2, and if this is Y (YES), "shift other number information in the number registration section to the oldest side" 103 moves each number information based on other numbers and the access counter value to one address. Transfer each number to the address (1) side, perform ``Set the corresponding number information to the latest address of the number registration section'' 104, which is the same as the input number, and access this.
The counter is incremented by [access counter + IJ105.

In addition, when step 102 is N (No), check ``Additional in number reservation section?J111'' and respond to Y in this.
The process moves to "disposal processing" 112 to be described later, in which the oldest number information in the number registration section 6 is transferred to the number reservation section T, and step 10
After performing the same process 113 as in 3, "Transfer the corresponding number information from the number reservation section to the latest address of the number registration section" 1
Perform step 14 and select “Check counter +1 → Access
The access counter for the transferred number is set using the "counter" 115.

On the other hand, if step 111 is also N, "number registration section Ft
ill? J 121 checks whether the peripheral section 6 is full or not, and according to this Y, performs a process 122 similar to step 112, further performs a process 123 similar to step 103, and then Input the input number to the latest address) J124 and set the access counter to "1" by "1→access counter" 125.

For the above, if step 121 is N, perform "shift the number information in the number registration section to the oldest side" J131, and then "shift the input number to the latest address in the number registration section".
J132 is performed, and then "1" is set in the access counter by a process 133 similar to step 125.

FIG. 5 is a flowchart showing details of steps 112 and 122. Check "Number reservation section Full?" 201, and if this is Y, "Check all check counters in the number reservation section by -IJ 202". Subtract υ and ``
Minimum value of access counter check fist counter? J
203, the number information transferred from the number registration section 6 is compared with the access counter, and in response to this, the check counter in the number reservation section clears the minimum value number information 211 is executed. After discarding, the number information from the number registration section is stored in the cleared address using Set 4212.

Further, when step 203 is N, the information is not stored in the number reservation section T by "discard number information from number registration section" 221.

On the other hand, in response to step 201 ON, the number registration section sets the number information of υ to the vacant address of the r number reservation section.''2
31].

FIG. 6 is a diagram showing the above storage and clearing situation!
In (1), if there is a vacant address in the number registration section 6,
(2) shows a case where a registered number is further input, and (3) shows a case where both the number registration section 6 and the number reservation section T are full.

In other words, in the case of (1), the number (0534-55-1
111) is input C) According to IIC, access counter 8 and number storage area 9 to the oldest free address.
Shift the contents one address at a time, and then send the number (0534-55-1111) and "
1" is stored.

In the case of (2), the number already registered (044
-433-1111) was further input, the corresponding number information is transferred to the latest address, and the latest number information is sequentially shifted from the address where the corresponding number information was stored to the oldest side. At the same time, the number of calls made to the corresponding number has been updated from "1" to "2".

On the other hand, in the case of (3), the number information stored in the oldest address of the number registration section 6 is cleared and transferred to the number reservation section 7, and each number information of the storage method is sequentially updated to the latest address. Shift one address to the old side and store the input number (06-584-2711) in the latest address.

In addition, the number reservation unit γ subtracts “1” from the value of each check operation counter 10, and calculates the minimum value “1” and the number of calls of the transferred number (0532-58-1111) “3”. ” and the smaller number (0534-5
After clearing and discarding the number information including 5-1111), the number information transferred to this address is stored.

FIG. 7 is a flowchart of the control status performed by the control unit 4 when making an automatic call corresponding to redial and speed dial. Search to see if it is stored in the registration unit 6 and check if "Number information = human data? J301
is Y, and if there is a corresponding one, the display section 5 will display [Display selection number J302, the operator will confirm this, and if it is appropriate, perform the operation to that effect.
OK? J 303 is Y, step 103 in Figure 4
After performing processes 311 to 313 similar to ~105,
The selected number is read out and given to the signal generation section 2 by the signal generation section J 314 to make a dial call.

Further, when step 301 is N, a similar search is performed in the number reservation section 7, and as in step 301, "Number information - manual data?" and step 112-1 in FIG. 4 via Y in step 323.
After performing processes 331 to 334 similar to step 15, the process moves to step 314.

FIG. 8 is a diagram showing the search situation under the control shown in FIG.
2) shows the case where the corresponding number exists in the number reservation section 7.

In other words, in (1), the two digits in the other party's number ``'4
5" is input, a partially matching number (0534-45-1111) is searched from the storage area 8, and the number information of this is transferred to the latest address, and each number information on the latest side is transferred. Shift by 17 addresses to the oldest side, and add "1" to the number of outgoing calls "3" for the corresponding number.

In the case of (2), in response to the input of the two digits ``13'' in the other party's number, a matching number (0534-46-1380) is similarly searched from the number reservation section T, and this is The call is transferred to the latest address in the number registration section 6, and "1" is added to the value indicated by the check counter 10, and the result is stored in the latest address in the number registration section 6 as the number of outgoing calls.

On the other hand, the number reservation unit 7 stores the number information transferred to the address where the number information of the corresponding number was stored.

〔Effect of the invention〕

From the above explanation, it is clear that Tooshi has not yet released F! According to A.K.
The latest entered party number, the party number used for the call, the relatively recently entered party number, and the party number used for the call are stored in the number registration section, and other party numbers are stored as numbers. Store it in the holding section, and
Clears those that have been called less frequently, and when less than all digits of the called party's number is entered, the corresponding number is searched from the number registration section and the number holding section, and dialing is controlled using the corresponding called party's number. Therefore, frequently used numbers and newly entered numbers are always stored, and you can make speed dials and redial calls using the desired number without having to update the registered number. In addition, remarkable effects can be obtained in various communication terminal devices that make dial calls.

[Brief explanation of the drawing]

The figures show an embodiment of the present invention; FIG. 1 is a block diagram of the main part, FIG. 2 is a diagram showing the contents of the number registration section, FIG. 3 is a diagram showing the contents of the number reservation section, and FIG. 4 is a diagram showing the contents of the number reservation section. Flowchart showing the number storage, transfer and clearing status, FIG. 5 is a flowchart showing details of the discard process in FIG. 4, FIG. 6 is a diagram showing the storage, transfer and clearing status according to FIGS. 4 and 5, Figure 97 shows the search status of the corresponding number.
FIG. 8 is a diagram showing the search situation according to FIG. 7. 1...Operation unit, 2...Signal generation unit, 4...
Control unit, 6...Number registration unit, 7...Fist number reservation unit, 8...Access counter, 9.11...Number storage area, 10.Buddha...Check counter, (1
) ~ (n), (m), Φ...address.

Claims (1)

[Claims] A communication terminal device having a function of dialing a partner's number includes a number registration unit that sequentially stores a certain number of input partner numbers according to the access order and forwards the oldest one in sequence; a number holding unit that stores a predetermined number of called party numbers weighted according to the number of calls and sequentially clears the least weighted number; The present invention is characterized by further comprising a control section that searches from the number registration section and the number reservation section and controls dialing based on a corresponding party number, as well as controlling storage, transfer, and clearing of the number registration section and the number reservation section. Communication terminal equipment.