AU2015203120B2 - Frequency hopping technique for EUTRA uplink - Google Patents

Abstract

FREQUENCY HOPPING TECHNIQUE FOR EUTRA UPLINK 5 A communications system (1) is described in which user devices (3-0, 3-1, and 3-2) communicate with an associated base station (5-1). The user devices employ frequency hopping techniques to provide frequency diversity in their communications with the base station. Methods and techniques are described for reducing collisions between the communications from the different user devices and for the efficient signalling of data 10 defining the frequency hopping sequence to use. The embodiments are particularly suitable for use in the uplink of the E-UTRA communications scheme.

Description

1 2015203120 11 Jun2015

DESCRIPTION

FREQUENCY HOPPING TECHNIQUE FOR EUTRA UPLINK TECHNICAL FIELD 5 The present invention relates to frequency within a communication system. The invention has particular, although not exclusive relevance to the efficient signalling of frequency hopping information between devices of a communication system that uses Frequency Divisional Multiple Access (FDMA) techniques. 10 This application is based upon and claims the benefit of priority from United Kingdom Patent Application No. 0702190.0, filled on February 5, 2007, the disclosure of which is incorporated herein in its entirety by reference.

The application is a divisional application of Australian Patent 15 Application No. 2014202777 filed on 21 May 2014 the disclosure of which is incorporated herein in its entirety by reference. The disclosures of Australian Patent Application No. 2008215596, filed on 30 January 2008, and Australian Patent Application No. 2013201702 filed on 20 March 2013 are also incorporated herein in their entirety by reference. 20 Localised FDMA with inter and intra Transmission Time Interval (TTI) Frequency Hopping (L-FDMA+FH) has been selected as the uplink multiple access scheme for the E-UTRA air interface currently been studied in 3GPP (which is a standard based collaboration looking at the future evolution of third generation mobile telecommunication systems). Under the 25 E-UTRA system, a base station (ENodeB) which communicates with a number of user devices (UEs) allocates the total amount of time/frequency resource among as many simultaneous users as possible, in order to enable efficient and fast link adaptation and to attain maximum multi-user diversity gain. 30 10112154 (IRN: 912308D7) 2 2015203120 03 Aug 2016

In such communication system, problems arise in determining how to perform the frequency hopping in the different user devices and how to signal a selected frequency hopping scheme to each user device so that they know which resources to use for their communications.

5 DISCLOSURE

An aspect of the present invention provides a communications node operable to communicate with another communications node via resource blocks, the communications node comprising: a transceiver circuit configured to receive a parameter which defines a resource allocation of contiguous resource blocks; a memory 0 comprising a resource determination module configured to determine a communication resource by applying a frequency shift to the resource allocation of contiguous resource blocks; and wherein the transceiver circuit is further configured to communicate with the another communications node using the determined communication resource; wherein the frequency shift is determined based on a frequency hopping function and a number 5 of contiguous resource blocks in a sub-band.

Another aspect of the present invention provides a communications node operable to communicate with another communications node, the communications node including: means for receiving resource allocation information which indicates a set of contiguous resource blocks; means for determining at least one resource block to be :0 used for transmission in a slot; and means for communicating with the another communications node using the determined at least one resource block wherein the at least one resource block to be used for transmission is determined based on a first value and a second value; wherein the first value is obtained from the resource allocation information; and wherein the second value is determined based on a hopping 25 function multiplied by a size of a sub-band.

Another aspect of the present invention provides a communications node operable to communicate with another communications node via resource blocks, the communications node comprising: a memory comprising a resource allocation module configured to allocate contiguous resource blocks; and a transceiver circuit configured to 30 transmit, to the another communications node, a parameter which defines the allocation of contiguous resource blocks; wherein the memory further comprises a resource determination module configured to determine a communication resource by applying a frequency shift to the resource allocation of contiguous resource blocks; wherein the 11479408vl1 3 2015203120 03 Aug 2016 transceiver circuit is further configured to communicate with the another communications node using the determined communication resource; and wherein the frequency shift is determined based on a frequency hopping function and a number of contiguous resource blocks in a sub-band. 5 Another aspect of the present invention provides a communications node operable to communicate with another communications node, the communications node including: means for allocating contiguous resource blocks; means for transmitting, to the another communications node, resource allocation information which indicates, to the another communications node, a set of contiguous resource blocks; means for 0 determining at least one resource block to be used for reception in a slot; and means for communicating with the another communications node using the determined at least one resource block; wherein the at least one resource block to be used for reception is determined based on a first value and a second value; wherein the first value is obtainable from the resource allocation information; and wherein the second value is 5 determined based on a hopping function multiplied by a size of a sub-band. Another aspect of the present invention provides a method of a communications node communicating with another communications node via resource blocks, the method comprising: receiving, from the another communications node, a parameter which defines a resource allocation of contiguous resource blocks; determining a :0 communication resource by applying a frequency shift to the resource allocation of contiguous resource blocks; communicating with the another communications node using the determined communication resource; wherein the frequency shift is determined based on a frequency hopping function and a number of contiguous resource blocks in a sub-band. 25 Another aspect of the aforementioned present invention provides a communication system including at least one of the aforementioned communications nodes.

