||||||l|||||||||||||||||||||||||||||||||||||l||||||||||||||||l||||||||||||l
`
`US(lU585l1594A
`
`United States Patent
`Cannon et al.
`
`in]
`
`I11]
`
`Patent Number:
`
`5,350,594
`
`I45] Date of Patent:
`
`Dec. 15, 1998
`
`I541
`
`MIST]-I01) AND APPARATUS FOR
`I-:1-'I=Ic1I-;I~I'I'i.Y "l‘lU\NSMl'l"l"|NG MJIJRI-LSSl".S
`AND MESSAGES FROM PORTABLE
`MESSAGING UNITS OVER A wIRE.I.I-Lss
`COMMUNICATION C1-IANNEI.
`
`ism
`
`5,IJI:6.IJ4€J
`5..1<7.3rI7
`S,41‘.i7,Il'.1[I
`
`References Cited
`. ..
`..
`..
`.
`.
`.
`.
`""5 W LN‘ 0"‘ UM“ 1°‘
`1l_e'1‘='U1 Brceden .4 ..i.
`................. .. 34l}.fS2S.4-1
`:n.«I-.ms
`{Re
`--
`15199:. Kant
`
`..
`
`I751
`
`Inventors: Gregory Cannon; Nancy Cannon,
`130111 tI1‘Kc]1I:r, Tex.
`
`|73|
`
`/Lafiigncez Mutilruli], 1nL‘.. Sclizaumhurg, 111.
`
`
`
`51'1"?“ Ciiilifl 01 ill
`5.«'53"-'53“?
`I-‘riIIIm*_\-' l:'.\'nnIiIier~——Edward 17. Urban
`A.¢sf.sri'Im !:'.r:.mII'I-Ie'I‘—~I.cc N guycn
`.-1. .'fI1J'.|"N¢'_'|-', x’igeIi.'_ or Firiii-—{'71IIIr1cs W. Rctliards
`
`'
`
`'
`
`I31]
`
`App]. No; 697,513
`
`|32
`
`I511
`I531
`
`|53|
`
`Filcclc
`
`Aug.26, 1995
`
`H0-‘IR we
`Int. Cl."
`
`455131.31 4551413; 4555419;
`U.S. Cl.
`455.1458; 34UI“825.22: 34[J,"S2S.2'I"; 3.-4[1£R25.44
`5.I: 3. :1:E "1P E"
`................................... .. 455.1412. -114.
`453.415, 417, 458-101}, 31.2, 31.3, 32.1.
`38.], 38.4. 564, 51.7, 4] ‘J; 34lJI'S25.44.
`311.1, 825.22. 375.‘
`
`[57]
`
`/\BS'|‘RAC'I‘
`
`Accimmunicalinn systcm (100) for providing Iwu-way cum-
`municalion including :1 pcirlahli: mcasaging unil (105) for
`sending :1 signal including :1 recipicnl alizu: over a wireless
`cumniuniczilion chaitintl and a controller (110) for receiving
`the. signal incluilirig Ihi: rccipirnt alias. This i:cIn1rn11i-:r { llli)
`than transmits :1 message to an address that is designated by
`the recipient alias and mat is longer than lhi: rucipicnl alias.
`
`9 Claims, El Drawing Slit.-el.-i
`
`215
`
`220
`
`CONTROLS
`
`205
`
`21
`
`G
`
`TRANSCEIVER
`
`PROCESSOR
`
`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
`
`RECEIVER
`
`240
`
`245
`
`225
`
`III!
`
`230
`
`I FREQUENT RECIPIENT
`(FRIEND) LIST
`
`FREOUENT MESSAGE
`
`(CANNED MESSAGE) LIST
`
`APPLE 1004
`
`APPLE 1004
`
`1
`
`

