EP1010266A1 - A method for assigning spreading codes - Google Patents

A method for assigning spreading codes

Info

Publication number
EP1010266A1
EP1010266A1 EP98941980A EP98941980A EP1010266A1 EP 1010266 A1 EP1010266 A1 EP 1010266A1 EP 98941980 A EP98941980 A EP 98941980A EP 98941980 A EP98941980 A EP 98941980A EP 1010266 A1 EP1010266 A1 EP 1010266A1
Authority
EP
European Patent Office
Prior art keywords
spreading codes
link connection
orthogonal
assigning
codes
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.)
Withdrawn
Application number
EP98941980A
Other languages
German (de)
French (fr)
Inventor
Erik Dahlman
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP1010266A1 publication Critical patent/EP1010266A1/en
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/16—Code allocation
    • H04J13/18—Allocation of orthogonal codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/707—Spread spectrum techniques using direct sequence modulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/24—Radio transmission systems, i.e. using radiation field for communication between two or more posts
    • H04B7/26—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
    • H04B7/2628—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile using code-division multiple access [CDMA] or spread spectrum multiple access [SSMA]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/0022—PN, e.g. Kronecker
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/004—Orthogonal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B2201/00—Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
    • H04B2201/69—Orthogonal indexing scheme relating to spread spectrum techniques in general
    • H04B2201/696—Orthogonal indexing scheme relating to spread spectrum techniques in general relating to Dowlink

