Architecure of situating the network indentification information for use in mobile communication systems

The invention relates to a method of transmitting messages to a plurality of receivers and a selective call receiver. More particularly, the invention relates to a selective calling telecommunications system allowing a receiver to move and receive information over multiple coverage areas.

From US patent 5,128,665 a selective calling telecommunications system is known which is only adapted to a specific type of transmission protocol.

In a modern, busy society, it is desirable to be reachable by the selective call receiver (paging receiver) on any trip, be it local close to home, or to more remote locations in the same country or worldwide.

There is therefore a need for a communication method and system that allows mobile telecommunications receivers, such as paging receivers, to move between coverage areas of the same service enterprise and within coverage areas of different service enterprises.

The method of sending messages to a plurality of receivers according to the invention is that messages in a paging terminal are processed into a signal format that represents the network as a plurality of service areas including at least one zone, each network having a network displacement identifier including at least one network identifier that is common within a given network and a service area identifier for identifying a service area within the network, stored in at least one subscriber receiver for receiving messages on the at least one particular network, a network movement identifier associated with the at least one particular network, generating a signal to transmit in each zone at the paging terminal, the signal comprising at least one network movement identifier corresponding to the network which contains the service area corresponding to this zone, and the signal includes a plurality of consecutive time cycles, each time cycle including a plurality of consecutive time slots, and the network displacement identifier is positioned in an ordered time slot based on an algebraic relationship between the signal transmission frequency, the time cycle sequence, and a binary representation of at least a portion of the displacement identifier in the network, and the signal is transmitted by the paging terminal in each zone.

During generation, the location of all the movement identifiers in the network is determined in a first predetermined number of timeslots in the cycle for each transmit frequency in the zone.

180 100

Moreover, when generating the signal for transmission, the location of the movement identifier in the network is determined in a predetermined one of N time slots, where N is equal to a certain integer, preferably equal to 8, representing a predetermined number of time slots, this being one of the N time slots is determined by a mathematical operation module N of the sum of the cycle number representing the sequence of the time cycle, modulo N integer representing the frequency of signal transmission and modulus N of the number of least significant bits of the binary representation of the displacement identifier in the network.

Preferably, at least one coverage area is defined in each service area, and at least one area is defined in each coverage area, assigning to each coverage area a coverage area identifier comprising at least a local area identifier and a zone identifier for each coverage area. so that the local area identifier is common throughout the coverage area, and the identifier is for identifying a zone within the coverage area, and in the area of ​​generating a broadcast signal, the position of a coverage area identifier corresponding to a zone within the coverage area is further established in at least a first predetermined number of ordered time slots of each time cycle.

In an alternative method of sending messages to multiple receivers in multiple coverage areas, enabling messages to be sent to at least one addressable receiver, the paging terminal converts messages into a signal format representing each coverage area as multiple zones, stored in each receiver of at least one set of zones. coverage area identification information, wherein the set of coverage area identification information comprises a coverage area identifier for identifying the at least one coverage area, at least one zone identifier for identifying at least one zone in a respective coverage area, and a frequency identifier for identifying the frequency at which the receiver receives the message information in the respective area range, generating a signal by the paging terminal including a coverage area identifier assigned to a given coverage area, a zone identifier corresponding to a zone within coverage area, and a message for at least one receiver in that zone, and then transmitting a signal by the paging terminal to each zone of each coverage area on which at least one transmission frequency, a broadcast signal is received in the coverage area in which the receiver is located, if the signal transmission frequency corresponds to the frequency identifier stored in the receiver, the signal is decoded at the receiver to recover the coverage area identifier and zone identifier in the transmitted signal to determine if the coverage area identifier and zone identifier stored in the receiver match with the coverage area identifier and the zone identifier zones in the transmitted signal, and further, the transmitted signal at the receiver is decoded to play back a message addressed to the receiver if a match is found.

During the transmitting step, the signal is transmitted in cycles, each cycle comprising a plurality of consecutive time slots, the coverage area identifier and the zone identifier being included in predetermined time slots.

Preferably, the coverage identification information further distinguishes traffic separation flags that indicate to the receiver that the message to the receiver is being carried by a signal on a different transmission frequency.

Also preferably, the coverage identification information further distinguishes country codes that denote a specific country associated with the coverage area identifier.

The inventive method transmits the coverage area identifier and the zone identifier together in a first binary coded word, and transmits the country code associated with the coverage area identifier and the traffic separation flag associated with the zone identifier in the second binary coded word.

Preferably, the first binary-coded word is transmitting on one of the plurality of time slots and the second binary-coded word is transmitting on another of the plurality of time slots.

180 100

From among the time slots, a first time slot is selected to be synchronized with the corresponding first timeslots in the signals transmitted in all zones within the coverage area, the first binary coded word being transmitted in the first time slot.

Preferably, the first binary-coded word is transmitted repetitively in predetermined time slots within a first predetermined number of signal timeslots, while a second binary-coded word is transmitted once per cycle in a predetermined time slot.

The selective call receiver of the invention comprises a receiving circuit with an input signal including signals representing a movement identifier in the network, the input signal comprising a plurality of consecutive time cycles, each time cycle including a plurality of consecutive time slots, the receiver output being coupled to the input / output port of the circuit. control responsive to the output signals of the receiving circuit, the control circuit comprises a memory storing a specific network movement identifier associated with at least one specific network in which the selective call receiver is a subscriber receiver for receiving messages, and the specific network movement identifier further comprises an address associated with the selective call receiver in to route messages to this selective call receiver, and the control circuit further comprises a processor circuit having an input coupled to the output of the receiving circuit and the output of the time cycle sequencing signal of the input signal of the receiving circuit, a time slot of the determined network displacement identifier in the input signal of the receiving circuit predicted from an algebraic relationship between the frequency of the input signal of the circuit receiving, the time cycle sequence of the transmitted signal received by the receiving circuit and a binary representation of at least a portion of the displacement identifier in the network stored in the control circuit memory. wherein the output of the processor circuit further comprises a decoded signal representing the determined network movement identifier in an expected time slot of the transmitted signal and a signal representing a reconstructed message from the transmitted signal associated with the address of the selective call receiver.