`
`U.S. Patent
`
`Dec. 15, 1998
`
`Sheet 1 of 9
`
`5,850,594
`
`V
`
`115
`
`
`V _/,_i__,,,.— CONTROLLER
`115
`
`
`PM“
`
`105
`
`PMU
`
`SYSTEM
`
`COMPUTER
`
`COMPUTER
`
`105
`
`M
`
`215
`
`220
`
`CONTROLS
`
`DISPLAY
`
`205
`
`210
`
`TRANSCEIVER
`
`PROCESSOR
`
`235
`
`225
`
`DEVICE MEMORY
`ADDQESS
`
`PROGRAMMING CODE
`FORWARD CODE
`
`MESSAGE MEMORY
`M INFORMATION
`
`230
`
`"ADD FRIEND" (AF) CODE
`
`DATA BASE
`
`
`"DELETE FRIEND" (DF) CODE
`"ADD MESSAGE" (AM) CODE
`
`“DELETE MESSAGE“ (DM) CODE
`MESSAGE CODE
`
`FHEQUENT RECIHENT
`IFFIIEND) LIST
`
`FREQUENT MESSAGE
`(CANNED MESSAGE) LIST
`
`SEND CODE
`
`RECEIVER
`
`940
`
`E
`
`.125
`
`FIG. 2
`
`2
`
`

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

`
`U.S. Patent
`
`Dec. 15, 1998
`
`Sl1cet3 0f 9
`
`5,850,594
`
`RECEIVER
`OPERATION
`
`305
`
`
`
`
`INFO.
`YES
`INCLUDE
`
`PROGRAMMING
`CODE ‘?
`
`STORE PROGRAMMING
`INFO. IN DATABASE
`
`310
`
`320
`
`
`
`DISPLAY RECEIVED INFO.
`INFO.
`(i.e., FFIIENDIIMESSAGE
`INCLUDE
`INFO.) WITH
`AF‘ AM’ DF’ OR
`APPROPRIATE INQUIRY
`DM CODE
`
`(i.e., ADDIDELETE)?
` 7
`
`
`
`
`
`
`325
`
`
`
`CONTROLS
`
`INFO.
`330
`INCLUDE
`
`MESSAGE CODE
`
`?
`
`340
`
`FIG. 4
`
`
`
`
`
`STORE MESSAGE
`NUMBER
`
`
`
`
`
`
`STORE MESSAGE
`STORE
`MESSAGE
`YES ASSOCIATED WITH
`MESSAGE INFO.
`INFO.=CANNED
`CANNED MESSAGE
`IN MESSAGE
`MESSAGE ALIAS
`IN MESSAGE
`MEMORY
`
`MEMORY
`
`
`
`4
`
`

`
`U.S. Patent
`
`Dec. 15, 1998
`
`Sheet 4 Int‘ 9
`
`5,850,594
`
`405
`
`415
`
`RECEIVE SIGNAL
`FROM CONTROLS
`
`
`
`
`REFERENCE
`DATABASE TO
`
`RECOVER
`
`FRIENDIMESSAGE
`INFORMATION AND
`SIGNAL
`FRIENDIMESSAGE
`INCLUDE DM
`ALIAS
`OR DF COD
`
`
`
`
`
`PROVIDE DFIDM
`
`
`
`SENDER
`OPERATION
`
`
`
`475
`
`PROVIDE MESSAGE
`
`CODE,
`ADDRESSIIFRIEND
`ALIAS AND
`MESSAGE {CANNED
`MESSAGE ALIAS TO
`TRANSCEIVER
`
`
`
`INFO.. AND
`SIGNAL
`
`INCLUBE AM
`FRIENDIMESSAGE
`
`’°""’°‘3 To
`TRANSCEIVER
`
`CODE
`FRIENDIMESSAGE
`
`470
`
`
`
`
`
`
`
`SIGNAL
`
`INCLUDE
`FORWARD
`
`NO
`
`
`
`SIGNAL
`
`
`REFERENCE
`RECEIVED
`MESSAGE
`
`HEFERE“°E
`DATABASE TO
`DETERMINE
`WHETHER
`REC|PIENT=FR|END
`AND WHETHER
`MESSAG E=CANNED
`
`
`
`YES
`465
`
` SIGNAL
`
`INCLUDE
`MESSAGE
`
`CODE ?
`
`NO
`
`MESSAGE
`
`
`
`
`
`YES
`
`
`
`
`REFERENCE
`MESSAGE MEMORY
`TO RECOVER
`FRIENDIMESSAGE
`INFO.
`
`
`
`PROVIDE FoRwARD
`CODE, ENTERED
`
`PROVIDE AFIAM
`
`ADDRESS , AND
`
`
`INFO. TO
`
`
`TRANSCEIVER
`
`
`
`
`PROVIDE FORWARD
`CODE‘ FRIEND
`ALIAS, AND
`MESSAGE NUMBER
`TRANSCEIVER
`
`FIG. 5
`
`MESSAGE NUMBER
`
`
`
`460
`
`5
`
`

