CA2194546A1

CA2194546A1 - A method and means for frequency hopping in a radio communication system

Info

Publication number: CA2194546A1
Application number: CA002194546A
Authority: CA
Inventors: Claes Hakan Andersson; Knut Magnus Almgren
Original assignee: Individual
Current assignee: Telefonaktiebolaget LM Ericsson AB
Priority date: 1994-07-15
Filing date: 1995-07-13
Publication date: 1996-02-01
Also published as: BR9508411A; AU698222B2; FI970144A; SE9402492D0; WO1996002979A2; FI970145A; SE9402492L; DE69525343D1; DE69525343T2; FI970144A0; FI970145A0; US6240125B1; AU2996495A; EP0771493B1; JPH10504149A; JPH10504148A; SE503893C2; EP0771493A2; CN1092869C; FI114124B

Abstract

Frequency hopping and hops between time-divided channels (K1, K2, ..) is carried out in a mobile telecommunications system. Hop sequences are established for individual connections for hops between the channels, thereby improving utilization of the channels in the system. Interference (I) is measured on the channels (K1, K2, ..) for individual connections between a base station (BS1) and a plurality of mobile stations. The connections are bidirectional, having an uplink and a downlink. The measured interference values of the uplink and the downlink respectively are stored in an interference list (IL) for each of the connections. The drawing shows three interference lists (IL1up-IL3up) in the uplink, including channel numbers (K1, K2, ..) and the measured interference values (I1, I2, ..). The interference values are converted to weight values (0.1; 0.3; ..) in a conversion circuit (I/Wup), and the weight values are then stored in weight lists (WL1up-WL3up).
The weight values are analyzed in an allocation circuit (W/Hup), which allocates channels to individual hop sequence lists (HL1up-HL3up). Each connection is allocated a respective hop sequence list. The hop sequence lists are sent to respective mobile stations, thereby providing the mobile stations with information as to which hop sequence list shall be used.

Description

~ W096/02980 I ~
~ ~4546 A METHOD AND MEANS FOR FREQUENCY HOPPING IN A RADIO
COMMUNICA~ION SYSTEM

TECHNICAL FIELD
The present invention relates to the field of radio communi-cations and then particularly to frequency hopping and hop between time-divided channels in a mobile telecommunications system. The invention includes a method in which hopsequences for hops between ~h~nn~l c are established for different connections, thereby enhancing channel utilization. Channel interference is used to construct the hopsequences. The invention also relates to an arrangement for carrying out the method.
TECHNICAL FIELD

Frequency hopping in radio communications systems is known to the art and, for instance, has been used in military contexts to escape tapping of transmissions. In this regard, communication is effected with hops between different frequencies at regular time intervals. The hopsequences are formed by pseudo-slump series that are known only to the transmitter and receiver.
_ In addition to hops between different frequencies, frequency hopping also refers to hops between different frequency/time slot combinations in a TDMA system. This latter should actually be named frequency/time slot combination hopping, but the collective term channel hopping is used in the following for practicaI convenience.

Channel hopping has also been used in radio communications systems for the purpose o~ reducing disturbances. The 3~ advantage afforded in this regard is that the energy in the system is distributed between the different channels. In this regard, a number of channels are allocated to one and the W096/02980 P~

same connection. As communication proceeds, the system causes the connections to hop between the rh~nn~l ~ in accordance with a given hop rule, for instance through the medium of a predetermined pseudo-slump series. When using a purely frequency hopping procedure, the disturba~ces are spread in the system because the centre frequency at which transmission takes place is changed on a number of occasions with each second. However, the level of dist~rh~nre in a radio communi-cations system becomes higher when this type of frequency hop is used than when using a purely frequency schedule. This is because when frequency hopping, the frequencies are not chosen in a relevant manner, but are instead chosen randomly.

U.S. Patent 4,716,573 teaches a-frequency hopping system in which the frequency hop is detrr~;nPd with the aid o~ random number generation. Different frequencies have different measured status values which decide whether or not a pseudo-randomly selected frequency shall be lncluded in the hopse-quence.
The German published specification DE 3415~32 Al teaches a frequency hopping system in which frequency hopping is effected pseudo-randomly. The frequencies used are monitored and excluded from further use when they no longer have an acceptable interference level.

U.S. Patent 4,998,2~0 describes a radio communications system which utilizes frequency hopping. The system includes a central control station which allocates frequencies for communication with several participating local radio sta-tions. The control station maintains an interference matrix which reflects the capacity requirement of the various radio stations and the interference on all connections.

U.~. Patent Application GB 2,261,141 A teaches a method which utilizes frequency hopping in a radio communications system.
The method involves monitoring the channels included in the W0 96102980 r~, _ S '~t hop sequence and replacing with new channels those channels that do not fulfil a quality criterion.

A general problem related to mobile telecommunications systems is that allocation of the bidirectional connections between base stations and mobile stations is effected without adequate channel selection. Attention is paid only to a few parameters, for instance only to the C/I value when deciding whether or not the connection is satisfactory. This has caused the system to allocate a channel which has good quality properties to a connection. The connection continues to use the allocated channel over the entire communication period, without taking into account the consequences of the allocation, for instance its disturbing influence on other 1~ connections or to uneven distribution of radio resources between different base stations. This has stopped the optimization of mobile t~ ications systems, for instance with regard to radio resources and with regard to disturbance effects on other connections. Examples of radio communications systems in which the aforesaid problem occurs are mobile telPnnr~~n;cations systems which use frequency division (FDMA), time division (TDMA), coding (CDMA) and so-called DECT systems.

SUMMARY OF THE l~v~nlll The invention is concerned with improving radio communica-tions systems which utilize channel hopping, and solves the problem of selecting the radiochannels between which the connection hops in a relevant fashion.

An object of the present invention is to provide a radio communications system which utilizes channel hopping such ~ that those n~nn~l C which have high channel quality for a given connection are used more o~ten than channels having lower channel quality for the same connection. Interference is a measurement of channel quality. According to the W096/02980 P~~

invention, other channel quality measurements may al50 be used, for instance the bit error rate, BER, or the quotient between useful and dLsturbing signal strengths, the so-called C/I value.
Another object of the invention is to optimize channel utilization in a radio communications system that ~uses frequency hopping.

Still a further object of the invention is to enable a radiochannel that has very high channel quality to be used for several connections in progress. Still another object is to enable a radiochannel that has very low channel quality to be used occasionally in the connections in progress.
Yet still another object of the invention is to provide orthogonality in a base station of a radio communications system. This means that two or more separate connections in one and the same base station will never use one and the same radio channels simultaneously.

Another ob~ect of the invention is to make new radio channels available to a connection in the process of communication, thereby improving connection quality, and to make other radio channels whose quality is too low unavailable.