Another aspect of the present invention provides a method of a communications node communicating with another communications node via resource blocks, the 30 method comprising: allocating contiguous resource blocks; transmitting, to the another communications node, a parameter which defines the allocation of contiguous resource blocks; determining a communication resource by applying a frequency shift to the resource allocation of contiguous resource blocks; and communicating with the another 11479408vl1 4 2015203120 03 Aug 2016 communications node using the determined communication resource; wherein the frequency shift is determined based on a frequency hopping function and a number of contiguous resource blocks in a sub-band.

Another aspect of the present invention provides a method of a communications 5 node communicating with another communications node via resource blocks, the method including: receiving, from the another communications node, resource allocation information which indicates a set of contiguous resource blocks; determining at least one resource block to be used for transmission in a slot; communicating with the another communications node using the determined at least one resource block; 0 wherein the at least one resource block to be used for transmission is determined based on a first value and a second value; wherein the first value is obtained from the resource allocation information; and wherein the second value is determined based on a hopping function multiplied by a size of a sub-band.

Another aspect of the present invention provides a method of a communications 5 node communicating with another communications node via resource blocks, the method including: allocating contiguous resource blocks; transmitting, to the another communications node, resource allocation information which indicates a set of contiguous resource blocks; determining at least one resource block to be used for reception in a slot; and communicating with the another communications node using the :0 determined at least one resource block; wherein the at least one resource block to be used for transmission is determined based on a first value and a second value; wherein the first value is obtainable from the resource allocation information; and wherein the second value is determined based on a hopping function multiplied by a size of a subband. 25 As those skilled in the art will appreciate, embodiments of the present invention relate to a number of different components of a system that can be made and sold separately. Embodiments of the present invention also extend to these components alone as well as to the system as a whole.

As those skilled in the art will appreciate, the above aspects can be implemented 30 separately or in any combination in a communications system. A specific exemplary embodiment will be described below which applies all the above aspects in a communications system. 11479408v11 5 2015203120 03 Aug 2016

BRIEF DESCRIPTION OF THE DRAWINGS

These and various other aspects of the invention will become apparent, from the following detailed description of an exemplary embodiment which is given by way of example only and which is described with reference to the accompanying Figures in 5 which:

Figure 1 schematically illustrates a communication system comprising a number of user mobile (cellular) telephones which communicate with one of two base stations connected to the telephone network;

Figure 2 illustrates the structure of a sub-frame of the E-UTRA communication 0 systems;

Figure 3 is a block diagram illustration a shift register used for generating a pseudo random binary sequence for controlling the frequency hopping to be used by each user mobile telephone; 5 [THE NEXT PAGE IS PAGE 7] 11479408vl1 7 2015203120 11 Jun2015 £ to

IS 20 23

Figure 4 is a time and frequency plot illustrating the way in which some Of the available time and frequency-resource blocks have been assigned to four mobile telephones; Figure 5 is a block diagram illustrating the main components of one of the base stations shown in Figure 1; Figure 6 is a block diagram illustrating the main components of one of the mobile telephones shown in Figure 1; Figure 7 is a block diagram illustrating a shift register arrangement like in Figure 3; and Figure 8 is a time and frequency plot showing a hopping pattern for four UEs (user devices) in a cell like in Figure 4. BEST MODE FOR CARRYING OUT THE INVENTION Overview Figure 1 schematically illustrates a mobile (cellular) telecommunication system 1 in which users of mobile telephones 3-0, 3-1, and 3-2 in a first cell 4-1 can communicate with other users (not shown) via a first base station 5-1 and a telephone network 7 and in which users of mobile telephones 3-3, 3-4, and 3-5 in a second cell 4-2 can communicate with other users (not shown) via a second base station 5-2 and the telephone network 7. In this exemplary embodiment, the base stations 5 use an orthogonal frequency division multiple access (OFDMA) transmission technique for the downlink (from base stations 5 to the mobile telephones 3) and a L-DMA+FH transmission technique for the uplink (from the mobile telephones 3 to the base stations 5). The use of frequency hopping for the uplink has been chosen because it provides service quality improvements through interference averaging and frequency diversity. In this exemplary embodiment, the frequency hopping scheme is chosen so that the following requirements are preferably met: 10102064 (IRN: 912308D7) 8 2015203120 llJun2015 - No collision between hopping mobile telephones 3 in the same cell 4; - Different hopping patterns in neighbouring cells 4 to reduce inter-cell interference; - High degree of frequency diversity for one mobile telephone 3 ^ throughout the hopping pattern for subsequent transmissions; - Preserve the single carrier property of L-FDMA (in which the allocated frequency resources are provided as a single contiguous block of frequency resources); - Minimise the signalling overhead for informing the mobile telephones IO 3 of the hopping sequence; and - Frequency hopping designed for use by persistently scheduled mobile telephones 3 that are using, for example, services such as VoIP, as well as mobile telephones 3 that are dynamically scheduled on a TT1 by ΤΠ basis. t 5 Time/Frequency Resources

