CN102083216B - Resource distribution method in HSUPA (High Speed Uplink Packet Access) system - Google Patents
Resource distribution method in HSUPA (High Speed Uplink Packet Access) system Download PDFInfo
- Publication number
- CN102083216B CN102083216B CN 200910241626 CN200910241626A CN102083216B CN 102083216 B CN102083216 B CN 102083216B CN 200910241626 CN200910241626 CN 200910241626 CN 200910241626 A CN200910241626 A CN 200910241626A CN 102083216 B CN102083216 B CN 102083216B
- Authority
- CN
- China
- Prior art keywords
- mandate
- power
- spreading factor
- speed
- dispatched users
- 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 invention provides a resource distribution method in an HSUPA (High Speed Uplink Packet Access) system. The method comprises the following steps of: after authorized power distributed to a scheduling user is determined according to a traditional mode, calculating authorized rates corresponding to various selectable spreading factors under the authorized power; in all authorized rates larger than a data source rate, selecting the spreading factor with a maximum value as a spreading factor transferred to the scheduling user; and calculating a normalized authorized power PRRI (Pulse Rate Rising Index) according to the spreading factor and the stored authorized power. Through the method, the utilization ratio of code resources can be increased, and the uplink cell throughput is effectively inceased.
Description
Technical field
The present invention relates to the resource allocation techniques in the communication system, particularly the resource allocation methods in a kind of HSUPA system.
Background technology
In the tradition HSUPA dispatching algorithm, NodeB is user's assigns authorized power, and user's maximum data rate is power mandate speed under this authorization power.When distributing power resource for the user, when power mandate speed during greater than data source speed, to disturb NodeB can reduce the power mandate in order reducing, to be slightly larger than data source speed up to power mandate speed, at this moment corresponding performance number is distributed to the user as authorization power.The benefit of Chu Liing is to reduce the UE transmitting power as far as possible to reduce the interference to the adjacent area like this.
The idiographic flow of above-mentioned resource allocation methods comprises:
Step 101, for a dispatched users, after disturbing control in minizone and the residential quarter, NodeB determines to distribute to this user's initial authorization power β
e
Step 102 is calculated current authorization power β
eUnder power mandate speed, whether judge power mandate speed greater than data source speed, if then execution in step 103, otherwise execution in step 104.
Wherein, can calculate corresponding mandate speed R according to authorization power and spreading factor SF
SF, the power mandate speed under the current authorization power refers to corresponding authorization power β
eMake up the mandate speed R that calculates with various optional spreading factors
SFIn maximum mandate rate value.
Step 103 deducts step delta β with current authorization power, and the difference result as new current authorization power, is returned step 102.
Step 104 adds step delta β with current authorization power, with difference β as a result
E1As the authorization power of distributing to the user, and execution in step 105.
Step 105 is with authorization power β
E1The spreading factor of following power mandate speed correspondence is as the spreading factor that passes to the user, according to β
E1Calculate PRRI with this spreading factor and send to the user.
So far, the resource allocation methods flow process finishes.
In the TD-SCDMA system, sign indicating number is resource-constrained more serious, particularly under 2:4 networking situation, up HSUPA can only take a time slot usually, too much reduce the power mandate and will inevitably improve taking of yard resource, appear at the situation of disturbing the very little user of the next data source speed of not serious situation to take time slot possibly, cause other data users can't this time slot of code division multiplexing, must cause the decline of cell uplink throughput.
Summary of the invention
In view of this, the invention provides the resource allocation methods in a kind of HSUPA system, can increase the utilance of yard resource, under multi-user's scene, effectively improve the uplink cells throughput.
For achieving the above object, the present invention adopts following technical scheme:
Resource allocation methods in a kind of HSUPA system comprises:
A, determine initial authorization power for dispatched users, and with it as current authorization power;
Maximum mandate speed under b, the current authorization power of calculating, judge that this maximum mandate speed is whether greater than the data source speed of described dispatched users, if, current authorization power is reduced a step-length, return step b, otherwise current authorization power is raise after the step-length as the authorization power of distributing to described dispatched users, and preserve;
This method further comprises behind step b:
C, under the described authorization power of preserving, calculate the mandate speed of various optional spreading factor correspondences, in the described mandate speed greater than described data source speed, select the spreading factor of value maximum as the spreading factor that passes to described dispatched users, calculate normalized power mandate PRRI according to the described authorization power of preserving and the spreading factor of selecting, and send to described dispatched users.
As seen from the above technical solution, among the present invention, after determining to distribute to the authorization power of dispatched users according to existing mode, under this authorization power, calculate the mandate speed of various optional spreading factor correspondences, in each mandate speed greater than data source speed, select the spreading factor of value maximum as the spreading factor that passes to dispatched users, and calculate normalization authorization power PRRI according to the authorization power of this spreading factor and preservation.By the way, under same authorization power, select the bigger spreading factor of value as far as possible, thereby the sign indicating number resource that dispatched users is taken is few as far as possible, make other dispatched users can the identical time slot of code division multiplexing, thereby improve the utilance of sign indicating number resource, effectively improve the uplink cells throughput.
Description of drawings
Fig. 1 is the simulating scenes schematic diagram.
Fig. 2 compares schematic diagram for the cell throughout of the present invention and background technology method.
Fig. 3 compares schematic diagram for the spreading factor of distributing to dispatched users in the present invention and the background technology method.
Fig. 4 compares schematic diagram for the authorization power of distributing to dispatched users in the present invention and the background technology method.
Fig. 5 compares schematic diagram for the PRRI that distributes to dispatched users in the present invention and the background technology method.
Embodiment
For making purpose of the present invention, technological means and advantage clearer, below in conjunction with accompanying drawing the present invention is described in further details.
Basic thought of the present invention is: preferentially carry out code division multiplexing to improve the HSUPA cell throughout in the process that reduces authorization power.
In the resource allocation methods that background technology is described, when the maximum mandate speed (being power mandate speed) of initial authorization power correspondence during greater than data source speed, NodeB progressively reduces authorization power, and maximum mandate speed and the data source speed of authorization power correspondence compares after will reducing, thereby determines to distribute to the authorization power of dispatched users.After determining to distribute to the authorization power of dispatched users, with maximum spreading factor of authorizing the speed correspondence under this authorization power, as the spreading factor that passes to dispatched users.And in fact, under the authorization power of determining, different spreading factor values can calculate different mandate speed, select maximum spreading factor of authorizing the speed correspondence, and do not consider other spreading factors, and may cause the spreading factor value chosen less, cause the sign indicating number resource that takies more, thereby make that other data users can't the identical time slot of code division multiplexing, reduce throughput.
Based on above-mentioned analysis, among the present invention, after determining to distribute to the authorization power of dispatched users, under this authorization power, calculate the mandate speed of various optional spreading factor correspondences, and in the mandate speed greater than data source speed, select the spreading factor of value maximum, thereby under identical authorization power and same disturbance, take the sign indicating number resource of trying one's best few, improve the probability of code division multiplexing, improve the uplink cells throughput.
Concrete resource allocation methods flow process of the present invention comprises:
Step 203 deducts step delta β with current authorization power, and the difference result as new current authorization power, is returned step 202.
Step 204 adds step delta β with current authorization power, will with value β as a result
E1As the authorization power of distributing to the user, and preserve.
The operation of above-mentioned steps 201-204 is identical with the operation of step 101-104 in the background technology, just repeats no more here.
Step 205, the authorization power β that is preserving
E1Down, calculate the mandate speed of various optional spreading factor correspondences, in the mandate speed greater than data source speed, select the spreading factor of value maximum as the spreading factor that passes to dispatched users, according to the authorization power β that preserves
E1Calculate normalized power mandate PRRI with the spreading factor of selecting, and send to dispatched users.
In this step, at authorization power β
E1Calculate the corresponding mandate speed R of various optional spreading factors (being generally from SF8 to SFmin) down,
SF8..., R
SFminWherein, SFmin is determined by the size of HSUPA resource pool.Concrete calculating authorizes the mode of speed identical with existing mode.
In the various mandate speed that calculate, at first select the mandate speed greater than data source speed, in the mandate speed of selecting, select the spreading factor of value maximum as the spreading factor that passes to dispatched users again.Like this, just can under authorization power, distributing under user's the prerequisite of mandate speed greater than data source speed, for the user distributes minimum sign indicating number resource, thereby reserve more sign indicating number resource, utilize for other data users, thus the probability of raising code division multiplexing.
At last, according to the authorization power calculating PRRI of the spreading factor of selecting and preservation, and send to dispatched users.
So far, the resource allocation methods flow process among the present invention finishes.
Below carry out emulation by the resource allocation methods that resource allocation methods of the present invention and background technology are described the result, the advantage that the present invention possesses with respect to the method for background technology is described.
Concrete simulating scenes schematic diagram as shown in Figure 1,2 the HSUPA small data quantity users in single residential quarter, data source speed is about 67k, HSUPA takies 1 time slot.
Fig. 2 has provided the simulation result of cell throughout under two kinds of methods.Wherein, the cell throughout under the curve 201 expression background technology methods, the cell throughout under curve 202 expression the inventive method.As seen from Figure 2, the cell throughout under the inventive method is 2 times of cell throughout under the background technology method.
Fig. 3 has provided the spreading factor of distributing to dispatched users under two kinds of methods.The spreading factor that distributes under the curve 301 expression background technology methods wherein, the spreading factor that distributes under curve 302 expression the inventive method.As seen, spreading factor is that 2,2 users can the identical time slot of code division multiplexing under the inventive method.
Fig. 4 has provided the authorization power of dispatched users under two kinds of methods, and as seen from Figure 4, the authorization power of two kinds of methods is identical, therefore increases and disturbs.
Fig. 5 has provided the PRRI of dispatched users under two kinds of methods.Wherein, the PRRI of dispatched users under the curve 501 expression background technology methods, the PRRI of dispatched users under curve 502 expression the inventive method.As seen, under the inventive method, because the reducing of spreading factor, PRRI value increases to some extent, and corresponding codes speed increases thereupon, owing to there is spreading gain in SF2, so for demodulation without any influence.
By above-mentioned simulation result as seen, method of the present invention increases the sign indicating number resource utilization under the situation that does not increase interference, can effectively improve the uplink cells throughput under multi-user's scene; And, owing to increased the code division multiplexing probability of HSUPA business time-slot, under multi-user's scene, can reduce the propagation delay time of small data quantity business.
Being preferred embodiment of the present invention only below, is not for limiting protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (1)
1. the resource allocation methods in the HSUPA system comprises:
A, determine the initial power mandate for dispatched users, and with it as the current power mandate;
Maximum mandate speed under b, the current authorization power of calculating, judge that this maximum mandate speed is whether greater than the data source speed of described dispatched users, if, the current power mandate is reduced a step-length, return step b, otherwise the current power mandate is raise after the step-length as the power mandate of distributing to described dispatched users, and preserve;
It is characterized in that this method further comprises behind step b:
C, under the described power mandate of preserving, calculate the mandate speed of various optional spreading factor correspondences, in the described mandate speed greater than described data source speed, select the spreading factor of value maximum as the spreading factor that passes to described dispatched users, calculate the normalized power mandate according to the described power mandate of preservation and the spreading factor of selecting, and send to described dispatched users.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910241626 CN102083216B (en) | 2009-11-27 | 2009-11-27 | Resource distribution method in HSUPA (High Speed Uplink Packet Access) system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910241626 CN102083216B (en) | 2009-11-27 | 2009-11-27 | Resource distribution method in HSUPA (High Speed Uplink Packet Access) system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102083216A CN102083216A (en) | 2011-06-01 |
| CN102083216B true CN102083216B (en) | 2013-09-25 |
Family
ID=44088913
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200910241626 Expired - Fee Related CN102083216B (en) | 2009-11-27 | 2009-11-27 | Resource distribution method in HSUPA (High Speed Uplink Packet Access) system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102083216B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107567057B (en) * | 2016-06-30 | 2022-04-15 | 中兴通讯股份有限公司 | Dynamic control method and device for improving cell uplink throughput and baseband board |
-
2009
- 2009-11-27 CN CN 200910241626 patent/CN102083216B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN102083216A (en) | 2011-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103716888B (en) | Control channel resource allocation method and base station | |
| CN102026390B (en) | Base station and resource allocation method for realizing interference coordination among cells | |
| CN102377489B (en) | Light user network | |
| CN102143593A (en) | Combined adaptive resource allocation method and device for PDCCH (Physical Downlink Control Channel) | |
| CN103781118A (en) | Heterogeneous wireless network access control and resource distribution joint method based on multiple services | |
| CN106412927A (en) | Optimal resource distribution method for cooperative transmission energy collection cognitive radio network | |
| CN105230096B (en) | Passive intermodulation signal interference dispatching method and device | |
| AU2003228299A1 (en) | Method and system for performing call admission control in the uplink for third generation wireless communication systems | |
| CN103269487A (en) | Femtocell network down link dynamic interference management method based on game theory | |
| CN102404838A (en) | Uplink resource allocation method and uplink resource allocation device | |
| CN105101383B (en) | Power distribution method based on frequency spectrum share efficiency maximum | |
| CN108834175A (en) | Equipment access and the resource allocation joint control method of queue driving in a kind of mMTC network | |
| CN102083216B (en) | Resource distribution method in HSUPA (High Speed Uplink Packet Access) system | |
| CN105978673B (en) | Based on the pilot distribution method of user distance in large-scale distributed antenna system | |
| CN109982439A (en) | The channel resource allocation method of D2D communication system based on cellular network | |
| CN103458520A (en) | Allocation method and device of uplink frequency domain resources | |
| CN103052073A (en) | Frequency spectrum resource distribution method based on user rate requirement in heterogeneous wireless network | |
| CN102984717A (en) | Method and system for system capacity estimation | |
| CN101815300A (en) | Cell frequency assignment method and device in TD-SCDMA (Time Division-Synchronization Code Division Multiple Access) system | |
| CN109565756A (en) | For controlling the method, mobile station and base station of transmission power | |
| CN101605392A (en) | A kind of collocation method and system of E-HICH signature sequence group | |
| CN112929837B (en) | Dynamic control method and device for radio remote unit | |
| CN105763377B (en) | One kind being based on the self-adjusting WLAN accidental access method of step-length | |
| CN102932809B (en) | Uplink interference estimation and control method | |
| CN102958090A (en) | Method and device for evaluating channel performance |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130925 Termination date: 20161127 |