초록 ▼

The invention includes a system and methods for orthogonal variable spreading factor (OVSF) code assignment, de-allocation and code tree pruning. The invention also includes OVSF code identification and storage schemes. Embodiments are provided for code tree pruning, code assignment and de-allocatio

The invention includes a system and methods for orthogonal variable spreading factor (OVSF) code assignment, de-allocation and code tree pruning. The invention also includes OVSF code identification and storage schemes. Embodiments are provided for code tree pruning, code assignment and de-allocation. These embodiments apply to both slotted and non-slotted code division multiple access systems.

대표청구항 ▼

What is claimed is: 1. A method for reassigning codes of an orthogonal variable spreading factor (OVSF) code tree, the code tree having a plurality of codes at differing spreading factors and having a plurality of branches between the codes of different spreading factors, if a particular code of th

What is claimed is: 1. A method for reassigning codes of an orthogonal variable spreading factor (OVSF) code tree, the code tree having a plurality of codes at differing spreading factors and having a plurality of branches between the codes of different spreading factors, if a particular code of the code tree is assigned, a lower spreading factor code of the code tree connected to that code by one of the branches is blocked from assignment, if a code of the code tree is blocked, a code of the tree of a lower spreading factor connected to that code by one of the branches is blocked from assignment, the method comprising: for each spreading factor, starting at a first spreading factor: determining selected assigned codes of that spreading factor that can be reassigned to other codes of that spreading factor in a desired direction of the code tree; and reassigning the selected assigned codes to the other codes. 2. The method of claim 1 wherein the other codes are within a same time slot as the selected codes. 3. The method of claim 1 wherein at the least one of the other codes is in a different time slot than the selected codes. 4. The method of claim 1 wherein said determining and said reassigning are only performed if under a threshold number of codes are blocked in a time slot. 5. The method of claim 1 wherein a number of the reassigned codes is limited. 6. The method of claim 1 wherein the first spreading factor is a highest spreading factor. 7. A radio network controller (RNC) having a radio resource management device, the radio resource management device having a memory for storing a representation of an orthogonal variable spreading factor (OVSF) code tree, the code tree having a plurality of codes at differing spreading factors and having a plurality of branches between the codes of different spreading factors, if a particular code of the code tree is assigned, a lower spreading factor code of the code tree connected to that code by one of the branches is blocked from assignment, if a code of the code tree is blocked, a code of the tree of a lower spreading factor connected to that code by one of the branches is blocked from assignment, the radio resource management device configured to: for each spreading factor, starting at a highest spreading factor and proceeding to each successively smaller spreading factor: determine selected assigned codes of that spreading factor that can be reassigned to other codes of that spreading factor in a desired direction of the code tree; and reassign the selected assigned codes to the other codes. 8. The RNC of claim 7 wherein the other codes are within a same time slot as the selected codes. 9. The RNC of claim 7 wherein at the least one of the other codes is in a different time slot than the selected codes. 10. The RNC of claim 7 wherein the radio resource management device is configured to determine selected assigned codes and reassign the selected assigned codes only if under a threshold number of codes are blocked in a time slot. 11. The RNC of claim 7 wherein a number of the reassigned codes is limited. 12. The RNC of claim 7 wherein the representation of the code tree is stored as a vector. 13. The RNC of claim 12 wherein the vector includes an element for each code of the code tree in sequence. 14. The RNC of claim 13 wherein all the elements of codes having a same spreading factor are contiguous. 15. The RNC of claim 13 wherein each element has two bits, one bit of the two bits indicating whether the code of that element is blocked and another bit of the two bits indicating whether one or multiple codes are blocked by the code of that element. 16. A method for indicating code availability for codes in an orthogonal variable spreading factor (OVSF) code tree for use in code allocation, the method comprising: assigning each code an indicator, the indicator having two bits, a first of the two bits indicating whether the code is blocked by use of another code and a second of the two bits indicating whether the code is blocked by one or two codes. 17. The method of claim 16 wherein the first bit having a value of 0 indicates that the code is not blocked and the first bit having a value of 1 indicating that the code is blocked and the second bit having a value of 0 indicating that the code is blocked by one code and the second bit having a value of 1 indicating that the code is blocked by two codes.