Definitions

  • the present invention relates to methods for assigning spreading codes to DS-CDMA forward-link connections.
  • CDMA Code Division Multiple Access
  • CDMA method uses the spread spectrum technique in which a number of users simultaneously occupy the same frequency band with their radio channels .
  • each user is assigned a specific spreading code by which the user is separated from the other users of the system.
  • Another name for a spreading code is spreading sequence or spreading-code sequence.
  • the transmitted information in the radio signal is coded (spread) by a specific spreading code in the transmitter.
  • the coded information is decoded (despread) by correlating with the same specific spreading code again or by filtering the received information in a matched filter.
  • a spreading code of the same length as the symbol interval is called a short spreading code .
  • Orthogonal codes are codes that has zero cross correlation for zero time offset.
  • the use of orthogonal codes will reduce the intra-cell interference, i.e. interference from other forward- link signals in the same cell. Normally the intra-cell interference will not be completely eliminated as time dispersion will partly destroy the orthogonality between signals coded with orthogonal codes .
  • a set of orthogonal codes does only contain a finite number of codes, where the number of codes is always smaller or the same as the length of the codes .
  • orthogonal spreading codes are often used to separate different radio channels.
  • variable bit-rate connections i.e. a connection where the bit-rate varies during the duration of a call
  • the number of spreading codes actually used by each connection will vary in time and between the different connections.
  • a high bit-rate uses more spreading codes than a lower bit-rate.
  • One example of a scheme to assign spreading codes to a connection with a variable bit-rate in a radio communication system is the static allocation.
  • a static allocation means that each connection is, at call setup, allocated as many spreading codes as is needed to be able to transmit at a requested maximum bit-rate. This means that a small number of connections with variable bit- rate connection might allocate all available spreading codes even if they do not have to use all of them simultaneous.
  • Another example of a scheme to assign spreading codes to a connection is the dynamic allocation.
  • a dynamic allocation means that all connections share a common pool of spreading codes that are continuously redistributed by a base station, according to the instantaneous need of each connection. Each time the bit-rate at a connection is to be increased the base station has to inform the radio unit what new spreading codes to receive. This will require a significant overhead in the communication between the base station and radio unit.
  • the US patent US 5 533 013 describes a method and a system for assigning complete orthogonal spreading codes and radio channels in a combined CDMA/TDMA or TDMA/CDMA communication system.
  • Said method comprises the step of assigning an orthogonal spreading code selected from a set of complete orthogonal spreading codes .
  • Said system comprises means for assigning orthogonal spreading codes selected from at least one code set of complete orthogonal spreading codes. If more than one set, the code sets of complete orthogonal spreading codes have been selected so that they are completely orthogonal in relation to each other.
  • the US patent US 5 452 328 describes a method for assigning disjoint sets of binary spreading-code sequences to different nodes in a multi-node communication network.
  • Each node in the network is allotted spreading-code sequences which are selected from a family of "almost orthogonal" binary sequences .
  • the patent also describes an apparatus and a method for generating said family of sequences by combining a first and a second multi-stage shift register.
  • the name radio unit includes all portable and non-portable equipment intended for radio communication, like mobile phones, pagers, telex, electronic notebooks and communicators. These equipment's can be used in any type of radio communication system, such as cellular networks, satellite or small local networks .
  • the present invention meets problems related to how a forward- link connection is assigned specific spreading codes in a DS- CDMA communication system where only a finite number of orthogonal spreading codes are available .
  • the system may run out of spreading codes even if only a small number of spreading codes are actually used simultaneous.
  • Each connection has allocated the amount of spreading codes that is needed for the maximum bit-rate irrespective of if the maximum bit-rate is needed for only a short time.
  • a primary object of the present invention is to provide methods and means to assign spreading codes for radio units in a DS-CDMA communication system with variable bit-rate connections.
  • Another object of the present invention is to provide a large number of available spreading codes which is not limited by the amount of orthogonal spreading codes available in a DS-CDMA communication system.
  • a further object of the present invention is to avoid re- allocation of spreading codes during the call in a DS-CDMA communication system.
  • spreading codes are assigned to forward-link connections from a first set of orthogonal spreading codes as long as there are spreading codes available in the first set .
  • a second set of orthogonal spreading codes which are non-orthogonal to the spreading codes in the first set is used from which spreading codes are assigned to the forward-link connections.
  • more than two sets of spreading codes are used.
  • spreading codes assigned to forward-link connection are assigned from two different code sets.
  • a first group of the spreading codes is assigned from the first code set and a second group of the spreading codes is assigned from the second code set.
  • more than two sets of spreading codes are used.
  • the present invention includes methods for assigning spreading codes to variable bit-rate forward-link connections.
  • the methods include the step of assigning spreading codes from a first set of orthogonal spreading codes.
  • the method also includes the step of assigning spreading codes from a second set of orthogonal spreading codes which are non-orthogonal to the spreading codes in the first set.
  • spreading codes are first assigned from the first set of spreading codes.
  • Spreading codes are then assigned from the second code set when all spreading codes in the first code set is allocated.
  • the number of code sets can be extended to more than two code sets.
  • the spreading codes are assigned from two different code sets.
  • a first group of spreading codes is assigned from the first code set and a second group of spreading codes is assigned from the second code set.
  • the first group of the spreading codes comprises those codes which are most frequently used.
  • the second group comprises the remaining codes . More than two code sets can be used.
  • One advantage with the present invention is that the number of simultaneous allocated spreading codes is not hard limited by the size of a code set.
  • each connection is allocated a number of spreading codes at call set-up. No further spreading code re- allocation is needed.
  • Figure 1 is an illustration of a base station and four radio units in a DS-CDMA communication system.
  • Figure 2 is an illustration of an example of a set of code sets in accordance with the present invention.
  • Figure 3 is a first part of a flow chart illustrating a first embodiment of a method in accordance with the present invention.
  • Figure 4 is a second part of the flow chart in figure 3.
  • Figure 5 is an illustration of a set of code sets with assigned spreading codes in accordance with the first embodiment in figure 3 and 4.
  • Figure 6a is a first part of a flow chart illustrating a second embodiment of a method in accordance with the present invention.
  • Figure 6b is a second part of the flow chart in figure 6a.
  • Figure 7 is an illustration of four groups of spreading codes .
  • Figure 8 is an illustration of a set of code sets with assigned spreading codes in accordance with the second embodiment in figure 6a-b.
  • the present invention relates to methods for assigning spreading codes to forward-link connections in DS-CDMA communication systems.
  • the forward-link connections are radio connections where the bit-rate can be varied (variable bit-rate) during the duration of a call.
  • the spreading codes can be assigned at call set-up and e.g. at handover and during set-up of additional services.
  • FIG 1 shows a base station B and four radio units U1-U4 in a DS-CDMA communication system.
  • Each radio unit U1-U4 has a forward-link connection C1-C4, with a variable bit-rate, between the base station B and the respective unit U1-U4.
  • a specified number of spreading codes are assigned to the first forward-link connection Cl by the base station B or by some other part of the communication system.
  • the spreading codes assigned to this forward-link connection Cl can not be assigned to new forward- link connections C2-C4 within the same cell as long as the first forward-link connection Cl is up.
  • the number of spreading codes which are assigned to each of the connections is determined by the desired bit-rate according to the following:
  • a connection with a high bit-rate needs more spreading codes than a connection with a low bit-rate.
  • FIG. 2 shows an example of a set 20 of code sets Sl-Sn according to the present invention.
  • a first code set SI comprises a number of orthogonal spreading codes m 1 .
  • a second code set S2 also comprises a number of orthogonal spreading codes m 2 . These spreading codes are orthogonal in relation to each other but non-orthogonal in relation to the spreading codes in the first code set SI.
  • a third code set S3 also comprises a number of orthogonal spreading codes m 3 . These spreading codes are orthogonal in relation to each other but non-orthogonal in relation to the spreading codes in the first and second code set SI and S2.
  • the number of code sets n with spreading codes can be more than three .
  • Figure 3 and 4 show a flow chart of a first embodiment of a method according to the present invention where a number of spreading codes corresponding to a requested bit-rate are assigned to a variable bit-rate forward-link connection Cl .
  • a step 31a the number of spreading codes needed to transmit at the requested bit-rate between a base station B and a radio unit Ul on the forward-link connection Cl is determined.
  • step 31b the number of available (not assigned) spreading codes in all available code sets is determined. If there are less spreading codes available than the spreading codes needed the method ends, otherwise it continues with a step 32.
  • step 32 the number of available (not assigned) spreading codes in a selected first set SI of orthogonal spreading codes is determined. If there are no available spreading codes in the first set SI of spreading codes the method continues with a step 35. If there are available spreading codes in the first set SI of spreading codes the method continues with a step 33. In step 33 a number of spreading codes, not exceeding the number of spreading codes needed on the forward-link connection Cl , are assigned from the first set SI of spreading codes to the forward-link connection Cl .
  • a step 34 the number of spreading codes needed is compared with the number of spreading codes assigned from the first set SI of spreading codes. The method ends if the number of spreading codes needed are equal to the number of spreading codes assigned from the first set SI of spreading codes, otherwise it continues with a step 35.
  • step 35 the number of available spreading codes in a selected second set S2 of orthogonal spreading codes is determined. If there are no available spreading codes in the second set S2 of spreading codes the method continues with a step 38. If there are available spreading codes in the second set S2 of spreading codes the method continues with a step 36.
  • step 36 a number of spreading codes, not exceeding the number of spreading codes needed on the forward-link connection Cl, are assigned to the forward-link connection Cl .
  • step 37 the number of spreading codes needed is compared with the number of spreading codes assigned from the first and second set of spreading codes SI, S2 respectively. The method ends if the number of spreading codes needed are equal to the number of spreading codes assigned from the first and second set of spreading codes SI, S2 respectively, otherwise it continues with step 38.
  • step 38 shown in figure 4, the number of code sets is determined.
  • the method continues with a step 39 if the number of code sets is three, otherwise it ends.
  • step 39 the number of available spreading codes in a selected third set S3 of orthogonal spreading codes is determined. If there are no available spreading codes in the third set S3 of spreading codes the method continues with a step 42. If there are available spreading codes in the third set S3 of spreading codes the method continues with a step 40.
  • step 40 a number of spreading codes, not exceeding the number of spreading codes needed on the forward-link connection Cl, are assigned from the third set S3 of spreading codes.
  • step 41 the number of spreading codes needed is compared with the number of spreading codes assigned from the first, second and third set of spreading codes SI, S2 , S3 respectively. The method ends if the number of spreading codes needed are equal to the number of spreading codes assigned from the first, second and third set of spreading codes SI, S2 , S3 respectively, otherwise it continues with step 42.
  • step 42 the number of code sets is determined. If the number of code sets is three the method ends, otherwise it continues with more steps similar to the previous steps 39-42 as long as there are more spreading codes to be assigned and more sets Sl-
  • the method according to figure 3 and 4 is repeated each time a new forward-link connection is to be set-up.
  • Figure 5 shows an illustration of a set 50 of code sets Sl-Sn comprising spreading codes according to the first embodiment.
  • the first forward-link connection Cl between the base station B and the radio unit Ul, see figure 1 has been assigned a first number of spreading codes x from the first set SI of spreading codes.
  • a second forward-link connection C2 has been assigned a second number of spreading codes y.
  • a first part y-k x of the second number of spreading codes y are taken from the first set SI of spreading codes and is assigned to the second forward-link connection C2.
  • the first part y-k x of the second number of spreading codes y comprises at least one complete spreading . code .
  • a second part k x of the second number of spreading codes y is taken from the second set S2 of spreading codes and is assigned to the second forward-link connection C2.
  • the second part k x of the second number of spreading codes y comprises at least one complete spreading code.
  • the number of non-assigned spreading codes in the first set SI of spreading codes were less than y so more spreading codes where assigned from the second set S2 of spreading codes.
  • a third forward-link connection C3 has been assigned a third number of spreading codes z from the second set S2 of spreading codes.
  • a fourth forward-link connection C4 has been assigned a fourth number of spreading codes w.
  • a first part w-k 2 of the fourth number of spreading codes w is taken from the second set S2 of spreading codes and is assigned to the fourth forward-link connection C4.
  • the first part w-k 2 of the fourth number of spreading codes w comprises at least one complete spreading code.
  • a second part k 2 of the fourth number of spreading codes w is taken from the third set S3 of spreading codes and is assigned to the fourth forward-link connection C4.
  • the second part k 2 of the fourth number of spreading codes w comprises at least one complete spreading code .
  • Figures 6a-b show a flow chart of a second embodiment of a method according to the present invention where a number of spreading codes corresponding to a requested bit-rate are assigned to a forward-link connection Cl with variable bit-rate.
  • a total number of spreading codes needed to transmit at the requested bit-rate between the base station B and a radio unit Ul on the forward-link connection Cl is determined.
  • a step 61b the number of available (not assigned) spreading codes in all available code sets is determined. If there are less spreading codes available than the total number of spreading codes needed the method ends, otherwise it continues with a step 62.
  • step 62 the total number of spreading codes needed is divided in a first and a second group - l r x 2 respectively.
  • the number of spreading codes needed in the first group x x corresponds to the number of spreading codes which will be most frequently used on the forward-link connection Cl .
  • the number of spreading codes needed in the second group x 2 corresponds to the number of spreading codes which will be less frequently used on the forward-link connection Cl .
  • the first and second group Xi, x 2 respectively will include the total number of spreading codes needed for the forward-link connection Cl .
  • a step 63 the number of available (not assigned) spreading codes in a selected first set SI of orthogonal spreading codes is determined. If there are no available spreading codes in the first set SI of spreading codes the method continues with a step 70, see page 14. If there are available spreading codes in the first set SI of spreading codes the method continues with a step 64.
  • step 64 a number of spreading codes, not exceeding the number of spreading codes needed to the first group x x , are assigned to the first group of spreading codes x from the first set SI of spreading codes .
  • a step 65 the number of spreading codes needed in the first group x is compared with the number of spreading codes assigned from the first set SI of spreading codes. If the number of spreading codes needed in the first group x x is equal to the number of spreading codes assigned from the first set SI of spreading codes the method continues with a step 66 to assign spreading codes to the second group x 2 , otherwise it continues with step 70 to assign more spreading codes to the first group
  • step 66 shown in figure 6b, the number of available (not assigned) spreading codes in a selected second set S2 of orthogonal spreading codes is determined. If there are no available spreading codes in the second set S2 of spreading codes the method continues with a step 69. If there are available spreading codes in the second set S2 of spreading codes the method continues with a step 67.
  • step 67 a number of spreading codes, not exceeding the number of spreading codes needed to the second group x 2 , are assigned to the second group x 2 from the second set S2 of spreading codes .
  • a step 68 the number of spreading codes needed in the second group x 2 is compared with the number of spreading codes assigned from the second set S2 of spreading codes. The method ends if the number of spreading codes needed in the second group x 2 is equal to the number of spreading codes assigned from the second set S2 of spreading codes, otherwise it continues with step 69 to assign more spreading codes to the second group x 2 .
  • step 69 the number of code sets is determined. The method continues with steps similar to the previous steps 63-69 if the number of code sets is more than two, otherwise it ends.
  • step 70 the number of available spreading codes in the selected second set S2 of orthogonal spreading codes is determined.
  • step 69 If there are no available spreading codes in the second set S2 of spreading codes the method continues with a step similar to step 69 to search for more code sets. If there are available spreading codes in the second set S2 of spreading codes the method continues with a step where spreading codes is assigned to the first group x x from the second code set S2.
  • the spreading codes to the second group x 2 is then assigned from a third set S3 of spreading codes.
  • the method according to figures 6a-b continue with steps similar to the previous steps 63-70 as long as there are more spreading codes to be assigned and more sets of codes Sl-Sn available. The method is repeated each time a new forward-link connection with variable bit-rate is to be set-up.
  • Figure 7 shows an example of four groups of spreading codes Gl , G2, G3 , G4 respectively assigned to four different variable bit- rate forward-link connections C1-C4.
  • Each group Gl, G2 , G3 , G4 respectively comprises the total number of spreading codes needed in each forward-link connection C1-C4.
  • the total number of spreading codes needed in each forward-link connection C1-C4 is divided in the first and second group of spreading codes x 1; y x , Z- L , w x , x 2 , y 2 , z 2 , w 2 respectively, where each group x x , y 1 , z 1; w x , x 2 , y 2 , z 2 , w 2 respectively comprises complete spreading codes .
  • Figure 8 shows an illustration of a set 80 of code sets Sl-Sn according to the second embodiment of the method in figure 6.
  • the first forward-link connection Cl with variable bit-rate between the base station B and the radio unit Ul, see figure 1 has been assigned spreading codes from the first SI and second S2 code set .
  • the first group x x of spreading codes has been assigned from the first code set SI and the second group x 2 of spreading codes has been assigned from the second code set S2.
  • the second forward-link connection C2 with variable bit-rate between the base station B and the radio unit U2 has been assigned spreading codes from the first SI and second S2 code set.
  • the first group y ⁇ of spreading codes has been assigned from the first code set SI and the second group y 2 of spreading codes has been assigned from the second code set S2.
  • the third forward-link connection C3 with variable bit-rate between the base station B and the radio unit U3 has been assigned spreading codes from the first SI and second S2 code set .
  • the first group z x of spreading codes has been assigned from the first code set SI and the second group z 2 of spreading codes has been assigned from the second code set S2.
  • the fourth forward-link connection C4 with variable bit-rate between the base station B and the radio unit U4 has been assigned spreading codes from the first SI and third S3 code set .
  • the first group w x of spreading codes has been assigned from the first code set SI and the second group w 2 of spreading codes has been assigned from the third code set S3. There were no non-assigned spreading codes in the second code set S2 left so more spreading codes where assigned from the third code set S3.
  • the signals which have been coded by short spreading codes in the methods according to the present invention can be scrambled.
  • Signals in a forward-link connection which have been coded by short spreading codes is scrambled by a common (long) Pseudo- Noise code (PN-code) .
  • PN-code Pseudo- Noise code
  • the scrambling randomise the interference between the cells. The scrambling will not affect the orthogonality between the signals in one cell as all signals uses the same PN-code.
  • the neighbouring cells uses different PN- codes .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to methods for assigning spreading codes to forward-link connections with variable bit-rate in DS-CDMA communication systems. A first connection is assigned a first number of codes (x) from a first set (S1) of orthogonal codes. A second connection is assigned a second number of codes (y). A first part (y-k1) of the second number of codes (y) is taken from the first set (S1) of orthogonal codes. A second part (k1) of the second number of codes (y) is taken from a second set (S2) of orthogonal codes which is non-orthogonal to the first set (S1).