The receiver according to the invention further comprises a frequency synthesizer coupled to the receiving circuit and the processor circuit, the frequency synthesizer having an input to the processor circuit in response to the traffic separation flags in the input signal of the receiving circuit, which causes the frequency synthesizer to alter the tuning frequency of the receiving circuit. whereby the selective call receiver receives the messages carried by the transmitted signal at a different transmission frequency, the frequency synthesizer having an output signal coupled to the receive circuit to vary the tuning frequency of the receive circuit.

The solutions according to the invention are particularly suitable for a transmission protocol designed to transmit a message to a plurality of addressable receivers, enable cooperation with moving receivers, and save power batteries in the receivers by using an arrangement therein that enables the receiver to predict the occurrence of a time slot of certain address information in the transmitted signal.

The subject of the invention will be explained in more detail in the embodiments shown in the drawing, in which Figs. 1-3 show timing patterns illustrating the transmission protocol according to the invention, Fig. 4 - field information word structure according to the invention, Figs. 5 and 6 - word structures of block information, in which one simultaneous broadcast identification number (SSID) is encoded, Fig. 7 - the division of coverage areas and zones according to the invention, Fig. 8 - the divisions of networks and service areas according to the invention, Figs. 9 and 10 - an address word and vector word structure in which the network movement identification information (NRI) is encoded according to the invention, Fig. 11 - a field diagram illustrating a location of local area identification information ( LID) and time information according to the invention, Fig. 12 is a field diagram illustrating an NRI information arrangement configuration according to the invention, Fig. 13 - field diagram illustrating a configuration example

180 Fig. 14 is a diagram illustrating a search sequence used by a receiver to identify a channel during possible frequency overlapping situations. Fig. 15 is a flowchart illustrating a general procedure for detecting SSID and NRI information by a receiver, Fig. 16 - a block diagram of a selective call receiver according to the invention; Fig. 17 is a block diagram of a transmitting station in the paging system according to the invention.

Figures 1-3 show an example of a selective calling telecommunications system to which the present invention relates. The transmission system shown contains 128 fields numbered from 0 to 127. These fields are transmitted at 32 fields per minute, so a cycle of all 128 fields takes 4 minutes. One hour is divided into 15 cycles numbered 0-14. The universal time reference is provided by a protocol with a synchronous time slot. The field 0 is synchronized to the beginning of each hour so that the receiver can recover the real time based on the current field and cycle number so that the receiver has an accurate time within an hour without having to adjust.

In addition, the protocol provides for multiple time division multiplexed phases, where, for example, a 6400 bps data stream is time division multiplied into four 1600 bits per second data stream. The general field structure shown in Fig. 1 for the one phase shown in Fig. 1 is the same for each of the four phases.

Each field contains a synchronization part and several blocks. The synchronization portion further includes a Sync 1 (SI) portion, a field information word (F1) and a Sync 2 (S2) portion.

Each receiver is allocated a primary field within the set of 128 fields existing on the radio frequency channel. The receiver can, at the expense of battery life, ensure that information is transmitted more frequently by monitoring more than one field per cycle. When the receiver requests synchronization for an RF channel, it waits to find its assigned field within a very narrow time window. The use of four-level frequency modulation doubles the data rate of one character (compared to two-level frequency modulation), which helps to reduce the effect of simultaneous broadcast distribution errors and the effect of propagation time differences between multiple signals within the receiving range of a receiver.

As shown in Fig. 3, the Sync 1 (SI) portion of each field is for field sync, sign sync, and rest field velocity determination. The field information word (FI) carries 11 bits for the field and cycle numbers, 5 bits of the time division multiplied low traffic phase indication, 1 bit referred to as the displacement channel bit in the network to indicate the existence of a wandering frequency throughout the network, and other information. The displacement channel bit in the network is used to trigger recognition of certain displacement information in the network which will be described in connection with FIG. 4.

The Sync portion 2 (S2) ensures the speed of the field block is synchronized to allow correct demultiplexing and decoding of the blocks.

The block information (BI) frame includes the first 1-4 words, called block information words, of the first interleaved block and includes field structure and system information, some of which are related to the present invention and will be explained in detail below.

An address frame (AF) begins immediately after words of the block information and includes short addresses and long addresses. The vector frame (VF) maintains a 1: 1 relationship with the address frame. The vector word points to the beginning word of the respective message. The message frame (MF) contains the message words specified by the vector frame. IB represents empty blocks that are not used and are filled with the appropriate bit patterns.

Figure 4 illustrates the structure of the field information word in more detail. The various parameters in the field information word are defined as follows:

C Cycle number (0-14) c3c2clc0 15 / hour f Field number (0-127) f6f5f4f3f2flf0 128 / cycle n Network Movement Channel bit n = l means network can be moved, an = 0 means no network roaming is supported

180 100 r Repeat recall indicator

If r = l, t3t2tlt0 are reserved to denote the existence of a repeat format

If r = 0, t3t2tlt0 are the low traffic flags for each phase in the field t Definition depends on the value of r

At 3200 bits per second, t3 = t2 and 11 = t0, representing the two phases in the field

At 1600 bits per second t3 = t2 = tl = t0, which represents one phase in the field t = l means the address frame contained in block 0 t = 0 means the address frame outside block 0

These flags give an early indication that traffic is weak and all addresses are contained within block 0.

x The standard 4-bit check character

Figure 5 shows an example of a block information word 1. Block information word 1 has 2 bits a, aOal which denotes the beginning of the address frame, 6 bits v, v5v4v3v2vlv0 which denotes the start of the vector field, 2 bits c, clcO which denotes redundant forwarding of traffic to the next fields, 3 bits m, m0mlm2, which are the number of higher order frame number bits to be masked and the 4 bits P, P3P2P1P0 which are the number of priority addresses at the beginning of the address frame.

Figure 6 illustrates an example of the words of block information 2, 3 and 4. The type of the word format is represented by bits of the format f2flfO, where s represents data and x is again a standard 4 bit check character.

