EP0962102A2 - Attribution de canaux a l'interieur d'une bande radio - Google Patents

Attribution de canaux a l'interieur d'une bande radio

Info

Publication number
EP0962102A2
EP0962102A2 EP98904188A EP98904188A EP0962102A2 EP 0962102 A2 EP0962102 A2 EP 0962102A2 EP 98904188 A EP98904188 A EP 98904188A EP 98904188 A EP98904188 A EP 98904188A EP 0962102 A2 EP0962102 A2 EP 0962102A2
Authority
EP
European Patent Office
Prior art keywords
radio
timeslot
channel
channels
suitability
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
EP98904188A
Other languages
German (de)
English (en)
Inventor
Kalle Ahmavaara
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.)
Nokia Oyj
Original Assignee
Nokia Telecommunications Oy
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 Nokia Telecommunications Oy filed Critical Nokia Telecommunications Oy
Publication of EP0962102A2 publication Critical patent/EP0962102A2/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • 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]
    • 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
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/563—Allocation or scheduling criteria for wireless resources based on priority criteria of the wireless resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/26—Resource reservation

Definitions

  • the invention relates to radio systems and particularly to a method of optimizing channel allocation in a radio system.
  • the method at least one feature to be optimized upon allocating radio channels is selected, and possible radio channels are determined.
  • an available radio band is allocated to users as radio channels in accordance with the selected multiple access technique.
  • a radio channel is a frequency band employed for a radio connection or a portion separated therefrom by means of time or a user-specific code.
  • TDMA time division multiple access
  • CDMA code division multiple access
  • FDMA frequency division multiple access
  • time division multiple access In time division multiple access (TDMA), the selected frequency band is divided into timeslots of which each radio channel is allocated its dedicated timeslots.
  • time division multiple access the structure of the physical layer can be described by frames composed of available timeslots (one or more).
  • the radio resource in each timeslot can be further divided into parts by occupying the frequency band in the timeslot with one wide-band carrier or with two or more carriers having a narrower frequency band.
  • This case is illus- trated in Figure 1 , wherein Yn denotes the centre frequency and bandwidth of a carrier, and Xn a timeslot.
  • the timeslots of the TDMA frame of Figure 1 employ three carrier bandwidths, e.g. 2 MHz, 1 MHz and 500 kHz.
  • Four different carrier bandwidth combinations i.e. 1 x 2 MHz, 2 x 1 MHz, 4 x 500 kHz or 1 x 1 MHz + 2 x 500 kHz, can be employed inside the 2-MHz frequency band of one timeslot.
  • Each separate carrier Yn within one timeslot can be considered as a separate radio channel.
  • the use of one carrier within one timeslot at least partially rules out the possibility of simultaneously using other channels within the same timeslot.
  • the allocation of one 2-MHz radio channel (e.g. carrier Y1 in Fig. 1) to one timeslot (e.g. X1 in Fig. 1) rules out all other radio channels from that particular timeslot.
  • the allocation of one 500-kHz radio channel (e.g. Y6 in Fig. 1) to one timeslot (e.g. X4 in Fig. 1) prevents the simultaneous allocation of a 2-MHz channel to the same timeslot, whereas an 1-MHz radio channel (e.g. Y2 in Fig. 1) can be allocated thereto.
  • the formed radio channels are in part mutually exclusive.
  • a timeslot can also be divided into separate mutually exclusive radio channels by dividing it further into subtimeslots.
  • This kind of frame structure is illustrated in Figure 2.
  • Each subtimeslot Yn contained in the timeslot Xn can be considered to be a separate radio channel.
  • the duration of the timeslot Xn is for example 4T and three different subtimeslot types, T, 2T, and 4T, are available.
  • Radio channels are mutually exclusive in the same way as in the previous example, i.e. the allocation of one 4T radio channel (e.g. Y1 in Fig. 2) to a timeslot (e.g. X1 in Fig. 2) rules out all other radio channels from that particular timeslot.
  • the allocation of one T radio channel e.g.
  • Y6 in Fig. 2 to a timeslot (e.g. X4) prevents the simultaneous allocation of a 4T radio channel to the same timeslot, whereas the allocation of a 2T radio channel (e.g. Y2 in Fi. 2) is possible.
  • CDMA is a multiple access scheme based on spread spectrum communication. Unlike FDMA or TDMA, in CDMA a large number of CDMA sig- nals (users) simultaneously share a wide radio frequency band, e.g. 1.25 MHz. So called spreading codes are used to distinguish between different CDMA signals, i.e radio channels on said wide radio frequency band. A separate spreading code is used over each connection between a base station and a subscriber terminal. In other words, the narrow-band user signal is conventionally multiplied by the dedicated spreading code and thereby spread in bandwidth.
  • the signals of the users can be distinguished from one another in the receivers on the basis of the unique spreading code of each connection, by using a correlator which accepts only a signal energy from the selected spreading code and despreads its spectrum into a narrow-band signal.
  • the other users' signals, whose spread- ing codes do not match, are not despread in bandwidth and as a result, contribute only to the noise and represent a self-interference generated by the system.
  • the spreading codes of the system are preferably selected in such a way that the codes used in each system cell are mutually orthogonal, i.e. they do not correlate with each other.
  • CDMA code division multiple access
  • the total radio resource available can be allocated to separate mutually exclusive radio channels by using spreading codes of different lengths.
  • An example of a spreading code tree is shown in Fig. 10. Let us assume that a radio channel A (called 4T channel herein) having a spreading code length of 65 bits (chips) per one information symbol will use the whole radio capacity available in the selected radio frequency band, e.g. 2 MHz.
  • a radio channel (called 2T channel herein) having a spreading code length of 128 chips per symbol will use one half of the whole radio capacity available
  • a radio channel (called T channel herein) having a spreading code length of 256 chips per symbol will use a quarter of the whole radio capacity available, etc.
  • the code tree is configured in such a manner that codes in the same branch of the tree are non-orthogonal and the codes in the differ- ent branches of the tree are orthogonal. Allocation of a channel rules out the possibility to allocate other channels in the same branch of the code tree. Referring to Fig. 10, the allocation of channel A will rule out any other radio channels from that particular frequency band. If B is allocated, it rules out the allocation of channels A, D and E in the same branch but allows the allocation of channel C or channels F and G in the other branch.
  • radio channels can also be provided by allocating to a TDMA timeslot spreading codes for providing a separate radio channel code-specifically. This approach is illustrated in Figure 3.
  • the different spreading codes may be explicitly mutually exclusive, in accordance with the above examples, or they may affect the quality of radio channels formed by means of other spreading codes in the same timeslot.
  • a timeslot can be divided into subtimeslots, for example, one of which can be divided into several carriers, one of which can be further divided into several radio resources by spreading codes.
  • the invention is based on the idea that available radio channels and their mutual exclusiveness are determined system-specifically. This is used as a basis for selecting a strategy for placing the channels rationally into the available radio resources as far as the utilization of the radio resource is concerned.
  • the strategy is used to determine a suitability index (S index), which is a general parameter representing the suitability of * a radio channel for procedures associated with channel allocation. It is essential that the value of the S index can be determined unambiguously on the basis of the features to be optimized for each desired radio channel or any radio resource structure, such as a timeslot or part thereof, containing the radio channel which is or is to be selected as the target for the allocation procedure.
  • the S indices are stored preferably in a separate index memory.
  • the index of the radio channel or the radio resource structure comprising the radio channel being the selected target for the procedure is updated in asso- ciation with each procedure related to channel allocation.
  • the index of the radio channel or the radio resource structure comprising said radio channels which, regarding the feature to be optimized and allowed for in the indexing, depend on the S index of the radio channel or the radio resource structure comprising the radio channel which is the target of the procedure.
  • the index associated with the radio channel or the radio resource structure comprising it continuously depicts the allocation situation in the radio band and offers thus a handy tool in making decisions concerning procedures associated with allocation.
  • the method of the invention is suitable for utilization in allocation procedures relating to different frame structures and different radio channel types.
  • the solution can be used when reserving new channels or when increasing transmission capacity on an existing channel.
  • the method is also usable in releasing existing reservations, e.g. when the transmission capacity of a channel has to be decreased because traffic has exceeded the congestion value.
  • the innovative solution is also usable when reallocating frame addresses when reserved frame addresses fill a frame unfavourably.
  • the concept allocation procedure is used to refer to all procedures associated with frame address allocation, including the above examples. More generally, the concept of allocation procedure is used to refer to any channel allocation changing the reservation state of the radio resources in a radio system.
  • Figure 1 illustrates a TDMA frame wherein timeslots are divided into separate radio channels by means of frequency bands of different widths (prior art)
  • Figure 2 illustrates a TDMA frame wherein timeslots are divided into separate radio channels by means of subtimeslots of different lengths (prior art)
  • Figure 3 illustrates a TDMA frame wherein timeslots are divided into separate radio channels by means of separate spreading codes (prior art)
  • FIG. 4 shows the frame structure employed in the description of the primary embodiment of the invention
  • Figure 5 illustrates frequency band units to be placed into one timeslot and used in the description of the first embodiment of the invention
  • Figure 6 shows communication situations that are different as far as indexing is concerned and are presented in the description of the first embodiment of the invention
  • Table 1 in Figure 7 shows an update table including a first updating rule for the S index and employed in the first embodiment of the invention
  • Table 2 in Figure 8 shows an update table including a second updating rule for the S index and employed in the first embodiment of the invention
  • Figure 9 is a flow diagram illustrating the inventive method
  • FIG 10 illustrates CDMA radio channels provided by spreading codes of different lengths (prior art).
  • the present invention can be applied to a channel allocation radio communication systems utilizing various multiple access methods, such as TDMA or CDMA.
  • multiple access methods such as TDMA or CDMA.
  • the physical concept of radio channel varies, being primarily defined by a time slot in TDMA systems, a spreading code in CDMA systems, a carrier in FDMA systems, a combination thereof, etc.
  • the basic concept of the present invention is, however, independent of the type of radio channel and multiple access method used.
  • radio channels are composed of separate carriers comprised by one timeslot.
  • An allocatable radio frame is a TDMA frame comprising five timeslots and four frequency band units.
  • the inventive solutions could employ any other frame and timeslot structure, e.g. the alter- natives illustrated in Figures 2 and 3.
  • Figure 4 shows the frame structure employed in the example.
  • the frame comprises an available radio system frequency band TF which is divided into four frequency band slots F1 to F4.
  • a carrier is divided into five timeslots TD1 to TD5.
  • Figure 4 shows a frame address (TD2,F3) via which information associated in the example with a radio channel CH1 is transferred in the uplink and/or downlink direction in successive frames.
  • Figure 4 also shows a higher speed radio channel CH2 with a double carrier bandwidth compared with the channel CH1.
  • one timeslot can include the following channels: four 1 FU channels (e.g. 4 x 200 kHz) two 1 FU channels and one 2 FU channel (e.g. 2 x 200 kHz, 1 x 400 kHz), two 2 FU channels (e.g. 2 x 400 kHz) one 4 FU channel (e.g. 1 x 800 kHz), which have also been illustrated in Figure 5.
  • optimization is carried out by timeslots, i.e. the channel allocations of each timeslot can be determined independently. Owing to the selected frame structure and the channel sizes in the example, indexing has to be carried out only for the timeslot halves.
  • Figure 6 determines all channel reservation situations for one timeslot that differ from one another in the example as far as indexing is concerned. As far as indexing is concerned, the placement of an 1 FU channel in a 2 FU empty channel is the same irrespective of into which 2 FU channel half the 1 FU channel is placed.
  • the hatched bands denote reserved channels and the unhatched bands denote free channels.
  • timeslot a comprises one reserved 2 FU channel, one reserved 1 FU channel and one free 1 FU channel.
  • Timeslot b comprises three reserved 1 FU channels and one free 1 FU channel.
  • Timeslot c comprises two reserved 1 FU channels and two free 1 FU channels.
  • Timeslot d comprises one reserved 2 FU channel and one free 2 FU channel.
  • Timeslot e comprises two reserved 1 FU channels and one free 2 FU channel.
  • Timeslot f comprises one reserved 1 FU channel, one free 1 FU channel and one free 2 FU channel.
  • the entire timeslot g is free.
  • Timeslot h comprises four reserved 1 FU channels.
  • Timeslot i comprises one reserved 2 FU channel, and two reserved 1 FU channels.
  • Timeslot j comprises two reserved 2 FU channels.
  • Timeslot k comprises one reserved 4 FU channel.
  • the indices in the example are determined directly on the basis of the reservation status of the channels in the timeslot disregarding other factors.
  • the selected indices are marked in
  • the reservation is carried out by searching the index memory for an S index with the smallest value inside the range associated with each size of the channel to be reserved.
  • the smallest S index associated with an 1 FU channel is 0 (one free 1 FU channel) and the maximum is 7 (the entire timeslot is free).
  • the system finds the index 0, it places the new channel into that particular timeslot and consequently the indices of the timeslot are updated to correspond to the new situation.
  • the timeslot comprises one reserved 2 FU channel and two reserved 1 FU channels. This corresponds to timeslot i in Figure 6, i.e. when an 1 FU channel is reserved, the in- dexing of the timeslot changes and no longer corresponds to timeslot a (0/12) but instead to timeslot i (11/14).
  • the smallest possible S index value is 4 (one 2 FU free channel) and the maximum is again 7.
  • the system searches the index memory for the smallest possible S index which is more than or equal to 4 but less than or equal to 7. If for example the smallest S index found by the system within the range is 6 (corresponding to timeslot f in Figure 6), the new channel is placed into that particular timeslot and the indices of the timeslot are again updated to correspond to the new situation.
  • the timeslot com- prises one reserved 2 FU channel, one reserved 1 FU channel and one free 1 FU channel. This corresponds to timeslot a in Figure 6, i.e. when a 2 FU channel is allocated, the indexing of the timeslot changes and no longer corresponds to timeslot f (3/3) but instead to timeslot a (0/12).
  • the S index update rules can be advantageously presented in the form of a table.
  • update rule tables are illustrated for a timeslot which has been divided into two halves, each with dedicated S indices, such as e.g. in Figure 6.
  • Table 1 in Figure 7 illustrates the table employed in the up- date of the S index of the timeslot half subjected to an allocation procedure in the example.
  • the rows of the table illustrate three possible allocation procedures, in which
  • the columns of Table 1 show the present value of the S index before allocation (the topmost value in the column) and the new value after each different type of allocation procedure (1 FU, 2 FU, 4 FU).
  • the reservation of an 1 FU channel (row 0) consequently changes the value of the S index of the timeslot half from the present value 0 (column 0) to the value 11 (arrow A).
  • the reservation of a 2 FU channel (row 1) to a timeslot half with a present S index of 6 (column 6) gives a new S index value 12 (arrow B), etc.
  • a new S index can be determined unambiguously for the timeslot when the present S index and the type of allocation procedure (1 FU, 2 FU, 4 FU) are known.
  • the S indices of the magnitude to be optimized i.e. in this case the part (e.g. the second half) sharing the same timeslot with the target channel of the allocation procedure, depend on the S index of said channel, and a corre- sponding table can be drawn up for their update rules.
  • Table 2 in Figure 8 shows the rules for updating the S index of the second half of the same time- slot in the example when the index of the first half is modified as a result of an allocation procedure (e.g. in accordance with Table 1 ).
  • the reservation of an 1 FU channel (row 0) to the part sharing the same timeslot (arrow A in Table 1) changes the S index of the adjacent half of the same timeslot from the present value 12 (column 12) to the value 14 (arrow C).
  • the reservation of a 2 FU channel (row 1) to the first part of the timeslot (arrow B in Table 1) changes the S index of the part sharing the same timeslot from the present value 3 (column 3) to the value 0 (arrow D).
  • the new S index of the second timeslot half can be determined unambiguously when the present S index and the type of allocation procedure the first half is subjected to are known.
  • the index memory is then searched for the smallest possible S index value within the range (point 30). Should no suitable index value for the range be found (point 40), no allocation is carried out. If the index is found, the reservation is made (point 50) and the indices in both timeslot halves are updated (point 60).
  • the method of the invention provides a means for selecting a frame address for actual channel allocation carried out separately as a dedicated function.
  • the channel allocation and the determination and storage of S indices according to the invention can be carried out in any network element. Most advantageously said network element is the one responsible for call control. In modem mobile networks such an element is typically an exchange, a base station controller or a separate controller, but in future networks these func- tions may be decentralized.
  • the determination of the S indices was based only on the reservation status of the radio channels in a timeslot.
  • S indexing can be specified so as to allow for other factors, such as e.g. the allocation status in adjacent timeslots or in the entire frame, com- munication circumstances in the channels to be allocated etc.
  • the S index Even a continuous variable value, calculated on the basis of all included factors, can be used as the S index.
  • the value of the variable can e.g. be changed discretely in association with allocation procedures and continuously on the basis of measurements concerning transmission.
  • the system is able to select the channel with superior conditions by means of the S index.
  • the S indices had to be determined for timeslot halves only.
  • an S index can be determined similarly for other timeslot parts, too, depending on the structure of the physical layer and the required accuracy of allocation optimization. It is essential in S index determination that the value of an S index can be determined unambiguously in association with each change concerning allocation.
  • the S index may also be employed as a support for decision- making when channels are being deallocated, e.g. when the data transmission capacity allocated to a subscriber is being decreased because of increased traffic or when a subscriber him/herself indicates a change in data transmission need.
  • the system e.g. goes through the frame addresses associated with the subscriber connection, searches the index memory for the S indices associated with each frame address and the S indices of frame ad- dresses that e.g. share the same frame layer and depend on said S indices.
  • the system determines new indices, possibly following an update, for each alternative and selects from the retrieved alternatives the most suitable.
  • the principle for selecting the channels to be deallocated on the basis of the S index is selected application-specifically.
  • the table serves to search for the indices of the timeslots in which 1 FU allocations have been carried out and corresponding indices for the other timeslot half.
  • the system determines new indices following the deallocation, compares the ob- tained index combinations and deallocates the 1 FU timeslot half selected on the basis of the comparison. After the deallocation, the value of the S index in the timeslot subjected to the allocation procedure is updated.
  • channels can be reallocated by means of the S index. This can be accomplished by e.g. first selecting by means of the S index a new place for the transferable channel in the manner described in the above reservation example, and by transferring the channel to a new place and then updating the S indices as usual.
  • the principle for reallocating the channels by means of the S index is selected application- specifically.
  • the above described allocation schemes based on the suitability index S are also directly applicable to other types of radio channels, such as CDMA.
  • the S index updating rules described above with refer- ence to Figs. 4 to 9 can be used as such, when 1 FU, 2FU and 4FU channels are replaced by the 1T, 2T and 4T CDMA channels of Fig. 10.
  • the allocation of 1T, 2T and 4T CDMA channels may be analogous to the allocation of 1 FU, 2FU and 4FU channels within a single time slot in the above described TDMA embodiments.
  • the drawings and the related description are only intended to illustrate the inventive idea. The details of the solution of the invention may vary within the scope of the claims.

