JP4298744B2 - Radio resource management procedure for fast dynamic channel assignment - Google Patents

Radio resource management procedure for fast dynamic channel assignment Download PDF

Info

Publication number
JP4298744B2
JP4298744B2 JP2006501200A JP2006501200A JP4298744B2 JP 4298744 B2 JP4298744 B2 JP 4298744B2 JP 2006501200 A JP2006501200 A JP 2006501200A JP 2006501200 A JP2006501200 A JP 2006501200A JP 4298744 B2 JP4298744 B2 JP 4298744B2
Authority
JP
Japan
Prior art keywords
step
code
information
wtru
time slot
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.)
Expired - Fee Related
Application number
JP2006501200A
Other languages
Japanese (ja)
Other versions
JP2006520126A (en
Inventor
シユウ フィッシャー シャオチュン
Original Assignee
インターデイジタル テクノロジー コーポレーション
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 to US45092703P priority Critical
Priority to US45079303P priority
Priority to US45092403P priority
Priority to US45664403P priority
Priority to US46389303P priority
Priority to US10/744,800 priority patent/US7107060B2/en
Priority to US10/747,733 priority patent/US7212826B2/en
Priority to US10/747,297 priority patent/US7130637B2/en
Priority to US10/750,135 priority patent/US7110771B2/en
Priority to US10/750,129 priority patent/US7136656B2/en
Priority to PCT/US2004/005746 priority patent/WO2004077850A2/en
Application filed by インターデイジタル テクノロジー コーポレーション filed Critical インターデイジタル テクノロジー コーポレーション
Publication of JP2006520126A publication Critical patent/JP2006520126A/en
Application granted granted Critical
Publication of JP4298744B2 publication Critical patent/JP4298744B2/en
Application status is Expired - Fee Related legal-status Critical
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10Dynamic resource partitioning
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/04Wireless resource allocation
    • H04W72/08Wireless resource allocation where an allocation plan is defined based on quality criteria
    • H04W72/082Wireless resource allocation where an allocation plan is defined based on quality criteria using the level of interference
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14Spectrum sharing arrangements between different networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation where an allocation plan is defined based on the type of the allocated resource
    • H04W72/0466Wireless resource allocation where an allocation plan is defined based on the type of the allocated resource the resource being a scrambling code
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access, e.g. scheduled or random access
    • H04W74/04Scheduled or contention-free access

Description

  The present invention relates generally to radio resource management in a wireless communication system, and more particularly to implementation of radio resource management (RRM) procedures for fast dynamic channel allocation (F-DCA). .

  In a wireless communication system, the RRM is generally responsible for using air interface resources. By using RRM, quality of service (QoS) is guaranteed, efficient use of radio resources is achieved, and system capacity is increased. The RRM includes an authentication control function, a handover function, a power control function, and a congestion control function. Authentication control can be divided into user authentication control and call authentication control (CAC). The user authentication control accepts or rejects a radio resource control (RRC) connection requested by a radio transmission / reception unit (WTRU). Call authentication control accepts or rejects a request to establish or modify a radio access bearer (RAB) in a radio access network (RAN). Call authentication control is provided in a controlling radio network controller (C-RNC).

  There are two dynamic channel assignment (DCA) functions: slow DCA (S-DCA) and fast DCA (F-DCA). S-DCA allocates radio resources to cells, and F-DCA allocates radio resources to bearer services. The F-DCA call authentication control function is responsible for efficiently allocating or changing physical resource allocation. When receiving a request for a physical resource, the call authentication control accepts or rejects the request based on the availability of the physical resource and the interference level of the cell. The request can be accepted only if both the uplink and downlink call authentication controls grant the request. If not, the request is rejected.

  In order to guarantee QoS and minimize interference, certain F-DCA call authentication control algorithms are currently implemented. However, implementations prior to the F-DCA call authentication control algorithm have some limitations. The first limitation is that the main interface function is large and the input to the code assignment function (which forms the central function of the F-DCA call authentication control algorithm) depends on signaling messages, so other RRM functions It is difficult to reuse. The second limitation is that past implementations of F-DCA CAC algorithms are generally only suitable for real-time (RT) services.

  Two F-DCA functions that could belong to the form of the algorithm are performed by the RRM in steady state operation. One is for background interference reduction and the other is for escape mechanism.

  The F-DCA background interference reduction procedure is used to keep WTRU and system resource usage at a reasonable level at all times by reallocating radio resources (timeslots and codes) to existing radio bearers. Is done. The F-DCA background interference reduction procedure is periodically initiated by the RRM. The period at which the background interference reduction procedure is initiated is a design parameter. For example, in a preferred embodiment of the present invention, the period is 2 seconds. The background interference reduction procedure has a relatively low priority among the three F-DCA algorithms.

  The F-DCA escape mechanism is used to solve the user link problem. F-DCA's escape mechanism is for certain users (or part of user service) or base stations that experience high interference or cannot meet QoS by reallocating radio resources to existing radio bearers Used as an escape mechanism. The F-DCA escape mechanism operates in the cell for all WTRUs in steady state with real time (RT) service. The F-DCA escape mechanism does not apply to non-real-time (NRT) services.

  Since the output of one function can affect the determination of another function, it is desirable that only one F-DCA function operates at a given time in the C-RNC. If more than one of these functions is started at exactly the same time, the priority of these functions is that the escape procedure is executed first, the call authentication control is executed second, and the background interference reduction procedure is last. It will be executed.

  In order to maintain the required QoS, handover is used to switch radio links from one cell to another without call interruption. The radio link addition procedure is used to establish physical resources for a new radio link at a Node B where the WTRU already has a communication context associated with it when a handover is taking place.

  In time division duplex (TDD) mode, a radio link setup procedure is used to establish the necessary radio resources for a new radio link for real time (RT) or non real time (NRT) services. After the radio link is set up, a radio link reconfiguration procedure is used to add, modify, or delete any physical resources related to this existing radio link. The F-DCA CAC algorithm is activated upon receipt of the request message.

  It would be desirable to provide an optimized implementation of the F-DCA CAC algorithm that is suitable for RT and NRT services and overcomes the shortcomings of known algorithms. It would also be desirable to provide an improved escape mechanism and background interference reduction procedure implementation that both meet the above requirements. Furthermore, it is desirable to provide an optimized implementation of the F-DCA CAC algorithm for radio link addition and radio link reconfiguration that is suitable for RT and NRT services and overcomes the shortcomings of known algorithms.

  The present invention improves and improves the well-known F-DCA algorithm implementation by modularizing / classifying the functions of the F-DCA algorithms and creating inputs to the core channel assignment functions of these algorithms independent of signaling messages. Optimize. More specifically, some functions in the implementation prior to the F-DCA CAC algorithm are signal-dependent, but have been changed to be signal-independent by the present invention. , So that the changed functionality can be reused in the escape mechanism implementation. Although the present invention will be described in the context of layer 3 in a TDD scenario, the present invention can also be applied without limitation to other transmission methods.

  Ongoing third generation wireless communication system development requires new and efficient radio resource management. The present invention achieves optimization for the implementation of the F-DCA algorithm in RRM. The method of the present invention modularizes and modifies the implementation of the F-DCA algorithm into three processes: pre-code allocation, code allocation, and post-code allocation. The functions in the pre-code allocation process and the post-code allocation process are both signal-dependent, while the functions in the code allocation process are signal-independent. The pre-code assignment process is used to describe how and where information is retrieved from the input message and database, and how to prepare the necessary input for the code assignment process. The post code assignment process is used to determine what information is to be stored in the database and what information is to be provided in the output message. The modular functionality of the present invention can be reused by other RRM algorithms for both RT and NRT services.

  The present invention implements an F-DCA CAC algorithm implementation for radio link setup in RRM. A method for optimizing the F-DCA CAC algorithm 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 assignment process includes receiving and processing request messages and obtaining system measurements and information from a centralized database. The code assignment process begins by examining the usefulness of the cell's code and generating a time slot sequence for the available time slots. A code set is assigned to the available time slots in the time slot sequence and a successful assignment is the solution. An interference signal code power (ISCP) is calculated for each solution, and the solution with the lowest weighted ISCP is selected as the optimal solution. The post code allocation process includes storing the allocation information in a centralized database and creating a response message.

  A method for F-DCA CAC in a wireless communication system begins by receiving and processing a request message and initiating a CAC function. A Node B measurement, a list of available time slots, and a list of code sets are retrieved from the centralized database. A set of codes is assigned to available time slots and assignment information is stored in a centralized database. A response message is sent with the result of the code assignment process.

  The present invention provides a method for implementing an F-DCA escape mechanism in RRM. This method improves system efficiency by functioning as follows. An F-DCA escape mechanism is initiated by the RRM for a particular uplink or downlink coded composite transport channel (CCTrCH) of the WTRU when one of the following three conditions is met.

1) The downlink (DL) timeslot ISCP measured by the WTRU is greater than the threshold.
2) The uplink (UL) time slot ISCP measured by Node B is greater than the threshold. These two threshold values are design parameters and may be the same value or different values.
3) Node B reaches the maximum allowable transmission power.

  A method for implementing an F-DCA escape procedure in a wireless communication system includes a pre-code assignment procedure, a signal independent code assignment procedure, and a post-code assignment procedure. The prior code allocation procedure receives a trigger signal, acquires WTRU measurement values and Node B measurement values from the RRC shared cell database, acquires cell configuration information and WTRU information from the centralized database, and is a candidate CCTrCH to be reassigned And a candidate code set to be reassigned is determined. The code allocation procedure checks the code availability of the cell, checks the transmit power of the candidate time slot, checks whether the ISCP of the other time slot is lower than the ISCP of the candidate time slot, and the available time slot Generate a time slot sequence for and assign candidate code sets to available time slots in the time slot sequence (successful assignment is the solution), compute the ISCP for each solution, and have the lowest weighted ISCP Select the solution as the optimal solution. The post code allocation procedure stores reallocation information in a centralized database and creates a physical channel reconfiguration request message.

  A method for implementing an F-DCA escape mechanism in a wireless communication system begins by receiving and processing a trigger signal. WTRU measurements and Node B measurements are retrieved from the centralized database and physical resources to be reallocated are determined. Code sets are assigned to available time slots and assignment information is stored in a centralized database. A physical channel reconfiguration request message is sent containing new allocation information for this WTRU.

  The present invention provides a method for implementing an F-DCA background interference reduction procedure in RRM. A method for implementing an F-DCA background interference reduction procedure in a wireless communication system includes a pre-code assignment procedure, a signal independent code assignment procedure, and a post-code assignment procedure. The pre-code allocation procedure receives the background timer trigger signal, acquires both WTRU measurement values and Node B measurement values from the RRC shared cell database, acquires both cell information and WTRU information from the centralized database, and performs reassignment. Candidate time slots to be performed (one is the uplink direction, the other is the downlink direction), a list of available time slots to be used for reassignment is retrieved from the centralized database, and candidates to be reassigned Determine the code set. The code allocation procedure checks the usefulness of the code set of the cell, checks the transmit power of the candidate time slots, generates a time slot sequence for the available time slots, and uses the available time slots in the time slot sequence Assign a code set (successful assignment is the solution), compute the ISCP for each solution, and select the solution with the lowest weighted ISCP as the optimal solution. The post code allocation procedure stores reallocation information in a centralized database and creates a physical channel reconfiguration request message.

  A method for implementing an F-DCA background interference reduction procedure in a wireless communication system includes a pre-code assignment process, a signal independent code assignment process, and a post-code assignment process. The advance code assignment process starts by receiving a timer trigger signal. System measurements are retrieved from a centralized database. The physical resource to be reassigned is determined based on the goodness index. The code assignment process begins by examining the usefulness of the cell's code set and generating a time slot sequence for the available time slots. A code set is assigned to the available time slots in the time slot sequence and a successful assignment is the solution. An ISCP is calculated for each solution and the solution with the lowest weighted ISCP is selected as the optimal solution. Reassignment information is stored in a centralized database. A physical channel reconfiguration request message including assignment information is sent.

  The present invention implements an F-DCA CAC algorithm implementation for radio link addition procedure in RRM. A method for implementing an F-DCA CAC algorithm for adding a radio link 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 assignment process includes receiving and processing a radio link addition request message and obtaining system information from a centralized database. The code assignment process checks the usefulness of a cell's code set, generates a time slot sequence, assigns a code set to an available time slot in the time slot sequence (successful assignment is the solution) Calculating the ISCP for each solution, and selecting the solution with the lowest weighted ISCP as the optimal solution. The post code allocation process includes storing the allocation information in a centralized database and creating a radio link addition response message.

  A method for implementing an F-DCA CAC algorithm for adding a radio link in a wireless communication system begins by receiving a radio link addition request message and initiating a CAC function. The request message is processed and a list of available time slots and a list of code sets are retrieved from the centralized database. The code set is assigned to the available time slot of the new cell and the assignment information is stored in a centralized database. A radio link addition response message is then sent along with the result of the code assignment process.

  The present invention implements an F-DCA CAC algorithm implementation for radio link reconfiguration procedure in RRM. A method for 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 assignment process includes receiving and processing request messages and retrieving system information from a centralized database. The code assignment process checks the usefulness of a cell's code set, generates a time slot sequence, assigns a code set to an available time slot in the time slot sequence (successful assignment is the solution) Calculating an ISCP for each solution, and selecting the solution with the lowest weighted ISCP as the optimal solution. The post code allocation process includes storing the allocation information in a centralized database and creating a response message.

  A method for F-DCA for radio link reconfiguration in a wireless communication system begins by receiving a request message and initiating a CAC function. The request message is processed and a list of available time slots and a list of code sets are retrieved from the centralized database. Code sets are assigned to available time slots and assignment information is stored in a centralized database. A response message is then sent with the result of the code assignment process.

  A more detailed understanding of the present invention can be obtained from the following description of preferred embodiments, given by way of example and to be understood in conjunction with the accompanying drawings wherein:

