CN1921362B - Orthogonal variable spread-spectrum code distribution method in code division multiple access communication system - Google Patents

Abstract

The invention relates to an orthogonal variable frequency-expand code distribution method in a code division multiple access communication system, comprising: obtaining the resource request number NRU, user device maximum code limit k, and orthogonal variable frequency-expand code tree; based on the code tree generating maximum idle code group T, idle code number vector Cavail; calculating the data rate sum Total provided by the maximum idle code of former k data rates in Cavail; comparing if the Total is higher than NRU; if not, ending; or else, calculating out the compact code number vector Calloc; comparing if the code number N (Calloc) of Calloc is higher than k; if so, exchanging the Calloc with the resource of maximum idle code number vector Cavail', comparing if N (Calloc) is higher than k; or else, based on Cavail' and Calloc, distributing maximum idle code, and ending.

Description

Orthogonal variable spread-spectrum code distribution method in a kind of code division multiple address communication system

Technical field

The present invention relates to code division multiple access (Code Division Multiple Access, CDMA) sign indicating number resource allocation techniques in the system, specifically, relate to orthogonal variable spreading code in the code division multiple access system (Orthogonal Variable Spreading Factor, distribution method OVSF).

Background technology

In code division multiple address communication system, adopt the orthogonal variable spreading code to carry out spread spectrum, to guarantee the orthogonality of physical channel.Figure 1 shows that ovsf code tree in the WCDMA system.The sign indicating number C of different layers on code tree _SF ^{Code number}The data transfer rate of pairing code channel is different, and the sign indicating number of big spreading factor SF=512 correspondence will provide lower data transfer rate, and the sign indicating number of little spreading factor SF=4 provides the higher data rate.Because the sign indicating number of different physical channels must satisfy the orthogonality principle, the distribution of ovsf code must be followed following principle: for certain sign indicating number to be allocated, all nodes all are not assigned with on the path of root node from it to tree, and are that all nodes all are not assigned with yet on the subtree of root with it.

The quality of code-resource distribution method will have big influence to power system capacity.For example, for the business of low data rate, distribute big bandspread factor code randomly after, can block little bandspread factor code, minimizing can by other users use the sign indicating number number.On the contrary, when the code check spreading code is hanged down in distribution, adopt certain strategy to avoid blocking little spreading code, will bring elasticity to subsequent allocations.

In the existing research, the 3GPP normal structure has proposed the definition of the model of sign indicating number resource allocation problem and utilance, complexity measure, does not relate to concrete distribution method.As, 3GPP TS 25.922: the method for being mentioned in " Radio resource management strategies " (RRM strategy).

In the prior art, generally all ignored the restricted problem of subscriber equipment (UE) ability, caused in real system, when the number of the sign indicating number that uses when the multipotency of UE was defined, this method can't be employed.

Therefore, how can be according to existing available sign indicating number resource and the ability of UE, under the prerequisite that satisfies user's request resource, make the utilance height of sign indicating number, and the number of users of support becomes a problem demanding prompt solution more.

Summary of the invention

Technical problem to be solved by this invention provides orthogonal variable spread-spectrum code distribution method in a kind of code division multiple address communication system.Can search out optimum allocative decision according to the situation and the maximum yardage limits value of UE of ovsf code, realize that the yardage of distributing is no more than the limits value of UE, the blocking rate minimum of code tree, and amount of calculation is little.

For solving the problems of the technologies described above, it is as follows to the invention provides scheme:

Orthogonal variable spread-spectrum code distribution method in a kind of code division multiple address communication system comprises the steps:

Step 1: obtain number of resource requests N _RU, the maximum yardage restriction k of subscriber equipment and orthogonal variable spread spectrum code tree; And the state according to code word in the code tree generates very big idle code character T, bell idles number vector C _AvailDescribed very big idle code character is meant the set of all very big idle code words on the code tree that the spreading factor sequence arrangement from low to high according to very big idle code word forms, and wherein, very big idle code word is meant that father's code word is busy idle code word in the code tree; Described bell idles number vector is meant the yardage vector of very big idle code character correspondence, and wherein, the yardage vector is meant the vector that the number of the code word of spreading factors corresponding different in the very big idle code character is formed;

Step 2: computation-free yardage vector C _AvailIn before the summation Total of k the highest idle code word of data transfer rate data transfer rate that can provide;