Description

A METHOD FOR ASSIGNING SPREADING CODES
TECHNICAL FIELD OF THE INVENTION
The present invention relates to methods for assigning spreading codes to DS-CDMA forward-link connections.
DESCRIPTION OF RELATED ART
CDMA (Code Division Multiple Access) is a well known method for multiple access in a radio communication system. The CDMA method uses the spread spectrum technique in which a number of users simultaneously occupy the same frequency band with their radio channels .
In a DS-CDMA (Direct Sequence-CDMA) system which is a particular type of the CDMA techniques, each user is assigned a specific spreading code by which the user is separated from the other users of the system. Another name for a spreading code is spreading sequence or spreading-code sequence.
The transmitted information in the radio signal is coded (spread) by a specific spreading code in the transmitter. At the receiving end the coded information is decoded (despread) by correlating with the same specific spreading code again or by filtering the received information in a matched filter.
A spreading code of the same length as the symbol interval is called a short spreading code .
Orthogonal codes are codes that has zero cross correlation for zero time offset. The use of orthogonal codes will reduce the intra-cell interference, i.e. interference from other forward- link signals in the same cell. Normally the intra-cell interference will not be completely eliminated as time dispersion will partly destroy the orthogonality between signals coded with orthogonal codes .
In general, a set of orthogonal codes does only contain a finite number of codes, where the number of codes is always smaller or the same as the length of the codes .
Consequently, as there are only a finite number of orthogonal spreading codes available, spreading codes which are almost orthogonal or non-orthogonal has to be used to increase the number of simultaneous users or increase the bit-rate of the system.
On a DS-CDMA forward-link (transmission from a base station to a radio unit) , orthogonal spreading codes are often used to separate different radio channels.
When a connection through a radio channel uses more than one spreading code, it is said to use so-called multi-code transmission.
For variable bit-rate connections, i.e. a connection where the bit-rate varies during the duration of a call, the number of spreading codes actually used by each connection will vary in time and between the different connections. A high bit-rate uses more spreading codes than a lower bit-rate.
One example of a scheme to assign spreading codes to a connection with a variable bit-rate in a radio communication system is the static allocation.
A static allocation means that each connection is, at call setup, allocated as many spreading codes as is needed to be able to transmit at a requested maximum bit-rate. This means that a small number of connections with variable bit- rate connection might allocate all available spreading codes even if they do not have to use all of them simultaneous.
Another example of a scheme to assign spreading codes to a connection is the dynamic allocation.
A dynamic allocation means that all connections share a common pool of spreading codes that are continuously redistributed by a base station, according to the instantaneous need of each connection. Each time the bit-rate at a connection is to be increased the base station has to inform the radio unit what new spreading codes to receive. This will require a significant overhead in the communication between the base station and radio unit.
The US patent US 5 533 013 describes a method and a system for assigning complete orthogonal spreading codes and radio channels in a combined CDMA/TDMA or TDMA/CDMA communication system. Said method comprises the step of assigning an orthogonal spreading code selected from a set of complete orthogonal spreading codes . Said system comprises means for assigning orthogonal spreading codes selected from at least one code set of complete orthogonal spreading codes. If more than one set, the code sets of complete orthogonal spreading codes have been selected so that they are completely orthogonal in relation to each other.
The US patent US 5 452 328 describes a method for assigning disjoint sets of binary spreading-code sequences to different nodes in a multi-node communication network.
Each node in the network is allotted spreading-code sequences which are selected from a family of "almost orthogonal" binary sequences . The patent also describes an apparatus and a method for generating said family of sequences by combining a first and a second multi-stage shift register.
As will be seen herein, each of the methods disclosed in these patents is of a different construction than the method of the present invention.
The name radio unit includes all portable and non-portable equipment intended for radio communication, like mobile phones, pagers, telex, electronic notebooks and communicators. These equipment's can be used in any type of radio communication system, such as cellular networks, satellite or small local networks .
SUMMARY
The present invention meets problems related to how a forward- link connection is assigned specific spreading codes in a DS- CDMA communication system where only a finite number of orthogonal spreading codes are available .
One problem occurs when the system is using static allocation for variable bit-rate connections. The system may run out of spreading codes even if only a small number of spreading codes are actually used simultaneous. Each connection has allocated the amount of spreading codes that is needed for the maximum bit-rate irrespective of if the maximum bit-rate is needed for only a short time.
Another problem occurs when the system is using dynamic allocation for variable bit-rate connections. A significant overhead in the communication between the base station and the radio unit is needed to inform the radio unit what new spreading codes to receive each time the bit-rate is increased. In light of the foregoing, a primary object of the present invention is to provide methods and means to assign spreading codes for radio units in a DS-CDMA communication system with variable bit-rate connections.
Another object of the present invention is to provide a large number of available spreading codes which is not limited by the amount of orthogonal spreading codes available in a DS-CDMA communication system.
A further object of the present invention is to avoid re- allocation of spreading codes during the call in a DS-CDMA communication system.
In accordance with a first aspect of the present invention, spreading codes are assigned to forward-link connections from a first set of orthogonal spreading codes as long as there are spreading codes available in the first set . When all spreading codes in the first set is allocated, a second set of orthogonal spreading codes which are non-orthogonal to the spreading codes in the first set is used from which spreading codes are assigned to the forward-link connections. When applicable, more than two sets of spreading codes are used.
According to a second aspect of the present invention, spreading codes assigned to forward-link connection are assigned from two different code sets. A first group of the spreading codes is assigned from the first code set and a second group of the spreading codes is assigned from the second code set. When applicable, more than two sets of spreading codes are used.
The present invention includes methods for assigning spreading codes to variable bit-rate forward-link connections. The methods include the step of assigning spreading codes from a first set of orthogonal spreading codes. The method also includes the step of assigning spreading codes from a second set of orthogonal spreading codes which are non-orthogonal to the spreading codes in the first set. According to the first aspect of the present invention, spreading codes are first assigned from the first set of spreading codes. Spreading codes are then assigned from the second code set when all spreading codes in the first code set is allocated. The number of code sets can be extended to more than two code sets.
According to the second aspect of the invention, the spreading codes are assigned from two different code sets.
A first group of spreading codes is assigned from the first code set and a second group of spreading codes is assigned from the second code set. The first group of the spreading codes comprises those codes which are most frequently used. The second group comprises the remaining codes . More than two code sets can be used.
One advantage with the present invention is that the number of simultaneous allocated spreading codes is not hard limited by the size of a code set.
Another advantage is that each connection is allocated a number of spreading codes at call set-up. No further spreading code re- allocation is needed. BRIEF DESCRIPTION OF THE DRAWINGS
These above mentioned objects and other features of the present invention will become more readily apparent upon reference to the following description when taken in conjunction with the accompanying drawings .
Figure 1 is an illustration of a base station and four radio units in a DS-CDMA communication system.
Figure 2 is an illustration of an example of a set of code sets in accordance with the present invention.
Figure 3 is a first part of a flow chart illustrating a first embodiment of a method in accordance with the present invention.
Figure 4 is a second part of the flow chart in figure 3.
Figure 5 is an illustration of a set of code sets with assigned spreading codes in accordance with the first embodiment in figure 3 and 4.
Figure 6a is a first part of a flow chart illustrating a second embodiment of a method in accordance with the present invention.
Figure 6b is a second part of the flow chart in figure 6a.
Figure 7 is an illustration of four groups of spreading codes .
Figure 8 is an illustration of a set of code sets with assigned spreading codes in accordance with the second embodiment in figure 6a-b. DETAILED DESCRIPTION OF EMBODIMENTS
The present invention relates to methods for assigning spreading codes to forward-link connections in DS-CDMA communication systems. The forward-link connections are radio connections where the bit-rate can be varied (variable bit-rate) during the duration of a call.
The spreading codes can be assigned at call set-up and e.g. at handover and during set-up of additional services.
Figure 1 shows a base station B and four radio units U1-U4 in a DS-CDMA communication system. Each radio unit U1-U4 has a forward-link connection C1-C4, with a variable bit-rate, between the base station B and the respective unit U1-U4.
When a first forward-link connection Cl between the base station B and the radio unit Ul is to be set up a specified number of spreading codes are assigned to the first forward-link connection Cl by the base station B or by some other part of the communication system. The spreading codes assigned to this forward-link connection Cl can not be assigned to new forward- link connections C2-C4 within the same cell as long as the first forward-link connection Cl is up.
The number of spreading codes which are assigned to each of the connections is determined by the desired bit-rate according to the following:
A connection with a high bit-rate needs more spreading codes than a connection with a low bit-rate.
A connection with multi-code transmission uses several codes in parallel to increase the bit-rate. Figure 2 shows an example of a set 20 of code sets Sl-Sn according to the present invention. A first code set SI comprises a number of orthogonal spreading codes m1. A second code set S2 also comprises a number of orthogonal spreading codes m2. These spreading codes are orthogonal in relation to each other but non-orthogonal in relation to the spreading codes in the first code set SI.
A third code set S3 also comprises a number of orthogonal spreading codes m3. These spreading codes are orthogonal in relation to each other but non-orthogonal in relation to the spreading codes in the first and second code set SI and S2. The number of code sets n with spreading codes can be more than three .
Figure 3 and 4 show a flow chart of a first embodiment of a method according to the present invention where a number of spreading codes corresponding to a requested bit-rate are assigned to a variable bit-rate forward-link connection Cl .
In a step 31a the number of spreading codes needed to transmit at the requested bit-rate between a base station B and a radio unit Ul on the forward-link connection Cl is determined.
In a step 31b the number of available (not assigned) spreading codes in all available code sets is determined. If there are less spreading codes available than the spreading codes needed the method ends, otherwise it continues with a step 32.
In step 32 the number of available (not assigned) spreading codes in a selected first set SI of orthogonal spreading codes is determined. If there are no available spreading codes in the first set SI of spreading codes the method continues with a step 35. If there are available spreading codes in the first set SI of spreading codes the method continues with a step 33. In step 33 a number of spreading codes, not exceeding the number of spreading codes needed on the forward-link connection Cl , are assigned from the first set SI of spreading codes to the forward-link connection Cl .
In a step 34 the number of spreading codes needed is compared with the number of spreading codes assigned from the first set SI of spreading codes. The method ends if the number of spreading codes needed are equal to the number of spreading codes assigned from the first set SI of spreading codes, otherwise it continues with a step 35.
In step 35 the number of available spreading codes in a selected second set S2 of orthogonal spreading codes is determined. If there are no available spreading codes in the second set S2 of spreading codes the method continues with a step 38. If there are available spreading codes in the second set S2 of spreading codes the method continues with a step 36.
In step 36 a number of spreading codes, not exceeding the number of spreading codes needed on the forward-link connection Cl, are assigned to the forward-link connection Cl .
In a step 37 the number of spreading codes needed is compared with the number of spreading codes assigned from the first and second set of spreading codes SI, S2 respectively. The method ends if the number of spreading codes needed are equal to the number of spreading codes assigned from the first and second set of spreading codes SI, S2 respectively, otherwise it continues with step 38.
In step 38, shown in figure 4, the number of code sets is determined. The method continues with a step 39 if the number of code sets is three, otherwise it ends. In step 39 the number of available spreading codes in a selected third set S3 of orthogonal spreading codes is determined. If there are no available spreading codes in the third set S3 of spreading codes the method continues with a step 42. If there are available spreading codes in the third set S3 of spreading codes the method continues with a step 40.
In step 40 a number of spreading codes, not exceeding the number of spreading codes needed on the forward-link connection Cl, are assigned from the third set S3 of spreading codes.
In a step 41 the number of spreading codes needed is compared with the number of spreading codes assigned from the first, second and third set of spreading codes SI, S2 , S3 respectively. The method ends if the number of spreading codes needed are equal to the number of spreading codes assigned from the first, second and third set of spreading codes SI, S2 , S3 respectively, otherwise it continues with step 42.
In step 42, the number of code sets is determined. If the number of code sets is three the method ends, otherwise it continues with more steps similar to the previous steps 39-42 as long as there are more spreading codes to be assigned and more sets Sl-
Sn of codes available.
The method according to figure 3 and 4 is repeated each time a new forward-link connection is to be set-up.
Figure 5 shows an illustration of a set 50 of code sets Sl-Sn comprising spreading codes according to the first embodiment. The first forward-link connection Cl between the base station B and the radio unit Ul, see figure 1, has been assigned a first number of spreading codes x from the first set SI of spreading codes. A second forward-link connection C2 has been assigned a second number of spreading codes y. A first part y-kx of the second number of spreading codes y are taken from the first set SI of spreading codes and is assigned to the second forward-link connection C2. The first part y-kx of the second number of spreading codes y comprises at least one complete spreading . code . A second part kx of the second number of spreading codes y is taken from the second set S2 of spreading codes and is assigned to the second forward-link connection C2. The second part kx of the second number of spreading codes y comprises at least one complete spreading code. The number of non-assigned spreading codes in the first set SI of spreading codes were less than y so more spreading codes where assigned from the second set S2 of spreading codes.
A third forward-link connection C3 has been assigned a third number of spreading codes z from the second set S2 of spreading codes.
A fourth forward-link connection C4 has been assigned a fourth number of spreading codes w. A first part w-k2 of the fourth number of spreading codes w is taken from the second set S2 of spreading codes and is assigned to the fourth forward-link connection C4. The first part w-k2 of the fourth number of spreading codes w comprises at least one complete spreading code. A second part k2 of the fourth number of spreading codes w is taken from the third set S3 of spreading codes and is assigned to the fourth forward-link connection C4. The second part k2 of the fourth number of spreading codes w comprises at least one complete spreading code .
Figures 6a-b show a flow chart of a second embodiment of a method according to the present invention where a number of spreading codes corresponding to a requested bit-rate are assigned to a forward-link connection Cl with variable bit-rate.
In a step 61a a total number of spreading codes needed to transmit at the requested bit-rate between the base station B and a radio unit Ul on the forward-link connection Cl is determined.
In a step 61b the number of available (not assigned) spreading codes in all available code sets is determined. If there are less spreading codes available than the total number of spreading codes needed the method ends, otherwise it continues with a step 62.
In step 62 the total number of spreading codes needed is divided in a first and a second group - l r x2 respectively. The number of spreading codes needed in the first group xx corresponds to the number of spreading codes which will be most frequently used on the forward-link connection Cl . The number of spreading codes needed in the second group x2 corresponds to the number of spreading codes which will be less frequently used on the forward-link connection Cl . Together the first and second group Xi, x2 respectively will include the total number of spreading codes needed for the forward-link connection Cl .
In a step 63 the number of available (not assigned) spreading codes in a selected first set SI of orthogonal spreading codes is determined. If there are no available spreading codes in the first set SI of spreading codes the method continues with a step 70, see page 14. If there are available spreading codes in the first set SI of spreading codes the method continues with a step 64.
In step 64 a number of spreading codes, not exceeding the number of spreading codes needed to the first group xx, are assigned to the first group of spreading codes x from the first set SI of spreading codes .
In a step 65 the number of spreading codes needed in the first group x is compared with the number of spreading codes assigned from the first set SI of spreading codes. If the number of spreading codes needed in the first group xx is equal to the number of spreading codes assigned from the first set SI of spreading codes the method continues with a step 66 to assign spreading codes to the second group x2, otherwise it continues with step 70 to assign more spreading codes to the first group
In step 66, shown in figure 6b, the number of available (not assigned) spreading codes in a selected second set S2 of orthogonal spreading codes is determined. If there are no available spreading codes in the second set S2 of spreading codes the method continues with a step 69. If there are available spreading codes in the second set S2 of spreading codes the method continues with a step 67.
In step 67 a number of spreading codes, not exceeding the number of spreading codes needed to the second group x2, are assigned to the second group x2 from the second set S2 of spreading codes .
In a step 68 the number of spreading codes needed in the second group x2 is compared with the number of spreading codes assigned from the second set S2 of spreading codes. The method ends if the number of spreading codes needed in the second group x2 is equal to the number of spreading codes assigned from the second set S2 of spreading codes, otherwise it continues with step 69 to assign more spreading codes to the second group x2.
In step 69, the number of code sets is determined. The method continues with steps similar to the previous steps 63-69 if the number of code sets is more than two, otherwise it ends. In step 70 the number of available spreading codes in the selected second set S2 of orthogonal spreading codes is determined.
If there are no available spreading codes in the second set S2 of spreading codes the method continues with a step similar to step 69 to search for more code sets. If there are available spreading codes in the second set S2 of spreading codes the method continues with a step where spreading codes is assigned to the first group xx from the second code set S2.
The spreading codes to the second group x2 is then assigned from a third set S3 of spreading codes.
The method according to figures 6a-b continue with steps similar to the previous steps 63-70 as long as there are more spreading codes to be assigned and more sets of codes Sl-Sn available. The method is repeated each time a new forward-link connection with variable bit-rate is to be set-up.
Figure 7 shows an example of four groups of spreading codes Gl , G2, G3 , G4 respectively assigned to four different variable bit- rate forward-link connections C1-C4. Each group Gl, G2 , G3 , G4 respectively comprises the total number of spreading codes needed in each forward-link connection C1-C4. The total number of spreading codes needed in each forward-link connection C1-C4 is divided in the first and second group of spreading codes x1; yx, Z-L, wx , x2, y2, z2, w2 respectively, where each group xx, y1 , z1; wx , x2, y2, z2, w2 respectively comprises complete spreading codes .
Figure 8 shows an illustration of a set 80 of code sets Sl-Sn according to the second embodiment of the method in figure 6. The first forward-link connection Cl with variable bit-rate between the base station B and the radio unit Ul, see figure 1, has been assigned spreading codes from the first SI and second S2 code set . The first group xx of spreading codes has been assigned from the first code set SI and the second group x2 of spreading codes has been assigned from the second code set S2.
The second forward-link connection C2 with variable bit-rate between the base station B and the radio unit U2 , see figure 1, has been assigned spreading codes from the first SI and second S2 code set. The first group yλ of spreading codes has been assigned from the first code set SI and the second group y2 of spreading codes has been assigned from the second code set S2.
The third forward-link connection C3 with variable bit-rate between the base station B and the radio unit U3 , see figure 1, has been assigned spreading codes from the first SI and second S2 code set . The first group zx of spreading codes has been assigned from the first code set SI and the second group z2 of spreading codes has been assigned from the second code set S2.
The fourth forward-link connection C4 with variable bit-rate between the base station B and the radio unit U4 , see figure 1, has been assigned spreading codes from the first SI and third S3 code set . The first group wx of spreading codes has been assigned from the first code set SI and the second group w2 of spreading codes has been assigned from the third code set S3. There were no non-assigned spreading codes in the second code set S2 left so more spreading codes where assigned from the third code set S3.
The signals which have been coded by short spreading codes in the methods according to the present invention can be scrambled. Signals in a forward-link connection which have been coded by short spreading codes is scrambled by a common (long) Pseudo- Noise code (PN-code) . The scrambling randomise the interference between the cells. The scrambling will not affect the orthogonality between the signals in one cell as all signals uses the same PN-code. The neighbouring cells uses different PN- codes .