(Call authentication control for wireless link setup)
An overview of the F-DCA CAC algorithm for the radio link setup procedure 102 is shown in FIG. The main function of the F-DCA CAC algorithm 102 includes three parts: a pre-code allocation process 104, a code allocation process 106, and a post-code allocation process 108. The pre-code allocation process 104 reads the WTRU measurement from the radio link setup request message 110, reads the Node B measurement from the RRC shared cell database 112, and inputs for code allocation (available time from the RRM cell database 116). Prepare a list of slots and a list of code sets from the operations and maintenance (OAM) RRM table database 114).

  The code assignment process 106 checks the code usefulness of the cells, generates a time slot sequence, finds the optimal solution for the code set (assigns the codes in the code set to available time slots), Assign a channelization code from the code vector. The post code assignment process 108 is responsible for creating a WTRU entity in the RRM WTRU database 118, recording the physical channel assigned in the RRM WTRU database 118, and recording the physical channel parameters and power control information in the radio link setup response message 120. Take on.

  In addition to data exchange between processes and databases, there is data exchange that takes place directly between processes. WTRU measurements, Node B measurements, a list of available time slots in the cell, a list of code sets for a particular data rate, and WTRU capability information are passed from the pre-code assignment process 104 to the code assignment process 106. . Physical channel information (a list of time slots and channelization codes in each time slot) is passed from the code assignment process 106 to the post-code assignment process 108.

  In the present invention, the functions of the F-DCA CAC algorithm for the radio link setup procedure 102 are two: a signal dependent function whose input is part of a signal message and a signal independent function whose input is independent of the signal message. Modularized into two groups of functions. The purpose of separating the signal-dependent function from the signal-independent function is to improve the reusability of the signal-independent function. The functions of the pre-code allocation process 104 and the post-code allocation process 108 are both signal-dependent functions. In contrast, the function of the code assignment process 106 is a signal independent function. Note that the function of the code assignment process 106 can be reused in other procedures during the implementation of other RRM functions, such as handover, F-DCA escape algorithm, F-DCA background interference reduction algorithm.

  Flow charts relating to the functionality of the F-DCA CAC algorithm for radio link setup are shown in FIGS. 2a-2c and 3a-3b. 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 an RL setup request message (hereinafter referred to as a “request message”) (step 202) and extracting parameters from the request message (step 204). The request message includes coded composite transfer 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 WTRU identification, cell identification, RL identification, and WTRU capability information (maximum number of physical channels per time slot and maximum number of time slots per frame).

  The RRM cell database entry identification is acquired (step 206). Next, a determination is made as to whether a WTRU measurement value including downlink interference signal code power (DL ISCP) is included in the request message (step 208). If the WTRU measurement is not included in the request message, a check is made to determine if all of the DCH is non-real time (NRT) (steps 210 and 212). If all DCHs are not NRT, a status flag is set to indicate a failure condition (step 214) and the function ends (step 216). A failed state means that there are no physical resources available to the WTRU. Note that it is not a failure state that all DCHs are not NRT. The failure state is reached when there are no WTRU measurements and all DCHs are not NRT.

  If all DCHs are NRT (step 212), a slow temporary DCH is assigned to the current CCTrCH (step 218). After assigning the channel, it is determined whether the resource assignment is successful (step 220). If resource allocation is not successful, a status flag is set to indicate a failure condition (step 214) and the function ends (step 216). If the resource allocation is successful (step 220), a WTRU entity is created and WTRU information and physical channel parameters are recorded in the RRM WTRU database (step 222). Information recorded in the WTRU entity includes WTRU identification, transaction identification, uplink (UL) WTRU capability information, DL WTRU capability information, and RL information. The UL WTRU capability information includes the maximum number of time slots per frame and the maximum number of UL physical channels per time slot. The DL WTRU capability information includes the maximum number of time slots per frame and the maximum number of DL physical channels per frame. The RL information includes RL identification, cell identification, UL CCTrCH information, and DL CCTrCH information. CCTrCH information includes CCTrCH identification, CCTrCH state, CCTrCH signal to interference ratio (SIR) target, guaranteed data rate, allowable data rate, and dedicated physical channel (DPCH) information. The DPCH information includes a list of time slots, a midshift and a burst type, the presence of a transfer format code indication (TFCI), and code information. The code information includes channelization code, code usage status, DPCH identification, and code SIR target.

  Next, physical channel information and power control information are placed in the RL setup response message (step 224), a status flag is set to indicate a successful state (step 226), and the function ends (step 216). The physical channel information includes a list of time slots and channelization codes within each time slot. The time slot information includes a repetition period and a repetition length. The power control information includes a UL target SIR, a maximum UL SIR, a minimum UL SIR, an initial DL transmission power, a minimum DL transmission power, and a maximum allowable UL transmission power. In one implementation of the invention, a single data structure is used for both request and response messages. This is because these two messages contain a large amount of common information.

  If the WTRU measurement is available in the request message (step 208), the WTRU measurement is retrieved from the request message and the Node B measurement is obtained from the RRC shared cell database (step 228). The Node B measurement value includes a common measurement value and a dedicated measurement value. Node B common measurements include UL ISCP and DL transmit carrier power. The Node B dedicated measurement value includes the DL transmission code output. The first DL CCTrCH is selected (step 230), and the service type for the selected CCTrCH is acquired (step 232). If the service type is real time (RT) (step 234), the available time slots in the cell are determined (step 236). If the time slot is not available (step 238), a status flag is set to indicate a failure state (step 214) and the function ends (step 216).

  If no time slot is available (step 238), the required data rate is calculated (step 240). A code set for the calculated data rate is obtained (step 242), physical channels (time slots and codes) for the current CCTrCH are assigned, and if an optimal solution is found, it is recorded (step 244). The assignment function at step 244 is discussed in more detail below in connection with FIGS. 3a and 3b. If resource allocation is not successful (step 246), a status flag is set to indicate a failure state (step 214) and the function ends (step 216).

  If resource allocation is successful (step 246), a determination is made whether there are additional CCTrCHs to consider (step 248). If there are additional CCTrCHs to consider, select the next CCTrCH (step 250) and the function proceeds to step 232; If there are no additional CCTrCHs to be examined (step 248), it is determined whether the UL CCTrCH has been examined (step 252). If the UL CCTrCH is not considered, the first UL CCTrCH is selected (step 254) and the function proceeds to step 232. If all UL CCTrCHs are considered (step 252), the function proceeds to step 222 described above.

  If the service type is NRT (step 234), an available time slot in the cell is determined (step 256). If the time slot is not available (step 258), the status flag is set to indicate a failure state (step 214) and the function ends (step 216).

  If there are available time slots (step 258), all data rates suitable for NRT service are determined (step 260) and the highest data rate is selected (step 262). A code set for the selected data rate is obtained (step 264), a normal temporary DCH for the current CCTrCH is assigned, and if an optimal solution is found, it is recorded (step 266). Note that steps 244 and 266 may be essentially the same. In the NRT service, the DCH is temporary.

  If resource allocation was not successful (step 268), a determination is made whether there are additional data rates to consider (step 270). If there are no other data rates to consider, a status flag is set to indicate a failure condition (step 214) and the function ends (step 216). If there are other data rates to consider (step 270), the next higher data rate is selected (step 272) and the function proceeds to step 264. If the resource allocation is successful (step 268), the function proceeds to step 248 described above.

  Note that either direction (DL or UL) can be performed first in relation to steps 230, 252, and 254. As mentioned above, the DL direction is considered before the UL direction. Instead, function 200 operates in the same way when considering UL before DL.

  Steps 244 and 266 relate to invoking the central function of the F-DCA algorithm to allocate physical channels. The central function 300 is signal independent and is described in connection with FIGS. 3a and 3b. The function 300 begins by receiving a code set and an available time slot as input (step 302). A 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). If the selected code set is not available in the cell, a determination is made whether there is another code set to consider (step 310). If another code set exists, the next code set is selected (step 312) and the function proceeds to step 306. If there is no other code set, this indicates a failure condition, sets a status flag to indicate that no solution is available (step 314), and the function ends (step 316).

  If the selected code set is available in the cell (step 308), the required resource units for the code set in CCTrCH are calculated (step 318). A time slot sequence is generated (step 320) and a first time slot sequence is selected (step 322). Next, it is determined whether the link direction is DL or UL (step 350). If the link direction is DL, an attempt is made to allocate the current DL code set within an available time slot in the current time slot sequence (step 352). If the link direction is UL (step 350), an attempt is made to allocate the current UL code set within an available time slot in the current time slot sequence (step 354). In an alternative embodiment of the present invention (not shown), step 350 can be eliminated and steps 352 and 354 can be combined into a single step to achieve additional optimization.

  After attempting to assign the current code set to an available time slot in the current time slot sequence (steps 352, 354), the code set is successfully assigned to an available time slot in the current time slot sequence. It is determined whether or not an allocation solution indicating this has been found (step 356). If a solution is found, determine the ISCP of the solution and record the solution with the lowest weighted ISCP as the optimal solution (step 358). If no solution is found (step 356), step 358 is skipped.

  A determination is then made whether there are any additional time slot sequences to consider (step 360). If there are additional time slot sequences, the next time slot sequence is selected (step 362) and the function proceeds to step 350. If there is no additional time slot sequence (step 360), a determination is made whether an optimal solution has been found (step 364). If no optimal solution is found, the function proceeds to point C in the caller function (ie, the function from which it entered step 350). If an optimal solution is found, a status flag is set to indicate successful assignment (step 366) and the function ends (step 316).

  In past implementations of the F-DCA CAC algorithm, functions 352 and 354 are signal dependent. In the present invention, these two functions are modified to be signal independent functions. All related functions used in these two functions are also modified to be signal independent functions. Since the inputs of functions 352, 354 are independent of signaling messages (such as input messages), functions 352, 354 can be used in other RRM procedures. Note that the above implementation of the F-DCA CAC algorithm is an example and can be further optimized.