Step 3: whether more described Total is greater than described N _RUIf Total＜N _RU, then resource request can't satisfy, and distributes and gets nowhere, and withdraws from; Otherwise execution in step four;

Step 4: calculate compact code number vector C _Alloc, described C _AllocFor making the code character utilance maximum of distributing code character, the yardage minimum of the bell idles number vector after the distribution, and assigned code number vector with minimum yardage; Wherein, the assigned code number vector is meant the yardage vector that distributes the code character correspondence, distributes code character to be meant the very big idle code character of distributing to subscriber equipment;

Step 5: more described C _AllocYardage N (C _Alloc) with the magnitude relationship of the maximum yardage restriction of subscriber equipment k; If N (C _Alloc)＞k, then execution in step six; Otherwise execution in step seven;

Step 6: exchange C _AllocWith very big bell idles number vector C in the system of distribution back _Avail' in resource, return step 5; Described exchange is meant with C _AllocTwo code words of middle data transfer rate minimum exchange C for _Avail' in a code word on the High Data Rate component;

Step 7: according to described C _Avail' and described C _AllocFrom very big idle code character, distribute very big idle code word, withdraw from.

Compared with prior art, the invention has the advantages that:

The method of the invention under the condition that the number of codewords of UE is restricted, can make in the system after the distribution idle code word reach in theory and compact most.And can be in comprehensive UE under the prerequisite of multiple factor such as code word capacity and system's compactness, the utilance of code word in the raising system.Simultaneously, also avoided various allocative decisions are carried out exhaustive, calculated, and, caused the appearance of problems such as computational complexity is low the repeat search of code tree based on the yardage vector.Adopt the method for the invention in actual applications, can effectively improve the capacity of system, have very important significance for the actual exploitation of WCDMA mobile communication system.

Technical problem to be solved by this invention, technical scheme main points and beneficial effect will be in conjunction with the embodiments, are further described with reference to accompanying drawing.

Description of drawings

Fig. 1 is the ovsf code tree schematic diagram that downlink channel uses in the WCDMA system;

Fig. 2 is the flow chart of the method for the invention;

Fig. 3 is for being the compact code number vector flow chart of calculating of the present invention;

Fig. 4 is exchange C of the present invention _AllocWith C _Avail' middle resource flow chart;

Fig. 5 is the very big idle code word flow chart of distribution of the present invention;

Fig. 6 has gone out the ovsf code tree of specific embodiment of the present invention and the schematic diagram of sign indicating number distribution state.

Embodiment

At first, some related notions are described.

Code word on the code tree has idle and busy two states.When initial, each code word is in idle condition.In case code word is assigned with, or because its direct ancestors' code word is assigned with and causes this code word to get clogged, or because its descendants's code word is assigned with and causes this code word to get clogged, this code word will enter busy state.

Very big idle code word: father's code word is busy idle code word in the code tree.

Very big idle code character: the set of all very big idle code words on the code tree, according to the spreading factor order from low to high of very big idle code word, promptly the descending sequence arrangement of Dui Ying data transfer rate is designated as T.

The yardage vector: the number of the code word of corresponding different spreading factors in the very big idle code character, with vectorial C=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈) expression, component a wherein _iRepresent that spreading factor is the number of the very big idle code word of SF=(4,8,16,32,64,128,256,512) in the very big idle code character.a ₁≤4，a ₂≤8，a ₃≤16，?a ₄≤32，a ₅≤64，a ₆≤128，a ₇≤256，a ₈≤512。

For ease of discussing, the yardage vector of very big idle code character correspondence in the system is called the bell idles number vector, be designated as C _AvailThe very big idle code character of distributing to UE is called the distribution code character, is designated as T _AllocDistribute the yardage vector of code character correspondence to be called the assigned code number vector, be designated as C _Alloc, distribute the bell idles number vector of very big idle code character correspondence in the system of back to be designated as C _Avail'.

The data transfer rate of yardage vector: yardage vector C=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈) weighted sum $W\left(C\right)=\underset{i=1}{\overset{8}{\mathrm{\Σ}}}{a}_i\·2^{8-i}$ Be the data transfer rate that the yardage vector can provide.

Yardage: yardage vector C=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈) in every summation $N\left(C\right)=\underset{i=1}{\overset{8}{\mathrm{\Σ}}}{a}_i$ , be designated as the yardage of yardage vector.

