Ulllted States Patent
`
`[19]
`
`[11] Patent Number:
`
`5,850,594
`
`Cannon et al.
`
`[45] Date of Patent:
`
`Dec. 15, 1998
`
`US005850594A
`
`[54] METHOD AND APPARATUS FOR
`EFFICIENTLY TRANSMITTING ADDRESSES
`AND MESSAGES FROM PORTABLE
`MESSAGING UNITS OVERA WIRELESS
`COMMUNICATION CHANNEL
`Inventors; Gregory Cannon; Nancy Cannon,
`both of Kellen Tex
`
`[75]
`
`,
`[73] Asslgneei Motorola’ Inc" Schaumburg’ H1’
`
`[21] Appl. No.: 697,513
`
`[22]
`
`Filed:
`
`Aug_ 26, 1996
`
`Int. CL6 .......................................................
`[52] US. Cl.
`....................... .. 455/31-3; 455/412; 455/419;
`455/458; 340/825.22; 340/825.37; 340/825.44
`[58] Field of Search ................................... .. 455/412, 414,
`455/415, 417, 458-460, 31.2, 31.3, 32.1,
`38.1, 38.4, 564, 517, 419; 340/825.44,
`311.1, 825.22, 825.27
`
`[56]
`
`References Cited
`
`U'S' PATENT DOCUMENTS
`5,066,949
`11/1991 Breeden et al.
`................. .. 340/825.44
`
`5,257,307 10/1993 Ise ......................................
`.
`.
`1/1996 Kane ........................... ..
`5,487,100
`5,630,207
`5/1997 Gitlin et al.
`......................... .. 455/38.4
`Primary ExamirLer—Edward F. Urban
`Assistant Examiner—Lee Nguyen
`Attorney, Agent, or Firm—Char1es W. Bethards
`
`1571
`
`ABSTRACT
`
`Acommnnication system (100) for providing two-Way com-
`munication including a portable messaging unit (105) for
`Sending a Signal including a recipient alias over a wireless
`communication channel and a controller (110) for receiving
`the signal including the recipient alias. The controller (110)
`then transmits a message to an address that is designated by
`the recipient alias and that is longer than the recipient alias.
`
`9 Claims, 9 Drawing Sheets
`
`215
`
`220
`
`CONTROLS
`
`
`
`205
`
`TRANSCEIVER
`
`PROCESSOR
`
`
`
`
`
`225
`
`MESSAGE MEMORY
`
`M INFORMATION
`
`
`
`230
`
`DATA BASE
`
`FREOUENT RECIPIENT
`
`(FRIEND) LIST
`
`FREOUENT MESSAGE
`
`(CANNED MESSAGE) LIST
`
`@
`
`240
`
`245
`
`1
`
`GOOGLE 1013
`
`
`
`
`
`
`
`
`235
`
`DEVICE MEMORY
`
`ADDRESS
`
`PROGRAMMING CODE
`
`FORWARD CODE
`
`“ADD FRIEND” (AF) CODE
`
`“DELETE FRIEND” (DF) CODE
`
`“ADD MESSAGE” (AM) CODE
`
`“DELETE MESSAGE” (DM) CODE
`
`MESSAGE CODE
`
`SEND CODE
`
`SENDER
`
`RECEIVER
`
`
`
`
`
`GOOGLE 1013
`
`1
`
`

`
`U.S. Patent
`
`Dec. 15,1998
`
`Sheet 1 of 9
`
`5,850,594
`
`115
`
`COMPUTER
`
`
`
`
`115
`
`COMPUTER
`
`105
`
`1 0
`
`215
`
`220
`
`CONTROLS
`
`DISPLAY
`
`205
`
`021
`
`TRANSCEIVER
`
`PROCESSOR
`
`235
`
`225
`
`DEV|CE MEMORY
`
`ADDRESS
`PROGRAMMING CODE
`
`FORWARD CODE
`
`MESSAGE MEMORY
`M INFORMATION
`
`230
`
`“ADD FRIEND” (AF) CODE
`
`DATA BASE
`
`“DELETE FFHEND" (DF) CODE
`
`“ADD MESSAGE” (AM) CODE
`
`“DELETE MESSAGE" (DM) CODE
`MESSAGE CODE
`
`FREQUENT RECIPIENT
`
`(FRIEND) LIST
`
`FREOUENT MESSAGE
`(CANNED MESSAGE) LIST
`
`SEND CODE
`
`SENDER
`
`RECEIVER
`
`240
`
`245
`
`FIG. 2
`
`2
`
`

`
`U.S. Patent
`
`Dec. 15,1998
`
`Sheet 2 of 9
`
`5,850,594
`
`
`
`
`
`270
`
` SIGNAL
`INCLUDE SEND
`CODE ?
`
`
`
`
`
`2
`
`80
`
`PERFORM OTHER
`
`PROCESSING
`
`275
`
`ACTIVATE SENDER
`
`FIG. 3
`
`
`
`RECEIVE
`SIGNAL FROM
`
`CONTROLS
`?
`
`PROCESSOR
`
`OPERATION
`
`RECEIVE
`
`INFORMATION
`FROM TRANS-
`CEIVER ?
`
`ACTIVATE
`RECEIVER
`
`3
`
`