The following is a table that illustrates the bit distribution definitions for the f 1s bits shown in Fig. 6. Depending on the value of the bits f2flfD, the data of the bits s3-s0 have a specific meaning or application. When f2flfD is set to (000), bits sl3-s0 represent a 9 bit Local Area Identification Number (LID) (i8-i0) which identifies 512 possible LIDs and a 5 bit zone number C4C3C2C1C0 which represents 32 possible coverage zones associated with a specific LID number.

<td>f₂f.fo</td><td> 81381281181089888786858483828(80</td><td></td>

<td> 000</td><td>• siTióbUbbiik ^ CaCiCo</td><td>512 local identification numbers, 32 coverage zones</td>

<td> 001</td><td>m₃m2m₁m_aboutd4d₃d2didoY4Y3Y2Yi Yo</td><td>Month, day, year</td>

<td> 010</td><td>S2S₁S._ABOUTM5M4M3M2M₁M._aboutH4H3H₂H.₁Ho</td><td>Second, minute, hour</td>

<td> 011</td><td>Reserved for future use</td><td></td>

<td> 100</td><td>Reserved for future use</td><td></td>

<td> 101</td><td>WITH₉WITH₈Z7Z₆Z5Z4Z₃WITH₂WITH₁WITH₀ And I₂A | AND_about</td><td>Data, system message</td>

<td> 110</td><td>Reserved for future use</td><td></td>

<td> 111</td><td>C9C8C7C6C5C4C3C₂C.₁CoT₃T2T 1T_ABOUT</td><td>Traffic separation flag type code</td>

When f2fIfO is set to (001) and (010), the data bit pattern s13-sO represents month, day, year, second, minute and hour as shown in Fig. 7. The bit pattern f2flfO (101) indicates spare data bits S13 -S9, system message A3-A0 and time zone information Z3-Z0.

Finally, the bit pattern f2flfO (111) is important, which means 10 bit country code c9-c0 and 4 bits called traffic separation flags (both will be described in more detail later).

The country codes are given for example in the CCITT standard which is known. The 10-bit country code was used to allow the reuse of LIDs in different countries according to the allocation rules under the CCITT standard. The country code information is useful for a non-subscriber to facilitate a more efficient search by first finding out in which country the receiver is located.

As shown in Fig. 7, the smallest coverage area 100 is determined by a simultaneous broadcast system identification (SSID). The SSID is made up and is uniquely identified by several identifiers: LID number, zone, country code, flags

180 100 traffic separation (TSF) and frequency. Each zone 110 has a distinguishing SSID. Thus, if a user wishes to receive messages in more than one zone, a receiver worn by that user will store each of the respective SSIDs. The zones shown in Figure 7 need not be geographically contiguous with each other.

In the example shown in Fig. 7 there are 512 possible LIDs, each including 32 possible zones. A zone is a single simultaneous broadcast area which can be associated with other simultaneous broadcast areas within a coverage area by a common LID number. For example, a service provider was given the LID number 123456789ΧΧΧΧΧ. The service provider has the option of assigning this LID to 32 different parts of the coverage area or zone. The northern portion of the service provider's coverage area may be zone 1 and will broadcast 12345678900001, while the southern portion is zone2 and transmits 12345678900001.

The traffic separation flags mean the allocation of one frequency (channel) of 4 traffic groups with movement in the network. Any rover that finds a frequency to carry a valid LID number responds to only one of the four traffic separation flags. When the flag allocated to a receiver is 0, the receiver searches for another frequency with the same LID number and assigned flag of 1.

The SSID information is encoded in two words:

1st word (000) 9 bits = 512 LID numbers of bits = 32 zones

2nd word (111) 10 bits = 1024 country codes bits = traffic separation flags

The first word, hereinafter referred to as LID1, corresponds to the information word of the first block (000) in Fig. 3 and the second word, referred to as LID2, corresponds to the information word of the block (111).

Time and date information (information words of block f2flfO = 001, 010 and 101) when transmitted occurs in field 0 or in the first valid field following field 0. In a network capable system, the LID number along with zone, country code, and traffic separation flags occupy the second and third words of block information in field 0. The fourth block information word carries 3 available clock time and date information words that are transmitted in the fourth block information word located in field 0 of the spin sequence, one block information word occurring in time for 3 consecutive cycles. This allows the words of block information 001, 010 and 101 to be updated five times each hour.

The advantage of such a system is that the information on the clock time and date is delivered unaddressed.

Bits A3-A0 specify the message type and the class of the receiver for which the message is intended, as shown in the table below. For example, all receivers should see this message, only receivers that use the SSID information should see this message, and / or only receivers that use network travel information (NRI) (will be described later) to access this channel should see this message. Hints as to which frequency to go to when the traffic separation flag changes and time zone information may also be sent.

A3__A2_______Al__A0

0 0 0 All messages

0 0 1 Local message

0 10 Movement message

0 11 Movement instruction

10 0 Time zone * + ♦ *

1111 Reserved for future use

When a system message is indicated, an additional vector is added to the end of the vector frame. The receiver decodes the block information 4 and determines the type of instruction and which receivers should see the message associated with this block information word. When the receiver determines that it should see the message, it processes

180 100 an address frame and a vector frame in the normal way, but there will be an extra vector at the end of the vector frame. Only receivers that receive the message view command will see this vector, since all address / vector combinations will point to message words that follow this vector which is currently at the position of the first message word for this message frame. Up to this point, a group of listeners have been informed that there is a message, what kind of message to expect and where to look for that message. When the receiver enters the message frame, it decodes the message and processes it according to the message type.

An example of a system message is a greeting message sent to a receiver that will move into a coverage area outside of its home coverage area.

Another example of the use of a system message is combined with traffic separation flags. When a service provider has two systems that have the same coverage area (i.e., redundant systems), or coverage areas have overlapping parts and would like to switch traffic from one system to the other, the following process is performed.

A system message as described above is sent to inform the receiver that there is to be a traffic change, and the traffic change information is new frequency ΧΧΧΧΧΧ. The receiver adds this new frequency to its scan list. The receiver should go to frequency ΧΧΧΧΧΧ and look for a designated SSID or NRI on that other frequency. On later transmission, which may be a month or a minute later, the traffic separation flag is canceled on one frequency and set to another system with a redundant coverage area. The receiver detects that receiver movement communication is no longer possible on this channel and shifts to the frequency it was instructed to pass through in the message. After doing so, the receiver determines if the SSID or NRI and the traffic separation flag is set correctly. When the SSID or NRI information stored in the receiver is aligned with the corresponding information being transmitted, then the receiver remains on that frequency (and adds this frequency to its search list). When there is no alignment, the receiver returns to the previous frequency to make sure there was no mistake. When this frequency no longer enables communication with a moving receiver, the receiver will begin searching (in band) for an SSID or NRI match.

Another way of splitting traffic in this system is to remove the traffic separation flag and allow the receiver to search for a new system transmitting the SSID or NRI of this receiver.

From the foregoing, it should be understood that the same LDI number and zone number may be used by the same service provider or by other companies in different channels.

In each receiver there is stored a list called a search list that contains at least one SSID. In each zone, the SSID is transmitted in a number of fields as will be explained below with reference to Fig. 11.

As shown in Fig. 8, in the event that a receiver requests the coverage of a larger area or receives messages on multiple frequencies, which would otherwise be defined by multiple SSIDs, a single piece of identification information is used instead of multiple SSIDs. This is called network displacement information (NRI). Network 200 is constituted as a collection of multiple service areas 210, and service area 210 is a collection of coverage areas 100 that are otherwise defined by multiple SSIDs. In a simple case, service area 210 shown in Fig. 8 is the same as coverage area 100 shown in Fig. 7 and includes multiple zones.

The NRI information is composed of a network identification (NID), service area (SA), traffic separation flags, and a 3-bit NID multiplier to extend the number of unique networks.

The network may be constituted by an agreement between several otherwise separate service enterprises, or it may be one large service enterprise. There are many service areas in the network, and in the example described here there are 32 possible service areas

180 Service 100 in the network, identified by a 5-bit pattern, but the network may be formed to be composed of much more or fewer service areas.

As shown in Fig. 8, one SSID information and at least one (but several are possible) NRI information is transmitted in each zone of the service area, as indicated by NI, N2, etc. One zone is thus potentially associated with multiple networks or areas. service and will be required to broadcast the relevant NRI information. The boundaries shown in Figure 8 represent functional boundaries and not necessarily geographical boundaries. However, regardless of geographic location, all service areas in a common network send the same NID sequence or network identifier. The individual service areas within the network are marked with a service area identifier.

Figures 9 and 10 show how NRI information is encoded into a signal sent in each service zone. Fig. 10 shows a conventional 32-21 hexadecimal binary (BCH) encoding of an address word as it is known in the art. The first 21 bits d0-d20 of the word are used to determine the NID, 12 bits of which are used to uniquely identify the network 4096 as an example.

Figure 10 shows the vector word structure associated with the address word of Fig. 9. The table below gives the definition of the bits associated with this vector word of Fig. 10.

<td>tlto</td><td>d] id₁from9d₈d7d₆d₅d4d3d2d₁down</td><td></td>

