EP1602244A4 - Procede permettant de mettre en oeuvre des procedures de gestion de ressources radio par attribution dynamique et rapide de voie - Google Patents

Procede permettant de mettre en oeuvre des procedures de gestion de ressources radio par attribution dynamique et rapide de voie

Info

Publication number
EP1602244A4
EP1602244A4 EP04715103A EP04715103A EP1602244A4 EP 1602244 A4 EP1602244 A4 EP 1602244A4 EP 04715103 A EP04715103 A EP 04715103A EP 04715103 A EP04715103 A EP 04715103A EP 1602244 A4 EP1602244 A4 EP 1602244A4
Authority
EP
European Patent Office
Prior art keywords
code
information
timeslot
wtru
measurements
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
EP04715103A
Other languages
German (de)
English (en)
Other versions
EP1602244A2 (fr
Inventor
Xiaochun Xu Fisher
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.)
InterDigital Technology Corp
Original Assignee
InterDigital Technology Corp
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
Priority claimed from US10/744,800 external-priority patent/US7107060B2/en
Priority claimed from US10/747,297 external-priority patent/US7130637B2/en
Priority claimed from US10/747,733 external-priority patent/US7212826B2/en
Priority claimed from US10/750,135 external-priority patent/US7110771B2/en
Priority claimed from US10/750,129 external-priority patent/US7136656B2/en
Application filed by InterDigital Technology Corp filed Critical InterDigital Technology Corp
Publication of EP1602244A2 publication Critical patent/EP1602244A2/fr
Publication of EP1602244A4 publication Critical patent/EP1602244A4/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/10—Monitoring; Testing of transmitters
    • 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/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14—Spectrum sharing arrangements between different networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0466—Wireless resource allocation based on the type of the allocated resource the resource being a scrambling code
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/04—Scheduled or contention-free access