In this exemplary embodiment, the available transmission band is divided into a number of sub-bands, each of which comprises a number of contiguous sub-carriers arranged in contiguous blocks. Different mobile telephones 3 are allocated different resources block(s) (sub-carriers) within a 20 sub-band at different times for transmitting their data. Figure 2 illustrates E-UTRA's latest definition of the transmission channel as comprising a sequence of 1ms Transmission Time Intervals (TTIs) 11-1, 11-2, each of which consists of two 0.5ms slots 13-1 and 13-2. As shown, the available transmission bandwidth is divided into S sub-bands 15-1 to 15-s and each 2.5 mobile telephone 3 is scheduled to transmit its uplink data in selected slots 13 and in selected sub-bands 15, in accordance with the agreed frequency hopping sequence.

Two different types of frequency hopping can be applied - Inter TTI 10102064 (IRN: 912308D7) 9 2015203120 11 Jun2015 frequency hopping and Intra TTI frequency hopping. Inter TTI frequency hopping is when the allocated frequency resource is changed from one TTI 11 to the next and intra TTI frequency hopping is where the allocated frequency resource is changed from one slot 13 to the next. The technique to be S described below is applicable to both Inter and Intra TTI frequency hopping, although the description will refer mainly to Inter TTI frequency hopping.

Proposed Frequency Hopping Scheme

The frequency hopping scheme used in this exemplary embodiment I O relies on each mobile telephone 3 being given an initial allocation of resource blocks (one or more contiguous blocks of sub-carriers) within one of the sub-bands. These initial allocations are assigned by the base station 5, and so it can make sure that there are no collisions between the initial allocations for the mobile telephones 3 within its cell 4. These initial allocations are then changed 1 jn accordance with a hopping sequence allocated to the cell 4. The change applied at any point in time is an integer multiple of the number of resources in each sub-band. As a result, the frequency hopped resources that are allocated to a mobile telephone 3 will also be a contiguous block of resources in a single sub-band. This is beneficial as it allows the power amplifier (not shown) used 20 by the mobile telephones 3 to be more etficient than would be the case if the resources used are not contiguous and are not in the same sub-band. It follows that, to maintain this advantage, the largest allowable contiguous allocation for a hopping mobile telephone 3 corresponds to the number of resource blocks in a sub-band. 2-5 Mathematically, the frequency hopping scheme used in this exemplary embodiment can be defined as follows: y = {x + a(t)N} mod NRB Equation 1, where 10102064 (IRN: 912308D7) 10 £ΐ03 unf 11 ozmzsioz