Claims

1. A method for assigning spreading codes to a first corresponding forward-link connection (Cl) among a plurality of forward-link connections (C1-C4) in a DS-CDMA communication system having a plurality of radio units (U1-U4) , comprising the following steps: a) assigning (33) spreading codes from a selected first set (SI) of orthogonal spreading codes to said first forward- link connection (Cl) , c h a r a c t e r i s e d in the further step of: b) assigning (36) spreading codes from a selected second set (S2) of orthogonal spreading codes to said first forward-link connection (Cl) if said first forward-link connection (Cl) requires more spreading codes then there are available in said first set (SI) of orthogonal spreading codes, where at least one of said spreading codes of said second set (S2) of orthogonal spreading codes are non-orthogonal to at least one of said spreading codes of said first set (SI) of orthogonal spreading codes .
2. A method as claimed in claim 1, c h a r a c t e r i s e d in that said assigning (33, 36) according to step a) -b) implies assigning said spreading codes to said first forward-link connection (Cl) at call set-up.
3. A method as claimed in claim 1 or 2 , c h a r a c t e r i s e d in that said assigning (33, 36) according to step a) -b) implies assigning of a number of spreading codes to said first forward-link connection (Cl) , where said number of spreading codes is determined by a requested maximum bit-rate.
4. A method as claimed in one of claims 1-3, c h a r a c t e r i s e d in that said forward-link connection
(Cl) is a variable bit-rate forward-link connection (Cl) .
5. A method as claimed in one of claims 1-4, c h a r a c t e r i s e d in that said DS-CDMA communication system provides multi-code transmission.
6. A method as claimed in one of claims 1-5, c h a r a c t e r i s e d in that said method further comprises the step of : c) assigning (40) spreading codes from a selected third set (S3) of orthogonal spreading codes to said first forward-link connection (Cl) , if said first forward-link connection (Cl) requires more spreading codes then there are available in said first (SI) and second (S2) set of orthogonal spreading codes, where at least one of said spreading codes of said third set (S3) of orthogonal spreading codes are non-orthogonal to at least one of said spreading codes of said first (SI) and second (S2) set of orthogonal spreading codes.
7. A method for assigning spreading codes to corresponding forward-link connections (C1-C4) in a DS-CDMA communication system having a plurality of radio units (U1-U4) , comprising the following steps: a) assigning (33) a first number of spreading codes (x) from a first set (SI) of orthogonal spreading codes to a first forward- link connection (Cl) ; c h a r a c t e r i s e d in the further step of : b) assigning (33) a first part (y-kx) of complete spreading codes of a second number of spreading codes (y) from said first set (SI) of spreading codes to a second forward-link connection (C2) ; c) assigning (36) a second part of complete spreading codes (kx) of said second number of spreading codes (y) from a second set (S2) of orthogonal spreading codes to said second forward- link connection (C2) , where at least one of said spreading codes of said second set (S2) are non-orthogonal to at least one of said spreading codes of said first set (SI) .
8. A method for assigning a number of spreading codes to a first corresponding forward-link connection (Cl) among a plurality of forward-link connections (C1-C4) in a DS-CDMA communication system having a plurality of radio units (U1-U4) , c h a r a c t e r i s e d in the following steps: a) assigning (64) a first group (xx) of complete spreading codes to said first forward-link connection (Cl) from a selected first set (SI) of orthogonal spreading codes; b) assigning (67) a second group (x2) of complete spreading codes to said first forward-link connection (Cl) from a selected second set (S2) of orthogonal spreading codes, where at least one of said spreading codes of said second set (S2) are non- orthogonal to at least one of said spreading codes of said first set (SI) , and where said first (xx) and second (x2) group of spreading codes includes said number of spreading codes needed for said forward-link connection (Cl) .
9. A method as claimed in claim 8, c h a r a c t e r i s e d in that said assigning (64, 67) according to step a) -b) implies assigning the spreading codes to said first forward-link connection (Cl) at call set-up.
10. A method as claimed in claim 8 or 9 , c h a r a c t e r i s e d in that said number of spreading codes needed to said first forward-link connection (Cl) is determined by a requested maximum bit-rate.
11. A method as claimed in one of claims 8-10, c h a r a c t e r i s e d in that said forward-link connection (Cl) is a variable bit-rate forward-link connection (Cl) .
12. A method as claimed in one of claims 8-11, c h a r a c t e r i s e d in that said DS-CDMA communication system provides multi-code transmission.
13. A method for assigning a total number of spreading codes to corresponding forward-link connections (C1-C4) with variable bit-rate in a DS-CDMA communication system having a plurality of radio units (U1-U4) , c h a r a c t e r i s e d in the following steps : a) assigning (64) a first group (xx) of complete spreading codes to a first forward-link connection (Cl) from a first set
(SI) of orthogonal spreading codes; b) assigning (64) a first group {y ) of complete spreading codes to a second forward-link connection (C2) from said first set (SI) of orthogonal spreading codes; c) assigning (67) a second group (x2) of complete spreading codes to said first forward-link connection (Cl) from a second set (S2) of orthogonal spreading codes, where at least one of said spreading codes of said second set (S2) are non-orthogonal to at least one of said spreading codes of said first set (SI) , and where said first (xx) and second (x2) group of spreading codes to said first forward-link connection (Cl) includes the total number of spreading codes needed for said first forward- link connection (Cl) ; d) assigning (67) a second group (y2) of complete spreading codes to said second forward-link connection (C2) from said second set (S2) of orthogonal spreading codes, where said first (yx) and second (y2) group of spreading codes to said second forward-link connection (C2) includes the total number of spreading codes needed for said second forward-link connection (C2) .
EP98941980A 1997-09-02 1998-08-28 A method for assigning spreading codes Withdrawn EP1010266A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
SE9703161A SE9703161L (en) 1997-09-02 1997-09-02 Procedure for telecommunications
SE9703161 1997-09-02
PCT/SE1998/001541 WO1999012284A1 (en) 1997-09-02 1998-08-28 A method for assigning spreading codes