Definitions

  • the present invention relates generally to radio resource management in wireless communication systems, and more particularly to implementations of fast dynamic channel allocation (F-DGA) radio resource management (RRM) procedures.
  • F-DGA fast dynamic channel allocation
  • RRM radio resource management
  • RRM is generally responsible for utilizing the air interface resources.
  • RRM is used to guarantee quality of service (QoS), to provide efficient use of the radio resources, and to increase system capacity.
  • RRM consists of admission control, handover, power control, and congestion control functionalities.
  • Admission control can be divided into user admission control and call admission control (CAC).
  • User admission control accepts or rejects the radio resource control (RRC) connection requested by a wireless transmit/receive unit (WTRU).
  • WTRU wireless transmit/receive unit
  • Call admission control accepts or rejects a request to establish or modify a radio access bearer (RAB) in the radio access network (RAN).
  • RAB radio access bearer
  • RAN radio access network
  • Call admission control is located in the controlling radio network controller (C-RNC).
  • the S-DCA allocates the radio resources to cells while the F-DCA allocates the radio resources to bearer service.
  • the F- DCA call admission control functions are responsible for efficiently allocating or changing the allocations of physical resources. When a request for physical resources is received, the call admission control will accept or reject the request based on the availability of physical resources and interference level in the cell. The request can be accepted only if both uplink and downlink call admission control admit it. Otherwise, the request is rejected. [0007] In order to guarantee the QoS and minimize the interference, a certain F-DCA call admission control algorithm is currently implemented.
  • the F-DCA background interference reduction procedure is used to keep WTRU and system resource usage at a reasonable level at all times by reassigning radio resources (timeslots and codes) to an existing radio bearer.
  • the F-DCA background interference reduction procedure is triggered by RRM periodically.
  • the period to trigger the background interference reduction procedure is a design parameter; in a preferred embodiment of the present invention, the period is two seconds. It has relatively low priority among the three F-DCA algorithms.
  • the F-DCA escape mechanism is used to solve a link problem of a user. It is used as an escape mechanism for a specific user (or part of user services) or a base station that experiences high interference or that cannot satisfy QoS by reassigning the radio resources to an existing radio bearer.
  • the F-DCA escape mechanism runs in a cell for all WTRUs in steady state with real time (RT) services. It does not apply to non-real time (NRT) services.
  • RT real time
  • NRT non-real time
  • Handover is used to switch a radio link from one cell to another without interruption of the call in order to maintain the required QoS.
  • the radio link addition procedure is used to establish physical resources for a new radio link in a Node B for which a WTRU already has a communication context when a handover is taking place.
  • the radio link setup procedure is used to establish the necessary radio resources for a new radio link related to real time (RT) or non-real time (NRT) services.
  • RT real time
  • NRT non-real time
  • the radio link reconfiguration procedure is used to add, modify, or delete any physical resources for this existing radio link.
  • the F-DCA CAC algorithm is invoked upon receiving the request messages.
  • the present invention improves and optimizes the known F-DCA algorithm implementations by modularizing/categorizing the functionality of the F-DCA algorithms and making the inputs to the core channel allocation function of these algorithms independent of signal messages. More specifically, certain functions in the previous implementation of the F-DCA CAC algorithm that are signal-dependent are altered to become signal- independent by the present invention, such that the altered functions are reusable in the implementation of the escape mechanism.
  • the invention is described in the context of layer 3 in TDD scenario, but is applicable without limitation to other modes of transmission as well.
  • the present invention provides an optimization to the implementations of the F-DCA algorithms in RRM.
  • the inventive method modularizes and modifies the implementation of F-DCA algorithms into three processes: pre-code allocation, code allocation, and post-code allocation.
  • the functions in both the pre-code allocation process and the post-code allocation process are signal-dependent, while the functions in code allocation process are signal-independent.
  • the pre-code allocation process is used to describe how and where to retrieve the information from the input message and databases, and how to prepare the required inputs for the code allocation process.
  • the post-code allocation process is used to determine what information should be stored in the databases, and what information should be provided to the output message.
  • the modularized functions of the present invention can be reused by other RRM algorithms in both RT service and NRT service.
  • the present invention provides an implementation ofthe F-DCA CAC algorithm for radio link setup procedure in RRM.
  • a method of optimizing a F- DCA CAC algorithm in a wireless communication system includes a pre-code allocation process, a signal-independent code allocation process, and a postcode allocation process.
  • the pre-code allocation process includes receiving and processing a request message and obtaining system measurements and information from a centralized database.
  • the code allocation process begins by checking the availability of codes in the cell and generating timeslot sequences for the available timeslots.
  • a code set is assigned to the available timeslots in a timeslot sequence, wherein a successful assignment is a solution.
  • the interference signal code power (ISCP) is calculated for each solution and the solution having the lowest weighted ISCP is selected as an optimal solution.
  • the post-code allocation process includes storing allocation information in a centralized database and creating a response message.
  • a method for a F-DCA CAC in a wireless communication system begins by receiving and processing a request message to initiate the CAC function. Node B measurements, a list of available timeslots, and a list of code sets are retrieved from a centralized database. A set of codes is allocated to the available timeslots and the allocation information is stored in the centralized database. A response message is sent with the results of the code allocation process.
  • the present invention provides a method for implementing the F-DCA escape mechanism in RRM, which increases system efficiency by functioning as follows.
  • the F-DCA escape mechanism is triggered by RRM for a specific uplink or downlink coded composite transport channel (CCTrCH) of a WTRU when one ofthe following three conditions is met:
  • CCTrCH downlink coded composite transport channel
  • the uplink (UL) timeslot ISCP measured by a Node B is greater than a threshold.
  • These two thresholds are design parameters, and can be the same value or can be different values.
  • a method of implementing a F-DCA escape procedure in a wireless communication system includes a pre-code allocation procedure, a signal- independent code allocation procedure, and a post-code allocation procedure.
  • the pre-code allocation procedure receives a trigger signal, obtains WTRU measurements and Node B measurements from an RRC shared cell database, obtains cell configuration information and WTRU information from a centralized database, determines the candidate CCTrCH to be reassigned, and determines the candidate code set to be reassigned.
  • the code allocation procedure checks the code availability in the cell, checks the transmitted power of the candidate timeslot, checks if the ISCP of other timeslots is lower than that of the candidate timeslot, generates timeslot sequences for the available timeslots, assigns the candidate code set to the available timeslots in a timeslot sequence, wherein a successful assignment is a solution; calculates an ISCP for each solution; and selects the solution having the lowest weighted ISCP as an optimal solution.
  • the post-code allocation procedure stores the reallocation information in the centralized database and creates a physical channel reconfiguration request message.
  • the present invention provides a method for implementing the F-DCA background interference reduction procedure in RRM.
  • a method of implementing a F-DCA background interference reduction procedure in a wireless communication system includes a pre-code allocation procedure, a signal-independent code allocation procedure, and a post-code allocation procedure.
  • the pre-code allocation procedure receives a background timer trigger signal; obtains both WTRU and Node B measurements from an RRC shared cell database; obtains both cell and WTRU information from a centralized database; determines the candidate timeslots (one for the uplink direction and one for the downlink direction) to be reassigned; retrieves a list of the available timeslots to be used for reassignment from a centralized database; and determines the candidate code sets to be reassigned.
  • the code allocation procedure checks the availability of a code set in the cell; checks the transmission power of a candidate timeslot; generates timeslot sequences for the available timeslots; assigns a code set to the available timeslots in a timeslot sequence, wherein a successful assignment is a solution; calculates an ISCP for each solution; and selects the solution having the lowest weighted ISCP as an optimal solution.
  • the post-code allocation procedure stores the reallocation information in the centralized database and creates a physical channel reconfiguration request message.
  • a method of implementing a F-DCA background interference reduction procedure in a wireless communication system includes a pre-code allocation process, a signal-independent code allocation process, and a postcode allocation process.
  • the pre-code allocation process begins by receiving a timer trigger signal. System measurements are retrieved from a centralized database. The physical resources to be reassigned are determined based on a figure of merit.
  • the code allocation process begins by checking the availability of a code set in the cell and generating timeslot sequences for the available timeslots. A code set is allocated to the available timeslots in a timeslot sequence, wherein a successful assignment is a solution.
  • the ISCP is calculated for each solution and the solution having the lowest weighted ISCP is selected as an optimal solution.
  • the reallocation information is stored in the centralized database. A physical channel reconfiguration request message is sent, containing the allocation information.
  • the present invention provides an implementation of the F-DCA CAC algorithm for radio link addition procedure in RRM.
  • a method of implementing F-DCA CAC algorithm for radio link addition in a wireless communication system includes a pre-code allocation process, a signal- independent code allocation process, and a post-code allocation process.
  • the pre-code allocation process includes receiving and processing a radio link addition request message, and retrieving system information from a centralized database.
  • the code allocation process includes checking the availability of a code set in the cell; generating timeslot sequences; assigning a code set to the available timeslots in a timeslot sequence, wherein a successful assignment is a solution; calculating ISCP for each solution; and selecting the solution having the lowest weighted ISCP as an optimal solution.
  • the postcode allocation process includes storing allocation information in the centralized database and creating a radio link addition response message.
  • a method of implementing F-DCA CAC algorithm for radio link addition in a wireless communication system begins by receiving a radio link addition request message to initiate the CAC function. The request message is processed and a list of available timeslots and a list of code sets are retrieved from a centralized database. The code sets are allocated to the available timeslots in the new cell, and the allocation information is stored in the centralized database. A radio link addition response message is then sent with the results ofthe code allocation process.
  • the present invention provides an implementation ofthe F-DCA CAC algorithm for radio link reconfiguration procedure in RRM.
  • a method of implementing F-DCA CAC for radio link reconfiguration in a wireless communication system includes a pre-code allocation process, a signal- independent code allocation process, and a post-code allocation process.
  • the pre-code allocation process includes receiving and processing a request message, and retrieving system information from a centralized database.
  • the code allocation process includes checking the availability of a code set in the cell; generating timeslot sequences; assigning a code set to the available timeslots in a timeslot sequence, wherein a successful assignment is a solution; calculating the ISCP for each solution; and selecting the solution having the lowest weighted ISCP as an optimal solution.
  • the post-code allocation process includes storing allocation information in a centralized database and creating a response message.
  • a method for F-DCA CAC for radio link reconfiguration in a wireless communication system begins by receiving a request message to initiate the CAC function.
  • the request message is processed and a list of available timeslots and a list of code sets is retrieved from a centralized database.
  • the code sets are allocated to the available timeslots and the allocation information is stored in the centralized database.
  • a response message with the results of the code allocation process is then sent.
  • Figure 1 is an overview of the F-DCA CAC algorithm for radio link setup
  • FIGS 2a-2c are flowcharts of the F-DCA CAC algorithm for radio link setup shown in Figure 1;
  • Figures 3a and 3b are flowcharts for the channel allocation function for the F-DCA CAC algorithm shown in Figure 2;
  • Figure 4 is an overview of a F-DCA escape procedure in accordance with the present invention.
  • Figures 5a and 5b show a flowchart of the F-DCA escape procedure shown in Figure 4;
  • Figure 6 shows the first part a flowchart for the channel allocation function for the F-DCA escape procedure shown in Figures 5a and 5b;
  • Figure 7 is an overview of a F-DCA background interference reduction procedure in accordance with the present invention.
  • Figures 8a and 8b show flowcharts of the F-DCA background interference reduction procedure shown in Figure 7;
  • Figure 9 is an overview of a F-DCA CAC procedure for radio link addition in accordance with the present invention.
  • FIGS lOa-lOc are flowcharts of the F-DCA CAC procedure shown in
  • Figure 11 is an overview of a F-DCA CAC procedure for radio link reconfiguration in accordance with the present invention.
  • Figure 12 is a flowchart of the F-DCA CAC procedure for radio link reconfiguration shown in Figure 11;
  • Figures 13a- 13c are flowcharts of a physical channel allocation procedure of the F-DCA CAC procedure for radio link reconfiguration shown in Figure 12.
  • FIG. 1 An overview 100 of the F-DCA CAC algorithm for radio link setup procedure 102 is shown in Figure 1.
  • the main function of the F-DCA CAC algorithm 102 consists of three parts: the pre-code allocation process 104, the code allocation process 106, and the post-code allocation process 108.
  • the pre- code allocation process 104 reads WTRU measurements from radio link setup request message 110 and Node B measurements from the RRC shared cell database 112 and prepares the inputs (a list of available timeslots from the RRM cell database 116 and a list of code sets from the operations and maintenance (OAM) RRM table database 114) for the code allocation.
  • OAM operations and maintenance
  • the code allocation process 106 checks the code availability in the cell, generates timeslot sequences, finds the optimal solution for the code set (assigns the codes in the code set to the available timeslots), and allocates the channelized codes from the code vectors in a RRM cell database 116.
  • the postcode allocation process 108 is responsible for creating a WTRU entity in a RRM WTRU database 118, recording the allocated physical channels in the RRM WTRU database 118, recording the physical channel parameters and power control information in the radio link setup response message 120.
  • the processes and the databases there are data exchanges occurring directly between the processes.
  • the WTRU measurements, the Node B measurements, a list of the available timeslots in the cell, a list of code sets for the specific data rate, and WTRU capability information are passed from the pre-code allocation process 104 to the code allocation process 106.
  • the physical channel information (a list of timeslots and channelized codes in each timeslot) are passed from the code allocation process 106 to the post-code allocation process 108.
  • the functions of the F-DCA CAC algorithm for radio link setup procedure 102 are modularized into two groups of functions: signal-dependent functions whose inputs are parts of signal messages and signal-independent functions whose inputs are independent of signal messages.
  • the purpose of separating the signal-dependent functions and the signal-independent functions is to increase the reusability of the signal-independent functions.
  • the functions of both the pre-code allocation process 104 and the post-code allocation process 108 are signal-dependent functions.
  • the functions of the code allocation process 106 are signal-independent functions. It is to be noted that the functions of the code allocation process 106 can be reused by other procedures in other RRM function implementations, such as handover, F-DCA escape algorithm, and F- DCA background interference reduction algorithm.
  • the flowcharts for functions of the F-DCA CAC algorithm for radio link setup are shown in Figures 2a-2c and 3a-3b.
  • Figures 2a-2c show the main interface function 200 of the F-DCA CAC algorithm for radio link (RL) setup.
  • the function 200 begins by obtaining the RL setup request message (referred to hereinafter as "request message”; step 202) and extracting parameters from the request message (step 204).
  • the request message contains coded composite transport channel (CCTrCH) information, dedicated channel (DCH) information, RL information with or without WTRU measurements, and WTRU capability information.
  • the parameters extracted from the request message include information such as the WTRU identification, the cell identification, the RL identification, and WTRU capability information (the maximum number of physical channels per timeslot and the maximum number of timeslots per frame).
  • the entry identification of the RRM cell database is obtained (step 206).
  • the failure condition means that there are no physical resources available for the WTRU. It is noted that all DCHs not being NRT alone is not a failure condition.
  • the failure condition is reached when there are no WTRU measurements and all the DCHs are not NRT. [0055] If all the DCHs are NRT (step 212), then the low rate temporary DCHs are allocated for the present CCTrCH (step 218). After the channels are allocated, a determination is made whether the resource allocation was successful (step 220). If the resource allocation was not successful, then the status flag is set to indicate a failure condition (step 214) and the function terminates (step 216). If the resource allocation was successful (step 220), then a WTRU entity is created and the WTRU information and the physical channel parameters are recorded in the RRM WTRU database (step 222).
  • the information recorded to a WTRU entity includes the WTRU identification, the transaction identification, the uplink (UL) WTRU capability information, the DL WTRU capability information, and the RL information.
  • the UL WTRU capability information includes the maximum number of timeslots per frame and the maximum number of UL physical channels per timeslot.
  • the DL WTRU capability information includes the maximum number of timeslots per frame and the maximum number of DL physical channels per frame.
  • the RL information includes the RL identification, the cell identification, the UL CCTrCH information, and the DL CCTrCH information.
  • the CCTrCH information includes the CCTrCH identification, the CCTrCH status, the CCTrCH signal to interference ratio (SIR) target, the guaranteed data rate, the allowed data rate, and the dedicated physical channel (DPCH) information.
  • the DPCH information includes a list of timeslots, the midamble shift and burst type, the transport format code indicator (TFCI) presence, and the code information.
  • the code information includes the channelized code, the code usage status, the DPCH identification, and the code SIR target.
  • the physical channel information includes a list of timeslots and the channelized codes in each timeslot.
  • the timeslot information includes a repetition period and a repetition length.
  • the power control information includes the UL target SIR, the maximum UL SIR, the minimum UL SIR, the initial DL transmission power, the minimum DL transmission power, and the maximum allowed UL transmission power.
  • a single data structure is used for both the request message and the response message since these two messages include a large amount of common information.
  • the WTRU measurements are available in the request message (step 208), then the WTRU measurements are retrieved from the request message and Node B measurements are obtained from the RRC shared cell database (step 228).
  • the Node B measurements include common measurements and dedicated measurements.
  • the Node B common measurements include the UL ISCP and the DL transmitted carrier power.
  • the Node B dedicated measurements include the DL transmitted code power.
  • the first DL CCTrCH is selected (step 230) and the service type for the selected CCTrCH is obtained (step 232). If the service type is real time (RT; step 234), the available timeslots in the cell are determined (step 236).
  • step 238) If no timeslots are available (step 238), the status flag is set to indicate a failure condition (step 214) and the function terminates (step 216). [0058] If there are timeslots available (step 238), then the requested data rate is calculated (step 240). The code sets for the calculated data rate are obtained (step 242) and the physical channels (timeslots and codes) for the present CCTrCH are allocated and the optimal solution is recorded if found (step 244). The allocation function in step 244 is discussed in greater detail below in connection with Figures 3a and 3b. If the resource allocation was not successful (step 246), then the status flag is set to indicate a failure condition (step 214) and the function terminates (step 216).
  • step 246 If the resource allocation was successful (step 246), then a determination is made whether there are additional CCTrCHs to be examined (step 248). If there are additional CCTrCHs to be examined, then the next CCTrCH is selected (step 250) and the function continues at step 232. If there are no additional CCTrCHs to be examined (step 248), then a determination is made whether the UL CCTrCHs have been examined (step 252). If the UL CCTrCHs have not been examined, then the first UL CCTrCH is selected (step 254) and the function continues at step 232. If all of the UL CCTrCHs have been considered (step 252), then the function continues at step 222, as described above.
  • step 234 If the service type is NRT (step 234), the available timeslots in the cell are determined (step 256). If no timeslots are available (step 258), the status flag is set to indicate a failure condition (step 214) and the function terminates (step 216).
  • step 258 If there are timeslots available (step 258), then all data rates suitable for the NRT service are determined (step 260) and the highest data rate is selected (step 262). The code sets for the selected data rate are obtained (step 264) and the normal temporary DCHs for the present CCTrCH are allocated and the optimal solution is recorded if found (step 266). It is noted that steps 244 and 266 are essentially the same; in NRT service, the DCHs are temporary.
  • step 270 a determination is made whether there are additional data rates to be examined. If there are no other data rates to be examined, then the status flag is set to indicate a failure condition (step 214) and the function terminates (step 216). If there are other data rates to be examined (step 270), then the next highest data rate is selected (step 272) and the function continues at step 264. If the resource allocation was successful (step 268), then the function continues at step 248 as described above.
  • steps 230, 252, and 254 that either direction (DL or UL) can be performed first.
  • the DL direction is examined prior to the UL direction.
  • the function 200 will operate in the same manner if instead the UL was examined prior to the DL.
  • the steps 244 and 266 relate to calling the core function of the F-DCA algorithms to allocate the physical channels.
  • This core function 300 is signal- independent and is described in connection with Figures 3a and 3b.
  • the function 300 begins by receiving the code sets and the available timeslots as inputs (step 302).
  • the first code set is selected (step 304) and a determination is made whether the code set is available in the cell (steps 306 and 308).
  • step 310 If the selected code set is not available in the cell, then a determination is made whether there are more code sets to be examined (step 310). If there are more code sets, then the next code set is selected (step 312) and the function continues with step 306. If there are no more code sets, this indicates a failure condition, and a status flag is set to indicate that no solution is available (step 314) and the function terminates (step 316).
  • the required resource units for the code set in the CCTrCH are calculated (step 318).
  • the timeslot sequences are generated (step 320) and the first timeslot sequence is selected (step 322).
  • the link direction is then determined (step 350). If the link direction is DL, then an attempt is made to assign the current DL code set into the available timeslots in the current timeslot sequence (step 352). If the link direction is UL (step 350), then an attempt is made to assign the current UL code set into the available timeslots in the current timeslot sequence (step 354).
  • step 350 can be eliminated and steps 352 and 354 can be combined into a single step, to provide additional optimization.
  • steps 352, 354 After an attempt has been made to assign the current code set to the available timeslots in the current timeslot sequence (steps 352, 354), a determination is made whether an assignment solution has been found (step 356), indicating that the code set was successfully assigned to the available timeslots in the current timeslot sequence. If a solution has been found, then the ISCP of the solution is determined, and the solution having the lowest weighted ISCP is considered to be the optimal solution and is recorded (step 358). If no solution was found (step 356), then step 358 is skipped.
  • step 360 a determination is made whether there are any additional timeslot sequences to be considered. If there are additional timeslot sequences, then the next timeslot sequence is selected (step 362) and the function continues with step 350. If there are no additional timeslot sequences (step 360), then a determination is made whether an optimal solution has been found (step 364). If no optimal solution has been found, then the function continues at point C in the calling function (i.e., the function from which step 350 was entered). If the optimal solution has been found, then the status flag is set to indicate a successful assignment (step 366) and the function terminates (step 316).
  • the functions 352 and 354 are signal-dependent. In the present invention, these two functions are modified to become signal-independent functions. All related functions used in these two functions are also modified to become signal- independent functions. Because the inputs of the functions 352, 354 are independent of the signal message (such as the input message), the functions 352, 354 can be used by other RRM procedures. It is noted that the above- described implementation of the F-DCA CAC algorithm is exemplary and can be further optimized.
  • the main function of the F-DCA escape procedure 402 consists of three parts: the pre-code allocation process 404, the code allocation process 406, and the post-code allocation process 408.
  • the pre-code allocation process 404 is started upon receipt of a measurement trigger signal 410.
  • the WTRU measurement trigger signal contains the WTRU identification and a list of timeslot numbers, while the Node B measurement trigger signal contains a timeslot number.
  • the escape procedure begins upon receipt of either the WTRU measurement trigger signal or the Node B measurement trigger signal.
  • the pre-code allocation process 404 gets Node B measurements and WTRU measurements from a RRC shared cell database 412, gets cell configuration information from a RRM cell database 416, obtains WTRU capability information from a RRM WTRU database 418, determines the CCTrCH to be reassigned, calculates the WTRU pathloss, determines the candidate code set to be reassigned, and obtains a list of the available timeslots.
  • the pre-code allocation process 404 prepares the inputs for the code allocation process 406.
  • the code allocation process 406 checks the code availability in the cell, checks the transmission (Tx) power of the candidate timeslot, checks if the ISCP of other timeslots is lower than that of the candidate timeslot, generates timeslot sequences for the available timeslots, finds the assignment solution for the code set in a timeslot sequence (by assigning the candidate code set to the available timeslots), and selects the solution that has the lowest weighted ISCP as the optimal solution.
  • the post-code allocation process 408 is responsible for recording the newly allocated physical channels in the RRM WTRU database 418 and filling the physical channel information into a physical channel reconfiguration request message 420.
  • the functions ofthe F-DCA escape algorithm 402 are modularized into two groups of functions: signal-dependent functions whose inputs are parts of signal messages and signal-independent functions whose inputs are independent of signal messages.
  • the purpose of separating the signal-dependent functions and the signal-independent functions is to increase the reusability of the signal-independent functions.
  • the functions of both the pre-code allocation process 404 and the post-code allocation process 408 are signal-dependent functions.
  • the functions of the code allocation process 406 are signal-independent functions. Therefore, the reusability of signal-independent functions is higher than that of the signal- dependent functions.
  • Certain functions, which are inherently signal- dependent are converted in the preferred embodiment of the present invention from being signal-dependent to signal-independent, thereby increasing the reusability of the converted functions.
  • Figures 5a, 5b, and 6 show flowcharts of the main escape algorithm 500, which begins by receiving inputs from the trigger signals (step 502).
  • the entry identification of the RRM cell database is retrieved from the RRM cell database (step 504).
  • the WTRU measurements and the Node B measurements are retrieved from the shared cell database (step 506).
  • the link direction of the timeslots that have a link problem is determined (step 508) and the timeslot that has the worst link problem is located.
  • a candidate CCTrCH to be reassigned is determined based on how the escape mechanism is triggered (step 510).
  • the escape procedure is triggered by a too high DL ISCP of a WTRU in a timeslot
  • the CCTrCH of the WTRU in this timeslot is the candidate to be reassigned.
  • the DL ISCP is measured by the WTRU, and in this case, the escape procedure is triggered by the WTRU measurement signal.
  • the escape procedure When the escape procedure is triggered by a too high UL ISCP in a timeslot, the CCTrCH that has the code with the highest value of SIR plus pathloss is the candidate to be reassigned.
  • the escape procedure When the escape procedure is triggered by a too high Node B transmitted carrier power, the CCTrCH that has the code with the highest Node B transmitted code power is the candidate to be reassigned.
  • the UL ISCP and the Node B transmitted carrier power are both measured by the Node B, and in both of these cases, the escape procedure is triggered by the Node B measurement signal.
  • step 512 If no candidate CCTrCH is found (step 512), then a status flag is set to indicate a failure condition (step 514) and the procedure terminates (step 516). If a candidate CCTrCH is found (step 512), then the WTRU capability information is retrieved from the RRM WTRU database (step 518). The pathloss of the WTRU is calculated (step 520) and a candidate code set to be reassigned is determined (step 522). The candidate code set is determined based on if the updated ISCP of the given timeslot is less than the ISCP threshold, or if the updated timeslot transmitted power is less than the transmitted power threshold after this set of codes is removed from the timeslot which has a link problem.
  • both the ISCP threshold and the transmitted power threshold are design parameters. If there is no code set to be reassigned (step 524), then the status flag is set to indicate a failure condition (step 514) and the procedure terminates (step 516). [0079] If there is a code set to be reassigned (step 524), then the available timeslots for the codes to be reassigned are retrieved from the centralized database (step 526). If there are no timeslots available (step 528), then the status flag is set to indicate a failure condition (step 514) and the procedure terminates (step 516). If there are timeslots available (step 528), then the physical channels (timeslots and codes) are allocated for the CCTrCH (step 530).
  • the physical channel information includes a list of dedicated physical channel timeslot information, a repetition period value, and a repetition length value.
  • the dedicated physical channel timeslot information includes the timeslot number, the midamble shift and burst type, the TFCI presence, and a list of code information.
  • the code information includes the channelized code, the code usage status, the DPCH identification, and the code SIR target.
  • the physical channel information is also placed into a physical channel reconfiguration request message (step 536), the status flag is set to indicate a successful allocation (step 538), and the procedure terminates (step 516).
  • the physical channel reconfiguration request message includes the following information: the WTRU identification, the C-RNC identification, the radio link identification, the radio resource control transaction identification, UL CCTrCH information, and DL CCTrCH information.
  • the step 530 relates to calling the core function of the F-DCA escape procedure to allocate the physical channels.
  • This core function 600 is signal- independent and is described in connection with Figures 6 and 3b.
  • the function 600 begins by receiving the code sets, the available timeslots, and an F-DCA type indicator as inputs (step 602).
  • the first code set is selected (step 604) and a determination is made whether the code set is available in the cell (steps 606 and 608). If the selected code set is not available in the cell (step 608), then a determination is made whether there are more code sets to be examined (step 610). If there are more code sets, then the next code set is selected (step 612) and the function continues with step 606. If there are no more code sets (step 610), this indicates a failure condition, and a status flag is set to indicate that no solution is available (step 314; Figure 3b) and the function terminates (step 316; Figure 3b).
  • the F- DCA type is checked (step 618).
  • the F-DCA type is set based on different RRM functions such as radio bearer setup ("RBSETUP"), escape mechanism, or background interference reduction. In the escape procedure, the F-DCA type is set to "ESCAPE,” and can be set at any step before step 530 above. If the F- DCA type is "ESCAPE,” then the transmission power ofthe candidate timeslot is checked to determine if it is larger than the minimum required transmission power (step 620). If the candidate timeslot transmission power is less than the minimum value (step 622), then the status flag is set to indicate that no solution is available (step 314) and the function terminates (step 316; Figure 3b).
  • step 622 If the candidate timeslot transmission power is greater than the minimum value (step 622), then a check is made to determine if there are any timeslots that have a lower ISCP than the timeslot that reports the link problem (step 624). If there is no other timeslot with a lower ISCP (step 626), then the status flag is set to indicate that no solution is available (step 314; Figure 3b) and the function terminates (step 316; Figure 3b). [0085] If there is another timeslot with a lower ISCP (step 626) or if the F- DCA type is "RBSETUP" (step 618), then the required resource units for the code set in the CCTrCH are calculated (step 640).
  • the timeslot sequences are generated for the available timeslots (step 642) and the first timeslot sequence is selected (step 644).
  • the method then continues with step 350, as described above in connection with Figure 3b.
  • the steps performed if the F-DCA type is "background" (step 618) are discussed below.
  • FIG. 7 An overview 700 of the F-DCA background interference reduction procedure 702 is shown in Figure 7.
  • the main function of the F-DCA background interference reduction procedure 702 consists of three parts: the pre-code allocation process 704, the code allocation process 706, and the postcode allocation process 708.
  • the pre-code allocation process 704 is started upon receipt of a background timer trigger signal 710.
  • the pre-code allocation process 704 gets the entry identification of a RRM cell database 716, gets Node B measurements from a RRC shared cell database 712, determines the candidate timeslots to be reassigned (one UL timeslot and one DL timeslot), retrieves a list of the available timeslots to be used for reassignment from the RRM cell database 716, determines the candidate code sets to be reassigned in the candidate timeslot in both directions, obtains WTRU capability information from a RRM WTRU database 718, and calculates the WTRU pathloss.
  • the code allocation process 706 checks the code availability in the cell, checks the transmission (Tx) power of the candidate timeslot, finds the assignment solution for the code set for a timeslot sequence (by assigning the candidate code set to the available timeslots), and selects the solution that has the lowest weighted ISCP as the optimal solution.
  • the post-code allocation process 708 is responsible for recording the reallocated physical channels in the RRM WTRU database 718 and filling the physical channel information into a physical channel reconfiguration request message 720. [0089] In addition to the data exchanges between the processes and the databases, there are data exchanges occurring directly between the processes.
  • the WTRU measurements, the Node B measurements, a list of available timeslots in the cell, a candidate code set, and WTRU capability information are passed from the pre-code allocation process 704 to the code allocation process 706.
  • the physical channel information (a list of timeslots and channelized codes in each timeslot) are passed from the code allocation process 706 to the post-code allocation process 708.
  • the functions of the F-DCA background interference reduction procedure 702 are modularized into two groups of functions: signal-dependent functions whose inputs are parts of signal messages and signal-independent functions whose inputs are independent of signal messages.
  • the purpose of separating the signal-dependent functions and the signal-independent functions is to increase the reusability of the signal-independent functions.
  • the functions of both the pre-code allocation process 704 and the post-code allocation process 708 are signal-dependent functions.
  • the functions of the code allocation process 706 are signal-independent functions. Therefore, the reusability of signal-independent functions is higher than that of the signal-dependent functions.
  • Certain functions which are inherently signal-dependent are converted in the preferred embodiment ofthe present invention from being signal-dependent to signal-independent, thereby increasing the reusability of the converted functions.
  • Figures 8a, 8b, 6, and 3b show a flowchart of the main background interference reduction procedure 800, which begins (step 802) by retrieving the entry identification of the RRM cell database (step 804).
  • the WTRU measurements and the Node B measurements are retrieved from the shared cell database (step 806).
  • the candidate timeslots for reassignment are determined, one UL timeslot and one DL timeslot, based upon a figure of merit of the timeslots (step 808).
  • the timeslot with the lowest figure of merit is selected as the candidate for reassignment.
  • a status flag is set to indicate a failure condition (step 812), and the procedure terminates (step 814). If there are timeslots to be reassigned (step 810), then the link direction is set to the downlink (step 816). It is noted that the order of evaluation of link direction is arbitrary, and either the UL or the DL can be evaluated first.
  • the available timeslots in the cell for the selected link direction are retrieved (step 818). If there are no timeslots available (step 820), then the ' status flag is set to indicate a failure condition (step 812), and the procedure terminates (step 814). If there are available timeslots (step 820), then the list of available timeslots is updated to exclude the candidate timeslot (step 822).
  • the candidate code sets to be reassigned are determined in the candidate timeslots based on a figure of merit of the codes (step 824). The code with the lowest figure of merit is selected as the candidate for reassignment.
  • step 826 If there are no code sets to be reassigned (step 826), then the status flag is set to indicate a failure condition (step 812), and the procedure terminates (step 814). If there are code sets to be reassigned (step 826), then the WTRU capability information is retrieved from the WTRU database (step 828). [0093] The pathloss of the WTRU is calculated (step 830), and the physical channels for the current CCTrCH are reallocated (step 832). If the channel reallocation is not successful (step 834), then status flag is set to indicate a failure condition (step 812), and the procedure terminates (step 814). If the channel reallocation is successful (step 834), then a determination is made whether the link direction is currently UL (step 836). If the link direction is currently DL, then the link direction is set to UL (step 838) and the method continues with step 818.
  • the current link direction is UL (step 836)
  • the physical channel information includes a list of dedicated physical channel timeslot information, a repetition period value, and a repetition length value.
  • the dedicated physical channel timeslot information includes the timeslot number, the midamble shift and burst type, the TFCI presence, and a list of code information.
  • the code information includes the channelized code, the code usage status, the DPCH identification, and the code SIR target.
  • the physical channel allocation information is also recorded into a physical channel reconfiguration request message (step 846), the status flag is set to indicate "success" (step 848), and the procedure terminates (step 814). If the flag indicates that two WTRUs have CCTrCHs being reassigned (step 842), the corresponding physical channel information for two WTRUs is recorded (step 844) and two physical channel reconfiguration request messages are sent (step 846).
  • the physical channel reconfiguration request message includes the following information: the WTRU identification, the C- RNC identification, the radio link identification, the radio resource control transaction identification, UL CCTrCH information, and DL CCTrCH information.
  • Step 832 relates to calling the core function of the F-DCA background interference reduction procedure to reallocate the physical channels.
  • This core function is signal-independent and is described in connection with Figures 6 and 3b.
  • the function 600 operates in the same manner as described above, with the following additional steps being performed in connection with the background interference reduction procedure.
  • the F-DCA type is set to "BACKGROUND,” and it can be set at any step before step 832 above. If the F-DCA type is "BACKGROUND" (step 618), then the transmission power of the candidate timeslot is checked to determine if it is larger than the minimum required transmission power (step 630).
  • step 632 If the candidate timeslot transmission power is less than the minimum value (step 632), then the status flag is set to indicate that no solution is available (step 314; Figure 3b) and the function terminates (step 316; Figure 3b). If the transmission power of the candidate timeslot is greater than the minimum transmission power (step 632), then the procedure continues with step 640 as described above.
  • FIG. 9 An overview 900 of a F-DCA CAC procedure for radio link addition 902 is shown in Figure 9.
  • the main function of the F-DCA CAC procedure 902 consists of three parts: a pre-code allocation process 904, a code allocation process 906, and a post-code allocation process 908.
  • the pre-code allocation process 904 reads WTRU measurements from a radio link addition request message 910 (hereinafter "request message"), reads Node B measurements from a RRC shared cell database 912, and retrieves CCTrCH information, DCH information, and WTRU capability information from a RRM WTRU database 918.
  • request message radio link addition request message
  • the pre-code allocation process 904 also retrieves a list of the available timeslots in the new cell from a RRM cell database 916, gets the data rate for the CCTrCH from a RRM WTRU database 918, and gets the code sets from an OAM RRM table database 914.
  • the code allocation process 906 checks the code availability in the new cell, generates timeslot sequences for the available timeslots, finds the optimal solution for the code set (assigns the codes in the code sets to the available timeslots), and allocates the channelized codes from the code vectors in the RRM cell database 916.
  • the post-code allocation process 908 is responsible for updating code vector information in the RRM cell database 916, recording the new radio link information and physical channel information in the RRM WTRU database 918, and recording CCTrCHs information, DCHs information, DPCHs information, UL ISCP information, and power control information in a radio link addition response message 920.
  • the functions of the F-DCA CAC procedure for radio link addition 902 are modularized into two groups of functions: signal-dependent functions whose inputs are parts of signal messages and signal-independent functions whose inputs are independent of signal messages.
  • the purpose of separating the signal-dependent functions and the signal-independent functions is to increase reusability of the signal- independent functions.
  • the functions of both the pre-code allocation process 904 and the post-code allocation process 908 are signal-dependent functions.
  • the functions of the code allocation process 906 are signal- independent functions. Therefore, the reusability of signal-independent functions is higher than that of the signal-dependent functions.
  • FIGS 10a- 10c show the main interface function 1000 for the F-DCA CAC for RL addition procedure.
  • the function 1000 begins by obtaining the RL addition request message (step 1002) and extracting the WTRU identification, the new radio link identification, and the new cell identification from the request message (step 1004).
  • the request message also contains new RL information with or without WTRU measurements.
  • the entry identification of a new cell in the RRM cell database is obtained (step 1006).
  • the Node B measurements for the new cell are obtained from the RRC shared cell database and are stored locally in a measurement data structure (step 1008).
  • the measurement data structure is stored in the F- DCA CAC function dynamically. It is created after the F-DCA CAC function is called and deleted when the F-DCA CAC function is exited.
  • the Node B measurements include common measurements and dedicated measurements.
  • the Node B common measurements include the UL ISCP information and the DL transmitted carrier power.
  • the Node B dedicated measurements include the DL transmitted code power.
  • the old cell identification is retrieved based on the WTRU ID from the RRM WTRU database; CCTrCHs information and DCHs information belonging to that WTRU's radio link in the old cell are retrieved from RRM WTRU database (step 1010).
  • the WTRU measurements which include the DL ISCP and the downlink primary common control physical channel received signal code power (P-CCPCH RSCP)
  • P-CCPCH RSCP downlink primary common control physical channel received signal code power
  • a status flag is set to indicate a failure condition (step 1018) and the function terminates (step 1020).
  • the failure condition here means that there is not enough information to process the function further. It is noted that all the DCHs not being NRT alone is not a failure condition; the failure condition is reached when there are no WTRU measurements and all of the DCHs are not NRT. If all of the DCHs are NRT (step 1016), then the low rate temporary DCHs are allocated for both UL and DL CCTrCHs (step 1022). After the channels are allocated, a determination is made whether the resource allocations were successful (step 1024).
  • the recorded information includes the new RL information and the new RRC transaction identification.
  • the RL information includes the RL identification, the cell identification, the UL CCTrCH information, and the DL CCTrCH information.
  • the CCTrCH information includes the CCTrCH identification, the CCTrCH status, the CCTrCH SIR target, the guaranteed data rate, the allowed data rate, and the DPCH information.
  • the DPCH information includes a list of DPCH timeslot information, a repetition period value, and a repetition length value.
  • the DPCH timeslot information includes the timeslot number, the midamble shift and burst type, the TFCI presence, and a list of code information.
  • the code information includes the channelized code, the code usage status, the DPCH identification, and the code SIR target.
  • the updated code vector information includes both UL code vector information and DL code vector information.
  • the UL code vector information includes a code identification, a code block indication, and a code usage status.
  • the DL code vector information includes a code identification and a code usage status.
  • the WTRU measurements are available in the request message (step 1012), then the WTRU measurements are retrieved from the request message and are stored locally (step 1032).
  • the first DL CCTrCH is selected (step 1034) and the WTRU capability information is retrieved from the RRM WTRU database based on the WTRU identification, the link direction, and the old cell identification (step 1036).
  • the service type for the selected CCTrCH is obtained from the RRM WTRU database (step 1038). If the service type is RT (step 1040), the available timeslots in the cell are determined (step 1042). If no timeslots are available (step 1044), the status flag is set to indicate a failure condition (step 1018) and the procedure terminates (step 1020).
  • step 1044 If there are timeslots available in the new cell (step 1044), then the highest requested data rate for this CCTrCH in the old cell is retrieved from the RRM WTRU database (step 1046).
  • the code sets for the requested data rate are obtained (step 1048) and the physical channels (timeslots and codes) for the present CCTrCH are allocated and the optimal solution is recorded if found (step 1050).
  • the allocation function in step 1050 was discussed in greater detail above in connection with Figures 3a and 3b. If the resource allocation was not successful (step 1052), then the status flag is set to indicate a failure condition (step 1018) and the procedure terminates (step 1020).
  • step 1052 If the resource allocation was successful (step 1052), then a determination is made whether there are additional CCTrCHs in the current direction (i.e., downlink or uplink) to be examined (step 1054). If there are additional CCTrCHs to be examined, then the next CCTrCH is selected (step 1056) and the procedure continues at step 1038. If there are no additional CCTrCHs to be examined (step 1054), then a determination is made whether the UL CCTrCHs have been examined (step 1058). If the UL CCTrCHs have not been examined, then the first UL CCTrCH is selected (step 1060) and the procedure continues at step 1036. If all of the UL CCTrCHs have been considered (step 1058), then the procedure continues at step 1026 as described above.
  • CCTrCHs information with newly allocated physical channel information, DCHs information, UL timeslot ISCP information, and power control information are placed into a RL addition response message (step 1028), the status flag is set to indicate a success condition (step 1030), and the procedure terminates (step 1020).
  • the CCTrCH information includes the CCTrCH identification and the DPCH information.
  • the DPCH information includes a list of timeslot information, a repetition period and a repetition length.
  • the DPCH timeslot information includes the timeslot number, the midamble shift and burst type, the TFCI presence, and a list of code information.
  • the code information includes the channelized code, and the DPCH identification.
  • the DCHs information includes diversity indication and choice diversity indication.
  • the power control information includes the UL target SIR, the maximum UL SIR, the minimum UL SIR, the initial DL transmission power, the maximum DL transmission power, and the minimum DL transmission power.
  • step 1040 If the service type is NRT (step 1040), the available timeslots in the new cell are determined (step 1062). If no timeslots are available in the new cell (step 1064), then the status flag is set to indicate a failure condition (step 1018) and the procedure terminates (step 1020).
  • step 1064 If there are timeslots available in the new cell (step 1064), then all data rates suitable for the NRT service of the CCTrCH are retrieved from the RRM WTRU database (step 1066) and the highest data rate is selected (step 1068). The code sets for the selected data rate are obtained (step 1070) and the normal temporary DCHs for the present CCTrCH are allocated and the optimal solution is recorded if found (step 1072). It is noted that steps 1050 and 1072 are essentially the same; in NRT service, the DCHs are temporary. If the resource allocation was not successful (step 1074), then a determination is made whether there are additional data rates to be examined (step 1076).
  • step 1020 If there are no other data rates to be examined, then the status flag is set to indicate a failure condition (step 1018) and the procedure terminates (step 1020). If there are other data rates to be examined (step 1076), then the next highest data rate is selected (step 1078) and the procedure continues at step 1070. If the resource allocation was successful (step 1074), then the procedure continues at step 1054 as described above. [0114] It is noted that in connection with steps 1034, 1058, and 1060 that either direction (DL or UL) can be performed first. As described above, the DL direction is examined prior to the UL direction. The function 1000 will operate in the same manner if instead the UL was examined prior to the DL. [0115] The steps 1050 and 1072 relate to calling the channel allocation function ofthe F-DCA algorithms; this core function 300 is signal-independent and operates in the same manner as described above in connection with Figures 3a and 3b.
  • the F-DCA CAC procedure 1102 consists of three parts: a pre-code allocation process 1104, a code allocation process 1106, and a post-code allocation process 1108.
  • the pre-code allocation process 1104 retrieves WTRU information from a radio link reconfiguration prepare message 1110 and retrieves WTRU capability information from a RRM WTRU database 1118. WTRU and Node B measurements are retrieved from a RRC shared cell database 1112. A list of the available timeslots is obtained from a RRM cell database 1116 and code sets are retrieved from an OAM RRM table database 1114.
  • the code allocation process 1106 checks the code availability in the cell, generates timeslot sequences, finds the optimal solution for the code set (assigns the codes in the code sets to the available timeslots and allocates the channelized codes from the code vectors in the RRM cell database 1116).
  • the post-code allocation process 1108 updates code vector information in the RRM cell database 1116, records the allocated physical channels in the RRM WTRU database 1118, and records the physical channel parameters and power control information in a radio link reconfiguration ready message 1120.
  • the data exchanges between the processes and the database there are data exchanges occurring directly between the processes.
  • the WTRU measurements, the Node B measurements, a list of available timeslots in the cell, a list of code sets for the specific data rate, and WTRU capability information are passed from the pre-code allocation process 1104 to the code allocation process 106.
  • the physical channel information (a list of timeslots and channelized codes in each timeslot) is passed from the code allocation process 1106 to the post-code allocation process 1108.
  • the functions of the F-DCA CAC procedure for radio link reconfiguration 1102 are modularized into two groups of functions: signal-dependent functions whose inputs are parts of signal messages and signal-independent functions whose inputs are independent of signal messages.
  • the purpose of separating the signal-dependent functions and the signal-independent functions is to increase the reusability of the signal-independent functions.
  • the functions of both the pre-code allocation process 1104 and the post-code allocation process 1108 are signal-dependent functions.
  • the functions of the code allocation process 1106 are signal-independent functions. It is to be noted that the functions of the code allocation process 1106 can be reused by other procedures in other RRM function implementations.
  • FIG. 12 shows a flowchart of the main interface procedure 1200 of the F-DCA CAC for radio link reconfiguration procedure.
  • the procedure 1200 begins by obtaining the RL reconfiguration prepare message (referred to hereinafter as "prepare message"; step 1202).
  • the prepare message contains CCTrCH information (about a CCTrCH to be added or modified), DCH information (about a DCH to be added or modified), and RL information with or without WTRU measurements.
  • the WTRU measurements include the DL ISCP and the DL P- CCPCH RSCP.
  • the WTRU identification and the RL identification are extracted from the prepare message and the cell identification is retrieved from the WTRU database (step 1204).
  • the entry identification of the RRM cell database is then obtained (step 1206).
  • a data structure is created to store measurements locally (step 1208). This measurement data structure is stored in the F-DCA CAC function dynamically. It is created after the F-DCA CAC function is called and is deleted when the F-DCA CAC function is exited.
  • the Node B measurements are then retrieved from the RRC shared cell database and are stored locally (step 1210).
  • the Node B measurements include common measurements and dedicated measurements.
  • the Node B common measurements include the UL ISCP and the DL transmitted carrier power.
  • the Node B dedicated measurements include the DL transmitted code power.
  • the measurement data structure includes a list of cell measurement records.
  • a cell measurement record includes the cell identification and a list of timeslot measurement records.
  • a timeslot measurement record contains the timeslot number, the timeslot ISCP, the timeslot carrier power, and a list of code measurement records.
  • a code measurement record consists ofthe WTRU identification, the radio link identification, the DPCH identification, and the code transmitted power.
  • the WTRU measurements are included in the prepare message (step 1212), then the WTRU measurements are extracted from the prepare message and are stored locally in the measurement data structure (step 1214).
  • the physical channels are then allocated for the CCTrCHs to be added or modified (step 1216). It is noted that the code allocation procedure (step 1216) is the same, whether CCTrCHs are to be added or modified.
  • the channel allocation procedure will be discussed in greater detail in connection with Figures 13a-13c, below. If the physical channel allocation is a success (step 1218), then a status flag is set to indicate the success condition (step 1220) and the procedure terminates (step 1222). If the channel allocation is not successful (step 1218), then the status flag is set to indicate a failure condition (step 1224) and the procedure terminates (step 1222).
  • step 1226 a determination is made whether all of the DCHs are NRT (step 1226). If all the DCHs are not NRT, then this indicates a failure condition, and the status flag is set to indicate the failure condition (step 1224) and the procedure terminates (step 1222). If all the DCHs are NRT (step 1228), then the RL reconfiguration type is determined (step 1230). The RL configuration type is set based upon the CCTrCH in the RL.
  • the RL configuration type is set to "ADDITION.” If the CCTrCH is to be modified, then the RL configuration type is set to "MODIFY.” [0126] If the RL reconfiguration type is "MODIFY”, then this indicates a failure condition, and the status flag is set to indicate the failure condition (step 1224) and the procedure terminates (step 1222). The failure condition indicates that there is not enough information to process the request further. The failure condition is reached when the RL configuration type is "MODIFY" and the RL reconfiguration message does not include the WTRU measurements.
  • FIG. 13a- 13c show a flowchart of a channel allocation procedure 1300, which is used by step 1216 of the F-DCA CAC RL reconfiguration procedure 1200.
  • the procedure 1300 begins by obtaining the prepare message (step 1302) and extracting the WTRU identification and the RL identification from the prepare message (step 1304).
  • the first DL CCTrCH is selected (step 1306) and the WTRU capabilities are retrieved from the WTRU database (step 1308).
  • the service type for the selected CCTrCH is obtained (step 1310), and if the service type is RT (step 1312), then the available timeslots for the RT in the cell are determined (step 1314). If no timeslots are available (step 1316), this indicates a failure condition, and a status flag is set to indicate the failure condition (step 1318) and the procedure terminates (step 1320).
  • step 1316 If there are timeslots available (step 1316), then the block error rate (BLER) for the selected CCTrCH is determined (step 1322) and the requested data rate is calculated (step 1324). The code sets for the calculated data rate are obtained (step 1326) and the physical channels (timeslots and codes) for the selected CCTrCH are allocated and the optimal solution is recorded if found (step 1328). The allocation function in step 1328 is discussed in greater detail above in connection with Figures 3a and 3b. If the resource allocation was not successful (step 1330), then the status flag is set to indicate a failure condition (step 1318) and the function terminates (step 1320).
  • BLER block error rate
  • step 1330 If the resource allocation was successful (step 1330), then a determination is made whether there are additional CCTrCHs in the current direction (i.e., DL or UL) to be examined (step 1332). If there are additional CCTrCHs to be examined, then the next CCTrCH in the current direction is selected (step 1334) and the procedure continues at step 1310. If there are no additional CCTrCHs to be examined (step 1332), then a determination is made whether the UL CCTrCHs have been examined (step 1336). If the UL CCTrCHs have not been examined, then the first UL CCTrCH is selected (step 1338) and the procedure continues at step 1308.
  • the updated WTRU information includes both the UL CCTrCH information (for a CCTrCH to be added or modified) and the DL CCTrCH information (for a CCTrCH to be added or modified) with newly allocated physical channel information.
  • the CCTrCH information includes the CCTrCH identification, the CCTrCH status, the CCTrCH SIR target, the guaranteed data rate, the allowed data rate, and the DPCH information.
  • the DPCH information includes a list of DPCH timeslot information, a repetition period, and a repetition length.
  • the DPCH timeslot information includes the timeslot number, the midamble shift and burst type, the TFCI presence, and a list of code information.
  • the code information includes the channelized code, the code usage status, the DPCH identification, and the code SIR target.
  • the code vector information includes the UL code vector information and the DL code vector information.
  • the UL code vector information includes a code identification, a code block indication, and a code usage status.
  • the DL code vector information includes a code identification and a code usage status.
  • the physical channel information and the power control information are then put into a RL reconfiguration ready message (step 1342), the status flag is set to indicate a successful resource allocation (step 1344), and the procedure terminates (step 1320).
  • the physical channel information includes a list of timeslot information, a repetition period and a repetition length.
  • the timeslot information includes the timeslot number, the midamble shift and burst type, the TFCI presence, and a list of code information.
  • the code information includes the channelized code and the DPCH identification.
  • the power control information includes the initial DL transmission power, the maximum DL transmission power, the minimum DL transmission power, the maximum UL SIR and the minimum UL SIR. In one implementation of the present invention, a single data structure is used for both the request message and the response message since these two messages include a lot of common information.
  • step 1312 If the service type for the selected CCTrCH is NRT (step 1312), then the available timeslots for the NRT in the cell are determined (step 1346). If no timeslots are available (step 1348), the status flag is set to indicate a failure condition (step 1318) and the procedure terminates (step 1320). If there are timeslots available (step 1348), then the BLER for the selected CCTrCH is determined (step 1350). All data rates suitable for the NRT service are determined (step 1352) and the highest data rate is selected (step 1354). The code sets for the selected data rate are obtained (step 1356) and the normal temporary DCHs for the selected CCTrCH are allocated and the optimal solution is recorded if found (step 1358).
  • steps 1328 and 1358 are essentially the same; in NRT service, the DCHs are temporary.
  • a determination is made whether there are additional data rates to be examined (step 1362). If there are no other data rates to be examined, then the status flag is set to indicate a failure condition (step 1318) and the procedure terminates (step 1320). If there are other data rates to be examined (step 1362), then the next highest data rate is selected (step 1364) and the procedure continues at step 1356. If the resource allocation was successful (step 1360), then the procedure continues at step 1332 as described above.
  • steps 1306, 1336, and 1338 that either direction (DL or UL) can be performed first. As described above, the DL direction is examined prior to the UL direction. The procedure 1300 will operate in the same manner if instead the UL was examined prior to the DL. [0137] The steps 1328 and 1358 relate to calling the channel allocation function ofthe F-DCA algorithms; this core function is signal-independent and is described above in connection with Figures 3a and 3b.
  • the preferred embodiments are described in conjunction with a third generation partnership program (3 GPP) wideband code division multiple access (W-CDMA) system utilizing the time division duplex (TDD) mode, the embodiments are applicable to any hybrid code division multiple access (CDMA)/time division multiple access (TDMA) communication system. Additionally, some embodiments are applicable to CDMA systems, in general, using beamforming, such as the proposed frequency division duplex (FDD) mode of 3GPP W-CDMA. While specific embodiments of the present invention have been shown and described, many modifications and variations could be made by one skilled in the art without departing from the scope of the invention. The above description serves to illustrate and not limit the particular invention in any way.
  • 3 GPP third generation partnership program
  • W-CDMA wideband code division multiple access
  • TDD time division duplex

