CN100571090C - Orthogonal variable spread-spectrum factor code tree state storage, distribution and method for releasing and device - Google Patents
Orthogonal variable spread-spectrum factor code tree state storage, distribution and method for releasing and device Download PDFInfo
- Publication number
- CN100571090C CN100571090C CNB2004100668762A CN200410066876A CN100571090C CN 100571090 C CN100571090 C CN 100571090C CN B2004100668762 A CNB2004100668762 A CN B2004100668762A CN 200410066876 A CN200410066876 A CN 200410066876A CN 100571090 C CN100571090 C CN 100571090C
- Authority
- CN
- China
- Prior art keywords
- sign indicating
- indicating number
- yard
- memory cell
- assigned
- 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.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a kind of variable spread-spectrum factor code tree state storage means, comprising following steps: a plurality of memory cell of distributing the state of the leaf node of storing variable spread-spectrum factor code tree respectively; Described memory cell is initialized as upstate; During sign indicating number in distributing this variable spread-spectrum factor code tree, corresponding to as be assigned with yard the memory cell of all leaf nodes be set to down state; And when discharging a sign indicating number, be set to upstate corresponding to memory cell as all leaf nodes of d/d yard.The present invention also provides a kind of variable bandspread factor code distribution and method for releasing and equipment thereof based on above-mentioned storage means.Method and apparatus of the present invention can efficiently utilize memory space, simplifies handling process and reduces the processing complexity, and quicken to distribute and discharge the processing of variable bandspread factor code.
Description
Technical field
The present invention relates to a kind of Wideband Code Division Multiple Access (WCDMA) communication means and device, particularly a kind of orthogonal variable spread-spectrum factor code tree state storage, distribution and method for releasing and device that is used for Wideband Code Division Multiple Access (WCDMA) communication system.
Background technology
Orthogonal variable frequency extension factor code (Orthogonal Variable Spreading Factor-OVSF) is to be used to data rate that provides variable and the technological means that keeps the interchannel quadrature in Wideband Code Division Multiple Access (WCDMA) (WCDMA) communication system.As the limited rare resource of number in the system, be related to the performance of whole WCDMA communication system for the reasonable use of ovsf code.
Show as the form of binary tree with reference to the definition of 3GPP TS 25.213 ovsf codes trees, as shown in Figure 1.
In Fig. 1, suppose that the descending ovsf code of WCDMA is expressed as C
SF, NCode, wherein SF represents the spreading factor length of this yard, though in Fig. 1, be expressed as SF=1, SF=2 ..., according to the standard of 3GPP, the span of the SF of descending OVSF spreading code is 2 a n power in 4～512.NCode represents the sign indicating number sequence number of this yard this sublayer on code tree, and span is 0～SF-1.C then
SF, NCodeThe data rate that can provide is 512/SF * R, and wherein R is a basic bit rate.
Adopt which kind of form to represent ovsf code tree user mode in reality in to the use of code tree, determined the service efficiency of actual code management method.
Existing management method for the ovsf code tree is based on the binary tree data-interface representation of code tree more, promptly adopts two-dimensional array or linked list data structure form.
No matter be to adopt two-dimensional array or linked list data structure to represent current ovsf code tree user mode, all can on the memory space of data message, cause certain waste.
For example adopt the form of two-dimensional array to represent current code tree user mode, at first on data space, will cause very big waste.Because for a complete binary tree, its interstitial content one has 2
n-1, wherein n is the number of plies of binary tree.A two-dimensional array will represent that the complete binary tree of n layer then needs to define n * 2
N-1Individual data, so the space availability ratio of this two-dimensional array has only (2
n-1)/n * 2
N-1For the ovsf code tree that current WCDMA system adopts, the span of the OVSF spreading code that it is descending is 4～512, i.e. Ci Shi n=10.The two-dimensional array structure of this moment its space availability ratio when storage ovsf code tree information has only (2
10-4)/8 * 2
9≈ 0.25, and visual data memory space utilance is very low.A general radio network controller (RNC) will be managed a hundreds of sub-district, and bigger waste all to such ovsf code tree state data structure should be arranged, then can be caused in each sub-district in the internal storage structure of RNC.
In addition, because the orthogonal property of ovsf code adopts existing two-dimensional array or linked list data structure form to preserve the ovsf code tree state, the complexity that also can cause handling in the actual mechanical process that carries out the sign indicating number management increases.Because the distribution or the release of a sign indicating number occur at every turn, all can cause state information modification for the generation of the father and son up and down sign indicating number of this yard, will need the traversal queries operation is carried out in the code tree sublayer that relates to, increased the complexity of handling.
Summary of the invention
For fear of the waste of the memory space of ovsf code state and the distribution and the release of simplification and acceleration ovsf code.Proposed the storage of a kind of ovsf code efficiently tree user mode, distribution and method for releasing in the present invention and made in this way device.
According to an aspect of the present invention, provide a kind of variable spread-spectrum factor code tree state storage means, comprising following steps: a plurality of memory cell of distributing the state of the leaf node of storing variable spread-spectrum factor code tree respectively at this; Described memory cell is initialized as upstate; During sign indicating number in distributing this variable spread-spectrum factor code tree, corresponding to as be assigned with yard the memory cell of all leaf nodes be set to down state; And when discharging a sign indicating number, be set to upstate corresponding to memory cell as all leaf nodes of d/d yard.
According to another aspect of the present invention, provide a kind of variable bandspread factor code distribution method, comprising following steps: use variable spread-spectrum factor code tree state storage means according to the present invention to store variable spread-spectrum factor code tree state in advance at this; According to the message transmission rate of request, the spreading factor length of the sign indicating number that calculating should distribute; According to the spreading factor length of being calculated, search whether there is such sign indicating number with spreading factor length of being calculated, make that the state corresponding to all leaf sign indicating numbers of this yard all is available; And if find the sign indicating number that has the spreading factor length of being calculated like this, then distribute this sign indicating number, and storage is set to corresponding to the numerical value of memory cell of the state of all leaf nodes of the sign indicating number that is assigned with unavailablely, otherwise return the information that can not distribute.
According to a further aspect of the invention, provide a kind of variable bandspread factor code method for releasing, comprising following steps: use variable spread-spectrum factor code tree state storage means according to the present invention to store variable spread-spectrum factor code tree state in advance at this; After discharging a sign indicating number that has distributed, be set to upstate corresponding to the state of all described d/d yard leaf nodes.
The present invention also provides a kind of and adopts above-mentioned variable spread-spectrum factor code tree state storage means to store the device of variable spread-spectrum factor code tree state.
The present invention also provides a kind of and adopts above-mentioned variable bandspread factor code distribution method to distribute the device of variable bandspread factor code.
The present invention also provides a kind of and adopts above-mentioned variable bandspread factor code method for releasing to discharge the device of the variable bandspread factor code that has distributed.
Ovsf code tree state storage means according to the present invention can save the data space of code tree state information greatly, and reduced the distribution of ovsf code for example and discharged such method implementation complexity to code tree basic management function, increases work efficiency.
Description of drawings
From the detailed description with reference to accompanying drawing hereinafter, it is clearer that objects and advantages of the present invention will become, wherein:
Fig. 1 illustrates ovsf code and generates tree structure;
Fig. 2 illustrates the ovsf code tree state based on basic bit rate according to the present invention and represents topology example;
Fig. 3 illustrates the flow chart according to the method for the storage ovsf code tree state of principle of the present invention;
Fig. 4 illustrates the flow chart according to the processing method of the required sign indicating number of the distribution of principle of the present invention;
Fig. 5 illustrates the flow chart of solid size allocation process method according to an embodiment of the invention;
Fig. 6 illustrates the flow chart of solid size release processing method according to an embodiment of the invention.
Embodiment
Describe with reference to the accompanying drawings according to principle of the present invention and preferred embodiment thereof.
Ovsf code tree user mode storage means based on basic bit rate according to the present invention is that the data rate that can provide between the generating principle, each layer of OVSF sign indicating number according to ovsf code concerns, the basic allocation criteria of ovsf code, a kind of memory space efficient of efficiently utilizing that puts forward is beneficial to and simplifies handling process and reduce the ovsf code tree management using method of handling complexity.
The generating principle of ovsf code has shown that the yardage that can provide on the sublayer of each different length sign indicating number just equals the ovsf code length of this layer, and for example the ovsf code tree can provide the ovsf code of 8 SF=8 altogether.Here the number that has shown sign indicating number with yard length between relation.
And total sign indicating number number that whole ovsf code tree can provide is 4+8+...+256+512=1020 in theory, but because the basic allocation criteria of ovsf code and the orthogonality requirement between the ovsf code, then the number of code tree sign indicating number that can provide will significantly reduce simultaneously.According to the basic allocation criteria of ovsf code, promptly after a sign indicating number was assigned with use, in order to keep the orthogonality of intersymbol, the subcode of its former generation's sign indicating number that passes up to the ovsf code tree root and the following code tree leaf that traces back all can not be re-used.And utilize the code tree generating principle, the sign indicating number that we can have been distributed and can not being re-used of getting clogged yard between exist certain corresponding relation.
The data rate that each layer sign indicating number can provide in the ovsf code tree can be converted into the multiple of the speed that leaf node provided (basic bit rate) of the code tree bottom in addition, and also satisfies following relation between them: the ovsf code of n layer (2≤n≤9) (is SF=2
n) data rate that provided is 2 of the data rate (basic bit rate R) that provided of the ovsf code (being SF=512) of leaf node
9-nDoubly.And the maximum data rate that whole code tree can provide is exactly the summation of the basic bit rate that ovsf code provided of leaf node, i.e. 512 * R, and wherein R is a basic bit rate.
The present invention utilizes the structure of arrays CTree[512 of 512 Boolean type data of an one dimension] represent the ovsf code tree state of a sub-district, it is on the one-dimension array of benchmark that whole code tree is corresponded to the basic bit rate.
The descending ovsf code of supposing WCDMA is expressed as C
SF, NCode, wherein SF represents the spreading factor length of this yard, and span is 4～512, and NCode represents the sign indicating number sequence number of this yard this sublayer on code tree, and span is 0～SF-1.C then
SF, NCodeThe data rate that can provide is 512/SF * R.
State for an ovsf code has available (Free), takies (Occupied), blocks (Blocked) three kinds, but it all just shows as available and unavailable two kinds for follow-up use, so the available and down state of the pairing sign indicating number in this position that we represent with Boolean TRUE and FALSE.We utilize the structure of arrays CTree[512 of 512 Boolean type data of an one dimension] represent the ovsf code tree state of a sub-district, it is on the one-dimension array of benchmark that whole code tree is corresponded to the basic bit rate.
For principle of the present invention is described simply, shown in Figure 2 one 5 layers, ovsf code tree state the one-dimension array based on basic bit rate corresponding with it of maximum SF=16 are represented example.
The circle of the circle of the black code tree node representing to have taken, grey represents that the code tree node that gets clogged and the circle of white represent available code tree node in the drawings.
Except the leaf node (being the layer of SF=16) of the bottom, other each nodes all have two child nodes.According to principle mentioned above, in order to keep the orthogonality of intersymbol, all former generation's sign indicating numbers of occupied sign indicating number and its all subcodes all can not be re-used, and we represent these nodes with gray circles.
Set up one with the state of the leaf node of bottom one-dimension array one to one, whether the corresponding leaf node in each unit of judging this array is node occupied or that get clogged, if be node occupied or that block, then the numerical value of corresponding array location is set to " F " (False), perhaps be set to " 0 ", represent that this leaf node is unavailable; And be set to " T " (True) corresponding to the numerical value of the array location of available leaf node, and perhaps be set to " 1 ", represent that this node can use.
As can be seen from the figure, if former generation's node can be used, then its pairing all leaf node all is in upstate, numbering corresponding to all leaf nodes of former generation's node is continuous, and has certain numerical relation with the number of corresponding all leaf nodes of former generation's node and the number of plies of this former generation's node.
Fig. 3 illustrates the flow chart of the method for storing the ovsf code tree state in accordance with the principles of the present invention.As shown in Figure 3, in order to store the upstate of each yard in the code tree, at first in step 301, be provided for storing the memory cell of upstate of the leaf sign indicating number of ovsf code tree, and the numerical value that this memory cell is stored is initialized as upstate (T); In step 302, during each yard in distributing this ovsf code tree, be set to down state and when discharging each yard corresponding to numerical value, be set to upstate corresponding to numerical value as the memory cell of the leaf node that is released yard as the memory cell of the leaf node of occupied sign indicating number; The last memory cell that in step 303, obtains the user mode of the whole code tree of expression, and be used for sign indicating number distribution subsequently and discharge handling.Hereinafter, this memory cell is represented with array.
According to the WCDMA standard, always have 512 leaf nodes, can be 512 one-dimension array CTree[with a unit number] represent the state of whole code tree.
A kind of method that code tree state according to the present invention is represented is:
● each yard in the ovsf code tree all occupies 512/SF continuous memory space and represents the user mode that it is current in this array.
● do not have available codes occupied and that block, its state representation is available (T)
● the occupied or unavailable sign indicating number that blocks, its state representation is for taking (F).
● when length is after the SF sign indicating number of L is assigned with, the continuous memory space state representation of 512/L that corresponds to basic bit rate is for blocking unavailable (F).
Like this at one-dimension array CTree[] in comprised complete code tree user mode information.
For each yard C
SF, NCodeIf, at CTree[] in original position be CTree[NCode * 512/SF], and from CTree[NCode * 512/SF] value of continuous 512/SF cell data of beginning is " available (T) ", then represents this yard C
SF, NCodeState be available; Else if from CTree[NCode * 512/SF] there is the value of a cell data to be " unavailable (F) " the value of continuous 512/SF cell data of beginning, represent C
SF, NCodeThe state of sign indicating number is unavailable.
The whole code tree of initial state is all available, then array CTree[] in value all be T.
Be assigned with C as sign indicating number
SF, NCodeThe time, then array CTree[] in from CTree[NCode * 512/SF] value of 512/SF sequential cells of beginning is F, expression this moment is owing to having distributed C
SF, NCodeSign indicating number causes 512/SF leaf node sign indicating number of bottom to get clogged, and has taken the speed of R * 512/SF.
For the basic code tree management function of supporting that solid size distributes,, in this data structure, can both foolproofly realize as the distribution of sign indicating number, the release of sign indicating number etc.
Fig. 4 illustrates the flow chart according to the processing method of the required sign indicating number of the distribution of principle of the present invention.At first in step 401, according to required message transmission rate, the length of the sign indicating number that calculating should distribute; Then in step 402, according to the length that institute is calculated yard, utilize the array of memory code tree state, search whether there is such sign indicating number with length of being calculated, the state of feasible all leaf sign indicating numbers corresponding to this yard all is " available "; If find the sign indicating number that has the length of being calculated like this, then distribute this sign indicating number, expression is set to unavailable (step 403) corresponding to the state of all leaf nodes of this yard, and finishes allocation process (step 404); Otherwise return the information (step 405) of the sign indicating number that does not find Len req.
Fig. 5 illustrates the flow chart of solid size allocation process method according to an embodiment of the invention in further detail.As shown in the drawing, in step 501, be the data rate requirement that benchmark calculates new request with the basic bit rate, the result is expressed as the multiple relation of basic bit rate, i.e. m * R; In step 502, calculate the length of the SF sign indicating number that needs distribution according to the m that obtains * R, because the code check of SF=512 length is R, and is the relation of 2 exponential depth between the code check of other length and the basic bit rate,, the m * R of required request doubly is so being converted into the smallest positive integral of 2 exponential depth of basic bit rate
Then need the length of the SF sign indicating number that distributes to be
It is the sign indicating number of SF=L.
Length is that the SF sign indicating number of L at most also just has only L in system, carries out the circular treatment on L rank below then, and retrieval code tree state array is searched the SF sign indicating number of available length L.
In step 503, sign indicating number number circular treatment variable initial value is set to i=0.
In step 504, from i=0 to L-1, carry out circulation searching and handle.Withdraw from if be recycled to i=L, then the sign indicating number of available SF=L is not found in expression, leaps to step 515, withdraws from processing.
Sign indicating number for SF=L is each time searched, and need be code tree state array starting point with i * 512/L, judges that whether having a continuous 512/L value thereafter is the data cell of T.If wherein have the unit that value is the data of F, represent that then the sign indicating number of this SF=L is unavailable, carry out the sign indicating number of next i and search circulation.
In step 505, the initial value of searching available cell circular treatment variable of code tree state array is set to j=0.And whether sign exists sign indicating number Status Flag occupied or that block to be set to K=0 in this circular treatment.If having value in the circulating treatment procedure is the data cell of F, the value of then revising K is 1, represents that the sign indicating number of the pairing SF=L in this group unit is unavailable.
In step 506, for each i * 512/L is the array location group of the SF=L sign indicating number correspondence of starting point, when cyclic variable j does not surpass unit group length 512/L, and when not finding that value is the data cell of F, proceed the judgment processing of next data cell, promptly cycling condition is j＜512/L and K=0.
In step 507, to during each data cell judge whether its value is T.
Step 508 if its value does not represent that for T the sign indicating number of this data cell correspondence is occupied or block that then K is set to 1, jumps out this circular treatment when being circulated back to condition judgment naturally, is represented the i number C of SF=L of this i * 512/L correspondence
L, iUnavailable.
In step 509, continue circular treatment variable j value is added 1, get back to step 506 and carry out the condition judgment of circular treatment next time.
In step 510, when withdrawing from this C
L, iAfter the availability of sign indicating number is judged circular treatment, need to check the sign indicating number that whether has found required distribution, check promptly whether the value of available flag K is still 0.
In step 511, if K is not equal to 0 expression C
L, iSign indicating number is occupied or block unavailablely, and the cycle counter i of sign indicating number number is added 1, gets back to step 504 and proceeds next C
L, iThe judgment processing of sign indicating number.
In step 512, if K=0 represents this C
L, iSign indicating number is exactly to satisfy the sign indicating number that we require, and then ends the processing of sign indicating number number circulation, jumps out circulation.
In step 513, found the sign indicating number that needs the SF=L of distribution, a sign indicating number state array index is the i number C of the SF=L of i * 512/L correspondence exactly
L, i
In step 514, to having found behind the SF=L sign indicating number that needs to distribute to code tree state array CTree[] data upgrade processing, write down the code tree state after current having assigned.Begin to revise CTree[from the subscript i * 512/L unit of array] the data cell value, need to revise CTree[i * 512/L]～CTree[(i+1) * and 512/L-1] value of this 512/L data unit is F, represent currently distributing the i number CL of SF=L, behind the i, this 512/L the leaf sign indicating number that corresponds to SF=512 all is to block down state.
In step 515, if sign indicating number number circular treatment withdraws from circulation to i=L, represent that then the sign indicating number of all SF=L is all unavailable, so current system can not provide the sign indicating number of SF=L, current system can not support this new request.
In the step of above-mentioned Fig. 5, step 501～502nd is corresponding to the embodiment of the step 401 among Fig. 4; Step 503～512nd is corresponding to the embodiment of the step 402 among Fig. 4; Step 513～514th is corresponding to the embodiment of the step 403 among Fig. 4; And step 515 is corresponding to the step 405 among Fig. 4.
Those of ordinary skill in the art except specific embodiment shown in Figure 5, can also realize the method for the present invention shown in Fig. 4 with other modes obviously as can be seen.For example, used searching method is to judge corresponding to a sign indicating number that meets required code check (promptly earlier in Fig. 5, whether first leaf node sign indicating number of SF=L layer) is upstate, if this first leaf node can be used, judge successively subsequently continuously then whether 512/L leaf node all is upstate, if all be upstate then the sign indicating number of judging their pairing SF=L layers for available, otherwise select the sign indicating number of next SF=L layer to carry out same judgement; But also can judge earlier (promptly corresponding to a sign indicating number that meets required code check, whether last leaf node sign indicating number of SF=L layer) is upstate, if this last leaf node can be used, whether continuous 512/L leaf node before then judging successively all is upstate.
The release processing method of sign indicating number is described below.This release processing method is fairly simple, mainly is to upgrade the code tree state array according to the sign indicating number SF length that discharges with the sign indicating number serial number information, uses to subsequent request in order to this sign indicating number, and its basic handling flow process as shown in Figure 6.
In step 601, the sign indicating number sequence number that discharges in the SF=L layer is the sign indicating number C of K
L, K
In step 602～605, the numerical value of array corresponding to all leaf sign indicating numbers of the sign indicating number that is discharged all is set to " available (T) ", represent d/d yard upstate, so that redistribute subsequently.
Specifically, in step 602, the initial value of cyclic variable is set to i=0;
In step 603, judge whether cyclic variable satisfies i＜512/L;
If do not satisfy the condition of i＜512/L, then think and also the state of all leaf sign indicating numbers of the sign indicating number that is discharged is not become upstate, thereby forward step 604 to, the next leaf sign indicating number corresponding to the sign indicating number that is discharged become upstate, i.e. CTree[K*512/L+i]=T;
Then in step 605, cyclic variable is added 1, and turn back to step 603 and judge whether end loop;
If in step 603, judge loop ends, then finish the release of sign indicating number and handle.
The SF sign indicating number C that discharges
L, KIts SF length L exists certain relation with sign indicating number sequence number K on the data cell of determining the code tree state array is corresponding.For sign indicating number C
L, K, its state is embodied in the following K of the being designated as * 512/L of code tree state array on this 512/L of (K+1) * 512/L-1 continuous data cell, so the value for this section continuous data unit is revised as expression available " T " in the handling process of Fig. 6.
Though store the state of each leaf sign indicating number in the above-described embodiments in continuous successively mode, as long as but can determine corresponding relation between each yard and the leaf sign indicating number, also can store the state of each leaf sign indicating number with discontinuous memory cell, can realize purpose of the present invention equally.
Storage means, distribution method and method for releasing according to variable bandspread factor code of the present invention, can design corresponding variable bandspread factor code storage, distribution and/or releasing device, this storage, distribution and/or releasing device can be realized by device or a plurality of discrete device of an integral body.
For example can comprise memory, computing unit and judging unit according to variable bandspread factor code storage of the present invention, release and/or distributor.The memory of this device has a plurality of memory cell, wherein stores the state information corresponding to the leaf sign indicating number of variable spread-spectrum factor code tree respectively.When receiving request for allocation, computing unit calculates the length of the sign indicating number that will distribute according to required code check, whether judging unit is all available by judging with corresponding all the leaf sign indicating numbers of sign indicating number with Len req, if there is the sign indicating number of all available Len req of its all leaf sign indicating numbers, then distribute this sign indicating number; After distributing a sign indicating number, this computing unit calculates position with the corresponding one or more memory cell of this yard according to the length of the sign indicating number that is distributed and sign indicating number sequence number, and becomes down state with the numerical value of the corresponding memory cell of sign indicating number that is assigned with; When discharging a sign indicating number, this computing unit calculates the position with the memory cell of the pairing leaf sign indicating number of d/d sign indicating number, and the numerical value of this corresponding memory cell is become upstate.
In sum, protection scope of the present invention is not limited to disclosed embodiment in specification, but is limited by claims.Those of ordinary skill in the art does not break away from the protection range that claims limit can make various modification and improvement under inspiration of the present invention.
Claims (20)
1. variable spread-spectrum factor code tree state storage means, comprising following steps:
A plurality of memory cell of distributing the state of the leaf node of storing variable spread-spectrum factor code tree respectively;
Described memory cell is initialized as upstate;
During sign indicating number in distributing this variable spread-spectrum factor code tree, corresponding to as be assigned with yard the memory cell of all leaf nodes be set to down state;
And when discharging a sign indicating number, be set to upstate corresponding to memory cell as all leaf nodes of d/d yard.
2. method according to claim 1, wherein said memory cell are the array of a serial number, and each unit of this array is stored the state of a corresponding leaf node successively.
3. method according to claim 1 is wherein determined position and number with the described yard corresponding memory cell that is assigned with or discharges according to the length of spreading factor of the sign indicating number that is assigned with or discharges and its yard sequence number.
4. method according to claim 3, the length of the spreading factor of the wherein said sign indicating number that is assigned with or discharges is L, span is 2 a integral number power in 4～512, the sign indicating number sequence number is i, span is 0～L-1, and described leaf node be numbered 0～511, then with the described corresponding leaf node of sign indicating number that is assigned with or discharges be numbered i * 512/L～(i+1) * 512/L-1.
5. variable bandspread factor code distribution method, comprising following steps:
Method according to claim 1 is in advance stored variable spread-spectrum factor code tree state;
According to the message transmission rate of request, the spreading factor length of the sign indicating number that calculating should distribute;
According to the spreading factor length of being calculated, search whether there is such sign indicating number with spreading factor length of being calculated, make that the state corresponding to all leaf sign indicating numbers of this yard all is available; And
If find the sign indicating number that has the spreading factor length of being calculated like this, then distribute this sign indicating number, and storage is set to corresponding to the numerical value of memory cell of the state of all leaf nodes of the sign indicating number that is assigned with unavailablely, otherwise return the information that can not distribute.
6. method according to claim 5 is wherein determined position and number with the described yard corresponding memory cell that is assigned with according to the spreading factor length of the sign indicating number that is assigned with and its yard sequence number.
7. method according to claim 6, the length of the spreading factor of the wherein said sign indicating number that is assigned with is L, span is 2 a integral number power in 4～512, the sign indicating number sequence number is i, span is 0～L-1, and described leaf node be numbered 0～511, then with the described corresponding leaf node of sign indicating number that is assigned be numbered i * 512/L～(i+1) * 512/L-1.
8. variable bandspread factor code method for releasing, comprising following steps:
Method according to claim 1 is in advance stored variable spread-spectrum factor code tree state;
After discharging a sign indicating number that has distributed, be set to upstate corresponding to the state of all leaf nodes of d/d yard.
9. method according to claim 8 is wherein determined position and number with described d/d yard corresponding memory cell according to the spreading factor length of d/d sign indicating number and its yard sequence number.
10. method according to claim 9, the length of the spreading factor of wherein said d/d sign indicating number is L, span is 2 a integral number power in 4～512, the sign indicating number sequence number is i, span is 0～L-1, and described leaf node be numbered 0～511, then with the corresponding leaf node of sign indicating number of described release be numbered i * 512/L～(i+1) * 512/L-1.
11. an equipment that is used to store variable spread-spectrum factor code tree state comprises:
Be used to distribute the device of a plurality of memory cell of the state of the leaf node of storing variable spread-spectrum factor code tree respectively;
Be used for described memory cell is initialized as the device of upstate;
Be used for when distributing sign indicating number of this variable spread-spectrum factor code tree, corresponding to as be assigned with yard the memory cell of all leaf nodes be set to the device of down state;
And be used for when discharging a sign indicating number, be set to the device of upstate corresponding to memory cell as all leaf nodes of d/d yard.
12. equipment according to claim 11, wherein said memory cell are the array of a serial number, and each unit of this array is stored the state of a corresponding leaf node successively.
13. equipment according to claim 11 is wherein determined position and number with the described yard corresponding memory cell that is assigned with or discharges according to the length of spreading factor of the sign indicating number that is assigned with or discharges and its yard sequence number.
14. equipment according to claim 13, the length of the spreading factor of the wherein said sign indicating number that is assigned with or discharges is L, span is 2 a integral number power in 4～512, the sign indicating number sequence number is i, span is 0～L-1, and described leaf node be numbered 0～511, then with the described corresponding leaf node of sign indicating number that is assigned with or discharges be numbered i * 512/L～(i+1) * 512/L-1.
15. an equipment that is used to distribute variable bandspread factor code comprises:
Be used for method according to claim 1 in advance and store the device of variable spread-spectrum factor code tree state;
Be used for message transmission rate, the device of the spreading factor length of the sign indicating number that calculating should distribute according to request;
Be used for according to the spreading factor length of being calculated, search whether there is such sign indicating number, make that the state corresponding to all leaf sign indicating numbers of this yard all is available device with spreading factor length of being calculated; And
If be used for finding the sign indicating number that has the spreading factor length of being calculated like this, then distribute this sign indicating number, and storage is set to unavailable corresponding to the numerical value of memory cell of the state of all leaf nodes of the sign indicating number that is assigned with, otherwise returns the device of the information that can not distribute.
16. equipment according to claim 15 is wherein determined position and number with the described yard corresponding memory cell that is assigned with according to the spreading factor length of the sign indicating number that is assigned with and its yard sequence number.
17. equipment according to claim 16, the length of the spreading factor of the wherein said sign indicating number that is assigned with is L, span is 2 a integral number power in 4～512, the sign indicating number sequence number is i, span is 0～L-1, and described leaf node be numbered 0～511, then with the described corresponding leaf node of sign indicating number that is assigned be numbered i * 512/L～(i+1) * 512/L-1.
18. an equipment that is used to discharge the variable bandspread factor code that has distributed comprises:
Be used for method according to claim 1 in advance and store the device of variable spread-spectrum factor code tree state;
Be used for after discharging a sign indicating number that has distributed, being set to the device of upstate corresponding to the state of all leaf nodes of d/d yard.
19. equipment according to claim 18 is wherein determined position and number with described d/d yard corresponding memory cell according to the spreading factor length of d/d sign indicating number and its yard sequence number.
20. equipment according to claim 19, the length of the spreading factor of wherein said d/d sign indicating number is L, span is 2 a integral number power in 4～512, the sign indicating number sequence number is i, span is 0～L-1, and described leaf node be numbered 0～511, then with the corresponding leaf node of sign indicating number of described release be numbered i * 512/L～(i+1) * 512/L-1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100668762A CN100571090C (en) | 2004-09-29 | 2004-09-29 | Orthogonal variable spread-spectrum factor code tree state storage, distribution and method for releasing and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100668762A CN100571090C (en) | 2004-09-29 | 2004-09-29 | Orthogonal variable spread-spectrum factor code tree state storage, distribution and method for releasing and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1756137A CN1756137A (en) | 2006-04-05 |
| CN100571090C true CN100571090C (en) | 2009-12-16 |
Family
ID=36689122
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100668762A Active CN100571090C (en) | 2004-09-29 | 2004-09-29 | Orthogonal variable spread-spectrum factor code tree state storage, distribution and method for releasing and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100571090C (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101621845B (en) * | 2008-07-01 | 2012-04-04 | 中兴通讯股份有限公司 | Resource indicating method and device |
| US10411753B2 (en) | 2015-04-07 | 2019-09-10 | Mediatek Inc. | Method and electronic apparatus for transmitting packet with changeable spreading factor |
| CN108055724B (en) * | 2017-12-11 | 2019-10-11 | 广东洲明节能科技有限公司 | LED street lamp power carrier control method and system |
| CN109639315B (en) * | 2018-12-20 | 2021-06-15 | 惠州Tcl移动通信有限公司 | Mobile terminal pseudo-random sequence processing method, device and storage medium |
| CN111507071B (en) * | 2020-04-17 | 2024-02-27 | 上海电气风电集团股份有限公司 | Encoding method and encoding device for wind power plant and computer readable storage medium |
-
2004
- 2004-09-29 CN CNB2004100668762A patent/CN100571090C/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN1756137A (en) | 2006-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6757802B2 (en) | Method for memory heap and buddy system management for service aware networks | |
| Tseng et al. | Code placement and replacement strategies for wideband CDMA OVSF code tree management | |
| CN102253897B (en) | Method and device for managing memory pool | |
| CN1097989C (en) | Method for allocating walsh codes by group in CDMA cellular system | |
| US6552996B2 (en) | OVSF code system and methods | |
| US20020065870A1 (en) | Method and apparatus for heterogeneous distributed computation | |
| CN106294190A (en) | A kind of memory space management and device | |
| US5301104A (en) | Method for allocating processing elements interconnected in a hypercube topology | |
| CN1133337C (en) | Resource allocation | |
| KR100590460B1 (en) | Binary-tree method and system for multiplexing scheduling | |
| CN100571090C (en) | Orthogonal variable spread-spectrum factor code tree state storage, distribution and method for releasing and device | |
| CN106649790A (en) | Multilayer link separated skiplist construction method and system | |
| CN1241345C (en) | Channelizing code resource dynamic optimization distribution method of wideband CDMA system | |
| TW200415872A (en) | Code channel allocations in a wireless communications system | |
| CN101350010A (en) | Operation method of hash table | |
| CN100373839C (en) | Method of downstream spread spectrum code assignment executed by WCDMA system wireless network controller | |
| CN101237417B (en) | Queue index method, device and traffic shaping method and device | |
| CN101388685B (en) | Code resource management method | |
| CN1744593A (en) | Transmission link selecting method | |
| Assarut et al. | Performance evaluation of orthogonal variable-spreading-factor code assignment schemes in W-CDMA | |
| Wang et al. | Walsh code assignment and data structure for variable data rate communications | |
| Yu et al. | Graph model for OVSF code placement | |
| CN1283056C (en) | Channel code resource utilization method in broadband CDMA system | |
| JP4181918B2 (en) | Radio base station apparatus, radio resource optimization processing method by radio base station apparatus | |
| Gong et al. | Dynamic code assignment for OVSF code system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee |
Owner name: SHANGHAI ALCATEL-LUCENT CO., LTD. Free format text: FORMER NAME: BEIER AERKATE CO., LTD., SHANGHAI |
|
| CP01 | Change in the name or title of a patent holder |
Address after: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee after: Shanghai Alcatel-Lucent Co., Ltd. Address before: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee before: Beier Aerkate Co., Ltd., Shanghai |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee after: Shanghai NOKIA Baer Limited by Share Ltd Address before: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee before: Shanghai Alcatel-Lucent Co., Ltd. |