WO1997045966A1 - Channel hopping in a radio communications system - Google Patents

Channel hopping in a radio communications system Download PDF

Info

Publication number
WO1997045966A1
WO1997045966A1 PCT/SE1997/000846 SE9700846W WO9745966A1 WO 1997045966 A1 WO1997045966 A1 WO 1997045966A1 SE 9700846 W SE9700846 W SE 9700846W WO 9745966 A1 WO9745966 A1 WO 9745966A1
Authority
WO
WIPO (PCT)
Prior art keywords
channel
sequence
channels
hopping
connections
Prior art date
Application number
PCT/SE1997/000846
Other languages
English (en)
French (fr)
Inventor
Knut Magnus Almgren
Håkan Gunnar OLOFSSON
Yngve Bengt Persson
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Priority to JP09542180A priority Critical patent/JP2000512446A/ja
Priority to EP97926315A priority patent/EP0890224A1/en
Priority to BR9709392A priority patent/BR9709392A/pt
Priority to AU31107/97A priority patent/AU3110797A/en
Publication of WO1997045966A1 publication Critical patent/WO1997045966A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/06Hybrid resource partitioning, e.g. channel borrowing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69Spread spectrum techniques
    • H04B1/713Spread spectrum techniques using frequency hopping
    • H04B1/7143Arrangements for generation of hop patterns
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69Spread spectrum techniques
    • H04B1/713Spread spectrum techniques using frequency hopping
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria

