×

Code tree fragmentation in call admission control

  • US 7,065,365 B2
  • Filed: 12/31/2003
  • Issued: 06/20/2006
  • Est. Priority Date: 09/30/2003
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method for assigning resources to users in a slotted wireless communication system having candidate timeslots, the method comprising:

  • an interference level is determined for each candidate timeslot;

    an amount of resources available for assignment in each candidate timeslot is determined;

    a measurement of fragmentation of codes in a orthogonal variable spreading factor (OVSF) tree in each candidate timeslot is determined;

    a Figure of Merit for each time slot is determined using the determined interference level, the amount of available resources and the code fragmentation in the OVSF tree for each candidate timeslot; and

    the resources are assigned from the candidate timeslot having a best Figure of Merit,wherein the determining the Figure of Merit for an ith timeslot is per
    Fi=−

    α

    ·

    Δ

    I
    i

    ·

    f
    (Ci)+FDiwhere Fi is the Figure of Merit for the ith timeslot, α and

    β

    are weighting parameters, Δ

    Ii is a difference between an interference signal code power (ISCP) measurement of the ith timeslot and a minimum ISCP measurement of all the candidate timeslots, f(Ci) is an amount of resource units that can be used by a coded composite transport channel (CCTrCH) of interest in the ith timeslot and FDi is a measure of OVSF code tree fragmentation in the ith timeslot.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×