These objects are achieved with a method in which separate radio ~h~nn~l ~ are allocate~ separate weight values in accordance with the respective measured channel qualities of the channels. Separate hopsequences are then forred for separate connections in accordance with the weight values allotted. The weight values are used to decide which channels shall be included in the hopsequences, and how often they shall appear. The connections then hop between the channels in accordance with the respective hopsequences formed. The invention also relates to an arrangement for carrying out the method.

w096/02980 r~ c~
~ ' 21 9454 According to the inventive method, the interference or some other quality measurement of the channels in a radio communi-cations system, for instance a mobile telecommunications system, is measured for separate connections between at least one first base station and a plurality of mobile stations.
The connections are generally bidirectional, having an uplink from a mobile station to a base station and a downlink from the base station to the mobile station. Channel quality, for instance interference, is measured with respect to uplink connections and with respect to downlink connections. The measured interference values are then stored in an interfer-ence list for each of the connections in the radio communica-tions system. Downlink interference is measured in respective mobile atations, while uplink interference is measured in the base station. The downlink interference values are sent to the base station, via a control channel.

The interference lists are converted to ~oLLe~ ding weight lists for each of the connections in both uplink and downlink in the base station. The weight lists are preferably normal-ized so that the sum of all weights in a weight list for one connection will equal the value 7 (one). The weight lists are then analyzed in an allocation circuit which allocates channels in a hop sequence list for each of the uplink and the downlink connections in accordance with the content of the weight lists. A channel which has a high weight value for a given connection will appear more often in corresponding hopsequence lists than a channel which has a lower weight value. The base station and the mobile stations both have access to the hopsequence lists, by virtue of said lists being copied from the base station to the respective mobile stations via a control channel. The hopsequence lists are finally used ~or channel hopping between channels in the hopsequence list generated for respective connections.
One advantage afforded by the invention is that a channel that has only low interference, i.e. a high-quality channel, W096l02980 can be used more often than a channel in which interference is high. This minimizes the propagation of disturbances in the system, while enabling the channel to be utili7ed more effectively. Another advantage is that the inventive channel hopping method is in~Lr, -ntal in spreading channels that have low and high interference respectively throughout the system in a systematic fashion. Stlll another aqvantage is that a channel which has such a high level of interference as to render the channel unusable on its own without employ-ing channel hopping can be used in a hop sequence now andthen while maintaining acceptable quality on the connection concerned. Still another advantage is that connections channels can be included and P~clll~P~ successively for~ the duration of a connection.
The invention will now be described in more detail with reference to a preferred exempli~ying P~hn~;r L thereof and also with reference to the accompanying drawings.

BRIEF DESCRIpTION OF T~E nRA~T~

Figure l is a perspective view of a cellular mobile telecom-munications system which includes base stations and mobile stations.
Figure 2-is a diagrammatic illustration of the TDMA princi-ple.

Figure 3 illustrates in perspective base stations and mobile stations in a traffic situation.

Figure 4a is a perspective view of uplink connections.

Figure 4b is a block diagram showing ~iffPrPnt lists for uplink connections in the mobile telecommunications system.

~ W096/02980 2 1 9 4 5 4 6 PC~/SE95~00~55 Figure 4c i5 a perspective illustration of downlink connec-tions.

Figure 4d is a block diagram showing different lists of ~wnlink connections in the mobile t~1el ;cations system.

Figures 5a and 5b are block diagrams showing an uplink and a downlink situation respectively.

Figure 6a is a block diagram which includes lists and a measuring receiver.

Figure 6b is a diagram which includes a conversion curve for converting interference to weight values, a block schematic which illustrates a n~rr-l;7ing circuit, and a block schemat-ic of a list for converting interference to weight values.

Figure 6c shows three diagrams illustrating three different conversion curves.
Figure 6d is a block schematic illustrating the measuring receiver in Figure 6a.

Figure ~ is a block schematic illustrating a compensating circuit. ==

Figure 8 is a block schematic illustrating a mean value former.

~igure 9a shows different interference lists in block form.

Figure 9b shows in block form an interference list divided into two groups.

Figures 9c and 9d are respective block diagrams of a hop-sohedule.

21 9fi546 ~

Pigure 10 is a block diagram of a conversion circuit.

Figure 11 is a flowsheet which illustrates a channel hopping method.
Pigure 12 is a ~lowsheet which illustrates a method of allocating rh~nn~l s to hop sequence lists.

BEST MODES OF CI~RYING OUT T~E INVENTION

Figure 1 illustrates a mobile telecommunications system PLMN
which includes a plurality of base stations, referenced generally BS, and mobile stations, referenced generaLly MS.
A fixed subscriber A in a public switched telephone network es~hl; sh~$ a bidirectional connection with the mobile station MSl for instance, via a local exchange LE, a central gateway mobile switching centre GMSC, a mobile switching centre MSC2, a base station controller BSC2 and finally via the base station BSl controlled by the base station control-ler BSC2_ The bidirectional connection thus also includes aradio connection between a base station BSl and the mobile station MS1, this connection being established by allotting appropriate radio channels thereto. Figure 1 also shows another fixed subscriber A2.
A bidirectional radio connection includes two links, an uplink for ~ tion from the mobile station to the base station, and a downlink for communication from the base station to the mobile station.

A channel is used for transmitting communication in one of the links, this channel comprising for instance in a TDMA
system a frequency/time slot combination. Other types of channels are also conceivable, for instance frequency in an PDMA system or code in a CDMA system.

Figure 2 shows channels in a TDMA system having three ~ W096/02980 2 1 ~ 4 5 4 6 ~ - ~

different time slots TS1, TS2 and T53. Three different frequencies fl, f~ and f3 are shown in the vertical direc-tion, while the time T is denoted on a horizontal axis. Each channel utilizes a specific frequency/time slot combination.
For instance, channel Kl utilizes the frequency/time slot combination fl/TS1, channel K2 utilizes the frequency/time slot combination fl/TS2, ana channel R5 utilizes the frequen-cy/time slot combination f2/T52. The number of available rh~nnPls is equal to the number of frequencies multiplied by the number of time slots. Each time slot has a given length, which in the European mobile telecommunications network GSM
is Tl=?) mS and in the American mobile telPr~mmnnications network D-AMPS is T1= ?? mS. Figure 2 also shows a frequen-cy/time slot combination f2/T52 in more detail. Among other things, tr~ncm;~si~n in a time slot includes a synchronizing signal SYNC, an information signal INF, which is the actual speech or data signal transmitted, and a control channel SACCH.