Definitions

  • the present invention relates to the field of radio communications, and then particularly to a method of channel hopping between different channels in a radio communications system.
  • the invention also relates to apparatus in a radio communications system for implementing the method.
  • the proposed method can be applied with frequency-divided and time-divided systems, such as FDMA and TDMA systems, and also in CDMA systems.
  • channel hopping is used in this document as a collective term for making hops between different information transmission channels, such as hops solely between frequencies, hops solely between time slots and hops between both frequencies and time slots in a radio communications system, for instance.
  • frequency hopping may be applied in a radio communications system to improve the performance of the radio system or as a security measure against unauthorised listening to radio communications.
  • Frequency hopping is carried out in a predetermined order in such systems, without taking the prevailing quality of the connection into account. Frequency hopping in radio communications systems is thus not adaptive.
  • the connection can be established between a transmitter and a receiver of a radio communications system a radio connection over which radio communication can take place.
  • the connection is two- directional, i.e. includes a downlink which forms the connection in a direction away from a base station of the system to a mobile station, and an uplink which forms the connection in the opposite direction, i.e. from the mobile station to the base station.
  • Transmission and reception of radio traffic on different connections is effected on channels that can be defined by a given frequency in an FDMA system (Frequency Division Multiple Access) , or by a combination of a given frequency and a given time slot in a system that utilizes TDMA (Time Division Multiple Access) .
  • FDMA system Frequency Division Multiple Access
  • TDMA Time Division Multiple Access
  • a channel may be defined by a code in a CDMA system (Code Division Multiple Access) .
  • CDMA Code Division Multiple Access
  • the channels that are available in a radio communications system may be disturbed significantly by other radio traffic, including radio signals on the same channels as those used for other connections, wherewith each channel in the system has a certain interference level .
  • each connection were to use solely one channel, the connections would obtain different interference levels.
  • the interference experienced by some connections may be so heavy as to deny an acceptable call quality.
  • the differences in call quality of the connections can be evened-out, by jumping between different channels, wherein the connections use channels of mutually different interference levels. This spreads the use of the channels between the various connections and, with the aid of interleaving and error correction coding, more connections can obtain an acceptable call quality when the system is observed in its entirety.
  • Each connection may be allocated a plurality of channels, wherein the system controls the connections during ongoing communication, such as to cause the channels to hop between the channels in accordance with a given hopping rule.
  • This rule may, for instance, be a predetermined pseudorandom series, in which case the connections would appear to hop randomly between all available channels; cf. in this regard European Patent Application EP 93905701-4.
  • this type of channel hopping may result in an unnecessarily high interference level, since the channels are not always allocated to the connections in an optimal manner when a pseudorandom series is used.
  • cyclic channel hopping Another type of channel hopping is cyclic channel hopping.
  • a connection hops between a number of channels in accordance with a cyclically repeated channel hopping sequence.
  • channel hopping can be applied in a GSM system.
  • the GSM system is a TDMA system, meaning that each frequency is divided into a plurality of time slots that form a TDMA frame.
  • a TDMA frame is comprised of eight time slots.
  • Channel hopping is then effected, by hopping the connection between channels that have the same time slot, wherein in practice the connection hops solely between different frequencies.
  • a particular frequency may occur only once in a channel hopping sequence, and the frequencies in a channel hopping sequence will always occur in a rising order.
  • the duration of the channel hopping sequences may vary between different base stations.
  • a radio communications system will normally include a plurality of channels that can be used for establishing connections between a given base station and mobile stations. It is then important that the same channel is not used simultaneously for two or more connections between the base station and mobile stations. If two base station transmitters transmit to their respective receivers different signals simultaneously on the same channel, it is very likely that at least one receiver will be disturbed by interference deriving from the transmission to the other receiver. When this cannot occur, i.e. when only one of the base station connections can be transmitted on a channel at each point in time, it is said that the base station has orthogonality.
  • signal strength is meant the strength of the received desired signal.
  • interference is meant the sum of the signal strength of all received undesirable signals on the channel used.
  • the strength of the desired received signal will depend on transmitter power and on the extent to which the desired signal is attenuated in its path from the transmitter to the receiver. Attenuation is determined, among other things, by distance, direction and topology between transmitter and receiver. Other terms used in parallel with attenuation are path gain and path loss, as the skilled person is well aware.
  • Channel hopping in a radio communications system is described in the International Patent Application WO 96/02979.
  • Channel hopping is effected between a plurality of channels that are each allocated a respective connection.
  • a signal attenuation parameter e.g. path gain, is measured in respect of the connections, which are thereafter ordered with respect to the signal attenuation parameter.
  • the described method includes measuring a mean value of a channel quality parameter, such as interference, on individual channels. The channels are thereafter ordered with respect to the measured channel quality parameter. Only those channels that will provide the best channel quality are used for establishing the connections.
  • a low quality connection is allocated a channel hopping sequence in which the channels used have a high quality
  • a high quality connection is allocated a channel hopping sequence in which the channels used have a low (poorer) channel quality.
  • This division of channel hopping sequences to connections ensures that orthogonality is achieved in each base station.
  • a channel hopping sequence may include a different number of channels in different base stations. The number of channels used in a channel hopping sequence is fixed within a base station.
  • Swedish Patent Application SE 94022492-4 describes a method and apparatus for channel hopping in a radio communications system.
  • a mean interference value in respect of the channels in the radio communications system is determined, or measured, for each connection.
  • the values obtained are stored in an interference list for each of the connections involved.
  • the values in the interference lists are then weighted and the resultant weighted lists analysed. There is then generated for each connection a hop sequence list on the basis of the analysis of the weighted lists.
  • a channel that has a high weight value for a given connection will often occur more frequently in a corresponding hop sequence list than a channel that has a low weight value.
  • the aforedescribed methods provide a mean interference value.
  • the interference may vary with time and consequently the channel interference may differ at different time intervals within a channel hopping sequence. It would therefore be desirable to obtain the values of the interference within those different time intervals in a channel hopping sequence in which a channel may be used.
  • the American patent U.S. 4,998,290 describes a radio communications system that utilizes frequency hopping.
  • the system includes a central control station that allocates frequencies for communication with a plurality of participating local radio stations.
  • the control station establishes an interference matrix that reflects the capacity requirement of the different radio stations and interference on all connections.
  • German Patent Application DE 4403483A describes a method of re- organizing frequency jump groups for an FDM/TDM radio transmission.
  • a plurality of pre-defined frequency hop tables are stored in a base station controller, BSC.
  • One table (TAB) is used at a time. If any connection that utilizes one of the frequency hop sequences in the table is of pcor quality, the table (TAB) used on that occasion is replaced with a new table (TAB1) .
  • the switch from a current table to a new table is effected stepwise.
  • the frequency hop sequences are changed for two time slots at a time. The switch, or change, only takes place when no information is transmitted on these time slots.
  • the International Patent Application WO 91/13502 describes a method for carrier-divided frequency hopping. All available frequencies in the radio communications system that can be used for frequency hopping are found in a frequency pool from which channel hopping sequences are determined. Each base station is allowed to choose frequencies from the frequency pool when frequency hopping. The distance of the mobile station from the base station is taken into account when allocating a time slot to a mobile station that wishes to setup a connection. Nearby mobile stations are given the centermost time slots of a TDMA frame, whereas remote mobile stations are given time slots that lie respectively at the beginning and at the end of a TDMA frame. This is done in order to avoid overlapping of time slots (Time alignment) .
  • the International Patent Specification WO 93/17507 describes a method of communication in a TDMA cellular mobile radio communications system that uses frequency hopping.
  • a mobile station in one cell selects radio channels and time slots independently of a mobile station in a neighbouring cell.
  • the hop sequences within a cell are selected so that no co-channel interference will occur.
  • co-channel interference may occur between cells, it is considered that such an occurrence is only on a small scale.
  • the power output of the mobile stations is controlled such that mobile stations that are located close to the base station will transmit on a lower power than mobile stations that are located far away from the base station.
  • the invention deals with a problem of how channels shall be allocated to different connections between a base station and mobile stations that are located within the area covered by the base station.
  • the base station forms part of a radio communications system that utilizes channel hopping, wherein one problem resides in allocating channels to connections in a manner which will ensure that the connections do not disturb one another to an unnecessary extent, preferably to the least possible extent, and so as to obtain good connection quality.
  • the problem also includes the manner in which orthogonality within the base station can be ensured.
  • Another problem resides in how the radio communications system shall be observed in different time intervals within a channel hopping sequence with respect to the quality of the channels used for channel hopping, so as to continuously obtain reliable quality values.
  • one object of the present invention is to optimise the use of available base station channels with respect to the quality of connections between the base station and those mobile stations that are located in the area covered by the base station, with the aid of a channel hopping method.
  • Another object is to observe the radio communications system with respect to channel quality in different time intervals within a channel hopping sequence.
  • Yet another object is to ensure orthogonality in the base station, or base station orthogonality, in conjunction with the aforesaid optimisation of channel use, i.e. to ensure that only one base station connection at a time will utilize a channel that is available in said base station.
  • the aforesaid problems are solved by means of an inventive method and an inventive radio communications system.
  • the method may include observing the system with respect to connection quality and channel quality, wherein signal attenuation parameters and channel quality parameters are generated.
  • the signal attenuation parameter indicates the extent to which the connection is influenced by attenuation. A low value with respect to the signal attenuation parameter indicates that the connection has low attenuation, whereas a high value of the signal attenuation parameter will indicate that the connection has high attenuation.
  • the channel quality parameter indicates the extent to which a channel or frequency is disturbed by interference.
  • a low value with respect to the channel quality parameter will indicate that the channel or the frequency has low interference, and, conversely, a high value indicates that the channel or frequency has high interference.
  • the method assumes that the number of channels in a channel hopping sequence is constant in the radio communications system, which can be expressed as saying that all connections in the system use the same hopping sequence duration.
  • the hopping sequence duration, and therewith the channel hopping sequences, is divided into a number of sequence intervals when generating the channel quality parameters.
  • the sequence interval may, in turn, be divided into one or more generating intervals within which the channel quality parameter is generated.
  • one channel quality parameter is generated for each frequency and for each generation interval.
  • Channel hopping sequences may be generated in accordance with the determined channel quality parameters.
  • the channel hopping sequences can then be allocated to different connections in accordance with the connection quality parameters and channel quality parameters.
  • an inventive method may include observing the connections in said system with respect to connection quality.
  • Connection quality may relate to the extent to which attenuation affects the connection.
  • a signal attenuation parameter such as path gain for instance, is determined for the connections.
  • the connections are then ordered in accordance with the determined signal attenuation parameter.
  • the inventive method also includes observing the quality of the channels or of the frequencies (when applicable) in the system.
  • Channel quality is able to indicate the extent to which a channel or frequency is disturbed by interference.
  • a channel quality parameter, such as interference for instance is determined for each frequency and for each generation interval.
  • a channel quality parameter is obtained for each frequency or for each channel depending on the duration of the generation interval and on the type of radio communications system concerned.
  • a channel quality parameter will be determined for each channel.
  • the channels, or frequencies, are then ordered in accordance with the determined channel quality parameters .
  • the channels/frequencies are ordered in a channel list for each sequence interval in accordance with the determined channel quality parameter.
  • the channel quality parameter may also be obtained by measuring, for instance, the C/I value or the bit error rate, BER, and then calculating an interference value with the C/I value or the bit error rate as input data.
  • Channel hopping sequences are then generated.
  • Each channel hopping sequence utilizes a channel taken from a respective channel list, i.e. for respective sequence intervals. Only the best channels with respect to the channel quality parameter are used.
  • Hopping sequences are then allocated to the connections according to the principle that a connection that has poor connection quality will be allocated a channel hopping sequence with channels of high channel quality. Connections with successively better connection quality are allocated channel hopping sequence having successively poorer channels. This can be expressed simply by saying that the worse a connection with respect to attenuation, or with respect to some other connection quality measurement, the better the channels with respect to interference, or with respect to some other channel quality measurement, allocated to the connection.
  • the orthogonality in the base station is ensured, by allowing only one given channel to occur once within each sequence interval .
  • high and low channel quality refer to the quality of those channels that are actually used in the channel hopping sequences. Channels that are not used in a channel hopping sequence will have poorer channel quality than the worst channel used in a channel hopping sequence.
  • connections then hop between their allocated channels.
  • One channel in the channel hopping sequence is used in each section interval.
  • the last channel in a channel hopping sequence has been used, the first channel in the channel hopping sequence is then re-used, and so on.
  • the inventive method may be repeated continuously or intermittently, wherein channel allocation to old connections can be updated. Because the method is repeated, any newly established connections can be allocated channels between which they may hop.
  • the invention also includes apparatus for carrying out the method.
  • the advantages afforded by the method include adaptive channel allocation and that the orthogonality in the base station is ensured at the same time.
  • a further advantage is that the quality of the channels included in a channel hopping sequence is determined at the different time intervals in a channel hopping sequence in which they can be used. This implies improved accuracy in the observation of channel quality.
  • This enables the advantages afforded by channel hopping, i.e. the division of the interference over different connections, combined with the advantages that are afforded by a radio communications system that does not use channel hopping. In such a system, the interference situation can be observed for each channel.
  • Another advantage is that the method results in improved channel utilisation, by virtue of a connection having high attenuation being allocated channels that have low interference, and by virtue of allocating to a connection that has low attenuation channels that have higher interference, i.e. higher interference in relation to the utilized best channels.
  • the advantages thus afford improved call quality on more connections, improved capacity and a lower total of interference levels in the radio communications system.
  • Figure la is a schematic view over a part of a radio communications system.
  • Figure lb is a block schematic illustrating three mobile stations and a base station located in a cell in the radio communications system, and illustrates the channel hopping principle of the invention.
  • Figure 2 is a block schematic illustrating three mobile stations and a base station located in a cell in a radiocommunications system, and also shows channel hopping in accordance with the invention.
  • Figure 3a is a block schematic illustrating a first embodiment of the invention.
  • Figure 3b illustrates in more detail a first embodiment of means for generating a channel quality parameter in accordance with the invention.
  • Figure 3c illustrates in more detail a second embodiment of means for generating a channel quality parameter in accordance with the invention.
  • Figure 4 is a block schematic illustrating a second embodiment of the invention.
  • Figure 5 is a block schematic illustrating a third embodiment of the invention.
  • Figure 6 is a block schematic illustrating a fourth embodiment of the invention.
  • Figure 7 is a schematic flowchart illustrating the inventive channel hopping method.
  • Figure la illustrates schematically part of a radio communications system.
  • the system is a cellular mobile radio network PLMN, that includes base stations BS1-BS8.
  • Each base station has a certain range within which radio communication can be established with mobile radio stations or mobile stations MS1-MS6 located within the coverage area defined by this range.
  • the cells C1-C8 represent the geographical areas covered by the base stations BS1-BS8.
  • the base stations are connected to remaining nodes of the mobile radio network, for instance base station controller centres, BSC, mobile switching centres, MSC, and gateway mobile switching centres, GMSC, according to known technology. Since these nodes have no particular significance in respect of the present invention, they have not been shown in the Figure nor described in detail in the present context.
  • Figure lb illustrates schematically the principle of channel hopping in accordance with the present invention.
  • the base stations in the radio communications system include hopping sequence lists. These lists contain information relating to those channels that shall be used by the base station for communication with those mobile stations that are located within the area covered by said base station. Thus, when a base station handles a number of connections to different mobile stations, the base station will possess a hopping sequence list for each connection.
  • the base station BSl in cell Cl includes a hopping sequence list 101 for connections to the mobile station MSI.
  • the corresponding hopping sequence lists for connections to the mobile stations MS2 and MS3 are not shown in the Figure.
  • the hopping sequence list 101 in the base station BSl includes three transmission channels chl-ch3 designated Tx, and three reception channels ch4-ch6 designated Rx.
  • the time taken to run through a channel hopping sequence is divided into a number of sequence intervals T t .
  • the base station transmitter transmits on channel chl during the whole of a first sequence interval Ti or during parts of said first interval, on channel ch2 during the whole of a second sequence interval T 2 , or during parts of said second interval, and on channel ch3 during the whole of a third sequence interval T 3# or during parts of said third interval.
  • the index i that indicates the number of the sequence interval Ti is its sequence index.
  • These three channels are said to form a channel hopping sequence for transmission from the base station BSl to the mobile station MSI. Transmission from the base station to a given mobile station, and vice versa, may be offset in time within the sequence interval. When the last channel in a channel hopping sequence has been used, the first channel is used again in the channel hopping sequence, and so on.
  • the hopping sequence chl-ch3 is then repeated cyclically during the time in which the radio connection is established with the mobile station MSI, or until a new allocation of channels is made to the hopping sequence list 101 in accordance with the following description.
  • the receiver in the base station BSl receives on the channel ch4-ch6 in the sequence interval T x -T 3 , whereafter said channel hopping sequence is repeated in the same way as that described above with reference to the transmitter.
  • Three channels are used in each channel hopping sequence in the illustrated embodiment.
  • the number of channels used in the channel hopping sequences, in other words the sequence duration L is a system parameter that can be arbitrarily chosen. However, the sequence duration L must be the same in all base stations in the system, for reasons made evident hereinafter.
  • the mobile station MSI includes a hopping sequence list 102.
  • the hopping sequences in the hopping sequence list 101 and 102 are identical, although the channel hopping sequence used in the base station for transmission purposes is, of course, used for reception in the mobile station, and the channel hopping sequence used in the base station for reception purposes is used for transmission in the mobile station.
  • the channels chl- ch3 form the channel hopping sequence when receiving
  • the channels ch4-ch6 form the hopping sequence when transmitting, in respect of the sequence interval T ] _-T 3 in the mobile station MSI.
  • a channel hopping sequence is preferably generated in the base station, e.g. the channel hopping sequence for transmission from said base station.
  • Channel hopping sequences for reception in the base station can then be obtained, by using the duplex spacing, which is the frequency spacing between uplink and downlink, as is well known to the person skilled in this field.
  • the resultant hopping sequence list for reception in the base station is then sent from the base station to the mobile station over a control channel and is used by the mobile station as its hopping sequence list, in the manner explained above.
  • This transmission of the base-station hopping sequence list 101 to the hopping sequence list 102 in the mobile station MSI is symbolised by the broken line in Figure lb. It is also possible to generate a channel hopping sequence in the mobile station and then use the duplex spacing to obtain the other channel hopping sequence, therewith obtaining a hopping sequence list for the base station. This list is then sent to the base station on the control channel, as described above.
  • An alternative possibility is one of generating the channel hopping sequences for transmission and reception respectively for each connection, either in the base station or in the mobile station, without using the duplex spacing.
  • This alternative possibility can be used in systems that do not utilize duplex spacing. This is described in an exemplifying embodiment, with reference to Figure 6.
  • FIG 2 is a block schematic that illustrates parts of the three mobile stations MS1-MS3 and the base station BSl in cell 1 shown in Figure la.
  • the base station includes means, e.g. circuits, for storing hopping sequence lists 201-203 for each of the three connections between the subscribers al-a3, which may be fixed or mobile subscribers, and the mobile stations MS1-MS3.
  • the mobile stations include circuits for each of their respective hopping sequence lists 204-206, these lists being counterparts of the hopping sequence lists in the base station, as described above. It is assumed in this embodiment that the hopping sequence lists 201-206 include three transmission channels and three reception channels.
  • the base station includes a transceiver unit 207 which transmits/receives radio signals to/from the mobile stations on the allocated channels.
  • the receiver part of the unit 207 may also be used to measure channel quality, e.g. by measuring the interference on the channels used in the system. Seen generally, this interference is both channel-dependent and time-dependent and can thus be written as I (channel,t) .
  • the base station may be provided with a separately allocated broadband receiver to this end. In the following examples, however, it is assumed that the receiver part of the transceiver unit 207 is used to measure channel quality.
  • Each of the mobile stations MS1-MS3 includes its own transceiver unit 208-210 for radio signals to/from the base station.
  • An interference I (channel,t) is also received in the receivers of the mobile stations.
  • a channel allocating means 211 in the base station BSl allocates channels that form the channel hopping sequences in the hopping sequence lists, as will be described in more detail hereinafter.
  • the hopping sequences are then transferred from the channel allocation means 211 to the base station hopping sequence lists 201-203 and to the mobile station hopping sequence lists 204-206, wherein a control channel, such as the control channel SACCH (Slow Associated Control Channel) may be used for the transmission to the mobile stations as mentioned above.
  • SACCH Slow Associated Control Channel
  • the transfer of the channel hopping sequences to the hopping sequence lists 204-206 is shown separately with a broken line in the Figure, for the sake of clarity. However, this transfer is effected in a known manner with the aid of the transceivers 207-210 and under the control of a central processing unit CPU (Fig. 3) .
  • the base station and the mobile stations thus know, through the channel hopping sequences, on which channel transmission and reception shall take place within each sequence interval Ti.
  • FIG. 3a is a block schematic that illustrates the channel allocation means 211 in the base station BSl in more detail.
  • the channel allocation means 211 includes a means 212 for generating a signal attenuation parameter that indicates the extent to which a radio signal has been attenuated between the transmitter and the receiver in respect of a given connection.
  • the signal attenuation parameter of a given connection between a base station and a mobile station may be generated by sending from the base station to the mobile station a measuring signal of known signal strength. The mobile station registers the received signal strength and reports the value back to the base station, therewith enabling the signal attenuation parameter to be calculated.
  • the received signal strength will contain signal strength contributions from other base stations, in addition to the signal strength contribution from the transmitted measuring signal. It can be assumed, however, that the major part of the received signal strength will derive from the transmitted measuring signal. For instance, in a mobile radio network such signal attenuation measurements are made repeatedly in respect of connections that are about to be established and that have already been established. This is carried out with the aid of control channels in a manner well known to the person skilled in this art, and hence the method of operation of the means 212 will not be described in detail in the present context.
  • the signal attenuation parameter has been described with reference to the downlink, i.e. when the measuring signal is sent from the base station. It will be understood, however, that the measuring signal may be sent from the mobile station equally as well, in which case the signal attenuation parameter is then measured in the uplink.
  • signal attenuation of a connection can be assumed to be the same in both the uplink and downlink with good approximation, and thus it is of no significance to the application of the invention if the signal attenuation parameter is measured in the uplink or in the downlink.
  • the means 212 generates a connection list 213 in which there is stored a signal attenuation parameter ⁇ l f ⁇ 2 ⁇ .. . for respective connections FI, F2, .. , .
  • the signal attenuation parameter stored in the connection list 213 constitutes input data to the algorithm that is used for the allocation of channels to the hopping sequence lists in accordance with the following description.
  • a sorting means 214 compares the signal attenuation parameters with one another and stores the connections in accordance with the parameters in a sorted connection list 215, wherein the connection that has the lowest signal attenuation parameter is stored first in the connection list, i.e. is ranked first in the list.
  • connection that has the lowest signal attenuation parameter is referenced m 0 in the sorted connection list 215, the connection that has the next lowest signal attenuation parameter is referenced m 1# and so on, said connections thus being ordered in a sequence according to increasing signal attenuation.
  • a connection has a low signal attenuation parameter this indicates that the signal has been attenuated only slightly on the connection and that the connection is of good quality with respect to signal attenuation.
  • the channel allocation means 211 also includes a means 216 for generating a channel quality parameter for each channel or for each frequency that can be used in a channel hopping process and for each sequence interval Ti in accordance with the description of the following embodiments.
  • the means 216 also generates a sorted channel list KL for each sequence interval T ⁇ in the channel hopping sequence on the basis of the generated values of the channel quality parameter, as described hereinafter with reference to Figures 3b and 3c (the units 307a-307c, 407a-407c) .
  • the sorted connection list 215 and the sorted channel lists (307a-307c in Figure 3b, 407a-407c in Figure 3c) are delivered to a channel hopping sequence generating means 220.
  • the means 220 generates and allocates channels to the channel hopping sequences, these channels then being transferred to the hopping sequence lists 201-203 in the base station and to the hopping sequence lists 208-210 in the mobile stations MS1-MS3 via the control channel SACCH (Fig. 2) .
  • the channel hopping sequence generating means 220 allocates these sequences to connections in accordance with the principle that a given connection of poor quality shall be allocated a channel hopping sequence that includes good quality channels . Connections with successively better qualities are allocated channel hopping sequences that includes channels of successively poorer quality. Ideally, all connections will have the same C/I value.
  • the allocation of channels to the channel hopping sequences for said connections may be effected by means of an inventive method described in more detail hereinafter.
  • channel hopping sequences are allocated to the connections according to the principle whereby a connection that has a low connection quality, e.g. expressed as high attenuation, is allocated a number of channels of high channel quality, e.g. expressed as low interference, whereas a connection that has a higher connection quality is allocated a number of channels that have a lower channel quality, e.g. expressed as higher interference.
  • Another way of expressing the same thing is to say that the poorer a connection with respect to attenuation, the better channels with respect to interference, or some other channel quality measurement allocated to the connection.
  • Allocation of channels to connections is effected so as to ensure orthogonality, i.e. to ensure that a plurality of connections with the base station do not use the same channels at one and the same time.
  • the embodiment shown in Figure 3a includes a central processing unit, CPU.
  • the central processing unit, CPU, in the channel allocation means 211 can communicate with the aforedescribed means and control the described course of channel allocation. This communication may take place with the aid of control signals transmitted between the central processing unit, CPU, and said means, wherein the control signals are sent on a bus 222 between the central processing unit and ports 212p, 213p, ... , 220p on said means, as illustrated schematically in Figures 3a-3c. Not all ports have been numbered in the Figure, for space reasons.
  • Each means may include its own software for controlling its particular functions, therewith distributing control in the system.
  • the channel lists (307a-307c in Figure 3b, 407a-407c in Figure 3c) include channels or frequencies, depending on the system concerned, that are sorted with respect to the measured channel quality parameter. This is based on defining a channel by a frequency in an FDMA system and by a frequency and a time slot in a TDMA system.
  • channel hopping in respect of a connection involves hopping solely between channels in one and the same time slot, which means hopping solely between frequencies.
  • hopping may also take place between channels that have mutually different time slots, i.e. hopping between both frequencies and time slots.
  • Respective channel lists may include those channels or frequencies, whichever are applicable, that can be used for channel hopping sorted with respect to the measured channel quality parameter.
  • a channel quality parameter is measured, or determined, for each frequency in each generating interval ⁇ T k , this generating interval forming the whole of a sequence interval T ⁇ or a part of said interval T 1# as described in more detail hereinafter with reference to Figure 3b.
  • the generating interval in a TDMA system is the time of one time slot, a channel quality parameter will be measured for each channel.
  • a mean value of the channel quality parameter for each of the frequencies f ⁇ ⁇ f n is measured by the receiver part in the transceiver unit 207.
  • x l,2, ..,n.
  • the channel quality parameter is time-dependent and indicates the quality of a channel with respect to, e.g., channel interference I (t) .
  • Index x designates frequency number.
  • bit error rate or C/I value for instance
  • an interference value may be calculated from these values .
  • bit error rate or C/I value for instance
  • a channel filtering means may be used for filtering the received broadband signal so as to obtain a value for each frequency.
  • the filters separate the received broadband signal to all of the frequencies fj . -f-, that can be used in the system.
  • the signal values obtained when measuring the channel quality parameter can be squared, wherein the result obtained reflects the strength of incoming signals for each frequency fl-fn.
  • the means 216 for generating a channel quality parameter also includes a sequence counter 303.
  • the sequence counter 303 indicates the sequence interval T 1 in which the channel hopping sequence is located, where the index i designates the sequence index.
  • each time interval within which the connection transmits on a channel occurs during a sequence interval T x .
  • the first channel in a channel hopping sequence is used during the whole of a first sequence interval T 1 or during parts of said interval T- L , as indicated with a first sequence index II.
  • the second channel in the channel hopping sequence is used during the whole of the second time interval T 2 or during parts of this second interval, as indicated by a second sequence index 12, and so on.
  • the generating interval ⁇ T k is comprised of the full sequence interval, meaning that a channel quality parameter is generated for each frequency within each sequence interval.
  • the significance of the generating interval ⁇ T k in the illustrated case can be exemplified by assuming that the system is a GSM system where each frequency is divided into eight time slots, i.e. form a TDMA frame. The generating interval ⁇ T k will then correspond to the time for one TDMA frame.
  • the receiver part in the transceiver unit 207 and the sequence counter 303 are connected to a multiplexor means 302.
  • the multiplexor means 302 is able to select one of several connections, in the illustrated case three different connections, between the receiver part of the transceiver 207 and a number of mean value forming means 304a-304c.
  • the means 304a includes a plurality of mean value forming filters.
  • the means 304a is able to form a mean value for each frequency f x with respect to the values of the signal strength of the interference.
  • the mean value forming means may utilize any type of unequivocal, monotonously increasing and non-linear imaging (for instance, a logarithmic function) , so as to be able to weight different measurement values.
  • the mean value forming means have been described in the present example as a means for each sequence interval.
  • a mean value of the various sequence intervals can be formed solely by one mean value forming means that has the same function as the aforesaid three mean value forming means.
  • the first channel quality list 305a is then sorted by a first sorting means 306a with respect to the obtained values of the channel quality parameter.
  • This sorting process results in a first sorted channel list 307a, wherein the frequency that is least disturbed by interference, i.e. the frequency that has the lowest channel quality parameter, is designated c ll; and the frequency that has the next lowest channel quality parameter is designated c 21 , and so on, wherein the first index indicates the frequency order number and the second index indicates sequence index i .
  • the values are stored in a second channel quality list 305b and a third channel quality list 305c respectively, whereafter these lists are sorted by a respective second sorting means 306b and a third sorting means 306c.
  • the time constant of the mean value forming filters in the mean value forming means 304a-304c is preferably in the order of magnitude of hours to days. In other words, the values are collected and mean values formed therefrom during this time period.
  • the result obtained with the means 216 for generating a channel quality parameter is thus a sorted channel list 307a- 307c for each sequence interval T ⁇ T-,.
  • Respective lists contain the frequencies fl-fn sorted with respect to the value of the channel quality parameter for the respective frequency within respective sequence intervals T- ⁇ T ⁇
  • a frequency that has a high channel quality parameter is only slightly disturbed by interference and the frequency is therefore of good quality with respect to interference.
  • a multiplexor means 402 selects connections from the receiver part of the transceiver unit 207 to three mean value forming means 404a-404c in accordance with the sequence index indicated by the sequence counter, similar to the aforedescribed.
  • the sequence counter 403 controls the first mean value forming means 404a so as to form a mean value for respective generating intervals ⁇ T k , i.e. the time duration of a time slot k.
  • the respective values I 12 -I n2 and I 13 -I n3 are stored in a respective second and third channel quality list 405b and 405c.
  • Each of the respective channel quality lists 405a-405c is sorted in a respective sorting means 406a-406c with respect to the measured values of the channel quality parameter.
  • a sorted channel list 407a-407c is generated for each sequence interval T A in this way.
  • the best channel, i.e. the channel with least disturbance, within respective sequence intervals T i is designated c l ⁇ .
  • the next best channel in respective lists is designated c 2i , and so on.
  • the radio communications system it is not only necessary for the radio communications system to be sequence synchronous but also time slot synchronous, i.e. the duration of the time slots may not change with time. Otherwise, the interference situation within a time slot may vary with time.
  • channel hopping may include hopping solely between frequencies, hopping between both frequencies and time slots, and hopping solely between time slots.
  • the expression channel hopping sequence used below includes a hopping sequence that includes channels which are defined by frequency in an FDMA system and by frequency and time slots in a TDMA system.
  • the expression frequency hopping sequence relates to hopping sequences that include solely frequencies.
  • a frequency hopping sequence and a channel hopping sequence are one and the same with regard to an FDMA system.
  • the generation of channel hopping sequences will now be described for the case when the radio communications system is an FDMA system.
  • the generating interval ⁇ T k constitutes the entire sequence interval T i( as described above with reference to Figure 3b.
  • the sorted channel lists 307a-307c will contain frequencies.
  • a channel is defined solely by frequency.
  • only one frequency from each sorted channel list may be included in a channel hopping sequence. It is necessary that respective frequencies maintain their respective sequence indexes in the channel hopping sequence.
  • a feasible hopping sequence algorithm is to select the highest ranked frequencies from respective sorted channel lists 307a- 307c, c u , c 12 , c 13 and allow these frequencies to constitute the best channel hopping sequence.
  • the next highest ranked frequencies c 21 , c 22 are then elected and allowed to constitute the next best channel hopping sequence, and so on.
  • the three best frequencies with respect to interference will then constitute the best channel hopping sequence, while the three worst frequencies will constitute the worst channel hopping sequence.
  • Another inventive hopping sequence algorithm may be used to obtain a smaller quality difference between the different channel hopping sequences.
  • the best frequency c 11( c 12 of respective first and second channel lists 307a and 307b and the next best frequency c 23 of the third channel list 307c are allocated to said hopping sequence algorithm.
  • the next best frequency c 21 , c 22 of respective first and second channel list 307a and 307b and the best frequency c 13 of the third channel list 307c are allocated to the next best channel hopping sequence. This procedure may be repeated pairwise for the remaining successively poorer frequencies in the channel lists 307a-307c.
  • the third best channel hopping sequence is allocated the third best frequency c 31 , c 32 from the first and the second channel lists 307a and 307b respectively and the fourth best frequency c 43 from the third channel list 307c.
  • the difference in the quality between the various channel hopping sequences will therewith be smaller than in the former case.
  • the frequencies included in the channel lists may be allocated to channel hopping sequences in other ways, and that the choice becomes greater the longer the sequence duration L.
  • a channel hopping sequence may never include more than one frequency from respective channel lists, i.e. from one and the same sequence interval T ⁇
  • the choice of frequencies to be allocated to the channel hopping sequence for a connection can be made in accordance with the earlier described principle, in which the worst connection with respect to connection quality is allocated the best channel hopping sequence with respect to interference.
  • the next worst connection is allocated the next best channel hopping sequence, whereafter successively better connections are allocated successively poorer channel hopping sequences.
  • channel hopping sequences will now be described with reference to a TDMA radio communications system in which hopping between time slots is not permitted.
  • the generating interval ⁇ T k constitutes the whole of the sequence interval T i( as described above with reference to Figure 3b.
  • Channel hopping in a system of this kind involves changing solely the frequency for respective connections, i.e. hops are made solely between channels that have mutually the same time slot.
  • there is first generated frequency hopping sequences for instance in accordance with the aforedescribed hopping sequence algorithms.
  • Each connection is then allocated a respective time slot and thereafter a frequency hopping sequence.
  • the frequency hopping sequence forms in combination with the time slot allocated to the connection a channel hopping sequence wherein each channel of said sequence is defined by the same time slot.
  • each TDMA frame contains eight time slots in the GSM system. This means that up to eight connections are able to use channel hopping sequences that contain the same frequency hopping sequence, provided that the connections are not allocated the same time slot.
  • One strategy is then to allow the greatest possible number of worst connections, i.e. those connections that have the highest signal attenuation parameter, to use the best frequency within respective sequence intervals.
  • the channel hopping sequences for these connections contain different channels within respective sequence intervals, these channels all being defined by the same frequency.
  • a channel hopping sequence for a connection is comprised of channels that are all defined by the same time slot.
  • a number of successively better connections are allowed to use the next best frequency within each sequence interval, and so on.
  • Frequency hopping sequences are first generated with a hopping sequence algorithm as earlier described, whereafter time slot hopping sequences are generated.
  • the time slot hopping sequences may be generated by means of a random number generator.
  • Each frequency hopping sequence is then combined with a time slot hopping sequence from which channel hopping sequences are formed.
  • frequencies can be allocated to the channel hopping sequence of a connection in accordance with the same principle as that earlier described, wherein the worst connection with respect to connection quality is allocated the best channel hopping sequence with respect to interference.
  • the next worst connection is allocated the next best channel hopping sequence, whereafter successively better connections are allocated successively poorer channel hopping sequences.
  • channel hopping sequences will now be described with reference to a TDMA radio communications system when the generating interval ⁇ T k constitutes the time of a time slot.
  • the sorted channel lists 407a-407c contain, in this case, all frequency/time slot combinations, i.e. channels which can be used for channel hopping and which are sorted with respect to the channel quality parameter.
  • Channel hopping sequences can therefore be generated directly from said channel lists in accordance with a hopping sequence algorithm described in the first example above.
  • frequencies allocated to the channel hopping sequence or a connection may be selected in accordance with the earlier described principle, in which the worst connection with respect to connection quality is allocated the best channel hopping sequence with respect to interference.
  • the next worst connection is allocated the next best channel hopping sequence, whereafter successively better connections are allocated successively poorer channel hopping sequences.
  • the means 220 then generates a further channel hopping sequence for each connection m 0 -m 6 , by utilizing the duplex spacing as before mentioned.
  • One of the channel hopping sequences is then used by the base station transmitter and the other channel hopping sequence is used by the base station receiver or respective connections.
  • the two channel hopping sequences per connection are then stored in respective hopping sequence lists in the base station, such as the hopping sequence lists 201-203 in Figure 3.
  • the two channel hopping sequences per connection are also sent to the mobile stations over a control channel SACCH and there stored in respective hopping sequence lists, such as the hopping sequence lists 204-206 shown in Figure 2.
  • the central processing unit, CPU, with bus line 222 and ports 212p, 213p, ..., 220p are not shown in the following Figures.
  • FIG 4 is a block schematic illustrating a second embodiment of the invention and of the channel allocating means 211.
  • the sorted channel lists 307a-307c, 407a-407c are produced in a different way than in the embodiment illustrated in Figures 3a- 3c.
  • each mobile station MS1-MS3 measures the downlink interference I(t) .
  • each mobile station MS1-MS3 measures a mean value for the interference of the respective frequencies.
  • These values are then sent to respective means 408a-408c for generating channel quality lists in the base station.
  • the values are transmitted via a control channel designated SACCH, as illustrated schematically in the Figure by the broken line.
  • the Figure 4 embodiment includes three mobile stations.
  • the base station includes a respective means 408a-408c for generating channel quality lists for each mobile station MS1-MS3.
  • One such means 408a-408c includes the aforesaid means 302, 303, 304a-304c and 305a-305c in Figure 3b, or the means 402, 403, 404a-404c and 405a-405c in Figure 3c.
  • these means are shown in Figure 4 as one single means 408a-408c.
  • respective means 408a-408c for generating channel quality lists generate three channel quality lists, one for respective sequence intervals T 1 .
  • Mean values are formed from the channel quality lists that have been obtained with the aid of the respective means 408a-408c for generating channel quality lists for respective sequence intervals T x -T 3 and sorted by a first, second and third sorting means 409a-409c.
  • These respective sorting means 409a-409c will calculate a mean value of the values of the channel quality parameter for each frequency/channel and for each sequence interval, and sort the frequencies/channels in accordance with the calculated mean values.
  • the means 409a-409c may use a type of unequivocal, monotonously increasing and non-linear imaging (e.g. a logarithmic function) with the intention of weighting different measurement values.
  • a linear mean value of said values is then suitably calculated, whereafter the frequencies/channels for respective sequence intervals Ti are sorted in accordance with the mean value formation, i.e. in accordance with increasing interference.
  • each mobile station may be provided with a respective means 408a-408c for generating channel quality lists, a respective sorting means 409a-409c, and respective sorted channel lists 307a-307c or 407a-407c.
  • the sorted channel lists are sent to the base station via control channel SACCH.
  • Remaining means 212-215 and 220-221 operate in the same way as in the embodiment shown in Figure 3a and will not therefore be described with reference to Figure 4.
  • Figure 5 is a block schematic illustrating a third embodiment of the invention and the channel allocation means 211. Distinct from the two embodiments described with reference to Figures 3a- 3c and Figure 4, the sorted channel lists 307a-307c and 407a- 407c respectively are produced from interference measurement values on both uplink and downlink. In this case, the downlink interference was measured by each mobile station MS1-MS3 in the same way as that described with reference to Figure 4. The interference values measured in the uplink were also used and stored in the channel quality lists 305a-305c in Figure 3b and 405a-405c in Figure 3c.
  • the means 302, 303, 304a-304c in Figure 3b and 402, 403, 404a-404c in Figure 3c for generating the channel quality parameter.
  • the means 302, 303, 304a-304c and 305a-305c in Figure 3b, or the means 402, 403, 404a-404c and 405a-405c in Figure 3c have been drawn as one single means 501.
  • the first channel quality lists 305a or 405a is connected to the first sorting means 409a for mean value formation and sorting, said first sorting means 409a operating in accordance with the principle described with reference to the Figure 4 embodiment.
  • the second and the third channel quality lists 305b, 405b and 305c, 405c are connected to respective second and third sorting means 409b and 409c in the same way.
  • Figure 5 shows the means 212-215 in Figure 3a as a single means 502, for space saving reasons.
  • the means 502 thus has functions corresponding to the functions of the means 212-215 shown in Figure 3a.
  • FIG. 6 is a block schematic illustrating a fourth embodiment of the invention and the channel allocation means 211.
  • the means 220a thus generates only one channel hopping sequence per connection, said channel hopping sequence being used for transmission from the base station, for instance.
  • the means 220b for generating channel hopping sequences operates in accordance with the same principles as the means 220a and generates one channel hopping sequence for each connection, these channel hopping sequences being used in reception in the base station when the channel hopping sequences generated in the means 220a are used for transmission in said base station.
  • the means 220a receives from the means 601 input data that relates to the channels. This means is corresponded by the means 408a-408c, 409a-409c and 307a-307c in Figure 4. These input data have been obtained by measuring the interference in the downlink as described with reference to Figure 4.
  • the means 220b obtains channel input data from the means 216, as earlier described with reference to Figures 3b and 3c. These input data have been obtained by measuring the interference in the uplink, as described with reference to Figures 3b and 3c. Because the interference values measured in the uplink and downlink are not mixed, as described with reference to Figure 5, totally independent channel hopping sequences can be created in the means 220a-220b, wherein one channel hopping sequence is used for transmission and the other channel hopping sequence is used for reception in the base station.
  • the hopping sequences are stored in the hopping sequence lists 201-203 in the base station, and are transferred to the hopping sequence lists 204- 206 in the mobile stations on the control channel SACCH in the aforedescribed manner.
  • the means 212-215 in Figure 3a are shown as a single means 502 in Figure 6, for space saving reasons. The means 502 thus performs functions corresponding to those of the means 212-215 in Figure 3a.
  • Figure 7 is a flowchart illustrating an inventive channel hopping method.
  • step 700 the channel hopping sequences are divided into sequence intervals Ti.
  • the duration of a sequence interval corresponds to the time between two channel hops within a channel hopping sequence Ti.
  • a signal attenuation parameter ⁇ is generated for each established connection F1-F3.
  • the signal attenuating parameter may be generated by measuring the attenuation in the uplink and/or the downlink of each connection.
  • each frequency may relate, for instance, to all frequencies in a base station or to all frequencies in the entire telecommunications system, or a predetermined subset of these frequencies.
  • the channel quality parameter can be generated by measuring the interference in the uplink and/or the downlink for each frequency fl-fn and for each generating interval ⁇ T k within each sequence interval T x .
  • Other magnitudes such as the C/I value or the bit error rate, BER, and used as input data within each sequence interval 1 i for calculating an interference value for each frequency f ].
  • -f n and generating interval ⁇ T k are examples of the interference value for each frequency f .
  • the generating interval ⁇ T k may be the time of the whole of the sequence interval T r or for a part of said sequence interval.
  • the generating interval ⁇ T k may, for instance, be the time duration of a time slot in a TDMA frame in a TDMA system. In this latter case, an interference value is obtained for each channel chl-chn and for each sequence interval T x .
  • step 703 the obtained values of the signal attenuation parameter are stored in a connection list 213, and the obtained values of the channel quality parameter are stored in a respective channel quality list 307a-307c or 407a-407c for respective sequence intervals T x -T 3 .
  • step 704 the connections are sorted in accordance with the measured signal attenuation parameter (attenuation) and the connections are then stored in the sorted connection list 215.
  • a mean attenuation value is calculated for each connection and the connections then sorted in accordance with the calculated mean value.
  • step 705 the frequencies/channels for respective sequence intervals T. L -T 3 are sorted in accordance with the measured channel quality parameter (interference) and then stored in the sorted channel lists 307a-307c or 407a-407c.
  • a mean interference value is calculated for each frequency/channel within respective sequence intervals T 1 -T 3 , and the frequencies/channels are then sorted within respective sequence intervals T ⁇ T j in accordance with the calculated mean value.
  • step 706 there is applied a method for generating channel hopping sequences as described above with reference to the means 216 for generating channel hopping sequences.
  • the respective channel/frequency that is to be used during a respective sequence interval in the channel hopping sequence is selected in accordance with its position in the channel list for said respective sequence interval .
  • Channel hopping sequences having successively poorer channel quality than the best channel hopping sequence are then generated.
  • the channel hopping sequences can be used for transmitting from either the base station or the mobile station.
  • Corresponding channel hopping sequences for receiver use may be created with the aid of the duplex spacing as described above.
  • Another possibility is to generate channel hopping sequences for both transmission and reception for each connection with the aid of the channel hopping sequence generating method in which duplex spacing is not used. It will be understood that a channel hopping sequence that is used for transmission in the base station shall be used for reception in the mobile station, and a channel hopping sequence that is used for transmission in the mobile station shall be used for reception in the base station.
  • step 707 there is carried out a check to ascertain whether or not the allocation of channel hopping sequences to the connections (F1-F3) shall be updated. If the reply is negative, in accordance with alternative N, the procedure is repeated from step 701 without updating.
  • each connection is allocated a channel hopping sequence in step 708 in accordance with the principle that a connection of poor connection quality with respect to the signal attenuation parameter is allocated a channel hopping sequence of good quality with respect to the channel quality parameter.
  • the worst connection with respect to the signal attenuation parameter is allocated the best channel hopping sequence with respect to the channel quality parameter.
  • Successively better connections are allocated successively poorer channel hopping sequences. As earlier described with reference to Figure 3c, several channel hopping sequences may have the same channel quality. More connections can then be allocated a channel hopping sequence that includes channels having the same channel quality.
  • the channel hopping sequences are stored in hopping sequence lists 201, 204-206 in the base station and the mobile stations.
  • the base station includes a hopping sequence list for each connection and the hopping sequence lists each includes channel hopping sequences for transmission and reception respectively.
  • the respective transmission and reception channel hopping sequences that are to be used by the mobile stations are transferred to said stations on a control channel SACCH and then stored in respective hopping sequence lists in the mobile stations.
  • the procedure is repeated after step 708, wherein a hop to step 701 takes place.
  • the channel allocation means 211 shall create "new" channel hopping sequences continuously, wherewith a new channel hopping sequence may replace an "old" channel hopping sequence when the difference in the call quality of the two channel hopping sequences exceeds a predetermined threshold value, or when the interference level exceeds a predetermined value, for instance. Updating need not be complete, i.e. the channel hopping sequences may be updated only with respect to those connections with which the difference in call quality exceeds the threshold value. It may be necessary to update when new connections are established or when the reception conditions have been changed as a result of movement of the mobile stations.
  • the invention can also be implemented without generating the channel hopping sequences continuously.
  • a set of channel hopping sequences may be generated in accordance with the inventive method, for instance when starting-up the radio communications system.
  • a new set of channel hopping sequences can be generated and used in the next updating, and so on.
  • steps 704 and 705 may be jumped, wherewith the information stored in the connection and channel lists 213, 217 will constitute input data to the hopping sequence algorithm used in step 706.
  • the hopping sequence algorithm does not function in accordance with the earlier described algorithms in this particular case. Because no sorted connection lists and channel lists respectively are produced, the hopping sequence algorithm must itself find those channels that are to be used and to allocate these channels to correct connections.
  • implementation of the hopping sequence algorithm itself can be achieved in several ways, although all hopping sequence algorithms will function in accordance with the principle: The poorer a connection with respect to a signal attenuation parameter, the better the channel with respect to a channel quality parameter allocated to the connection.
  • the hopping sequence lists in the base and the mobile stations may include only one channel hopping sequence.
  • means are included for generating a further channel hopping sequence for each connection, e.g. by using the duplex spacing. Said means allocates one of the channel hopping sequences to the transmitter and the other channel hopping sequence to the receiver.
  • the radio communications system has been described in the preferred embodiment as including base stations within whose respective radio coverage area available channels are used in base orthogonal channel hopping sequences in radio communication with those mobile stations that are located within a given base station coverage area.
  • the base station may be considered generally as a first radio station and the mobile stations as a number of second radio stations.
  • the available channels within a coverage area may comprise a number of channels that are specifically allocated to the base station, a subset of the total number of channels, or all channels in the radio communications system, wherein signal attenuation parameters are generated for these channels. It is also possible to implement parts of the described embodiment in a mobile switching centre, MSC, or in a base station switching centre, BSC, which in such case will include means for achieving the functionality of the aforedescribed means.
  • Channel quality parameter and/or the signal damping parameter need not necessarily imply continuous physical measurement of a magnitude.
  • Said parameters may also be generated on the basis of theoretically generated parameter values, for instance, when starting-up the radio communications system. This can be achieved with the aid of theoretical computation models when planning the system.
  • Channel hopping sequences are then generated in accordance with the generated values, as before described. These channel hopping sequences can then be used until an update of the radio communications system is performed, wherewith new theoretical values are generated.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
PCT/SE1997/000846 1996-05-31 1997-05-22 Channel hopping in a radio communications system WO1997045966A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
JP09542180A JP2000512446A (ja) 1996-05-31 1997-05-22 無線通信システムにおけるチャネルホッピング方法および装置
EP97926315A EP0890224A1 (en) 1996-05-31 1997-05-22 Channel hopping in a radio communications system
BR9709392A BR9709392A (pt) 1996-05-31 1997-05-22 Processo de salto de canais e aparelho em sistemas de comunicações por rádio
AU31107/97A AU3110797A (en) 1996-05-31 1997-05-22 Channel hopping in a radio communications system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
SE9602152-2 1996-05-31
SE9602152A SE518262C2 (sv) 1996-05-31 1996-05-31 Kanalhoppning i ett radiokommunikationssystem

Publications (1)

Publication Number Publication Date
WO1997045966A1 true WO1997045966A1 (en) 1997-12-04

Family

ID=20402823

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE1997/000846 WO1997045966A1 (en) 1996-05-31 1997-05-22 Channel hopping in a radio communications system

Country Status (10)

Country Link
EP (1) EP0890224A1 (es)
JP (1) JP2000512446A (es)
KR (1) KR20000010975A (es)
AR (1) AR007367A1 (es)
AU (1) AU3110797A (es)
BR (1) BR9709392A (es)
CA (1) CA2253274A1 (es)
SE (1) SE518262C2 (es)
TW (1) TW332357B (es)
WO (1) WO1997045966A1 (es)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999049597A1 (en) * 1998-03-26 1999-09-30 Samsung Electronics Co., Ltd. Device and method for assigning spreading code for reverse common channel message in cdma communication system
WO1999063686A1 (en) * 1998-05-29 1999-12-09 Nokia Networks Oy A method for data transmission in a cellular telecommunication system
US6233270B1 (en) 1999-09-28 2001-05-15 Telefonaktiebolaget Lm Ericsson (Publ) Interference diversity in synchronized networks
CN102326345A (zh) * 2011-08-10 2012-01-18 华为技术有限公司 一种干扰测量方法和装置
WO2014032721A1 (en) * 2012-08-30 2014-03-06 Abb Research Ltd Fast frequency hopping adapted to the environment
US8891414B2 (en) 2000-12-15 2014-11-18 Adaptix, Inc. Multi-carrier communications with adaptive cluster configuration and switching
EP3007505A1 (en) * 2014-10-06 2016-04-13 Mitsubishi Electric R&D Centre Europe B.V. Method for signalling time and frequency resources allocation in a wireless communication system
CN105900370A (zh) * 2014-01-10 2016-08-24 三菱电机株式会社 用于确定时间和频率资源的方法和系统

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2744141B1 (en) * 2012-12-17 2017-09-06 Mitsubishi Electric R&D Centre Europe B.V. Method and device for allocating time and frequency resources for at least one data transmission via a fast fading frequency selective channel
CN112019234B (zh) * 2019-05-29 2022-08-16 鹤壁天海电子信息系统有限公司 一种数据传输方法、发射机及接收机

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4716573A (en) * 1984-11-19 1987-12-29 Telefonaktiebolaget Lm Ericsson Method of reducing the effect of narrowband jammers in radio communication between two stations
WO1996002979A2 (en) * 1994-07-15 1996-02-01 Telefonaktiebolaget Lm Ericsson Channel hopping in a radio communications system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4716573A (en) * 1984-11-19 1987-12-29 Telefonaktiebolaget Lm Ericsson Method of reducing the effect of narrowband jammers in radio communication between two stations
WO1996002979A2 (en) * 1994-07-15 1996-02-01 Telefonaktiebolaget Lm Ericsson Channel hopping in a radio communications system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
MINOR TOPICS IN SPREAD SPECTRUM COMMUNICATIONS, 8 October 1992, KAELLQUIST P. et al., "Adaptive Frequency Hopping in HF Environments", ch.2.6, ch.5 Appendix E. *

Cited By (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999049597A1 (en) * 1998-03-26 1999-09-30 Samsung Electronics Co., Ltd. Device and method for assigning spreading code for reverse common channel message in cdma communication system
AU754893B2 (en) * 1998-03-26 2002-11-28 Samsung Electronics Co., Ltd. Device and method for assigning spreading code for reverse common channel message in CDMA communication system
US6674739B1 (en) 1998-03-26 2004-01-06 Samsung Electronics Co., Ltd. Device and method for assigning spreading code for reverse common channel message in CDMA communication system
WO1999063686A1 (en) * 1998-05-29 1999-12-09 Nokia Networks Oy A method for data transmission in a cellular telecommunication system
US7440422B1 (en) 1998-05-29 2008-10-21 Nokia Corporation Method for data transmission in a cellular telecommunication system
US6233270B1 (en) 1999-09-28 2001-05-15 Telefonaktiebolaget Lm Ericsson (Publ) Interference diversity in synchronized networks
US6671309B1 (en) 1999-09-28 2003-12-30 Telefonaktiebolaget Lm Ericsson (Publ) Interference diversity in communications networks
US8958386B2 (en) 2000-12-15 2015-02-17 Adaptix, Inc. Multi-carrier communications with adaptive cluster configuration and switching
US9210708B1 (en) 2000-12-15 2015-12-08 Adaptix, Inc. OFDMA with adaptive subcarrier-cluster configuration and selective loading
US8891414B2 (en) 2000-12-15 2014-11-18 Adaptix, Inc. Multi-carrier communications with adaptive cluster configuration and switching
US8934445B2 (en) 2000-12-15 2015-01-13 Adaptix, Inc. Multi-carrier communications with adaptive cluster configuration and switching
US8934375B2 (en) 2000-12-15 2015-01-13 Adaptix, Inc. OFDMA with adaptive subcarrier-cluster configuration and selective loading
US9344211B2 (en) 2000-12-15 2016-05-17 Adaptix, Inc. OFDMA with adaptive subcarrier-cluster configuration and selective loading
US8964719B2 (en) 2000-12-15 2015-02-24 Adaptix, Inc. OFDMA with adaptive subcarrier-cluster configuration and selective loading
US9219572B2 (en) 2000-12-15 2015-12-22 Adaptix, Inc. OFDMA with adaptive subcarrier-cluster configuration and selective loading
US9191138B2 (en) 2000-12-15 2015-11-17 Adaptix, Inc. OFDMA with adaptive subcarrier-cluster configuration and selective loading
US9203553B1 (en) 2000-12-15 2015-12-01 Adaptix, Inc. OFDMA with adaptive subcarrier-cluster configuration and selective loading
CN102326345A (zh) * 2011-08-10 2012-01-18 华为技术有限公司 一种干扰测量方法和装置
CN104718710A (zh) * 2012-08-30 2015-06-17 Abb研究有限公司 适合环境的快速跳频
WO2014032721A1 (en) * 2012-08-30 2014-03-06 Abb Research Ltd Fast frequency hopping adapted to the environment
US9419678B2 (en) 2012-08-30 2016-08-16 Abb Research Ltd. Fast frequency hopping adapted to the environment
CN104718710B (zh) * 2012-08-30 2016-09-07 Abb研究有限公司 适合环境的快速跳频
CN105900370A (zh) * 2014-01-10 2016-08-24 三菱电机株式会社 用于确定时间和频率资源的方法和系统
CN105900370B (zh) * 2014-01-10 2019-03-08 三菱电机株式会社 用于确定时间和频率资源的方法和系统
EP3007505A1 (en) * 2014-10-06 2016-04-13 Mitsubishi Electric R&D Centre Europe B.V. Method for signalling time and frequency resources allocation in a wireless communication system
WO2016056209A1 (en) * 2014-10-06 2016-04-14 Mitsubishi Electric Corporation Method for signalling time and frequency resources allocation in wireless communication system
US10075967B2 (en) 2014-10-06 2018-09-11 Mitsubishi Electric Corporation Method for signaling time and frequency resources allocation in wireless communication system

Also Published As

Publication number Publication date
AR007367A1 (es) 1999-10-27
TW332357B (en) 1998-05-21
JP2000512446A (ja) 2000-09-19
EP0890224A1 (en) 1999-01-13
SE518262C2 (sv) 2002-09-17
CA2253274A1 (en) 1997-12-04
SE9602152L (sv) 1997-12-01
KR20000010975A (ko) 2000-02-25
AU3110797A (en) 1998-01-05
BR9709392A (pt) 1999-08-10
SE9602152D0 (sv) 1996-05-31

Similar Documents

Publication Publication Date Title
US6298081B1 (en) Channel hopping in a radio communications system
US5937002A (en) Channel hopping in a radio communication system
CN102595616B (zh) 蜂窝通信网络中的测量辅助的动态频率重用
US6119011A (en) Cost-function-based dynamic channel assignment for a cellular system
US6154655A (en) Flexible channel allocation for a cellular system based on a hybrid measurement-based dynamic channel assignment and a reuse-distance criterion algorithm
US6223031B1 (en) Process and device for quality determination
US20030040319A1 (en) Dynamic frequency selection in a wireless communication network
KR19990087406A (ko) 원격 통신 시스템에서의 적응성 주파수 할당
JP2001507889A (ja) 空間分割多重アクセス通信システムのためのチャネル割り当て及び通話進入許可制御
AU1879399A (en) Levelling out of interference in a mobile network using a hopping method
US6137993A (en) Method and apparatus for estimating path loss in a radio communications system
KR100654278B1 (ko) 하이브리드 tdma/cdma 통신 시스템에서의 채널할당 방법 및 시스템
EP0890224A1 (en) Channel hopping in a radio communications system
US6134442A (en) Controlling operations in a cellular system using neighbor association-based cost values
EP1829240B1 (en) Power control and channel selection in a multi channel communication system
JP3207135B2 (ja) ダイナミックチャネル割当方法
CN106817703B (zh) 一种频点优化方法及装置
AU695708C (en) Channel hopping in a radio communications system
MXPA98009874A (es) Salto de canales en un sistema de radiocomunicaciones
MXPA97000382A (es) Variacion de saltos de canal en un sistema de radiocomunicaciones

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GE GH HU IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK TJ TM TR TT UA UG UZ VN YU AM AZ BY KG KZ MD RU TJ TM

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH KE LS MW SD SZ UG AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 1997926315

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2253274

Country of ref document: CA

Ref country code: CA

Ref document number: 2253274

Kind code of ref document: A

Format of ref document f/p: F

WWE Wipo information: entry into national phase

Ref document number: 1019980709124

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: PA/a/1998/009874

Country of ref document: MX

WWP Wipo information: published in national office

Ref document number: 1997926315

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWP Wipo information: published in national office

Ref document number: 1019980709124

Country of ref document: KR

WWW Wipo information: withdrawn in national office

Ref document number: 1997926315

Country of ref document: EP

WWR Wipo information: refused in national office

Ref document number: 1019980709124

Country of ref document: KR