AU2004203108A1 - Method of matching resources required and resources allocated in a mobile radio system - Google Patents
Method of matching resources required and resources allocated in a mobile radio system Download PDFInfo
- Publication number
- AU2004203108A1 AU2004203108A1 AU2004203108A AU2004203108A AU2004203108A1 AU 2004203108 A1 AU2004203108 A1 AU 2004203108A1 AU 2004203108 A AU2004203108 A AU 2004203108A AU 2004203108 A AU2004203108 A AU 2004203108A AU 2004203108 A1 AU2004203108 A1 AU 2004203108A1
- Authority
- AU
- Australia
- Prior art keywords
- resources
- spreading codes
- spreading
- mobile radio
- multiple access
- Prior art date
- Legal status (The legal status 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 status listed.)
- Abandoned
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Description
P/00/011 Regulation 3.2
AUSTRALIA
Patents Act 1990 COMPLETE SPECIFICATION STANDARD PATENT Invention Title: Method of matching resources required and resources allocated in a mobile radio system The following statement is a full description of this invention, including the best method of performing it known to us: Freehills Carter Smith Beadle Sydney\004674426 Printed 9 July 2004 (10:02) page 2 Freehills Carter Smith Beadle Sydney\004674426 Pdinted 9 July 2004 (10:02) page 2 METHOD OF MATCHING RESOURCES REQUIRED AND RESOURCES ALLOCATED IN A MOBILE RADIO SYSTEM The present invention is generally concerned with multiple access mobile radio systems.
In such systems radio resources are allocated dynamically to users in accordance with their requirements. In the most general'case resources allocated to a user do not exactly match resources required, with the result that matching is necessary for transmission to the radio interface.
This problem arises in particular in Code Division Multiple Access (CDMA) mobile radio systems in which the radio resources consist of spreading codes.
Spreading an incoming data sequence of N symbols, denoted (dl, d2, dN), using a code having a length (or spreading factor) Q, denoted cQ (cl, c2, cQ), produces a sequence of length Q.N, which can be represented as follows: (di.cl, dl.c2, dl.cQ, d2.cl, d2.c2, dN.cQ) where dl.cl represents the multiplication of dl by cl.
An alternative representation of the spread sequence of length Q.N is (dl.co, d2.co, dN.cQ) where dl.c 0 represents the product of the symbol dl by the spreading code c Figure 1 outlines the principle of spreading, Ts designating the basic period (or symbol period) of a nonspread sequence and Tc designating the basic period (or "chip" period) of a spread sequence, Ts and Tc being related as follows Ts Q.Tc. In the figure dn and dn+l correspond to two successive symbols of a non-spread incoming sequence and d'l and d'l+i correspond to two successive basic symbols (or "chips") of the same spread symbol.
In such systems, resources allocated may not exactly match resources required, in particular because a code having the required length is not available (either because none is provided or because it has already been allocated). The problem is more seri-eus in systems in which the bit rates to be transmitted can be different (corresponding in particular to speech, data, pictures, etc.) or vary (corresponding in particular to speech encoded with variable codes).
Various techniques for effecting such matching are known per se: introduction of stuffing bits, repetition or elimination of data bits (in sequences obtained after error correction encoding), using the so-called discontinuous transmission technique (whereby transmission is stopped when there is no longer any data to transmit).
The drawback of introducing stuffing bits is inefficient use of the allocated resources.
Using the discontinuous transmission technique also has the drawback of reducing transmission efficiency.
The drawback of the solution consisting in repeating or eliminating data bits is that it is only a partial solution and does not exploit all the possibilities offered by these systems.
In other words, the above matching techniques have the disadvantage of not being totally effective and/or optimized.
CA99341002.2 3 In one aspect the present invention provides a method of matching resources required and resources allocated in a spreading code division multiple access mobile radio system, wherein it includes allocation of one or more spreading codes, the number and the length of said spreading codes, and in the case of a plurality of allocated spreading codes, the mode of distribution of the various symbols of a sequence to be spread, respectively despread, between said spreading codes being determined so that resources allocated are matched optimally to resources required.
Thus in one embodiment the present invention provides a new matching technique that exploits the possibilities offered by the code division multiple access technique itself, no longer matching resources required to resources allocated, but instead matching resources allocated to resources required (nevertheless without excluding the possibility of matching resources required to resources allocated).
This embodiment of the present invention achieves such matching in a relatively refined manner since resources allocated are matched to resources required in terms of the symbols constituting sequences of symbols instead of in terms of the sequences themselves.
In other words, the present invention offers an additional degree of freedom compared to prior art techniques so that such matching is more efficient, better optimized and more flexible than using the prior art techniques referred to above.
In accordance with another feature, the number of spreading codes allocated is chosen to be as high as possible and/or the length of said spreading codes is chosen to be as low as possible, so as additionally to optimize transmission performance. This is of course effected within the limits of what is possible without allocating too great a proportion of the resources to a given user so as not to penalize other users.
Accordingly, resources required-can be simultaneously optimized and in particular, for a given payload bit rate, more efficient error correction can be used.
In accordance with another feature, the distribution mode is defined by the fraction of symbols of a sequence of symbols to be spread, respectively despread, applied to each of said spreading codes.
In accordance with another feature, the distribution mode is further defined, for given fractions of symbols, by the mode of application of the various symbols of said sequence to said spreading codes, to obtain said fractions of symbols.
In accordance with another feature, the mode of application is chosen so as additionally to optimize transmission performance.
Accordingly, and in the same manner as previously indicated, resources required can be simultaneously optimized and in particular, for a given payload bit rate, more efficient error correction can be used (still within the limits of what is possible without penalizing other users).
In accordance with another feature, one or more of the parameters for fixing resources required are also CA99341002.2 determined so that resources required are matched optimally to resources allocated.
Preferably said parameters include: the bit rate of payload data to be transmitted, the efficiency of the error correction encoding, the efficiency of repetition or elimination of data after error correction encoding, the number of data bits transmitted per symbol.
A second aspect of the present invention also provides a transmitter device for a spreading code division multiple access mobile radio system, for implementing a method of the above kind.
In a third aspect the present invention further provides a mobile station for spreading code division multiple access mobile radio systems including a transmitter device of the above kind.
In a fourth aspect, the present invention further provides an entity, in particular base transceiver station, for spreading code division multiple access mobile radio systems including at least one transmitter device of the above kind.
According to a fifth aspect of the present invention provides a receiver device for a spreading code division multiple access mobile radio system for implementing a method of the above kind.
According to a sixth aspect the present invention provides a mobile station for spreading code division multiple access mobile radio systems including a receiver device of the above kind.
According to another aspect of the present invention there is provided an entity, in particular base CA99341002.2 6 transceiver station, for spreading code division multiple access mobile radio systems including at least one receiver device of the above kind.
In another aspect, the present invention provides a method of matching resources required and resources allocated in a spreading code division multiple access mobile radio system, wherein it includes allocation of one spreading code, the length of said spreading code being determined so that resources allocated are matched optimally to resources required, and additionally as low as possible, so as additionally to optimize transmission performance.
Preferably one or more of the parameters for fixing resources required are also determined so that resources required are matched optimally to resources allocated.
It is also preferable that said parameters for fixing resources required include: the efficiency of the error correction encoding, the efficiency of repetition or elimination of data after error correction encoding, the bit rate of payload data to be transmitted, the number of data bits transmitted per symbol.
According to another aspect of the present invention there is provided a transmitter device for a spreading code division multiple access mobile radio system, for implementing a method of the above kind.
The present invention further provides a mobile station for spreading code division multiple access mobile radio systems including a transmitter device of the above kind.
CA99341002.2 7 The present invention further provides an entity, in particular base transceiver station, for spreading code division multiple access mobile radio systems including at least one transmitter device of the above kind.
The present invention also provides a receiver device for a spreading code division multiple access mobile radio system for implementing the method of the above kind.
The present invention further provides a mobile station for spreading code division multiple access mobile radio systems including a receiver device of the above kind.
The present invention further provides an entity, in particular base transceiver station, for spreading code division multiple access mobile radio systems including at least one receiver device of the above kind.
Other features of the present invention will become apparent on reading the following description of one embodiment of the invention given with reference to the accompanying drawings, in which: Figure 1 summarizes the principle of spectrum spreading, Figure 2 shows one example of a transmitter device for a code division multiple access mobile radio system using a matching method in accordance with the invention, and Figure 3 shows one example of a receiver device for a code division multiple access mobile radio system using a matching method in accordance with the invention.
As shown in Figure 2, a transmitter device for a spreading code division multiple access mobile radio system includes: means 1 for generating sequences or frames of data to be transmitted from payload data (speech, data, pictures, etc.) and additional data such as signaling data in particular, error correction encoding means 2 receiving said sequences and introducing redundancy so that the bit rate at the output at said error correction encoding means is equal to R/pc, where R is the bit rate received by the encoding means and pc is the efficiency of the encoding concerned (with 0 pc i), means 3 for repeating or eliminating bits at the output of the error correction encoding means 2, the resulting bit rate being expressed in the form R/pc pr, where pr is the repetition or elimination rate, means 4 for regrouping bits into symbols, before modulation, in the case of multistate modulation, whereby a plurality of data bits can be transmitted during the same basic period or symbol period, the symbol bit rate then obtained being expressed in the form R/pc pr m, where m is an integer designating the number of data bits transmitted in this way within the same symbol, spreading means 5 for spreading the symbols obtained in this way, and modulator and transmitter means 6.
The receiver device shown in Figure 3 generally comprises means executing functions which are the converse of those shown in Figure 2, namely: receiver and demodulator means 6', despreading means 5' for despreading the symbols received by an operation which is the- converse of that executed by'the means 1 0 means 4' for breaking the symbols down into bits by an operation that is the converse of that executed by the means 4, means 3' for executing an operation that is the converse of the repeating or eliminating operation executed by the means 3, error correcting decoding means 2' executing an operation which is the converse of that executed by the means 2, and means 1' for restoring the payload data and the signaling data by an operation that is the converse of that executed by the means 1.
Other means, in particular interleaving means and de-interleaving means, not shown, can be provided, the parameters pc and pr then being simplified notations depending on other parameters that are not explained here.
Resources required are expressed in terms of the parameters R, pc, pr and m in the form:
R
PcPrm In accordance with the invention, the method of matching required resources and allocated resources includes the allocation of one or more spreading codes, the number and the length of those spreading codes, and in the case of a plurality of spreading codes, the mode of distribution of the various symbols of a sequence of symbols to be spread, respectively despread, between the spreading codes being determined so that resources allocated are matched optimally to resources required.
By way of example, Figures 2 and 3 correspond to the case in which the method in accordance with the invention of matching required resources and allocated resources includes the allocation of a plurality of spreading codes. The number of codes allocated is denoted J and the length of each of those codes is denoted
Q'
j (with j 1, J) The mode of distributing the various symbols of a sequence of symbols to be spread, respectively despread, between these spreading codes depends on various factors, such as: the fraction of symbols of the sequence applied to each code of length this fraction being denoted pj, the sum Lpj being of course equal to 1, j=I for given fractions pj, the mode of application of the various symbols of the sequence to these codes, namely spreading (respectively despreading) simultaneously more or fewer successive symbols of the sequence, for example spreading (respectively despreading), the successive symbols of the sequence, either alternately or in groups of two, three, etc., or any other combination, produce the required fractions.
CA99341002.2 11 The various symbols can then be transmitted in any manner, and in particular a plurality of symbols can be transmitted simultaneously. This mode of application will be characterized hereinafter by a parameter a such that the bit rate at the radio interface increase with the value of a.
Each symbol transmitted is therefore spread, respectively despread, by a single allocated code, possibly allocated at the same time as other symbols.
This implies in particular that at any time between 0 and J codes can be used simultaneously (the number 0 corresponding to when the discontinuous transmission technique previously referred to is to be used) The parameter a therefore takes into account the fact that at any time a plurality of symbols can be spread and transmitted simultaneously or, to the contrary, transmission can be stopped temporarily (if the discontinuous transmission technique is to be used) Accordingly, in accordance with an embodiment of the invention, the spreading means 5 include means such as the means 51, 5j 5 j to perform spreading by means of respective spreading codes of length Q(l), and distributor means 52 receiving the sequence to be spread and distributing it, in accordance with said mode of distribution, between different means such as the means 51, j Similarly, despreading means 5' includes 51', 5j' and .52' executing functions which are the converse of those executed by means 51, 5j and 52.
In other words, according to an embodiment of the invention, resources allocated are expressed in the form:
R
C
a j=1 as a function of the parameters J, Q(J, of the distribution mode (in this instance the parameters pj and a) and the bit rate R, of-the spread symbols (or "chip" bit rate) Matching resources allocated and resources required seeks to obtain the condition: R
R
c PcPr J o) j=1 in accordance with the invention, the parameters j, Q(j and the distribution mode (in this instance the parameters pj and a) are determined so that resources allocated are matched optimally to resources required.
Clearly there is a multitude of possible combinations of the parameters J, pj and a for a given value of all the other parameters and a multitude of ways to spread the symbols to be transmitted by means of these codes that comply with the previous constraints, and clearly it is not possible to describe here all possible examples and situations.
Generally speaking, and also in accordance with the invention, it is nevertheless worth pointing out that transmission performance can be improved by choosing the highest possible value of the parameter a and/or the shortest possible length Qj' of the codes, i.e. more generally by reducing the sum pjQ(.) (of course within the limits of what can be done without penalizing other the limits of what can be done without penalizing other users) Choosing the highest possible number J of codes allocated (subject to the same limits) optimizes transmission performance.
Further, if only one code is allocated, a sufficiently short code length is chosen (within the same limits) to authorize an optimum error correction for a given payload bit rate.
Also, codes can be allocated at the beginning of a call or at any time during a call (the codes allocated can, for example, be shared in the time domain between a plurality of users) Also, the distribution mode can change during a call.
The parameters for fixing resources required can also be determined so that resources required are matched optimally to resources allocated. In the example shown in Figures 2 and 3, such matching can be obtained by operating on one or more of the parameters R, pc, Pr and m.
The means 1 to 4 and 1' to 4' can be conventional means and therefore do not need to be described in detail here.
The means as 5j, 5, and 5S' can equally be conventional means and do not need to be described in detail here.
The practical implementation of the means 52 and 52' will be evident to the skilled person and so these means do not need to be described in more detail here other than by reference to their function.
The means 6 and 6' can be conventional means, 14 except that the means 6 may have to be adapted to receive the symbols delivered to the outputs of the means 5 5, possibly to include as many modulator and transmitter subsystems as necessary), and similarly the means 6' may have to be adapted to deliver symbols to the means as 5j 5, possibly to include as many receiver and demodulator subsystems as necessary) Transmitter or receiver devices-like those shown in Figures 2 and 3 can be used in mobile stations and in base transceiver stations of mobile radio systems.
Claims (23)
1. Method of matching resources required and resources allocated in a spreading code division multiple access mobile radio system, wherein the allocation of a plurality of spreading codes, the number and the length of said spreading codes, and the mode of distribution of the various symbols of a sequence to be spread, respectively despread, between said spreading codes, being determined so that resources allocated are matched optimally to resources required.
2. A method according to claim 1, wherein the number of spreading codes allocated is chosen to be as high as possible and/or the length of said spreading codes is chosen to be as low as possible, so as additionally to optimize transmission performance.
3. A method according to either one of claim 1 or 2, wherein the said distribution mode is defined by the fraction of symbols of a sequence of symbols to be spread, respectively despread, applied to each of said spreading codes.
4. A method according to claim 3, wherein the said distribution mode is further defined by the number of symbols simultaneously spread, respectively despread, by means of said plurality of spreading codes. A method according to any one of claims 1 to 4, wherein the said mode of application is chosen so as additionally to optimize transmission performance.
6. A method according to any one of claims 1 to 5, wherein the one or more of the parameters for fixing resources required are also determined so that resources required are also determined so that resources required are matched optimally to resources allocated.
7. A method according to claim 6, wherein the said parameters include: the bit rate of payload data to be transmitted, the efficiency of the error correction encoding, the efficiency of repetition or elimination of data after error correction encoding, the number of data bits transmitted per symbol.
8. A transmitter device for a spreading code division multiple access mobile radio system, for implementing the method of any one of claims 1 to 7, wherein the said transmitter device includes spreading means using a plurality of spreading codes and 004674419 means for distributing symbols from a sequence of symbols to be spread between said spreading codes in accordance with a given distribution mode, the number and the length of said spreading codes and said distribution mode being determined so that resources allocated are matched optimally to resources required.
9. A receiver device for a spreading code division multiple access mobile radio system for implementing the method according to any one of claims 1 to 7, wherein the said receiver device includes despreading means using a plurality of spreading codes and means for distributing symbols from a sequence of symbols to be despread between said spreading codes, in accordance with a given distribution mode, the number and the length of said spreading codes and said distribution mode being determined so that resources allocated are matched optimally to resources required. A mobile station for spreading code division multiple access mobile radio systems, including a transmitter device according to claim 8.
11. A mobile station for spreading code division multiple access mobile radio systems, including a receiver device according to claim 9.
12. An entity, in particular base transceiver station, for spreading code division multiple access mobile radio systems, including at least one transmitter device according to claim 8.
13. An entity, in particular base transceiver station, for spreading code division multiple access mobile radio systems, including at least one receiver device according to claim 9.
14. A method of matching resources required and resources allocated in a spreading code division multiple access mobile radio system, wherein the said method includes allocation of one or more spreading codes, the number and the length of said one or more spreading codes being determined so that resources allocated are matched optimally to resources required, and additionally the length of said one or more spreading codes being chosen to be as low as possible, so as additionally to optimize transmission performance, within the limits of what is possible without allocating too great a proportion of the resources to a given user so as not to penalize other users. 004674419 A method according to claim 14, wherein the said one or more of the parameters for fixing resources required are also determined so that resources required are matched optimally to resources allocated.
16. A method according to claim 15, wherein the said parameters for fixing resources required include: the efficiency of the error correction encoding, the efficiency of repetition or elimination of data after error correction encoding, the bit rate of payload data to be transmitted, the number of data bits transmitted per symbol.
17. A transmitter device for a spreading code division multiple access mobile radio system, for implementing the method of any one of claims 14 to 16, wherein the said transmitter device includes spreading means using one or more spreading codes, the number and the length of said one or more spreading codes being determined so that resources allocated are matched optimally to resources required, and additionally the length of said one or more spreading codes being chosen to be as low as possible, so as additionally to optimize transmission performance, within the limits of what is possible without allocating too great a proportion of the resources to a given user so as not to penalize other users.
18. A receiver device for a spreading code division multiple access mobile radio system for implementing the method according to any one of claims 14 to 16, wherein the said receive device includes despreading means using one or more spreading codes, the number and the length of said one or more spreading codes being determined so that resources allocated are matched optimally to resources required, and additionally the length of said one or more spreading codes being chosen to be as low as possible, so as additionally to optimize transmission performance, within the limits of what is possible without allocating too great a proportion of the resources to a given user so as not to penalize other users.
19. A mobile station for spreading code division multiple access mobile radio systems, including a transmitter device according to claim 17.
20. A mobile station for spreading code division multiple access mobile radio systems, including a receiver device according to claim 18. 004674419
21. An entity, in particular base transceiver station, for spreading code division multiple access mobile radio systems, including at least one transmitter device according to claim 17.
22. An entity, in particular base transceiver station, for spreading code division multiple access mobile radio systems, including at least one receiver device according to claim 18.
23. A method of matching resources as hereinbefore described with reference to the accompanying drawings.
24. A transmitter device as hereinbefore described with reference to the accompanying drawings. A receiver device as hereinbefore described with reference to the accompanying drawings.
26. A mobile station as hereinbefore described with reference to the accompanying drawings.
27. An entity as hereinbefore described with reference to the accompanying drawings. Dated this 9 th day of July 2004 Alcatel by its attorneys Freehills Carter Smith Beadle
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AU2004203108A AU2004203108A1 (en) | 1998-12-10 | 2004-07-09 | Method of matching resources required and resources allocated in a mobile radio system |
| AU2008202102A AU2008202102A1 (en) | 1998-12-10 | 2008-05-12 | Method of matching resources required and resources allocated in a mobile radio system |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| FR9815620 | 1998-12-10 | ||
| AU64359/99A AU6435999A (en) | 1998-12-10 | 1999-12-07 | Method of matching resources required and resources allocated in a mobile radio system |
| AU2004203108A AU2004203108A1 (en) | 1998-12-10 | 2004-07-09 | Method of matching resources required and resources allocated in a mobile radio system |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| AU64359/99A Division AU6435999A (en) | 1998-12-10 | 1999-12-07 | Method of matching resources required and resources allocated in a mobile radio system |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| AU2008202102A Division AU2008202102A1 (en) | 1998-12-10 | 2008-05-12 | Method of matching resources required and resources allocated in a mobile radio system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| AU2004203108A1 true AU2004203108A1 (en) | 2004-08-05 |
Family
ID=34318099
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| AU2004203108A Abandoned AU2004203108A1 (en) | 1998-12-10 | 2004-07-09 | Method of matching resources required and resources allocated in a mobile radio system |
Country Status (1)
| Country | Link |
|---|---|
| AU (1) | AU2004203108A1 (en) |
-
2004
- 2004-07-09 AU AU2004203108A patent/AU2004203108A1/en not_active Abandoned
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100223502B1 (en) | Spread spectrum communication system | |
| JP3442787B2 (en) | Method and apparatus for providing variable rate data in a communication system utilizing statistical multiplexing | |
| US5515396A (en) | Method and apparatus for selecting a spreading code in a spectrum spread communication system | |
| US5777990A (en) | Method and apparatus for providing variable rate data in a communications system using non-orthogonal overflow channels | |
| RU2214056C2 (en) | Evaluating data transmission speed for codedivision multiple access and variable-speed communication systems | |
| KR100689176B1 (en) | Improved frame structure for an adaptive modulation wireless communication system | |
| US9467200B2 (en) | Method and apparatus for orthogonally overlaying variable chip rate spread spectrum signals | |
| TW410511B (en) | Dynamic and smart spreading for wideband CDMA | |
| US20020110181A1 (en) | Method and system for data and voice transmission over shared and dedicated channels | |
| WO1998043373A1 (en) | Systems and methods of channel coding and inverse-multiplexing for multi-carrier cdma systems | |
| KR100421798B1 (en) | Method for transmitting of parallel information streams in a cdma system | |
| US20030086364A1 (en) | Dynamically-scalable system and method for multiple user access utilzing multi-bit and multi-code orthogonal multiplexing | |
| CN1145304C (en) | Method and device for generating a channel and subscriber-coded message signal | |
| US5835480A (en) | Circuitry and method for simultaneously transmitting voice and data information | |
| US7012884B2 (en) | Zero-overhead method for sequence reversible and pattern independent orthogonal multiplexing | |
| AU6435999A (en) | Method of matching resources required and resources allocated in a mobile radio system | |
| AU2004203108A1 (en) | Method of matching resources required and resources allocated in a mobile radio system | |
| AU2008202102A1 (en) | Method of matching resources required and resources allocated in a mobile radio system | |
| EP1135864B1 (en) | Apparatus and method for expanding channels in cdma system | |
| RU2233540C2 (en) | Device and method for converting tfci indicator bits into characters for fixed division mode in cdma mobile communication system | |
| CN1240550A (en) | Circuitry and method for simultaneously transmitting voice and data information | |
| CN1965494B (en) | Method for decoding channelisation code set information in a spread spectrum receiver | |
| WO2006044422A2 (en) | System and method for optimizing walsh code assignments | |
| PNI | llllllllllllllllllllllllllllllg? lullllllllllllllllllllllllllllllllll | |
| MXPA00002096A (en) | A method for assigning spreading codes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| MK5 | Application lapsed section 142(2)(e) - patent request and compl. specification not accepted |