WO2005081437A1

WO2005081437A1 - Multiplexing scheme in a communication system

Info

Publication number: WO2005081437A1
Application number: PCT/CN2004/000128
Authority: WO
Inventors: Branishlav M. Popovic; Jaap Van De Beek
Original assignee: Huawei Technologies Co., Ltd.
Priority date: 2004-02-17
Filing date: 2004-02-17
Publication date: 2005-09-01
Also published as: US20140241313A1; US20070177631A1; US8149780B2; US8755349B2; US20120147848A1; EP1763932A1; EP1763932A4

Abstract

The present invention is related to a method for multiplexing communication resources to multiple users in a communication system having no network resource planning. The method comprises the steps of: generating a generic time-frequency (T-F) mapping pattern (TFPgeneric), generating a set of orthogonal T-F mapping patterns from said generic T-F mapping pattern (TFPgeneric) , performing a random variable cyclic offsetting of said set of orthogonal T-F mapping patterns in each transmission time interval (TTI), and allocating the orthogonal T-F mapping patterns to the one or more users and/or traffic channels in each TTI. The invention also relates to a transmitter for executing said multiplexing method, and a system including such transmitters.

Description

MULTIPLEXING SCHEME IN A COMMUNICATION SYSTEM

Field of the invention

The present invention is related to the field of radio communications, and in particular to radio communication systems employing time and frequency-divided multiple access schemes .

Background of the invention

In any communication system including several users sharing the transmission medium, i.e. the available communication resources, special attention must be given to the co-existence of the different signals being present within the communication system. The users of the communication system generally share the same pool of communication resources. When allocating the communication resources (for example different channels) to the multiple users, it is realised that the signal of one user may affect (interfere with) the signal of another user. A communications system designer thus has to design a user traffic multiplexing scheme bearing this in mind, and thus design the multiplexing scheme so as to handle this undesired interference.

In communication systems in which a geographical division is used, i.e. a cellular system, there are mainly two kinds of multi-user interference present. Firstly, the interference from users within the same geographical area, called a cell, the so called intra-cell interference, and secondly the interference from users in adjacent (neighbouring) cells, the so called inter-cell interference. The inter-cell interference may be decreased for example by means of resource planning (e.g. frequency planning) , so that a specific communication resource is reused in such a way that interference is minimised. For frequency planning the inter-cell interference may be minimised by using a frequency reuse scheme, in which a certain frequency is not used in neighbouring cells. However, resource planning, for example frequency planning and coordination between cells, is most time consuming, rather expensive and in some cases not even feasible.

Besides resource planning, whereby inter-cell interference may be decreased, there are other ways to decrease interference. One way to decrease both intra-cell interference and inter-cell interference is to utilise frequency hopping. Frequency hopping consists in changing the frequency used by a channel at regular intervals. Thus, cells using the same frequencies but different, presumably de-correlated, hopping sequences lead to decreased interference.

WO03/001696 describes a method for decreasing inter-cell interference. Frequencies are allocated to cells in a communication system according to functions selected to minimise repeated collisions between hopping sequences used by the base stations of neighbouring cells. This is thus an example of a prior art method for decreasing inter-cell interference in a communication system, and in which system also resource planning is performed.

The international patent application PCT/CN03/00133 describes a method for interleaving in an OFDM system. The method described exploits the two-dimensional time-frequency structure of an OFDM system, and maps OFDM units onto frequency sub-bands in a way that maximises the diversity performance.

Furthermore, reference is made to the following disclosures made by Huawei: "Time-frequency mappings of OFDM units for full frequency reuse without resource planning", Tdoc Rl-030799, New York, NY, USA, August 25-29, 2003,

"Revised text proposal for OFDM User Traffic Multiplexing Solutions", Tdoc Rl-030970, Seoul, Korea, October 6-10, 2003, and

"Updated text proposal for OFDM User Traffic Multiplexing Solutions", Tdoc Rl-031172, Lisbon, Portugal, November 17-21, 2003.