`
`U
`
`tnEM
`
`5mD
`
`m
`
`0..M
`
`am,
`
`4E
`
`
`
`
`
`
`
`
`
`mE._m_oMm<_._<oz<s__>_oomooommm_moo<.um.n_zm_Eoz_2s_<moomn_%22n_TomQmvwuw
`
`
`
`P..u.:2<2mooowmmmnoqm=2<zmooo.sEum.Em
`
`
`
`
`
`
`mmmmn_a<.&nzm_En_zm_Eaoz__2_2<¢oomn_E:_an_TomNmvmnw
`m__2<zm<_._<oz<zs_oomooo
`
`
`
`
`
`1..m<_._...nzm_mn_m=2<zazm__m_"_omT2Em.USE
`
`6
`
`
`
`
`0.,mm_ms5zm<_._4mnoo.%m_o<wwm__2aom<3mou_3omT:2n_NMWNW
`
`
`
`
`
`m<_._<moooT.mo<mmm_.2ozm_Emw<mwms_omfasa©NUNHM
`
`
`m<_._<
`
`
`
`6
`
`
`
`

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

`
`U.S. Patent
`
`Dec. 15, 1998
`
`Sheet 7 of 9
`
`5,850,594
`
`9
`
`555
`
`CPU
`OPERMON
`
`RECEIVE
`INFORMATION FFIOM
`TRANSCEIVER
`
`560
`
`
`
`553
`
`REFERENCE
`
`
`
`
`
`IN]:
`MESSAGE LIST FOR
`OR AM CODE
`
`
`DEWCE
`0. TO DEVICE LIST
`
`564
`
`
`
`ADD
`
`
`
`
`REFERENCE
`PROVIDE DEVICE
`FFIIENDIICANNED
`ADDRESS.
`MESSAGE LIST FOR
`PROGRAMMING
`DEVICE
`CODE, AND
`APPROPRIATE
`PROGRAMMING
`
`
`
`
`
`
`
`
`
`DELETE FRIENDIOANNED
`MESSAGE FFIOM LIST
`
`INFO. T0
`TRANSCEIVER
`
`574
`
`
`
`
`
`
`INFO.
`REFERENCE
`INCLUDE
`TRANSMISSION MEMORY
`
`FORWARD
`TO RECOVER MESSAGE
`CODE ?
`
`INFO. ASSOCIATED WITH
`MESSAGE NUMBER
`
`PROVIDED BY SENDING
`DEVICE
`
`
`578
`
`ACTIVATE
`ROUTER
`
`
`
`
`580
`
`
`
`INFO.
`INCLUDE
`MESSAGE
`CODE ?
`
`586
`
`ESSAGE
`INFO. IN FORM
`OF MESSAGE
`' LIAS ?
`
`RECOVER MESSAGE
`ASSOCIATED WITH
`
`CANNED MESSAGE
`ALIAS
`
`
`
`588
`
`ACTIVATE
`RECONCILEFI
`
`
`
`
`MESSAGE
`ALIAS LOCATED
`IN CANNED MESSAGE
`
`LIST OF
`DEVICE
`
`
`
`
`FIG. 13
`
`8
`
`