Nrb is the total number of resource blocks in the transmission band; N is the number of contiguous resource blocks in each sub-band; x is the initial resource block allocated to the mobile telephone; y is the frequency hopped resource block; 5 t is a TTI (or slot) counter synchronised between the base station 5 and the mobile telephone 3; a(t) is the current frequency hopping shift and is an integer value from the set{u: and S is the number of sub-hands.

Figure 3 illustrates a shift register used for generating a pseudo random binary sequence for controlling the frequency hopping to be used by each user mobile telephone. The shift register of Figure 3 will later be described.

Figure 4 illustrates a hopping pattern that can be generated in the above 1 manner for four mobile telephones (MTs), where MT1 to MT3 are assigned one resource block each while MT4 is assigned two resource blocks. In this example, a(t) has values of 0, 2, S-1 and 1 for TTI#0, TTI#1, TTI#2 and TTI#n respectively.

The way in which contiguous resource blocks can be allocated for the 20 uplink and signalled to User Equipment (such as the mobile telephones 3) has already been proposed in TSG-RAN R1-070364, "Uplink Resource Allocation for EUTRA" NEC Group, NTT DoCoMo, the contents of which are incorporated herein by reference. As those skilled in the art will appreciate, if a mobile telephone 3 is assigned more than one resource block (x), then the calculation 2-S above is performed for each assigned resource block.

In this exemplary embodiment, NrBi N and S are system semi-static constants and are programmed into the mobile telephones 3 and the base stations 5 in advance. At any given time, the allocated resource block, x, is 10102064 (IRN: 912308D7) 11 2015203120 11 Jun2015 different for each of the mobile telephones 3 in the same cell 4. However, the value of a(t) at any point in time is common-for ail mobile telephones 3 in the same cell 4 and the value is changed in accordance with a predetermined hopping sequence. The hopping sequence preferably has the following properties: 1. It should be different in different cells 4 in order to randomise inter-cell interference; 2. It should be simple to generate (to minimise computational ioaa in the base stations 5 and the mobile telephones 3);

lO \6 3. It should be defined by a small number of parameters (to minimise signalling load); and 4. It should be periodic with a period, T, that is much longer than the transmission interval of persistently scheduled users (otherwise there is a risk that the transmission interval is equal to the period of a(t), in which case there would be no frequency diversity).

In the event that some TTIs are set aside for hopping mobile telephones 3, the hopping shift a(t) would only be applied in those TTIs. Dynamically scheduled mobile telephones 3 may still be scheduled in such 'hopping TTIs' in 20 any resource blocks which are not occupied by the hopping mobile telephones 3.

There are a number of different ways of generating a(t) in the mobile telephones 3 and the base station 5. One possibility is use a pseudo-random sequence, resetting the sequence every T TTIs (or slots). A large number of sequences could easily be generated in this way and the sequence number 2.5 could be signalled efficiently. For example, consider the shift register arrangement 17 shown in Figure 3, which produces a length 2047 pseudo-random binary sequence (PRBS). The state of the shift register 17 is updated each TTI (or slot). If the 11 bit shift register value at time t is 10102064 (IRN: 912308D7) 12 2015203120 11 Jun2015 represented by m(t), then a pseudo-random value in the range 0 to S-1 can be calculated, for example, as follows: a(t) = floor[(m(t).S)/2048] Equation 2, where floor[r] is the floor function, ie the largest integer not greater than r. ^ This calculation is easy to perform using a multiplication and bit shift.

By resetting the shift register every T =256 TTIs (or slots), eight different sequences can be produced using different initial states. More specifically, the shift register 17 shown in Figure 3 cycles through 2047 states that we can label s(0) to s(2046). As the registers are being reset every 256 TTIs (or slots), the I O register will only cycle through 256 of its 2047 possible states. Therefore, it is possible to use the same shift register 17 to generate different a(t) sequences, simply by starting the shift register 17 at different initial states. For example, a first a(t) sequence can be defined by setting the shift register 17 into initial state s(0); a second a(t) sequence can be defined by setting the shift registers 17 into I £5 initial state s(256); a third a(t) sequence can be defined by setting the shift registers 17 into initial state s(512) etc. Different sequences can then be assigned to the base station 5 and the mobile telephones 3 in the different cells 4, thereby avoiding the possibility that two mobile telephones 3 in different cells 4 could be following exactly the same frequency hopping pattern and therefore 20 colliding 100% of the time. The mobile telephones 3 in a given cell 4 may be signalled with the initial state, but this would require eleven bits of signalling overhead. Therefore, in this exemplary embodiment, all the initial states are pre-programmed into the mobile telephones 3 and the appropriate one to be used by the mobile telephones 3 in a cell are signalled to the mobile telephones 2.5 3 using an associated sequence identifier (which would be a 3-bit identifier for the above example having eight different sequences).

Base Station 10102064 (IRN: 912308D7) 13 2015203120 llJun2015

Figure 5 is a block diagram illustrating the main components of each of the base stations 5 used in this exemplary embodiment. As shown, each-base station 5 includes a transceiver circuit 21 which is operable to transmit signals to and to receive signals from the mobile telephones 3 via one or more antennae 5 23 and which is operable to transmit signals to and to receive signals from the telephone network 7 via a network interface 25. The operation of the transceiver circuit 21 is controlled by a controller 27 in accordance with software stored in memory 29. in this exemplary embodiment, the software in memory 29 includes, among other things, an operating system 31, a resource allocation l O module 33 and a resource determination module 34 (which modules may form part of the operating system 31).

The resource allocation module 33 is operable for allocating initial resource blocks (x) to be used by each of the mobile telephones 3 in their communications with the base station 5. This initial resource allocation 15 depends on the type and quantity of data to be transmitted by the user device.

For users subscribing to services where regular but small amounts of data are to be transmitted, the resource allocation module 33 allocates appropriate resource blocks on a recurring or periodic basis. For a VoIP service, for example, this may result in the user being allocated resource blocks every 20ms. This type of 20 allocation is referred to as persistent allocation. For users with larger volumes of data to be transmitted, the resource allocation module will allocate the appropriate resource blocks on dynamic basis, taking into account the current channel conditions between the user's mobile telephone 3 and the base station 5. This type of allocation is referred to as dynamic allocation. 2.5 The resource determination module 34 is provided for determining the actual frequency resources that each mobile telephone 3 will use to transmit its data to the base station 5. The resource determination module 34 uses the determined frequency resources to control the operation of the transceiver circuit 10102064 (IRN: 912308D7) 14 2015203120 llJun2015 21 so that the data received from each mobile telephone 3 can be recovered and forwarded as appropriate to the telephone network 7. To achieve this, the resource determination module 34 implements the above described shift register 17-5 and TTi (or slot) counter (t) 35 (although these could be implemented as 5 hardware in the controller 27), so that it can keep track of which resource block or blocks will actually be used by each mobile telephone 3 at each point in time, using equations 1 and 2 above and the initial allocations made by the resource allocation module 33. in this exemplary embodiment, the resource determination module 34 receives a sequence identifier from the telephone I O network 7 identifying the initial state to be applied to its shift register 17-5. The resource determination module 34 uses the sequence identifier to retrieve the corresponding initial state from memory which it then uses to set the initial state of the shift register 17-5. The resource determination module 34 also signals the received sequence identifier to all the mobile telephones 3 in its cell 4. The 15 resource determination module 34 also transmits synchronisation data to synchronise the TTI (or slot) counters in the mobile telephones 3 with its own TTI (or slot) counter 35, so that the base station 5 and the mobile telephones 3 can maintain synchronisation in applying the frequency hopping sequence (a(t)). 20 Mobile Telephone

Figure 6 schematically illustrates the main components of each of the mobile telephones 3 shown in Figure 1. As shown, the mobile telephones 3 include a transceiver circuit 71 which is operable to transmit signals to and to receive signals from the base station 5 via one or more antennae 73. As shown, 25 the mobile telephone 3 also includes a controller 75 which controls the operation of the mobile telephone 3 and which is connected to the transceiver circuit 71 and to a loudspeaker 77, a microphone 79, a display 81, and a keypad 83. The controller 75 operates in accordance with software instructions stored within 10102064 (IRN: 912308D7) 15 2015203120 llJun2015 memory 85. As shown, these software instructions include, among other things, an operating system 87 and a resource determination module 89. In this exemplary embodiment, the resource determination module 89 includes the above described 11-bit shift register 17-3 and aTTI (or slot) counter 91. 5 In operation, the resource determination module 89 receives the sequence identifier for the cell 4 transmitted by the base station 5 in a common signalling channel. The resource determination module 89 uses this sequence identifier to retrieve the corresponding initial state to be applied to the shift register 17-3 from memory. The resource determination module 89 also I O receives the synchronisation data for synchronising its TTI (or slot) counter 91 with the corresponding counter 35 in the base station 5. In this exemplary embodiment, the mobile telephone 3 receives this information at the time that it first associates with the base station 5. The resource determination module 89 also receives resource allocation data identifying the initially allocated resources, l 5 x, as well as the TTI 11 and/or the slot 13 in which those resources have been allocated to that mobile telephone 3. For persistently scheduled mobile telephones 3, this resource allocation data may define a period between allocated TTIs or slots, such that the mobile telephone 3 is allocated resource block x every Y TTIs (or slots). In this case, the resource allocation data only 20 has to be transmitted once or whenever the allocation is to be changed. For dynamically scheduled users, the resource allocation data must be transmitted before each scheduled transmission.

Once the resource determination module 89 has received the data to initialise the shift register 17-3 and the counter 91 as well as the resource 2.5 allocation data, it uses equations 1 and 2 to determine the actual resource block(s) to use for its uplink transmissions in the scheduled TTI (or slot). This information is then used to control the operation of the transceiver circuit 71 accordingly. 10102064 (IRN: 912308D7) 16 2015203120 11 Jun2015

Modifications and Alternatives A detailed exemplary embodiment has been described above. As those skilled in the art will appreciate, a number of modifications and alternatives can be made to the above exemplary embodiment whilst still benefiting from the S inventions embodied therein. By way of illustration only a number of these alternatives and modifications will now be described. in the above exemplary embodiment, equation 2 was used to generate the value of a(t) to be used in equation 1. If required, this calculation could be modified slightly to ensure that successive values of a(t) are always different, as 10 follows: a(t) = {a(t-1 )+1 +floor[(m(t).(S-1 ))/2M]} mod S Equation 3, where a(0)=0 and M is the number of registers in the shift register 17.

Another possibility is to generate a(t) by cyclic sampling of the sequence 0, 1, ... , S-1 as follows: * 5 a(t) = kt mod S t = 0 to T-1, where k is an integer co-prime to S. In this case, different values of k yield different sequences. However, since the resulting sequence will be periodic with period S, it is unlikely to meet the desired requirement that its period is much longer than the transmission interval of persistently scheduled users. 20 |n the above exemplary embodiment, the base station 5 received the sequence identifier from the telephone network 7 which identified the initialisation state to be applied to its shift register 17-5. This allocation of the initialisation states may be fixed for the network or it may be changed on a regular or periodic basis. If it is changed, the base station 5 preferably •2*5 broadcasts the new initialisation state (or state identifier) in a common signalling channel so that the mobile telephones 3 can update their shift registers 17-3 accordingly. In one exemplary embodiment, the base stations 5 may be 10102064 (IRN: 912308D7) 17 2015203120 11 Jun2015 arranged to randomly select an initialisation state to use. In this case it is possible that two neighbouring cells 4 could end up using the same hopping sequence, but by changing the sequence regularly or periodically it is possible to ensure that any resulting inter-cell interference will be short lived. 5 In the above exemplary embodiment, 11-bit shift registers were used in generating the appropriate frequency hopping sequence. As those skilled in the art will appreciate, longer or shorter length shift registers could be used instead. Similarly, the number of different sequences that can be obtained from the shift register can also be varied - it does not have to be eight. As those i O skilled in the art will appreciate, for a given length of shift register, there is a trade off between the number of sequences that can be derived from it and the periodicity (T) of those sequences. The length of the sequence is preferably at least 5 times and more preferably more than 10 times longer than the transmission interval of any persistently scheduled users. To ensure maximum J 5 frequency diversity for all users, the length of the sequence should correspond to the length of the maximum transmission interval multiplied by the number of sub-bands (S).

In the above exemplary embodiment, a mobile telephone based telecommunication system was described in which the above described 210 frequency hopping techniques were employed. As those skilled in the art will appreciate, many of these frequency hopping techniques can be employed in any communication system that uses a plurality of resource blocks. In particular, many of these frequency hopping techniques can be used in wire or wireless based communication systems which either use electromagnetic 2.5 signals or acoustic signals to carry the data. In the general case, the base stations and the mobile telephones can be considered as communications nodes which communicate with each other. The frequency hopping techniques described above may be used just for uplink data, just for downlink data or for 10102064 (IRN: 912308D7) 18 2015203120 11 Jun2015 both downlink and uplink data. Other communications nodes may include user devices such as, for example, personal digital assistants, laptop computers, web browsers, etc.

In the above exemplary embodiments, a number of software modules 5 were described. As those skilled will appreciate, the software modules may be provided in compiled or un-compiled form and may be supplied to the base station or to the mobile telephone as a signal over a computer network, or on a recording medium. Further, the functionality performed by part or ail of this software may be performed using one or more dedicated hardware circuits. * O However, the use of software modules is preferred as it facilitates the updating of base station 5 and the mobile telephones 3 in order to update their functionalities.

In the above exemplary embodiments, certain system constants such as the total number of resource blocks in the communication channel, the number l 5 of sub-bands and the number of resource blocks in each sub-band were programmed into the mobile telephones and the base stations. This information may be programmed directly into the software instructions run on these devices or may be software inputs that can be varied from time to time.

In either case, the mobile telephones and the base station will include data 20 (software or inputs) that define these system constants either directly or indirectly. For example, data may be stored that directly defines the values of Nrb and S together with data defining how N can be derived from these two.

The following is a detailed description of the way in which the present inventions may be implemented in the currently proposed 3GPP LTE standard. 2.5 Whilst various features are described as being essential or necessary, this may only be the case for the proposed 3GPP LTE standard, for example due to other requirements imposed by the standard. These statements should not, therefore, be construed as limiting the present invention in any way. The 10102064 (IRN: 912308D7) 19 2015203120 11 Jun2015 following description will use the nomenclature used in the Long Term Evolution (LTE) of UTRAN. For example, a base station is referred to as eNodeB and a user device is referred to as a UE. £ 1 Introduction

During TSG-RAN WG1#46bis discussions, it was decided that Localised FDMA (L-FDMA) with inter and intra TTI frequency hopping (L-FDMA+FH) would be used for ELITRA Uplink. However, there was not any discussion about what kind of frequency hopping pattern can be supported by EUTRA Uplink. I O in this contribution, we collect some requirements that can be used for the selection of an efficient hopping pattern for L-FDMA uplink and propose a suitable frequency hopping scheme for the uplink. 2 Requirements for Frequency Hopping Pattern /5 2.0 2.5

It is well-known that frequency hopping provides service quality improvement through interference averaging and frequency diversity. However, frequency hopping needs to be tailored for each system. The following requirements are applicable to the LTE system [5-6]: • No collision between hopping UEs in the same cell; • Different hopping patterns in neighbouring cells to reduce inter-cell interference; • High degree of frequency diversity for one UE throughout hopping pattern for the subsequent transmissions; • Preserve the single carrier property of the L-FDMA; • Signalling overhead for informing UEs of a specific or common hopping sequence should be kept as small as possible; • Frequency hopping should be designed for small sized packets intended to persistent scheduled UEs (e.g. VoIP service) as well as high speed UEs. 10102064 (IRN: 912308D7) 20 2015203120 11 Jun2015 3 Frequency hopping scheme

Let Nrb be the total number of Resource Blocks (RBs) in the whole bandwidth. Let the bandwidth be divided into S sub-bands of N=Nrb/S contiguous RBs each. & If a UE is assigned a RB x, it is understood that the RB actually used for transmission in TT1 (or slot) number t is y = x + a(t)N mod NrB, where t is a TTI (or slot) counter synchronised between the eNodeB and I O UE; and a(t) is a value from the set {0, 1,... , S-1}. 15 ) 20 Ζβ