In the prior art discussed above, the different aspects of allocating communication resources are treated more or less one at a time. It would however be desirable to provide a method for allocating communication resources to several users, in which all the aspects are considered simultaneously. A desired method should thus take into account the interference within a cell as well as the interference between cells in such a way that the total interference is minimised, whilst maximising the diversity performance for each user. Further, it would be desirable to provide such method where expensive, time consuming and tedious resource planning is avoided.

Summary of the invention

It is an object of the present invention to provide a method for allocating communication resources to multiple users in a time and frequency divided communication system, so as to completely avoid intra-cell interference, at the same time as the inter-cell interference is minimised, and where the communication system does not utilise any resource planning (e. g. frequency planning). These objects are achieved, according to a first aspect of the invention, by a method as defined in claim 1, a transmitter as claimed in claim 10 and a system as claimed in claim 11.

In accordance with the present invention, a method for allocating communication resources to multiple users is provided, utilising the properties of a mathematical function for maximising the performance of a time-frequency divided communication system. The method comprises the steps of: generating a generic time-frequency (T-F) mapping pattern (TFPgeneric) , generating a set of orthogonal T-F mapping patterns from said generic T-F mapping pattern (TFP_gener_._c) _r performing a random variable cyclic offsetting of said set of orthogonal T-F mapping patterns in each transmission time interval (TTI) , and allocating the orthogonal T-F mapping patterns to the one or more users and/or traffic channels in each transmission time interval (TTI) . Thereby the inter-cell interference is averaged, any intra-cell interference is avoided and the method requires no network resource planning.

In accordance with one embodiment of the present invention the generic time-frequency pattern is a generic Costas sequence. Such Costas sequence based time-frequency patterns have desirable properties with respect to interference and diversity, providing high diversity gain while at the same time minimising inter-cell and avoiding intra-cell interference. Further, all T-F patterns in the set are obtained from a first pattern giving an easily implemented and easily administrated way to obtain orthogonal T-F mapping patterns .

In accordance with one embodiment of the present invention said Costas sequence is obtained by a T construction. This choice of Costas sequence provides improved diversity gain compared to the other choices of Costas sequences. In accordance with one embodiment of the present invention said random cyclic offset is changed for each transmission time interval (TTI) , according to a cell-specific multi-level pseudo-random sequence. Consequently, the different cells within the communication system will use in principle different cyclically shifted versions of the same set of time-frequency mapping patterns. The unique cross-correlation properties of the set of time-frequency mapping patterns ensure limited cross-interference between any two cells at any time. This random offsetting in each TTI also makes instantaneous interference to appear noise-like.

In accordance with another embodiment of the present invention said set of orthogonal T-F mapping patterns is generated by cyclic shifts in the frequency domain of said generic time-frequency (T-F) mapping pattern (TFPgeneric) • Thereby a set of orthogonal T-F mapping patterns is obtained in an easy and convenient fashion, and further ensures that the set of patterns is orthogonal. The random variable cyclic offsetting could then be performed in the time domain, giving maximum cross-correlations not significantly higher than the ideal values guaranteed for Costas sequences by definition.

In an alternative embodiment said set of orthogonal T-F mapping patterns is generated by cyclic shifts, in the time domain, and said random variable cyclic offsetting could then be performed in the frequency domain. Thereby a very flexible solution for multiplexing is provided, giving a network designer alternative ways to implement the present invention.

In accordance with another embodiment of the present invention the orthogonal T-F mapping patterns are randomly allocated to the multiple users and/or traffic channels in each TTI. This feature decreases the probability of collisions between signals from the different cells.

In accordance with another embodiment of the present invention, a transmitter for performing said method is provided, and such a system, both yielding corresponding advantages.

Brief description of the drawings

Figure 1 shows schematically the structure of the communication resources in a time-frequency divided communication system. Figure 2 shows an exemplary time-frequency mapping pattern.

Figure 3 shows another exemplary time-frequency mapping pattern .

Figure 4 shows an exemplary transmitter implementing the present invention, and a system in which it may be used.

Detailed description of preferred embodiments

