CA1278345C - Paging receivers - Google Patents
Paging receiversInfo
- Publication number
- CA1278345C CA1278345C CA000476276A CA476276A CA1278345C CA 1278345 C CA1278345 C CA 1278345C CA 000476276 A CA000476276 A CA 000476276A CA 476276 A CA476276 A CA 476276A CA 1278345 C CA1278345 C CA 1278345C
- Authority
- CA
- Canada
- Prior art keywords
- message
- individual
- paging
- common
- paging number
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/02—Terminal devices
- H04W88/022—Selective call receivers
- H04W88/023—Selective call receivers with message or information receiving capability
-
- G—PHYSICS
- G08—SIGNALLING
- G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
- G08B3/00—Audible signalling systems; Audible personal calling systems
- G08B3/10—Audible signalling systems; Audible personal calling systems using electric transmission; using electromagnetic transmission
- G08B3/1008—Personal calling arrangements or devices, i.e. paging systems
- G08B3/1016—Personal calling arrangements or devices, i.e. paging systems using wireless transmission
-
- G—PHYSICS
- G08—SIGNALLING
- G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
- G08B3/00—Audible signalling systems; Audible personal calling systems
- G08B3/10—Audible signalling systems; Audible personal calling systems using electric transmission; using electromagnetic transmission
- G08B3/1008—Personal calling arrangements or devices, i.e. paging systems
- G08B3/1016—Personal calling arrangements or devices, i.e. paging systems using wireless transmission
- G08B3/1025—Paging receivers with audible signalling details
- G08B3/105—Paging receivers with audible signalling details with call or message storage means
-
- G—PHYSICS
- G08—SIGNALLING
- G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
- G08B3/00—Audible signalling systems; Audible personal calling systems
- G08B3/10—Audible signalling systems; Audible personal calling systems using electric transmission; using electromagnetic transmission
- G08B3/1008—Personal calling arrangements or devices, i.e. paging systems
- G08B3/1016—Personal calling arrangements or devices, i.e. paging systems using wireless transmission
- G08B3/1091—Group calling
-
- G—PHYSICS
- G08—SIGNALLING
- G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
- G08B5/00—Visible signalling systems, e.g. personal calling systems, remote indication of seats occupied
- G08B5/22—Visible signalling systems, e.g. personal calling systems, remote indication of seats occupied using electric transmission; using electromagnetic transmission
- G08B5/222—Personal calling arrangements or devices, i.e. paging systems
- G08B5/223—Personal calling arrangements or devices, i.e. paging systems using wireless transmission
- G08B5/224—Paging receivers with visible signalling details
- G08B5/227—Paging receivers with visible signalling details with call or message storage means
Abstract
Abstract of the Disclosure In a paging receiver with an individual paging number and at least one common paging number, there is provided memory means including individual memory means including individual memory areas capable of storing at least one message signal following the individual number and specific memory areas storing message signals following the common paging number. The receiver can protect individual address information and can efficiently utilize the memory areas even when the user does not use all common addresses.
Description
1 ~ 7 ~
Specification Title of the Invention Paging Receivers Background of the Invention This invention relates to a paging receiver and more particularly a paging receiver having an individual paging number and at least one common paging number.
In advanced modern information communities importance of information has been increased drastically.
As the amounts of information increase, many types of information receivers for reception of valuable information have been developed, including a receiver capable of receiving only paging numbers or signals, a receiver capable of also receiving a series of messages constituted by digits and letters, a receiver having multiaddresses, to improve receiving performanceO
The addresses of the multiaddress information receivers can be classified into (a) addresses corresponding to conventional paging services (hereinafter termed individual addresses) and (b) common addresses corresponding to information services (hereinafter termed com~on addresses).
Included in types of information that can be received by using the individual addresses (hereinafter termed individual address information) are addresses and telephone numbers of customers or users which should be 33~5 confirmed at the time of receiving, and which should therefore be stored in memory means, although the frequency of receiving the addresses and telephone numbers is relatively small. On the other hand, included in types of information that can be received by using the common addresses (hereinafter termed com-mon address information) are stock price information, merchan-dise trading information, or the like information. Since these types of information change from time to time, old information is of little value. Also, these types of information are fre-quently received at a rate of a predetermined unit time.
However, where the individual address information andthe common address information are processed with conventional information receivers having memory areas inadequate for respec-tive addresses, protection of the individual address information becomes impossible.
More particularly, the individual address information, like the common address information, is stored in a memory area.
Accordingly, an accumulation of the frequently received common address information expels the individual address information from the memory area of a limited capacity. This means that the memory area has no margin for the individual address infor-mation, thus raising a serious problem for the protection of important information.
In other words, the memory area of the limited capa-city can not be used efficiently for the individual address information of great value.
~'7~ ~ ~ S
As described above, a multiaddress inforrnation receiver has the problem of how to store information in respective add-resses.
Summary o~ the Invention It is an object of this invention to provide a paging receiver capable of protecting an individual address information.
Another object of this invention is to provide a novel paging receiver capable of storing individual information and co~non address information in adequate memory areas and capable 1~ Of efficiently utilizing the memory areas even when the user does not use all common addresses.
According to one aspect, the invention provides a pag-ing receiver with an individual paging number and at least one common paging number wherein said common paging number is received more frequently than said individual paging number, comprising:
memory means including an individual memory area for storing at least one message signal following said individual paging number, and a specific memory area for selectively storing one of a message signal following said common paging number and a message signal following said individual paging number, whereby messages stored in said individual memory areas are not affected by messages stored in said specific memory areas.
According to another aspect, the invention provides a paging receiver having an individual paging number and at least one common paging number, said receiver comprising: first memory means including an individual memory area for storing at least one ~ 7~5 711~0~32 message signal following said individual paging number, and a specific memory area for selectively storing one of a message sig-nal following said common paging number and a mes~age siynal following said individual paging number; second memory means for storing information which indicates whether or not said receiver is set to receive a message signal following said common paging number; and control means responsi.ve to the content of said second memory means ~or making said specific memory area store a message signal following said individual paging number when said receiver is not set to receive a message signal following said common paging number and for makin~ said specific memory area store a message signal following said common paging number when said receiver is set to receive the message signal Eollowing said com-mon paging number.
The invention will now be described in greater detail with reference to the accompanying drawings, in which:
Figs. la to lc are diagrams showing one example of the receiver signals utilized in this invention;
Fig. 2 is a block diagram showing one embodiment of the ~0 display paging receiver in accordance with this invention;
Fig. 3 is a block diagram showing the message proces-sing unit employed in the embodiment shown in Fig. 2;
Fig. 4 is a block diagram showing one example of a pag-ing signal detecting circuit utilized in this invention;
Fig. 5 is a detailed block diagram showing one chip CPN shown in Fig. 3;
~7~3~5 7ll80-32 Figs. 6a to 6~ show one example of registers and memory areas utilized for message storing, and Figs. 7 to 10 are flow charts for explaining the oper-ation of this invention.
To facilitate understanding of the principle of -4a-. ~, ~7~5 this invention, one example of the received signals will first be described with reference to Figs. la, lb and lc.
In Fig. la, F designates a frame synchronizing signal, A an address signal, M a message signal and E an end signal. If necessary, a plurality of message signals M are used depending upon the length of a message.
Fig. lb shows a signal format wherein a signal comprising BC~ (Bose-Chaudhuri-Hocquenghem) ending at 31st bit added with one parity bit at 32nd bit is used as the address signal or the message signal. This signal is made up of a 21-bit in~ormation area IA, 10-bit check area and l-bit even parity bit EP, thus constituting one word with 32 bits. The information area utilizes its most significant bit (MSB~ as an identification bit~ and when its logic level is "0" this signal is processed as an address information signal, whereas when its logic level is "1" this signa~ is processed as a message information signal. Remaining 20 bits are used as the address information or message information.
Fig. lc shows a format of the message information of a message signal received after reception of an address signal. In Fig. lc, the M~B (the second bit in the information area) is used as a processing bit and when its logic level is "O",'remaining 19 bits are processed as message processing information whereas when its logic level is "1l, the remaining 19 bits are processed as message information. Regarding a succeeding message ~'îJ8;~
signal receiver after reception of a preceeding message signal, 20 bits except the identification bit of -the informa-tion area are processed as the message informationO
Referring to Fig. 2, a display paging receiver embody-ing this invention comprises an antenna AN, a receiving unit REC
for demodulating a radio signal received by the antenna ANl, a waveform shaper WS for shaping the waveform of the output of the receiving unit REC, an address decoder ADR, a memory MEM such as P-ROM fox storing a plurality of paging numbers, a message data processing unit MDI, a buffer register BUF inputted with -the output of the ADR, a loudspeaker SP connected on the output side of the BUF, a display DP for displaying the output of the unit ~DI, a clock pulse generating crystal oscillator XL for generat-ing a timing clock pulse applied to the ADR, a switch SWo connected to the ADR, the switch SWo being operated to send, via the ADR, variation information or state information to the unit MDI for effecting stopping of alert or the like and switches SWl to SW3 connected to the unit MDI and used for operating the information receiver.
The display paging receiver shown in Fig. 2 operates as follows:
The radio signal received by the antenna AN is demo-dulated by the unit REC and the waveform of the demodulated sig-nal is shaped by the shaper WS and then converted into a digital signal by the ADR.
:. ~
~ 5 711~0 32 Then, an address signal e read out from the memory MEM
storing a plurality of paging numbers is applied to the ADR which compares an input signal a from the shaper WS with the signal e bit by bit. When coincidence of the paging numbers is confirmed, the ADR applies a starting signal b to the unit MDI. This unit MDI performs reception and demodulation of the message signal M
(shown in Fig. l) in accordance with the starting signal b, and when it detects an end signal or stop signal E shown in Fig. l indicative oE the end of the message, it sends the signal b to l~ the ADR. In response to this signal b, the ADR sends an alert signal d to the BUF to drive the loudspeaker SP, thereby inform~
ing the user of the receiver that it is called. The unit MDI
stores in its internal RAM, not shown, the decoded signal of the message signal M and sends a signal c to the display DP to pro-vide visual information.
Fig. 3 shows the detailed construction of the unit MDI
shown in Fig. 2, which comprises a one-chip CPU supplied with signal _ from the ADR shown in Fig. 2 and information from switches SWl to SW3, and a random access memory RAMl which exchanges a signal bl between it and the one-chip CPU. The memory RAMl cor-responds to first memory means including individual memory areas storing at least one message signal following individual paging numbers and specific areasstoring message signals following a common paging number.
The message data processing unit MDI also includes an LCD (liquid crystal display) power driver DV
supplied with a signal b2, a diode D, a capacitor C and a source VDD which are connected as shown.
Fig. 4 shows details of the address detection circuit (paging signal detection circuit) in the ADR shown in Fig. 2, for a case wherein the number oE addresses is four.
The address detection circuit shown in Fig. 4 comprises Exclusive NOR gates EX.MORl to EX.NOR4 respectively inputted with the address data signal e from the memory MEM shown in Fig. 2 and input data a, counters CNTl to CNT4 respectively inputted with the output signals of the Exclusive NOR gates EX.NORl to EX.NOR4 and a clock pules CK and are cleared at a rate of 32 bits by a signal supplied to a terminal R, an OR gate OR
inputted with the outputs of the counters CNTl to CNT4, and a converting circuit CONV inputted with the outputs of the counters CNTl to CNT4 for converting the outputs into two bits tIl, I2). In Fig. 4, e(A), e S ~ ~ ~S
~` e(R), e(C) and e(D) ~e~n~s address data siynals inputted to the gates EX.NORl to EX.~OR4, respectively.
In the circuit shown in Fig. 4, the input data a and the address data e from the memory MEM are compared by -the gates EX.NORl to EX.NOR4 and the counters CNTl to CNT4 bit by bit. Although the counters are cleared at the rate of 32 bits by a signal applied to terminal R, 7~
when more than 29 bits coincide with each other before, they are cleared, the gate OR outputs a signal DET.
Since the output signals of the counters CMTl to CNT4 are supplied to the input terminals of -the gate OR, so long as there is a counter output signal DET, the gate OR delivers out this signal. In the embodimen-t shown in Fig. 4 wherein the number of the addresses is four, the converter circuit CONV converts the address into received address information (Il, I2) of two bits.
Fig. 5 is a block diagram showing the detailed construction of the one-chip CPN shown in Fig. 3, which comprises input ports IPl, IP2 and IP3 respectively inputted with the outputs of switches SW3, SW2 and SWl, and input ports IP4, IP5, IP6, IP7 and IP8 respectively inputted with the signal b from the address decoder ADR shown in Fig. 2 including data (received address information~) I2 and Il representing the address, a timing frequency fT, a clock pulse CL
corresponding to the transmission speed, and a message signal D. Denoted by Pl and OP2 are output ports which send to the address decoder ADR shown in Fig. 2 a signal ME showing that the message has ended and an alert control signal AC, and denoted by OP3, OP4 and OP5 are output ports sending to the random access memory RAMl control signals CE, A/D and R/W. Denoted by OP6 and OP7 are output ports sending to the LCD driver DV
shown in Fig. 3 control signals CS and C/D. Denoted by INTP is an interruption port inputted with the signal DET indica-tive of the address coincidence in the signal b from the address decoder ADR shown in Fig. 2 and an access signal R from switch SWl, etc. Denoted by IF is a serial interface inputted with an input signal SI from the memory RAMl shown in Fig. 3 for sending an output signal SO and a system clock signal SCK to the LCD
driver DV shown in Fig. 3, and denoted by DB is a data bus.
There are also provided a program counter PRO.CNT
designating the con~ents of address, a program memory PRO.MEM
storing an instruction sequence to be executed and accessed by the content of an address designated by the program counter PRO.CNT, an arithmetic and logic unit ALL executing such various operations as an arithmetic operation, logic operation, or the like, an instruction decoder INS.DR which decodes information from the program memory PRO.MEM for supplying a control signal corresponding to the instruction to various parts of the circuit, and a random access memory RAM2 utilized to store various data, subroutines, program count at the time of interruption, and retreat of a program status. The random access memory RAM2 ~0 corresponds to first memory means constituted by individual memory areas storing at least one message signal following the individual paging numbers and memory areas storing message signals following a common paging signal. Denoted by ACC is an accumu-lator utilized to transmit and ~7~
receive data between the random access memory RAM2 and various ports. Denoted by CKG is a system clock generating circuit generating a clock pulse that determlnes generating a clock pulse that determines an instruction execution cycle time.
The one chip CPU and the address decoder DR shown in Fig. 2 exchange therebetween data (received address information) Il, I2 representing the address, a clock pulse CL corresponding to the transmisson speed, the timing frequency fT, the signal DET indicative of the address coincidence, the access signal R from switches SW1 to SW3 the message signal D, the signal ME
informing the address decoder ADR of the fact that the message has ended, and the alert control signal AC.
Furthermore, the one-chip CPN and the memory RAMl constituting the memory means shown in Fig~ 3 exchange therebetween the system clock signal SCK, output signal SO, input signal ST and control signals CE, A~D and R~.
Furthermore, the one-chip CPU and the LCD driver DV shown in Fig. 3 exchange ~ he~m~e-the system clock pulse SCK, the output signal SO and the control signals CS and C~.
Figs. 6a through 6~ show examples of the registers and memory areas utilized for the message storing processings.
The registers and memory areas will be described below.
Fig. 6a shows one example of the construction of ~'7~
the memory area in which areas Ml to Mn store message file numbers Fj corresponding to individual address information or the common address information and its individual addreses show the present state (new or old) of the information. The initial values of the data in the areas Ml to Mn are all "O" meaning that there is no message stored. In this case, the data of Mj is designated by (Mj). By using this designation, (~3) is F2, for example.
Figs. 6b and 6c show examples of a file area and a sector area respectively in which flle Fl to Fm are assigned to respective corresponding message file numbers. In each file, sector names constituting message information are sequentially stored. Like ~j shown in Fig. 6a, the date stored in the file Fj shown in Fig. 6b is indicated by ~ (Fj). More particularly, in the example shown in Fig. 6b, file Fl is constituted by three sectors SO, Sl and S3 in which message information is stored.
Sectors So to Sk are also assigned corresponding to respective sector numbers and the message information is stored in these sector areas. The data in sector Sk is indicated by (Sk) and in Fig. 6c of this embodiment, (So) c~ ~ c~s shows that 6 ~o~xJtJrs "PLEASE" are stored. The message information is sequentially stored in the sectors.
Thus, it can be noted that for file Fl the message information is constituted by three sectors SO, Sl and S3 to mean "PLEASE GO TO HOME".
The memory area shown in Fig. 6a, is located in the RAM2 shown in Fig. 5, and the file area shown in Fig. 6b and the sector area shown in Fig. 6c are located in the memory RAMl shown in Fig. 3.
Registors MST~MSTATUCS~, FST(FSTATUCS) and SST(SSTATUCS) shown in Figs. 6d, 6e and 6f respectively will now be described.
Registers FST and SST shown in Figs. 6e and 6f respectively store states of use of the file and the sector, and "0" indicative of out-of-use or "1" indicative of in-use is stored in respective files and sectors.
~e,~s~ S
Accordingly, by using these -~r~ t~, it is possible to know idle (vacant) files and idle sectors. The data of registers FST and SST are represented by FLST(Fj) and SCST~Sk). More particularly, FLST(F3) shows that the data in a bit F3 of the register FST is "0" or "1". In this embodiment "1" is present. Similarly, in this embodiment, SCS T (S2) .
In the case of the register MST (shown in Fig.
6d) that designates the memory area storing the common address information, it is used as a register storing a fixed state of the memory area. In other words, this register is used for storing data as to whether memory area is used for storing the common address information or the individual address information. In this ambodiment, when memory area is used for the common address ~7~
information, the data is "1", used for the individual address information, the data is "0". Each bit of the reyister MST
showing the mode of processiny of the memory area corresponds to each address in one-to-one correspondence relationship~ As a consequence, where there are ~our addresses A, B, C and D of which A is usable as an individual address, B and C are usable as common addresses, but D is not necessary to be used as a com-mon address, it is possible to use the memory areas corresponding to the out-of-use common address for the individual address 1~ information by making "0" the state of a bit of the register MST
shown in Fig. 6d which is in one-to-one correspondence relation-ship with the common address D. The data of this register MST
is represented by MST(Mj). Thus, MST(M3) is "1".
Registers MST, FST and SST shown in Figs. 6d, 6e and 6f are built in the memory RAM2 shown in Fig. 5.
Registers shown in Figs. 6g, 6h, 6i, 6i, 6k and 6 operate as follows. These registers are also built in the memory RAM2 shown in Fig. 5.
A register AD shown in Fig. 6g is adapted to store the ~) received address information (~, I2~ (see Figs. 4 and 5), while a register IFN shown in Fig. 6h is used for storing an idle file number when there is an idle file, and its state is "O" when there is no idle file. A register ISN shown in Fig. 6j is adapted, like the register IFN, to store an idle sector number when there is an idle sector, and its state is "0" when there is no idle sector.
A register SC shown in Fig. 6j is for storing the number of sectors in use in one file, and a register STAD
~s shown in Fig. 6k ~ for storing address number to be stored with message information. A register FI shown in Fig. 6 is used for storing the sector number constituting a file. When storing of the sector numbers of one file completes, the data is sent to the file area of the memory RAM, shown in Fig. 3.
The received signal, various circuits, the construction and function of tne registers constituting the memory means have been described above. The processing of the received signal will now be described with reference to the flow charts shown in Figs. 7 to 10 in which Fig. 7 shows a flow chart showing one example of the processing of the received signal, and Figs. 8 to 10 are detailed flow charts showing steps 13, 22 24 shown in Fig. 7.
In Fig. 7, the receiver is at the initial state waiting for a signal. At step STP-l, when the synchronizing signal is detected the receiver is brought to a state for waiting for the reception of a paging number corresponding to that stored in the memory MEM (see Fig. 2) of the receiver. If the circuit shown in Fig. 4 can not detect the paging number of the receiver which has been stored in the memory MEM (P-ROM) shown in Fig. 2 even after lapse of a predetermined time following the receipt of the synchronizing signal (see STP-2 and STP-3), the program is returned to the initial state.
When the result of judgment of STP-2 is Y~S, the OR
gate circuit OR shown in Fig. 4 detects signal DET to start the one chip CPU shown in Fig. 3 and to convert the received address into two-bit address information (I1, I2) by the conver-ter CONT at STP-4. Consequently, the received address infor-mation ~Il, I2) and the message signal "D" shown in Fig. 5, that is the received signal which are sent from the address decoder ADR shown in Fig. 2 are supplied to the one-chip CPU to be processed thereby and the result of processing is stored in the memory RAM2 shown in Fig. 5 as shown by steps STP-5 and STP-6.
At step STP-7, the arithmetic and logic unit ALL shown in Fig.
5 checks the identification bit of the received signal to judge whether the received signal is an address signal or a message signal.
When the received signal is an address signal, at step STP-8, a judgment is made as to whether there is a mes-~0 sage signal before the address signal. More particularly, whenthe register SC shown in Fig. 6j is judged and a sector is used as the message information, at step STP-9, and end code is writ-ten into a sector area to ~execute storing, and display of the message information.
Where a sector is not used as a message information, it is judged that there is no message information sent by using ~7~ 5 711~0-32 the paging number of the receiver and the processing returns to the initial state.
Further, at step STP-7, when the received signal is judged as a message signal, at step STP-10, after starting the one chip CPU shown in Fig. 3 a judg~ent is made as to whether the message signal is the first message signal or not. When the re~
sult of judgment is YES t at step STP-ll, a judgment of the state of the processing bit is made. When the state of the processing bit is "0", the received signal is stored in the register MST
shown in Fig. 6d as a message information at step STP-12 at which the message signal is decoded to obtain information which deter-mines whether service of the common paging signal is to be rendered or not.
Although in this embodiment, only the data of register MST was taken as the message processing information, other data reprasenting the value of ~ to be described hereinafter can also be used. Although, in this embodiment, upon completion of the storing, the program is returned to the initial state, if de-sired, information and display of the completion of the setting ~0 of the register MST may be informed and~displayed. When it is judged that the data is message information, at step STP-13, a new area is set.
The setting of the new area will be described with reference to Fig. 8.
When the data is judged as message information, the received address information (~i~ I2) is read out of the register ~7~
AD sh~wn in Fig. 6g, and the content of the register M~T shown in Fig. 6d, in one-to-one correspondence relationship to the re-ceived address information (Il, I2), is read out at step STP-30.
Based on the content of MST, it is judged whether a new area is to be set for the individual or common address information at step STP-31. More specifically, if MST(Mi)=0, the new area is to be set for the individual address information and the process goes on to step STP-37. If MST(Mi)=l, the new area is to be set for the common address information and step STP-32 follows. At this stage,~ utilized in steps STP-32 and STP-37 will be des-cribed.
Denoted by ~ is the number of sectors that can be used in one file, and ~1 and ~2 are values respectively corresponding to the common address information and the individual address information. For example, where the number of sectors each of which can store 32 characters is 36 and ~1 and ~2 are equally set to 9, it is possible to store messages of at least 4 files. As a result, if three common addresses are used, it is possible to store only one individual address information at the worst. On ~0 the other hand, if ~1 and ~2 are differently set to 6 and 9, respectively, at least two pieces of individual address informa-tion can be stored even if three common addresses are used. By setting the values of ~1 and ~2 in this way, the old individual address information can be recognized. Usually, the individual address information comprises a long message such as ordering an action but the common address information comprises a short mes-7~
sage such as stock prices, so that the above-described performance is considered to be appropriate. The values of ~l and ~2 are selected in a manner as described above.
When the read-out MST content, MST(~i), is decided to be l, i.e., the received information is decided to be information relating to the common address in question, ~ is set to be ~l at step STP-32, and then a file and a section which have been used for that common address are cleared. More specifically, at step STP-33, adjustment is made as to whether file number Fj is stored l~ in a memory area corresponding to the received address informa-tion or not. When the result of judgment is NO, at steps STP-34, STP-35 and STP-36, the old information of the received common address is erased and the contents of registers FST and SST
shown in Figs. 6e and 6f which have been used for the old infor-mation are changed to "0" thereby enabling to use their files and sectors. When the file number Fj is not being stored in a memory area corresponding to the received common address infor-mation, that is, when an initial service is rendered at that common address, at step STP-38, a judgment is made as to whether ~n there is an idle file and an idle sector or not. When the result of judgment is NO, the program returns to the original state in this embodiment. But if desired, it is possible to in form the user that there is not an idle file and an idle sector by alerting or displaying this fact.
When the result of judgment at step STP-31 shows that the data is individual address information, at step STP-37, a ~ ;Cd~ 7 ~ 5 value of ~ is set to be ~2 which is suitable for the individual address information, then the process goes on to step STP-38.
All pieces of initial or first message information after starting the CPU are advanced to step STP-39 to set neces-sary file and sector in a new area. In other words, the data in register FST (shown in Fig. 6e) corresponding to an idle file stored in register IFN shown in Fig. 6h is set to "1". In -the same manner, the data of register SST (shown in Fig. 6e) corres-ponding to an idle sector stored in the register ISN shown in Fig. 6i is set to "l". Thus it is indicated that its file and sector are permittedfor use. Moreover, since only one sector is used, the data of the register SC shown in Fig. 6j is set to "1".
Then, the first address of the sector to be used is set at step STP-40 in which ~ represents the number of characters that can be stored in one sector. For example, in the sector area shown in ~ig. 6c, the number of characters that can be stored in one sector is 6, that is, ~= 6. Suppose now that the idle sector number stored in the register ISN shown in Fig. 6i cor-responds to the value of K; the sector number So becomes "0".
~0 The first address of the sector number So is "0", whereas the last address is "5". Since the sector number Sl is "l", its first address is equal to the next address "6". In this manner, the first address of the used sector is expressed by ~x ISN, thus terminating the setting of the new area.
~7~5 The first message information or succeeding message information whose new area has been set at step STP-13 shown in Fig. 7 is judged as to whether the information has data of one character or not at step STP-14. When the result of judgment is NO, a succeeding message signal is subjected to the same processing to obtain data of more than one character. When the result of judgment at step STP-14 is YES, at steps STP-15, STP-16 and STP-17, the data of one character is stored in an address designated by the register STAD shown ln Fig. 6b and the add-ress designated by the register STAD is set as the next address.After that, at step STP-18, a judgment is made as to whether one sector has been filled or not. When the result of judgment is NO, the program is advanced to step STP-23 where a judgment is made as to whether the processing of the data of the information area has ended or not. When the processing is not terminated, the program is returned to step STP-14 to process the remaining data of the information area. In contrast, when the processing of the data of the information area has completed, the program is advanced to step STP-6 to begin the processing of the next 2~ received signal.
When the result of judgment at step STP-l~ is YES, the sector number stored in the register ISN shown is Fig. 6i is stored in the SC-th address of register FI shown in Fig. 6~
(see step STP-l9) and the number of used sectors is incremented ~ ~7B3~
by one at step STP-20. At the next step STP-21, the number of sectors used in one file is supervised. When the number of sectors used in one file is larger than ~, storing of the message information is interrupted, and the program is advanced to step STP-24. When the number of the used sectors is less than ~, at step STP-22, the idle sector is supervised.
The supervision of the idle sector will be described with reference to Fig. 9.
When it is judged that the number of files in one file is smaller than ~, at step ST~-50, a judgment is made as to whether there is a sector that can be used next. When there is an idle sector, at step STP-51, the sector number of the id]e sector is set in the register ISN shown in Fig. 6i and at step STP-52, the first address number of the idle sector is set, where-as when there is no idle sector, a processing is executed to pre-pa~e an idle sector. In this processing, at steps STP-53, STP-54 and STP-55, judgments are made as to whether the file number Fj is sequentially stored in memory areas Mn through Mi shown in Fig. 6a. When the file number Fj is stored, at steps STP-56 and 57, a judgment is made as to whether the memory area corresponds to an individual address or to a common address. When the memory area corresponds to the individual address, the information stored therein is erased and the register FST shown in Fig. 6e and the register SST shown in Fig. 6f and utilized ~or that information are changed to "0" to render the file and sector useable (see steps STP-58, 59 and 60). -i-~ this manner, an idle sector is prepared, and the program is advanced to succeeding steps STP-50, 51 and 52.
The above description corresponds to the idle sector supervision.
Subsequent to the supervision of the idle sector e~ecuted at step STP-22, the program is advanced to step STP-23 where a judgment is made as to whether the processing of the data of the information area has ended or not. The storing of the inEormation in the sector area and register FI shown in Fig. 6~ is continued by repeating the process described above and is completed when the message information terminates (see STP-3)or when a sector of one file overflows (see step STP-21). Then, at step STP-24, the information is stored in the file area and the memory area.
~0 The storing operation of the information in the file area and the memory area sho-~n in Figs. 6b and 6a will now be described with reference to the flow chart shown in Fig. 10.
The data of a sector number of one file stored in register FI (sho~m in Fig~ 6~) in the random access memory RAM2 (sho~n in Fig. 5) contained in the one chip CPU
shown in Fig. 3 is sent to file F(IFN) shown by the ~;~ 7~
register IFN (see Fig. 6b) of the RA~l shown in Fig. 3, so as to store the sector number of one file in the file F(IFN), at step STP-70. Then, at step STP-71, the received address information (Il, I2) is read out from the register AD shown in Fig. 6g, while at the same time the content of the corresponding register MST shown in Fig. 6d is read out. Then at step STP-72, a judgment is made as to whether the read out information is stored in a memory area corresponding to the individual address information or the common address information. In the case of the common address information, at step SEP-73, a number called file F(IFM) is stored in a memory area corresponding to the received common adress. On the other hand, in the case of the individual address, the received address information is shifted within a memory area (shown in Fig. 6a) storing the individual address information to render idle (empty) the memory area Ml at steps 74 to 82. More particularly, at step STP-74, i is set to n.
Then, at steps STP-75 to 77, the number Mi of the memory area (shown in Fig. 6a) storing the individual address information is searched starting from Mn 1 At s-tep STP-78, the value of i is changed to x, thus preserving Mi storing the individual address information.
At steps STP-79 and 80, the individual address information is stored by using the new variable x, and the ~e <~
number Mx of the memory a~ which is larger than Mi is searched. Then, at step STP-81, the individual address ~ 7~ 71]80-32 information (Mi) is changed to Mx. The change of the individual mation from Mn_l to Ml is executed under the judgment executed at step STP-82. Upon completion of this change, the memory area Ml shown in Fig. 6a becomes idle, so that a number termed file F(IFN) is stored in the memory area Ml at s-tep STP-83, thus completing the storing of the number in the file area shown in Fig. 6b and the memory area shown in Fig. 6a.
Then, at step STP-25, the alerting and displaying are started and the program is returned to the initial state. The alerting is made by controlling the address decoder AD~ shown in Fig. 2 with the alert control signal AC shown in Fig. 5, and then driving the loudspeaker SP via the huffer register BUF. A display is made on the display DP shown in Fig. 2 by controlling the LCD driver DV shown in Fig~ 3 with the system block signal SCK and output signal "SO" from the serial interface IF shown in Fig. 5, and the control signals (CS, C/D) from the output ports OP7 and OP~3.
Although the invention has been described with refer-ence to a case wherein -the setting of MSTATUCS is made by a software message information processing of a received signal, it ~0 should be understood that the invention is not limited to this example and that any suitable hardware can be used. For example, for the one chip CPN shown in Fig. 3, may be provided input and output ports corresponding to respective receiving addresses, and .
. .
the setting of MSTATNCS can be made by making respective input terminals to a high or low level.
As described above, according to this invention, RAM (shown in Fig. 5) of the one chip CPU shown in Fig. 3 is provided with a register AD (shown in Fig. 6g) capable of storing addresses and a register MST (Shown in Fig. 6d) designating the memory area of common address information so as to ena~le to store the individual address information and the common address information in memory areas according to the features of the address information. Accordingly, there is a merit that even when the user does not use all common addresses, the memory areas can be efficiently utilized.
As described above, according to this invention, with a simple construction, it is possible to store the individual address information and the common address information in memory areas commensurate with their features in accordance with the information from a register and to efficiently utilize the memory areas even when the user does not utiliæe all common addresses.
Furthermore, the individual address information can be protected by providing memory areas corresponding to respective addresses. In an information receiver having a plurality of common addresses and memory areas corresponding to respective common addreses, where the user does not require specific common address information, efficient utilization of the memory areas can be realized 78~4~
by using a memory area capable of storing a particular common address as a memory area capable of stor ing the individual address information~
Specification Title of the Invention Paging Receivers Background of the Invention This invention relates to a paging receiver and more particularly a paging receiver having an individual paging number and at least one common paging number.
In advanced modern information communities importance of information has been increased drastically.
As the amounts of information increase, many types of information receivers for reception of valuable information have been developed, including a receiver capable of receiving only paging numbers or signals, a receiver capable of also receiving a series of messages constituted by digits and letters, a receiver having multiaddresses, to improve receiving performanceO
The addresses of the multiaddress information receivers can be classified into (a) addresses corresponding to conventional paging services (hereinafter termed individual addresses) and (b) common addresses corresponding to information services (hereinafter termed com~on addresses).
Included in types of information that can be received by using the individual addresses (hereinafter termed individual address information) are addresses and telephone numbers of customers or users which should be 33~5 confirmed at the time of receiving, and which should therefore be stored in memory means, although the frequency of receiving the addresses and telephone numbers is relatively small. On the other hand, included in types of information that can be received by using the common addresses (hereinafter termed com-mon address information) are stock price information, merchan-dise trading information, or the like information. Since these types of information change from time to time, old information is of little value. Also, these types of information are fre-quently received at a rate of a predetermined unit time.
However, where the individual address information andthe common address information are processed with conventional information receivers having memory areas inadequate for respec-tive addresses, protection of the individual address information becomes impossible.
More particularly, the individual address information, like the common address information, is stored in a memory area.
Accordingly, an accumulation of the frequently received common address information expels the individual address information from the memory area of a limited capacity. This means that the memory area has no margin for the individual address infor-mation, thus raising a serious problem for the protection of important information.
In other words, the memory area of the limited capa-city can not be used efficiently for the individual address information of great value.
~'7~ ~ ~ S
As described above, a multiaddress inforrnation receiver has the problem of how to store information in respective add-resses.
Summary o~ the Invention It is an object of this invention to provide a paging receiver capable of protecting an individual address information.
Another object of this invention is to provide a novel paging receiver capable of storing individual information and co~non address information in adequate memory areas and capable 1~ Of efficiently utilizing the memory areas even when the user does not use all common addresses.
According to one aspect, the invention provides a pag-ing receiver with an individual paging number and at least one common paging number wherein said common paging number is received more frequently than said individual paging number, comprising:
memory means including an individual memory area for storing at least one message signal following said individual paging number, and a specific memory area for selectively storing one of a message signal following said common paging number and a message signal following said individual paging number, whereby messages stored in said individual memory areas are not affected by messages stored in said specific memory areas.
According to another aspect, the invention provides a paging receiver having an individual paging number and at least one common paging number, said receiver comprising: first memory means including an individual memory area for storing at least one ~ 7~5 711~0~32 message signal following said individual paging number, and a specific memory area for selectively storing one of a message sig-nal following said common paging number and a mes~age siynal following said individual paging number; second memory means for storing information which indicates whether or not said receiver is set to receive a message signal following said common paging number; and control means responsi.ve to the content of said second memory means ~or making said specific memory area store a message signal following said individual paging number when said receiver is not set to receive a message signal following said common paging number and for makin~ said specific memory area store a message signal following said common paging number when said receiver is set to receive the message signal Eollowing said com-mon paging number.
The invention will now be described in greater detail with reference to the accompanying drawings, in which:
Figs. la to lc are diagrams showing one example of the receiver signals utilized in this invention;
Fig. 2 is a block diagram showing one embodiment of the ~0 display paging receiver in accordance with this invention;
Fig. 3 is a block diagram showing the message proces-sing unit employed in the embodiment shown in Fig. 2;
Fig. 4 is a block diagram showing one example of a pag-ing signal detecting circuit utilized in this invention;
Fig. 5 is a detailed block diagram showing one chip CPN shown in Fig. 3;
~7~3~5 7ll80-32 Figs. 6a to 6~ show one example of registers and memory areas utilized for message storing, and Figs. 7 to 10 are flow charts for explaining the oper-ation of this invention.
To facilitate understanding of the principle of -4a-. ~, ~7~5 this invention, one example of the received signals will first be described with reference to Figs. la, lb and lc.
In Fig. la, F designates a frame synchronizing signal, A an address signal, M a message signal and E an end signal. If necessary, a plurality of message signals M are used depending upon the length of a message.
Fig. lb shows a signal format wherein a signal comprising BC~ (Bose-Chaudhuri-Hocquenghem) ending at 31st bit added with one parity bit at 32nd bit is used as the address signal or the message signal. This signal is made up of a 21-bit in~ormation area IA, 10-bit check area and l-bit even parity bit EP, thus constituting one word with 32 bits. The information area utilizes its most significant bit (MSB~ as an identification bit~ and when its logic level is "0" this signal is processed as an address information signal, whereas when its logic level is "1" this signa~ is processed as a message information signal. Remaining 20 bits are used as the address information or message information.
Fig. lc shows a format of the message information of a message signal received after reception of an address signal. In Fig. lc, the M~B (the second bit in the information area) is used as a processing bit and when its logic level is "O",'remaining 19 bits are processed as message processing information whereas when its logic level is "1l, the remaining 19 bits are processed as message information. Regarding a succeeding message ~'îJ8;~
signal receiver after reception of a preceeding message signal, 20 bits except the identification bit of -the informa-tion area are processed as the message informationO
Referring to Fig. 2, a display paging receiver embody-ing this invention comprises an antenna AN, a receiving unit REC
for demodulating a radio signal received by the antenna ANl, a waveform shaper WS for shaping the waveform of the output of the receiving unit REC, an address decoder ADR, a memory MEM such as P-ROM fox storing a plurality of paging numbers, a message data processing unit MDI, a buffer register BUF inputted with -the output of the ADR, a loudspeaker SP connected on the output side of the BUF, a display DP for displaying the output of the unit ~DI, a clock pulse generating crystal oscillator XL for generat-ing a timing clock pulse applied to the ADR, a switch SWo connected to the ADR, the switch SWo being operated to send, via the ADR, variation information or state information to the unit MDI for effecting stopping of alert or the like and switches SWl to SW3 connected to the unit MDI and used for operating the information receiver.
The display paging receiver shown in Fig. 2 operates as follows:
The radio signal received by the antenna AN is demo-dulated by the unit REC and the waveform of the demodulated sig-nal is shaped by the shaper WS and then converted into a digital signal by the ADR.
:. ~
~ 5 711~0 32 Then, an address signal e read out from the memory MEM
storing a plurality of paging numbers is applied to the ADR which compares an input signal a from the shaper WS with the signal e bit by bit. When coincidence of the paging numbers is confirmed, the ADR applies a starting signal b to the unit MDI. This unit MDI performs reception and demodulation of the message signal M
(shown in Fig. l) in accordance with the starting signal b, and when it detects an end signal or stop signal E shown in Fig. l indicative oE the end of the message, it sends the signal b to l~ the ADR. In response to this signal b, the ADR sends an alert signal d to the BUF to drive the loudspeaker SP, thereby inform~
ing the user of the receiver that it is called. The unit MDI
stores in its internal RAM, not shown, the decoded signal of the message signal M and sends a signal c to the display DP to pro-vide visual information.
Fig. 3 shows the detailed construction of the unit MDI
shown in Fig. 2, which comprises a one-chip CPU supplied with signal _ from the ADR shown in Fig. 2 and information from switches SWl to SW3, and a random access memory RAMl which exchanges a signal bl between it and the one-chip CPU. The memory RAMl cor-responds to first memory means including individual memory areas storing at least one message signal following individual paging numbers and specific areasstoring message signals following a common paging number.
The message data processing unit MDI also includes an LCD (liquid crystal display) power driver DV
supplied with a signal b2, a diode D, a capacitor C and a source VDD which are connected as shown.
Fig. 4 shows details of the address detection circuit (paging signal detection circuit) in the ADR shown in Fig. 2, for a case wherein the number oE addresses is four.
The address detection circuit shown in Fig. 4 comprises Exclusive NOR gates EX.MORl to EX.NOR4 respectively inputted with the address data signal e from the memory MEM shown in Fig. 2 and input data a, counters CNTl to CNT4 respectively inputted with the output signals of the Exclusive NOR gates EX.NORl to EX.NOR4 and a clock pules CK and are cleared at a rate of 32 bits by a signal supplied to a terminal R, an OR gate OR
inputted with the outputs of the counters CNTl to CNT4, and a converting circuit CONV inputted with the outputs of the counters CNTl to CNT4 for converting the outputs into two bits tIl, I2). In Fig. 4, e(A), e S ~ ~ ~S
~` e(R), e(C) and e(D) ~e~n~s address data siynals inputted to the gates EX.NORl to EX.~OR4, respectively.
In the circuit shown in Fig. 4, the input data a and the address data e from the memory MEM are compared by -the gates EX.NORl to EX.NOR4 and the counters CNTl to CNT4 bit by bit. Although the counters are cleared at the rate of 32 bits by a signal applied to terminal R, 7~
when more than 29 bits coincide with each other before, they are cleared, the gate OR outputs a signal DET.
Since the output signals of the counters CMTl to CNT4 are supplied to the input terminals of -the gate OR, so long as there is a counter output signal DET, the gate OR delivers out this signal. In the embodimen-t shown in Fig. 4 wherein the number of the addresses is four, the converter circuit CONV converts the address into received address information (Il, I2) of two bits.
Fig. 5 is a block diagram showing the detailed construction of the one-chip CPN shown in Fig. 3, which comprises input ports IPl, IP2 and IP3 respectively inputted with the outputs of switches SW3, SW2 and SWl, and input ports IP4, IP5, IP6, IP7 and IP8 respectively inputted with the signal b from the address decoder ADR shown in Fig. 2 including data (received address information~) I2 and Il representing the address, a timing frequency fT, a clock pulse CL
corresponding to the transmission speed, and a message signal D. Denoted by Pl and OP2 are output ports which send to the address decoder ADR shown in Fig. 2 a signal ME showing that the message has ended and an alert control signal AC, and denoted by OP3, OP4 and OP5 are output ports sending to the random access memory RAMl control signals CE, A/D and R/W. Denoted by OP6 and OP7 are output ports sending to the LCD driver DV
shown in Fig. 3 control signals CS and C/D. Denoted by INTP is an interruption port inputted with the signal DET indica-tive of the address coincidence in the signal b from the address decoder ADR shown in Fig. 2 and an access signal R from switch SWl, etc. Denoted by IF is a serial interface inputted with an input signal SI from the memory RAMl shown in Fig. 3 for sending an output signal SO and a system clock signal SCK to the LCD
driver DV shown in Fig. 3, and denoted by DB is a data bus.
There are also provided a program counter PRO.CNT
designating the con~ents of address, a program memory PRO.MEM
storing an instruction sequence to be executed and accessed by the content of an address designated by the program counter PRO.CNT, an arithmetic and logic unit ALL executing such various operations as an arithmetic operation, logic operation, or the like, an instruction decoder INS.DR which decodes information from the program memory PRO.MEM for supplying a control signal corresponding to the instruction to various parts of the circuit, and a random access memory RAM2 utilized to store various data, subroutines, program count at the time of interruption, and retreat of a program status. The random access memory RAM2 ~0 corresponds to first memory means constituted by individual memory areas storing at least one message signal following the individual paging numbers and memory areas storing message signals following a common paging signal. Denoted by ACC is an accumu-lator utilized to transmit and ~7~
receive data between the random access memory RAM2 and various ports. Denoted by CKG is a system clock generating circuit generating a clock pulse that determlnes generating a clock pulse that determines an instruction execution cycle time.
The one chip CPU and the address decoder DR shown in Fig. 2 exchange therebetween data (received address information) Il, I2 representing the address, a clock pulse CL corresponding to the transmisson speed, the timing frequency fT, the signal DET indicative of the address coincidence, the access signal R from switches SW1 to SW3 the message signal D, the signal ME
informing the address decoder ADR of the fact that the message has ended, and the alert control signal AC.
Furthermore, the one-chip CPN and the memory RAMl constituting the memory means shown in Fig~ 3 exchange therebetween the system clock signal SCK, output signal SO, input signal ST and control signals CE, A~D and R~.
Furthermore, the one-chip CPU and the LCD driver DV shown in Fig. 3 exchange ~ he~m~e-the system clock pulse SCK, the output signal SO and the control signals CS and C~.
Figs. 6a through 6~ show examples of the registers and memory areas utilized for the message storing processings.
The registers and memory areas will be described below.
Fig. 6a shows one example of the construction of ~'7~
the memory area in which areas Ml to Mn store message file numbers Fj corresponding to individual address information or the common address information and its individual addreses show the present state (new or old) of the information. The initial values of the data in the areas Ml to Mn are all "O" meaning that there is no message stored. In this case, the data of Mj is designated by (Mj). By using this designation, (~3) is F2, for example.
Figs. 6b and 6c show examples of a file area and a sector area respectively in which flle Fl to Fm are assigned to respective corresponding message file numbers. In each file, sector names constituting message information are sequentially stored. Like ~j shown in Fig. 6a, the date stored in the file Fj shown in Fig. 6b is indicated by ~ (Fj). More particularly, in the example shown in Fig. 6b, file Fl is constituted by three sectors SO, Sl and S3 in which message information is stored.
Sectors So to Sk are also assigned corresponding to respective sector numbers and the message information is stored in these sector areas. The data in sector Sk is indicated by (Sk) and in Fig. 6c of this embodiment, (So) c~ ~ c~s shows that 6 ~o~xJtJrs "PLEASE" are stored. The message information is sequentially stored in the sectors.
Thus, it can be noted that for file Fl the message information is constituted by three sectors SO, Sl and S3 to mean "PLEASE GO TO HOME".
The memory area shown in Fig. 6a, is located in the RAM2 shown in Fig. 5, and the file area shown in Fig. 6b and the sector area shown in Fig. 6c are located in the memory RAMl shown in Fig. 3.
Registors MST~MSTATUCS~, FST(FSTATUCS) and SST(SSTATUCS) shown in Figs. 6d, 6e and 6f respectively will now be described.
Registers FST and SST shown in Figs. 6e and 6f respectively store states of use of the file and the sector, and "0" indicative of out-of-use or "1" indicative of in-use is stored in respective files and sectors.
~e,~s~ S
Accordingly, by using these -~r~ t~, it is possible to know idle (vacant) files and idle sectors. The data of registers FST and SST are represented by FLST(Fj) and SCST~Sk). More particularly, FLST(F3) shows that the data in a bit F3 of the register FST is "0" or "1". In this embodiment "1" is present. Similarly, in this embodiment, SCS T (S2) .
In the case of the register MST (shown in Fig.
6d) that designates the memory area storing the common address information, it is used as a register storing a fixed state of the memory area. In other words, this register is used for storing data as to whether memory area is used for storing the common address information or the individual address information. In this ambodiment, when memory area is used for the common address ~7~
information, the data is "1", used for the individual address information, the data is "0". Each bit of the reyister MST
showing the mode of processiny of the memory area corresponds to each address in one-to-one correspondence relationship~ As a consequence, where there are ~our addresses A, B, C and D of which A is usable as an individual address, B and C are usable as common addresses, but D is not necessary to be used as a com-mon address, it is possible to use the memory areas corresponding to the out-of-use common address for the individual address 1~ information by making "0" the state of a bit of the register MST
shown in Fig. 6d which is in one-to-one correspondence relation-ship with the common address D. The data of this register MST
is represented by MST(Mj). Thus, MST(M3) is "1".
Registers MST, FST and SST shown in Figs. 6d, 6e and 6f are built in the memory RAM2 shown in Fig. 5.
Registers shown in Figs. 6g, 6h, 6i, 6i, 6k and 6 operate as follows. These registers are also built in the memory RAM2 shown in Fig. 5.
A register AD shown in Fig. 6g is adapted to store the ~) received address information (~, I2~ (see Figs. 4 and 5), while a register IFN shown in Fig. 6h is used for storing an idle file number when there is an idle file, and its state is "O" when there is no idle file. A register ISN shown in Fig. 6j is adapted, like the register IFN, to store an idle sector number when there is an idle sector, and its state is "0" when there is no idle sector.
A register SC shown in Fig. 6j is for storing the number of sectors in use in one file, and a register STAD
~s shown in Fig. 6k ~ for storing address number to be stored with message information. A register FI shown in Fig. 6 is used for storing the sector number constituting a file. When storing of the sector numbers of one file completes, the data is sent to the file area of the memory RAM, shown in Fig. 3.
The received signal, various circuits, the construction and function of tne registers constituting the memory means have been described above. The processing of the received signal will now be described with reference to the flow charts shown in Figs. 7 to 10 in which Fig. 7 shows a flow chart showing one example of the processing of the received signal, and Figs. 8 to 10 are detailed flow charts showing steps 13, 22 24 shown in Fig. 7.
In Fig. 7, the receiver is at the initial state waiting for a signal. At step STP-l, when the synchronizing signal is detected the receiver is brought to a state for waiting for the reception of a paging number corresponding to that stored in the memory MEM (see Fig. 2) of the receiver. If the circuit shown in Fig. 4 can not detect the paging number of the receiver which has been stored in the memory MEM (P-ROM) shown in Fig. 2 even after lapse of a predetermined time following the receipt of the synchronizing signal (see STP-2 and STP-3), the program is returned to the initial state.
When the result of judgment of STP-2 is Y~S, the OR
gate circuit OR shown in Fig. 4 detects signal DET to start the one chip CPU shown in Fig. 3 and to convert the received address into two-bit address information (I1, I2) by the conver-ter CONT at STP-4. Consequently, the received address infor-mation ~Il, I2) and the message signal "D" shown in Fig. 5, that is the received signal which are sent from the address decoder ADR shown in Fig. 2 are supplied to the one-chip CPU to be processed thereby and the result of processing is stored in the memory RAM2 shown in Fig. 5 as shown by steps STP-5 and STP-6.
At step STP-7, the arithmetic and logic unit ALL shown in Fig.
5 checks the identification bit of the received signal to judge whether the received signal is an address signal or a message signal.
When the received signal is an address signal, at step STP-8, a judgment is made as to whether there is a mes-~0 sage signal before the address signal. More particularly, whenthe register SC shown in Fig. 6j is judged and a sector is used as the message information, at step STP-9, and end code is writ-ten into a sector area to ~execute storing, and display of the message information.
Where a sector is not used as a message information, it is judged that there is no message information sent by using ~7~ 5 711~0-32 the paging number of the receiver and the processing returns to the initial state.
Further, at step STP-7, when the received signal is judged as a message signal, at step STP-10, after starting the one chip CPU shown in Fig. 3 a judg~ent is made as to whether the message signal is the first message signal or not. When the re~
sult of judgment is YES t at step STP-ll, a judgment of the state of the processing bit is made. When the state of the processing bit is "0", the received signal is stored in the register MST
shown in Fig. 6d as a message information at step STP-12 at which the message signal is decoded to obtain information which deter-mines whether service of the common paging signal is to be rendered or not.
Although in this embodiment, only the data of register MST was taken as the message processing information, other data reprasenting the value of ~ to be described hereinafter can also be used. Although, in this embodiment, upon completion of the storing, the program is returned to the initial state, if de-sired, information and display of the completion of the setting ~0 of the register MST may be informed and~displayed. When it is judged that the data is message information, at step STP-13, a new area is set.
The setting of the new area will be described with reference to Fig. 8.
When the data is judged as message information, the received address information (~i~ I2) is read out of the register ~7~
AD sh~wn in Fig. 6g, and the content of the register M~T shown in Fig. 6d, in one-to-one correspondence relationship to the re-ceived address information (Il, I2), is read out at step STP-30.
Based on the content of MST, it is judged whether a new area is to be set for the individual or common address information at step STP-31. More specifically, if MST(Mi)=0, the new area is to be set for the individual address information and the process goes on to step STP-37. If MST(Mi)=l, the new area is to be set for the common address information and step STP-32 follows. At this stage,~ utilized in steps STP-32 and STP-37 will be des-cribed.
Denoted by ~ is the number of sectors that can be used in one file, and ~1 and ~2 are values respectively corresponding to the common address information and the individual address information. For example, where the number of sectors each of which can store 32 characters is 36 and ~1 and ~2 are equally set to 9, it is possible to store messages of at least 4 files. As a result, if three common addresses are used, it is possible to store only one individual address information at the worst. On ~0 the other hand, if ~1 and ~2 are differently set to 6 and 9, respectively, at least two pieces of individual address informa-tion can be stored even if three common addresses are used. By setting the values of ~1 and ~2 in this way, the old individual address information can be recognized. Usually, the individual address information comprises a long message such as ordering an action but the common address information comprises a short mes-7~
sage such as stock prices, so that the above-described performance is considered to be appropriate. The values of ~l and ~2 are selected in a manner as described above.
When the read-out MST content, MST(~i), is decided to be l, i.e., the received information is decided to be information relating to the common address in question, ~ is set to be ~l at step STP-32, and then a file and a section which have been used for that common address are cleared. More specifically, at step STP-33, adjustment is made as to whether file number Fj is stored l~ in a memory area corresponding to the received address informa-tion or not. When the result of judgment is NO, at steps STP-34, STP-35 and STP-36, the old information of the received common address is erased and the contents of registers FST and SST
shown in Figs. 6e and 6f which have been used for the old infor-mation are changed to "0" thereby enabling to use their files and sectors. When the file number Fj is not being stored in a memory area corresponding to the received common address infor-mation, that is, when an initial service is rendered at that common address, at step STP-38, a judgment is made as to whether ~n there is an idle file and an idle sector or not. When the result of judgment is NO, the program returns to the original state in this embodiment. But if desired, it is possible to in form the user that there is not an idle file and an idle sector by alerting or displaying this fact.
When the result of judgment at step STP-31 shows that the data is individual address information, at step STP-37, a ~ ;Cd~ 7 ~ 5 value of ~ is set to be ~2 which is suitable for the individual address information, then the process goes on to step STP-38.
All pieces of initial or first message information after starting the CPU are advanced to step STP-39 to set neces-sary file and sector in a new area. In other words, the data in register FST (shown in Fig. 6e) corresponding to an idle file stored in register IFN shown in Fig. 6h is set to "1". In -the same manner, the data of register SST (shown in Fig. 6e) corres-ponding to an idle sector stored in the register ISN shown in Fig. 6i is set to "l". Thus it is indicated that its file and sector are permittedfor use. Moreover, since only one sector is used, the data of the register SC shown in Fig. 6j is set to "1".
Then, the first address of the sector to be used is set at step STP-40 in which ~ represents the number of characters that can be stored in one sector. For example, in the sector area shown in ~ig. 6c, the number of characters that can be stored in one sector is 6, that is, ~= 6. Suppose now that the idle sector number stored in the register ISN shown in Fig. 6i cor-responds to the value of K; the sector number So becomes "0".
~0 The first address of the sector number So is "0", whereas the last address is "5". Since the sector number Sl is "l", its first address is equal to the next address "6". In this manner, the first address of the used sector is expressed by ~x ISN, thus terminating the setting of the new area.
~7~5 The first message information or succeeding message information whose new area has been set at step STP-13 shown in Fig. 7 is judged as to whether the information has data of one character or not at step STP-14. When the result of judgment is NO, a succeeding message signal is subjected to the same processing to obtain data of more than one character. When the result of judgment at step STP-14 is YES, at steps STP-15, STP-16 and STP-17, the data of one character is stored in an address designated by the register STAD shown ln Fig. 6b and the add-ress designated by the register STAD is set as the next address.After that, at step STP-18, a judgment is made as to whether one sector has been filled or not. When the result of judgment is NO, the program is advanced to step STP-23 where a judgment is made as to whether the processing of the data of the information area has ended or not. When the processing is not terminated, the program is returned to step STP-14 to process the remaining data of the information area. In contrast, when the processing of the data of the information area has completed, the program is advanced to step STP-6 to begin the processing of the next 2~ received signal.
When the result of judgment at step STP-l~ is YES, the sector number stored in the register ISN shown is Fig. 6i is stored in the SC-th address of register FI shown in Fig. 6~
(see step STP-l9) and the number of used sectors is incremented ~ ~7B3~
by one at step STP-20. At the next step STP-21, the number of sectors used in one file is supervised. When the number of sectors used in one file is larger than ~, storing of the message information is interrupted, and the program is advanced to step STP-24. When the number of the used sectors is less than ~, at step STP-22, the idle sector is supervised.
The supervision of the idle sector will be described with reference to Fig. 9.
When it is judged that the number of files in one file is smaller than ~, at step ST~-50, a judgment is made as to whether there is a sector that can be used next. When there is an idle sector, at step STP-51, the sector number of the id]e sector is set in the register ISN shown in Fig. 6i and at step STP-52, the first address number of the idle sector is set, where-as when there is no idle sector, a processing is executed to pre-pa~e an idle sector. In this processing, at steps STP-53, STP-54 and STP-55, judgments are made as to whether the file number Fj is sequentially stored in memory areas Mn through Mi shown in Fig. 6a. When the file number Fj is stored, at steps STP-56 and 57, a judgment is made as to whether the memory area corresponds to an individual address or to a common address. When the memory area corresponds to the individual address, the information stored therein is erased and the register FST shown in Fig. 6e and the register SST shown in Fig. 6f and utilized ~or that information are changed to "0" to render the file and sector useable (see steps STP-58, 59 and 60). -i-~ this manner, an idle sector is prepared, and the program is advanced to succeeding steps STP-50, 51 and 52.
The above description corresponds to the idle sector supervision.
Subsequent to the supervision of the idle sector e~ecuted at step STP-22, the program is advanced to step STP-23 where a judgment is made as to whether the processing of the data of the information area has ended or not. The storing of the inEormation in the sector area and register FI shown in Fig. 6~ is continued by repeating the process described above and is completed when the message information terminates (see STP-3)or when a sector of one file overflows (see step STP-21). Then, at step STP-24, the information is stored in the file area and the memory area.
~0 The storing operation of the information in the file area and the memory area sho-~n in Figs. 6b and 6a will now be described with reference to the flow chart shown in Fig. 10.
The data of a sector number of one file stored in register FI (sho~m in Fig~ 6~) in the random access memory RAM2 (sho~n in Fig. 5) contained in the one chip CPU
shown in Fig. 3 is sent to file F(IFN) shown by the ~;~ 7~
register IFN (see Fig. 6b) of the RA~l shown in Fig. 3, so as to store the sector number of one file in the file F(IFN), at step STP-70. Then, at step STP-71, the received address information (Il, I2) is read out from the register AD shown in Fig. 6g, while at the same time the content of the corresponding register MST shown in Fig. 6d is read out. Then at step STP-72, a judgment is made as to whether the read out information is stored in a memory area corresponding to the individual address information or the common address information. In the case of the common address information, at step SEP-73, a number called file F(IFM) is stored in a memory area corresponding to the received common adress. On the other hand, in the case of the individual address, the received address information is shifted within a memory area (shown in Fig. 6a) storing the individual address information to render idle (empty) the memory area Ml at steps 74 to 82. More particularly, at step STP-74, i is set to n.
Then, at steps STP-75 to 77, the number Mi of the memory area (shown in Fig. 6a) storing the individual address information is searched starting from Mn 1 At s-tep STP-78, the value of i is changed to x, thus preserving Mi storing the individual address information.
At steps STP-79 and 80, the individual address information is stored by using the new variable x, and the ~e <~
number Mx of the memory a~ which is larger than Mi is searched. Then, at step STP-81, the individual address ~ 7~ 71]80-32 information (Mi) is changed to Mx. The change of the individual mation from Mn_l to Ml is executed under the judgment executed at step STP-82. Upon completion of this change, the memory area Ml shown in Fig. 6a becomes idle, so that a number termed file F(IFN) is stored in the memory area Ml at s-tep STP-83, thus completing the storing of the number in the file area shown in Fig. 6b and the memory area shown in Fig. 6a.
Then, at step STP-25, the alerting and displaying are started and the program is returned to the initial state. The alerting is made by controlling the address decoder AD~ shown in Fig. 2 with the alert control signal AC shown in Fig. 5, and then driving the loudspeaker SP via the huffer register BUF. A display is made on the display DP shown in Fig. 2 by controlling the LCD driver DV shown in Fig~ 3 with the system block signal SCK and output signal "SO" from the serial interface IF shown in Fig. 5, and the control signals (CS, C/D) from the output ports OP7 and OP~3.
Although the invention has been described with refer-ence to a case wherein -the setting of MSTATUCS is made by a software message information processing of a received signal, it ~0 should be understood that the invention is not limited to this example and that any suitable hardware can be used. For example, for the one chip CPN shown in Fig. 3, may be provided input and output ports corresponding to respective receiving addresses, and .
. .
the setting of MSTATNCS can be made by making respective input terminals to a high or low level.
As described above, according to this invention, RAM (shown in Fig. 5) of the one chip CPU shown in Fig. 3 is provided with a register AD (shown in Fig. 6g) capable of storing addresses and a register MST (Shown in Fig. 6d) designating the memory area of common address information so as to ena~le to store the individual address information and the common address information in memory areas according to the features of the address information. Accordingly, there is a merit that even when the user does not use all common addresses, the memory areas can be efficiently utilized.
As described above, according to this invention, with a simple construction, it is possible to store the individual address information and the common address information in memory areas commensurate with their features in accordance with the information from a register and to efficiently utilize the memory areas even when the user does not utiliæe all common addresses.
Furthermore, the individual address information can be protected by providing memory areas corresponding to respective addresses. In an information receiver having a plurality of common addresses and memory areas corresponding to respective common addreses, where the user does not require specific common address information, efficient utilization of the memory areas can be realized 78~4~
by using a memory area capable of storing a particular common address as a memory area capable of stor ing the individual address information~
Claims (11)
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. A paging receiver with an individual paging number and at least one common paging number wherein said common paging number is received more frequently than said individual paging number, comprising: memory means including an individual memory area for storing at least one message signal following said individual paging number, and a specific memory area for selective-ly storing one of a message signal following said common paging number and a message signal following said individual paging number, whereby messages stored in said individual memory areas are not affected by messages stored in said specific memory areas.
2. A paging receiver having an individual paging number and at least one common paging number, said receiver comprising: first memory means including an individual memory area for storing at least one message signal following said individual paging number, and a specific memory area for selectively storing one of a message signal following said common paging number and a message signal fol-lowing said individual paging number; second memory means for stor-ing information which indicates whether or not said receiver is set to receive a message signal following said common paging number; and control means responsive to the content of said second memory means for making said specific memory area store a message signal follow-ing said individual paging number when said receiver is not set to receive a message signal following said common paging number and for making said specific memory area store a message signal follow-ing said common paging number when said receiver is set to receive the message signal following said common paging number.
3. The receiver according to claim 2 further comprising means for decoding said message signal to obtain information which determines whether said service of said common paging num-ber is to be rendered or not.
4. The receiver according to claim 2 wherein said control means comprises means responsive to the information stored in said second memory means for producing one of a logic "0" and a logic "1", and means for storing a message signal following said common paging number in response to one of said logic "0" and "1"
and storing a message signal following said individual paging number in response to the other of said logic "0" and "1".
and storing a message signal following said individual paging number in response to the other of said logic "0" and "1".
5. The receiver according to claim 2 which further com-prises display or alerting means actuated by a message processing unit storing a message signal.
6. A paging receiver having an individual paging number and at least one common paging number, the common paging number being received more frequently than said individual paging number is received, said receiver comprising:
memory means including individual memory areas for storing at least one message signal following said individual pag-ing number, and specific memory areas for storing message signals following said common paging number, the message signals stored in said individual memory areas being not erased responsive to the receipt of the message signals following said common paging number.
memory means including individual memory areas for storing at least one message signal following said individual pag-ing number, and specific memory areas for storing message signals following said common paging number, the message signals stored in said individual memory areas being not erased responsive to the receipt of the message signals following said common paging number.
7. A paging receiver assigned a first and a second paging number, comprising:
first memory means for storing at least one message following said first paging number; and second memory means for storing at least one message following said second paging number, the content of said first memory means not being erased in response to any content stored in said second memory means.
first memory means for storing at least one message following said first paging number; and second memory means for storing at least one message following said second paging number, the content of said first memory means not being erased in response to any content stored in said second memory means.
8. A paging receiver as claimed in claim 7, wherein said receiver receives said second paging number more frequently than it receives said first paging number.
9. A method of receiving and responding to an individual paging number and at least one common paging number, said method comprising the steps of:
receiving at least one individual message in response to said individual paging number;
storing the received individual message into an indi-vidual memory area of a pager receiver;
receiving at least one common message in response to said common paging number, said paging receiver receiving and responding to said common message more frequently than it receives and responds to said individual message; and storing the received common message into a common memory area of said pager receiver that is separated from said individual memory area.
receiving at least one individual message in response to said individual paging number;
storing the received individual message into an indi-vidual memory area of a pager receiver;
receiving at least one common message in response to said common paging number, said paging receiver receiving and responding to said common message more frequently than it receives and responds to said individual message; and storing the received common message into a common memory area of said pager receiver that is separated from said individual memory area.
10. A method of receiving and storing messages following first and second paging numbers which are assigned to a paging receiver, said method comprising the steps of:
receiving a first message following said first paging number;
storing the received first message into a first memory area of said paging receiver;
receiving a second message following said second pag-ing number; and storing the received second message into a second memory area of said paging receiver, said first memory area being independent of said second memory area.
receiving a first message following said first paging number;
storing the received first message into a first memory area of said paging receiver;
receiving a second message following said second pag-ing number; and storing the received second message into a second memory area of said paging receiver, said first memory area being independent of said second memory area.
11. A method as claimed in claim 10, wherein said second paging number is received more frequently than said first paging number.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP46582/'84 | 1984-03-13 | ||
| JP59046582A JPS60191531A (en) | 1984-03-13 | 1984-03-13 | Radio selective call receiver with display function |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA1278345C true CA1278345C (en) | 1990-12-27 |
Family
ID=12751292
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA000476276A Expired - Lifetime CA1278345C (en) | 1984-03-13 | 1985-03-12 | Paging receivers |
Country Status (8)
| Country | Link |
|---|---|
| US (2) | US4786901A (en) |
| EP (1) | EP0155628B1 (en) |
| JP (1) | JPS60191531A (en) |
| AU (1) | AU592053B2 (en) |
| CA (1) | CA1278345C (en) |
| DE (1) | DE3563487D1 (en) |
| HK (1) | HK19491A (en) |
| SG (1) | SG8591G (en) |
Families Citing this family (36)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA1243358A (en) * | 1985-01-14 | 1988-10-18 | Yoshio Ichikawa | Radio paging system capable of transmitting common information and receiver therefor |
| JPH0759104B2 (en) * | 1985-12-18 | 1995-06-21 | 日本電気株式会社 | Wireless selective call receiver with display |
| KR900006390B1 (en) * | 1986-08-25 | 1990-08-30 | 닛본덴기 가부시기가이샤 | Display radio pager having graphic alarm for selective indication of memory availability factors |
| US4845491A (en) * | 1987-05-15 | 1989-07-04 | Newspager Corporation Of America | Pager based information system |
| US5241305A (en) * | 1987-05-15 | 1993-08-31 | Newspager Corporation Of America | Paper multi-level group messaging with group parsing by message |
| JP2776503B2 (en) * | 1987-11-13 | 1998-07-16 | 日本電気株式会社 | Radio selective call receiver |
| US5844498A (en) * | 1987-11-13 | 1998-12-01 | Nec Corporation | Paging receiver with a message selection circuit |
| NL8901000A (en) * | 1989-04-20 | 1990-11-16 | Ericsson Paging Systems | METHOD FOR TRANSMITTING IN A PERSONAL CALL SYSTEM AND DISPLAYING A MESSAGE ON RECEPTION, AND A PERSONAL CALL SYSTEM SUITABLE FOR PERFORMING THIS METHOD. |
| WO1991002434A1 (en) * | 1989-08-09 | 1991-02-21 | Motorola, Inc. | Automatic message protection for selected addresses in a selective call receiver |
| US5177477A (en) * | 1989-08-14 | 1993-01-05 | Motorola, Inc. | Selective call receiver having a file for retaining multiple messages |
| US5223831A (en) * | 1989-08-14 | 1993-06-29 | Motorola, Inc. | Ideographical character signalling system |
| KR960003964B1 (en) * | 1989-08-14 | 1996-03-25 | 모토로라인코포레이티드 | Ideographical character signalling system |
| US5075684A (en) * | 1989-10-06 | 1991-12-24 | Motorola, Inc. | Selective call message management |
| US5146216A (en) * | 1989-12-14 | 1992-09-08 | Motorola, Inc. | Multiple message signalling protocol for a selective call receiver |
| US5001471A (en) * | 1989-12-26 | 1991-03-19 | Motorola, Inc. | Paging system employing designated batch information service data message transmission |
| JP2758684B2 (en) * | 1990-02-09 | 1998-05-28 | 日本電気株式会社 | Wireless selective call signal receiver with display function |
| US5224150A (en) * | 1990-07-06 | 1993-06-29 | Simon Neustein | Paging system |
| AU627996B2 (en) * | 1990-08-07 | 1992-09-03 | Fujitsu Limited | Portable telephone set |
| JP2864743B2 (en) * | 1990-12-20 | 1999-03-08 | 日本電気株式会社 | Radio selective calling system and receiver used for it |
| FI96564C (en) * | 1991-07-08 | 1996-07-10 | Nokia Mobile Phones Ltd | Private telephone number in cellular telephone system |
| JP2563701B2 (en) * | 1991-10-11 | 1996-12-18 | 松下電器産業株式会社 | Selective call receiver |
| US5281962A (en) * | 1992-05-08 | 1994-01-25 | Motorola, Inc. | Method and apparatus for automatic generation and notification of tag information corresponding to a received message |
| JPH05316009A (en) * | 1992-05-11 | 1993-11-26 | Sharp Corp | Data communication system |
| US5635914A (en) * | 1992-05-29 | 1997-06-03 | Motorola, Inc. | Method and apparatus for dynamic group calling in a selective call system |
| EP0583064B1 (en) * | 1992-07-09 | 1999-05-19 | Nec Corporation | Radio paging receiver with display unit |
| US5379031A (en) * | 1992-10-19 | 1995-01-03 | Motorola, Inc. | Method and apparatus for conversion of maildrop message to selective call individual message |
| JP2531074B2 (en) * | 1993-01-28 | 1996-09-04 | 日本電気株式会社 | Wireless selective call receiver |
| US5410302A (en) * | 1993-02-01 | 1995-04-25 | Motorola, Inc. | Method and apparatus for processing a received message in a communication receiver |
| JP2591462B2 (en) * | 1993-12-28 | 1997-03-19 | 日本電気株式会社 | Radio selective call receiver |
| EP0703514B1 (en) | 1994-09-24 | 1998-07-22 | Eta SA Fabriques d'Ebauches | Time measurement in a communications system, a communications system and a receiver for use in such a system |
| WO1997017682A1 (en) * | 1995-11-06 | 1997-05-15 | Motorola Inc. | Message storage in a selective call receiver |
| JP2757841B2 (en) * | 1995-11-13 | 1998-05-25 | 日本電気株式会社 | Radio selective call receiver |
| JP2742254B2 (en) * | 1996-03-22 | 1998-04-22 | 静岡日本電気株式会社 | Radio selective call receiver with received message display function |
| JPH1066117A (en) * | 1996-08-19 | 1998-03-06 | Nec Shizuoka Ltd | Radio selective call receiver |
| FR2791843B1 (en) * | 1999-04-01 | 2001-05-11 | Sfr Sa | TELECOMMUNICATION TERMINAL PROVIDED WITH AT LEAST ONE STORAGE LOCATION RESERVED FOR DATA MANAGED BY AN OPERATOR AND CORRESPONDING METHOD |
| DE10030272A1 (en) * | 2000-06-20 | 2002-01-03 | Siemens Ag | Procedure for the transmission of short messages |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4110743A (en) * | 1974-07-11 | 1978-08-29 | Hasler Ag | Wireless paging receiver |
| JPS55121762A (en) * | 1979-03-12 | 1980-09-19 | Nippon Telegr & Teleph Corp <Ntt> | Multi-spot connection system |
| DE2915708C2 (en) * | 1979-04-12 | 1984-05-24 | ANT Nachrichtentechnik GmbH, 7150 Backnang | Pager |
| US4383257A (en) * | 1979-12-26 | 1983-05-10 | Millicom Incorporated | Message communication system with message storage |
| US4473824A (en) * | 1981-06-29 | 1984-09-25 | Nelson B. Hunter | Price quotation system |
| US4385295A (en) * | 1981-09-29 | 1983-05-24 | Motorola, Inc. | Pager with visible display indicating unread messages |
| US4427980A (en) * | 1981-10-13 | 1984-01-24 | Motorola, Inc. | Encoder for transmitted message activation code |
| JPS58131831A (en) * | 1982-02-01 | 1983-08-05 | Nec Corp | Radio selection and calling receiver |
| CA1203011A (en) * | 1982-02-09 | 1986-04-08 | Yukio Sato | Pager receiver for giving at least one of extraordinary tones and extraordinary displays |
| JPS5939130A (en) * | 1982-08-27 | 1984-03-03 | Nec Corp | Radio selecting call receiver with display function |
| JPS5997240A (en) * | 1982-11-27 | 1984-06-05 | Nec Corp | Radio selective call receiver with display function |
-
1984
- 1984-03-13 JP JP59046582A patent/JPS60191531A/en active Granted
-
1985
- 1985-03-12 EP EP85102827A patent/EP0155628B1/en not_active Expired
- 1985-03-12 CA CA000476276A patent/CA1278345C/en not_active Expired - Lifetime
- 1985-03-12 AU AU39737/85A patent/AU592053B2/en not_active Expired
- 1985-03-12 DE DE8585102827T patent/DE3563487D1/en not_active Expired
-
1987
- 1987-07-28 US US07/080,227 patent/US4786901A/en not_active Expired - Lifetime
-
1988
- 1988-03-28 US US07/173,766 patent/US4873519A/en not_active Expired - Lifetime
-
1991
- 1991-02-18 SG SG85/91A patent/SG8591G/en unknown
- 1991-03-14 HK HK194/91A patent/HK19491A/en not_active IP Right Cessation
Also Published As
| Publication number | Publication date |
|---|---|
| AU592053B2 (en) | 1990-01-04 |
| HK19491A (en) | 1991-03-22 |
| JPH0260099B2 (en) | 1990-12-14 |
| JPS60191531A (en) | 1985-09-30 |
| SG8591G (en) | 1991-04-05 |
| DE3563487D1 (en) | 1988-07-28 |
| AU3973785A (en) | 1985-09-19 |
| US4786901A (en) | 1988-11-22 |
| US4873519A (en) | 1989-10-10 |
| EP0155628A1 (en) | 1985-09-25 |
| EP0155628B1 (en) | 1988-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA1278345C (en) | Paging receivers | |
| US4438433A (en) | Multiaddress pager with a call storage and priority paging option | |
| US4855731A (en) | Pager receiver capable of avoiding an unpleasing interruption of a displayed message | |
| CA1270526A (en) | Radio communication receiver with apparatus for altering bit rate of the receiver | |
| JPH0669163B2 (en) | Wireless selective call receiver with display function | |
| US4988991A (en) | Selective call receiving apparatus | |
| JPH07298327A (en) | Radio selective call receiver and its display method | |
| US5396229A (en) | Selective calling receiver | |
| CA2060628C (en) | Pager receiver with message display function | |
| US6205322B1 (en) | Selective call receiver | |
| JPS6074736A (en) | Radio selective calling receiver with display function | |
| US6512449B1 (en) | Screen display method for portable information terminal | |
| US5801640A (en) | Radio pager with a message processing function | |
| US5319574A (en) | Status change monitoring apparatus | |
| KR950014887B1 (en) | The pager having multi function | |
| GB2100486A (en) | Radio receiver (pager) decoding system | |
| JPS58221529A (en) | Radio selective call receiver provided with display function | |
| JPH0321092Y2 (en) | ||
| JPH0242256B2 (en) | ||
| KR20000003246A (en) | Searching method of long character information for character pager | |
| JPH0445316Y2 (en) | ||
| KR19990085903A (en) | Memory operation method of pager | |
| JPH0474901B2 (en) | ||
| KR19990048991A (en) | How to automatically delete received message of wireless call receiver | |
| JPS63234737A (en) | Radio selection calling communicating equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| MKEX | Expiry | ||
| MKEX | Expiry |
Effective date: 20071227 |