KR100618411B1 - Address book processing methods and communication device utilizing the same - Google Patents

Abstract

Disclosed is an address book processing method executed in a limited resource communication device capable of communicating with a plurality of other communication devices respectively corresponding to individual ID codes. The communication device includes an address book. Rules matching the first group of ID codes are stored in the address book and contain several identical digits. The first ID code is retrieved. By checking whether the first ID code matches the rule, it is determined whether the first ID code belongs to the first group.

Address book, file, management, communication

Description

ADDRESS BOOK PROCESSING METHODS AND COMMUNICATION DEVICE UTILIZING THE SAME}

1A is a block diagram of one embodiment of a communication system;

1B is a block diagram of another embodiment of a communication system;

2 is a block diagram of an exemplary communication device,

3 is a flowchart of an embodiment of an address book processing method;

4 is a flowchart of call operation;

5 is a flowchart of rule editing, and

6 is a schematic diagram of an exemplary storage medium.

The present invention relates to file management, and more particularly, to an address book arrangement.

The caller indication on the handset uses a direct and exact matching technique that the phone stores in the address book with the caller's identification (ID), user names, and their correspondence, and when receiving the caller ID, Compare caller ID with pre-stored caller ID. If the caller ID matches exactly, the corresponding user name is displayed. If it does not match, the caller ID is displayed, which can interfere with call screening.

If a single small business is subscribing and assigning a number of consecutive blocks of telephone numbers, such as 27399610 to 27399619 (10 total numbers), you can use a private branch exchange (PBX) and use one of the 10 numbers as an incoming call. Can be selected. Typically, one of the ten numbers is published as the representative number printed on the business card. If only the representative number is stored in the address book, calls from one unsaved number will not be able to add a calling number. Although all ten numbers can be manually recorded in the address book, this consumes limited storage space and inconveniences users.

An address book processing method and a limited resource communication apparatus using the method are provided. One embodiment of an address book processing method is implemented with a first communication device capable of communicating with a plurality of other communication devices each corresponding to respective identification (ID) codes. The first communication device includes an address book. A rule matching the first group of ID codes is stored in the address book, where the first group of ID codes contain several identical digits. The first ID code is retrieved. By checking whether the first identification matches the rule, it is determined whether the first ID code belongs to the first group.

One embodiment of a communication device includes an address book, a signal processor, and a comparator, and can communicate with a plurality of other communication devices, each corresponding to a separate ID code. The address book stores a rule that matches the ID code of the first group containing some identical digits. The signal processor retrieves the first ID code. The comparator determines whether the first ID code belongs to the first group by confirming that the first identification matches the rule.

In addition, the address book processing method may be implemented by a computer application of a storage medium such as a memory or a memory element. When loaded into a computer, the computer application instructs the computer to execute the address book processing method.

The present invention will be fully understood from the embodiments based on the following detailed description and the accompanying drawings.

Embodiments of the address book processing method disclosed below provide a caller identification using a plurality of communication ID codes. These methods may be implemented with a communication device or serve as a hash function for receiving a caller ID code and creating a user name.

In FIG. 1A, the terminal 10 and the terminals 50 are connected to the communication network 6 via wired and / or wireless channels. The terminal 10 may be a mobile phone or other limited resource communication device such as a personal digital assistant (PDA) having a wireless communication function. Group 5 includes terminals 50, such as a telephone, used by a subscriber device. The terminals 10, 50 communicate with each other by telephony and / or messages. In the first situation (see FIG. 1A), each terminal corresponds to one ID code. In the second condition, each terminal optionally corresponds to a specific designated ID code. For example, in FIG. 1B, the terminal of the communication system is connected to the network via the PBX 7. When one terminal requests a call, the terminal is automatically assigned one designated ID code among the stored ID codes. The ID code is described using a telephone number as an example, but is not limited thereto. The group 5 corresponds to the ID codes of the first group.

In the terminal 10 shown in FIG. 2, the comparator 22 is connected to the address book 31, the display device 23 and the signal processor 12. The signal processor 12 is connected to the receiver 11 and the transmitter 13. The address book 31 is connected to the rule editing device 21.

The address book 31 stores a plurality of user names, rules representing ID codes, and a correspondence relationship between the user names and the rules. As shown in Fig. 2, each entry of the address book 31 includes a rule and a user name. For example, entry 40 includes rule R1 and its corresponding user name N1. The rule R1 corresponds to the telephone numbers of the terminal 50 of the group 5, that is, the ID codes of the first group.

The rule may be implemented in a number of ways to describe groups of ID codes, as described in the following embodiment.

Example 1

Rules are implemented with regular expressions to match consecutive ID codes. For example, the rule "2739961 [6-9]" matches 27399616-27399619, where "[]" represents a character contained therein, and "6-9" represents "6" to "9". Four numbers are indicated. The first seven digits of all the phone numbers 27399616 to 27399619 are identical, and the range of the last digit is described by the rules.

