EP1103109A1 - Procede et dispositif d'attribution de canaux dans un systeme de separation d'abonnes cdma - Google Patents

Procede et dispositif d'attribution de canaux dans un systeme de separation d'abonnes cdma

Info

Publication number
EP1103109A1
EP1103109A1 EP99952268A EP99952268A EP1103109A1 EP 1103109 A1 EP1103109 A1 EP 1103109A1 EP 99952268 A EP99952268 A EP 99952268A EP 99952268 A EP99952268 A EP 99952268A EP 1103109 A1 EP1103109 A1 EP 1103109A1
Authority
EP
European Patent Office
Prior art keywords
cdma
node
nodes
data rate
tree structure
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
EP99952268A
Other languages
German (de)
English (en)
Inventor
Markus Dillinger
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.)
Siemens AG
Original Assignee
Siemens AG
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 Siemens AG filed Critical Siemens AG
Publication of EP1103109A1 publication Critical patent/EP1103109A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • 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
    • H04J13/20—Allocation of orthogonal codes having an orthogonal variable spreading factor [OVSF]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/204—Multiple access
    • H04B7/216—Code division or spread-spectrum multiple access [CDMA, SSMA]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/004—Orthogonal
    • H04J13/0044—OVSF [orthogonal variable spreading factor]