Pigure 3 illustrates a typical traffic situation in downlink.
The traffic situation shown in Figure 3 is slightly changed with regard to the traffic situation shown in Figure 1. In Figure 3, the mobile station MS2 has moved to the cell CELL1, and two further mobile stations MS4 and M55 have arrived in the cell CELL4. The mobile station MS1 and M52 in the cell CELL1 receive radio signals from the transmitting base station BSl on the rh~nn~l c Rl and K2 respectively. These channels are reused in the mobile ~ r~m~nn;cation5 system PLMN, so that the mobile stations MS4 and MS5 in a cell CELL4 receive radio signals on respective connections at a given time point on channels K1 and K2 respectively from a base station BS4. These radio signals sent from the base station BS4 also reach the mobile stations ~151 and M52 in the cell CELL1 and are there experienced as disturbing interferences I on the connections of mobile stations MS1 and M52. The mobile station MS2 perceives the disturbances as being slightly higher than does the mobile station MS1, since the 2~ 94546 mobile station MSl is located further from the base station BS4 than the mobile station MS2 According to the invention, with the intention of reducing the disturbing interferences, among other things, there is followed a channel-hopping procedure in which separate hopsequence lists HL are formed for separate connections, for instance for the connections between the base station BS1 and the mobile stations MS1 and MS2. Outlined briefly, this channel-hopping procedure is effected by first measuring the interference I on all rhAnn~l R of the radio communications system. Each channel having an associated measured interfer-ence value is then allocated a weight value W which is contingent on the measured interference value I. The weight values W are the basis on which hopsequence lists are formed for the separate connections in both the uplink and the downlink. The hopsequence lists are then used to hop between the various rhAnn~l R while communication is in process. Each of the connections is Al 1 ~rat~ a respective hopsequence list in both the uplink and the downlink, via all base stations BS in the system. In this WQy, there is obtained a channel-hopping ~c~du,~ in which channels that have the lowest interference with respect to a glven connection are used more often than channels which have a higher interference level.
It will be noted that interference is only one example of a parameter which will reflect the quality of a channel. It is obvious, and also lies within the scope of the invention, that other parameters which reflect channel quaIity may also be used, for instance the bit error rate BER, the ratio between useful ahd non-useful signal strengths C/I, or comoinations thereof.

Figure 4a is a perspective view of the three mobile stations MSl, MS2 and MS3, each of which sends information to the base station BS1 in uplink in the cell CELL1_ Ohannel hopping is utilized in the communication process, i.e. information is sent from respective mobile sections alternately via differ-~ WO 9610~980 2 1 9 4 ~ 4 6 r~

ent channels in accordance with respective hopsequence lists.In a TDMA system, this is achieved with the use of different frequency/time slot combinations.

The method by which the hopsequence lists are generated for the different connections will now be described with refer-ence to Figure 4b.

Figure 4b is a block diagram which illustrates three differ-ent interference lists ILlup, IL2Up and IL3Up in the uplink of three different connections between the mobile stations MS1, MS2 and MS3 respectively and the base station BSl in the cell CELL1 shown in Figure 4a. Each interference list IL includes two columns, of which the first column takes up channel numbers and the second column takes up the interference values I. The channel numbers and tha interference values belong together row-wise. The interference on a channel is normally comprised of disturbances from other mobile stations that transmit in other cells on the same or bordering frequencles. The interference I on the different channels is measured in the base station BS1 in a known manner, and the measured values are then delivered ~o respective interference lists, together with associated channel numbers as shown in ~ig. 4b. The higher the interference value of a channel, the more the channel is disturbed. Interference is measured in the receiver of the base station BS1, whereafter the inter-ference values of the various channels are stored in their respective interference lists.

The interference values I of the different channels are converted to a corresponding weight value W in a first conversion circuit IJWop. This conversion is effected in accordance with an algorithm which will be described in more detail with reference to Figures 6a-c, The weight values are then inserted into weight lists WL, such as to obtain a weight list for each connection. The weight lists WLl,p, WL2Up and WL3Ur for the three aforesaid connections are shown in W096/02980 P~

Pigure 4b. Each weight list WL includes two columns, o~ which the first column takes up channel numbers and the second column takes up the weight values W. The channel numbers and the weight values also fall together row-wise in this case.
In this embodiment, a high interference value I for a given channel implies that a corr~cpnn~ingly low weight value WO
is allocated to the channel. The weight values are also normalized, so that the sum of all weight values in each weight list will be equal to the value 1 (one), as described below with reference to Figures ~a-c. In the case of this embodiment, the interference lists IL and the weight lists WL have the same number of rows as the radio communications system has channels, e.g. lOO channels, although lists containing any desired number of rows can be used.
The weight values W of respective connections are analyzed in a first allocation circuit W/Hup which allocates cha~nels to a respective hopsequence list HLlup, HL2Up, HL3Up for :each connection. This allocation is effected so that a channel that has a high weight value will occur more often in the hopsequence lists HL1Up, HL2up, HL3Up than a channel that has a low weight value.

The hopsequence lists are configured so that a channel will not occur in two or more different hopsequence lists on one and the same row. This ensures that two or more connections will not use the same channel simultaneously within one and the same base station. The hopsequence lists are transferred to respective mobile stations, so that respective mobile stations obtain information relating to the hopsequence list to be used by that station. The hopsequence lists are transmitted from the base station to respective mobile stations via a control channel. A channel may appear in several positions on one and the same hopsequence list. The hopsequence lists are much longer than the interference lists and the weight lists. Por instance, the hopsequence lists may include lOO0 rows. ~ ~~

~ W096102s80 r~ o.
21 ~4546 Figure 4b shows the channels Kl-K4 with associated measured interference values I1-L4 in the interference list IllUp for the connection between the mobile station MS1 and the base station BS1 in uplink. The r~ ;n;ng rhAnn~lc in the list are not shown in Figure 4b. In the weight list WL1up, the interference values I1-I4 have been converted to a respective weight value 0.1, 0.3, 0.2 and 0. In the hopsequence list HL1up, the channels K1-K4 are shown included in a number which is contingent on their weight value. Since in this example channel X2 has the highest weight value, it occurs more often than the others. In this example, channel K4 has the weight value 0 and qoes not occur at all in the hopsequence HL1up.

It should be noted that the interference I measured by the 1~ base station is equal for the connections in the uplink, although this is not the case with regard to corresponding downlinks.

Pigure 4c illustrates the mobile stations in Figure 4a when 2D transmitting from the base station~BS1 to respective mobile stationS MS1-MS3, i.e. tr~nc~;cc;on in the downlinks. The base station BS1 sends information to respective mobile stations MS1, MS2 and MS3. Each of the connections uses a respective hopsequence list.
Figure 4d is a block schematic which includes interference lists ILldo~, IL2do~, IL3d~= for the downlinks of the three different connections between the base station BS1 and the respective mobile stations MS1, MS2, MS3. In this case, the interference ls measured in respective mobile stations ~IS1-MS3 and the measurement values are stored in a respective interference list. The interference in the downlinks consists of the disturbances of which respective mobile stations are aware on respective ~hAnnGlc. The disturbances originate, among other things, from base stations in other cells that transmit on the same frequency as the base station BS1 or on bordering freauencies. A channel which has a low interference -WO 96/02980 P~, IID~7_ C ~
5 4 ~ --value in the list ILldoyn can have a higher interference value in the list IL2doyn~ for instance. The interference lists are then transferred to the base station BSl, so that the base station obtains access to the interference list of each of the connections in downlink. The lists are transferred via the control channel SACCH, as indicated by a broken line between the interference list in the mobile ce~;n~C and the interference lists in the base station BSl.