(escape)
An overview 400 of the F-DCA escape procedure 402 is shown in FIG. The main function of the F-DCA escape procedure 402 includes three parts: a pre-code assignment process 404, a code assignment process 406, and a post-code assignment process 408. The pre-code assignment process 404 starts when the measurement trigger signal 410 is received. There are two measurement trigger signals, a WTRU measurement trigger signal and a Node B measurement trigger signal. The WTRU measurement trigger signal includes a list of WTRU identifications and time slot numbers, and the Node B measurement trigger signal includes time slot numbers. The escape procedure begins upon receipt of a WTRU measurement trigger signal or a Node B measurement trigger signal.

  The pre-code allocation process 404 acquires Node B measurement values and WTRU measurement values from the RRC shared cell database 412, acquires cell configuration information from the RRM cell database 416, acquires WTRU capability information from the RRM WTRU database 418, and re- Determine the CCTrCH to be assigned, calculate the WTRU path loss, determine the candidate code set to be reassigned, and obtain a list of available time slots. The pre-code assignment process 404 prepares input for the code assignment process 406.

  The code assignment process 406 checks the code availability in the cell, checks the transmit (Tx) power of the candidate time slot, checks whether the ISCP of the other time slot is lower than the ISCP of the candidate time slot, Generate a time slot sequence for the available time slots, find an assignment solution for the code sets in the time slot sequence (by assigning candidate code sets to available time slots), and have the solution with the lowest weighted ISCP. Is selected as the optimal solution. The post code allocation process 408 is responsible for recording the newly allocated physical channel in the RRM WTRU database 418 and putting the physical channel information in the physical channel reconfiguration request message 420.

  In addition to data exchange between processes and databases, there are data exchanges that take place directly between processes. WTRU measurements, Node B measurements, list of available time slots in the cell, candidate code sets, and WTRU capability information are passed from pre-code assignment process 404 to code assignment process 406. Physical channel information (a list of time slots and channelization codes in each time slot) is passed from the code assignment process 406 to the post-code assignment process 408.

  In the present invention, the function of the F-DCA escape algorithm 402 is modularized into two groups of functions: a signal dependent function whose input is part of a signal message and a signal independent function whose input is independent of the signal message. Is done. The purpose of separating the signal-dependent function from the signal-independent function is to improve the reusability of the signal-independent function. The functions of the pre-code allocation process 404 and the post-code allocation process 408 are both signal-dependent functions. In contrast, the function of the code assignment process 406 is a signal independent function. Therefore, the reusability of the signal independent function is higher than the reusability of the signal dependent function. Some functions that are signal-dependent in nature are converted from signal-dependent to signal-independent in a preferred embodiment of the present invention, thereby improving the reusability of post-conversion functions.

  Flow charts for the function of the F-DCA escape procedure are shown in FIGS. 5a, 5b, and 6. FIG. FIGS. 5a and 5b show a flowchart of the main escape algorithm 500, which begins by receiving input from a trigger signal (step 502). The RRM cell database entry identification is retrieved from the RRM cell database (step 504). WTRU measurements and Node B measurements are retrieved from the shared cell database (step 506). Determine the link direction of the time slot with the link problem (step 508) and locate the time slot with the worst link problem.

  Based on how to start the escape mechanism, a candidate CCTrCH to be reassigned is determined (step 510). When an escape procedure is triggered by a WTRU's too high DL ISCP in a time slot, the WTRU's CCTrCH in this time slot is a candidate to reassign. The DL ISCP is measured by the WTRU, in which case the escape procedure is triggered by the WTRU measurement signal.

  When the escape procedure is triggered by a UL ISCP that is too high during the time slot, the CCTrCH with the code using the sum of the highest SIR and the path loss is a candidate to be reassigned. When the escape procedure is triggered by a Node B transmit carrier output that is too high, the CCTrCH with the code using the highest Node B transmit code output is a candidate to be reassigned. Both UL ISCP and Node B transmit carrier power are measured by Node B, and in either of these cases the escape procedure is triggered by a Node B measurement signal.

  If no candidate CCTrCH is found (step 512), a status flag is set to indicate a failure state (step 514) and the procedure ends (step 516). If a candidate CCTrCH is found (step 512), WTRU capability information is retrieved from the RRM WTRU database (step 518). WTRU path loss is calculated (step 520) and a candidate code set to be reassigned is determined (step 522). Whether the updated ISCP for a given time slot is less than the ISCP threshold, or the updated time slot transmit power is less than the transmit power threshold after this set of codes is removed from the time slot with link problems A candidate code set is determined based on whether or not. In this determination, both the ISCP threshold and the transmission power threshold are design parameters. If there is no code set to be reassigned (step 524), a status flag is set to indicate a failure state (step 514) and the procedure ends (step 516).

  If there is a code set to be reassigned (step 524), the available time slots for the code to be reassigned are retrieved from the centralized database (step 526). If there are no available time slots (step 528), a status flag is set to indicate a failed state (step 514) and the procedure ends (step 516). If there are available time slots (step 528), physical channels (time slots and codes) are assigned to the CCTrCH (step 530).

  If physical channel allocation is not successful (step 532), a status flag is set to indicate a failure state (step 514) and the procedure ends (step 516). If resource allocation is successful (step 532), the new physical channel information is recorded in the RRM WTRU database (step 534). Only if the optimal solution is found, the resource allocation (step 532) is considered successful. The physical channel information includes a list of dedicated physical channel time slot information, a repetition period value, and a repetition length value. Dedicated physical channel time slot information includes a time slot number, midimble shift and burst type, presence of TFCI, and a list of code information. The code information includes channelization code, code usage status, DPCH identification, and code SIR target.

  Physical channel information is also placed in the physical channel reconfiguration request message (step 536), a status flag is set to indicate successful allocation (step 538), and the procedure ends (step 516). The physical channel reconfiguration request message includes the following information. WTRU identification, C-RNC identification, radio link identification, radio resource control transaction identification, UL CCTrCH information, and DL CCTrCH information.

  Step 530 involves calling the central function of the F-DCA escape procedure to allocate physical channels. This central function 600 is signal independent and will be described in connection with FIGS. 6 and 3b. The function 600 begins by receiving as input the code set, available time slots, and F-DCA type indication (step 602). A 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), a determination is made whether there is another code set to consider (step 610). If another code set exists, the next code set is selected (step 612) and the function proceeds to step 606. If another code set does not exist (step 610), this indicates a failure condition, a status flag is set to indicate that no solution is available (step 314 in FIG. 3b), and the function ends (FIG. 3b, step 316).

  If the selected code set is available in the cell (step 608), the F-DCA type is checked (step 618). Set F-DCA type based on various RRM functions such as radio bearer setup ("RBSETUP"), escape mechanism, or background interference reduction. In the escape procedure, the F-DCA type can be set to “ESCAPE” and set in any step before step 530 above. If the F-DCA type is “ESCAPE”, the transmission output of the candidate time slot is examined to determine whether it is greater than the required minimum transmission power (step 620). If the candidate time slot transmit power is less than the minimum value (step 622), a status flag is set to indicate that no solution is available (step 314) and the function ends (step 316 of FIG. 3b).

  If the candidate time slot transmit power is greater than the minimum value (step 622), a check is made to determine if there are any time slots with an ISCP lower than the time slot reporting the link problem (step 624). If there are no other time slots with lower ISCP (step 626), a status flag is set to indicate that no solution is available (step 314 in FIG. 3b) and the function ends (step in FIG. 3b). 316).

  If there is another time slot with a lower ISCP (step 626), or if the F-DCA type is “RBSETUP” (step 618), calculate the required resource units for the code set in CCTrCH (Step 640). A time slot sequence is generated for available time slots (step 642) and a first time slot sequence is selected (step 644). The method then proceeds to step 350 described above in connection with FIG. 3b. The steps performed when the F-DCA type is “background” (step 618) are discussed below.