Landscapes

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

Abstract

L'invention porte sur un système de radiotélécommunications et un procédé d'optimisation d'attribution des canaux dans ledit système utilisant un procédé sélectionné d'accès multiple, tel que le AMRT ou le AMCR, au niveau de l'interface radio. Un indice d'admissibilité se basant au moins sur l'une des caractéristiques à optimiser est déterminé pour chacun des canaux radio disponibles (Yn), ledit indice représentant l'admissibilité du canal radio pour les procédures d'attribution. Cet indice sert à sélectionner le canal radio (Yn) le plus approprié pour la procédure d'attribution en cours. L'indice du canal radio (Yn) sélectionné est actualisé par la suite.
EP98904188A 1997-02-24 1998-02-17 Attribution de canaux a l'interieur d'une bande radio Withdrawn EP0962102A2 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
FI970772A FI970772A (fi) 1997-02-24 1997-02-24 Kanava-allokointi radiokaistalla
FI970772 1997-02-24
PCT/FI1998/000143 WO1998037703A2 (fr) 1997-02-24 1998-02-17 Attribution de canaux a l'interieur d'une bande radio

Publications (1)

Publication Number Publication Date
EP0962102A2 true EP0962102A2 (fr) 1999-12-08

Family

ID=8548267

Family Applications (1)