A general desire is for the mobile stations in the mobile telecommunications system to have small dimensions and low energy consumption. An attempt is made to avoid requiring the mobile station to carry out calculations and measurements that require a high capacity, when these calculations and measurements can instead be carried out in the base stations BS for instance, or in some central unit in the system. For this reason, the interference lists ILldoyn~IL3do~ are sent to the base station BSl, because this station is better suited for converting the lists to weight lists and for allocating hopsequences. It will be understood, however, that conversion to weight lists and the allocation of hopsequences can be carried out in respective mobi~e stations MS1-MS3.

Similar to what has been described with reference to the uplink situation, the interference values I ar converted to weight values W in a second conversion circuit INdown in the base station BSl. The weight values are then inserted into weight lists WL. A weight list=WLldOwn, WL2doyD and WL3down is then obtained for each respective connection. The weight values of respective connections are then analyzed in a second allocation circuit W/Hdo~ which allocates channels to a respective hopsequence list HLld~, HL2doyn and HL3d~Wn for respective connections. The hopsequence lists are finally sent to respective mobile stations also in the downlink case, so that respective mobile stations will obtain information relating to the hopsequence list that they shall use. The transfer of the hopsequence lists from the base station to _ w096l0~980 F~l/~h~ e 21 945~6 respective mobile stations is effected via a control channel, for instance a slow assoclated control channel SACCH in the GS~ system.

Figure 4d shows the ~.h~nn~l s Kl-K4 and associated measured interference values I1-I4 in the interference list Illdo=D for the connection between the base station and the mobile station MS1 in downlink. The Pigure shows the channels in the interference list ILl~ in the mobile station MS1 and also the ~h~nn~l s in the interference list ILldoy~ in the base station BS1. As before mentioned, the interference list ILld,W= in the mobile station ~S1 is transferred to the base station BS1 via the control chanel SACCH. The re~aining ~h~nn~l.s in the list are not shown in Figure 4b. The inter-ferance values I1-I4 in the weight list WLldo=~ have been converted to a respective weight value 0.2, 0, 0.3 and 0.1.
The number of channels Kl-K4 shown in the hopsequence list HLldo~ is contingent on the weight value. Because the channel K3 in t_is case has the highest weight value, this channel will occur more often. The channel K2 which, in the present case, has the weight value 0 does not appear at all in the hopsequence list HLldo=D. The channel K1 appears more often than the channel K4, but not as often as the channel K3.

~he conversion circuits I/W and the allocation circuits W/H
may be common to both uplink and downlink.

Alternatively, the measured values of the interference I in the interference lists can be sorted in their order of nagnitude, so that the channel that has the lowest interfer-ence value will be at the top of the interference list. In the case of this embodiment, the interference list is divided into two parts.

Channels are stored in the hopsequence lists HL with a repetition frequency that depends on the weight values allocated to the channels, i.e. the number of times that a W096/02980 2 ~ 9 ~ 5 ~ 6 r~lla~ ~

channel appears in the list will depend on the weight value allotted to the channel.

It can be said in summary that the channel interference is measured for each cDnnection ln both the uplink and the downlink. An interference list IL, a weight list ~1 and a hopsequence list HL is found for each connection in both the uplink and the downlink. The base station BS1 and the respective mobile station MSl, M52 and M53 both have access to a hopsequence list for both=the uplink and the downlink of a connection, as described in more detail below.

Communication between respective mobile stations M51-1153 and the base station BSl is then effected by hopping between the channels in respective hopsequence lists in both uplink and downlink.

The aforedescribed channel hopping will be described in more detail with reference to Figure 5a and Figure 5b.
Pigure 5a is a functional block schematic which illustrates an uplink situation in which the mobile stations MSl, IIS2 and ~S3 send information to the base station BSl. Ihe block schematic includes the interference lists IL~p, the weight lists WLUp, the hopsequence lists HL~p, the conversion circuit I/W~p and the allocation circuit W/~p from Figure 4a. Figure 5a also shows radio transmitters S1H-53M for the mobile stations MSl-MS3, a receiver unit ME~ in the base station BS1, and sequence generators TG1-TG3, TG~. The base station BSl has access to all ~h~nn~l c in the radio communications system. Figure 5a is divided into two parts by a chain line, in order to show clearly what is included in the mobile stations MS1-MS3 and in the base station BS1 respectively.

Information signals C1H_C3H, for instance speech or data signals from the mobile stations MSl, MS2 and M53 respective-ly, are delivered:to a~respective channel multiplexor FlH-F3H

~ W096l0~980 2 ~ 9 4 5 ~ 6 which belongs to the respective radio transmitters S1H-53H.
The channel multiplexors successively point out the channels of the connection from the respective hopsequence lists HL~p in the mobile stations and pass on the information to the transmltters 51~-53y. The information signals C1H_C3H have then been fitted in respective ~h~nn~l c. Modulated radio signals Rl~p-R3~p are delivered on respective outputs of the transmitters S1H-53H and sent to the receiver unit MED in the base station BSl. It will be noted that the hop sequence lists include time discrete information, i.e. ~h~nn~
whereas the information signals C1H_C3M may be continuous.

The radio signals are received by a receiver M~ in the receiver unit M~ of the base station BS1. The signals are then forwarded from the receiver M~ and demodulated in respective connection channels selectors Dl~-D3~. The channel selectors point out a respective channel, for instance a frequency/time slot combination, in the hopsequence lists HL
in the base station BSl, and therewith contain information 2C as to which channel shall be demodulated and to which connection the channel belongs. The information signals C1H-C3H are regenerated on the output from the channel selectors, these signals then being passed to a receiving subscriber in the system. The connections between the system subscribers are maintained in this way, so that, for instance, the fixed subscriber Al in Figure 1 receives the information signal C1H
originating from the mobile station MS1.

As the information signals C1H_C3H are transferred via the 33 radio signals Rl=p-R3up, the connections hop between the different channels in accordance with the hopsequence lists HLl~p-HL3~p. The channel sectors DlB-D3~ in the base station BS1 and the channel multiplexors FlH-F3H in the mobile stations scan respective hopsequence lists HLl~p-HL3~p from beginning to end, this procedure then being repeated. This provides both the base station and the mobile stations with information as to which channels shall be used for respective W096/02980 2 ~ 9 4 ~ 4 6 r~

connections.

Respective mobile stations have copies of the hopsequence lists ir, the base station and the mobile stations scan respective hopsequence lists with a simultaneous start. It will be noted that there may be some time delay between the start of the scan, due to the propagation time between the mobile station and the base station.