Definitions

  • the invention relates to a method and a device for channel allocation in a communication system with CDMA subscriber separation.
  • a channel describes a connection from a message source (transmitter) to a message sink (receiver).
  • the information to be transmitted is usually coded, modulated and amplified on the transmission side, so that it can be evaluated on the reception side by means of measures corresponding to the transmission side after transmission, which usually results in attenuation and distortion.
  • a cable or a radio interface can be used as the transmission medium.
  • information for example voice, image information or other data
  • the electromagnetic waves are emitted at carrier frequencies that lie in the frequency band provided for the respective system.
  • frequencies in the frequency band of approx. 2000 MHz are provided.
  • FDMA frequency division multiple access
  • TDMA time division multiple access
  • CDMA code division multiple access
  • Channel allocation procedures describe a strategy for how to make the best possible use of the radio resources of the
  • the channels are allocated to the individual connections, whereby it should be noted that future changes in the data rate of individual connections should result in the least possible adaptation effort when allocating the channels to the previous connections.
  • An adjustment effort arises when an existing connection has to give up a CDMA code and another CDMA code is assigned to it.
  • the CDMA codes form the channels for connections, the CDMA codes available for channel allocation being derived from one another in a tree structure.
  • a chip sequence of a higher-order CDMA code is thus, for example, a subset of the chip sequence of a lower-order CDMA code.
  • the CDMA codes are represented by nodes within the tree structure. Several knots come together in a node, which in turn lead to further nodes of lower order.
  • the nodes are represented for the method of channel allocation by a symbol sequence, the symbol sequences of two nodes differing in one place, which are within the distance of the two nodes from their union nodes corresponds to the tree structure.
  • a small digit means that two nodes are very different and a difference already occurs close to the root of the tree structure. In other words, the union node (father node) is near the root in this case.
  • a distinction is made between free nodes and assigned nodes, a free node designating an unassigned CDMA code and a busy node designating an assigned CDMA code. Only unassigned CDMA codes can be allocated.
  • a free CDMA code For the allocation of a free CDMA code to a connection, in a first step all free nodes are selected which are not connected directly up or down in the tree structure to an already occupied node, i.e. differ from an already occupied node in at least one symbol.
  • No CDMA code may be assigned, the chip sequence of which is an exact subset of an already assigned CDMA code or for which the chip sequence of an already assigned CDMA code forms a subset.
  • the position in the symbol sequence is determined for the selected nodes, beginning with the root of the tree structure, in which a difference to an already occupied node occurs.
  • the location is therefore a measure of the distinctive character of two CDMA codes.
  • the data rate for one of the two CDMA codes can be increased without a collision with the second CDMA code occurring. Furthermore, a sum of the positions for all occupied nodes is determined and the channel with the CDMA code is allocated which corresponds to the node of the predeterminable sum. The allocation strategy is thus based on the distinctive character of all other CDMA codes, i.e. on the sum of the distinctions.
  • the tree structure is advantageously such that the distance of a node from the root increases hung of the spreading factor of the CDMA code and thus corresponds directly to a reduction in the data rate for the connection.
  • the data rate can only be increased without changing the allocation of the other CDMA codes by changing a CDMA code by assigning a new node in the tree structure starting from the previous node in the direction of the root, giving up the previous one.
  • the goal is different if for some connections no and only a limited increase in the data rate is possible or wanted, e.g. for participants with a fixed basic data rate. It is advantageous here that the predeterminable sum is the largest of the sums. CDMA codes that do not differ greatly are thus allocated, that is to say parts of the tree structure are kept free for further connections with possibly higher data rates.
  • a mixed form for the previous two strategies provides that an increase possibility for a data rate of the connection is determined and a node with a difference to an already occupied node is selected at a certain position, the position corresponding to the increase possibility.
  • the possibility of increasing the data rate can be found in the tree structure in the number of nodes that can be moved in the direction of the root (one node before the union node with an already occupied node) without a collision with an already assigned CDMA code. If the potential for improvement is known in advance, can That is, exactly a sufficient part of the tree structure must be reserved, ie not too much and not too little.
  • the process can also be carried out in several stages.
  • An advantageous further development of the invention provides that several channels with different CDMA codes are allocated, a desired data rate resulting from the total of the individual data rates of the CDMA codes.
  • the free nodes of the tree structure can with a high load, i.e. Allocation of the nodes, nevertheless be used well.
  • the symbols are digital values.
  • One branch branches off from each node in the direction of the root and two branches in the opposite direction.
  • a particularly easy to implement mapping of the CDMA codes onto the tree structure provides that, starting from the root of the tree structure, the two following nodes of the outgoing branches are represented by an additional “0” or “1” in the symbol sequence, the number the bits of the symbol sequence correspond to the spreading factor.
  • the digital tree structure is very clear.
  • the CDMA codes are, for example, orthogonal codes (OVSF) with a variable spreading factor. This simplifies the detection on the receiving side, since such CDMA codes constantly support the best possible decorrelation.
  • OVSF orthogonal codes
  • a channel assignment according to the invention can be used in a wide variety of communication systems, use for the downward direction of a radio interface in a broadband radio communication System particularly advantageous.
  • a radio interface is set up for the 3rd generation of mobile communications and can support a large number of channels. The larger the number of channels, the more important a good assignment strategy is.
  • a desired data rate and / or possibility of increasing the data rate of the connection is derived from an identifier and / or from a signaled request from a mobile station.
  • the potential for increase can thus be determined precisely for the mobile stations and in accordance with the current connection and service profiles, and thus only the necessary and not useless free spaces in the tree structure can be reserved in the assignment strategy.
  • FIG. 1 shows the structure of orthogonal CDMA codes with a variable spreading factor
  • FIG. 2 shows a tree structure for displaying the CDMA codes
  • FIGS. 3-5 allocation strategies for channel allocation
  • FIG. 6 shows a schematic representation of a mobile radio system.
  • the different connections can be distinguished on the basis of an individual CDMA code with which the signals of the connections are spread.
  • An example of such a communication system is a digital radio communication system with broadband channels, which consists of the “UTRA Physical Layer
  • the level of the tree doubles the number of chips per CDMA code and thus the spreading factor SF.
  • two CDMA codes of the next lower level (1,1,1,1) and (1,1, -1, -1) are derived.
  • the first half (1,1) is adopted and the second half either adopted (1,1) or inverted (-1, -1). In this way, a code family is created across eight levels, for example.
  • a gross data rate of 32 kbit / s is used, for example, to encode voice information with a net data rate of 8 kbit / s and to transmit it in an error-protected manner via the radio interface.
  • CDMA codes are allocated according to the data rate desired by the connection. Are all CDMA codes still free, e.g. in the start-up phase, then one of the CDMA codes can be arbitrarily assigned. However, if some of the CDMA codes have already been assigned, then when assigning a CDMA code that is still free to a new connection, boundary conditions must be observed.
  • the CDMA codes used within a frequency band in a radio cell must be at least in a part of them Distinguish chip sequence. Furthermore, changes in the data rate of a connection should be taken into account in advance and CDMA codes of a higher level should not be blocked by the new allocation of a CDMA code of a lower level.
  • a form of representation in the form of a tree structure according to FIG. 2 is chosen, which designates the nodes of the tree with a digital symbol sequence. Starting from a knot, e.g. 11, a "1" is added for the upper of the branches moving away from the root and a "0" is added for the lower branch. This simplifies an evaluation of the tree structure, since the number of digits of the symbol sequence corresponds directly to the level of the node (and the spreading factor SF) in the tree.
  • no difference can be determined.
  • the two nodes at least do not differ in a symbol. If no difference can be determined, this corresponds to two CDMA codes which are connected to one another in the tree structure directly upwards or downwards.
  • a node (1111 in FIG. 3) blocks all nodes (111, 11, 11, 1) arranged in ascending order in the tree and vice versa.
  • the sum of the positions is used at which the first difference from the left occurred in comparison with all nodes already occupied (at least all occupied nodes of a part of the tree structure).
  • the sum 9 2 + 2 + 3 + 1 + 1
  • the sum 8 1 + 1 + 1 + 2 + 3
  • the sum 8 1 + 1 + 1 + 2 + 3.
  • the sums are now compared with a predeterminable sum. If the predeterminable sum is the maximum, node 101 is selected. If the predeterminable sum is the minimum, node 010 or 001 can be selected. The choice between the two nodes 010 or 001 is arbitrary.
  • the maximum is chosen if it is desired to group the occupied nodes, ie the allocated CDMA codes, closely together (see FIG. 4). This has advantages if there are no major changes in the data rates of the connections. are waiting. The minimum is chosen in order to achieve the most even possible distribution of all CDMA codes used in the tree. From a statistical point of view, this has the advantage that there is maximum flexibility for a later allocation of higher data rates. According to FIG. 3, this is not yet relevant since the data rate cannot be simply doubled for any of the nodes 101, 010 or 001. However, the connections are not permanent, so that if a previously occupied CDMA code is released, the probability for nodes 010 and 001 is greater than for node 110 that an increase in the data rate will be possible in the future.
  • the desired data rate and / or possibility of increasing a data rate of the connection is derived from an identifier (e.g. a service class of the possible services or an identification of the mobile station) or from a signaled request from a mobile station for a service. These values can also be updated during a connection.
  • Allocation optimization is aimed at a window of data rates for a connection. 5 is again some of the nodes are already occupied.
  • the assignment of a CDMA code for a connection with a data rate of 32 Kbit / s with an increase to a maximum of 64 Kbit / s is to be shown.
  • a node with a difference to an already occupied node is selected exactly at a certain point, which corresponds to the possibility of increase.
  • the possibility of increasing to 64 Kbit / s corresponds to the seventh digit.
  • CDMA codes For example, if a connection is to be operated with a data rate of 96 Kbit / s, two CDMA codes must be assigned, either three - 32 Kbit / s or one for 32 Kbit / s and another for 64 Kbit / s.
  • the allocation process is therefore multi-stage.
  • the desired data rate results from the total of the individual data rates of the CDMA codes. For FIG. 5 this means, for example, that depending on the optimization criterion, one of the nodes 1111011, 1111010 or 1111001 is assigned for the 64 Kbit / s and then a remaining free node is selected for 32 Kbit / s. Allocation of a CDMA codes for the higher data rate should be given before the allocation of a CDMA code for the lower data rate.
  • the mobile radio system shown in FIG. 6 as an example of a radio communication system consists of mobile switching centers MSC which are networked with one another or which provide access to a fixed network PSTN. Furthermore, these mobile switching centers MSC are each connected to at least one device RNC (radio network controller) for radio resource management. Each of these devices RNC in turn enables a connection to at least one base station BS. Such a base station BS can connect to other radio stations, e.g. Set up MS mobile stations or other mobile and stationary terminals.
  • 6 shows, by way of example, connections VI, V2, Vk for the transmission of useful information and signaling information between mobile stations MS and a base station BS.
  • An operation and maintenance center OMC implements control and maintenance functions for the mobile radio system or for parts thereof.
  • the base station BS contains a storage device SP for storing the tree structure, the occupied nodes and the CDMA codes, as well as a program for carrying out the allocation process and a processing device BE for selecting an unused node with a corresponding CDMA code and for assigning a channel with the CDMA code to a connection according to one of the previous strategies.

