CN1275402C - Channel code list renormalizing method for WCDMA system - Google Patents
Channel code list renormalizing method for WCDMA system Download PDFInfo
- Publication number
- CN1275402C CN1275402C CN 03146874 CN03146874A CN1275402C CN 1275402 C CN1275402 C CN 1275402C CN 03146874 CN03146874 CN 03146874 CN 03146874 A CN03146874 A CN 03146874A CN 1275402 C CN1275402 C CN 1275402C
- Authority
- CN
- China
- Prior art keywords
- code word
- codeword set
- code
- weights
- tree
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The present invention relates to a reforming method of a channelizing code list of a WCDMA system. Three properties of allocation states, weight values and user numbers are used for describing the allocation conditions of code characters in the channelizing code list. According to the generation characteristics of channelizing codes, all the channelizing codes of a down run link of a subzone are formed into a complete binary tree, and the total number of corresponding nodes of each layer is equal to the magnitude of a spreading factor. The present invention comprises the following steps: (1), input spreading factor parameters are received, and subcode list reformation is carried out on a subcode tree corresponding to the spreading factor; (2), a code character aggregation which can be reformed and a code character aggregation which can not be reformed are constructed; (3), elements of the code character aggregation which can be reformed and the code character aggregation which can not be reformed are screened and ordered; (4), the allocated code characters on an element subcode tree of the code character aggregation which can be reformed are moved onto the element subcode tree of the code character aggregation which can not be reformed. The method of the present invention can quickly and effectively reform the subcode trees, and the probability of influencing the capacity of systems because of the restriction of code resources is reduced.
Description
Technical field
The present invention relates to the method that the channelizing code table is reformed in a kind of WCDMA communication system, especially relate to a kind of method of channelizing code table reformation of WCDMA communication system down link link.
Background technology
The WCDMA communication system is to adopt sign indicating number to divide the work mode, after the physical channel framing, need carry out the operation of spread spectrum and scrambler, spread spectrum is by the signal that injects a higher frequency baseband signal to be expanded to a radio-frequency (RF) communication system in the wideer frequency band, and the energy that promptly transmits is extended in the wideer frequency band it is seemed as noise.Adopt spread spectrum, the corresponding spreading code of the simple introducing in the somewhere of transmitting chain before antenna, this process just is called spread processing, consequently with in diffusion of information to the wideer frequency band; Data are removed spreading code before recovering in receiving link, are called despreading, and despreading is to rebuild information on the original bandwidth of signal.Compare with the arrowband technology of rule, the spread spectrum process is a kind of broadband technology.
In the transmitter of WCDMA communication system, spread spectrum multiplies each other with a high-speed figure sequence and digital signal exactly, and data symbol is converted to a series of chips, so that improve the speed of numerical chracter, increases signal bandwidth.Being used for the Serial No. symbol of translation data is called the orthogonal channel sign indicating number, and the number of chips that each symbol is converted into is called spreading factor; Scrambler operation is exactly to multiply each other with a pseudo-random code sequence and spreading code, and signal is encrypted, this pseudo-random code sequence just is called scrambler, and the chip after operating through scrambler looks like the data of having been upset; Down direction adopts the orthogonal channel sign indicating number in the WCDMA communication system, distinguishes physical channel, and up direction adopts scrambler to distinguish the user.Yet, because a sub-district has only an orthogonal channel code table, the structure of orthogonal channel code tree as shown in Figure 1, spreading factor is more little, the number of orthogonal channel sign indicating number is just few more; Code word is the high speed spreading code on the code tree of little spreading factor correspondence, and code word is low speed spreading code (being relative notion with low speed at a high speed herein) on the code tree of big spreading factor correspondence.And the orthogonal channel sign indicating number has following characteristics:
(1) code word that any node code word on node code word and its subcode tree all is not assigned with of only likeing father, like son just can be assigned with;
(2) after code word is assigned with, will block to fall all low speed spreading codes on its subcode tree and its high speed spreading code to the root path;
Therefore orthogonal variable frequency extension factor code (OrthogonalVariable Spreading Factor-OVSF) is valuable scarce resource in WCDMA mobile communication system, the limited amount of orthogonal variable frequency extension factor code, make mobile communication system can insert as much as possible user, can transmit a plurality of high-rate services again, just need to consider when distributing the channel code of low rate traffic, to mask less the low code word of spreading factor as far as possible.Promptly must consider sign indicating number reasonable resources use problem, so that distribute the blocking rate minimum that causes code tree after yard resource, and the size of the blocking rate of code table is directly closely related with the capacity of system, so optimized distribution sign indicating number resource method is for the capacity that increases system or to reduce the blocking rate of system just very meaningful.Although can guarantee that the blocking rate of caused channelizing code table is minimum by the optimized distribution method in minute timing, but since user's interrupt communication be at random with frequent, so will cause in the channelizing code table just very scattered after operation a period of time in occupied code word in system, this channelizing code table is just as a very broken net, thereby make that the code word of some two-forties is occupied and can not distribute, so just make the capacity of system owing to resource-constrained reduction of sign indicating number; So, therefore need in communication process, carry out code table and reform to the channelizing code table in order to make the capacity of system avoid influenced as far as possible because of the sign indicating number resource.
Obviously prior art exists deficiency and defective, and awaits improving.
Summary of the invention
Purpose of the present invention just provides a kind of feasible and simple channel code reforming method, be applied in the WCDMA communication system, the reformation scheme of the downgoing channelized codes code table of a kind of broadband CDMA system that it provides, utilize the distribution state of record code word allocation situation, three attributes of weights and number of users, and the complete binary tree that channel code constitutes carries out the code table reformation, its objective is situation generation for the capacity that reduces the system that influences because sign indicating number is resource-constrained as far as possible, make that reducing code word as far as possible moves the risk of dropped calls that is brought, simultaneously can code tree be used fully again, also reduce the capacity of the system that influences because sign indicating number is resource-constrained as far as possible.
Technical scheme of the present invention is as follows:
The method that a kind of WCDMA system channel code table is reformed, it adopts distribution state, weights and the allocation situation of three attribute description code words of number of users in code table; All channel codes that the down link of sub-district is set constitute a complete binary tree, the node sum of every layer of correspondence of this complete binary tree equals the size of spreading factor, its maximum weights of layer that corresponding described spreading factor is big more are more little, and the maximum weights of its high one deck equal the maximum weights sum of the left and right sides node of its child node place layer; Said method comprising the steps of:
1) the spreading factor parameter of acceptance input is carried out the subcode table and is reformed on the subcode tree of this spreading factor correspondence;
2) make up reformable codeword set and non-reformation codeword set according to following definition:
Reformable codeword set: in the described complete binary tree on certain layer weights be not equal to zero and be unappropriated codeword set smaller or equal to the predetermined ratio and the distribution state of the maximum weights of this layer; Non-reformation codeword set: go up weights greater than the described predetermined ratio of the maximum weights of this layer but less than the maximum weights of this layer for certain layer in the described complete binary tree, and the subcode of the null code word of distribution state or this layer correspondence tree to go up distribution state be the codeword set that the subcode tree that public physic channel uses is arranged;
3) element to described reformable codeword set and described non-reformation codeword set sorts according to the weights size respectively, and the principle of two set orderings is opposite;
4) judge whether reformable codeword set is empty, as be empty that then the code table reformate flow finishes; As non-NULL, then continue;
5) code word that is assigned with on the tree of the element subcode in the described reformable codeword set is moved on on the subcode tree of element in the described non-reformation codeword set, the idle code word that does not need in the non-as described reformation codeword set, then move between the element in described reformable codeword set, seek to weights time little element subcode tree from the element subcode tree beginning of weights maximum
Until the element that finds idle code word maybe will move, the code table reformate flow finishes.
Described method, wherein, described method can be provided with one and allow the adjustment code word to count parameter, to limit movably code word number; And one the adjusted code word count parameter, in order to write down adjusted code word number.
Described method, wherein, the process that in the described step 3) described reformable codeword set and described non-reformation codeword set is sorted is further comprising the steps of:
3.1) judge that described permission adjusts code word and count parameter and whether be configured to without limits, if be configured to without limits then direct execution in step 3.3), otherwise continue execution in step 3.2;
3.2) code word is adjusted in the number of users in the attribute of an element in the described reformable codeword set and described permission counted parameter and compare, as the subcode of this element tree go up shared number of users greater than as described in permission adjust code word and count parameter, then need this element is moved in the described non-reformation codeword set;
3.3) element of described reformable codeword set is sorted by weights principle from small to large;
3.4) element in the described non-reformation codeword set is sorted by weights principle from big to small.
Described method, wherein, the code word moving process of described step 5) is further comprising the steps of:
5.1) code word on the subcode tree of first element from described reformable codeword set begins to move;
5.2) judge whether described reformable codeword set moves and finish and be empty set, as be empty set, then code table reformate flow end; Otherwise flow process continues;
5.3) judge that described adjusted code word counts parameter and whether adjust code word less than described permission and count parameter, as not being that then the code table reformate flow finishes; In this way, then flow process continues;
5.4) seek the code word that is assigned with on the subcode tree of this element;
5.5) the idle code word of searching from described non-reformation codeword set;
5.6) judge whether in described non-reformation codeword set, to find idle code word, continue execution in step 5.7 if find, otherwise seek idle code word from described reformable codeword set, as also can not find idle code word in this reformable codeword set, then the code table reformate flow finishes;
5.7) revise the distribution state of described idle code word and the described code word that is assigned with: make in the attribute of described idle code word distribution state for distributing to the dedicated channel use, weights are the maximum weights of this layer, number of users is 1, the corresponding simultaneously attribute of adjusting this code word father and son node; Make that distribution state is unallocated state in the attribute of the described code word that is assigned with, weights are zero, the corresponding simultaneously attribute of adjusting this code word father and son node, and described adjusted code word is counted parameter add 1;
5.8) judge whether the number of users in this attribute of an element equals 0, in this way, then this element is deleted, return step 5.2 from described reformable codeword set) the next element of described reformable codeword set is moved; As not, then return step 5.3), other code words that need move on the subcode tree of this element are moved.
Described method, wherein, described step 5.5) the idle code word of searching is to begin to carry out from first element from described non-reformation codeword set, specifically may further comprise the steps:
5.5.1) according to the weights size of this element, judge whether this subcode tree can distribute the code word of the spreading factor respective layer at the described code word place that is assigned with: whether the maximum weights sum of the weights of this element and this spreading factor respective layer is greater than the maximum weights of this element place spreading factor respective layer, in this way, show that this element can not distribute, repeat this step the next element in the described reformable codeword set is judged; As not, then carry out next step;
5.5.2) on the subcode tree of this element, seek, directly judged whether idle code word to described spreading factor respective layer.
Described method, wherein, described predetermined ratio is 1/2nd.
The method that a kind of WCDMA system channel code table provided by the invention is reformed, owing to adopted allocation situation distribution state to the code word in the channelizing code table, three attributes of weights and number of users are described, utilize all channel codes of the down link of sub-district to constitute a complete binary tree simultaneously, and this complete binary tree operated, the antithetical phrase code tree is reformed fast and effectively, can use the sign indicating number resource more fully, consider that simultaneously code word moves the risk of dropped calls that is brought, consider the reformation scheme of code table from stability two aspects of the utilance of sign indicating number resource and system, reduced to influence the probability of power system capacity because sign indicating number is resource-constrained.And the present invention also defined the trigger mechanism that code table is reformed, and avoided frequent code table adjustment, reduced the consumption of resource, also reduced code word simultaneously on another meaning and moved the risk of dropped calls that is brought.
Description of drawings
Fig. 1 is a channel code list structure schematic diagram in the prior art;
Fig. 2 is the main flow chart that the channelizing code table of the inventive method is reformed;
Fig. 3 is reformable codeword set of the inventive method and the flow chart that the element in the non-reformation codeword set screens and sorts;
Fig. 4 is the subcode tree reformate flow figure of each code word in the reformable codeword set of the inventive method;
Fig. 5 is that the code table code word before the code table of the inventive method is reformed takies the situation schematic diagram;
Fig. 6 is that the code table code word of utilizing the inventive method to carry out after code table is reformed takies the situation schematic diagram.
Embodiment
Below in conjunction with accompanying drawing,, will make technical scheme of the present invention and beneficial effect thereof apparent by detailed description to preferred embodiment of the present invention.
At first notions more of the present invention and attribute are done following explanation:
A core feature of the inventive method is exactly to describe the allocation situation of code word in described channelizing code table with distribution state, weights and three attributes of number of users; According to the generation characteristics of channel code, can constitute a complete binary tree to all channel codes of the down link of sub-district, for down direction, whole code tree has 8 layers, corresponding spreading factor SF={4,8,16,32,64,128,256,512}.Go up the size that corresponding node sum equals spreading factor for every layer.The numerical value that three attributes of code word specifically can be provided with is: distribution state Flag: can be made as 3 values, represent 0 unallocated state respectively, 1 distributes to the state that dedicated channel is used, the state of the shared and shielding code word of 2 common signal channels; Weights W eight and number of users usernum: if certain code word is assigned with, then the number of users of this node adds 1, and Flag=0 is unallocated for its initial value, Weight=0, number of users=0.Described spreading factor SF={4,8,16,32,64,128,256, the setting principle of every layer of maximum weights of pairing node of 512} is: the maximum weights minimum of spreading factor SF=512, the maximum weights size of high one deck (being that spreading factor SF is more little) equals the maximum weights sum of the left and right sides node of its child node place layer.If node is assigned with and is used by dedicated channel, then make the distribution state Flag=1 dedicated channel of this node distribute, the maximum weights MaxWeight[i of weights Weight=spreading factor respective layer], number of users usernum adds 1, wherein i is the pairing layer of the spreading factor SF of application, revise the weights of corresponding father node and child node then, revise the number of users of corresponding father node, distribution state need not be revised.When distribute code word or discharging code word, the weights of the father node of this code word only need add up its corresponding two child nodes weights just can, the weights of all the low speed child nodes under this node all are made as the maximum weights on the respective layer; The number of users of father node also only need add up its corresponding two child nodes number of users just can, the number of users of child node need not to change.
Need to prove that the maximum weights of a certain SF layer correspondence are the fixedly weights of this SF layer correspondence, is the value that pre-sets; And weights are dynamic changes, with the distribution and the release real-time change of channel code.
Below the inventive method used reformable codeword set and non-reformation codeword set are illustrated:
Definition 1: reformable codeword set: weights are not equal to zero and the set that code word constituted that equals 0 smaller or equal to 1/2 maximum weights SFMaxWeight and distribution state Flag on certain spreading factor SF respective layer, and these code words all are that the code word of its subcode tree is shared by the user of dedicated channel.
Definition 2: non-reformation codeword set: weights are greater than the maximum weights SFMaxWeight of 1/2 this layer but less than the maximum weights of this spreading factor SF layer on certain spreading factor SF respective layer, and the subcode tree that distribution state Flag equals to have public physic channel to use on the subcode tree of 0 code word or this spreading factor SF respective layer correspondence is the set that code word constituted of its distribution state Flag=2, and does not need to move for the code word of common down channel.
For the code word in the described non-reformation codeword set, the code word that only allows to be assigned with on the subcode tree of code word in the reformable codeword set moves on on the idle code word of subcode tree of code word in the non-reformation codeword set.
A key factor will considering is because code table is reformed: because the reformation of code word will cause reshuffling of physical channel, so also can increase probability of call, relating to too many user so also try not when code table is reformed reforms, therefore the present invention also is provided with and allows the adjustment code word to count parameter A llowed UpdateCode MaxNum, so that limit the number of users of reshuffling when a code table is reformed.
As shown in Figure 2, the method step of the channelizing code table being reformed for the present invention:
1) according to the spreading factor SF parameter of input, on the subcode tree of this spreading factor SF correspondence, carries out subcode table resurfacing operation; Consider and reduce the complexity that the subcode table reforms and the number of users that relates to is few as far as possible, only the code word weights on this spreading factor SF respective layer are less than or equal to the maximum weights SFMaxWeight of 1/2 spreading factor and distribution state Flag herein and equal 0 code word and move;
2) make up described reformable codeword set and described non-reformation codeword set according to above-mentioned definition;
3) described reformable codeword set and described non-reformation codeword set element are screened and sort;
4) before the code word between described reformable codeword set and the non-reformation codeword set is moved, judge whether reformable codeword set is empty, if empty, then explanation can not be carried out the code table reformation, then the code table reformate flow finishes; Otherwise illustrate that can carry out code table reforms, and continues next step operation;
5) user's (code word that is assigned with) on the tree of the element subcode in the described reformable codeword set is moved on on the subcode tree of element in the described non-reformation codeword set; If the idle code word that does not need in the described non-reformation codeword set, then move between the element in described reformable codeword set, just the principle that moves is to move on to earlier on the element subcode tree of weights maximum, if the idle code word that does not also need on the element subcode of this weights maximum tree, then go up to time little element subcode tree of weights successively and seek, and the like, up to the element that will move or found idle code word, then stop to seek, this code table reformate flow finishes.
The inventive method is also utilized the described permission of setting to adjust code word and is counted parameter, when the code word number that moves in the inventive method has reached this permissions and adjusts code word and count the restriction of parameter A llowed Update Code MaxNum number or described reformable codeword set during for sky, then stop the code table reformate flow, can limit the number of mobile code word like this, prevent that the too much code word of carrying out from moving and cause the user to go offline.
If to the number of mobile code word without limits, then can this permission adjusting code word counts parameter A llowed Update Code MaxNum and is set to Infinite and unrestrictedly gets final product.
The process of in the step 3) described reformable codeword set and described non-reformation codeword set element being screened described in the inventive method and sorting mainly comprises the steps, as shown in Figure 3:
3.1) whether what judge at first that described permission adjusts that code word counts parameter A llowed Update Code MaxNum configuration is unrestricted, if then directly described reformable codeword set and described non-reformation codeword set are sorted execution in step 3.3);
3.2) code word is adjusted in the number of users usernum in the attribute of an element in the described reformable codeword set and this permission counted parameter A llowed Update Code MaxNum and compare, allow the adjustment code word to count parameter A llowedUpdate Code MaxNum if the subcode of this element tree goes up shared number of users usernum greater than this, then need this element is moved in the described non-reformation codeword set;
3.3) element in the described reformable codeword set is sorted by weights principle from small to large, this is because the code word of weights minimum finds the probability maximum of idle code word on other code tree, thereby the probability that is available of this code tree is also maximum, thus when code table is reformed from the code word of weights minimum;
3.4) element in the described non-reformation codeword set is sorted by weights principle from big to small, the user is moved on on the fuller subcode tree of occupancy so as far as possible.
As shown in Figure 4, the moving process of code word mainly comprises the steps: in the step 5) in the inventive method
5.1) code word on the subcode tree of first element from described reformable codeword set begins to move;
5.2) judge whether described reformable codeword set finishes for empty set promptly moves, if empty set, then the code table reformate flow finishes; Otherwise flow process continues execution in step 5.3);
5.3) judge that described adjusted code word counts parameter and whether adjust code word less than described permission and count parameter A llowed Update Code MaxNum, if execution in step 5.4 then), otherwise the code table reformate flow finishes;
5.4) on the subcode tree of this element, seek the code word subcodenumi that is assigned with;
5.5) the idle code word of searching from described non-reformation codeword set;
Its basic finding method is as follows: look for from described non-reformable codeword set earlier, look for the time from first element, look for to reformable set if can not find again, because of two set orderings different, so be to look for from last element, concrete step is as follows:
5.5.1) at first can judge the code word whether this subcode tree can distribute the described code word subcodenumi place spreading factor SF respective layer shiftlayer that is assigned with from the weights size of this element, judgment formula is as follows: whether the maximum weights sum of the weights of this element and the corresponding shiftlayer layer of this spreading factor is greater than the maximum weights of this element place spreading factor SF respective layer root_sf; If greater than showing that then this element can not be assigned with, then repeat this step and continue the next element in this reformable codeword set is judged;
5.5.2) otherwise explanation can continue seeking on the subcode tree of this element, has directly judged whether that to the corresponding shiftlayer layer of described spreading factor idle code word gets final product; If be optimized, also can adopt the method for 02137559.3 " a kind of dynamic adjusting method of WCDMA system channel sign indicating number " patent application of the applicant on the subcode tree of this element, to seek idle code word, if find idle code word, then return; If do not find, then return step 5.5.1) continue to seek on the next element subcode tree in described reformable codeword set;
5.6) because might in described non-reformation codeword set, can not find needed idle code word idlecodenum, do not need idle code word if in this non-reformation codeword set, find, then execution in step 5.11) in described reformable codeword set, seek; Otherwise after having found the described idle code word that needs, execution in step 5.7);
5.7) revise the described code word subcodenumi that is assigned with and the distribution state of the idle code word idlecodenum that finds: make the attribute assignment state Flag=1 of described idle code word distribute, the maximum weights SFMaxWeight of weights Weight=, number of users usernum=1; Adjust the attribute of this code word father and son node simultaneously, the number of users usernum of its child node need not revise; Make the attribute assignment state Flag=0 of the described code word subcodenumi that is assigned with unallocated, weights Weight=0 adjusts the attribute of this code word father and son node simultaneously; And described adjusted code word is counted parameters u pdatenum add 1;
5.8) judge whether this attribute of an element number of users usernum equals 0; If equal 0, showing that the code word that is assigned with on the subcode tree of this element has all moved finishes, execution in step 5.9) this element is deleted from described reformable codeword set, show that this element has been available, execution in step 5.10) the next element in the described reformable codeword set is moved, return step 5.2); Otherwise the subcode tree that shows this element goes up the code word that also has needs to move, execution in step 5.3) search again and adjust;
5.11) in described reformable codeword set, seek idle code word, execution in step 5.12 then); Below in described reformable codeword set, seeking the method for idle code word: because described reformable codeword set sorts from small to large by weights, begin so seek idle code word last element from described reformable codeword set, the method for the idle code word of searching is identical on the subcode tree of the method for seeking idle code word on the subcode of this element tree and element in described non-reformation codeword set;
5.12) because might in described reformable codeword set, can not find needed idle code word idlecodenum, do not need idle code word if find in the described reformable codeword set yet, then the code table reformate flow finishes; Otherwise illustrate and in this reformable codeword set, found the idle code word that needs, execution in step 5.7) carry out the code table resurfacing operation.
Below describe a specific embodiment of the present invention in detail:
Concerning a mobile communication system, the distribution of its channel code and release are at random, as shown in Figure 5 and Figure 6, for existing channelization code tree has been distributed and an example of the code word that takies, need to prove, among Fig. 5 just for the drawn part of code tree of the application that the code table reforming method is described.And the code table of the inventive method is reformed at whole code tree, therefore can not come protection scope of the present invention is limited with the specific implementation process that this example is reformed at the given code table of Fig. 5.
At first the legend among Fig. 5 and Fig. 6 is illustrated: the unappropriated idle code word of " zero " blank circular representative; The code word that dedicated channel is used has been distributed in the representative of " ▲ " triangle; The high speed spreading factor code word that " ● " dark circular representative is masked by dedicated channel allocation owing to the code word of low speed spreading factor; The low speed spreading factor code word that on behalf of high speed spreading factor code word, " " square frame masked by dedicated channel allocation;
The code word of common signal channel is distributed in the hexagon representative; " ★ " five-pointed star representative is distributed to the code word of common signal channel and the code word of all father nodes that conductively-closed is fallen.
In Fig. 5, the numbering of channelization code is represented with following expression formula: C
SF, codenum, wherein SF is a spreading factor, codenum is the pairing codeword number of this SF layer; C wherein
32,0Be the code word of distributing to common signal channel, C
16,2, C
32,6, C
32,8, C
32,9, C
16,6, C
16,10, C
32,26, C
32,31By the code word of dedicated channel allocation, take situation as can be seen from the code table of Fig. 5, this moment, the situation that takies of code table was very unreasonable, need carry out code table and reform.Suppose that maximum adjustable code word number are that described permission is adjusted code word and counted parameter A llowed Update Code MaxNum=5, and code table is reformed and is begun to reform from the subcode tree of SF=8.The maximum weights that every SF layer is set in this example are provided with as follows: spreading factor SF={4, and 8,16,32,64,128,256, the maximum weights of the pairing node of 512} layer are respectively MaxWeight={128, and 64,32,16,8,4,2,1}.
Enforcement below in conjunction with 5 pairs of technical schemes of accompanying drawing is further described:
(1) at first needs the spreading factor SF=8 layer reformed, therefore only need make up reformable codeword set and non-reformation codeword set the element of this layer; The weights of the occupied code word of this spreading factor SF=8 layer are respectively: Wight[C
8,0]=16, Wight[C
8,1]=48, Wight[C
8,2]=32, Wight[C
8,3]=32, Wight[C
8,5]=32, Wight[C
8,6]=16, Wight[C
8,7]=16;
(2) principle of reformable codeword set of structure having thus described the invention and non-reformation codeword set can obtain non-reformation codeword set and be { C
8,0, C
8,1, reformable codeword set is { C
8,2, C
8,3, C
8,5, C
8,6, C
8,7;
(3) element of non-reformation codeword set and reformable codeword set is screened and sort: the element of screening non-reformation codeword set in back and reformable codeword set does not change; After sorting, arrangement of elements is as follows in non-reformation codeword set and the reformable codeword set: non-reformation codeword set={ C
8,1, C
8,0, reformable codeword set={ C
8,6, C
8,7, C
8,2, C
8,3, C
8,5;
(4) code word that is assigned with on the subcode tree to element in described reformable codeword set and the described non-reformation codeword set moves:
(4.1) first element from described reformable codeword set begins code word and moves C
8,6The code word that is assigned with on the subcode tree is C
32,26, first Elements C in described non-reformation codeword set
8,1Subcode tree on can find idle code word: C
32,7, as long as this moment is exchange C
32,26And C
32,7The distribution state of code word and separately the attribute of father and son's node get final product; This moment the adjusted code word to count parameter be 1 to be updatenum=1; C
8,6Attribute number of users usernum be 0, then this element is deleted from described reformable codeword set, this reformable codeword set is updated to: { C
8,7, C
8,2, C
8,3, C
8,5; Because described adjusted code word is counted updatenum and counted parameter A llowed Update Code MaxNum less than allowing to adjust code word, the code word that therefore can continue to be assigned with on the subcode tree to the next element in this reformable codeword set moves;
(4.2) code word that is assigned with on the subcode tree to the next element in the described reformable codeword set moves: C
8,7The code word that is assigned with on the subcode tree is C
32,31, second Elements C in described non-reformation codeword set
8,0Subcode tree on can find idle code word: C
32,1, as long as this moment is exchange C
32,31And C
32,1The distribution state of code word and separately the attribute of father and son's node get final product; This moment the adjusted code word to count parameter be 2 to be updatenum=2; C
8,7Attribute number of users usernum be 0, then this element is deleted from described reformable codeword set, this reformable codeword set is updated to: { C
8,2, C
8,3, C
8,5; Because described adjusted code word is counted parameters u pdatenum and counted parameter A llowed UpdateCode MaxNum less than described permission adjustment code word, the code word that therefore can continue to be assigned with on the subcode tree to the next element in this reformable codeword set moves;
(4.3) code word that is assigned with on the subcode tree to the next element in this reformable codeword set moves: C
8,2The code word that is assigned with on the subcode tree is C
32,8And C
32,9, first Elements C in this non-reformation codeword set
8,0Subcode tree on can find idle code word: C
32,2And C
32,3, as long as this moment is exchange C
32,8And C
32,2, C
32,9And C
32,3The distribution state of code word and they attribute of father and son's node separately get final product; This moment the adjusted code word to count parameter be 4 to be updatenum=4; C
8,2Attribute number of users usernum be 0, then this element is deleted from described reformable codeword set, this reformable codeword set is updated to: { C
8,3, C
8,5; Because the adjusted code word is counted parameters u pdatenum and still counted parameter A llowed Update Code MaxNum less than described permission adjustment code word, the code word that therefore can continue to be assigned with on the subcode tree to the next element in this reformable codeword set moves;
(4.4) code word that is assigned with on the subcode tree to the next element in the described reformable codeword set moves: C
8,3The code word that is assigned with on the subcode tree is C
16,6, the principle of seeking idle code word according to the inventive method can be easy to judge all do not have assignable code word on the subcode of the element tree in the described non-reformation codeword set, therefore need be from last Elements C the described reformable codeword set
8,5Subcode tree go up and seek idle code word, the idle code word that finds is C
16,11Exchange C
16,6And C
16,11The distribution state of code word and separately the attribute of father and son's node get final product; This moment the adjusted code word to count parameter be 5 to be updatenum=5; C
8,3Attribute number of users usernum be 0, then this element is deleted from described reformable codeword set, this reformable codeword set is updated to: { C
8,5; Because to be described adjusted code word count that parameters u pdatenum equaled that described permission adjusts code word counts parameter A llowed UpdateCode MaxNum for this, this moment, the code table reformate flow finished;
(4.5) as shown in Figure 6, through behind the above-mentioned code table reformate flow, code word C on this one deck of spreading factor SF=8
8,2, C
8,3, C
8,6, C
8,7Become idle code word; So just for after high rate user tap into profuse sign indicating number resource be provided, avoided because cause the resource-constrained capacity that influences system of sign indicating number in the channelizing code table because of occupied code word is very scattered.
Certain code word to a sub-district is reformed, and can improve the utilance of code table, improves the capacity of system.And adopt technical scheme of the present invention, the subcode tree that can be fast and effectively the code word of channelizing code table be constituted is reformed, can use the sign indicating number resource more fully, consider that simultaneously code word moves the risk of dropped calls that is brought, design code table reformation scheme of the present invention from the utilance of sign indicating number resource and stability two aspects of system, reduced to influence the probability of power system capacity as far as possible because sign indicating number is resource-constrained.Also defined the trigger mechanism that code table is reformed in the technical scheme of the present invention in addition, avoided frequent code table adjustment, can reduce the consumption of resource thus, on another meaning, also reduced code word simultaneously and moved the risk of dropped calls that is brought.
Be understandable that, for those of ordinary skills, can be equal to replacement or change according to technical scheme of the present invention and inventive concept thereof, and all these changes or replacement all should belong to the protection range of the appended claim of the present invention.
Claims (6)
1, a kind of method of WCDMA system channel code table reformation, it adopts distribution state, weights and the allocation situation of three attribute description code words of number of users in code table; All channel codes that the down link of sub-district is set constitute a complete binary tree, the node sum of every layer of correspondence of this complete binary tree equals the size of spreading factor, its maximum weights of layer that corresponding described spreading factor is big more are more little, and the maximum weights of its high one deck equal the maximum weights sum of the left and right sides node of its child node place layer; Said method comprising the steps of:
1) the spreading factor parameter of acceptance input is carried out the subcode table and is reformed on the subcode tree of this spreading factor correspondence;
2) make up reformable codeword set and non-reformation codeword set according to following definition:
Reformable codeword set: in the described complete binary tree on certain layer weights be not equal to zero and be unappropriated codeword set smaller or equal to the predetermined ratio and the distribution state of the maximum weights of this layer; Non-reformation codeword set: go up weights greater than the described predetermined ratio of the maximum weights of this layer but less than the maximum weights of this layer for certain layer in the described complete binary tree, and the subcode of the null code word of distribution state or this layer correspondence tree to go up distribution state be the codeword set that the subcode tree that public physic channel uses is arranged;
3) element to described reformable codeword set and described non-reformation codeword set sorts according to the weights size respectively, and the principle of two set orderings is opposite;
4) judge whether reformable codeword set is empty, as be empty that then the code table reformate flow finishes; As non-NULL, then continue;
5) code word that is assigned with on the tree of the element subcode in the described reformable codeword set is moved on on the subcode tree of element in the described non-reformation codeword set, the idle code word that does not need in the non-as described reformation codeword set, then move between the element in described reformable codeword set, seek to weights time little element subcode tree from the element subcode tree beginning of weights maximum, until the element that finds idle code word maybe will move, the code table reformate flow finishes.
2, method according to claim 1 is characterized in that, described method can be provided with one and allow the adjustment code word to count parameter, to limit movably code word number; And one the adjusted code word count parameter, in order to write down adjusted code word number.
3, method according to claim 2 is characterized in that, described step 3) is further comprising the steps of:
3.1) judge that described permission adjusts code word and count parameter and whether be configured to without limits, if be configured to without limits then direct execution in step 3.3), otherwise continue execution in step 3.2;
3.2) code word is adjusted in the number of users in the attribute of an element in the described reformable codeword set and described permission counted parameter and compare, as the subcode of this element tree go up shared number of users greater than as described in permission adjust code word and count parameter, then need this element is moved in the described non-reformation codeword set;
3.3) element of described reformable codeword set is sorted by weights principle from small to large;
3.4) element in the described non-reformation codeword set is sorted by weights principle from big to small.
According to claim 2 or 3 described methods, it is characterized in that 4, the code word moving process of described step 5) is further comprising the steps of:
5.1) code word on the subcode tree of first element from described reformable codeword set begins to move;
5.2) judge whether described reformable codeword set moves and finish and be empty set, as be empty set, then code table reformate flow end; Otherwise flow process continues;
5.3) judge that described adjusted code word counts parameter and whether adjust code word less than described permission and count parameter, as not being that then the code table reformate flow finishes; In this way, then flow process continues;
5.4) seek the code word that is assigned with on the subcode tree of this element;
5.5) the idle code word of searching from described non-reformation codeword set;
5.6) judge whether in described non-reformation codeword set, to find idle code word, continue execution in step 5.7 if find, otherwise seek idle code word from described reformable codeword set, as also can not find idle code word in this reformable codeword set, then the code table reformate flow finishes;
5.7) revise the distribution state of described idle code word and the described code word that is assigned with: make in the attribute of described idle code word distribution state for distributing to the dedicated channel use, weights are the maximum weights of this layer, number of users is 1, the corresponding simultaneously attribute of adjusting this code word father and son node; Make that distribution state is unallocated state in the attribute of the described code word that is assigned with, weights are zero, the corresponding simultaneously attribute of adjusting this code word father and son node, and described adjusted code word is counted parameter add 1;
5.8) judge whether the number of users in this attribute of an element equals 0, in this way, then this element is deleted, return step 5.2 from described reformable codeword set) the next element of described reformable codeword set is moved; As not, then return step 5.3), other code words that need move on the subcode tree of this element are moved.
5, method according to claim 4 is characterized in that, described step 5.5) the idle code word of searching is to begin to carry out from first element from described non-reformation codeword set, specifically may further comprise the steps:
5.5.1) according to the weights size of this element, judge whether this subcode tree can distribute the code word of the spreading factor respective layer at the described code word place that is assigned with, promptly whether the maximum weights sum of the weights of this element and this spreading factor respective layer is greater than the maximum weights of this element place spreading factor respective layer, in this way, show that this element can not distribute, repeat this step the next element in the described reformable codeword set is judged; As not, then carry out next step;
5.5.2) on the subcode tree of this element, seek, directly judged whether idle code word to described spreading factor respective layer.
6, method according to claim 5 is characterized in that, described predetermined ratio is 1/2nd.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 03146874 CN1275402C (en) | 2003-09-19 | 2003-09-19 | Channel code list renormalizing method for WCDMA system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 03146874 CN1275402C (en) | 2003-09-19 | 2003-09-19 | Channel code list renormalizing method for WCDMA system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1527518A CN1527518A (en) | 2004-09-08 |
| CN1275402C true CN1275402C (en) | 2006-09-13 |
Family
ID=34286659
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 03146874 Expired - Fee Related CN1275402C (en) | 2003-09-19 | 2003-09-19 | Channel code list renormalizing method for WCDMA system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1275402C (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100373839C (en) * | 2004-12-23 | 2008-03-05 | 北京北方烽火科技有限公司 | Method of downstream spread spectrum code assignment executed by WCDMA system wireless network controller |
| CN1832381B (en) * | 2005-03-07 | 2010-09-22 | 华为技术有限公司 | Method for improving ultilization ratio of orthogonal variable extended frequency factor code tree |
| CN1984425B (en) * | 2006-04-05 | 2010-09-08 | 华为技术有限公司 | Method for optimizing network by acquiring code resource information |
| CN101047941B (en) * | 2006-04-21 | 2010-08-25 | 华为技术有限公司 | Method and device for controlling license code in high speed downlink package access |
| CN103476134B (en) * | 2013-09-30 | 2017-06-20 | 无锡清华信息科学与技术国家实验室物联网技术中心 | A kind of distributed channel cut-in method of multi-hop wireless network |
-
2003
- 2003-09-19 CN CN 03146874 patent/CN1275402C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1527518A (en) | 2004-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1170378C (en) | Reverse data transmission method and appts. in mobile communication system | |
| CN1541493A (en) | Method and appts. for orthogonal code management in CDMA systems using smart antenna tech background | |
| CN1669287A (en) | Orthogonal variable spreading factor (ovsf) code assignment | |
| CN1674466A (en) | Method for communicating scrambling code id in mobile communication system | |
| CN1808951A (en) | Channel priority queuing method in multi-carrier communication system | |
| CN101043638A (en) | Base station dispatcher, resource distribution module and dispatch control method for HSUPA | |
| CN1151238A (en) | Method of accessing a packet in a cellular digital radio system | |
| CN1568032A (en) | A wireless resource distribution method for mobile communication system | |
| JP2003514432A (en) | Method, apparatus and computer program for code distribution to different data rates in a CDMA system | |
| CN101076181A (en) | Method for selecting access frequency point N frequency-point domain in TD-SCDMA system | |
| CN101079666A (en) | A method for allocating wireless resources in the communication system | |
| CN1178415C (en) | Method and apparatus for assigning walsh codes | |
| CN1275402C (en) | Channel code list renormalizing method for WCDMA system | |
| CN1133337C (en) | Resource allocation | |
| CN1549478A (en) | Up code scrambling distributing method in WCDMA system | |
| CN1581732A (en) | Communication method in radio honeycomb communication system | |
| CN1866906A (en) | Priority processing method for medium access control layer of third generation mobile communication system | |
| CN1788442A (en) | Method and arrangement in a communication system | |
| CN1241345C (en) | Channelizing code resource dynamic optimization distribution method of wideband CDMA system | |
| CN1862980A (en) | Method for allocating multiple basic intermediate codes | |
| US7236512B2 (en) | Code channel allocations in a wireless communications system | |
| CN1925376A (en) | Descending main scrambling code optimum distribution method in broad band CDMA system | |
| CN1581722A (en) | Dynamic distributing method for digital signal processor (DSP) | |
| CN1921689A (en) | System and method for realizing multicast in UTRA TDD HCR system by using descending share channel | |
| CN1617611A (en) | Base station transceiver and resource rearrangement method |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20060913 Termination date: 20130919 |