<td> 00</td><td>C3C2C and ic_aboutb₃b₂b] b₀and₃a2ai ao</td><td>3 digital characters with a short address</td>

<td></td><td></td><td>or 8 digits with a long address</td>

<td></td><td>ai iaioai&gt;. ..ao</td><td>or 12 bits usable in traffic communication networks</td>

<td> 01</td><td>S8S7S6S5S4S3S2S1S0S2S1S0</td><td>8 sources plus 9 or 30 unused bits</td>

<td> 10</td><td>s_lSoR_ABOUTN₅N4N3N₂N₁N_aboutS2S₁S.₍₎</td><td>8 sources, 0-63 message number, message recovery flag, and 2 or 23 unused backup message type bits</td>

The VOV1V2 bits are used to specify the vector type, such as digital, tone only, etc. When the VOV1V2 bits are set to the value corresponding to a given type, such as short message / tone-only, it means that the 12 bits of dO-dll define the service area, flags traffic separation and network multiplier. For example, a0-a4 define a service area (32 possible), a5-a8 are traffic separation flags, and a9-a1 1 are network multiplier bits. Network multiplier bits allow 8 x 4096 more unique NIDs to be used.

In some circumstances, when a network address has a system message attached to it, the 12 bits defining additional NRI information reside in the message frame, and the vector also acts as a vector indicating the system message in the message frame, where the 12 previously described bits also reside.

In each service field, the transmitted signal includes NRI information associated with that service field. The structure of the location of the various pieces of NRI information in the transmission protocol is shown in Figs. 12 and 13. In the receiver that moves through the network, a frequency search list is stored which lists the frequencies at which it is highly probable that an NRI match will be obtained. . The location structure in Fig. 13 uses a prediction method of where the NRI information can be found. Whenever no match can be obtained from the stored search list, the receiver searches the entire band of its synthesizer. When the receiver finds field 0 on a specific frequency, the candidate frequency is quickly qualified or disqualified.

Figure 11 illustrates an SSID information arrangement structure in a four-phase (time division multiplex) extension of the field structure shown in Figure 1. When a single-phase system is used, all information in phases A, B, C, and D is collected in one phase A. When a two-phase system is used, then the two phases A and B are put together to form one phase and phases C and D are put together to form the second phase.

180 100

As is known in the art, a multiple time division system with multiple A, B, C and D phases provides the service provider with certain advantages in handling communications. A receiver capable of decoding information from only one phase is assigned to a specific phase by the service provider at the time of station initiation. Some receivers are capable of decoding information from one phase at a time, but may be switched to another phase. In such a case, the service provider may initially allocate the receiver to a specific phase, but may use the system messages described above to inform the receiver from time to time that messages will be transmitted in a different phase. Finally, some receivers are capable of multi-phase decoding and thus, as shown in Fig. 11, can find the allocated field faster than a single phase receiver.

To communicate in motion, all channels (frequencies) in the system that are capable of communicating in motion must broadcast a specified number of fields in their entirety. All communication channels in motion are required to transmit in full a first predetermined number of fields, e.g., fields 0-7, with field 0 being allocated a 4 minute timestamp. In this example it has been determined that fields 0-3 must be present and that these fields contain the words LID LID1 and LID2 in the fields and phases as shown in Fig. 11. It should be understood that the invention is not limited to fields 0-3 and that any number of fields required to be transmitted may be selected. Fields 0-3 are an example of fields 0-N.