Landscapes

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

Abstract

Procédé d'attribution de canaux selon lequel des codes CDMA forment les canaux de liaison. Les codes CDMA sont représentés dans une structure arborescente par des suites de symboles et peuvent être dérivés les uns des autres. Selon diverses stratégies d'attribution, pour les noeuds encore disponibles, la position est déterminée dans la suite de symboles dans laquelle une différence se présente avec un noeud déjà occupé, à chaque fois à partir de la racine de la structure arborescente. Une somme des positions pour les noeuds occupés est déterminée et le canal ayant le code CDMA qui correspond au noeud ayant une somme prédéterminée - la somme la plus petite ou la plus grande - est attribué. Grâce à la présente invention, dans des systèmes de radiotéléphonie mobile W-CDMA, tant les liaisons à débit de données fixe que les liaisons à débit de données variables peuvent être gérées sans adaptation compliquée de la répartition de canaux.
EP99952268A 1998-08-06 1999-08-02 Procede et dispositif d'attribution de canaux dans un systeme de separation d'abonnes cdma Withdrawn EP1103109A1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE19835643 1998-08-06
DE19835643A DE19835643C2 (de) 1998-08-06 1998-08-06 Verfahren und Einrichtung zur Kanalzuteilung in einem Kommunikationssystem mit CDMA-Teilnehmerseparierung
PCT/DE1999/002410 WO2000008789A1 (fr) 1998-08-06 1999-08-02 Procede et dispositif d'attribution de canaux dans un systeme de separation d'abonnes cdma