In order to receive a full understanding of the present invention, a brief description of an OFDM (Orthogonal Frequency Division Multiplexing) system is provided. However, an OFDM system is only an example of a time and frequency-divided system in which the present invention may be implemented, and it is understood that the invention may be implemented in other time and frequency-divided systems as well.

OFDM is a transmission technique that allows high data rates to be transmitted over very noisy channels, yet at a comparatively low complexity, and is used for digital audio broadcasting (DAB) and digital video broadcasting (DVB) . OFDM has several favourable properties like high spectral efficiency and robustness to channel dispersion, for which reasons it will most likely be used for future broadband applications such as digital mobile radio communication.

In an OFDM system the data to be transmitted is spread over a large number of carriers, and the data rate to be transferred by each of these carriers is consequently reduced in proportion to the number of carriers. The carriers have an equal, precisely chosen frequency spacing, and the frequency bands of the sub-carriers are not separate but overlap. By using an IFFT (Inverse Fast Fourier Transform) as modulation, the spacing of the sub-carriers is chosen in such a way that at the frequency, where a received signal is evaluated, all other signals are zero. The choice of carrier spacing is made so that orthogonality is preserved, giving the method its name. OFDM systems transmit constellation symbols block-wise. A block of constellation symbols is transmitted during one OFDM symbol interval. During a subsequent OFDM symbol interval, a new block of constellation symbols is transmitted and so on. Thus, any transmitted constellation symbol in an OFDM system can be characterised by two indexes: the first index indicating during which OFDM symbol interval it is transmitted, and the second index indicating which of the sub-channels it is transmitted on.

With reference to FIG. 1, a time-frequency resource grid is shown, where TTI (Transmission Time Interval) indices are shown on the x-axis, and sub-channel indices on the y-axis. In the illustrative communication system used to explain the present invention, data is transmitted in packets and each packet is transmitted during a transmission time interval, TTI. A TTI consists of a fixed finite number of OFDM symbol intervals. Each cell in the figure can carry a constellation symbol and is characterized by the two indexes mentioned above: the first index indicating during which particular OFDM symbol interval in a particular TTI it is transmitted and the second index indicating which particular sub-carrier frequency (sub-channel index) is used for its transmission.

User traffic multiplexing is the allocation of transmitter resources (such as time, frequency, antennas, etc.) to the different traffic channels within the same cell, so that the resulting physical channels can co-exist preferably without mutual interference, or with as little interference as possible. Particularly, in this application, it is assumed that the communication resources to be allocated are time and frequency divided resources, divided into time slots (TS) and frequency sub-bands, respectively, where each sub-band contains a number of subcarriers. Then the user traffic multiplexing can be defined as the allocation of a particular sequence of sub-bands for the transmission of each traffic channel during a TTI.

A time-frequency (T-F) mapping pattern is a sequence of indices of the sub-bands used for the transmission within a TTI. The time-frequency mapping patterns thus specify the different physical channels, one T-F mapping pattern for each physical channel .

An OFDM unit is a group of constellation symbols transmitted in a sub-band during a time slot (OFDM symbol interval) . Thus a T-F mapping pattern is used to map a number of OFDM units onto the time-frequency grid within a TTI . In practice, certain sub-carriers will be reserved for pilots and signalling, which may lead to variation in OFDM unit size and to mapping of certain OFDM units onto non-contiguous sub- carriers. In accordance with the invention, all the cells of a cellular communication system employ the same, special set of T-F mapping patterns for multiplexing the traffic. Thus no network resource planning is needed, and consequently no network capacity needs to be reserved for such planning. Thus, given the fact that other neighbouring cells employ the same resource grid (users in neighbouring cells thus run the risk of transmitting data on the same sub-carriers and during the same OFDM symbol intervals), the problem is now to assign the communication resources in each cell to the users in such a way that 1. The interference within cells is minimised (intra-cell interference) , 2. The interference form other cells is minimised (inter- cell interference) , and 3. The diversity-performance for each user is maximised.

For a given user, the inter-cell interference appears in the form of "hits" or "collisions" (i.e. occurrences of data in other cells transmitted at the same frequencies and during the same OFDM symbol interval) , either from the identical T-F mapping pattern used in another cell or from other T-F mapping patterns used in another cell.