(Background interference reduction)
An overview 700 of the F-DCA background interference reduction procedure 702 is shown in FIG. The main function of the F-DCA background interference reduction procedure 702 includes three parts: a pre-code allocation process 704, a post-code allocation process 706, and an allocation process 708. The pre-code allocation process 704 starts upon reception of the background timer trigger signal 710. The pre-code allocation process 704 acquires the entry identification of the RRM cell database 716, acquires the Node B measurement value from the RRC shared cell database 712, determines the candidate time slot to be reassigned (one UL time slot and One DL timeslot), a list of available timeslots used for reassignment is retrieved from the RRM cell database 716, and candidate code sets to be reassigned in candidate timeslots in both directions are determined, RRM WTRU capability information is obtained from the WTRU database 718 and WTRU path loss is calculated.

  The code assignment process 706 checks the code availability in the cell, checks the transmission (Tx) power of the candidate time slots, and sets the code set for the time slot sequence (by assigning the candidate code set to an available time slot). Find the assigned solution for, and select the solution with the lowest weighted ISCP as the optimal solution. The post code allocation process 708 is responsible for recording the reallocated physical channel in the RRM WTRU database 718 and putting the physical channel information in the physical channel reconfiguration request message 720.

  In addition to data exchange between processes and databases, there are data exchanges that take place directly between processes. WTRU measurements, Node B measurements, list of available time slots in the cell, candidate code sets, and WTRU capability information are passed from pre-code assignment process 704 to code assignment process 706. Physical channel information (a list of time slots and channelization codes in each time slot) is passed from the code assignment process 706 to the post-code assignment process 708.

  In the present invention, the functions of the F-DCA background interference reduction procedure 702 are divided into two groups of functions: a signal dependent function whose input is part of a signal message and a signal independent function whose input is independent of the signal message. Is modularized. The purpose of separating the signal-dependent function from the signal-independent function is to improve the reusability of the signal-independent function. The functions of the pre-code allocation process 704 and the post-code allocation process 708 are both signal-dependent functions. In contrast, the function of the code assignment process 706 is a signal independent function. Therefore, the reusability of the signal independent function is higher than the reusability of the signal dependent function. Some functions that are signal-dependent in nature are converted from signal-dependent to signal-independent in a preferred embodiment of the present invention, thereby improving the reusability of post-conversion functions.

  Flow charts relating to the function of the F-DCA background interference reduction procedure are shown in FIGS. 8a, 8b, 6, and 3b. FIGS. 8a and 8b show a flowchart of the main background interference reduction procedure 800, which begins by retrieving the entry identification of the RRM cell database (step 804) (step 802). WTRU measurements and Node B measurements are retrieved from the shared cell database (step 806). Candidate time slots for reassignment, one UL time slot and one DL time slot are determined based on the time slot merit index (step 808). The time slot with the lowest merit index is selected as a candidate for reassignment. If there is no time slot to be reassigned (step 810), the status flag is set to indicate a failure state (step 812) and the procedure ends (step 814). If there is a time slot to be reassigned (step 810), the link direction is set to downlink (step 816). Note that the order of link direction evaluation is arbitrary, and UL or DL can be evaluated first.

  The available time slots in the cell for the selected link direction are retrieved (step 818). If there are no available time slots (step 820), the status flag is set to indicate a failure state (step 812) and the procedure ends (step 814). If there are available time slots (step 820), the list of available time slots is updated to exclude candidate time slots (step 822). A candidate code set to be reassigned in the candidate time slot is determined based on the code merit index (step 824). The code with the lowest merit index is selected as a candidate for reassignment. If there is no code set to be reassigned (step 826), a status flag is set to indicate a failure state (step 812) and the procedure ends (step 814). If there is a code set to be reassigned (step 826), WTRU capability information is retrieved from the WTRU database (step 828).

  The path loss of the WTRU is calculated (step 830), and physical channel reallocation for the current CCTrCH is performed (step 832). If channel reassignment was not successful (step 834), a status flag is set to indicate a failure state (step 812) and the procedure ends (step 814). If channel reassignment is successful (step 834), it is determined whether the link direction is currently UL (step 836). If the link direction is currently DL, the link direction is set to UL (step 838) and the method proceeds to step 818.

  If the current link direction is UL (step 836), it is determined whether the UL CCTrCH and DL CCTrCH to be reassigned belong to the same WTRU (step 840). If the CCTrCH to be reassigned belongs to different WTRUs, a flag is set to indicate that two different WTRUs should be reassigned (step 842). If the CCTrCH belongs to the same WTRU (step 840) or the flag is set (step 842), the physical channel assignment information is recorded in the RRM WTRU database (step 844). The physical channel information includes a list of dedicated physical channel time slot information, a repetition period value, and a repetition length value. Dedicated physical channel time slot information includes a time slot number, midimble shift and burst type, presence of TFCI, and a list of code information. The code information includes channelization code, code usage status, DPCH identification, and code SIR target.

  The physical channel allocation information is also recorded in the physical channel reconfiguration request message (step 846), the status flag is set to indicate “success” (step 848), and the procedure ends (step 814). If the flag indicates that two WTRUs have CCTrCH to be reallocated (step 842), record the corresponding physical channel information for the two WTRUs (step 844) and send two physical channel reconfiguration request messages (step 844) Step 846). The physical channel reconfiguration request message includes the following information. WTRU identification, C-RNC identification, radio link identification, radio resource control transaction identification, UL CCTrCH information, and DL CCTrCH information.

  Step 832 relates to invoking the central function of the F-DCA background interference reduction procedure to perform physical channel reassignment. This central function is signal independent and will be described in connection with FIGS. 6 and 3b. The function 600 operates in the same manner as described above, and the following additional steps are performed in connection with the background interference reduction procedure. In the background interference reduction procedure, the F-DCA type can be set to “BACKGROUND” and set at any step before step 832 above. If the F-DCA type is “BACKGROUND” (step 618), the transmission power of the candidate time slot is examined to determine whether it is greater than the required minimum transmission power (step 630). If the candidate time slot transmit power is less than the minimum value (step 632), a status flag is set to indicate that no solution is available (step 314 in FIG. 3b) and the function ends (step 316 in FIG. 3b). ). If the transmission power of the candidate time slot is greater than the minimum transmission power (step 632), the procedure proceeds to step 640 described above.