If a UE is assigned more than one RB, then the calculation above is performed for each assigned RB. Provided that all the assigned RBs are contiguous and contained within one of the S sub-bands, the single carrier property is retained even after applying the frequency hopping shift a(f). It follows that the largest allowable contiguous allocation for a hopping UE is N RBs. The signalling of the assigned contiguous resource allocations have already been proposed in [7], The periodic sequence a(t) is common for all UEs in the cell, and should have the following properties. 5. It should be different in different cells in order to randomise inter-cell interference. 6. It should be simple to generate (to minimise computational load in the eNodeB and UE). 7. It should be defined by a small number of parameters (to minimise signalling load). 8. Its period, T, should be much longer than the transmission interval of persistently scheduled users (otherwise there is a risk that the 10102064 (IRN: 912308D7) 21 2015203120 llJun2015 transmission inten/al is equal to the period of a(t), in which case there would be no frequency diversity).

In the case that some TTIs are set aside for hopping UEs, the hopping £5 shift a(t) would only be applied in those TTIs. Dynamically scheduled UEs may still be scheduled in such 'hopping TTIs' in any RBs which are not occupied by hopping UEs.

One possibility is to generate a(t) using a pseudo-random sequence, resetting the sequence every T TTIs (or slots). A large number of sequences lO could easily be generated in this way and the sequence number could be signalled efficiently. For example, consider the shift register arrangement which is shown in Figure 7 and which produces a length 2047 pseudo-random binary (PRBS) sequence.