The mobile stations receive information relating to the hopsequence lists via a control channel, for instance the control channel SACCH in the GSM system. Transmission of the hopsequence lists from the base station BSl to respective mobile stations is shown schematically in ~igure 5a, with a broken line between the hopsequence lists in the base station BSl and the hopsequence lists in the mobile stations MS1-MS3.

The sequence generator TGB in the base station sends to the sequence generators TGl-TG3 information as to when a hopse-quence is started, therewith ensuring that the hopsequencelists can be scanned synchronously. This trP~nsmission is also effected via the control channel S~CCH, as shown schematical-ly in Figure 5a with a broken line between the sequence generator TGB in the base station BSl and the sequence generators TG1-TG3 in respective mobile stations MSl-MS3.

The receiver unit MEB in the base station BSl also includes a measuring receiver MI~ which measures the interference on the various channels and delivers the measured interference values to respective interference lists. The interference lists are therewith updated regularly at close intervals. The weight lists are updated by virtue of regularly scanning the updated interference lists and conve~ting the lists to weight lists through the medium of the conversion circuit I/~up~ The hopsequence lists are updated regularly in turn, by reading-off or scanning the weight lists, the allocation circuit~/Hup therewith updatlng the hopsequence lists. ~hen the hopse-_ _ _ _ .

~ w096~02980 '21 q4 546 quence lists have been updated, copies of the lists are sentto respective mobile stations by transmitting the content of the lists via the control channel SACCH.

Figure 5b is a functional block diagram which illustrates a downlink situation. In principle, Figure 5b corresponds to Figure 5a but with the difference that the traffic situation is in downlink, i.e. the information is sent from the base station BSl to respective mobile stations MSl-MS3. Similar to the Figure 5a illustration, Figure 5b is divided into two parts by a chain line so as to separate the base station BSl from the mobile stations MSl-M53. As shown in Figure 5b, information signals Cl~-C3~ are sent from the base station BSl to a respective channel multiplexor Fl~-F3~ included in a transmitter unit SEN. The channel multiplexors point out the rh~nn~ls from respective hopsequence lists HLldow=-HL3do~ in an ordered sequence, wherein the information signals Cl~-C3~ are successively overlaid on the rh~nnPl~ pointed out from respective hopsequence lists. The modulated information signals are then forwarded to the transmitter 5~ which then delivers modulated radio signals Rldo~-R3do~n which are sent to respective receivers Ml~-M3~ in respective mobile stations MSl-I153. The received radio signals are forwarded from there to a respective channel selector Dl~-D3U. Each of the channel selecto~s points out a channel from respective hopsequence lists HLldow=-HL3down at the same time, copies of these lists being found in respective mobile stations. Respective radio signals are then demodulated in accordance with the channel indicated. The information signals Cld-C3~ are regenerated on the output of the channel selectors and thereafter reach respective subscribers of the mobile stations MSl-IIS3. It will be understood that all radio signals Rldow=-R3dow= can reach all rec,eivers ~ -M3~, but that only those channels which belong to the hopsequence list of a given mobile sta~;rn ~r~ demodulated by this mobile station. This will be described in more detail below.

W096/02980 2 ~ 9 4 5 4 6 r~ 7~ ~

~ach of the receivers MlH-M3~ also includes a measurement receiver which measures the interference on the various channels for respective connections. These measurement receivers are not shown in Figure 5b, but in principle correspond to the measuL~ receiver MI~ shown in Figure 5a. The interference lists IL in the mobile stations are updated, by regularly measuring interference values in the measurement receivers and sending new interference values to respective interference lists ILldo~~IL3~ Copies of the interference lists in the mobile stations are then sent to the base station via a control channel, for instance the control channel SACCH. This is shown in Figure ~b with a broken line between the interference lists in respective mobile stations MSl-MS3 and the interference lists in the base station BS1.

Communication on a connection in downlink between the base station BSl and one of the mobile stations MSl-~S3 is effected by using the hopsequence list that belongs to the connection. The mobile station and the base station reads the hopsequence list for said connection from beginning to end synchronously with one another, this procedure then being repeated cyclically. The sequence generator TGl-TG3 for the mobile statlons and the sequence generator TG~ for t:ae base station BS1 ensure that the hopsequence lists are scanned synchronously. The sequence generator TG~ in the base station sends information to the sequence generators TG1-TG3 in the mobile stations on the control channel SACCH when scanning of respective hopsequence lists shal~ commence.
Figure 6a shows the conversion circuit I/wNup and the interference lists in uplink ILlap-IL3Up and the weight lists WLlap-WL3Up from Figure 4b. The interference values I~p-I3~p received from the measuring receiver MI~ are stored in a separate interference list for each of the three different connections between the mobile stations MSl-~S3 and the base station BSl. The interference values of all channels of the w096l02980 r~ ~ ~ r -2~ 94546 radio communications system in uplink are measured for each of the connections. The interference list will thus have as many rows as the radio communications system has channels.
The conversion circuit I/W~p scans respective interference lists ILlUp-IL3~p and converts the interference values to corr~qp~nfling weight values W in accordance with an algorithm described below in conjunction with the description of Figure 6b. The weight values are stored in cur~e~onding weight lists WL1Up-wL3upl these lists also having as many rows as the radio communications system has separate channels. It will be noted that the interference lists and the weight lists need not necessarily have as many rows as the radio communi-cation system PL~N has separate channels.

Figure 6b shows an algorithm for converting or transforming the interference values to weight values. The weight values are also normalized, so that said values will lie between 0 (zero) and 1 (one). According to the illustrated conversion curve 61, a selected interference value I~ is converted to a corresponding non-normalized weight value U~. In the case of the present example, the curve 61 is monotonously decreasing, although it may other forms as shown in Figure 6c with three other curves 64, 65 and 66. According to curve 61, the interference values I~ are divided into a lower non-normal-i~ed weight value U~ the higher the magnitude of interferencevalue I~. The curve 61 may be stored in a memory register 62 as discrete Yalues with a plurality of rows according to Figure 6b. ~ach row in the memory register P~ tes an interference value I~ and a corresponding non-normalized weight value U~. The non-normalized weight values U~ are then normalized to normalized weight values W~ in a normaLizing circuit 63 included in the conversion circuit I/WUp. Each of the non-normalized weight values U~ for a connection are divided in the normalizing circuit 63 by the sum of all non-normalized weight values. For instance, the interferencevalues Ilup on the different channels for the connection between the mobile station MS1 and the base station ;3Sl in W096/02980 P~ 'C- ~
2~ 94546 uplink are converted to corresponding non-normalized welght values U~ by using the curve 61 and the memory register 62.
The non-normalized weight values are converted, or trans- -formed, in turn to normalized weight values W~. The weight value normalizing algorithm has the form: -hj = ~ Uj (1) ~-1 where N is the number of separate channels in the system.