For example, the very big idle code character in the some time etching system is T={C ₆₄ ³¹, C ₁₂₈ ³¹, C ₂₅₆ ¹⁹¹, C ₅₁₂ ³⁸⁰, C ₅₁₂ ⁵⁰⁸, C ₅₁₂ ⁵¹¹, bell idles number vector C _Avail=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈)=(0,0,0,0,1,1,1,3), its data transfer rate is W (C _Avail)=17, yardage are 6.

The business demand number: the data transfer rate of customer service demand is required code channel number during as linear module with the data transfer rate of maximum spreading factor (SF=512), is designated as N _RU

Distribute the code character utilance: user's business demand number and corresponding assigned code number vector C _AllocData transfer rate W (C _Alloc) ratio, be designated as Utilitisation (N _RU, C _Alloc), i.e. Utilitisation (N _RU, C _Alloc)=N _RU/ W (C _Alloc).

The compact code number vector of request resource: make the code character utilance maximum of distributing code character, the yardage minimum of the bell idles number vector after the distribution, and have the distribution code character of minimum yardage is called the compact code number vector of request resource, is designated as UtilC (C _Avail, N _RU).

For example, C _Avail=(0,0,0,0,1,1,1,3), N _RU=6.Candidate's assigned code number vector is C _Alloc[1]=(0,0,0,0,1,0,0,0), C _Alloc[2]=(0,0,0,0,0,1,1,0), C _Alloc[3]=(0,0,0,0,0,1,0,2).Correspondingly, the bell idles number vector after the distribution is C _Avail' [1]={ (0,0,0,0,0,1,1,3), C _Avail' [2]=(0,0,0,0,1,0,0,3), C _Avail' [3]=(0,0,0,0,1,0,1,1).Obtain C easily _Alloc[2] and C _Alloc[3] all reach Utilitisation (N _RU, C _Alloc) 100% code character utilance, but N (C _Avail' [3])=3＜N (C _Avail' [2])=4, so UtilC (C _Avail, N _RU)=(0,0,0,0,1,0,2)=C _Alloc[3].

In addition, for ease of describing, the addition, subtraction operation of definitions number vector is as follows.

The yardage vector subtracts computing: as yardage vector A=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈) data transfer rate W (A) greater than yardage vector B=(b ₁, b ₂, b ₃, b ₄, b ₅, b ₆, b ₇, b ₈) data transfer rate W (B) time, can subtract computing D=Subt (A, B).Operation rule is similar to the long number subtraction: if a _i＜b _i, and a _I-1＞0, then borrow forward, a _I-1=a _I-1-1, a _i=a _i+ 2, up to a _i〉=b _iD then _i=a _i-b _i

The yardage vector adds computing: yardage vector A=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈) and yardage vector B=(b ₁, b ₂, b ₃, b ₄, b ₅, b ₆, b ₇, b ₈) the respective components addition, not-carry.

In addition, in real system, the total number of the code word that UE can use is limited, therefore at resource request N _RU, UE can provide corresponding maximum number of codewords k.

The maximum yardage restriction of UE: for resource request N _RUThe maximum yardage that can distribute is designated as k.