The shift register state is updated each TTI (or slot). Let m(t) represent I 5 the 11 -bit shift register value at time t. A pseudo-random value in the range 0 to S-1 can be obtained as follows: a(t) = floor[(m(t).S)/2048],

This calculation is easy to perform using a multiplication and bit shift.

By resetting the shift register every T=256 TTIs (or slots), 8 different sequences ZO can be produced using different initial states. Obviously a longer shift register could produce more sequences, and/or a larger period T. These different sequences can also be assigned into different cells.

If required, the calculation above could be modified slightly to ensure that successive values of a(t) are always different, as follows: 2-5 a(t) = {a(t-1 )+1 +floor[(m(t).(S-1))/2048]} mod S, where a(0) = 0.

Figure 8 shows a hopping pattern for four UEs where UE1 to UE3 are assigned 1RB each while UE4 is assigned 2RBs. In this example, a(t) has values of 0, 2, S-1 and 1 for TTI#0, TTI#1, TTI#2 and TTI#n respectively. 10102064 (IRN: 912308D7) 22 2015203120 llJun2015 4 Conclusions

This contribution outlines some requuements for the selection of an efficient hopping pattern for L-FDMA uplink. In addition, a method for generating hopping patterns has been described for L-FDMA which avoids S collision between hopping UEs and at the same time mitigates other cell interference.