LID1 and LID2 are displaced by one field through the phases, so that the receiver allocated to the phase is able to determine the presence of its desired SSID in the shortest search time on each channel and to balance or spread information among the phases.

The positioning structure shown in Fig. 11 predicts a known time position to allow for quick processing of the candidate frequencies as the receiver moves. If a move decision could only be made on the basis of LID information, then four channels (fields 0-3) could be processed every 4 minutes. Since the 0-3 fields must be present, a quick wideband scan is enabled by using symbolic speed detection to identify channels suitable for displacement. LID2 information is transmitted for each phase only once per cycle, and LID1 information is transmitted every four fields at a time in each phase (at least in fields 0-7).

For systems using only SSID information to coordinate movement between zones in a coverage area (service area) (no NRI for movement across the entire network), four fields (fields 0-3) are taken as mandatory or desirable. In that case, each transmitted field must carry a block information word 000, and mandatory fields 0, 1, 2 and 3 are needed to carry both words 000 and 111 of block information. Displacement handling channels are identified at the same mandatory field time. During the rest of the cycle, each received field is examined and eliminated if the SSID information does not match. However, missing a protocol in any field other than field 0, 1, 2 or 3 cannot be used to disqualify a channel. During the quick band search procedure, the paging receiver may search for a signal in the protocol in fields 4-127, and if it detects a signal in that protocol, it examines blockinformation word 000. If there is no match, the channel is eliminated. Those channels identified by such a quick scan process during mandatory fields that could not be detected in fields 4-127 will be searched in field 0, 1, 2 or 3 to determine the SSID information.

T refers to the possible presence of the three words of block information sent in field 0 on the rotating system to provide clock time and date information as described above. T-type block information words are sent on all 4, 2 or 1 phases depending on the speed of the system. It takes three cycles to fully refresh the receiver with the complete set of time and date information (5 updates every hour). The clock time and date instructions are optional, but when carried by the system, they are required to appear on a single dial rotary system each cycle. This format provides for a known position of the clock time (date) to enable the receiver to quickly process the candidate frequencies on the move. Se

180 100 the rotating quote may be changed so that the T block information word format 101 is used to transmit a message in a staging system as needed.

Regarding the provisions for positioning LID information, the present invention relates to a method of transmitting messages to a plurality of addressable receivers, the method comprising the steps of:

- dividing the area into multiple zones;

- assigning to each coverage area a coverage area identifier that includes at least a local area identifier and a zone identifier, such that the local area identifier is common throughout the coverage area, and the zone identifier is used to identify the zone within the coverage area;

- storing at the at least one subscriber message receiver in the at least one defined network a coverage area identifier assigned to the at least one defined coverage area;

generating a signal to transmit in each zone, the signal comprising at least one coverage area identifier corresponding to a certain zone within the coverage area, the signal comprising a plurality of consecutive time cycles each including a plurality of consecutive time slots, the coverage area identifier being located at a first predetermined number of signal timeslots; and

- broadcasting this signal in each zone.

Referring to Fig. 12, an NRI information siting architecture will be described which is useful in conjunction with coordination of movement across the entire network. All NRI information received in a channel must occur at least once in the first specified number of fields, e.g., fields 0-7. When sharing a channel, service providers that share that channel agree to follow their respective rules for locating NRI information in fields 0-7. This allows the paging receiver to operate without detecting the presence of more than one service provider on the channel. N1-N10 in Fig. 12 represent ten different NRI information.

All existing NRI information in a channel must appear at least once in fields 0-7. The NRI information must also appear in any of the 128 fields whose computation determines its appearance.

The expected or projected item of NRI information is defined by the following set of rules:

(a) each broadcast frequency or channel on the network is represented by a number in the range 0-7. M = integer modulo8 [kHz frequency / kHz channel spacing];

(b) N = Modulo8 of NID information (same at least 3 significant bits);

(c) C = cycle number (0-15); and (d) expected area = F = Modulo8 z [N + M + C].

Under these rules, it is possible to search for 8 consecutive frequencies for the same NRI information in 15s (8th field) at the beginning of each 4-minute period. The phase chosen to carry the NRI information is the same phase that carries the LID information. It also causes the NRI information to move one field each cycle, avoiding possible shadow problems if the receiver is positioned where the two systems overlap. This positioning sequence has a lower NRI burden in cases where the channel carries less than 16 NRIs.

Generally, the NRI information positioning rules require that the NRI information be placed in one of the first predetermined number of fields and the predicted field position is determined using a modulo I arithmetic calculation based on transmit frequency, the least significant three bits of the NID portion of the NRI information, and the cycle number (0-15) .

Figure 13 shows an example where 10 NRI information, represented by numbers 1-10, is carried on a mixed-traffic or no-traffic channel across field 7.

The following is an example of how the paging receiver predicts the expected field.

180 100

Network ID (NID information stored in paging receiver code) = 2.008.123 (same result if via air is used).

The frequency to be checked 885.375, 125 kHz (not necessarily the actual frequency, but only used in this example).

The channel spacing in this radio frequency band = 25 kHz.

Current FLEX cycle number = 13.

M = channel number.

885,375.125 / 25 = 35,415.005 total part = 35,415.

Modulo 8 (35,415) = 7.

M = 7.

N network address number.

Modulo 8 (2.008.123) = 3.

N = 3.

C cycle number Mod 8 = Modulo 8 (13) = 5.

The expected field F = Modulo 8 (7 + 3 + 5) = Mod 8 (15) = 7.

The paging receiver therefore expects its NID information to appear on this channel in field 7 during the 13th cycle. It will also appear in those fields with Modulo 8 (field number) = 7, if they are transmitted. To determine which field beyond the first N fields there is NRI information, the location of the NRI in the first 8 fields is known and its location is changed in subsequent cycles (or shifted one field higher). The expected field position can be estimated in any subsequent cycle based on the known position in the previous cycle.

