Method for implementing fast dynamic channel allocation (F-DCA) call admission control in radio resource management

• US 7,106,708 B2
• Filed: 12/02/2003
• Issued: 09/12/2006
• Est. Priority Date: 02/19/2003
• Status: Expired due to Fees

• Current Assignee: Interdigital Technology Corporation (InterDigital, Inc.)
• Original Assignee: Interdigital Technology Corporation (InterDigital, Inc.)
• Inventors: Lu, Guang
• Primary Examiner(s): QURESHI, AFSAR M
• Application Number:
  US10/725,787
• Publication Number:
  US 20040162081A1
• Time in Patent Office: 1,015 Days
• Field of Search: 370/329, 370/436, 370/458, 370/330, 455/450, 455/452.1, 455/452.2
• US Class Current: 370/329
• CPC Class Codes: H04W 16/10 Dynamic resource partitioning
• CPC Class Codes: H04W 16/14 Spectrum sharing arrangements between different networks
• CPC Class Codes: H04W 24/10 Scheduling measurement reports ; Arrangements for measurement reports
• CPC Class Codes: H04W 72/0466 the resource being a scrambling code
• CPC Class Codes: H04W 72/541 using the level of interference
• CPC Class Codes: H04W 74/04 Scheduled access hybrid access H04W74/02
• CPC Class Codes: H04W 76/10 Connection setup

Abstract

A method for call admission control in a fast dynamic channel allocation wireless communication system begins by requesting that a call be admitted. System measurement results are obtained and timeslot sequences are generated by determining a figure of merit for each timeslot. A code set is determined and an attempt is made to assign a code set to a timeslot sequence, wherein each successful assignment is considered to be a solution. The solution having the lowest weighted total interference signal code power is selected, and codes are allocated for the selected solution. The physical resource allocation information is recorded and a response to the call admission request is issued.

Claims

1. A method for call admission control in a fast dynamic channel allocation wireless communication system, comprising the steps of:

requesting that a call be admitted;

obtaining measurement results;

generating timeslot sequences by determining a figure of merit for each timeslot;

determining a plurality of code sets;

assigning one of said plurality of code sets to one timeslot sequence, wherein a successful assignment of a code set to a timeslot sequence is considered to be a solution;

selecting the solution having the lowest weighted total interference signal code power (ISCP);

allocating codes for the selected solution;

recording a physical channel resource allocation information for the selected solution relating to the physical channel used; and

responding to the call admission request.

2. The method according to claim 1, wherein the obtaining step includes

collecting input parameters from the call admission request;

gathering the measurement results from a Node B and a wireless transmit/receive unit using the communication system;

retrieving a list of available timeslots; and

calculating the data rate.

3. The method according to claim 2, wherein the determining step is based upon the calculated data rate.

4. The method according to claim 1, wherein the figure of merit is a representation of the assignment quality of the timeslot.

5. The method according to claim 1, wherein the assigning step includes

selecting a code and a timeslot;

determining whether the code is available from a code vector of the selected timeslot;

evaluating whether the code can be supported in the selected timeslot; and

recording the code allocation information.

6. The method according to claim 5, wherein the selecting step includes

selecting a spreading factor from the code set;

examining a code in the selected spreading factor; and

selecting a timeslot from the timeslot sequence.

7. The method according to claim 5, wherein the evaluating step includes

determining whether the selected code satisfies the constraints of the wireless transmit/receive unit;

and

estimating the noise rise and the code transmission power that would result if the selected code is added to the selected timeslot.

8. The method according to claim 5, wherein the recording step includes updating the ISCP value.

9. The method according to claim 5, further comprising the step of recording the weighted ISCP value once a solution is found.

10. The method according to claim 5, wherein the steps are performed for each timeslot in the timeslot sequence.

11. The method according to claim 10, wherein the steps are performed for each code in the spreading factor.

12. The method according to claim 11, wherein the steps are performed for each spreading factor in the code set.

13. The method according to claim 1, wherein the allocating step includes updating a code tree.

14. The method according to claim 1, wherein the recording step includes storing the information in a centralized radio resource management information database.