Example 2

The rule includes a telephone number prefix and several digits of subsequent digits, indicating the ID codes combined by the subsequent digit group and the prefix, respectively. For example, a rule set to "2739 (9616 | 9617 | 9618 | 9619)" is a combination of prefix "2739" and subsequent digits "9616", "9617", "9618" and "9619", respectively. 2739916-27399619 "," | "is a logical OR, and" (9616 | 9617 | 9618 | 9619) "represents" 9616 "," 9617 "," 9618 ", or" 9619 ". In general, the prefix may be NPA or NXX in a North American numbering scheme.

Example 3

Outgoing telephone numbers optionally added with country codes may also be indicated in regular expression. For example, when country codes are added to the telephone number "0912345678", the result may be "886912345678" or "+886912345678". When the terminal 10 receives a call of the telephone number "0912345678", the signal processor 12 will extract "0912345678", "886912345678" or "+886912345678". In other words, "+", country codes "886", and "0" may be present in the extracted telephone number. These may be represented by the rule "((+)? 886)? 0? 912345678", where "?" Appears either one digit or a plurality of digits surrounded by "()" appearing at first. It may not.

Example 4

A rule containing two ID codes represents ID codes between them. In other words, these two ID codes are the two threshold limits of the range of represented ID codes. For example, the rule "[27399616, 27399619]" represents phone numbers "27399616-27399619", where "27399616" and "27399619" are the first and last phone numbers in the range, respectively.

Example 5

A rule containing a main ID code and a positive integer indicates a continuous ID code delimited by the main ID and the number of the expression ID code which is a positive integer. For example, the rule "[27399616, 4]" represents four telephone numbers 27399616-27399619, where "27399616" represents the first of four telephone numbers, and the integer "4" is represented by the rule. Limit the number of phone numbers made. Similarly, "[4, 27399619]" represents four telephone numbers 27399619, 27399618, 27399617, 27399616, where "27399619" represents the last of four telephone numbers, and the integer "4" is determined by the rule. Limit the number of phone numbers represented.

By the embodiments shown, it will be appreciated that the rules are different from the ID codes. When the rule R1 is supposed to match the ID code of the first group, the number of characters required to represent the rule R1 is the same because some digits of the respective ID codes of the first group are the same. Less than the number needed to describe all ID codes in the. The rule editing device 21 will provide an easy interface for entering rules.

When initiating a communication operation, such as initiating a communication channel or receiving a message, the terminal 10 retrieves the requester ID code of the communication operation to compare with the rules stored in the entry of the address book 31. If a match with an existing rule is found, the terminal 10 displays, audio signal and / or otherwise indicates that the requester ID code matches one rule stored in the address book 31. The reception of the outgoing signal of the terminal 10 is described as an example in the following description.

3, the terminal 10 receives an outgoing call (step S2). The signal processor 12 retrieves the caller ID code accompanying the outgoing call (step S4). The comparator 22 determines whether the caller ID code matches one rule of the address book 31 (step S6). Otherwise, the caller ID code is displayed on the display device 23 (step S8). If the caller ID code matches a predetermined rule, such as rule R1 of entry 40, comparator 22 determines whether the caller ID code belongs to the first group of ID codes represented by rule R1. (Step S10). The display device 23 shows the user name N1 corresponding to the rule R1 (step S12).

The address book 31 includes designation information 43 which assigns an ID code of one of the first groups as a predetermined ID code for the user name N1. For example, the assignment information 43 may be the complete telephone number of the first group. Under the conditions of the first embodiment, the assignment information 43 which assigns the telephone number "27399616" having the last digit "6" as the predetermined ID code within the range defined by the rule "2739961 [6-9]" is " 6 ". Under the conditions of the second embodiment, designation information for assigning the telephone number "27399616" having the last digit "9616" as a predetermined ID code within the range defined by the rule "2739 (9616 | 9617 | 9618 | 9619)" 43) may be “9616”. Under the conditions of the fourth embodiment or the fifth embodiment, the designation information 43 may be an integer related to the order of the predetermined ID code within the range defined by the respective rules.

The call procedure is described with reference to FIG. When starting a communication operation based on the user name of the address book 31 (step S20), the terminal 10 generates a predetermined ID code and its designation information for the user name using the rule (step S22). For example, when initiating a call or sending a message based on the user name N1, the signal processor 12 may determine a predetermined ID code using the rule R1 and designation information corresponding to the user name N1. Produce 43. The terminal 10 performs a communication operation using the predetermined ID code as the called terminal ID code (step S24). For example, the transmitter 13 generates a call or transmits a message using a predetermined ID code as the called terminal ID.