(Call authentication control for adding wireless link)
An overview 900 of the F-DCA CAC procedure for add radio link 902 is shown in FIG. The main function of the F-DCA CAC procedure 902 includes three parts: a pre-code assignment process 904, a code assignment process 906, and a post-assignment process 908. The prior code allocation process 904 reads the WTRU measurement value from the radio link addition request message 910 (hereinafter “request message”), reads the Node B measurement value from the RRC shared cell database 912, and reads the CCTrCH information and DCH information from the RRM WTRU database 918. , And retrieve WTRU capability information. The pre-code allocation process 904 also retrieves a list of available time slots in the new cell from the RRM cell database 916, obtains the data rate for CCTrCH from the RRM WTRU database 918, and retrieves the code set from the OAM RRM table database 914. get.

  The code allocation process 906 checks the code availability in the new cell, generates a time slot sequence for the available time slots, and finds the optimal solution for the code set (the code in the code set in the available time slot). Assign channelization codes from code vectors in the RRM cell database 916. Subsequent code allocation process 908 updates code vector information in RRM cell database 916, records radio link information and physical channel information in RRM WTRU database 918, CCTrCH information, DCH information, DPCH information, UL ISCP information, and The power control information is recorded in the radio link addition response message 920.

  In addition to data exchange between processes and databases, there is data exchange that takes place directly between processes. WTRU measurements, Node B measurements, a list of available time slots in the cell, a list of code sets for a particular data rate, and WTRU capability information are passed from pre-code assignment process 904 to code assignment process 906. . Physical channel information (a list of time slots and channelization codes in each time slot) is passed from the code assignment process 906 to the post-code assignment process 908.

  In the present invention, the functions of the F-DCA CAC procedure for radio link addition 902 are divided into two functions: a signal dependent function whose input is part of a signal message and a signal independent function whose input is independent of the signal message. Modularized into group functions. The purpose of separating the signal-dependent function from the signal-independent function is to improve the reusability of the signal-independent function. The functions of the pre-code allocation process 904 and the post-code allocation process 908 are both signal-dependent functions. In contrast, the function of the code assignment process 906 is a signal independent function. The reusability of the signal independent function is higher than the reusability of the signal dependent function. Some functions that are signal-dependent in nature are converted from signal-dependent to signal-independent in a preferred embodiment of the present invention, thereby improving the reusability of post-conversion functions.

  Flow charts for the functions of the F-DCA CAC procedure for adding radio links are shown in FIGS. FIGS. 10a-10c show the main interface function 1000 for F-DCA CAC for the RL addition procedure. The function 1000 begins by obtaining an RL add request message (step 1002) and extracting the WTRU identity, new radio link identity, and new cell identity from the request message (step 1004). The request message also includes new RL information with or without WTRU measurements.

  An entry identification of a new cell in the RRM cell database is obtained (step 1006). Node B measurements for the new cell are obtained from the RRC shared cell database and stored locally in the measurement data structure (step 1008). The measurement data structure is dynamically stored in the F-DCA CAC function. The measurement data structure is created after the F-DCA CAC function is called and deleted when the F-DCA CAC ends. The Node B measurement value includes a common measurement value and a dedicated measurement value. Node B common measurements include UL ISCP information and DL transmit carrier output. The Node B dedicated measurement value includes the DL transmission code output. The old cell identification is then retrieved from the RRM WTRU database based on the WTRU ID. CCTrCH information and DCH information belonging to the radio link of the WTRU in the old cell are extracted from the RRM WTRU database (step 1010).

  Next, it is determined whether the request message includes a WTRU measurement value including DL ISCP and downlink primary common control physical channel received signal code power (P-CCPCH RSCP) (step 1012). If the WTRU measurement is not included in the request message, the service type is retrieved from the RRM WTRU information (step 1014) and a check is made to determine if all of the DCH is NRT (step 1016).

  If all DCHs are not NRT, a status flag is set to indicate a failure state (step 1018) and the function ends (step 1020). The failure state here means that there is not enough information to further process the function. Note that it is not a failure state that all DCHs are not NRT. A failure state is reached when there are no WTRU measurements and all of the DCHs are not NRT. If all of the DCH is NRT (step 1016), a low-speed temporary DCH is assigned to both UL CCTrCH and DL CCTrCH (step 1022). After assigning the channel, it is determined whether the resource assignment is successful (step 1024). If resource allocation is not successful, a status flag is set to indicate a failure condition (step 1018) and the function ends (step 1020). If resource allocation is successful, new RL information and physical channel information are recorded in the RRM WTRU database and the code vector information in the RRM cell database is updated (step 1026).

  The recorded information includes new RL information and a new RRC transaction identification. The RL information includes RL identification, cell identification, UL CCTrCH information, and DL CCTrCH information. CCTrCH information includes CCTrCH identification, CCTrCH state, CCTrCH SIR target, guaranteed data rate, allowable data rate, and DPCH information. The DPCH information includes a list of DPCH time slot information, a repetition period value, and a repetition length value. The DPCH time slot information includes a time slot number, midimble shift and burst type, presence of TFCI, and a list of code information. The code information includes channelization code, code usage status, DPCH identification, and code SIR target.

  The updated code vector information includes both UL code vector information and DL code vector information. UL code vector information includes code identification, code block display, and code usage status. The DL code vector information includes code identification and code usage status.

  If a WTRU measurement is available in the request message (step 1012), the WTRU measurement is retrieved from the request message and stored locally (step 1032). A first DL CCTrCH is selected (step 1034) and WTRU capability information is retrieved from the RRM WTRU database based on the WTRU identification, link direction, and 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), an available time slot in the cell is determined (step 1042). If there are no available time slots (step 1044), a status flag is set to indicate a failure state (step 1018) and the procedure ends (step 1020).

  If there is an available time slot in the new cell (step 1044), the highest data rate required for this CCTrCH in the old cell is retrieved from the RRM WTRU database (step 1046). A code set for the required data rate is obtained (step 1048), a physical channel (time slot and code) for the current CCTrCH is assigned, and if an optimal solution is found, it is recorded (step 1050). The assignment function at step 1050 was discussed in more detail above in connection with FIGS. 3a and 3b. If resource allocation is not successful (step 1052), a status flag is set to indicate a failure state (step 1018) and the procedure ends (step 1020).

  If resource allocation is successful (step 1052), a determination is made whether there are additional CCTrCHs in the current direction to be considered (ie, downlink or uplink) (step 1054). If there are additional CCTrCHs to consider, the next CCTrCH is selected (step 1056) and the procedure proceeds to step 1038. If there is no additional CCTrCH to be examined (step 1054), it is determined whether the UL CCTrCH has been examined (step 1058). If the UL CCTrCH is not considered, the first UL CCTrCH is selected (step 1060) and the procedure proceeds to step 1036. If all of the UL CCTrCHs are considered (step 1058), the procedure proceeds to step 1026 described above.

  Next, CCTrCH information with newly allocated physical channel information, DCH information, UL time slot ISCP information, and power control information are arranged in the RL addition response message (step 1028), and a status flag is set to indicate a successful status. (Step 1030), the procedure ends (Step 1020). CCTrCH information includes CCTrCH identification and DPCH information. The DPCH information includes a list of time slot information, a repetition period, and a repetition length. The DPCH time slot information includes a time slot number, midimble shift and burst type, presence of TFCI, and a list of code information. The code information includes a channelization code and a DPCH identification. The DCH information includes diversity display and selection diversity display. The power control information includes a UL target SIR, a maximum UL SIR, a minimum UL SIR, an initial DL transmission power, a maximum DL transmission power, and a minimum DL transmission power.

  If the service type is NRT (step 1040), an available time slot in the new cell is determined (step 1062). If the time slot in the new cell is not available (step 1064), the status flag is set to indicate a failure state (step 1018) and the procedure ends (step 1020).

  If there are time slots available in the new cell (step 1064), all data rates suitable for the CCTrCH NRT service are retrieved from the RRM WTRU database (step 1066) and the highest data rate is selected (step 1068). ). A code set for the selected data rate is obtained (step 1070), a normal temporary DCH for the current CCTrCH is assigned, and if an optimal solution is found, it is recorded (step 1072). Note that steps 1050 and 1072 are essentially the same. In the NRT service, the DCH is temporary. If resource allocation was not successful (step 1074), a determination is made whether there are additional data rates to consider (step 1076). If there are no other data rates to consider, a status flag is set to indicate a failure condition (step 1018) and the procedure ends (step 1020). If there are other data rates to consider (step 1076), the next higher data rate is selected (step 1078) and the function proceeds to step 1070. If resource allocation is successful (step 1074), the function proceeds to step 1054 described above.

  Note that either direction (DL or UL) can be performed first in relation to steps 1034, 1058, and 1060. As mentioned above, the DL direction is considered before the UL direction. Instead, function 1000 operates in the same way when considering UL before DL.

  Steps 1050 and 1072 relate to invoking the channel assignment function of the F-DCA algorithm. This central function 300 is signal independent and operates in the same manner as described above in connection with FIGS. 3a and 3b.