`
`U.S. Patent
`
`Dec. 15, 1998
`
`Sheet 8 of 9
`
`5,850,594
`
`
`
`
`
`ACTIVATE
`
`RECONCILER
`
`620
`
`
`
`615
`
`ROUTER
`OPERATION
`
`
`
`605
`
`RECEIVE MESSAGE
`INFORMATION
`
` FRIEND
`
`RECIPIENT
`ALIAS LOCATED
`
`INFO. IN FORM
`IN FRIEND LIST
`OF FRIEND
`OF DEVICE
`ALIAS ?
`
`
`
`625
`
`
`
`
`RECOVER ADDRESS
`
`
`
`REFERENCE CANNED
`ASSOCIATED WITH
`MESSAGE [_|sT
`FRIEND ALIAS
`
`
`ASSOCIATED WITH
` ADDRESSED DEVICE
`
`
`
`
`
`PROVIDE RECIPIENT
`
`ADDRESS. MESSAGE
`CODE. MESSAGE
`
`
`
`
`ESSAGE=
`CANNED
`MESSAGE FOR
`ADDQESSED
`DEV|CE
`
`NUMBER. AND
`MESSAGE ALIAS T0
`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
`
`CPU
`
`OPERATION
`
`RECEIVE NON-MATCHING
`
`FRIEND/M ESSAGE ALIAS
`
`660
`
`
`PROVIDE DEVICE
`ADDRESS, AF/AM CODE,
`AND FRIEND/MESSAGE
`
`ALIAS T0 TRANSCEIVER
`
`
`
` FRIEND!
`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
`ICFFICIENTLY TRANSMITTING ADDRESSES
`AND MESS/\Gl'lS FROM PORTABI.E
`MESSAGING UNITS OVER A WIRELESS
`COMMUNICATION CHANNICI.
`
`lit ELI) OF Tl-Il:‘ INVE.N'l'ION
`
`'l‘his 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.
`
`ll)
`
`BAC‘KGl{0UNl) OF THE INVEN'l‘I()N
`
`Wireless commu nication 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 tire generally delivered anchor
`received over a wireless communication channel. which
`usually has it limited bandwidth that permits only a limited
`amount of information to be transmitted over the channel
`within a specified time interval. 'lht.-rcfore, 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 urtsuitable for
`transmission over a wireless channel of limited bandwidth.
`As a result. two—way messaging can unduly crowd commu-
`nication systems, resulting in incfficient channel use and
`message delays.
`Thus, what is needed is a way to provide more elficicnt
`messaging in a wireless communication system including
`portable messaging units.
`BRIEF l)l3SCRIP'fION OF THE DRAWINGS
`
`is an illustration of a cornrrtunication system
`1
`FIG.
`including portable messaging units (PMUs) and a system
`controller according to the present invention.
`FIG. 2 is an electrical block diagram ofa 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. -’-I is it llowchart 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 signafs 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 hlock diagram of the system
`controller included in the oon1tt1tJttieat ion 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 oontrollerof FIG. 12 according to the
`present invention.
`
`EU
`
`35
`
`40
`
`50
`
`55
`
`hit
`
`55
`
`2
`FIG. 15 is a flowchart depicting an operation of a DCOUi'|'
`cilcr included in the system controller of FIG. 12 according
`to the present invention.
`
`DESCRIPTION OF A PREFERRED
`EMB-UDlMl;'N'l‘
`
`FIG. 1 is an illustration ofa communication system 100
`for providing two-way comrnunication between a system
`controller 110 and one or more portable messaging units
`(I-‘MUs)
`[05, such its 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. There-fore, the communica-
`tion system 100 according to the present invention employs
`relatively short aliases to communicate frequently transmit-
`ted information from the l’MUs 105 to the system controller
`110. Specifically, frequently used me-ssages can be repre-
`sented by message aliases, and addresses of recipients to
`whom messages are frequently send can he represented by
`recipient aliases. Such recipients can be referred to as
`“friends”.
`
`Databases of the frequently transrnittcd ittfomtalion and
`the associated aliases are preferably stored at the PMUs 105
`and at the system controller 110 so that each rlcvicc can
`recognize an alias and conveniently interpret
`the more
`lengthy me.~a‘.:tgc or friend address assoclaterl therewith. In
`accordance with a prefcrrerl 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 date hasc.
`
`FIG. 2 is an electrical block diagram ofa PMU105, which
`includes it 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—initiate-rt signals to the processor
`210, and a display 22!) 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 rtatabase 230 is coupled to the
`processor 21!] for storing the frequent recipient, i.e., friend.
`list and the frequent message list. Preferably, the lists in the
`database 2.30 are maintained in accordance with instructions
`by the user of the PMU 105 by over—the—air programming.
`
`In accordance with the pretcrrcd embodiment of the
`present iijvention, each friend included in the friend list is
`associated with a recipient alias. More specifically. entries iii
`the friend list
`include names of recipients, or lriends, 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, he as follows:
`
`FI'icI'td
`
`Alitts
`
`Address
`
`Lott
`
`(Jill) I I
`
`r_tou _btl|)3t'{§_Je trmil.co1rtp'anv.co mt[r:[-.‘u"I‘E RNET
`
`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:
`
`Friendfst
`
`Alias
`
`Addresetest
`
`Lon, Jinn,
`and Ed
`
`t)0(.t).t
`
`_ lou _l3Ufl3{tji'etll7tll.L!EN1\[)Brt}£C0tI'IlE5'lNIFLRNET
`t
`-lint _lt'}|tItltfjtemail,cnt1'tpany.group.oon1
`edwarrl gt] ll-l»@con1[xsny:grp.com@l3\'1'E RNET
`
`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 l‘!(.‘I 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
`fksignatioti
`T
`
`fitlias
`IIJl)‘lI)1l_'I
`
`(‘tinned
`Message
`Mf:ilTl' ME IN T11]? CAFI-_-"l‘l'ZRlA E-"OR
`COFFEE
`
`When messages entries are instead desigtlated by a key word
`or words. an ent.ry could be as follows:
`
`it-iesatage
`lksignalion
`("Toffee
`
`Alias
`tlfllfilll
`
`Canned
`Message
`.\t‘flil'Tl" MF. [N THT: Ci'\l7l7.TE.lU.?\ FOR
`{"01-'F'FiF.
`
`As illustrated, the messages and the addresses to which
`the messages are transmitted by the PMU 105 can be
`relativcly 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 Ill] over the radio lrequcncy communi-
`cation channel to minimize the likelihood ofchannel crowd-
`ing and resulting delays.
`|’refera|,1ly, friend and message
`aliases comprise codes that include a predetermined number
`of bits, wherein the codes include 21 fewer number of
`characters than do the recipient addresses or the canned
`messages. By way of example,
`the friend aliases could
`comprise live-hit codes, thereby permitting storage of up to
`thirty-two friends. The message aliases could comprise
`six-bit nodes, thereby permitting storage of up to sixty-four
`canned messages. it will he appreciatetl that different types
`of codes or cliflercnt nurnbers of characters could alterna-
`tively be used for the aliases.
`According to the present invt:-ntion, the PMU 1ll5 fiirther
`includes a device memory 235 for storing device
`information, such as the address of the device. The device
`memory 235 aim prt: ferably stores a programming code for
`recognizing incoming programming information from the
`system controller 110 (FIG. 1). a forward code used for
`forwarding rcceivcd messages to a friend, a ntcssage 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-
`mittetl and received signals include an "add friend” (Ali)
`code, a "delete friend" (DP) code, an "add message" (AM)
`code, and is "delete message“ code, as will be explained in
`greater detail below.
`
`4
`A sender 240 included in the PMU I05 prepares infor-
`mation for transmission from the PMU 105, and a receiver
`245 processes received information. Prr: fertility. 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 it 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 sendcr2-10 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 it programming code, the
`programrning information is stored in the appropriate loca-
`tion ofthe dataliasc 230, at step 310. For instance. when the
`programming information includes an "add" command and
`friend or message information, the information is added to
`the friend or message list as instmctctl by the system
`controller 110. It will be appreciated that friend infonnation
`could aim be modilied via over-the-air programming from
`the controller 110, such as by including modilled informa-
`tion with an and command or try using a unique "modify“
`command. When the programming information includes a_
`"delete" command and information by which a friend or
`message entry can he identified, the friend or message entry
`is deleted from the appropriate list.
`At step 3 I5, tl'tt':'— received infortnatiorl could include an AF.
`AM, DF, or DM code directing the PMU I05 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 3. communication from the PMU 105 and does
`not
`recognize an included friend or message alias,
`the
`controller 110 can In] nsmit an inquiry to the PMU 105
`asking whether a new friend or new message is to he added
`to at
`list stored in the database 230. When the system
`controller Ill} receives a delete message (DM} command or
`a delete friend [DI~‘) 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
`it particular user requests that a friend be deleted, an inquiry
`could automatically be provided to the “deli.-ted" friend
`asking whether the user should also be deleted from the
`friend's list. When the friend answers in the aflirmative, 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 2-15 awaits the
`reception, at step 325. of a user-initiated signal indicating a
`response. Thereafter, at step 330, the scnder24[l is activated.
`at step 330, to transniit the response to the system controller
`lltt.
`the information received by the
`When, at step 335,
`receiver 245 includes at 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
`
`10
`
`35
`
`40
`
`5t]
`
`55
`
`Etlt
`
`65
`
`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
`rnatching alias is retrieved from the list and stored, at step
`355, in the message memory 225. Otherwise, the message
`inforntution itself is stored in the message memory 225, at
`step 350. ‘l'hcrcal'1er, the message can be presented to the
`user in a conventional manner.
`FIG. 5 is a llowchttrt illustrating an operation of the sender
`2.40 according to the present invention. At step -105, a signal
`is received from the controls 215. When, at step 410, the
`signal includes a DF or DM code, indicating that the user
`wants to delete a friend or message entry identified lriy the
`received user-initiated signal, the database 230 is referenced,
`at step 415,
`to recover the selected frienrl or message
`information and the alias associated therewith. The sender
`240 then provides, at step 420, the appropriate DF or DM
`code to the transceiver 205 along with enough informatiort
`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 the transceiver 205 with the DF or DM code to
`assist
`the controller 110 in locating the correct cntry. As
`mentioned above, the controlle-r 110, in response to rcceiv-
`ing the code and related information. transmits program-
`ming inforntation to the PMU 105 for updating the database
`230.
`
`includes an
`When, at step 425. the user-initiated signal
`AM or AF code, indicating that the user desires to add an
`additional message or friend to the database 230. the sender
`241} fttrthcr dcterrnincs, at step 430, whether the signal
`references a previously received message. When the user-
`initiztted signal does not rc.fe.re.nce 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 transceive r 205. When the signal
`references a previously received message, indicating that the
`message or the message originator is to he added to the
`database 230, suhicieot 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
`A17 or AM code, at step 440.
`At step 445, reception of a signal including at forward
`code indicates that a previously received message is to be
`forwarded to another rccipicnt. When, at step 450,
`the
`intended recipient is a frienfil, i.c., when the intended recipi-
`ent is included in the friend list, the forward code, the. friend
`alias, and the message number of the rncssagc to be for-
`warded arc 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 ntlrnhcr. 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 24!] 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.
`Tliereafler, at step 475, the message code, the friend alias or
`recipient address, and the message information or message
`alias are provided to the tra nscciver 205.
`Although the PMU [05 is described as transmitting one
`friend alias or one message alias to the system controller
`U0, it will be appreciated that more than one alias can be
`transmitted when the user so indicates. When, for instance,
`
`5
`
`.10
`
`-
`
`40
`
`5U
`
`55
`
`till
`
`55
`
`6
`it 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, D17, and DM
`codes and information could be automatically provided to
`the controller 110 to update the lists stored thereby.
`l’l(i.':i. 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 frit:-rtd to the
`database 230 (FIG. 2). The information could include the AF
`codc followed lay the friend designation, e.g., name, and the
`friend adclrcss. 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 prcvious message
`could simply be appended to the Al: code, in which cast: the
`controller Ill} 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 Ill] 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 he appreciated that
`a unique “add”
`programming code could bc transmitter].
`In FIG. 3, the PMU 105 requests the deletion of a friend
`from its database 230 by sending tho DF code followed by
`the entry identification irtformation,which could include the
`friend alias‘ anrlfor 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. ID and 11 show examples ofmessitgc transmissions
`from the PMU 105. In FIG. 10, the PMU 105 transmits a
`frequently transmitted nlcssage to a friend by sending the
`message code, the friend alias. and the message alias. Thu:
`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 it previously received message to a
`friend by
`transmitting the forward code.
`the friend alias, and the
`nurnbc-r 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 the message
`number. The ntessage 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 PM U 105
`can be included in the signal it" necessary. For instance, the
`PMU address could be sent
`to identify the PMU 105.
`Alternatively. prior art methods. such as transmitting on .1
`given frequency or at a given time could be used. It will be
`further appreciated that canned messages can he added and
`
`13
`
`13
`
`

`
`5,850,594
`
`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 lilteljhood of crowding the channel is
`minimized, rendering message delivery delays less likely.
`Use of thc aliases by the PMU 105 is aim convenient for
`the user because the user does not have to memorim lengthy
`addresses of friends or enter large amounts of information
`every time a message is to he sent. For instance, the user
`only has to memorize a fricrtd’s name, c.g., Lou, rather than
`the t'ricnrl‘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 pt‘-rsonal address book to recover a
`lengthy attdress, thereby saving time. Also, the likelihood of
`user error in typing lengthy addresses is minirnized 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 El
`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 52!) to a telephone network, such as the
`public switched telephone network (l’S'l'N]_. for receiving
`message infomlation from message originators via tele-
`phones and modems. A stlbscrihcr database 530 is coupled
`to the CPU 515 for storing subscriber infonnation, such as
`addresses of devices that suliscribe 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 ill] also includes :1 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, Di’. and DM codes. A router 5-10 included in the
`controller 110 transmits messages within the communication
`system 100, and a rcconciler 545 updates friend and message
`lists stored by the controller Ill] and the PMUs within the
`communication system 100. Preferably, the router 540 and
`the reconcilcr 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
`rcconciler 545 can be implemented as hardware capable of
`performing equivalent opcrat ions.
`1-10. 13 is a tlowchart of an operation performed by the
`CPU 515, which, at step 555, receives information from the
`nansceiver 505. When, at step 560. the information includes
`an AP code or an AM code, indicating that the user ofa 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 appendcd to the AM orAF 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
`
`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 DP code is
`deleted from the PMU’s list in the subscriber database 530.
`at step 572. Once the CPU 5.15 has deleted information from
`or added information to the l’MU’s friend or canned mes-
`sage List maintained locally by the controller 110, at stops
`564, 572, the CPU 5.15 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 informati