Abstract

L'invention concerne un procédé permettant d'optimiser un algorithme de gestion de ressources radio par attribution dynamique et rapide de voie dans un système de communication sans fil. Ce procédé comprend un processus d'attribution de pré-code, un processus d'attribution de code indépendant du signal et un processus d'attribution de post-code. Le processus d'attribution de pré-code consiste à recevoir et à traiter un message d'entrée et à obtenir des mesures et des informations de système d'une base de données centralisée. Le processus d'attribution de code commence par vérifier la disponibilité d'un ensemble de codes dans la cellule et par générer des séquences d'intervalles de temps pour les intervalles de temps disponibles. Un ensemble de codes est attribué aux intervalles de temps disponibles dans une séquence d'intervalles de temps, une attribution réussie étant une solution. La puissance de code de signal brouilleur (ISCP) est calculée pour chaque solution et la solution présentant la puissance ISCP pondérée la plus basse est choisie comme solution optimale. Le processus d'attribution de post-code consiste à stocker des informations d'attribution dans une base de données centralisée et à créer un message de sortie.
EP04715103A 2003-02-27 2004-02-26 Procede permettant de mettre en oeuvre des procedures de gestion de ressources radio par attribution dynamique et rapide de voie Withdrawn EP1602244A4 (fr)

Applications Claiming Priority (21)