(Call authentication control for wireless link reconfiguration)
An overview 1100 of the F-DCA CAC procedure for radio link reconfiguration 1102 is shown in FIG. The F-DCA CAC procedure 1102 includes three parts: a pre-code assignment process 1104, a code assignment process 1106, and a post-code assignment process 1108. Pre-code allocation process 1104 retrieves WTRU information from radio link reconfiguration preparation message 1110 and retrieves WTRU capability information from RRM WTRU database 1118. Retrieve WTRU measurements and Node B measurements from RRC shared cell database 1112. A list of available time slots is obtained from the RRM cell database 1116 and a code set is retrieved from the OAM RRM table database 1114.

  The code assignment process 1106 checks the code usefulness in the cell, generates a time slot sequence, finds the optimal solution for the code set (assigns the code in the code set to an available time slot, and in the RRM cell database 1116 Channelization codes from the code vectors). The post-code allocation process 1108 updates the code vector information in the RRM cell database 1116, records the allocated physical channel in the RRM WTRU database 1118, and records the physical channel parameters and power control information in the radio link reconfiguration preparation message 1120. To do.

  In addition to data exchange between processes and databases, there is data exchange that takes place directly between processes. WTRU measurements, Node B measurements, a list of available time slots in the cell, a list of code sets for a particular data rate, and WTRU capability information are passed from pre-code assignment process 1104 to code assignment process 106. . Physical channel information (a list of time slots and channelization codes in each time slot) is passed from the code assignment process 1106 to the post-code assignment process 1108.

  In the present invention, the functions of the F-DCA CAC procedure for radio link reconfiguration 1102 are two: a signal dependent function whose input is part of a signal message and a signal independent function whose input is independent of the signal message. Modularized into two groups of functions. The purpose of separating the signal-dependent function from the signal-independent function is to improve the reusability of the signal-independent function. The functions of the pre-code allocation process 1104 and the post-code allocation process 1108 are both signal-dependent functions. In contrast, the function of the code assignment process 1106 is a signal independent function. It should be noted that the function of the code assignment process 1106 can be reused in other procedures during implementation of other RRM functions.

  Flow charts relating to the function of the F-DCA CAC procedure for radio link reconfiguration are shown in FIGS. 12 and 13a-13c. FIG. 12 shows a flowchart of an F-DCA CAC main interface procedure 1200 for a radio link reconfiguration procedure. Procedure 1200 begins by obtaining an RL reconfiguration preparation message (hereinafter referred to as a “preparation message”) (step 1202). The prepare message includes CCTrCH information (for CCTrCH to be added or modified), DCH information (for DCH to be added or modified), and RL information with or without WTRU measurements. WTRU measurements include DL ISCP and DL P-CCPCH RSCP. Extract the WTRU identity and RL identity from the prepare message and retrieve the cell identity from the WTRU database (step 1204). Next, the entry identification of the RRM cell database is acquired (step 1206).

  A data structure is created and the measured values are stored locally (step 1208). This measurement data structure is dynamically stored in the F-DCA CAC function. The measurement data structure is created after the F-DCA CAC is called and is deleted when the F-DCA CAC function is terminated. Next, the Node B measurement value is extracted from the RRC shared cell database and stored locally (step 1210). The Node B measurement value includes a common measurement value and a dedicated measurement value. Node B common measurements include UL ISCP and DL transmit carrier power. The Node B dedicated measurement value includes the DL transmission code output.

  The measurement data structure includes a list of cell measurement records. The cell measurement record includes a cell identification and a list of time slot measurement records. The time slot measurement record includes a list of time slot numbers, time slot ISCP, time slot carrier output, and code measurement records. The code measurement record consists of WTRU identification, radio link identification, DPCH identification, and code transmission power.

  If the WTRU measurement value is included in the preparation message (step 1212), the WTRU measurement value is extracted from the preparation message and stored locally in the measurement data structure (step 1214). A physical channel is then allocated for the CCTrCH to be added or modified (step 1216). Note that the code assignment procedure (step 1216) is the same whether CCTrCH should be added or modified. The channel assignment procedure is discussed in more detail below in connection with FIGS. If the physical channel assignment is successful (step 1218), a status flag is set to indicate a successful state (step 1220) and the procedure ends (step 1222). If the channel assignment is not successful (step 1218), a status flag is set to indicate a failure state (step 1224) and the procedure ends (step 1222).

  If the WTRU measurement is not included in the preparation message (step 1212), a determination is made whether all of the DCH is NRT (step 1226). If all DCHs are not NRT, this indicates a failure condition, sets a status flag to indicate a failure condition (step 1224), and the procedure ends (step 1222). If all DCHs are NRT (step 1228), the RL reconfiguration type is determined (step 1230). Set RL configuration type based on CCTrCH in RL. If the CCTrCH is to be added, set the RL configuration type to “ADDITION”. If the CCTrCH is to be modified, set the RL configuration type to “MODIFY”.

  If the RL reconstruction type is “MODIFY”, this indicates a failure state, sets a state flag to indicate a failure state (step 1224), and the procedure ends (step 1222). The failure state indicates that there is not enough information to process the request further. A failure state is reached when the RL configuration type is “MODIFY” and the RL reconfiguration message does not contain a WTRU measurement.

  When the RL reconfiguration type is “ADDITION” (step 1230), a low-speed temporary DCH is allocated to the CCTrCH to be added (step 1032). The procedure then proceeds to step 1218 described above.

  FIGS. 13a to 13c show a flowchart of the channel assignment procedure 1300 used in step 1216 of the F-DCA CACR reconfiguration procedure 1200. FIG. Procedure 1300 begins by obtaining a prepare message (step 1302) and extracting the WTRU and RL identifications from the prepare message (step 1304).

  The first DL CCTrCH is selected (step 1306) and the WTRU capability is 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), an available time slot for RT in the cell is determined (step 1314). If the time slot is not available (step 1316), this indicates a failed state, a status flag is set to indicate the failed state (step 1318), and the procedure ends (step 1320).

  If there are available time slots (step 1316), the block error rate (BLER) for the selected CCTrCH is determined (step 1322) and the required data rate is calculated (step 1324). A code set for the calculated data rate is obtained (step 1326), physical channels (time slots and codes) for the selected CCTrCH are assigned, and if an optimal solution is found, it is recorded (step 1328). The assignment function at step 1328 was discussed in more detail above in connection with FIGS. 3a and 3b. If resource allocation is not successful (step 1330), a status flag is set to indicate a failure state (step 1318) and the function ends (step 1320).

  If resource allocation is successful (step 1330), a determination is made whether there are additional CCTrCHs in the current direction to be considered (ie, DL or UL) (step 1332). If there are additional CCTrCHs to consider, select the next CCTrCH in the current direction (step 1334) and the procedure proceeds to step 1310. If there are no additional CCTrCHs to consider (step 1332), a determination is made as to whether the UL CCTrCH has been considered (step 1336). If the UL CCTrCH is not considered, the first UL CCTrCH is selected (step 1338) and the procedure proceeds to step 1308. If all UL CCTrCHs are considered (step 1336), the WTRU information and physical channel information in the RRM WTRU database are updated, and the code vector information in the RRM cell database is updated (step 1340).

  The updated WTRU information includes both UL CCTrCH information (for CCTrCH to be added or modified) and DL CCTrCH information (for CCTrCH to be added or modified) with newly allocated physical channel information. CCTrCH information includes CCTrCH identification, CCTrCH state, CCTrCH SIR target, guaranteed data rate, allowable data rate, and DPCH information. The DPCH information includes a list of DPCH time slot information, a repetition period, and a repetition length. The DPCH time slot information includes a time slot number, midimble shift and burst type, presence of TFCI, and a list of code information. The code information includes channelization code, code usage status, DPCH identification, and code SIR target. The code vector information includes UL code vector information and DL code vector information. UL code vector information includes code identification, code block display, and code usage status. The DL code vector information includes code identification and code usage status.

  The physical channel information and power control information are then placed in the RL reconfiguration preparation message (step 1342), a status flag is set to indicate successful resource allocation (step 1344), and the procedure ends (step 1320). The physical channel information includes a list of time slot information, a repetition period, and a repetition length. The time slot information includes a time slot number, midimble shift and burst type, presence of TFCI, and a list of code information. The code information includes a channelization code and a DPCH identification. The power control information includes an initial DL transmission power, a maximum DL transmission power, a minimum DL transmission power, a maximum UL SIR, and a minimum UL SIR. In one implementation of the invention, a single data structure is used for both request and response messages. This is because these two messages contain a lot of common information.

  If the service type for the selected CCTrCH is NRT (step 1312), an available time slot for the NRT in the cell is determined (step 1346). If the time slot is not available (step 1348), the status flag is set to indicate a failure state (step 1318) and the procedure ends (step 1320). If there is an available time slot (step 1348), the BLER for the selected CCTrCH is determined (step 1350). All data rates suitable for NRT service are determined (step 1352) and the highest data rate is selected (step 1354). A code set for the selected data rate is obtained (step 1356), a normal temporary DCH for the selected CCTrCH is assigned, and if an optimal solution is found, it is recorded (step 1358). Note that steps 1328 and 1358 may be essentially identical. In the NRT service, the DCH is temporary.

  If resource allocation was not successful (step 1360), a determination is made whether there are additional data rates to consider (step 1362). If there are no other data rates to consider, a status flag is set to indicate a failure condition (step 1318) and the procedure ends (step 1320). If there are other data rates to consider (step 1362), the next higher data rate is selected (step 1364) and the procedure proceeds to step 1356. If resource allocation is successful (step 1360), the procedure proceeds to step 1332 described above.

  Note that either direction (DL or UL) can be performed first in relation to steps 1306, 1336, and 1338. As mentioned above, the DL direction is considered before the UL direction. The procedure 1300 operates in the same way if the UL is considered before the DL instead.

  Steps 1328 and 1358 relate to invoking the channel assignment function of the F-DCA algorithm. This central function is signal independent and was described above in connection with FIGS. 3a and 3b.

  Although the preferred embodiment has been described in connection with a 3rd generation partnership program (3GPP) wideband code division multiple access (W-CDMA) system using time division duplex (TDD) mode, the embodiment is not limited to any hybrid code division. It is applicable to a multiple access (CDMA) time division multiple access (TDMA) communication system. Further, some embodiments are applicable to CDMA systems that commonly use beamforming, such as 3GPP W-CDMA's proposed frequency division duplex (FDD) mode. While particular embodiments of the present invention have been illustrated and described, many modifications and changes can be made by those skilled in the art without departing from the scope of the invention. The above description is illustrative and is not intended to limit the particular invention in any way.