The receiver determines which cycle is transmitted when the channel is set and the network bit setting is determined. Based on the field information word in the field, the receiver determines the number of the current received cycle as explained above with reference to Fig. 4. The expected field calculation is performed on the current cycle and the following cycles bearing in mind that if the expected field is known in one cycle, then is shifted by one field in subsequent cycles. Thereby, the expected field position outside the first eight fields can also be determined such that the receiver can locate and decode NRI information outside the mandatory fields 0-7.

In summary according to one aspect, the present invention relates to a method of transmitting messages to a plurality of addressable receivers, the method comprising the steps of:

- dividing the network into a plurality of service areas, each of which comprises at least one zone;

assigning each network a displacement identifier in the network that includes at least the network identifier and the service area identifier, such that the network identifier is common throughout the network, and the service area identifier is used to identify the service area within the network;

- storing at the at least one subscriber message receiver in the at least one defined network a network movement identifier associated with the at least one defined network;

generating a signal to transmit in each zone, the signal including at least one network movement identifier corresponding to the network which includes the service area corresponding to this zone, the signal having a plurality of consecutive time cycles and each time cycle having a plurality of consecutive time slots , the network movement identifier is located at a predetermined time slot according to an algebraic relationship between the signal transmission frequency, the time cycle number and a binary representation of at least a portion of the network movement identifier; and

- broadcasting this signal in each zone.

The LID information location rules and the NRI information location rules are implemented together in certain zones. The present invention therefore further relates to a method

180 100 sending messages to a plurality of addressable receivers, the method comprising the steps of:

dividing the network into a plurality of service areas, each of which includes at least one coverage area, and each coverage area includes at least one zone;

assigning each network a displacement identifier in the network that includes at least a network identifier and a service area identifier, such that the network identifier is common throughout the network, and the service area identifier is used to identify the service area within the network;

- assigning to each coverage area a coverage area identifier that includes at least a local area identifier and a zone identifier, such that the local area identifier is common throughout the coverage area, and the zone identifier is used to identify the zone within the coverage area;

- storing at the at least one message subscriber in the at least one defined network a movement identifier in the defined network associated with the at least one defined network;

- storing at at least one subscriber receiver the messages in the at least one defined coverage area at least one specific coverage area identifier associated with the at least one defined coverage area;

generating a signal to transmit in each zone, the signal comprising at least one network movement identifier corresponding to the network which includes a service area corresponding to the given zone, the signal further comprising a coverage area identifier corresponding to that coverage area which includes the given zone, and furthermore, the signal includes a plurality of consecutive time cycles, each of which includes a plurality of consecutive time slots, the network movement identifier is located at a predetermined time slot according to an algebraic relationship between the signal transmission frequency, the time cycle number and a binary representation of at least a portion of the network movement identifier; and the coverage area identifier is located in at least a first predetermined number of time slots of each time cycle; and

- broadcasting this signal in each zone.

Figure 14 shows a field shift mechanism that allows the receiver to search for frequencies in each field that is shifted from its parent field as shown. The field shift method is useful in situations where the receiver covers an area where there are two or more possible matching frequencies in the same coverage area. In order to achieve matching at each of the possible frequencies, for each frequency whose coverage is desired, a field is selected in which the receiver can match the SSID information differently from the fields for the other frequencies. For example, as shown in Fig. 14, the field selected for each frequency is broken by one field. Other fields may also be selected. Consequently, the receiver is able to select all of the SSID information as each is assigned to a different field in the cycle.

Referring to Fig. 15, a procedure for decoding a message by a mobile receiver will be described. To begin with, it should be understood that there are many different receivers that can move around in accordance with the present invention, including single-frequency receivers and synthesized frequency receivers, that can tune to any frequency within a particular band. Moreover, both such receivers can be fixed-phase, alternating-phase or multiphase receivers.

Regardless of the receiver type, when entering a new area where the receiver still has to align with the signal transmitted according to the established protocol, it is likely that the receiver has an approximation of the occurrence of field 0 at a certain frequency since the last session of receiving the message. The accuracy of this approximation is dependent on the crystal oscillator in the receiver.

In step 300, the receiver tries to detect energy in the protocol at the last frequency it was working on. When the receiver has an SSID subscription, the procedure is on the right

180 100 page flowchart of operation. When the receiver is subscribed to network coverage, the procedure is on the left side of the operation flowchart.

In step 310, after finding field 0 in the cycle, the receiver can detect and compare the SSID information encoded in the transmitted signal with its stored SSID information. This process is performed according to the splicing rules described in connection with Fig. 11. When a match is found, as indicated in step 320, the receiver may locate its allocated field to decode messages addressed to it in step 330.

However, if the SSID information in the broadcast signal does not match the SSID information stored in the receiver (calculation for the current frequency of the receiver), then in step 340 the receiver switches to a different frequency if it is able to do so. When the receiver is a receiver of one frequency, it cannot tune to another frequency and will enter the gaps and / or optionally, a message is displayed on the receiver's display indicating its inability to receive messages at the current location of the receiver. When the receiver has only the NRI information stored therein, then from step 300 the procedure proceeds to step 350 and searches for a match of the NRI information taking into account the NRI positioning rules of Figs. 12 or 13. If a match is found, as noted in step 360, the receiver locates its allocated field and decodes the addressed messages in step 370.

However, in case no match is found in step 360, then in step 380 the receiver tunes to a different frequency based on the last list of frequencies on which matches have previously been found. If there is no such list in the receiver, then the receiver begins searching for its band to find energy in the protocol and the process is repeated from step 300.

When a receiver of one frequency is subscribed to network coverage, then if no match is found in step 350, the receiver optionally displays a message that the user has out of subscription, that the receiver is not functioning properly, or that the service provider is not transmitting information on that frequency. The break time begins and the process is repeated a little later to try to find a match for the NRI information.

An example of a Search List is shown below. Typically the first entry in this list is the last frequency and associated SSID or NRI information that the receiver was set to. The list then contains the SSID information and finally the NRI information along with the assigned frequency. The receiver then tries to align to the last frequency and assigned SSID or NRI information on which it received the messages, and then goes through the SSID information and finally the NRI information.