For code-resource distribution method, should be subjected to seek the allocative decision that the bell idles number vector is compacted under the situation of the maximum yardage restriction of UE in yardage, promptly ask constraints N (C _AllocUnder the)≤k, make N (C _Avail') minimum C _Alloc

Its core concept of spreading code optimum allocation method of code division multiple address communication system of the present invention is: at first, do not considering N (C _AllocUnder the situation of)≤k, calculate the N (C that sends as an envoy to _Avail') minimum C _Alloc=UtilC (C _Avail, N _RU).Obviously, the C that obtains this moment _AllocBe optimal solution.Then, check yardage constraints N (C _AllocWhether)≤k satisfies.When constraints does not satisfy, successively with C _AllocMiddle a _i(i=8,7,6,5,4,3,2) last two unit resource exchange C for _Avail' middle a _I-1The resource of a last unit is to reduce C _AllocYardage.Can prove, through adjustment obtain later for satisfying constraints constraints N (C _AllocN (C behind the)≤k _Avail') minimum.At last, according to the C that tries to achieve _Avail' and C _AllocDistribute corresponding very big idle code word.

As shown in Figure 2, be the flow chart of the method for the invention.

At first, obtain number of resource requests N _RU, the maximum yardage restriction k of subscriber equipment and orthogonal variable spread spectrum code tree; And the state according to code word in the code tree generates very big idle code character T, bell idles number vector C _Avail(step 1); Then, computation-free yardage vector C _AvailIn before the summation Total (step 2) of k the highest idle code word of data transfer rate data transfer rate that can provide; Whether more described again Total is greater than described N _RUIf Total＜N _RU, then resource request can't satisfy, and distributes and gets nowhere, and withdraws from; Otherwise execution in step four (step 3); Then, calculate compact code number vector C _Alloc(step 4); More described again C _AllocYardage N (C _Alloc) with the magnitude relationship of the maximum yardage restriction of subscriber equipment k; If N (C _Alloc)＞k, then execution in step six; Otherwise execution in step seven (step 5); Then, exchange C _AllocWith very big bell idles number vector C in the system of distribution back _Avail' in resource, return step 5 (step 6); At last, according to described C _Avail' and described C _AllocFrom very big idle code character, distribute very big idle code word, withdraw from (step 7).

Wherein, for calculating compact code number vector C _Alloc=UtilC (C _Avail, N _RU), as shown in Figure 3, can realize by following steps:

At first, structure original allocation yardage vector C _Initial=(0,0,0,0,0,0, N _RU) (step 401); Then, subtract the bell idles number vector C that compacts most after computing obtains to distribute by the yardage vector _Avail'=Subt (C _Avail, C _Initial), wherein, Subt (C _Avail, C _Initial) indication code number vector C _AvailWith yardage vector C _InitialSubtract computing (step 402); At last, subtract computing dispensed yardage vector C by the yardage vector _Alloc=Subt (C _Avail, C _Avail') (step 403), wherein, Subt (C _Avail, C _Avail') indication code number vector C _AvailWith yardage vector C _Avail' subtract computing.

For, described exchange C _AllocWith very big bell idles number vector C in the system of distribution back _Avail' in resource, be with C _AllocTwo code words of middle data transfer rate minimum exchange C for _Avail' in a code word on the High Data Rate component, as shown in Figure 4, may further comprise the steps:

At first, import described C _Alloc, described C _Avail' (step 601); Then, obtain described C _AllocTwo pairing components of code word of middle data transfer rate minimum are made as e1, e2 (step 602); Here component e1, e2 can equate, also can be unequal.Then, totalize according to rate T _Min=2 ^8-e1+ 2 ^8-e2(step 603); Compute vector component label again (step 604).Then, structure decrement yardage vector C _Dec=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈), wherein, if e1=e2, then a _E1=2, a _j=0 (j ≠ e1); Otherwise, i.e. e1 ≠ e2, a _E1=1, a _E2=1, a _j=0 (j ≠ e1, j ≠ e1); And structure incremental code number vector C _Inc=(b ₁, b ₂, b ₃, b ₄, b ₅, b ₆, b ₇, b ₈), a wherein _l=1, a _j=0 (j ≠ l) (step 605); At last, to described C _Avail' add decrement yardage vector after subtracting the incremental code number vector earlier, that is, and C _Avail'=Subt (C _Avail', C _Inc), C _Avail'=Add (C _Avail', C _Dec), to yardage vector C _Alloc, add the incremental code number vector, C behind the decrement yardage vector earlier _Alloc=Subt (C _Alloc, C _Dec), C _Alloc=Add (C _Alloc, C _Inc), wherein, Add adds computing for the yardage vector, corresponding position addition, not-carry (step 606).

In the method for the invention, for described step 7 according to described C _Avail' and described C _AllocFrom very big idle code character, distribute corresponding very big idle code word, as shown in Figure 5, can realize by following steps: at first, input C _Avail=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈), C _Avail'=(a ₁', a ₂', a ₃', a ₄', a ₅', a ₆', a ₇', a ₈'), C _Alloc=(d ₁, d ₂, d ₃, d ₄, d ₅, d ₆, d ₇, d ₈), T makes i=1, T _Alloc=Φ (step 701); Then, judge the size of i, if i＜9, then execution in step 703; Otherwise execution in step 707 (step 702); Then, if a _i＞a _i', then execution in step 704; Otherwise execution in step 706 (step 703); Again, from T, distribute d _iThe code word of individual ai component correspondence is to T _Alloc, establishing these code words is c ₁, c ₂..., c _Di, T=T-{c then ₁, c ₂..., c _Di, T _Alloc=T _Alloc+ { c ₁, c ₂..., c _Di(step 704); Then, split a among the T _i-a _i'-d _iThe code word of individual ai component correspondence, and correspondingly upgrade C _AvailAnd T (step 705); I=i+1 returns step 702 (step 706); At last, return T _Alloc(step 707).

With an example implementation process of the present invention is described below.Fig. 6 is in a certain moment of system's operation, the state of each code word in the ovsf code tree.Because the restriction of length has only provided the subtree that contains idle code word among the figure, the code word of clipped is assumed to be busy state, represents with filled box.And, represent idle code word with open diamonds, solid diamond is represented busy code word.

Suppose to be N for number of resource requests _RU=7 distribution codewords, the number of codewords of distribution can not surpass k=2.Adopt the method specific implementation step in the technical scheme as follows:

The first step, N gets parms _RU=7, k=2 and ovsf code tree.Generate very big idle code character T={C ₆₄ ³¹, C ₁₂₈ ³¹, C ₂₅₆ ¹⁹¹, C ₅₁₂ ³⁸⁰, C ₅₁₂ ⁵⁰⁸, C ₅₁₂ ⁵¹¹, bell idles number vector C _Avail=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈)=(0,0,0,0,1,1,1,3).

In second step, find out C _AvailIn before k=2 the code word that data transfer rate is the highest be C ₆₄ ³¹And C ₁₂₈ ³¹, calculate the summation Total=12 of the data transfer rate that they can provide.

In the 3rd step, obtain Total＞N _RU, changeed for the 4th step.

In the 4th step, calculate and make N (C _Avail') minimum C _Alloc=UtilC (C _Avail, N _RU)=(0,0,0,0,0,1,0,3).This step comprises the following step again:

The 401st step, structure original allocation yardage vector C _Initial=(0,0,0,0,0,0,7).

In the 402nd step, subtract the bell idles number vector C that compacts most after computing obtains to distribute by the yardage vector _Avail'=Subt (C _Avail, C _Initial)=Subt ((0,0,0,0,1,1,1,3), (0,0,0,0,0,0,0,7))=(0,0,0,0,1,0,1,0).

In the 403rd step, subtract computing dispensed yardage vector C by the yardage vector _Alloc=Subt (C _Avail, C _Avail')=Subt ((0,0,0,0,1,1,1,3), (0,0,0,0,1,0,1,0))=(0,0,0,0,0,1,0,3).

In the 5th step, calculate C _AllocYardage N (C _Alloc)=4 are greater than the maximum yardage restriction of UE k=2.Entered for the 6th step.

The 6th step, C at this moment _Alloc=(0,0,0,0,0,1,0,3), C _Avail'=(0,0,0,0,1,0,1,0).With C _AllocTwo code words of middle data transfer rate minimum exchange C for _Avail' in a code word on the High Data Rate component, obtain C _Alloc=(0,0,0,0,0,1,1,1), C _Avail'=(0,0,0,0,1,0,0,2).This step comprises the following step again:

The 601st step, input C _Alloc=(0,0,0,0,0,1,0,3), C _Avail'=(0,0,0,0,1,0,1,0).

In the 602nd step, obtain C _AllocTwo pairing components of code word of middle data transfer rate minimum are a8.

In the 603rd step, calculate corresponding aggregate date rate T _Min=2 ^8-8+ 2 ^8-8=2.

In the 604th step, calculate corresponding component of a vector label

The 605th step, structure decrement yardage vector C _Dec=(0,0,0,0,0,0,0,2) and incremental code number vector C _Inc=(0,0,0,0,0,0,1,0).

The 606th step is to yardage vector C _Avail' subtract incremental code number vector C earlier _IncAfter add decrement yardage vector C _Dec, i.e. C _Avail'=Subt (C _Avail', C _Inc)=Subt ((0,0,0,0,1,0,1,0), (0,0,0,0,0,0,1,0))=(0,0,0,0,1,0,0,0), C _Avail'=Add (C _Avail', C _Dec)=Add ((0,0,0,0,1,0,0,0), (0,0,0,0,0,0,0,2))=(0,0,0,0,1,0,0,2).To yardage vector C _Alloc, add the incremental code number vector, C behind the decrement yardage vector earlier _Alloc=Subt (C _Alloc, C _Dec)=Subt ((0,0,0,0,0,1,0,3), (0,0,0,0,0,0,0,2))=(0,0,0,0,0,1,0,1), C _Alloc=Add (C _Alloc, C _Inc)=Add ((0,0,0,0,0,1,0,1), (0,0,0,0,0,0,1,0))=(0,0,0,0,0,1,1,1).Returned for the 5th step.

In the 5th step, calculate C _AllocYardage N (C _Alloc)=3 are greater than the maximum yardage restriction of UE k=2.Entered for the 6th step.

The 6th step, C at this moment _Alloc=(0,0,0,0,0,1,1,1), C _Avail'=(0,0,0,0,1,0,0,2).With C _AllocTwo code words of middle data transfer rate minimum exchange C for _Avail' in a code word on the High Data Rate component, obtain C _Alloc=(0,0,0,0,0,2,0,0), C _Avail'=(0,0,0,0,0,1,1,3).This step comprises the following step again:

The 601st step, input C _Alloc=(0,0,0,0,0,1,1,1), C _Avail'=(0,0,0,0,1,0,0,2).

In the 602nd step, obtain C _AllocTwo pairing components of code word of middle data transfer rate minimum are a7, a8.

In the 603rd step, calculate corresponding aggregate date rate T _Min=2 ^8-7+ 2 ^8-8=3.

In the 604th step, calculate corresponding component of a vector label

The 605th step, structure decrement yardage vector C _Dec=(0,0,0,0,0,0,1,1) and incremental code number vector C _Inc=(0,0,0,0,0,1,0,0).

The 606th step is to yardage vector C _Avail' subtract incremental code number vector C earlier _IncAfter add decrement yardage vector C _Dec, i.e. C _Avail'=Subt (C _Avail', C _Inc)=Subt ((0,0,0,0,1,0,0,2), (0,0,0,0,0,1,0,0))=(0,0,0,0,0,1,0,2), C _Avail'=Add (C _Avail', C _Dec)=Add ((0,0,0,0,0,1,0,2), (0,0,0,0,0,0,1,1))=(0,0,0,0,0,1,1,3).To yardage vector C _Alloc, add the incremental code number vector, C behind the decrement yardage vector earlier _Alloc=Subt (C _Alloc, C _Dec)=Subt ((0,0,0,0,0,1,1,1), (0,0,0,0,0,0,1,1))=(0,0,0,0,0,1,0,0), C _Alloc=Add (C _Alloc, C _Inc)=Add ((0,0,0,0,0,1,0,0), (0,0,0,0,0,1,0,0))=(0,0,0,0,0,2,0,0).Returned for the 5th step.

The 5th step, C _AllocYardage N (C _Alloc)=2 are not more than the maximum yardage restriction of UE k=2.Entered for the 7th step.

The 7th step is according to C _Avail=(0,0,0,0,1,1,1,3), C _Alloc=(0,0,0,0,0,2,0,0), C _Avail'=(0,0,0,0,0,1,1,3), from T={C ₆₄ ³¹, C ₁₂₈ ³¹, C ₂₅₆ ¹⁹¹, C ₅₁₂ ³⁸⁰, C ₅₁₂ ⁵⁰⁸, C ₅₁₂ ⁵¹¹Middle distribution codeword collection T _Alloc={ C ₁₂₈ ⁶², C ₁₂₈ ⁶³.This step comprises the following step again:

The 701st step, input C _Avail=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈)=(0,0,0,0,1,1,1,3), C _Alloc=(d ₁, d ₂, d ₃, d ₄, d ₅, d ₆, d ₇, d ₈)=(0,0,0,0,0,2,0,0), C _Avail'=(a ₁', a ₂', a ₃', a ₄', a ₅', a ₆', a ₇', a ₈')=(0,0,0,0,0,1,1,3), T={C ₆₄ ³¹, C ₁₂₈ ³¹, C ₂₅₆ ¹⁹¹, C ₅₁₂ ³⁸⁰, C ₅₁₂ ⁵⁰⁸, C ₅₁₂ ⁵¹¹.Make i=1, T _Alloc=Φ.

The 702nd step is because in the process of i=1...4, if a _i=a _i'=0 is so i increases 1 up to i=5;

If the 703rd step is a ₅＞a ₅', changeed for the 704th step.

The 704th step is because d ₅=0, so distribution codeword not.

In the 705th step, split a among the T ₅-a ₅'-d ₅=1 a ₅The code word of component correspondence, and correspondingly upgrade C _AvailAnd T, get C _Avail=(0,0,0,0,0,3,1,3), T={C ₁₂₈ ³¹, C ₁₂₈ ⁶², C ₁₂₈ ⁶³, C ₂₅₆ ¹⁹¹, C ₅₁₂ ³⁸⁰, C ₅₁₂ ⁵⁰⁸, C ₅₁₂ ⁵¹¹.

The 706th step, i=6.Returned for the 702nd step.

In the 702nd step, the 703rd step was changeed in i＜9.

If the 703rd step is a ₆＞a ₆', changeed for the 704th step.

The 704th step is because d ₆=2, distribute 2 a ₆The code word C of component correspondence ₁₂₈ ⁶²And C ₁₂₈ ⁶³, obtain T _Alloc={ C ₁₂₈ ⁶², C ₁₂₈ ⁶³, T={C ₁₂₈ ³¹, C ₂₅₆ ¹⁹¹, C ₅₁₂ ³⁸⁰, C ₅₁₂ ⁵⁰⁸, C ₅₁₂ ⁵¹¹.

The 705th step is because a ₆-a ₆'-d ₆=0, so do not split code word among the T, changeed for the 706th step.

In the 706th step, i=i+1 does not handle.Up to i=9, changeed for 707 steps.

In the 707th step, return T _Alloc={ C ₁₂₈ ⁶², C ₁₂₈ ⁶³.

Orthogonal variable spread-spectrum code distribution method in a kind of code division multiple address communication system of the present invention, be not restricted to listed utilization in specification and the execution mode, it can be applied to various suitable the present invention's field fully, for those skilled in the art, can easily realize additional advantage and make amendment, therefore under the situation of the spirit and scope of the universal that does not deviate from claim and equivalency range and limited, the examples shown that the present invention is not limited to specific details, representational equipment and illustrates here and describe.

Claims (7)

1. orthogonal variable spread-spectrum code distribution method in the code division multiple address communication system is characterized in that comprising the steps:

Step 1: obtain number of resource requests N _RU, the maximum yardage restriction k of subscriber equipment and orthogonal variable spread spectrum code tree; And the state according to code word in the code tree generates very big idle code character T, bell idles number vector C _AvailDescribed very big idle code character is meant the set of all very big idle code words on the code tree that the spreading factor sequence arrangement from low to high according to very big idle code word forms, and wherein, very big idle code word is meant that father's code word is busy idle code word in the code tree; Described bell idles number vector is meant the yardage vector of very big idle code character correspondence, and wherein, the yardage vector is meant the vector that the number of the code word of spreading factors corresponding different in the very big idle code character is formed;

Step 2: computation-free yardage vector C _AvailIn before the summation Total of k the highest idle code word of data transfer rate data transfer rate that can provide;

Step 3: whether more described Total is greater than described N _RUIf Total＜N _RU, then resource request can't satisfy, and distributes and gets nowhere, and withdraws from; Otherwise execution in step four;

Step 4: calculate compact code number vector C _Alloc,, described C _AllocFor making the code character utilance maximum of distributing code character, the yardage minimum of the bell idles number vector after the distribution, and assigned code number vector with minimum yardage; Wherein, the assigned code number vector is meant the yardage vector that distributes the code character correspondence, distributes code character to be meant the very big idle code character of distributing to subscriber equipment;

Step 5: more described C _AllocYardage N (C _Alloc) with the magnitude relationship of the maximum yardage restriction of subscriber equipment k; If N (C _Alloc)＞k, then execution in step six; Otherwise execution in step seven;

Step 6: exchange C _AllocWith very big bell idles number vector C in the system of distribution back _Avail' in resource, return step 5; Described exchange is meant with C _AllocTwo code words of middle data transfer rate minimum exchange C for _Avail' in a code word on the High Data Rate component;

Step 7: according to described C _Avail' and described C _AllocFrom very big idle code character T, distribute very big idle code word, withdraw from, comprise the steps:

Step 701: input C _Avail=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈), C _Avail'=(a ₁', a ₂', a ₃', a ₄', a ₅', a ₆', a ₇', a ₈'), C _Alloc=(d ₁, d ₂, d ₃, d ₄, d ₅, d ₆, d ₇, d ₈), T makes i=1, T _Alloc=Φ;

Step 702: judge the size of i, if i＜9, then execution in step 703; Otherwise execution in step 707;

Step 703: if a _i＞a _i', then execution in step 704; Otherwise execution in step 706;

Step 704: from T, distribute d _iThe code word of individual ai component correspondence is to T _Alloc, establishing these code words is c ₁, c ₂..., c _Di, T=T-{c then ₁, c ₂..., c _Di, T _Alloc=T _Alloc+ { c ₁, c ₂..., c _Di;

Step 705: split a among the T _i-a _i'-d _iThe code word of individual ai component correspondence, and correspondingly upgrade C _AvailAnd T;

Step 706:i=i+1 returns step 702;

Step 707: return T _Alloc

2. orthogonal variable spread-spectrum code distribution method in the code division multiple address communication system according to claim 1 is characterized in that described step 4 further comprises the steps:

Step 401: structure original allocation yardage vector C _Initial=(0,0,0,0,0,0, N _RU);

Step 402: subtract the bell idles number vector C that compacts most after computing obtains to distribute by the yardage vector _Avail'=Subt (C _Avail, C _Initial), wherein, Subt (C _Avail, C _Initial) indication code number vector C _AvailWith yardage vector C _InitialSubtract computing;

Step 403: subtract computing dispensed yardage vector C by the yardage vector _Alloc=Subt (C _Avail, C _Avail'), wherein, Subt (C _Avail, C _Avail') indication code number vector C _AvailWith yardage vector C _Avail' subtract computing;

3. orthogonal variable spread-spectrum code distribution method in the code division multiple address communication system according to claim 1 is characterized in that: in the described step 6, and described exchange C _AllocWith very big bell idles number vector C in the system of distribution back _Avail' in resource, further comprise the steps:

Step 601: import described C _Alloc, described C _Avail';

Step 602: obtain described C _AllocTwo pairing components of code word of middle data transfer rate minimum are made as e1, e2;

Step 603: totalize according to rate T _Min=2 ^8-e1+ 2 ^8-e2

Step 604: compute vector component label

Step 605: structure decrement yardage vector C _Dec=(a ₁, a ₂, a ₃, a ₄, a ₅, a ₆, a ₇, a ₈), wherein, if e1=e2, then a _E1=2, a _j=0 (j ≠ e1); Otherwise, i.e. e1 ≠ e2, a _E1=1, a _E2=1, a _j=0 (j ≠ e1, j ≠ e1); And structure incremental code number vector C _Inc=(b ₁, b ₂, b ₃, b ₄, b ₅, b ₆, b ₇, b ₈), a wherein _l=1, a _j=0 (j ≠ l);

Step 606: to described C _Avail', add decrement yardage vector after subtracting the incremental code number vector earlier, to yardage vector C _Alloc, add the incremental code number vector behind the decrement yardage vector earlier.

4. orthogonal variable spread-spectrum code distribution method in the code division multiple address communication system according to claim 3 is characterized in that: the described e1 in the described step 602 equates with described e2.

5. orthogonal variable spread-spectrum code distribution method in the code division multiple address communication system according to claim 3 is characterized in that: described e1 and described e2 in the described step 602 are unequal.

6. orthogonal variable spread-spectrum code distribution method in the code division multiple address communication system according to claim 3 is characterized in that: in the described step 606, to described C _Avail' subtract earlier that to add decrement yardage vector behind the incremental code number vector be first C _Avail'=Subt (C _Avail', C _Inc), C again _Avail'=Add (C _Avail', C _Dec), wherein, Add (C _Avail', C _Dec) indication code number vector C _Avail' and yardage vector C _DecAdd computing.

7. orthogonal variable spread-spectrum code distribution method in the code division multiple address communication system according to claim 3 is characterized in that: in the described step 606, and yardage vector C _Alloc, adding the incremental code number vector earlier behind the decrement yardage vector is first C _Alloc=Subt (C _Alloc, C _Dec), C again _Alloc=Add (C _Alloc, C _Inc), wherein, Add adds computing for the yardage vector, corresponding position addition, not-carry.

Images