Application Number Priority Date Filing Date Title
US744800 1985-06-13
US747733 1985-06-24
US747297 1996-11-12
US45092703P 2003-02-27 2003-02-27
US45092403P 2003-02-27 2003-02-27
US45079303P 2003-02-27 2003-02-27
US450924P 2003-02-27
US450793P 2003-02-27
US450927P 2003-02-27
US45664403P 2003-03-20 2003-03-20
US456644P 2003-03-20
US46389303P 2003-04-17 2003-04-17
US463893P 2003-04-17
US10/744,800 US7107060B2 (en) 2003-02-27 2003-12-23 Method of optimizing an implementation of fast-dynamic channel allocation call admission control in radio resource management
US10/747,297 US7130637B2 (en) 2003-02-27 2003-12-29 Method for implementing fast dynamic channel allocation background interference reduction procedure in radio resource management
US10/747,733 US7212826B2 (en) 2003-02-27 2003-12-29 Method for implementing fast dynamic channel allocation escape mechanism in radio resource management
US10/750,135 US7110771B2 (en) 2003-04-17 2003-12-31 Method for implementing fast-dynamic channel allocation call admission control for radio link reconfiguration in radio resource management
US750135 2003-12-31
US10/750,129 US7136656B2 (en) 2003-03-20 2003-12-31 Method of fast dynamic channel allocation call admission control for radio link addition in radio resource management
US750129 2003-12-31
PCT/US2004/005746 WO2004077850A2 (fr) 2003-02-27 2004-02-26 Procede permettant de mettre en oeuvre des procedures de gestion de ressources radio par attribution dynamique et rapide de voie