Publications (1)

Publication Number Publication Date
EP1010266A1 true EP1010266A1 (en) 2000-06-21

Family

ID=20408114

Family Applications (1)

Application Number Title Priority Date Filing Date
EP98941980A Withdrawn EP1010266A1 (en) 1997-09-02 1998-08-28 A method for assigning spreading codes

Country Status (13)

Country Link
EP (1) EP1010266A1 (en)
JP (1) JP2001515302A (en)
KR (1) KR20010023600A (en)
CN (1) CN1118963C (en)
AR (1) AR017048A1 (en)
AU (1) AU751483B2 (en)
BR (1) BR9811428A (en)
CA (1) CA2299297A1 (en)
FI (1) FI20000460A (en)
SE (1) SE9703161L (en)
TW (1) TW393843B (en)
WO (1) WO1999012284A1 (en)
ZA (1) ZA986672B (en)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI982203A (en) * 1998-10-09 2000-04-10 Nokia Networks Oy Method and generator for generating an orthogonal spreading code in a CDMA radio system
ATE372618T1 (en) 1999-07-07 2007-09-15 Samsung Electronics Co Ltd DEVICE AND METHOD FOR GENERATING SCRAPPING CODES IN A UMTS MOBILE MESSAGE TRANSMISSION SYSTEM
KR100396653B1 (en) * 1999-12-30 2003-09-02 엘지전자 주식회사 Transmission method for multiple chip rate in mobile communications system
JP3565102B2 (en) 1999-08-13 2004-09-15 日本電気株式会社 Downlink spreading code allocation method and base station
KR100429545B1 (en) * 1999-08-17 2004-04-28 삼성전자주식회사 Method for communicating scrambling code id in mobile communication system
FR2820933B1 (en) * 2001-02-09 2003-05-30 Sagem TEST METHOD AND TOOL FOR CELLULAR MULTIPLEXED CELLULAR RADIO TELEPHONY NETWORK
KR100449546B1 (en) * 2001-10-08 2004-09-21 주식회사 카서 Code select cdma modulation and demodulation method and device thereof
KR100444845B1 (en) * 2002-04-12 2004-08-21 주식회사 카서 Coding method and apparatus for constant amplitude transmission in code select cdma communication system and device thereof
FR2844134B1 (en) * 2002-09-04 2006-01-13 Nortel Networks Ltd METHOD OF ALLOCATING RESOURCES IN A RADIO COMMUNICATION SYSTEM WITH SPATIAL DIVISION AND EQUIPMENT FOR IMPLEMENTING THE METHOD.
US8004959B2 (en) 2004-07-06 2011-08-23 Telefonaktiebolaget Lm Ericsson (Publ) Different orthogonal code sets with members in common
KR100662506B1 (en) * 2004-08-04 2006-12-28 한국전자통신연구원 Apparatus and its method for deciding user code according to number of connecting user and, apparatus and its method for generating user code using the same in quasi-synchronous cdma system
CN1921362B (en) * 2005-08-23 2011-09-21 中兴通讯股份有限公司 Orthogonal variable spread-spectrum code distribution method in code division multiple access communication system
CN101388685B (en) * 2007-09-12 2014-02-19 中兴通讯股份有限公司 Code resource management method
GB2495709B (en) * 2011-10-17 2014-12-10 Aetheric Engineering Ltd Communication system and method of operating the same
EP2739104A1 (en) * 2012-11-28 2014-06-04 Alcatel-Lucent A cellular telecommunications base station and a method of allocating a spreading code

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5210770A (en) * 1991-09-27 1993-05-11 Lockheed Missiles & Space Company, Inc. Multiple-signal spread-spectrum transceiver
MY112371A (en) * 1993-07-20 2001-05-31 Qualcomm Inc System and method for orthogonal spread spectrum sequence generation in variable data rate systems
US5515396A (en) * 1994-02-25 1996-05-07 Motorola, Inc. Method and apparatus for selecting a spreading code in a spectrum spread communication system
FI955113A (en) * 1995-10-26 1997-04-27 Nokia Mobile Phones Ltd Procedure for data communication, transmitters and receivers

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO9912284A1 *