<td>FREQUENCY</td><td>SSID</td><td>NRI</td>

<td>Frequency 1</td><td> -</td><td>NID1</td>

<td>Frequency 2</td><td>SSID2</td><td></td>

<td>Frequency 5</td><td>SSID3</td><td>NID1</td>

<td>Frequency 3</td><td> -</td><td>NID1</td>

<td>Frequency 4</td><td> -</td><td>NID1</td>

<td>Frequency N</td><td>SSIDN</td><td>NID1</td>

Figure 16 illustrates an exemplary electrical block diagram of a receiver 400, and more particularly, a selective call receiver in accordance with the present invention. The transmitted coded message signals are received by an antenna 402 which is connected to input 403 of receiving part 404. Receiving part 404 is preferably a frequency modulation receiver. The received coded message signals are processed by the receiving portion 404 in a known manner and are outputted to output 405 as a stream of binary information. Output 405 is coupled to I / O port 406 of microcomputer 408. Receiving portion 404 optionally includes a Received Signal Strength Indicator 438 (RSSI) which is also coupled to I / O port 406 of microprocessor 408.

A microcomputer 408, such as a Motorola MC68HC05 series microcomputer, for example, performs a variety of functions, including decoding binary information.

180 100

The microcomputer 408 includes a central processor 410, an oscillator 412, a clock 413, a random access (RAM) memory 416, a non-volatile memory 418 (ROM), and an audio alarm generator 420. A central processor 410 controls the operation of receiver 400 and processes the received coded message signals. Oscillator 412 produces a clock signal necessary for the operation of central processor 410 and a reference clock signal for clock 414. Oscillator 414 is controlled by a quartz crystal, not shown in the diagram. The allocated transmission slot and channel identification information and paging receiver addresses are stored in coding plug 422 which is a programmable non-volatile memory such as an electrically erasable programmable permanent memory (EPROM). Moreover, SSID information and NRI information are also stored in this code plug 422. Random access memory 416 is for storing coding pin information when receiver 400 is turned on and for storing received messages. The persistent memory 418 contains the persistent software that controls the operation of the microcomputer. This fixed software includes programs such as decoding control of forward slot identification information, channel identification information, receiver address, receiver search frequency lists, NRI information, SSID information, and other receiver functions. The alarm generator 420 produces an audible alarm signal upon receipt of a message.

When receiver 400 is turned on, microcomputer 408 acts as a timing unit, allowing receiver 400 to synchronize with the allocated forward slot after the receiver detects information in field 0 and synchronizes with the transmitted signal. The microcomputer 408 also acts as a decoder to decode channel identification information, LID information, NID information, and paging address information. Microcomputer 408 in conjunction with frequency synthesizer 424 acts as a channel selection unit 426 used to control scan at receiver 400. Microcomputer 408 in conjunction with power switch 428 performs a battery saving function of receiver 400.

Figure 17 illustrates an example of transmitting station 500 used in the present invention. Transmitting station 500 includes paging terminal 502 used to input messages originating from the home area or local area to the receiver, as indicated at 504, or messages to a receiver that moves outside its local area, as indicated by 506. Messages for a roaming receiver that originate outside of the coverage area corresponding to the home or local area of ​​the receiver are forwarded to paging terminal 502 via fixed logic coupled to the paging terminal in the home or local area, e.g., via a dialed or hardwired telephone line or via device with an RF signal, such as a satellite receiver.

The messages loaded into paging terminal 502 are processed to be transmitted to the format or transmission protocol described above and in the above-mentioned patent or other suitable transmission protocol. These messages are queued according to the field to which the receiver is assigned. The output of the paging terminal is coupled to an RF transmitter 508 to transmit a signal via antenna 510. It should be appreciated that paging terminal 502 optionally controls more than one transmitter, as in a large area simultaneous broadcast system, and furthermore, the synchronization of the multiple transmitters in the simultaneous broadcast system is provided.

In addition, to ensure global synchronization of the transmitters with field 0 as described above, timing module 512 is coupled to paging terminal 502. This timing module includes a global positioning system (GPS) receiver 514 and timing module 516 which together enable paging terminal 502 determining the exact occurrence of field 0. Instead of the GPS receiver 514, suitable monitoring devices monitor another time reference signal.

180 100

<td>1 2 34567 ....................... 21 ....... 31 32 INFORMATION xq χι X2 X3 CQ C1 C2 C3 &lt;0 &lt;1 &lt;2 &lt;3 U &lt;5 &lt;6 »0 · Ό &lt;0 U this pppppppppp [</td><td>PARITY</td><td>CK</td>

001111000011110000001

FIG. 4

<td>1 2 3 4 5 6 7 ....................... 21 ....... 31 32 INFORMATION xq X1 X2 ^x3 PO Pi P2 P3 ao aj vq vi vg vg V4 75 co c &lt;mo mi mg pppppf</td><td>PARITY</td><td>CK</td>

010101010100111110011

FIG. 5

<td>1 2 3 4 5 6 7 ....................... 21 ....... 31 32 INFORMATION xq ^χ1 X2 X3 ^f0 fi &lt;2 ^s0 ^S.1 S2 835435 36 sy sg sgsjosn sigsiapppppp</td><td>PARITY</td><td>CK</td>

110110010100111110011

FIG. 6

180 100

<img file="PL180100B1_D0001.tif" />

<td>SSID1</td><td>SS1D2</td>

<td>ZONE 1</td><td>ZONE 2</td>

<td>SSID3</td><td>SSID4</td>

<td>ZONE 3</td><td>ZONE 4</td>

100

FIG. 7

<img file="PL180100B1_D0002.tif" />

<img file="PL180100B1_D0003.tif" />

<img file="PL180100B1_D0004.tif" />

<img file="PL180100B1_D0005.tif" />

NETWORK

FIG. 8

180 100

<img file="PL180100B1_D0006.tif" />

<img file="PL180100B1_D0007.tif" />

180 100

FIELD

AND

B

C.

D

<td> 0</td><td>LID1 T UD2</td><td>T.</td><td>T.</td><td>T.</td>

<td> 1</td><td></td><td>LID1 LID2</td><td></td><td></td>

<td> 2</td><td></td><td></td><td>L1D1 LID2</td><td></td>

<td> 3</td><td></td><td></td><td></td><td>L1D1 LID2</td>

<td> 4</td><td>L) D1</td><td></td><td></td><td></td>