Publications (1)

Publication Number Publication Date
EP1103109A1 true EP1103109A1 (fr) 2001-05-30

Family

ID=7876727

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99952268A Withdrawn EP1103109A1 (fr) 1998-08-06 1999-08-02 Procede et dispositif d'attribution de canaux dans un systeme de separation d'abonnes cdma

Country Status (5)

Country Link
EP (1) EP1103109A1 (fr)
JP (1) JP2002522951A (fr)
KR (1) KR20010072270A (fr)
DE (1) DE19835643C2 (fr)
WO (1) WO2000008789A1 (fr)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19909779A1 (de) * 1999-03-05 2000-09-14 Siemens Ag Verfahren zur Ressourcenzuteilung in einem Funk-Kommunikationssytem
DE10004873A1 (de) * 2000-02-04 2001-08-23 Infineon Technologies Ag Verfahren und Vorrichtung zur Erzeugung von OVSF-Codeworten
SE518904C2 (sv) * 2000-04-05 2002-12-03 Telia Ab Metod och anordning vid telekommunikationssystem
US7054294B2 (en) 2001-11-29 2006-05-30 Telefonaktiebolaget Lm Ericsson (Publ) Orthogonal variable spreading code (OVSF) allocation telecommunications network
EP1318626A1 (fr) * 2001-12-10 2003-06-11 Mitsubishi Electric Information Technology Centre Europe B.V. Procédé amélioré d'allocation de codes d'étalement
US7236512B2 (en) * 2002-09-09 2007-06-26 Qualcomm Incorporated Code channel allocations in a wireless communications system
DE10253713B3 (de) * 2002-11-18 2005-02-17 Siemens Ag Verfahren zur dynamischen Kanalvergabe
US20060120322A1 (en) * 2003-06-26 2006-06-08 Jan Lindskog Method and arrangement in a communication system
JP2006253951A (ja) * 2005-03-09 2006-09-21 Matsushita Electric Ind Co Ltd 基地局装置及び拡散符号割り当て方法
ES2432166T3 (es) * 2007-05-07 2013-12-02 Nokia Solutions And Networks Oy Canales de control en sistemas de red de comunicación

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
MY112371A (en) * 1993-07-20 2001-05-31 Qualcomm Inc System and method for orthogonal spread spectrum sequence generation in variable data rate systems

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
WO2000008789A1 (fr) 2000-02-17
KR20010072270A (ko) 2001-07-31
JP2002522951A (ja) 2002-07-23
DE19835643C2 (de) 2000-05-31
DE19835643A1 (de) 2000-02-10