In order to obtain a maximised diversity gain, the T-F mapping pattern should be such that every pair of OFDM units is separated in time and frequency as much as possible. This qualitative description can be mathematically formulated as the requirement to maximise the minimum Lee distance between the elements of a T-F mapping pattern. The Lee distance between the two points is the sum of the absolute values of the differences of the corresponding coordinates. In accordance with the present invention, the generic T-F mapping pattern P_generi_cf might be obtained from a Costas sequence. Briefly, a Costas sequence is a mathematical sequence having certain particularly beneficial correlation characteristics. By definition, the number of hits between a Costas sequence and its arbitrary (non-cyclic) time and frequency-shifted version is equal to 0 or 1. For further information on Costas sequences, see for example S. W. Golomb and H. Taylor, "Construction and properties of Costas arrays", Proc. IEEE, vol. 72, pp 1143 - 1163, Sept. 1984.

The inventors of the present invention have realised the beneficial properties of Costas sequences for application to a multiplexing scheme in an OFDM system. When basing the T-F mapping patterns used in a communication system on the Costas sequence, all the above mentioned aspects of resource allocation is optimised concurrently. That is, the inter-cell interference is minimised, the intra-cell interference is completely avoided, the diversity performance for each user is maximised and no network planning is needed. There are mathematical functions that would render an even better diversity performance, but then the interference performance would suffer.

In accordance with the invention, the orthogonal set of T-F mapping patterns is obtained from a generic Costas sequence. This may be accomplished either by using the original-size Costas sequence or by adjusting it to the size of the T-F grid, as will be explained more in detail below by means of some specific examples. The adjustment may consist of a periodic extension of the generic Costas sequence or of shortening the generic Costas sequence. In accordance with the invention, an orthogonal set of T-F mapping patterns is obtained by cyclic shifts in the frequency domain of the generic T-F mapping pattern, and thereby there will be no interference within a cell . In an alternative embodiment the orthogonal set of T-F mapping patterns is obtained by cyclic shifts in the time domain of the generic T-F mapping pattern. This design ensures that the set of T-F mapping patterns is orthogonal, i.e. no hits (or rather, collisions) will occur between the different patterns (different physical channels) . Further, all the available time- frequency resources are utilised, meaning that all time slots (OFDM symbol intervals) and all sub-bands are used if all patterns are deployed.

High diversity gain of each T-F mapping pattern is achieved, since the generic Costas sequence possesses good Lee distance properties. The diversity gain of all T-F patterns can be further maximised by choosing a specially constructed Costas sequence, having an improved minimum Lee distance.

With reference now to figure 2, starting with the shown exemplary T-F mapping, 14 cyclic shifts in the frequency domain may be performed, giving a total of 15 T-F mapping patterns. This set of T-F mapping patterns is an orthogonal set and is allocated to a single cell. All these T-F mapping patterns are then cyclically time-shifted by a cell specific offset, corresponding to an integer number of OFDM symbols. That is, a time slot index (for example an integer in the interval 1-15) may be randomly assigned to a cell. This cell specific time offset is changed for each TTI in accordance with a cell- specific multi-level pseudo-random sequence. In that way the different cells, even though being synchronous in one specific TTI (thus causing interference) , they will most likely be asynchronous in the next TTI. The cross-interference is thus minimised, as predicted by the correlation properties of the T- F mapping patterns. Stated another way, the inter-cell interference is truly randomised in time, from one transmission time interval to another, by the random cyclic time-shifts of the whole set of orthogonal codes.

In an alternative embodiment, the 14 cyclic shifts is not performed in the frequency domain, but in the time domain, again giving a total of 15 T-F mapping patterns. This set of T- F mapping patterns is also an orthogonal set and is allocated to a single cell. All these T-F mapping patterns are then cyclically frequency-shifted (instead of time-shifted) by a cell specific offset, corresponding to an integer number of OFDM symbols. That is, a frequency sub-band index (for example an integer in the interval 1-15) may be randomly assigned to a cell. This cell specific offsetting is again changed for each TTI in accordance with a cell-specific multi-level pseudorandom sequence. As in the embodiment above, the different cells, even though being synchronous in one specific TTI (thus causing interference) , they will most likely be asynchronous in the next TTI, and the cross-interference is thus minimised.