Hence, we propose such frequency hopping scheme to be adopted for E-UTRA Uplink. to 5 References [1] TSG-RAN WG1#47, R1-063319 "Persistent Scheduling in E-UTRA", NTT DoCoMo, NEC Group.

[2] TSG-RAN WG1 LTE AdHoc, R1-060099, "Persistent Scheduling for E-UTRA" Ericsson. IS [3] TSG-RAN WG1#47, R1-063275, "Discussion on control signalling for persistent scheduling of VoIP", Samsung.

[4] TSG-RAN WG1#44, R1-060604 "Performance Comparison of Distributed FDMAand Localised FDMA with Frequency Hopping for EUTRA Uplink", NEC Group.

20 [5] TSG-RAN WG1#46Bis, R1 -062761 "Performance of D-FDMA and L-FDMA with Frequency Hopping for EUTRA Uplink", NEC Group, NTT DoCoMo.

[6] TSG-RAN WG1#46Bis, R1-062851 "Frequency hopping for E-UTRA uplink", Ericsson.

[7] R1-070364, "Uplink Resource Allocation for EUTRA" NEC Group, NTT DoCoMo.

While the invention has been particularly shown and described with 10102064 (IRN: 912308D7) 23 2015203120 llJun2015 reference to exemplary embodiments thereof, the invention is not limited to these embodiments. It will be understood by those of ordinary skill in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present invention as defined by the claims. 5 This application is based upon and claims the benefit of priority from