Publications (2)

Publication Number Publication Date
EP1602244A2 EP1602244A2 (fr) 2005-12-07
EP1602244A4 true EP1602244A4 (fr) 2006-07-26

Family

ID=32931807

Family Applications (1)

Application Number Title Priority Date Filing Date
EP04715103A Withdrawn EP1602244A4 (fr) 2003-02-27 2004-02-26 Procede permettant de mettre en oeuvre des procedures de gestion de ressources radio par attribution dynamique et rapide de voie

Country Status (9)

Country Link
EP (1) EP1602244A4 (fr)
JP (1) JP4298744B2 (fr)
KR (2) KR20050110716A (fr)
CN (1) CN1754393B (fr)
CA (1) CA2516865A1 (fr)
MX (1) MXPA05009121A (fr)
NO (1) NO20054455L (fr)
TW (4) TW201316793A (fr)
WO (1) WO2004077850A2 (fr)

Families Citing this family (46)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9130810B2 (en) 2000-09-13 2015-09-08 Qualcomm Incorporated OFDM communications methods and apparatus
US7295509B2 (en) 2000-09-13 2007-11-13 Qualcomm, Incorporated Signaling method in an OFDM multiple access system
US9148256B2 (en) 2004-07-21 2015-09-29 Qualcomm Incorporated Performance based rank prediction for MIMO design
US9137822B2 (en) 2004-07-21 2015-09-15 Qualcomm Incorporated Efficient signaling over access channel
US8095141B2 (en) 2005-03-09 2012-01-10 Qualcomm Incorporated Use of supplemental assignments
US9246560B2 (en) 2005-03-10 2016-01-26 Qualcomm Incorporated Systems and methods for beamforming and rate control in a multi-input multi-output communication systems
US9154211B2 (en) 2005-03-11 2015-10-06 Qualcomm Incorporated Systems and methods for beamforming feedback in multi antenna communication systems
US8446892B2 (en) 2005-03-16 2013-05-21 Qualcomm Incorporated Channel structures for a quasi-orthogonal multiple-access communication system
US9520972B2 (en) 2005-03-17 2016-12-13 Qualcomm Incorporated Pilot signal transmission for an orthogonal frequency division wireless communication system
US9143305B2 (en) 2005-03-17 2015-09-22 Qualcomm Incorporated Pilot signal transmission for an orthogonal frequency division wireless communication system
US9461859B2 (en) 2005-03-17 2016-10-04 Qualcomm Incorporated Pilot signal transmission for an orthogonal frequency division wireless communication system
US9184870B2 (en) 2005-04-01 2015-11-10 Qualcomm Incorporated Systems and methods for control channel signaling
US9036538B2 (en) 2005-04-19 2015-05-19 Qualcomm Incorporated Frequency hopping design for single carrier FDMA systems
US9408220B2 (en) 2005-04-19 2016-08-02 Qualcomm Incorporated Channel quality reporting for adaptive sectorization
US8565194B2 (en) 2005-10-27 2013-10-22 Qualcomm Incorporated Puncturing signaling channel for a wireless communication system
US8879511B2 (en) 2005-10-27 2014-11-04 Qualcomm Incorporated Assignment acknowledgement for a wireless communication system
US8462859B2 (en) 2005-06-01 2013-06-11 Qualcomm Incorporated Sphere decoding apparatus
US8599945B2 (en) 2005-06-16 2013-12-03 Qualcomm Incorporated Robust rank prediction for a MIMO system
US9179319B2 (en) 2005-06-16 2015-11-03 Qualcomm Incorporated Adaptive sectorization in cellular systems
US8885628B2 (en) 2005-08-08 2014-11-11 Qualcomm Incorporated Code division multiplexing in a single-carrier frequency division multiple access system
US9209956B2 (en) 2005-08-22 2015-12-08 Qualcomm Incorporated Segment sensitive scheduling
US20070041457A1 (en) 2005-08-22 2007-02-22 Tamer Kadous Method and apparatus for providing antenna diversity in a wireless communication system
US8644292B2 (en) 2005-08-24 2014-02-04 Qualcomm Incorporated Varied transmission time intervals for wireless communication system
US9136974B2 (en) 2005-08-30 2015-09-15 Qualcomm Incorporated Precoding and SDMA support
CN100431282C (zh) * 2005-09-07 2008-11-05 中兴通讯股份有限公司 多条无线链路的物理信道发射功率的异步重配置方法
CN1326410C (zh) * 2005-10-13 2007-07-11 中国移动通信集团公司 获取移动终端更新能力信息的方法
US9088384B2 (en) 2005-10-27 2015-07-21 Qualcomm Incorporated Pilot symbol transmission in wireless communication systems
US9210651B2 (en) 2005-10-27 2015-12-08 Qualcomm Incorporated Method and apparatus for bootstraping information in a communication system
US8045512B2 (en) 2005-10-27 2011-10-25 Qualcomm Incorporated Scalable frequency band operation in wireless communication systems
US9225416B2 (en) 2005-10-27 2015-12-29 Qualcomm Incorporated Varied signaling channels for a reverse link in a wireless communication system
US8693405B2 (en) 2005-10-27 2014-04-08 Qualcomm Incorporated SDMA resource management
US9144060B2 (en) 2005-10-27 2015-09-22 Qualcomm Incorporated Resource allocation for shared signaling channels
US9225488B2 (en) 2005-10-27 2015-12-29 Qualcomm Incorporated Shared signaling channel
US8477684B2 (en) 2005-10-27 2013-07-02 Qualcomm Incorporated Acknowledgement of control messages in a wireless communication system
US9172453B2 (en) 2005-10-27 2015-10-27 Qualcomm Incorporated Method and apparatus for pre-coding frequency division duplexing system
US8582509B2 (en) 2005-10-27 2013-11-12 Qualcomm Incorporated Scalable frequency band operation in wireless communication systems
US8582548B2 (en) 2005-11-18 2013-11-12 Qualcomm Incorporated Frequency division multiple access schemes for wireless communication
US8831607B2 (en) 2006-01-05 2014-09-09 Qualcomm Incorporated Reverse link other sector communication
KR100725418B1 (ko) * 2006-01-05 2007-06-07 삼성전자주식회사 무선 통신 장치 및 무선 통신 장치를 검색하는 방법
DK2381728T3 (da) * 2006-08-21 2013-10-07 Interdigital Tech Corp Planlægning og signalering af dynamisk ressourceallokering for en variabel datahastighedstjeneste i LTE
KR100964446B1 (ko) * 2008-02-15 2010-06-16 에스케이 텔레콤주식회사 하향링크 동적 자원 할당 방법 및 시스템
CN101835166B (zh) * 2009-03-09 2012-12-12 上海贝尔股份有限公司 信道分配优化方法及信道分配优化设备
CN101621847B (zh) * 2009-08-06 2011-12-07 中兴通讯股份有限公司 3g无线资源管理消息的获取方法及终端
US9496972B2 (en) 2010-03-08 2016-11-15 Htc Corporation Communication devices and methods thereof
CN103269487B (zh) * 2013-04-22 2018-02-02 中国人民解放军理工大学通信工程学院 毫微微蜂窝网络下行链路中基于博弈论的动态干扰管理方法
TWI651979B (zh) 2016-07-07 2019-02-21 財團法人工業技術研究院 無線接取網路之服務區分方法、無線網路系統及無線接取網路存取點

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0940999A2 (fr) * 1998-03-05 1999-09-08 Lucent Technologies Inc. Assignation dynamique basée sur la fonction des dépenses pour un système cellulaire
WO2000018034A1 (fr) * 1998-09-21 2000-03-30 Tantivy Communications, Inc. Protocole de commande de puissance pour liaison inversee, a debit de donnees hautement variable, dans un systeme de telecommunications
WO2001035692A1 (fr) * 1999-11-10 2001-05-17 Telefonaktiebolaget Lm Ericsson (Publ) Controle d'acces dans un systeme de radiocommunication mobile
US6246881B1 (en) * 1997-02-14 2001-06-12 Nokia Telecommunications Oy Method of channel allocation
WO2002005441A2 (fr) * 2000-07-10 2002-01-17 Interdigital Technology Corporation Mesure de puissance de code pour l'attribution dynamique de canaux
US20020181550A1 (en) * 2001-05-15 2002-12-05 Eldad Zeira Transmission power level estimation

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5448750A (en) * 1992-04-22 1995-09-05 Telefonaktiebolaget Lm Ericsson Segregation method of dynamic channel allocation in a mobile radio system
US5966657A (en) * 1997-07-24 1999-10-12 Telefonaktiebolaget L M Ericsson (Publ) Method and system for radio frequency measurement and automatic frequency planning in a cellular radio system
CA2287685A1 (fr) * 1998-12-07 2000-06-07 Lucent Technologies Inc. Attribution dynamique de canaux de ligne d'abonne numerique en fonction de la largeur de bande et de la symetrie
WO2002052875A2 (fr) 2000-12-27 2002-07-04 Ensemble Communications, Inc. Controle d'admission d'appel adaptatif servant dans un systeme de communication sans fil

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6246881B1 (en) * 1997-02-14 2001-06-12 Nokia Telecommunications Oy Method of channel allocation
EP0940999A2 (fr) * 1998-03-05 1999-09-08 Lucent Technologies Inc. Assignation dynamique basée sur la fonction des dépenses pour un système cellulaire
WO2000018034A1 (fr) * 1998-09-21 2000-03-30 Tantivy Communications, Inc. Protocole de commande de puissance pour liaison inversee, a debit de donnees hautement variable, dans un systeme de telecommunications
WO2001035692A1 (fr) * 1999-11-10 2001-05-17 Telefonaktiebolaget Lm Ericsson (Publ) Controle d'acces dans un systeme de radiocommunication mobile
WO2002005441A2 (fr) * 2000-07-10 2002-01-17 Interdigital Technology Corporation Mesure de puissance de code pour l'attribution dynamique de canaux
US20020181550A1 (en) * 2001-05-15 2002-12-05 Eldad Zeira Transmission power level estimation