The different sequences of offsets, both in time or in frequency, can for example be generated as time-shifted versions of a single multi-level pseudo-random sequence. In accordance with the present invention, one or more T-F mapping patterns may be allocated to a single user, for example in dependence on the amount of traffic data for the transmission, or in dependence on available communication resources or on the priority of a specific user. However, within each cell, no T-F mapping pattern is assigned to more than one user during the same TTI, and thereby any potential intra-cell interference is eliminated.

In accordance with the present invention, random allocation of the orthogonal T-F mapping patterns to the multiple users and/or traffic channels in each TTI, decreases the probability of collisions between the signals from the different cells. It is however contemplated that the allocation may be performed in a pseudo-random or even non-random way, i. e in a fixed way.

In spite of the design of the generic T-F mapping pattern as a Costas sequence and in spite of the fact that the sets of

T-F mapping patterns in neighbouring cells are subject to a random cyclic time-shift, occasionally the exact same T-F mapping pattern may appear in two neighbouring cells at the same time. In many cases, these instants where all OFDM units in a physical channel collide at the same time, dominate the performance of the relevant traffic channel. Depending on the allocation strategy this situation may occur more of less often.

In particular, when random allocation of the orthogonal T-F mapping patterns to the multiple users and/or traffic channels in each TTI is performed, the properties of the Costas sequences are best exploited and the probability that all OFDM units collide is reduces significantly, compared to other fixed allocation strategies.

As the set of T-F patterns in some TTI is obtained by cyclically shifting the generic T-F mapping pattern in the frequency and time domain, the definition property mentioned earlier (i.e. number of hits between a Costas sequence and its arbitrary (non-cyclically) time and frequency-shifted version equals 0 or 1) is not applicable exactly and the number of hits may be higher. However, it is reasonable to expect, and can in fact be proven by examples, that the actual maximum cross- correlations are not significantly higher than the ideal values,

The invention will now be described by means of specific examples of the allocation in accordance with the inventive method.

Examples

Again with reference to figure 2, the set of 15 orthogonal T-F mapping patterns, one for each OFDM physical channel, is derived from a single Costas sequence of length 15 obtained from the so-called T construction. This generic T-F pattern, TFPg_eneric^ is shown in figure 2, as a sequence of indices of the frequency sub-bands used for the transmission within one TTI.

Case (A) : For a T-F grid with 12 OFDM symbol intervals (time slots) and 15 frequency sub-bands, the first pattern is obtained by discarding • the last three symbols of the generic

Costas sequence, in order to obtain the patterns of length N_0FDM

= 12.

Case (B) : For a T-F grid with 27 OFDM symbol intervals (time slots) and 15 frequency sub-bands, the first pattern is obtained by extending the generic Costas sequence by the reversed first 12 symbols of the same generic pattern, in order to obtain the patterns of length N_0FDM = 27.

Mathematically these two cases may be expressed as