United Kingdom patent application No. 0702190.0, filed on February 5, 2007, the disclosure of which is incorporated herein in its entirety by reference. 10102064 (IRN: 912308D7)

Claims (19)

1. Claims

   1. A communications node operable to communicate with another communications node, the communications node including: means for receiving resource allocation information which indicates a set of contiguous resource blocks; means for determining at least one resource block to be used for transmission in a slot; and means for communicating with the another communications node using the determined at least one resource block wherein the at least one resource block to be used for transmission is determined based on a first value and a second value; wherein the first value is obtained from the resource allocation information; and wherein the second value is determined based on a hopping function multiplied by a size of a sub-band.
2. 2. The communications node according to claim 1, wherein the communications node is a user equipment (UE) and the another communications node is an eNodeB.
3. 3. The communications node according to claim 1 or 2, wherein the means for communicating is operable to use the determined at least one resource block for uplink communication.
4. 4. The communications node according to claim 1, 2 or 3 wherein the hopping function is based on a pseudo-random sequence.
5. 5. The communications node according to any one of claims 1 to 4, wherein the at least one resource block to be used for transmission is determined based on the first value obtained from the resource allocation information added to the hopping function when multiplied by the size, in number of resource blocks, of a sub-band.
6. 6. A communications node operable to communicate with another communications node, the communications node including: means for allocating contiguous resource blocks; means for transmitting, to the another communications node, resource allocation information which indicates, to the another communications node, a set of contiguous resource blocks; means for determining at least one resource block to be used for reception in a slot; and means for communicating with the another communications node using the determined at least one resource block; wherein the at least one resource block to be used for reception is determined based on a first value and a second value; wherein the first value is obtainable from the resource allocation information; and wherein the second value is determined based on a hopping function multiplied by a size of a sub-band.
7. 7. The communications node according to claim 6, wherein the communications node is an eNodeB and the another communications node is a user equipment (UE).
8. 8. The communications node according to claim 6 or 7, wherein the means for communicating is operable to use the determined at least one resource block for uplink communication.
9. 9. The communications node according to claim 6, 7 or 8 wherein the hopping function is based on a pseudo-random sequence.
10. 10. The communications node according to any one of claims 6 to 9, wherein the at least one resource block to be used for transmission is determined based on the first value obtainable from the resource allocation information added to the hopping function when multiplied by the size, in number of resource blocks, of a sub-band.
11. 11. A communication system including at least one communications node according to any one of claims 1 to 5, and at least one communications node according to any one of claims 6 to 10.
12. 12. A method of a communications node communicating with another communications node via resource blocks, the method including: receiving, from the another communications node, resource allocation information which indicates a set of contiguous resource blocks; determining at least one resource block to be used for transmission in a slot; communicating with the another communications node using the determined at least one resource block; wherein the at least one resource block to be used for transmission is determined based on a first value and a second value; wherein the first value is obtained from the resource allocation information; and wherein the second value is determined based on a hopping function multiplied by a size of a sub-band.
13. 13. The method according to claim 12, wherein the communications node is a user equipment (UE) and the another communications node is an eNodeB.
14. 14. The method according to any one of claims 12 to 15, wherein the at least one resource block to be used for transmission is determined based on the first value obtained from the resource allocation information added to the hopping function when multiplied by the size, in number of resource blocks, of a sub-band.
15. 15. A method of a communications node communicating with another communications node via resource blocks, the method including: allocating contiguous resource blocks; transmitting, to the another communications node, resource allocation information which indicates a set of contiguous resource blocks; determining at least one resource block to be used for reception in a slot; and communicating with the another communications node using the determined at least one resource block; wherein the at least one resource block to be used for transmission is determined based on a first value and a second value; wherein the first value is obtainable from the resource allocation information; and wherein the second value is determined based on a hopping function multiplied by a size of a sub-band.
16. 16. The method according to claim 15, wherein the communications node is an eNodeB and the another communications node is a user equipment (UE).
17. 17. The method according to any one of claims 15 to 16, wherein the at least one resource block to be used for transmission is determined based on the first value obtainable from the resource allocation information added to the hopping function when multiplied by the size, in number of resource blocks, of a sub-band.
18. 18. The method according to any one of claims 12 to 17, wherein the means for communicating is operable to use the determined at least one resource block for uplink communication.
19. 19. The method according to any one of claims 12 to 18 wherein the hopping function is based on a pseudo-random sequence. 2015203120 03 Aug 2016 11479408vl1 29 NEC Corporation Patent Attorneys for the Applicant/Nominated Person SPRUSON & FERGUSON