Also Published As

Publication number Publication date
TWI357271B (en) 2012-01-21
NO20054455D0 (no) 2005-09-26
JP4298744B2 (ja) 2009-07-22
TWI387361B (zh) 2013-02-21
CA2516865A1 (fr) 2004-09-10
WO2004077850A2 (fr) 2004-09-10
EP1602244A2 (fr) 2005-12-07
JP2006520126A (ja) 2006-08-31
CN1754393A (zh) 2006-03-29
MXPA05009121A (es) 2005-10-20
TWI252006B (en) 2006-03-21
KR20050110716A (ko) 2005-11-23
TW201316793A (zh) 2013-04-16
WO2004077850A3 (fr) 2004-12-16
NO20054455L (no) 2005-09-26
CN1754393B (zh) 2011-06-08
KR20050110645A (ko) 2005-11-23
TW200520574A (en) 2005-06-16
TW200948101A (en) 2009-11-16
KR100752561B1 (ko) 2007-08-29
TW200423657A (en) 2004-11-01

Similar Documents

Publication Publication Date Title
JP4298744B2 (ja) 高速ダイナミックチャネル割当の無線リソース管理手順
US7110771B2 (en) Method for implementing fast-dynamic channel allocation call admission control for radio link reconfiguration in radio resource management
EP1596621B1 (fr) Appareil pour l'allocation de ressources radio
USRE47568E1 (en) Allocating resources for shared and non-shared downlink wireless resources
WO2008003815A1 (fr) Mécanisme d'attribution de ressources radio amélioré
JP2007135236A (ja) ハイブリッドｔｄｍａ／ｃｄｍａ通信システムにおけるチャネル割り当て
KR20070073618A (ko) 무선통신 시스템에서 채널품질정보 채널 할당 방법 및 장치
US8804550B2 (en) Method and apparatus for reuse of adaptive partial frequency in a cellular mobile communication system
EP1604476A2 (fr) Procede de mise en oeuvre d'une commande d'admission d'appel par allocation de canal dynamique rapide dans une gestion de ressources radio
US7065365B2 (en) Code tree fragmentation in call admission control
TW201403854A (zh) 有笑率分配無線資源之系統及方法
US7212826B2 (en) Method for implementing fast dynamic channel allocation escape mechanism in radio resource management
US7107060B2 (en) Method of optimizing an implementation of fast-dynamic channel allocation call admission control in radio resource management
US7136656B2 (en) Method of fast dynamic channel allocation call admission control for radio link addition in radio resource management
US7248878B2 (en) Information storage for radio resource management
US7130637B2 (en) Method for implementing fast dynamic channel allocation background interference reduction procedure in radio resource management
EP1473948B1 (fr) Procede d'affectation de canaux de trafic en communications mobiles gsm
KR101400508B1 (ko) 통신 시스템에서 자원 할당 시스템 및 방법

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

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20060627

17Q First examination report despatched

Effective date: 20061016

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

Owner name: INTERDIGITAL TECHNOLOGY 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: 20150901