FIG. 3 illustrates an overview of an F-DCA CAC algorithm for a radio link setup procedure. 2 is a flowchart of an F-DCA CAC algorithm for the radio link setup procedure shown in FIG. 2 is a flowchart of an F-DCA CAC algorithm for the radio link setup procedure shown in FIG. 2 is a flowchart of an F-DCA CAC algorithm for the radio link setup procedure shown in FIG. 3 is a flowchart regarding a channel allocation function for the F-DCA CAC algorithm shown in FIG. 3 is a flowchart regarding a channel allocation function for the F-DCA CAC algorithm shown in FIG. FIG. 6 shows an overview of an F-DCA escape procedure according to the present invention. It is a flowchart which shows the F-DCA escape procedure shown in FIG. It is a flowchart which shows the F-DCA escape procedure shown in FIG. FIG. 6 is a flowchart showing a first part regarding a channel assignment function for the F-DCA escape procedure shown in FIGS. 5a and 5b. It is a figure which shows the general view of the F-DCA background interference reduction procedure by this invention. It is a flowchart which shows the F-DCA background interference reduction procedure shown in FIG. It is a flowchart which shows the F-DCA background interference reduction procedure shown in FIG. FIG. 6 shows an overview of the F-DCA CAC procedure for adding a radio link according to the present invention. 10 is a flowchart of the F-DCA CAC procedure shown in FIG. 9. 10 is a flowchart of the F-DCA CAC procedure shown in FIG. 9. 10 is a flowchart of the F-DCA CAC procedure shown in FIG. 9. FIG. 6 shows an overview of the F-DCA CAC procedure for radio link reconfiguration according to the present invention. 12 is a flowchart of an F-DCA CAC procedure for radio link reconfiguration shown in FIG. 11. 13 is a flowchart of a physical channel allocation procedure of the F-DCA CAC procedure for radio link reconfiguration shown in FIG. 12. 13 is a flowchart of a physical channel allocation procedure of the F-DCA CAC procedure for radio link reconfiguration shown in FIG. 12. 13 is a flowchart of a physical channel allocation procedure of the F-DCA CAC procedure for radio link reconfiguration shown in FIG. 12.

Claims (17)

  1. A method for performing call authentication control (CAC) of high-speed dynamic channel assignment in a wireless communication system, comprising:
    Receiving a request message and initiating a CAC function;
    Processing the request message;
    Obtaining Node B measurements from a centralized database;
    Retrieving a list of available time slots and a list of code sets from the centralized database;
    Assigning code sets to available time slots in a time slot sequence;
    Storing allocation information in the centralized database;
    Sending a response message with the result of the code assignment process.
  2. 2. The method of claim 1 , wherein the step of processing includes reading a wireless transmit / receive unit (WTRU) measurement, WTRU coded composite transport channel information, and dedicated channel information from the request message. .
  3. 3. The method of claim 2 , wherein the WTRU measurement includes downlink interference signal code power.
  4. The method of claim 1 , wherein the retrieving step comprises reading Node B measurements from the centralized database.
  5. The measured value of Node B is
    Common measurements including uplink interference signal code power and downlink transmit carrier power;
    5. The method of claim 4 , comprising: a dedicated measurement value including downlink transmission code power.
  6. Said assigning step comprises:
    Checking the usefulness of the code set of the cell;
    Generating a timeslot sequence from the list of available timeslots;
    The method of claim 1 , comprising: assigning a code set to the available time slots in a time slot sequence to find a solution, and wherein a successful assignment is a solution.
  7. Said assigning step comprises:
    Calculating an interference signal code power (ISCP) value for the solution;
    The method according to claim 6, characterized in that it comprises the step of selecting the solution with the lowest weighted ISCP value as an optimal solution.
  8. The storing step includes:
    Creating an entity of a wireless transmit / receive unit (WTRU) in the centralized database;
    Recording WTRU information from the request message in the centralized database;
    The method of claim 1 , comprising: recording physical channel information in the centralized database.
  9. The WTRU information recorded in the centralized database is
    WTRU identification and
    Transaction identification,
    Uplink WTRU capability information including the maximum number of time slots per frame and the maximum number of uplink physical channels per time slot;
    Downlink WTRU capability information including the maximum number of timeslots per frame and the maximum number of downlink physical channels per timeslot;
    9. The method of claim 8 , comprising: radio link information.
  10. The radio link information is
    Radio link identification,
    Cell identification,
    Uplink code complex transport channel (CCTrCH) information;
    The method according to claim 9, characterized in that it comprises a CCTrCH information downlink.
  11. The CCTrCH information is:
    CCTrCH identification;
    CCTrCH state;
    CCTrCH signal to interference ratio target;
    Guaranteed data rate, and
    Allowable data rate,
    The method according to claim 10 , comprising: dedicated physical channel information.
  12. The dedicated physical channel information is
    Time slot information of dedicated physical channel,
    The repetition period value;
    The method of claim 11 , comprising: a repetition length value.
  13. The dedicated physical channel information is
    Timeslot number and
    With midamble shift and burst type,
    The presence of transfer format combination instructions,
    13. The method of claim 12 , comprising code information.
  14. The code information is
    Channelization code,
    The code usage state,
    Dedicated physical channel identification,
    The method of claim 13 , comprising: a code signal versus interference target.
  15. The method of claim 1 , wherein the sending comprises including power control information and physical channel information in the response message.
  16. The power control information is
    Uplink (UL) target signal to interference ratio (SIR);
    The maximum UL SIR,
    The smallest UL SIR,
    Initial downlink (DL) transmit power and
    Minimum DL transmit power,
    16. The method of claim 15 , comprising a maximum allowable UL transmit power.
  17. The physical channel information is
    A list of timeslots,
    16. The method of claim 15 , comprising a channelization code in each time slot.
JP2006501200A 2003-02-27 2004-02-26 Radio resource management procedure for fast dynamic channel assignment Expired - Fee Related JP4298744B2 (en)

Priority Applications (11)

Application Number Priority Date Filing Date Title
US45092703P true 2003-02-27 2003-02-27
US45079303P true 2003-02-27 2003-02-27
US45092403P true 2003-02-27 2003-02-27
US45664403P true 2003-03-20 2003-03-20
US46389303P true 2003-04-17 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,733 US7212826B2 (en) 2003-02-27 2003-12-29 Method for implementing fast dynamic channel allocation escape mechanism 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/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
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
PCT/US2004/005746 WO2004077850A2 (en) 2003-02-27 2004-02-26 Method for implementing fast-dynamic channel allocation radio resource management procedures