The interference lists IL1~ -IL3do~n are transformed in downlink to weight list WLldo~n-WL3do~ in a ~ a~nding manner. The difference is that the interference is measured in measuring receivers included in the receivers l~ly~MiH in respective mobile stations MSl-MS3. Downlink interference lists are es~hlish~ in each of the mobile stations MSl-~IS3, copies of these lists being sent to the base station BSl, by transmitting the interference values vla the control channel SACCH. Conversion to weight values is then effected in the same manner as that described above with reference to Figures 6a and 6b.

Figure 6c shows the three different conversion curves 64-66.
The curve 64 is a straight line with negative slope, wherein the interference values I~ and the non-normalized weight values U~ are inversely proportional. The curve 65 is a type of stepped curve in which the interference values are divided into different intervals. Individual intervals are associated with individual weight values. The interference values are assigned the same weight value within a given interval. The curve 66 is, in Frinciple, a quarter-circle curve.

The interference lists are updated regularly, for instance ~ w096l02980 r~"_ ~lC-2 ~ ~4~4b each 20th millisecond. A temporary change of the interference values caused by temporary disturbances on the channels can result ln relatively large changes in the interference lists.
The interference values return to a more normal level when the temporary ~;ctnrh~nres disappear, wherein relatively large changes again occur in the interference lists. As shown in Figure 8, a mean value circuit 80 can be used to avoid temporary disturbances having an excessive effect on the interference lists. The interference values I are multiplied by a feedback constant ~ in a first multiplier 81. A signal I*~ is then delivered on the output of the multiplier 81 and received by an adder 82, which in turn produces a mean value of the interference Im. This mean value is ~ed back to the adder 82 via a delay circuit 84 and a second multiplier 83.
1~ The second multiplier 83 multiplies the delayed mean value of the interference by a factor 1-~. The mean value of the interference then becomes a sliding mean value of all earlier measured interference values. When the feedback constant ~
is relatively small, for instance 1/1000, there is obtained a sliding mean value where the temporarily measured interfer-ence value will only influence the mean value Im by a factor of 1/1000 The mean value clrcuit BQ can, in principle, be considered as a monopoly filter which filters the interfer-ence. The new interference values I are fed in with a frequency fm which is inversely proportional to the feedback constant ~.

The weight lists WL are updated regularly, by feeding the interference values into the conversion circuit I/W, which then delivers corresponding weight values. Updating is effected with the same frequency as that in which the interference is fed in, i.e. the frequency fm.

The hopsequence lists are updated in a corresponding manner, by feeding the weight values from the weight list WL into the allocation circuit W/H, which delivers channel numbers to the ~.opsequence lists in accordance with the updated weight W096/02980 rc.,~ c~
2~9~$46 values, as described in more detall below The interference lists IL and the weight lists WL have the same number of rows as the radio communications system has channels, e.g. 100.

The hopsequence lists have many more positions, for instance 1000 positions. The allocation circuit W~H positions channels in the hopsequence lists. A channel can appear in several positions in one and the same hopsequence list. The number of times that a channel appears in a hopsequence list will depend totally on the registered weight value of the channel.
A high weight value will mean that the channel will occur often in a hopsequence list. For instance, if a channel has been allocated a normalized weight value 1/2 for a given connection, this channel will, on average, reoccur on each alternate position in a corresponding hopsequence list. When a hopsequence list contains 1000 positions, this would mean that the channel occurs in 500 of these 1000 positions. A
0 weight position would mean that the channel is not found on the hop sequence list.

Figure 11 is a flowsheet which illustrates an inventive method for channel hopping in uplink, which coincides in principle with the method described above with reference to Figures 5a. The flowsheet shown in Figure 11 begins at stage 100 and continues with stage 102 in which the interference I is measured in the measuring receiver MI~. Measuring of the interference is carrled out for all channels=on separate connections between the mobile stations MS1-MS3 and the base station BS1. At stage 104, the measured interference values I are stored in interference lists ILl~p-IL3~p. Separate connections have separate interference lists. In stage 106, the interference values are converted to corresponding weight values W in the conversion circuit I~W~p, these weight values W being stored in weight lists Wl~p-W3~v in the next following stage 108 in the flowsheet. In stage 110, the weight values ~ wos6l02980 ~l ~4 5~ ~ r~

W are read into the allocation circuit W/HUp, which allocates ~h~nnel c to the respective connections between the mobile stations MSl-M53 and the base station BSl, these allocated ~h~nn~l c being stored in the hopsequence lists HLlup-HL3up in the next following stage 112 in the flowsheet. The method then continues in stage 114, wherein channel hopping is effected in accordance with the generated hopsequence lists.
The method is terminated in stage 116, and then regularly repeated. Figure 11 describes a method in uplink. The method in downlink is implemented in a similar way and will not therefore be dèscribed in detail.

The allocation circuit W/H arranges the ~h~nn~l c so that one and the same channel will not occur in one and the same position in one or more hopsequence lists. This avoids a channel collision, i.e. a situation in which two or more connections in one and the same cell use one and the same channel at the same time.

Figure 10 illustrates the allocation circuit W/HUp in Figure 4b in more detail. The normalized weight values in the hopsequence list Wlup are fed successively into a multiplier 91, which multiplies the weight ~alues by a factor M corre-sponding to the number of rows in the hopsequence list HLl=p.
In the case of this embodiment, the hopsequence list HLlUp includes lO00 rows. The product is rounded off to an even number and is forwarded to a random number generator 92 which generates an equal number of mutually different random numbers between l-M as the product between the inserted weight value and ~. The generated random numbers are then stored in a memory circuit 93, which in turn places the - channel belonging to the inserted weight value into the hopsequence list on those rows denoted by the generated random numbers. This procedure is then repeated for all weight values with associated rh~nnel c in the weight list WLlup. For instance, the weight value 0.1 for the channel Kl is read into the multiplier M, which then delivers the factor W096/02980 r~

0.1*1000=100 to the random number generator 92, which then generates 100 random numbers between l-1000. The generated random numbers are then inserted into the memory circuit 93, which places the channel Kl in 100 of the lO00 positions in the hopsequence list HL1Up. This procedure is then repeated for channel K2, for which 300 different random numbers are generated. These random numbers are ~l5n ~fferent from the earlier generated random numbers, so that no two channels will be allocated the same position in the hopsequence list HLl~p.

A respective hopsequence list is generated for the weight lists WL2U~ and WL3=p in a corresponding manner. The same channel number will sometimes reappear at certain correspond-lS ing positions in the various hopsequence lists. For instance,the channel K1 may be placed at position 15 in both the hopsequence list HLl~p and the hop sequence list HL2~p.
However, the risk of this happening is very small and if it should happen then any interruption in communication will be scarcely ~;~c~rn~hle~