Also Published As

Publication number Publication date
AR017048A1 (en) 2001-08-22
CA2299297A1 (en) 1999-03-11
JP2001515302A (en) 2001-09-18
CN1118963C (en) 2003-08-20
SE9703161L (en) 1999-03-03
BR9811428A (en) 2000-08-22
ZA986672B (en) 1999-04-01
AU9012798A (en) 1999-03-22
WO1999012284A1 (en) 1999-03-11
TW393843B (en) 2000-06-11
FI20000460A (en) 2000-02-29
CN1269927A (en) 2000-10-11
KR20010023600A (en) 2001-03-26
AU751483B2 (en) 2002-08-15
SE9703161D0 (en) 1997-09-02

Similar Documents

Publication Publication Date Title
US6163524A (en) Code allocation in CDMA
US6091760A (en) Non-recursively generated orthogonal PN codes for variable rate CDMA
AU742336B2 (en) Channelization code allocation for radio communication systems
KR100594042B1 (en) Apparatus and method for generating multi scrambling code in asynchronous mobile communication system
AU751483B2 (en) A method for assigning spreading codes
US20020172264A1 (en) Partly orthogonal multiple code trees
KR20010072762A (en) Communication methods and apparatus based on orthogonal hadamard-based sequences having selected correlation properties
US5943330A (en) Data transmission method, transmitter, and receiver
EP1060588A1 (en) Apparatus for incorporating multiple data rates in an orthogonal direct sequence code division multiple access (ods-cdma) communications system
EP1075104B1 (en) Scrambling codes and channelization codes for multiple chip rate signals in CDMA cellular mobile radio communication system
JP3527674B2 (en) Method for dynamically assigning different length channel codes for use in a wireless communication system
AU741298B2 (en) Device and method for spreading channels in mobile communication system
US6963601B1 (en) Apparatus and method for spreading channel data in CDMA communication system using orthogonal transmit diversity
AU2004234885A1 (en) Method, transmitter and receiver for transmitting data in a CDMA system by means of complete complementary code matrices for two-dimensional data spreading in a frequency and time direction
KR100331876B1 (en) Allocation Method for channelization code in multi code rate
MXPA00002096A (en) A method for assigning spreading codes
KR20010092561A (en) Generalized Transmission method for multiple chip rate in mobile communications system
OkaWa Magnusson et al.[45] Date of Patent: Dec. 19, 2000
KR20010100237A (en) Apparatus and Method for transmitting common packet channel

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20000129

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE FR GB IT

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)

17Q First examination report despatched

Effective date: 20040519

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20041130