Application Number Title Priority Date Filing Date
EP98904188A Withdrawn EP0962102A2 (fr) 1997-02-24 1998-02-17 Attribution de canaux a l'interieur d'une bande radio

Country Status (4)

Country Link
EP (1) EP0962102A2 (fr)
AU (1) AU6216298A (fr)
FI (1) FI970772A (fr)
WO (1) WO1998037703A2 (fr)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6862622B2 (en) 1998-07-10 2005-03-01 Van Drebbel Mariner Llc Transmission control protocol/internet protocol (TCP/IP) packet-centric wireless point to multi-point (PTMP) transmission system architecture
US6452915B1 (en) 1998-07-10 2002-09-17 Malibu Networks, Inc. IP-flow classification in a wireless point to multi-point (PTMP) transmission system
US6526091B1 (en) 1998-08-17 2003-02-25 Telefonaktiebolaget Lm Ericsson Communication methods and apparatus based on orthogonal hadamard-based sequences having selected correlation properties
US6163524A (en) * 1998-10-19 2000-12-19 Telefonaktiebolaget Lm Ericsson (Publ) Code allocation in CDMA
EP1796305B1 (fr) 1999-07-09 2016-02-17 Intellectual Ventures I LLC Architecture du système de transmission sans fil orientée paquet TCP/IP
WO2012109369A2 (fr) * 2011-02-08 2012-08-16 Marvell World Trade Ltd. Attribution de canal wlan
KR101509629B1 (ko) 2011-03-14 2015-04-08 마벨 월드 트레이드 리미티드 지원형 위치 기반 무선스펙트럼 할당

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2584884B1 (fr) * 1985-07-09 1987-10-09 Trt Telecom Radio Electr Procede et dispositif de recherche de canal libre pour un systeme de radio mobile
DE3527331A1 (de) * 1985-07-31 1987-02-05 Philips Patentverwaltung Digitales funkuebertragungssystem
US5278833A (en) * 1991-03-28 1994-01-11 Motorola, Inc. Method for providing reserved communication access using multiple random access resources
EP0740485A3 (fr) * 1991-05-29 1997-02-26 Nec Corp Méthode d'allocation de canal dans un réseau de communication mobile
SE500830C2 (sv) * 1993-05-17 1994-09-12 Ericsson Telefon Ab L M Förfarande och anordning vid kanalutnyttjandet i ett radiokommunikationssystem
JP2636712B2 (ja) * 1993-12-08 1997-07-30 日本電気株式会社 移動通信装置
CN1092454C (zh) * 1994-02-04 2002-10-09 Ntt移动通信网株式会社 一种移动通信系统及其中的无线电信道分配方法
JP3215018B2 (ja) * 1994-09-09 2001-10-02 三菱電機株式会社 移動通信システム
US5592470A (en) * 1994-12-21 1997-01-07 At&T Broadband wireless system and network architecture providing broadband/narrowband service with optimal static and dynamic bandwidth/channel allocation

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
FI970772A (fi) 1998-08-25
WO1998037703A3 (fr) 1998-11-12
FI970772A0 (fi) 1997-02-24
AU6216298A (en) 1998-09-09
WO1998037703A2 (fr) 1998-08-27