Alternatively, the rh~nn~l~ can be sorted so that channel Kl is placed in the 100 first positions, the channel K2 is placed in the next following 300 positions, and so on. In order to avoid collision between channels in different hopsequence lists, the various channel groups in different hopsequence lists are displaced so that one and the same channel group will not overlap the same channel group in another hopsequence list.
Figure 12 is a flowsheet which illustrates the inventive method of allocating channels in uplink to hopsequence lists.
This method corresponds to the description of Pigure lO, where the allocation circuit W/HUp and its function are described. The method commences at stage 200 and continues to stage 202 in which the weight values W in the weight lists WLlUp-WL3Up are inserted into the multiplier 91. At stage 204, ~ W096l0~980 I~l/~r -~c 21 q~546 the inserted weight values are multiplied gradually by a factor M which is an integer and is equal to the nunber of rows in a hopsequence list. In the next following stage 206, the product M*W between the factor M and the different weight values is inserted gradually into the random number generator 32. The method then proceeds to stage 208, in which random numbers between l-M are generated. The random numbers are integers and the number of random numbers generated coincides with the factor M*W. The random numbers generated for the separate r~Ann~lc are then stored in the memory circuit 93 in stage 210. The random numbers stored in the memory circuit 93 are then used in stage 212 to store the channels in the hopsequence lists HLlup-HL3~p in positions given by the generated random numbers. The method is terminated at stage 214, but is repeated regularly. The method in downlink is equivalent and will not be described in detail.

Figure 6d illustrates how the interference values I are measured in the measuring receiver MI~ in uplink. The measuring receiver MI~ is included in the receiver unit ME~
in the base station BS1. The measuring receiver receives the interference values from the respective mobile stations and sorts out the interferences I1=p-I3=p from the respective mobile stations in a circuit 67. The measurement values are then sent to respective interference lists, where they are stored.

Relatively comprehensive calculations and signal processes are required when all connections are to be allocated unique hopsequence lists in both the uplink and the downlink. Ihese calculations can be reduced, by introducing common lists as described in more detail below. A simplified embodiment will be described in the following.

~In the base station BS1, the interference in uplink is neasured and registered for all channels to which the radio communications system PLMN has access, as earlier described wog6/02s80 2~ ~4546 with reference to Figure 5a. since the interference in uplink is the same for all connections within the cell CELLl, a common interference list IL4U~ can be used for the connections in uplink, in accordance with Figure 9a. For instance, the connection between the base station BS1 and the r,obile station NS1 shows the same interference in uplink as the connection between the base station BS1 and the mobile station MS2 in uplink. The base station BS1 has access to all channels in the system for which the interference in uplink is registered and arranged in the common interference list for uplink IL4~p.

The interference in downlink is registered in the sirplified erbodiment in accordance with the following. The interference is measured for the connections between the base station BS1 and the mobile stations MS1-MS3 in downlink, and is stored in the interference lists ILldown~IL3down in the same way as that described with reference to Figure 5b. There is then generated an interference list IL4down as a mean value of all the interference values in downlink. A mean value is generat-ed for each channel, such that, e.g., the interference value of channel K1 in the interference list IL4do~n consti~utes a third of the sum of the interference values for the channel K1 in the interference lists ILldown-IL3down~ Thus, there is one interference list for the uplink IL4~p and one interference list for the downlink IL4down~ There is_formed fro~ these lists a common interference list IL4D,~ which includes the highest of the interference values for each channel from one of the interference lists in the uplink IL4~p and the downlink IL4doWn, in accordance with Figure 9a.~ This thus results in a single interfercnce list IL~,~ containing the inte~ference values for the various channels for all connections in both uplink and downlink for the connections in the cell CELL1.

Ihe best channels are then selected from the list I~,~, i.e.
those channels that have the lowest interference values. The number of channels selected e~uals the number of con.ections ~ w09610~980 2 1 9 4 5 4 G P~

within the cell CELLl. This example includes three connec-tions, and consequently three channels are selected. The selected channels are then allocated an equally as large weight value and the sum of the weight values is equal to one. Thus, in the present example, the ~hAnnPlc are each allocated a weight value of l/3.: Channel hopping is now implemented ~or the t_ree different connections, such that each connection will hop between all of the selected channels with equally as great probability, for instance in accordance with a hopschedule HSl shown in Figure 9d. The hopschedule is repeated cyclically, such that the first connection will utilize the hopsequence 1, 2, 3, 1, 2, 3..., the second connection will utilize the hopsequence 3, 1, 2, 3, 1, 2...
and the third connection will utilize the hopsequence 2, 3, 1, 2, 3, 1..., as evident from Figure gd.

The hopschedule HSl shown in Figure 9d includes channels whose interference has been measured either in uplink or in downlink. When the interference of a channel is measured in uplink for instance, the channel of the connection in downlink is obtained by using the so-called duplex spacing.
When a channel in uplink is known, the system has knowledge of corresponding downlink ~hnnn~l~, since the channels in downlink and in uplink are separated by a spacing which is known to the system. In a FDMA system, this spacing is equal to a radiochannel spacing, whereas the spacing in a TDMA
system may either consist of a radio~h~nn~l spacing, a time-slot spacing or a combination thereof.

In an alternative ~r,ho~ir -nt, the base station BSl takes into account whether a channel is used in the cell CELLl when the interference is registered. This _5 explained below.

The interference on the connections in downlink is registered in accordance with the following description made with reference to ~igure 9b. The base station channels are divided into two groups A and B. The first group A comprises channels W096/02980 ~l 9 ~ S ~ 6 p ll~r~

used in the cell and the other group B comprises channels that are not used in the cell. The interference on the different channels in the first group is registered at regular time intervals in the mobile station for each of the connections, these registered interference values being sent to the base station via a control channel. The interfer-ence/signal strength SS is measured on the channels in the second group of channels not used in the base station.
Interference on the ~h~nnPls comprising the secDnd group B
is not measured as often as the interference on the channels in the first group A.

The interference in downlink may alternatively be registered with the aid of ~~-cnr;ng probes distributed in the cell and connected to the base station. This enables the interference situation in downlink to be mapped in a given area, even though no active mobile stations are present in this area.

The mobile station measures the interference in downlink on the channels in the first group A only when the station itself uses the channels~ Remaining time slots measure the signal strength of the channels in the other group B. In this way, less capacity is required for measuring, or determining, the interference situation in a cell.
Each of the mobile stations esf ~hl; ShP~ an interference list and reports to the base station BSl, via a control channel, the C/I value and the signal strength SS on those ~h~nn~l~
in the downlink used by the base station, i.e. the channels in the first group A, and the signal strength SS of ~those channels that are not used by the base station, i.e. the channels in the second group B.

Figure 7 shows how the interference values I are measured in the measuring receiver MIa in uplink. The measuring receiver MI~ is included in the receiver unit MEa in the base station BS1. ~hen a channel is occupied and the interference on the _ _ _, . .. _ _ _ . . _ . . ...

~ W0 96102980 1'~
2l 94546 .