Similar Documents

Publication Publication Date Title
EP0210698B1 (fr) Système de radio-transmission avec durée variable des intervalles temporaires d'une trame multiplex dans le temps
EP0210700B1 (fr) Système de radio-transmission numérique avec canal de service central associé à la communication dans la trame multiplexée dans le temps
EP0211460A2 (fr) Procédé de radio-transmission numérique
DE19835643C2 (de) Verfahren und Einrichtung zur Kanalzuteilung in einem Kommunikationssystem mit CDMA-Teilnehmerseparierung
DE19653122C2 (de) Verfahren zur Sprachübertragung über eine Funkschnittstelle in einem digitalen Funk-Kommunikationssystem mit Mobilstationen und Basisstationen
EP1032987B1 (fr) Procede d'affectation de ressources techniques radio et dispositif pour la gestion de ressources radio
DE19901755C2 (de) Frequenzbandvergabe an Funk-Kommunikationssysteme
WO2000033601A2 (fr) Procede et systeme de communication pour la transmission de donnees par l'intermediaire de canaux physiques utilises en commun
EP1090520B1 (fr) Procede et station de base pour transmettre des donnees d'organisation dans un systeme de radiocommunication
EP1391133A2 (fr) Procede d'affectation de canaux dans un systeme de radiocommunication
EP0612460B1 (fr) Procede pour transmission par radio en utilisant une station de base fixe et une pluralite des postes d'abonne independants fixes
EP1108342A1 (fr) Procede de transmission d'informations vocales dans un systeme de communication radio
WO2000021229A2 (fr) Procede d'adaptation du debit binaire
DE10063679B4 (de) Verfahren zur Datenübertragung in einem verschiedene Einheiten umfassenden Funkkommunikationssystem und dafür eingerichtetes Basisstationssystem und Funkkommunikationssystem
DE19959179A1 (de) Verfahren zur dynamischen Änderung von Ratenanpassungsfaktoren in einem Funk-Kommunikationssystem
DE19808948C2 (de) Verfahren, Funk-Kommunikationssystem und Mobilstation zur Informationsübertragung
DE10025286B4 (de) Verfahren zur Signalisierung in einem Funk-Kommunikationssystem und Basisstation in einem Funkkommunikationssystem
DE19922968B4 (de) Verfahren und Vorrichtung zur Datenratenanpassung
EP1159793A1 (fr) Procede de transmission a debit binaire variable dans un canal d'acces aleatoire d'un systeme de radiocommunication
DE10204622B4 (de) Verfahren zur Aufrechterhaltung einer Verbindung zwischen einer Basisstation und Teilnehmern eines Funkkommunikationssystems
WO1999012373A1 (fr) Procede de selection d'un canal sur un reseau de radiocommunication
EP1295503B1 (fr) Procede de signalisation d'informations dans un systeme de radiocommunication
EP1112667A1 (fr) Procede et systeme de radiocommunication pour mettre a disposition un canal d'organisation
WO2001028104A2 (fr) Procede pour la signalisation d'une affectation de codes d'etalement dans un systeme de communication radio
EP1090516A1 (fr) Procede de regulation de la grandeur d'une cellule radio, et station de base

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: 20010117

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

RBV Designated contracting states (corrected)

Designated state(s): DE FR GB IT

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: 20040302