Similar Documents

Publication Publication Date Title
US6414947B1 (en) Communication network and method of allocating resource therefor
US6693952B1 (en) Dynamic code allocation for downlink shared channels
JP4296713B2 (ja) Ｃｄｍａにおける符号割り当て
US6011800A (en) Hierarchical resource management method, system, base station, head-end unit and subscriber unit for variable resource size communication systems
US6157627A (en) Channel allocation for mixed multislot services
EP1021925B1 (fr) Affectation hybride de canaux avec sauts et allocation de canaux selon la classe de service (temps réel / non temps réel) dans une station de base 3g.
EP1206055A2 (fr) Méthode et appareil d'allocation d'intervalles temporels dans un système de communication mobile
CA2390718C (fr) Procede, appareil et logiciel destines a une attribution de code pour des debits de donnees variables dans un systeme amrc
KR930022756A (ko) 이동 통신 시스템에서 다이내믹 채널 할당의 분할 방법
JP3527674B2 (ja) 無線通信システムにおいて用いる様々な異なる長さのチャネル符号を動的に割当てるための方法
US7505771B2 (en) Method for assigning orthogonal variable spreading factor code in a wireless cellular telecommunication system
EP1642409B1 (fr) Procede et dispositif d'un systeme de communication
CN100490570C (zh) 无线信道分配方法
KR100293998B1 (ko) 코드분할다중접속시스템의기지국섹터와주파수할당간의채널공유방법
WO1998037703A2 (fr) Attribution de canaux a l'interieur d'une bande radio
US20050180379A1 (en) Dynamic sequencing of timeslots in wireless communication systems
KR20060061398A (ko) 호출 수락 제어에서의 코드 트리 단편화
JP4198907B2 (ja) 移動通信無線網における同期逆方向リンクのチャネルコード割当て方法
KR100418014B1 (ko) 월시 코드의 할당 방법 및 할당 장치
US20070147309A1 (en) Method and system for allocation of channelisation codes in a code division multiple access system
CN101212788A (zh) N频点小区系统的频点选择装置
KR100876809B1 (ko) 음성 및 데이터 서비스를 제공하는 이동 통신시스템의자원 관리 방법 및 장치
KO et al. DYNAMIC CHANNEL ASSIGNMENT FOR CHANNELIZED WIRELESS NETWORKS

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

AK Designated contracting states

Kind code of ref document: A2

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

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

Owner name: NOKIA NETWORKS OY

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

Owner name: NOKIA CORPORATION

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