`
`U.S. Patent
`
`Dec. 15,1998
`
`Sheet 3 of 9
`
`5,850,594
`
`RECEIVER
`OPERATION
`
`STORE PROGRAMMING
`INFO. IN DATABASE
`
`310
`
`320
`
`305
`
`
`
`INFO.
`YES
`INCLUDE
`
`PROGRAMMING
`CODE ?
`
`
`
`
`
`
`
`
`,N,:O_
`
`AF‘ AM, DE OR
`DM CODE
`?
`
`
`
`INFO.
`INCLUDE
`MESSAGE CODE
`?
`
`
`
`YES
`
`340
`
`STORE MESSAGE
`NUMBER
`
`350
`
`STORE
`MESSAGE INFO.
`IN M ESSAG E
`
`MEMORY
`
`NO
`
`345
`
` MESSAGE
`INFO.=CANNED
`MESSAGE ALIAS
`
`
`
`
`
`
`
`FIG_ 4
`
`355
`
`STORE MESSAGE
`YES ASSOCIATED WITH
`CANNED MESSAGE
`IN MESSAGE
`MEMORY
`
`DISPLAY RECEIVED INFO.
`
`INFO.) WITH
`APPROPRIATE INQUIRY
`
`
`
`
`
`
`(i.e., ADD/DELETE)?
`
`
`RECEIVE SIGNAL FROM
`CONTROLS
`
`
`
` 325
`
`330
`
`ACTIVATE SENDER
`
`4
`
`