Publications (2)

Publication Number Publication Date
JP2006520126A JP2006520126A (en) 2006-08-31
JP4298744B2 true JP4298744B2 (en) 2009-07-22

Family

ID=32931807

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2006501200A Expired - Fee Related JP4298744B2 (en) 2003-02-27 2004-02-26 Radio resource management procedure for fast dynamic channel assignment

Country Status (9)

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

Families Citing this family (44)

* 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
US9137822B2 (en) 2004-07-21 2015-09-15 Qualcomm Incorporated Efficient signaling over access channel
US9148256B2 (en) 2004-07-21 2015-09-29 Qualcomm Incorporated Performance based rank prediction for MIMO design
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
US9461859B2 (en) 2005-03-17 2016-10-04 Qualcomm Incorporated Pilot signal transmission for an orthogonal frequency division wireless 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
US9184870B2 (en) 2005-04-01 2015-11-10 Qualcomm Incorporated Systems and methods for control channel signaling
US9408220B2 (en) 2005-04-19 2016-08-02 Qualcomm Incorporated Channel quality reporting for adaptive sectorization
US9036538B2 (en) 2005-04-19 2015-05-19 Qualcomm Incorporated Frequency hopping design for single carrier FDMA systems
US8462859B2 (en) 2005-06-01 2013-06-11 Qualcomm Incorporated Sphere decoding apparatus
US9179319B2 (en) 2005-06-16 2015-11-03 Qualcomm Incorporated Adaptive sectorization in cellular systems
US8599945B2 (en) 2005-06-16 2013-12-03 Qualcomm Incorporated Robust rank prediction for a MIMO system
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 (en) 2005-09-07 2008-11-05 中兴通讯股份有限公司 Asynchronous reconfiguration method for physical channel transmitting power of multi wireless links
US9225488B2 (en) 2005-10-27 2015-12-29 Qualcomm Incorporated Shared signaling channel
US9172453B2 (en) 2005-10-27 2015-10-27 Qualcomm Incorporated Method and apparatus for pre-coding frequency division duplexing system
US9144060B2 (en) 2005-10-27 2015-09-22 Qualcomm Incorporated Resource allocation for shared signaling channels
US8879511B2 (en) 2005-10-27 2014-11-04 Qualcomm Incorporated Assignment acknowledgement for a wireless communication system
US8045512B2 (en) 2005-10-27 2011-10-25 Qualcomm Incorporated Scalable frequency band operation in wireless communication systems
US9210651B2 (en) 2005-10-27 2015-12-08 Qualcomm Incorporated Method and apparatus for bootstraping information in a communication system
US8565194B2 (en) 2005-10-27 2013-10-22 Qualcomm Incorporated Puncturing signaling channel for a wireless communication system
US9225416B2 (en) 2005-10-27 2015-12-29 Qualcomm Incorporated Varied signaling channels for a reverse link in a wireless communication system
US8477684B2 (en) 2005-10-27 2013-07-02 Qualcomm Incorporated Acknowledgement of control messages in a wireless communication system
US8693405B2 (en) 2005-10-27 2014-04-08 Qualcomm Incorporated SDMA resource management
US8582509B2 (en) 2005-10-27 2013-11-12 Qualcomm Incorporated Scalable frequency band operation in wireless communication systems
US9088384B2 (en) 2005-10-27 2015-07-21 Qualcomm Incorporated Pilot symbol transmission 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 (en) * 2006-01-05 2007-05-30 삼성전자주식회사 Wireless communication device and method for searching the wireless communication device
KR101300880B1 (en) * 2006-08-21 2013-08-27 인터디지탈 테크날러지 코포레이션 Dynamic resource allocation, scheduling and signaling for variable data rate service in lte
KR100964446B1 (en) * 2008-02-15 2010-06-16 에스케이 텔레콤주식회사 Method and system for allocating a channel in downlink
CN101835166B (en) 2009-03-09 2012-12-12 上海贝尔股份有限公司 Channel allocation optimization method and channel allocation optimization equipment
CN101621847B (en) * 2009-08-06 2011-12-07 中兴通讯股份有限公司 Acquisition method and a terminal 3g radio resource management messages
US9496972B2 (en) 2010-03-08 2016-11-15 Htc Corporation Communication devices and methods thereof
CN103269487B (en) * 2013-04-22 2018-02-02 中国人民解放军理工大学通信工程学院 Dynamic disturbance management method based on game theory in femtocell network downlink

Family Cites Families (10)

* 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
FI106162B (en) * 1997-02-14 2000-11-30 Nokia Networks Oy The channel allocation method
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
US6119011A (en) * 1998-03-05 2000-09-12 Lucent Technologies Inc. Cost-function-based dynamic channel assignment for a cellular system
US6956840B1 (en) * 1998-09-21 2005-10-18 Ipr Licensing, Inc. Power control protocol for highly variable data rate reverse link of a wireless communication system
CA2287685A1 (en) * 1998-12-07 2000-06-07 Arun Narayan Netravali Dynamic bandwidth and symmetry allocation of digital subscriber line channels
US6721568B1 (en) * 1999-11-10 2004-04-13 Telefonaktiebolaget Lm Ericsson (Publ) Admission control in a mobile radio communications system
WO2002005441A2 (en) * 2000-07-10 2002-01-17 Interdigital Technology Corporation Code power measurement for dynamic channel allocation
WO2002052875A2 (en) 2000-12-27 2002-07-04 Ensemble Communications, Inc. Adaptive call admission control for use in a wireless communication system
US6850500B2 (en) * 2001-05-15 2005-02-01 Interdigital Technology Corporation Transmission power level estimation

Also Published As

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

Similar Documents

Publication Publication Date Title
KR101039334B1 (en) Improved radio resource allocation mechanism
DK1997334T3 (en) Measuring supported dynamic frequency re-use in mobile telecommunications networks
CN1141004C (en) Radio communication system, method for time slot and frequency and method of optimization distribution
DE60104273T2 (en) Radio resource allocation method and base station using the same
JP5353850B2 (en) Method, base station and mobile station for TDD operation in a communication system
JP3744542B2 (en) Adaptive channel assignment method and apparatus with power control in a mobile communication system
RU2197791C2 (en) Computer-aided planning of control channels in adaptive channel allocation systems
EP0975186B1 (en) Burst-level resource allocation in cellular systems
RU2208913C2 (en) Facility for dispatching and process of execution of services of transmission of package data in wireless communication system
CN1243426C (en) Channel assigning device and method in CDMA communication system
JP3844968B2 (en) Call admission control apparatus and method
JP4084639B2 (en) Admission control method in mobile communication, mobile communication system, mobile station, admission control device, and admission control program
KR100401210B1 (en) Apparatus for allocating common channel in code division multiple access mobile communication system and method thereof
EP1228585B1 (en) Method and apparatus for allocating resources in hybrid tdma communication systems
US6414947B1 (en) Communication network and method of allocating resource therefor
CA2184772C (en) Code division multiple access system providing load and interference based demand assignment service to users
JP2005500764A (en) Interference reduction in time division duplex systems using code division multiple access
JP4619621B2 (en) Radio resource management
KR101084142B1 (en) Method for transmitting and receiving data on downlink shared channel
US6442151B1 (en) System and method for variable reassignment of transmission channels
KR20110086470A (en) Method and apparatus for scheduling resource allocation to contorl inter-cell interference in a cellular communication system
US7821983B2 (en) Effective dynamic management scheme of HS-DSCH channel codes
Jeong et al. CDMA/TDD system for wireless multimedia services with traffic unbalance between uplink and downlink
CA2349220C (en) Dedicated control channel handoff in cdma communication system
JP4300237B2 (en) Uplink scheduling method for wireless mobile communication system

Legal Events

Date Code Title Description
A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20080829

A521 Written amendment

Free format text: JAPANESE INTERMEDIATE CODE: A523

Effective date: 20081126

TRDD Decision of grant or rejection written
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 20090317

A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

A61 First payment of annual fees (during grant procedure)

Free format text: JAPANESE INTERMEDIATE CODE: A61

Effective date: 20090415

R150 Certificate of patent (=grant) or registration of utility model

Free format text: JAPANESE INTERMEDIATE CODE: R150

FPAY Renewal fee payment (prs date is renewal date of database)

Free format text: PAYMENT UNTIL: 20120424

Year of fee payment: 3

FPAY Renewal fee payment (prs date is renewal date of database)

Free format text: PAYMENT UNTIL: 20120424

Year of fee payment: 3

FPAY Renewal fee payment (prs date is renewal date of database)

Free format text: PAYMENT UNTIL: 20130424

Year of fee payment: 4

FPAY Renewal fee payment (prs date is renewal date of database)

Free format text: PAYMENT UNTIL: 20130424

Year of fee payment: 4

FPAY Renewal fee payment (prs date is renewal date of database)

Free format text: PAYMENT UNTIL: 20140424

Year of fee payment: 5

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

LAPS Cancellation because of no payment of annual fees