TFP₀ ^(A) = TFPgeneric ( 1 : 12 ) T FP₀ ^(B) = [ TFPgeneric TFPg_8neric ( 2 : - 1 : 1 )

where (a:b) denotes the sequence of integers (a, a+1, a+2,..., b-1, b) , (b:-l:a) denotes the sequence of integers (b, b-1, b- 2,..., a+1, a), and [A B] denotes the straightforward concatenation of 2 sequences.

For the first case, case (A) , the first two T-F mapping patterns are given by: TFP₀ ^(A) = [13 5 3 9 2 14 11 15 4 12 7 10]

TFPι^(A) = [14 6 4 10 3 15 12 1 5 13 8 11]

For the second case, case (B) , the first two T-F mapping patterns are given by:

TFPo^(B) = [13 5 3 9 2 14 11 15 4 12 7 10 1 6 8 10 7 12 4 15 11 14 2 9 3 5 13]

TFPι^(B) = [14 6 4 10 3 15 12 1 5 13 8 11 2 7 9 11 8 13 5 16 12 15 3 10 4 6 14]

With reference to figure 3, another generic Costas sequence, with minimum Lee distance equal to 3, is shown. In particular, the Costas sequence shown is a T₄ Costas sequence of length 27. The T₄ construction ensures T-F mapping patterns with a minimum Lee distance equal to 3. The Lee distance gives an indication of the proximity of elements of a T-F pattern, as was explained above, and this choice of Costas sequence separates every pair of OFDM units as much as possible in time and frequency, and thus gives a very high diversity gain.

Now with reference to figure 4, the present invention also encompasses a communication system, generally denoted 100, implementing the inventive method for multiplexing. The communication system 100 is preferably divided into several cells 110, each cell including a base station 120 servicing multiple users having some kind of an user equipment 130. The base station 120 and user equipment 130, respectively, includes transmitter (s) including means for implementing the method in accordance with the present invention. A person skilled in the art realises that the multiplexing may be performed elsewhere in the system, such as for example in a mobile switching centre (MSC) , a base station controller (BSC) , or the like, depending on the communication system in question. The base station and user equipment 130, respectively, may for example include a transceiver and processor (not shown) appropriately programmed for wireless communication in accordance with the invented method for multiplexing. It is further understood that the demultiplexing is performed correspondingly.

In summary, the present invention provides a method yielding all of the following advantages:

1. Intra-cell interference is completely avoided. 2. Inter-cell interference is reduced.

3. ost of the available diversity in the TTI is captured.

4. The above advantages 1-3 are accomplished without network resource planning.

The invention has been described in conjunction with preferred embodiments. It is evident that numerous alternatives, modifications, variations and uses will be obvious to a person skilled in the art in light of the foregoing description. For example, the communication system need not be an OFDM system, so the invention could also be used in other frequency-hopping systems, such as for example GSM.

Claims

1. Method for multiplexing communication resources to one or more users and/or traffic channels in a time-frequency divided communication system, characterised in that the method, requiring no network resource planning, comprises the steps of: generating a generic time-frequency (T-F) mapping pattern ( J- -t generic) i generating a set of orthogonal T-F mapping patterns from said generic T-F mapping pattern (TFP_generic) / performing a random variable cyclic offsetting of said set of orthogonal T-F mapping patterns in each transmission time interval (TTI); and allocating the orthogonal T-F mapping patterns to the one or more users and/or traffic channels in each TTI .

2. Method as claimed in claim 1, wherein said generic T-F mapping pattern (TFP_generic) is a Costas sequence.

3. Method as claimed in claim 2, wherein said Costas sequence is obtained by a T₄ construction.

4. Method as claimed in claim 1, wherein said random cyclic offset is changed for each transmission time interval (TTI) , according to a cell-specific multi-level pseudo-random sequence.

5. Method as claimed in claim 1, wherein said set of orthogonal T-F mapping patterns is generated by cyclic shifts in the frequency domain of said generic time-frequency (T-F) mapping pattern (TFP_generic) •

6. Method as claimed in claim 5, wherein said random variable cyclic offsetting is performed in the time domain.

7. Method as claimed in claim 1, wherein said set of orthogonal T-F mapping patterns is generated by cyclic shifts in the time domain of said generic time-frequency (T-F) mapping pattern (TFP_generic) •

8. Method as claimed in claim 7, wherein said random variable cyclic offsetting is performed in the frequency domain.

9. Method as claimed in claim 1, wherein said allocation of orthogonal T-F mapping patterns is performed by random selection of a T-F mapping pattern that is used by a given user and/or traffic channel in each TTI.

10. A transmitter for use within a time-frequency divided communication system, characterised in that said transmitter includes means for executing a multiplexing method as claimed in claim 1, and said system requiring no network resource planning.

11. A time-frequency divided communication system for communication of signals, said communication system including at least one transmitter as claimed in claim 10, and requiring no network resource planning.