`
`U.S. Patent
`
`Dec. 15,1998
`
`Sheet 4 of 9
`
`5,850,594
`
`405
`
`415
`
`
`
`
`
`
`SENDER
`OPERATION
`
`RECEIVE SIGNAL
`FROM CONTROLS
`
`475
`
`
`
`TRANSCEIVER
`
`470
`
`
`
`
`
`REFERENCE
`DATABASE TO
`RECOVER
`FRIEND/MESSAGE
`
`PR°V'[c’;'E)“[;'§SSAGE
`SIGNAL
`INFORMATION AND
`
`’
`FRIEND/MESSAGE
`
`
`ADDRESS/FRIEND
`INCLUDE DM
`AUAS
`ALIAS AND
`OR DF CODE
`MESSAGE ALIAS TO
`MESSAGE /CANNED
`420
`
`
`PROVIDE DF/DM
`CODE,
`
`FRIEND/MESSAGE
`|NFO., AND
`SIGNAL
`
`INCLUDE AM
`FRIEND/MESSAGE
`
`
`OR AF CODE
`ALIAS T0
`TRANSCEIVER
`
`
`450
`
`435
`
`
`
` RECIPIENT
`-
`FRIEND
`
`?
`
`
`ADDRESS , AND
`PROVIDE AF/AM
`CODE AND
`MESSAGE NUMBER
`To TRANSCE'VER
`FRIEND/MESSAGE
`
`PROVIDE FORWARD
`TR'ANNFS%ET|‘\3,ER
`CODE, I=RIEND
`ALIAS, AND
`
`MESSAGE NUMBER
`
` TRANSCEIVER
`
`
`REFERENCE
`MESSAGE MEMORY
`TO RECOVER
`FRIEND/MESSAGE
`INFO.
`
`
`
`460
`
`PROVIDE FORWARD
`CODE, ENTERED
`
`
`
`
`
`FIG. 5
`
`
`
`
`
`
`
`
`
`
`
`REFERENCE
`DATABASE TO
`ET
`‘NE
`EEM
`D
`WHETHER
`REC|P|ENT=FR|END
`AND WHETHER
`MESSAGE=CANNED
`
`YES
`
`465
`SIGNAL
`
`INCLUDE
`MESSAGE
`CODE ?
`
`
`
`
`
`SIGNAL
`INCLUDE
`FORWARD
`CODE ?
`
`
`
`YES
`
`
`MESSAGE
`
`SIGNAL
`
`REFERENCE
`RECEIVED
`
`
`NO
`MESSAGE
`
`
`
`YES
`
`
`NO
`
`5
`
`

`
`U
`
`tnem.
`
`EmD
`
`%
`
`9PI.05
`
`5,
`
`49
`
`
`
`
`
`Pms_<zmmm__>5zmooomwm_mn_n_<m_s_<zmooo.sH«5»eu:
`
`
`
`
`
`
`mwmmoo<.&n_zm_Eozm_Egoz__2s_<moomn_E:s_n_TomNmv~r.~
`m_s_<zm<_._<oz<s_s_oomooo
`
`
`
`
`
`
`
`w,m<_._<n_zm__E\m_s_<zozm__Eomfasam..mv~r..~
`
`
`
`
`
`
`
`
`
`ozm_mn_09mmmzazm<_._<mooo.%m_.w<mmm_>_om<>>mou_€omT3sENNmv~r»~
`
`
`
`
`
`
`
`
`
`w.m<:<oz<_2_2oomooommm_mnE<.map“Em_.m_._m_ooz__2s_<moomn_2,5:_2n_TomQUNK
`
`
`
`6
`
`
`
`m<_._<m<_._<mooo
`
`
`
`
`m_o<wmm_s_ozm_Em_o<mmm_s_09135:QNUNHN
`.
`
`6
`
`
`
`

`
`U.S. Patent
`
`Dec. 15,1998
`
`Sheet 6 of 9
`
`5,850,594
`
`510
`
`535
`
`DATA ENTRY
`
`DEVICE
`
`TRANSMISSION
`MEMORY
`
`
`
`505
`
`TRANSCEIVER
`
`520
`
`515
`
`
`
`DATA PORTS
`
`
`
`
`
`
`
`
`
`
`
`
`
`525
`
`CONTROLLER MEMORY
`
`PROGRAMMING CODE
`
`FORWARD CODE
`
`MESSAGE CODE
`
`AF CODE
`
`AM CODE
`
`DF CODE
`
`DM CODE
`
`ROUTER
`
`RECONCILER
`
`540
`
`530
`
`SUBSCRIBER DATABASE
`
`DEVICE
`ADDRESS
`
`
`
`DEVICE FRIEND/CANNED
`TYPE MESSAGE LISTS
`
`545
`
`1 0
`
`7
`
`

`
`U.S. Patent
`
`Dec. 15,1998
`
`Sheet 7 of 9
`
`5,850,594
`
`6
`
`555
`
`CPU
`OPERATDN
`
`RECEIVE
`INFORMATION I=RoIVI
`TRANSCEIVER
`
`564
`
`552
`560
`
`ADD
`REFERENCE
`FRIEND/MESSAGE
`FRIEND/CANNED
`INCLUDE AF
`INFO. TO DEVICE LIST
`MESSAGE LIST FOR
`OR AM CODE
`
`DEVICE
`
`
`
`
`
`
`
`
`PROVIDE DEVICE
`
`ADDRESS,
`PROGRAMMING
`
`
`
`
`
`REFERENCE
`FRIEND/CANNED
`MESSAGE LIST FOR
`
`DEVICE
`CODE, AND
`
`APPROPRIATE
`
`PROGRAMMING
`INFO. TO
`
`TRANSCEIVER
`
`574
`
`
`
`
`REFERENCE
`TRANSMISSION MEMORY
`TO RECOVER MESSAGE
`INFO. ASSOCIATED WITH
`
`MESSAGE NUMBER
`PROVIDED BY SENDING
`
`DEVICE
`
`
`INFO.
`INCLUDE
`FORWARD
`CODE ?
`
`
`
`
`
`578
`
`ACTIVATE
`ROUTER
`
`
`
`
`
`
`
`580
`
`INFO.
`INCLUDE
`MESSAGE
`CODE ?
`
`MESSAGE
`INFO. IN FORM
`OF M ESSAG E
`
`586
`RECOVER MESSAGE
`ASSOCIATED WITH
`CANNED MESSAGE
`
`
`ALIAS
`
`
`
`
`
`
` ALIAS LOCATED
`IN CANNED MESSAGE
`
`
`LIST OF
`DEVICE
`FIG. 13
`
`
`
`8
`
`

`
`U.S. Patent
`
`Dec. 15,1998
`
`Sheet 8 of 9
`
`5,850,594
`
`ROUTER
`
`605
`
`OPERATION
`
`
`
`
`RECEIVE MESSAGE
`
`INFORMATION
`
`ACTIVATE
`
`RECONCILER
`
`5-20
`
`615
`
` FRIEND
` RECIPIENT
`ALIAS LOCATED
`INFO. IN FORM
`IN FRIEND LIST
`OF FRIEND
`OF DEVICE
`ALIAS ?
`
`
`
`625
`
`
`
`
`RECOVER ADDRESS
`
`
`
`REFERENCE CANNED
`ASSOCIATED WITH
`MESSAGE LIST
`FRIEND ALIAS
`
`
`ASSOCIATED WITH
` ADDRESSED DEVICE
`
`
`
`
`
`
`
`MESSAGE:
`CANNED
`MESSAGE FOR
`ADDRESSED
`DEVICE
`
`PROVIDE RECIPIENT
`ADDRESS, MESSAGE
`CODE, MESSAGE
`NUMBER» AND
`MESSAGE ALIAS TO
`TRANSCEIVER
`
`
`
`
`
`PROVIDE RECIPIENT
`
`ADDRESS, MESSAGE
`
`CODE, MESSAGE
`
`NUMBER, AND MESSAGE
`TO TRANSCEIVER
`
`
`
`FIG. 14
`
`9
`
`

`
`U.S. Patent
`
`Dec. 15,1998
`
`Sheet 9 of 9
`
`5,850,594
`
`660
`
`CPU
`
`OPERATION
`
`
`
`RECEIVE NON-MATCHING
`
`FRIEND/MESSAGE ALIAS
`
`
`
`PROVIDE DEVICE
`
`ADDRESS, AF/AM CODE,
`AND FRIEND/MESSAGE
`ALIAS TO TRANSCEIVER
`
`
`
` FRlEND/
`MESSAGE ADDED
`
`
`
`
`TO DEVICE
`LIST ?
`
`
`PROVIDE MESSAGE
`INFO./FRIEND INFO. TO
`
`ROUTER AND CPU
`
`FIG. 15
`
`10
`
`10
`
`

`
`5,850,594
`
`1
`METHOD AND APPARATUS FOR
`EFFICIENTLY TRANSMITTING ADDRESSES
`AND MESSAGES FROM PORTABLE
`MESSAGING UNITS OVER A VVIRELESS
`COMMUNICATION CHANNEL
`
`FIELD OF THE INVENTION
`
`This invention relates in general to systems including
`portable messaging units, and more specifically to portable
`messaging units for sending and receiving messages over
`wireless communication channels.
`
`BACKGROUND OF THE INVENTION
`
`Wireless communication systems typically provide mes-
`sages to subscriber units, such as portable messaging units.
`With the advent of two-way messaging, portable messaging
`units have also been able to transmit to other portable units
`and to fixed devices, such as computers. Messages in the
`communication system are generally delivered and/or
`received over a wireless communication channel, which
`usually has a limited bandwidth that permits only a limited
`amount of information to be transmitted over the channel
`within a specified time interval. Therefore, it is desirable to
`keep messages transmitted over the wireless channel as short
`as possible.
`However, subscribers to the communication system often
`wish to send and receive relatively long messages. Also,
`addresses indicative of recipient devices are sometimes quite
`lengthy. For instance, electronic mail standards usually
`require extensive header information that is unsuitable for
`transmission over a wireless channel of limited bandwidth.
`As a result, two-way messaging can unduly crowd comm11-
`nication systems, resulting in inefficient channel use and
`message delays.
`Thus, what is needed is a way to provide more eflicient
`messaging in a wireless communication system including
`portable messaging units.
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`FIG. 1 is an illustration of a communication system
`including portable messaging units (PMUs) and a system
`controller according to the present invention.
`FIG. 2 is an electrical block diagram of a PMU included
`in the communication system of FIG. 1 according to the
`present invention.
`FIG. 3 is a flowchart of an operation of a processor
`included in the PMU of FIG. 2 according to the present
`invention.
`
`FIG. 4 is a flowchart of an operation of a receiver included
`in the PMU of FIG. 2 according to the present invention.
`FIG. 5 is a flowchart depicting an operation of a sender
`included in the PMU of FIG. 2 according to the present
`invention.
`
`FIGS. 6-11 are signal diagrams illustrating signals pro-
`vided between the PMU of FIG. 2 and the system controller
`of FIG. 1 according to the present invention.
`FIG. 12 is an electrical block diagram of the system
`controller included in the communication system of FIG. 1
`according to the present invention.
`FIG. 13 is a flowchart illustrating an operation of a central
`processing unit (CPU) included in the system controller of
`FIG. 12 according to the present invention.
`FIG. 14 is a flowchart depicting an operation of a router
`included in the system controller of FIG. 12 according to the
`present invention.
`
`10
`
`15
`
`25
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`2
`FIG. 15 is a flowchart depicting an operation of a recon-
`ciler included in the system controller of FIG. 12 according
`to the present invention.
`
`DESCRIPTION OF A PREFERRED
`EMBODIMENT
`
`FIG. 1 is an illustration of a communication system 100
`for providing two-way communication between a system
`controller 110 and one or more portable messaging units
`(PMUs) 105, such as battery powered selective call
`receivers, over at least one wireless communication channel,
`e.g., at least one radio frequency communication channel.
`The system controller 110 can also be coupled to other types
`of devices, such as computers 115, by wireline communi-
`cation links. Because radio frequency communication chan-
`nels typically have limited bandwidths, only a limited
`amount of information can be transmitted over a channel
`
`within a specified time interval. Therefore, the communica-
`tion system 100 according to the present invention employs
`relatively short aliases to communicate frequently transmit-
`ted information from the PMUs 105 to the system controller
`110. Specifically, frequently used messages can be repre-
`sented by message aliases, and addresses of recipients to
`whom messages are frequently send can be represented by
`recipient aliases. Such recipients can be referred to as
`“friends”.
`
`Databases of the frequently transmitted information and
`the associated aliases are preferably stored at the PMUs 105
`and at the system controller 110 so that each device can
`recognize an alias and conveniently interpret
`the more
`lengthy message or friend address associated therewith. In
`accordance with a preferred embodiment of the present
`invention, the databases of both the system controller 110
`and the PMUs 105 are updated, when necessary, by the
`controller 110 to avoid situations in which information
`
`stored in a PMU database is not equivalent to that stored in
`the controller database.
`
`FIG. 2 is an electrical block diagram of a PMU 105, which
`includes a transceiver 205 for sending and receiving infor-
`mation over a radio frequency communication channel and
`a processor 210 for controlling operations of the PMU 105.
`Controls 215 provide user-initiated signals to the processor
`210, and a display 220 presents information to a user in
`response to activation by the processor 210. A message
`memory 225 is coupled to the processor 210 for storing
`received messages and message numbers associated with the
`received messages. Also, a database 230 is coupled to the
`processor 210 for storing the frequent recipient, i.e., friend,
`list and the frequent message list. Preferably, the lists in the
`database 230 are maintained in accordance with instructions
`by the user of the PMU 105 by over—the—air programming.
`
`In accordance with the preferred embodiment of the
`present invention, each friend included in the friend list is
`associated with a recipient alias. More specifically, entries in
`the friend list include names of recipients, or friends,
`to
`whom messages are frequently sent and aliases of addresses
`associated with the friends. The addresses could also be
`
`included in the database 230, if desired. An entry in the
`friend list could, for instance, be as follows:
`
`Friend
`
`Alias
`
`Address
`
`Lou
`
`00011
`
`r_lou_b003@email.company.com@INTERNET
`
`11
`
`11
`
`

`
`5,850,594
`
`3
`According to the present invention, a friend list entry could
`include more than one recipient or even a group of people.
`Such an entry could be as follows:
`
`Friend(s)
`
`Alias
`
`Address(es:)
`
`Lou, Jim,
`and Ed
`
`00011
`
`r_lou_b003@email.company.com@INTERNET
`jim_l001@email.company.group.com
`edward_g004@company. grp .com@INTERNET
`
`Similarly, each message included in the message list is
`associated with a message alias. These “canned messages”
`are also preferably associated with a message designation,
`which could be set by the user, so that the user can easily
`remember the message and select it for transmission by
`providing information to the processor 210 via the controls
`215. An entry in the message list could, for example, include
`a number as a designator and be as follows:
`
`Message
`Designation
`7
`
`Canned
`Message
`Alias
`001010 MEET ME IN THE CAFETERIA FOR
`COFFEE
`
`When niessages entries are instead designated by a key word
`or words, an entry could be as follows:
`
`Message
`Designation
`Coffee
`
`Canned
`Message
`Alias
`001010 MEET ME IN THE CAFETERIA FOR
`COFFEE
`
`As illustrated, the messages and the addresses to which
`the messages are transmitted by the PMU 105 can be
`relatively lengthy and unsuitable for frequent transmission
`over the radio communication channel. Therefore, in accor-
`dance with the present invention, the friend and message
`aliases are instead transmitted from the PMU 105 to the
`system controller 110 over the radio frequency communi-
`cation channel to minimize the likelihood of channel crowd-
`ing and resulting delays. Preferably, friend and message
`aliases comprise codes that include a predetermined number
`of bits, wherein the codes include a fewer number of
`characters than do the recipient addresses or the canned
`messages. By way of example,
`the friend aliases could
`comprisc fivc-bit codcs, thcrcby permitting storage of up to
`thirty-two friends. The message aliases could comprise
`six-bit codes, thereby permitting storage of up to sixty-four
`canned messages. It will be appreciated that different types
`of codes or different numbers of characters could alterna-
`
`tively be used for the aliases.
`According to the present invention, the PMU 105 further
`includes a device memory 235 for storing device
`information, such as the address of the device. The device
`memory 235 also preferably stores a programming code for
`recognizing inconiing prograniniing inforniation fror11 the
`system controller 110 (FIG. 1), a forward code used for
`forwarding received messages to a friend, a message code
`used for sending and receiving messages, and a send code
`used for recognizing transmission commands received from
`the controls 215. Other codes for designating other trans-
`mittcd and received signals include an “add friend”
`code, a “delete friend” (DF) code, an “add message”
`code, and a “delete message” code, as will be explained in
`greater detail below.
`
`10
`
`15
`
`25
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`4
`A sender 240 included in the PMU 105 prepares infor-
`mation for transmission from the PMU 105, and a receiver
`245 processes received information. Preferably, the sender
`240 and the receiver 245 comprise firmware stored in the
`device memory 235 and executed by the processor 210.
`Alternatively, the sender 240 and receiver 245 could be
`implemented using hardware capable of performing equiva-
`lent operations.
`FIG. 3 is a flowchart of an operation of the processor 210
`according to the present
`invention. When, at step 255,
`information is received from the transceiver 205,
`the
`receiver 245 is activated, at step 260. When, at steps 265,
`270, a signal is received from the controls 215, and the
`signal includes the send code, the sender 240 is activated, at
`step 275. When, at steps 265, 270, another type of signal is
`received from the controls 215, other processing is
`performed, at step 280, by the processor 210.
`Referring next to FIG. 4, a flowchart illustrates an opera-
`tion of the receiver 245. When, at step 305, the receiver 245
`receives information including a programming code,
`the
`programming information is stored in the appropriate loca-
`tion of the database 230, at step 310. For instance, when the
`prograniniing information includes an “add” coniniand and
`friend or message information, the information is added to
`the friend or message list as instructed by the system
`controller 110. It will be appreciated that friend information
`could also be modified via over-the-air programming from
`the controller 110, such as by including modified informa-
`tion with an add command or by using a unique “modify”
`command. When the programming information includes a
`“delete” command and information by which a friend or
`message entry can be identified, the friend or message entry
`is deleted from the appropriate list.
`At step 315, the received information could include an AF,
`AM, DF, or DM code directing the PMU 105 to inquire of
`the user whether a friend or message should be deleted or
`whether an additional alias, e.g., an additional recipient
`alias, should be added. In this case, at step 320, information
`received with the code is displayed, at step 320, on the
`display 220. When, for instance, the system controller 110
`has received a communication from the PMU 105 and does
`
`the
`not recognize an included friend or message alias,
`controller 110 can transmit an inquiry to the PMU 105
`asking whether a new friend or new message is to be added
`to a list stored in the database 230. When the system
`controller 110 receives a delete message (DM) command or
`a delete friend (DF) command from a different PMU in the
`communication system 100 (FIG. 1),
`the controller 110
`could inquire as to whether the user of the PMU 105 would
`also like to delete the message or friend. For instance, when
`a particular user requests that a friend be deleted, an inquiry
`could automatically be provided to the “deleted” friend
`asking whether the user should also be deleted from the
`friend’s list. When the friend answers in the affirmative, the
`system controller 110 could delete the user from the friend
`list associated with the PMU of the deleted friend. Once the
`inquiry is displayed, at step 320, the receiver 245 awaits the
`reception, at step 325, of a user-initiated signal indicating a
`response. Thereafter, at step 330, the sender 240 is activated,
`at step 330, to transmit the response to the system controller
`110.
`
`the information received by the
`When, at step 335,
`receiver 245 includes a message code, indicating that the
`system controller 110 is routing a message to the PMU 105
`over the wireless communication channel, a message num-
`ber associated with the message and included in the signal
`is stored, at step 340, in the message memory 225. The
`
`12
`
`12
`
`

`
`5,850,594
`
`5
`the received
`receiver 245 then compares, at step 345,
`message information with aliases stored in the message list.
`When the received message information is equivalent to a
`canned message alias,
`the message associated with the
`matching alias is retrieved from the list and stored, at step
`355, in the message memory 225. Otherwise, the message
`information itself is stored in the message memory 225, at
`step 350. Thereafter, the message can be presented to the
`user in a conventional manner.
`
`FIG. 5 is a flowchart illustrating an operation of the sender
`240 according to the present invention. At step 405, a signal
`is received from the controls 215. When, at step 410, the
`signal includes a DF or DM codc, indicating that thc uscr
`wants to delete a friend or message entry identified by the
`received user-initiated signal, the database 230 is referenced,
`at step 415,
`to recover the selected friend or message
`information and the alias associated therewith. The sender
`
`10
`
`15
`
`240 then provides, at step 420, the appropriate DF or DM
`code to the transceiver 205 along with enough information
`to identify the entry that is to be deleted. For example, the '
`alias and the entry information, such as friend name, friend
`address, message designation, and/or actual message, can be
`provided to tl1e transceiver 205 with tl1e DF or DM code to
`assist the controller 110 in locating the correct entry. As
`mentioned above, the controller 110, in response to receiv-
`ing the code and related information, transmits program-
`ming information to the PMU 105 for updating the database
`230.
`
`25
`
`When, at step 425, the user-initiated signal includes an
`AM or AF code, indicating that the user desires to add an
`additional message or friend to the database 230, the sender
`240 further determines, at step 430, whether the signal
`references a previously received message. When the user-
`initiated signal does not reference a previously received
`message, the AF or AM code and the friend or message
`information which is to be entered into the database 230 is
`
`provided, at step 440, to the transceiver 205. When the signal
`references a previously received message, indicating that the
`message or the message originator is to be added to the
`database 230, suflicient identifying information, e.g., mes-
`sage number, friend information, actual message, or address
`information, is recovered from the message memory 225, at
`step 435, and provided to the transceiver 205 along with the
`AF or AM code, at step 440.
`At step 445, reception of a signal including a forward
`code indicates that a previously received message is to be
`forwarded to another recipient. When, at step 450,
`the
`intended rccipicnt is a fricnd, i.c., whcn the intended rccipi-
`ent is included in the friend list, the forward code, the friend
`alias, and the message number of the message to be for-
`warded are provided to the transceiver 205, at step 455.
`When the intended recipient is not included in the friend list
`of the PMU 105, the forward code, the message number, and
`an address entered by the user are provided, at step 460, to
`the transceiver 205.
`When, at step 465, the signal includes a message code,
`indicating that a message is to be transmitted to another
`device, the sender 240 references, at step 470, the database
`230 to determine whether the designated recipient is a friend
`and whether the entered message is a canned message.
`Thereafter, at step 475, the message code, the friend alias or
`recipient address, and the message information or message
`alias are provided to the transceiver 205.
`Although thc PMU 105 is dcscribcd as transmitting one
`friend alias or one message alias to the system controller
`110, it will be appreciated that more than one alias can be
`transmitted when the user so indicates. When, for instance,
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`6
`a message is to be transmitted to three friends that are not
`grouped under a single alias, aliases for each of the friends
`can be transmitted to the system controller 110.
`As described above, the system controller 110 modifies
`the database 230 of the PMU 105 so that the lists stored in
`the controller 110 and the lists stored in the PMU 105 remain
`
`equivalent. However, one of ordinary skill will recognize
`that other methods for ensuring agreement between the
`PMU lists and the controller lists can alternatively be
`employed. By way of example, the user of the PMU 105
`could add to, delete from, or modify the database 230 via the
`controls 215, in response to which AF, AM, DF, and DM
`codcs and information could be automatically provided to
`the controller 110 to update the lists stored thereby.
`FIGS. 6-11 are signal diagrams illustrating signals com-
`municated between the system controller 110 and the PMU
`105 in accordance with the present invention. FIG. 6 depicts
`an example of information that could be sent by the PMU
`105 to the system controller (SC) 110 to add a friend to the
`database 230 (FIG. 2). The information could include the AF
`code followed by the friend designation, e.g., name, and the
`friend address. When an originator of a previously received
`message is to be added to the friend list, a friend name and
`a message number associated with the previous message
`could simply be appended to the AF code, in which case the
`controller 110 could look up the previous message to assign
`a friend alias to the address of the message originator. FIG.
`7 shows an example of a responsive signal provided by the
`controller 110 to the PMU 105. The responsive signal
`preferably comprises the PMU address, the programming
`code, and programming information, which includes at least
`an add command, an assigned friend alias, and the friend
`name for storage in the database 230 of the PMU 105. Rather
`than providing separate programming codes and add
`commands,
`it will be appreciated that a unique “add”
`programming code could be transmitted.
`In FIG. 8, the PMU 105 requests the deletion of a friend
`from its database 230 by sending the DF code followed by
`the entry identification information, which could include the
`friend alias and/or friend name. In response, as shown in
`FIG. 9, the controller 110 transmits the PMU address, the
`programming code, the delete command, and information
`indicative of the friend list entry, such as the alias of the
`friend. The processor 210 (FIG. 2) then deletes the friend
`from the database 230.
`
`FIGS. 10 and 11 show examples of message transmissions
`from the PMU 105. In FIG. 10, the PMU 105 transmits a
`frcqucntly transmittcd message to a friend by sending the
`message code, the friend alias, and the message alias. The
`controller 110 receives the signal and decodes the friend
`alias and the message alias. The controller 110 then sends the
`message indicated by the message alias to an address
`associated with the friend alias. In FIG. 11, the PMU 105
`forwards a previously received message to a friend by
`transmitting the forward code,
`the friend alias, and the
`number of the previous message. The controller 110,
`in
`response to receiving the forward signal, decodes the friend
`alias and looks up the message associated with tl1e message
`number. The message is then transmitted to the address
`associated with the friend alias.
`
`Although not shown in FIGS. 6-11, it will be appreciated
`that some method of identifying the transmitting PMU 105
`can be included in the signal if necessary. For instance, the
`PMU addrcss could be sent
`to idcntify thc PMU 105.
`Alternatively, prior art methods such as transmitting on a
`given frequency or at a given time could be used. It will be
`further appreciated that canned messages can be added and
`
`13
`
`13
`
`

`
`5,850,594
`
`10
`
`15
`
`25
`
`30
`
`35
`
`7
`deleted by the PMU 105 in the manner described for adding
`and deleting friends.
`The signals transmitted by the PMU 105 to the system
`controller 110 over the wireless communication channel can
`be relatively short because the aliases are often significantly
`shorter in length than are the related addresses and mes-
`sages. As a result, the likelihood of crowding the channel is
`minimized, rendering message delivery delays less likely.
`Use of the aliases by the PMU 105 is also convenient for
`the user because the user does not have to memorize lengthy
`addresses of friends or enter large amounts of information
`every time a message is to be sent. For instance, the 11ser
`only has to memorize a friend’s name, e.g., Lou, rather than
`the friend’s address, which could comprise a large number
`of characters that are not easily remembered. Additionally,
`the user only has to enter the word “Lou” to indicate the
`recipient. This eliminates situations in which the user has to
`continually reference a personal address book to recover a
`lengthy address, thereby saving time. Also, the likelihood of
`user error in typing lengthy addresses is minimized by using '
`the aliases, thereby increasing the probability of error-free
`message delivery to the intended recipient.
`FIG. 12 is an electrical block diagram of the system
`controller 110, which includes a transceiver 505 for sending
`and receiving information, a central processing unit (CPU)
`515 for processing the information, and a transmission
`memory 535 for storing messages that are transmitted within
`the communication system 100 (FIG. 1). Data ports 520 are
`included in the controller 110 for transmitting messages to
`and receiving messages from wired devices, such as com-
`puters 115 (FIG. 1). The controller 110 can also be coupled
`by the data ports 520 to a telephone network, such as the
`public switched telephone network (PSTN), for receiving
`message information from message originators via tele-
`phones and modems. A subscriber database 530 is coupled
`to the CPU 515 for storing subscriber information, such as
`addresses of devices that subscribe for service within the
`system 100 and friend and message lists associated with
`subscribing PMUs. Adata entry device 510 can be used to
`update the subscriber database 530.
`The controller 110 also includes a controller memory 525
`for storing information used in operating the controller 110.
`The controller memory 525 preferably stores the program-
`ming code, the forward code, the message code, and AF,
`AM, DF, and DM codes. A router 540 included in the
`controller 110 transmits messages within the communication
`system 100, and a reconciler 545 updates friend and message
`lists stored by the controller 110 and the PMUs within the
`communication system 100. Preferably, the router 540 and
`the reconciler 545 are firmware elements stored in the
`memory 525 and executed by the CPU 515 during operation
`of the controller 110. Alternatively, the router 540 and the
`reconciler 545 can be implemented as hardware capable of
`performing equivalent operations.
`FIG. 13 is a flowchart of an operation performed by the
`CPU 515, which, at step 555, receives information from the
`transceiver 505. When, at step 560, the information includes
`anAF code or anAM code, indicating that the user of a PMU
`105 wants to add a friend or message alias,
`the lists
`associated with that PMU 105 are referenced, at step 562, in
`the subscriber database 530. The friend or message infor-
`mation appended to the AM or AF code is then assigned an
`additional message alias or an additional friend alias and
`added, at step 564, to the appropriate list associated with the
`PMU 105.
`When, at step 568, the information includes a DM or DF
`code, indicating that the user of the PMU 105 wishes to
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`8
`delete a friend or canned message from its memory, the lists
`associated with the PMU 105 are referenced, at step 570, and
`the entry associated with the incoming DM or DF code is
`deleted from the PMU’s list in the subscriber database 530,
`at step 572. Once the CPU 515 has deleted information from
`or added information to the PMU’s friend or canned mes-
`
`sage list maintained locally by the controller 110, at steps
`564, 572, the CPU 515 proceeds to modify the database 230
`(FIG. 2) stored by the PMU 105 accordingly. This is done by
`providing, at step 566,
`the PMU address, programming
`code, and appropriate programming information to the trans-
`ceiver 505 for transmission to the PMU 105.
`
`When, at step 574, the information received by the CPU
`515 includes a forward code, indicating that the user of the
`PMU 105 is forwarding a previously received message,