The rule editing process is described with reference to FIG. 5. First, the rule editing device 21 receives a first ID code such as an initial or final ID code of the ID code group (step S40). Note that the rule editing device 21 can receive a part of the ID code. The rule editing apparatus 21, as described in the fifth embodiment, has a positive integer defining an ID code other than the first ID code, digit groups different from the last digits of the first ID code, or the number of ID codes. An alert condition such as the above is received (step S42). The first ID code and the boundary condition may indicate a second group of IDs. For example, a part of the ID code received in step S40 may be combined with the boundary condition received in step S42 to indicate a range of ID codes. The rule editing device 21 may receive one or more country codes (step S44). The rule editing device 21 automatically generates a rule matching the second group based on the first ID code, boundary condition, and country code (step S46), and stores the rule in the address book 31 ( Step S48). In addition, the rule editing device 21 may receive designation information. Note that country code processing may be omitted.

The address book processing method may be implemented by a computer program stored in a machine-readable storage medium and performing the above-described steps.

In FIG. 6, storage medium 60 stores a computer program 620 that implements an address book processing method and includes comparison logic 621, communication logic 622, and rule editing logic 623. The comparison logic 621 compares the ID code with the rule. The communication logic 622 generates predetermined ID codes and their designation information using the rule. The rule editing logic 623 provides an editing interface and receives the information (ID codes, boundary conditions, and country codes) needed to edit the rule to generate the rule.

As a result, the disclosed address processing methods store rules in address books rather than retrieving all possible IDs.

While the invention has been described by way of example with reference to preferred embodiments, it should be understood that the invention is not so limited. On the contrary, it is intended to cover various modifications and similar structures (as will be apparent to those skilled in the art). Accordingly, the appended claims should be construed broadly to encompass all such modifications and similar structures.

Claims (23)

An address book processing method which can communicate with a plurality of other communication devices respectively corresponding to individual ID codes, and is executed in a limited resource communication device including an address book, Storing a rule in the address book that matches a first group of ID codes containing several identical digits; Retrieving a first ID code; And Determining whether the first ID code belongs to the first group by confirming that the first ID code matches the rule; Address book processing method comprising a. 2. The method of claim 1, wherein said ID codes of said first group are telephone numbers. The address book processing method of claim 1, wherein the communication device retrieves the first ID code when requested to initiate a communication operation. 2. The method of claim 1, wherein said communication device retrieves said first ID code when receiving a message. The method of claim 1, wherein the address book includes a user name corresponding to the first group, and the method further comprises displaying the user name when the first ID code matches the rule. How to handle address book. 2. The method of claim 1, wherein the first group corresponds to a user name, and the communication device includes designation information for assigning an ID code of the first group as a predetermined ID code of the user name. And when the communication device initiates a communication operation based on the user name, generating the predetermined ID code as a destination ID code of the communication operation based on the designation information and the rule. Treatment method. The address book processing method of claim 1, wherein the rule is based on regular expressions. The address book processing method according to claim 1, wherein the rule includes two threshold limits, and matches ID codes between the two threshold values. The method of claim 1, wherein the rule includes a main ID code and a positive integer, and matches the ID codes bounded by the main ID code, and the number of matched ID codes is equal to the positive integer. How to handle address book. The address book processing method according to claim 1, wherein the rule includes a prefix of an ID code. The address book processing method according to claim 1, wherein the rule matches ID codes that include country codes. A machine readable storage medium storing, when executed, a computer program for instructing a limited resource communication device to perform the address book processing method according to claim 1. A limited resource communication device capable of communicating with a plurality of other communication devices respectively corresponding to respective ID codes, An address book for storing a rule matching the first group of ID codes including some identical digits; A signal processor for retrieving a first ID code; And A comparator for determining whether the first ID code belongs to the first group by confirming that the first ID code matches the rule; Limited resource communication device comprising a. 18. The apparatus of claim 13, wherein said ID codes of said first group are telephone numbers. 14. The limited resource communications device of claim 13, wherein said communications device retrieves said first ID code when requested to initiate a communications operation. 14. The limited resource communication device of claim 13, wherein said communication device retrieves said first ID code when receiving a message. The apparatus of claim 13, wherein the address book includes a user name corresponding to the first group, and the device displays the user name when the first ID code matches the rule. 14. The apparatus of claim 13, wherein the first group corresponds to a user name, and the communication device includes designation information for assigning an ID code of the first group as a predetermined ID code of the user name. And when initiating a communication operation based on the signal processor, generating the predetermined ID code as a destination ID code of the communication operation based on the designation information and the rule. 14. The apparatus of claim 13, wherein the rule is in accordance with regular expressions. 14. The apparatus of claim 13, wherein the rule includes two threshold limits, and matches ID codes between the two thresholds. 14. The rule of claim 13, wherein the rule includes a main ID code and a positive integer, and matches the ID codes bounded by the main ID code, the number of matched ID codes being the same as the positive integer. Limited resource communication device. The apparatus of claim 13, wherein the rule includes a prefix of an ID code. The apparatus of claim 13, wherein the rule matches ID codes including country codes.

Images