<td> 5</td><td></td><td>LID1</td><td></td><td></td>

<td> 6</td><td></td><td></td><td>L1D1</td><td></td>

<td> 7</td><td></td><td></td><td></td><td>LID1</td>

<td> 8</td><td>LID1</td><td></td><td></td><td></td>

<td> 9</td><td></td><td>LID1</td><td></td><td></td>

<td> 10</td><td></td><td></td><td>LID1</td><td></td>

<td> 11</td><td></td><td></td><td></td><td>LID1</td>

<td> 12</td><td>L1D1</td><td></td><td></td><td></td>

<td> 13</td><td></td><td>LID1</td><td></td><td></td>

<td> 14</td><td></td><td></td><td>LID1</td><td></td>

<td> 15</td><td></td><td></td><td></td><td>LID1</td>

<td> 16</td><td>LID1</td><td></td><td></td><td></td>

<td> 17</td><td></td><td>LID1</td><td></td><td></td>

<td> 18</td><td></td><td></td><td>LID1</td><td></td>

<td> 19</td><td></td><td></td><td></td><td>LID1</td>

<td> 20</td><td>LID1</td><td></td><td></td><td></td>

<td>• about 127</td><td></td><td></td><td></td><td>UD1</td>

FIG. 11

180 100

FIELD

B

D

<td> 0</td><td>LID1 __ LlD2ęN1J</td><td>T. T2</td><td>T1 T2</td><td>T1 T2</td>

<td> 1</td><td></td><td>L1D1 _._χLID2 (N2 ^</td><td></td><td></td>

<td> 2</td><td></td><td></td><td>L1D1 ___. LID2 (N3</td><td></td>

<td> 3</td><td></td><td></td><td></td><td>LID1 LIDJ ^ N ^</td>

<td> 4</td><td>UD1 __ (Ni)</td><td></td><td></td><td></td>

<td> 5</td><td></td><td>LID1 ___ (N6</td><td></td><td></td>

<td> 6</td><td></td><td></td><td>LICH _ &lt;N7</td><td></td>

<td> 7</td><td></td><td></td><td></td><td>LID1 __ (N8)</td>

<td> 8</td><td>L1D1 __ (Ν &lt;Γ</td><td></td><td></td><td></td>

<td> 9</td><td></td><td>LID1 ___ "(n10</td><td></td><td></td>

<td> 10</td><td></td><td></td><td>UD1 _ (NI)</td><td></td>

<td> 11</td><td></td><td></td><td></td><td>LID1 ___ &lt;N2)</td>

<td> 12</td><td>LID1 (Eg</td><td></td><td></td><td></td>

<td> 13</td><td></td><td>UD1 __ (nT¹</td><td></td><td></td>

<td> 14</td><td></td><td></td><td>L1D1 __ (N5)</td><td></td>

<td> 15</td><td></td><td></td><td></td><td>LID1 __ (N6)</td>

<td> 16</td><td>LID1 (N7</td><td></td><td></td><td></td>

<td> 17</td><td></td><td>LID1 ___ (Νβ)</td><td></td><td></td>

<td> 18</td><td></td><td></td><td>(N9)</td><td></td>

<td> 19</td><td></td><td></td><td></td><td>LID1 ____χ(no)</td>

<td>© about 127</td><td>L1D1 N1</td><td></td><td></td><td>LID1</td>

FIG. 12

180 100

FIELD

AND

D

<td> 0</td><td>LID1 LID2 N1</td><td>TT</td><td>T.</td><td>T.</td>

<td> 1</td><td></td><td>UD1 L1D2</td><td></td><td></td>

<td> 2</td><td></td><td></td><td>LID1 LID2</td><td></td>

<td> 3</td><td></td><td></td><td></td><td>LID1 LID2 N4</td>

<td> 4</td><td>LID1 N5</td><td></td><td></td><td></td>

<td> 5</td><td></td><td>UD1 N7 N6</td><td></td><td></td>

<td> 6</td><td></td><td></td><td>LID1</td><td></td>

<td> 7</td><td></td><td></td><td></td><td>UD1 N8</td>

<td> 8</td><td>UD1 N9</td><td></td><td></td><td></td>

<td> 9</td><td></td><td>LID1 N10</td><td></td><td></td>

<td> 10</td><td></td><td></td><td>LID1</td><td></td>

<td> 11</td><td></td><td></td><td></td><td>LID1</td>

<td> 12</td><td>LID1</td><td></td><td></td><td></td>

<td> 13</td><td></td><td>LID1 N2</td><td></td><td></td>

<td> 14</td><td></td><td></td><td>LID1</td><td></td>

<td> 15</td><td></td><td></td><td></td><td>LID1 N3</td>

<td> 16</td><td>LID1</td><td></td><td></td><td></td>

<td> 17</td><td></td><td>LID1</td><td></td><td></td>

<td> 18</td><td></td><td></td><td>LID1</td><td></td>

<td> 19</td><td></td><td></td><td></td><td>LID1</td>

<td> •</td><td>L1D1</td><td></td><td></td><td></td>

<td> •</td><td rowspan="4"></td><td rowspan="4"></td><td rowspan="4"></td><td rowspan="4">LID1</td>

<td> •</td>

<td> •</td>

<td> 127</td>

FIG. 13

SS1D1 LOCAL

SS1D2 SSID3 '

SS1D4

<img file="PL180100B1_D0008.tif" />

FIG. 14

180 100

<img file="PL180100B1_D0009.tif" />

FIG. 15

180 100

ANTENNA

<img file="PL180100B1_D0010.tif" />

<img file="PL180100B1_D0011.tif" />

180 100

<img file="PL180100B1_D0012.tif" />

<img file="PL180100B1_D0013.tif" />

gj

Publishing Department of the UP RP. Circulation of 70 copies. Price PLN 4.00.