channel is registered at the same time, the actual speech signal intended to be transmitted via said channel is also perceived as a disturbing signal. The measuring receiver then compensates for the interference caused by the speech signal, so that only the useless interference is registered. Assume that channel K1 is used in uplink between the mobile station MS1 and the base station BS1. Also assume that the interfer-ence in uplink on the channel Kl for the connection between the mobile station MS2 and the base station BS1 shall be registered. The measuring receiver will then subtract from the total registered interference values the signal strength SS from the speech signal that is transmitted from the mobile station MS2 to the base station BS1. This compensation may be effected in accordance with Figure 7. The measuring receiver MI~ includes a first registration circuit 71 which registers the bit error rate BER~ on, e.g., the channel K1 and converts this value to a corresponding C/I value. A
second registration circuit 72 registers the C/I value obtained from the first registration circuit 71 and registers the signal strength SS. The output of the second registration circuit 72 then delivers the interference value I~ of the channel. If the channel is occupied when registration takes place, compensation is thus made for the signal strength SS, while when the channel is unoccupied, the signal strength SS
is 0 (zero).

When updating the interference values, the fact that the interference on the channels belonging to the second group B is not measured as often as the interference on the channels belonging to the first group A is taken into account, by correcting the feedback constant ~ according to Figure 8.

Ihe best rh~nnrls are then selected from the common interfer-ence list IL~y and a hopschedule IS generated in the afore-described manner.

~ ¦ PCT Inte~n ~jOnaI APPIjCatjOn I ~ a J
21 q45~6 The above example includes three connections in the cell CEL~1. Naturally, the number of counections will be more in practice The hopschedule can be extended to apply to more connections, for instance seven connectionY. The number of channels selected will then be equal to the number of connections in the cell belonging to the base station BS1 concerned, i.e. 7 (seven) connections.
The selected nhAnn~l~ are then each allocated an equally as large weight value and arranged in a weight list, in accor-dance with the simplified embodiment. The weight values arenormalized no that the sum of the weight values will be one ~1) and each of the selected ~hAnn~lY will be allocated the weight 1/7. ~ =

Channel hopping is now utilized for the seven different connections, such that each connection hops between all of the selected nhAnn~lY with the same degree oi probability, for instance in accordance with a hopschedule HS2 shown in Figure 9c. The hopschedule HS2 is repeated cyclically in a manner corresponding to that described for the hopschedule HS1 with reference to Figure 9d.

In a further embodiment of the invention, only thone ~hAnn~7n whose measured interference lies beneath a given threshold value are used. This can cause certain channels to be blocked out and excluded from the hopsequence The ba6e stations of traditional mobile radio systems are permanent or fixed. However, the invention can also be applied in mo~ile radio systems where a baYe station may be mobile. Thi~ may be relevant when needing to increa_e communication capacity temporarily in different places.

A method comprising channel hopping according to the inven-tion results in that the use of the channels is optimized andthat interference on radio connections is decreased.

AMENDED SHEEr ¦ The Swedish Palent OtRce I P~-, / ~ ~ 7 ~ 5 i PCT l"~ ;io,-al Application ~ 171 1~9~
21 9454~
32a It will be understood ~hat the invention is not restricted to the aforedescribed and illustrated exemplifying em~odi-ments thereof, and that modifications can be made within the scope of the following Claims.

AMENDED SHEET

Claims

1. A method of channel hopping in a radio communications system (PLMN), wherein the system (PLMN) includes at least one first radio station (BS1) and one second radio station (MS1) between which radio connections can be established through the medium of radio channels (K1-K4), characterized by the steps of - measuring a channel quality parameter (I, C/I, BER) for separate radio channels;
- allocating weight values (W) of individual channels in accordance with the measured channel quality parameters (I, BER, C/I);
- generating hopsequences in accordance with the allocated weight values (W) such that the channels will reoccur in respective hopsequences a number of times contingent on the weight value (W) of respective channels; and - channel hopping between the channels in accordance with the generated hopsequences for respective connections for communication between the first radio station (BS1) and the said at least one second radio station (MS1).

2. A method according to Claim 1, characterized by arranging the allocated weight values (W) in a weight list (WL) in a falling order of magnitude.

3. A method according to Claim 2, characterized in that the weight values (W) determine the number of times that a channel will occur in the hopsequence (HL).

4, A method according to Claim 2 or 3, characterized by normalizing the weight values (W) so that the sum of the weight values (W) in a weight list (WL) will be one (1).

5. A method according to any one of Claims 1-4, characterized by a measuring receiver (MIB) which is adapted to measure the channel quality parameters (I, BER, C/I).

6. A method according to any one of Claims 1-5, characterized in that the channel quality parameter (I, BER, C/I) is a ratio between useful and disturbing signal strengths (C/I).

7. A method according to any one of Claims 1-5, characterized in that the channel quality parameter (I, BER, C/I) consists in the interference (I).

8. A method according to any one of Claims 1-5, characterized in that the channel quality parameter (I, BER, C/I) consists in the bit error rate (BER).

9. An arrangement for channel hopping in a radio communications system (PLMN), wherein the system (PLMN) includes at least one first radio station (BS1) and one second radio station (MS1) between which radio connections can be established through the medium of radio channels (K1-K4), characterized in that - the system includes a measuring receiver (MIB) for measuring a channel quality parameter (I, BER, C/I) for individual radio channels (K1-K4);
- the system includes a conversion circuit (I/W) for allocating weight values (W) to individual channels in accordance with the measured channel quality parameters (I, BER, C/I) and an allocation circuit (W/H) for generating hopsequences in accordance with the allotted weight values (W) in a manner such that the channels (K1-K4) will reoccur in respective hopsequences a number of times contingent on the weight value (W) of respective channels; and in that - the system is adapted to channel hop between the channels (K1-K4) in accordance with the hopsequences generated for respective connections, for communication between the first radio station (BS1) and the at least one second radio station (MS1).

10. An arrangement according to Claim 9, characterized in that the conversion circuit (I/W) and the allocation circuit (W/H) are adapted to allocate weight values (W) to individual channels in accordance with the measured channel quality parameters (I, BER, C/I), and to generate said hopsequences (HL) in accordance with the allotted weight values (W).

11. An arrangement according to Claim l0, characterized in that the allotted weight values (W) are arranged in a weight list (WL) in a falling order of magnitude.

12. An arrangement according to Claim 10 or Claim 11, characterized in that the weight values (W) determine how many times a channel will occur in the hopsequence (HL).

13. An arrangement according to Claim 10, 11 or 12, characterized by a normalizing circuit (63) which functions to normalize the weight values (W) so that the sum of the weight values in a weight list (WL) will equal one (1).

14. An arrangement according to any one of Claims 9-13, characterized in that the channel quality parameter (I, BER, C/I) consists in the ratio between useful and disturbing signal strength (C/I).

15. An arrangement according to any one of Claims 9-13, characterized in that the channel quality parameter (I, BER, C/I) consists in the interference (I).

16. An arrangement according to any one of Claims 9-13, characterized in that the channel quality parameter (I, BER, C/I) consists in the bit error rate (BER).