CN104023399B - For the down channel allocation method based on demand of single carrier base stations system - Google Patents
For the down channel allocation method based on demand of single carrier base stations system Download PDFInfo
- Publication number
- CN104023399B CN104023399B CN201410222180.8A CN201410222180A CN104023399B CN 104023399 B CN104023399 B CN 104023399B CN 201410222180 A CN201410222180 A CN 201410222180A CN 104023399 B CN104023399 B CN 104023399B
- Authority
- CN
- China
- Prior art keywords
- mrow
- mtd
- msub
- mtr
- mover
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of down channel allocation method based on demand for single carrier base stations system, methods described includes prior information acquisition, Service control, User Priority sequence and channel assignment strategy and formulated.The inventive method can make base station realize that downlink throughput capacity approaches downlink capacity, both the business demand of more users had been supported, the different business for multi-user provides different service quality guarantees again, quantifiable distribution according to need is realized to a certain extent, the quality of service requirement of the different business of different user is preferably supported while base station down handling capacity is maximized, there is higher value in theory and actual application.
Description
Technical field
The present invention relates to a kind of distribution method of down channel, and especially a kind of is the descending letter for being directed to single carrier base stations system
Road allocation method based on demand.Belong to radio digital communication technical field.
Background technology
Link circuit self-adapting transmission technology is adaptively to change modulation system, encoding rate and power point according to channel variation
With etc. parameter, error of transmission performance allow in the case of maximally utilise air-link resources.3G, 4G civilian at present
All detailed standard, RRM skill matched in the case have been formulated with WIMAX base station systems for the technology
Art meets that the different quality of service requirement of multiple business is most important to the resource utilization of raising base station system.Base station can be with
According to the subscriber channel status information of acquisition, using the random time varying characteristic of wireless channel, resource allocation to channel condition compared with
Good user, so as to improve the goodput of base station system to greatest extent by multi-user diversity gain, lift base station system
The overall communication performance of system.
Some traditional wireless resource scheduling algorithms, such as various forms of proportional fair algorithms, with allocative efficiency and justice
The compromise of property is starting point, is all only capable of realizing the homoplasy of different user speed, but can not efficiently support that multi-user's is not of the same trade or business
Business rate requirement, that is, distribute according to need.
The content of the invention
The invention aims to solve the defects of above-mentioned prior art, there is provided one kind can be in the case where maximizing as far as possible
While row handling capacity, meet different user should not service rate requirement the down channel for single carrier base stations system by
Need distribution method.
The purpose of the present invention can be reached by adopting the following technical scheme that：
For the down channel allocation method based on demand of single carrier base stations system, the described method comprises the following steps：
1) base station system uses Adaptive Modulation and Coding technology on the basic scheduling block that each time is T, according to user
Channel condition information apply different Modulation and Coding Scheme, and be located in certain a period of time, base station needs to support K uniformly point
Cloth in cell and in static or low mobility state user downlink business demand；
2) prior information obtains：The formulation of channel assignment strategy is using M Scheduling Block as base unit, by prior note
Record, base station obtain channel of the K user within preceding M basic transmission block times in the starting point for formulating channel assignment strategy
Statistic matrix；Wherein M >=1000；
3) based on above-mentioned prior information calculate K user average symbol speed, to K element size in vector from greatly to
It is small to be ranked up, take behindThe data of individual user, obtainThe channel status statistical matrix of individual user, according to
Data in the channel status statistical matrix of individual user, obtainThe channel status maximum of individual user is n probability, so as to
To the channel capacity theoretical value of base station；Wherein n >=1；
4) Service control：If now descending K customer service requires that speed sum is more than channel capacity theoretical value
0.85, then Service control measure is enabled, some inferior grade business are gradually reduced according to the service priority provided in advance
It is required that speed, or even partial service is abandoned, until the requirement speed sum of all business is reduced to channel capacity theoretical value
0.85；If now descending K customer service requires that speed sum is less than the 0.7 of channel capacity theoretical value, business control is enabled
Measure processed, the requirement speed of those speed unrestricted services is improved, managed until business need speed sum is improved to channel capacity
By 0.8 or so of value；
5) priority of K user is ranked up, and channel assignment strategy is formulated according to the priority of K user.
Preferably, channel status statistical matrix of step 2) the K user within preceding M basic transmission block times, such as
Following formula：
Wherein, Prk,nRepresent k-th of user channel status is n within preceding M basic transmission block times number summation and M
Ratio；1≤k≤K, 1≤n≤N.
Preferably, the step 3) is specific as follows：
3.1) the average symbol speed of K user, such as following formula are calculated：
Wherein, r1,r2,...,rN-1,rNFor the character rate of N number of Modulation and Coding Scheme；
3.2) K element size in vector is ranked up from big to small, take behindThe data of individual user,
ObtainThe channel status statistical matrix of individual user, such as following formula：
3.3) data of formula (3) are based on, are obtainedThe channel status maximum of individual user be n probability, such as following formula：
The then channel capacity theoretical value such as following formula of base station：
Wherein, X=T/B, it is expressed as the modulation symbol number of each basic scheduling block；B is the bandwidth of single carrier base stations system.
Preferably, the step 5) is specific as follows：
5.1) set after the Service control of step 4), if the business of K user is not all abandoned, business need speed
It is adjusted toMatrix computations based on formula (1)：
Wherein, θk,nRepresent that the channel status of k-th of user is both less than the general of the value for the channel status of n and remaining user
Rate size, 1≤k≤K, 1≤n≤N；Then calculate：
Wherein, λkRepresent k-th of user oneself channel state values be more than other user situations under can busy channel when
What is obtained estimates scheduling character rate and the ratio of its business need speed；Based on λkValue size to user carry out priority row
Sequence, is worth that smaller User Priority is higher, carries out position adjustment to the matrix of formula (1) according to ranking results, matrix is after adjustment：
5.2) formula (8) is based on, is made
Wherein, 1≤k≤K, 1≤r≤N, 1≤n≤N；
It is calculated as follows numerical value：
Wherein,These vectorial convolution algorithms are represented, [x]n-1Table
Show (n-1)th element of vector；Calculate again：
It is located on some Scheduling Block of dispatch area, the channel status of the user after priority ranking is followed successively by s1,
s2,...,sK-1,sK, and smax=Max (s1,s2,...,sK-1,sK), then according to the result of formula (9), formulate channel assignment strategy.
Preferably, the formulation channel assignment strategy described in step 5.2) is as follows：
If a, vectorial δ=[δ1,δ2,...,δK] in all elements both greater than be equal to 1, then channel status is smaxIt is and excellent
First level highest user obtains the right to use of the Scheduling Block；
If b, vectorial δ=[δ1,δ2,...,δK] in have L element be less than 1, according to priority search for first from high to low
Individual channel status is smaxUser, if user corresponding element value δ in vectorkNo more than 1, then the Scheduling Block is obtained
The right to use；If user corresponding element value δ in vectorkMore than 1, then produce one section [0,1] it is equally distributed with
Machine number ω, ifThen the user obtains the right to use of the Scheduling Block；IfThen adjust
Spend chance and use is competed by user of the L element less than 1, competitive strategy is as follows：
Wherein, sylThe channel status of expression user, and IylRepresent the priority rank of user；L >=1,1≤l≤L, 1≤yl
≤K。
Preferably, methods described also includes：
If the relatively low real time business of time delay index request in business be present, using business maximum allowable delay as the cycle,
A small amount of dedicated time slot mutually to stagger is distributed for each real time business；When the data delay of real time business approaches maximum delay
When, then the time slot is directly taken on its dedicated time slot, if without using the time slot, all users carry out competing according to step 5)
Strive use.
The present invention has following beneficial effect relative to prior art：
1st, the inventive method is directed to the single carrier base stations system for supporting link circuit self-adapting transmission technology, at the base station system
A set of down channel based on subscriber channel state statistical information is provided in static or low mobility state multi-user on demand to divide
With technology, base station can be made to realize that downlink throughput capacity approaches downlink capacity, both supported the business demand of more users, be more again
The different business of user provides different service quality guarantees, realizes quantifiable distribution according to need to a certain extent.
2nd, the spy that the inventive method is remained stable over using static or low-speed mobile users channel status statistical nature
Property (characteristic obtains by numerous studies), realizes quantifiable radio channel resource with the help of classical probability
Distribution, it can preferably support that the service quality of the different business of different user will while base station down handling capacity is maximized
Ask, there is higher value in theory and actual application.
Brief description of the drawings
Fig. 1 is the basic scheduling block schematic diagram of the embodiment of the present invention 1.
Fig. 2 is the service conditions schematic diagram of the downlink of the embodiment of the present invention 1.
Fig. 3 is the formulation schematic diagram of the base station down scheduling strategy of the embodiment of the present invention 1.
Fig. 4 is the real time business of the embodiment of the present invention 1 and the timeslot case of non-real-time service.
Fig. 5 is the average downlink throughput capacity oscillogram of time slot of the base station of the embodiment of the present invention 1 in each scheduling window.
Fig. 6 is time slot of the 1st to 4 user in each scheduling window in the whole scheduling process of the embodiment of the present invention 1
Average descending scheduling rate waveform figure.
Fig. 7 is time slot of the 5th to 8 user in each scheduling window in the whole scheduling process of the embodiment of the present invention 1
Average descending scheduling rate waveform figure.
Embodiment
Embodiment 1：
The down channel allocation method based on demand of the present embodiment, specifically includes following steps：
1) the band a width of BHz, signal transmission power P of single carrier base stations system are setmax, the letter of user can be obtained in real time
Channel state information (CSI, quantity N=2k)；Base station system is in the basic scheduling block that each time is T (as shown in figure 1, only passing
The data of a defeated user, containing X=T/B modulation symbol) on use Adaptive Modulation and Coding technology, according to the channel shape of user
Using different Modulation and Coding Scheme, (MCS, N number of scheme, speed are followed successively by r to state information CSI altogether1,r2,...,rN-1,rNBit)
To obtain maximum efficiency of transmission；
It is located in certain a period of time, base station needs to support K to be evenly distributed in cell and move in static or low speed
The downlink business demand of the user of state, as shown in Fig. 2 its business need speed is followed successively by R_request=[R1,R2,...,
RK]；
2) prior information obtains
The formulation of channel assignment strategy is using M Scheduling Block as base unit, as shown in figure 3, by prior record, base station
Channel status statistics of the K user within preceding M basic transmission block times is obtained in the starting point for formulating channel assignment strategy
Matrix, such as following formula：
Wherein, Prk,nRepresent k-th of user channel status is n within preceding M basic transmission block times number summation and M
Ratio；M >=1000,1≤k≤K, 1≤n≤N；
3) calculate K user Mean Speed, K element size in vector is ranked up from big to small, take behindThe data of individual user, obtainThe channel status statistical matrix of individual user, according toThe channel status of individual user
Data in statistical matrix, obtainThe channel status maximum of individual user is n probability, so as to obtain the channel capacity of base station
Theoretical value, it is specific as follows：
3.1) Mean Speed of K user, such as following formula are calculated：
Wherein, r1,r2,...,rN-1,rNFor the character rate of N number of Modulation and Coding Scheme；
3.2) K element size in vector is ranked up from big to small, take behindThe data of individual user
To estimate the downlink capacity theoretical value of base station, symbolRounded under expression；IfThe channel status statistical matrix of individual user, such as
Following formula：
If 3.3) actually handled up always the channel distribution user maximum to some channel state values in scheduling
Amount is equal to channel capacity, therefore the data based on formula (3), obtainsThe channel status maximum of individual user is n probability, as follows
Formula：
The then channel capacity theoretical value such as following formula of base station：
Channel capacity theoretical value C unit is bps；
4) Service control
If now descending K customer service requires that speed sum is more than the 0.85 of channel capacity theoretical value, i.e.,
This explanation business need speed is excessive, and base station can not probably meet that the service quality of these business will simultaneously
Ask, therefore Service control measure will be enabled, some inferior grade business are gradually reduced according to the service priority provided in advance
Requirement speed, or even partial service is abandoned, until the requirement speed sum of all business is reduced to channel capacity theoretical value
0.85；
If now descending K customer service requires that speed sum is less than the 0.7 of channel capacity theoretical value, i.e.,
This explanation business need speed is too small, it is more likely that causes down-chain resource wasting phenomenon.Therefore industry will be enabled
Business control measure, the requirement speed of those speed unrestricted services (such as FTP downloading services) are improved to a certain extent, until business
It is required that speed sum is improved to 0.8 or so of channel capacity theoretical value；
5) priority of K user is ranked up, and channel assignment strategy, tool is formulated according to the priority of K user
Body is as follows：
5.1) without loss of generality, if after the Service control of step 4), if the business of K user is not all abandoned,
Business need speed adjust isMatrix computations based on formula (1)：
Wherein, θk,nRepresent that the channel status of k-th of user is both less than the general of the value for the channel status of n and remaining user
Rate size, 1≤k≤K, 1≤n≤N；Then calculate：
Wherein, λkRepresent k-th of user oneself channel state values be more than other user situations under can busy channel when
What is obtained estimates scheduling character rate and the ratio of its business need speed, λkValue it is bigger, illustrate k-th of user to a certain degree
Business need be easier to be met.Priority ranking is carried out to user based on the value size, is worth smaller User Priority and gets over
Height, position adjustment is carried out to the matrix of formula (1) according to ranking results, matrix is after adjustment：
5.2) formula (8) is based on, is made
Wherein, 1≤k≤K, 1≤r≤N, 1≤n≤N；
It is calculated as follows numerical value：
Wherein,These vectorial convolution algorithms are represented, [x]n-1Table
Show (n-1)th element of vector；Calculate again：
It is located on some Scheduling Block of dispatch area, the channel status of the user after priority ranking is followed successively by s1,
s2,...,sK-1,sK, and smax=Max (s1,s2,...,sK-1,sK), then according to the result of formula (9), formulate following channel distribution plan
Slightly：
If a, vectorial δ=[δ1,δ2,...,δK] in all elements both greater than be equal to 1, then channel status is smaxIt is and excellent
First level highest user obtains the right to use of the Scheduling Block；
If b, vectorial δ=[δ1,δ2,...,δK] in have L element be less than 1, according to priority search for first from high to low
Individual channel status is smaxUser, if user corresponding element value δ in vectorkNo more than 1, then the Scheduling Block is obtained
The right to use；If user corresponding element value δ in vectorkMore than 1, then produce one section [0,1] it is equally distributed with
Machine number ω, ifThen the user obtains the right to use of the Scheduling Block；IfThen adjust
Spend chance and use is competed by user of the L element less than 1, competitive strategy is as follows：
Wherein, sylThe channel status of expression user, and IylRepresent the priority rank of user；L >=1,1≤l≤L, 1≤yl
≤K。
6) above-mentioned algorithm can only provide the abundant satisfaction of the business need speed on probability meaning, only can guarantee that longer by one
The actual downstream speed of each business is reached it in the section time and require speed, the low of real time business (such as voice) is supported to be more preferable
Delay requirement, if the relatively low real time business of time delay index request in business be present, using business maximum allowable delay as the cycle,
A small amount of dedicated time slot mutually to stagger is distributed for each real time business, as shown in Figure 4；When the data delay of real time business approaches
During maximum delay, then the time slot can be directly taken, if without using this regardless of its channel status on its dedicated time slot
Time slot, then all users be at war with use according to above-mentioned algorithm.
The most important feature of wireless channel is change of the channel strength with time and frequency, and this change can be roughly divided into
Two classes：Large scale declines and multipath fading.Wherein, large scale decline be by with distance change signal path loss and by
Caused by the shade of various large obstacles, multipath fading is done mainly due to the constructive interference and cancellation of more signal paths
Caused by disturbing.When emitter and receiver all keep fixing, in general large scale decline does not change with the time, and small
Yardstick decline changes with time may be very violent.
In the inventive method, because all users of base station are assumed in static or low-speed motion state, and base station
Distance change is slower, it can be considered that in 2 continuous shorter time periods (several seconds rank), the channel shape of subscriber signal
The time variation of state is mainly as caused by multipath fading factor, rather than caused by user mobility.Although multipath fading has
Standby very strong time variation, but numerous studies show, and multipath fading value is to meet certain probability under the scene of the overwhelming majority
Distribution.
Based on above-mentioned analysis, the inventive method thinks channel status of the user within the arbitrary M basic scheduling block time
Channel status statistical conditions in statistical conditions and M follow-up basic scheduling block time are very close.If certain user is a certain
The individual temporal channel status of basic scheduling block is the discrete random variable for meeting a probability distribution, then K separate use
Family channel status stochastic variable constitutes a K dimension discrete probabilistic space Ω, contains N altogetherKIndividual elementary event.
Define field of events { Al,k,n, 1≤l≤N, 1≤k≤K, 1≤n≤K }, wherein field of events Al,k,nRepresent in a base
On this Scheduling Block, the maximum of K subscriber channel state is l, and the 1st channel state values to -1 user of kth are both less than
L, and+1 subscriber channel state value of kth is l, and it is l that kth+1 shares n-1 to k-th subscriber channel state value one.
According to above-mentioned definition just like drawing a conclusion：
(empty set), (l1,k1,n1)≠(l2,k2,n2)
That is field of events { Al,k,n, 1≤l≤N, 1≤k≤K, 1≤n≤K } K of user is tieed up into discrete probabilistic space Ω carry out nothing
Overlapping complete cutting.
If
ak,r=Pk,r；1≤k≤K,1≤r≤N
According to related definition, field of events Al,k,nProbability of happening size be
If regulation is in the fooled field of events A of some Scheduling Block in advancel,k,nDuring appearance, k-th of user just obtains the scheduling
The right to use of block.Then in longer period of time, its downstream rate theoretical value for obtaining of k-th user
If the downstream rate theoretical value γ of k-th of userkWith its business need speedRatio be more than 1, this explanation
The dispatcher that the user obtains excessively, therefore can set a random number, and those dispatcher meetings can be given the dispatcher of surplus
Very few user；If value is less than 1, this illustrates that the dispatcher that the user obtains can be very few, can not meet its business need speed,
Therefore in addition to the dispatcher meeting of itself, there is also a need for competing those dispatchers can cross the Scheduling Block that multi-user sells.
To verify the distribution effects of the algorithm of above-described embodiment 1, the simulation result of correlation is given below；An if single carrier base
System of standing needs while supports the downlink business demand of 8 users being evenly distributed in cell；Base station system is in each scheduling
The transmission rate of maximum can be obtained on time slot using scheme in table 1 according to the ideal feedback of user；To bandwidth and symbol
After time span is normalized, base station is followed successively by the unit interval using the downlink data amount of this 7 Modulation and Coding Scheme
1/4th, 1/2,1,3/2,2,3 and 4.
The data transmission scheme of table 1
Here the influence in terms of large scale declines with multipath fading is considered, in whole scheduling process, user locates
In low speed and inactive state, i.e. large scale fading factor rate of change is slower, and the channel situation in different time slot schedulings is kept
Independently of each other.
Base station down transmitting power is 48dB, during initialization the large scale fading coefficients of 8 users be followed successively by [- 34.5 ,-
33.5, -35, -32.5, -33, -31, -30.5, -30] dB, scheduling window include M=1000 time slot scheduling, and each user
Randomly selected in the large scale fading coefficients changing value of two neighboring scheduling window from section [- 0.2,0.2] dB, and containing
100 scheduling windows, altogether containing 105The scheduling process Small and Medium Sized fading coefficients of individual time slot scheduling are to meet that average is 1
Rayleigh fading is distributed.
Some traditional channel allocation algorithms, such as various types of proportional fair algorithms, its starting point are mainly realized and used
The distribution speed at family it is convergent, can not but realize that a variety of differences require the satisfaction of speed.And the channel point that the inventive method provides
Major advantage with technology is exactly can be while downlink throughput capacity be maximized as far as possible, and meet different user should not business
Rate requirement.It is therefore assumed that there are 3 kinds of different non-real-time services in 8 users, it is desirable to be followed successively by after speed normalization
[0.1925,0.385,0.1925,0.385,0.385,0.77,0.77,0.77], it is desirable to which speed sum is 3.85.
Fig. 5 give each time slot of the base station in whole scheduling process of base station in each scheduling window it is average under
Row handling capacity；And Fig. 6 and Fig. 7 give the 1st to 4 user in whole scheduling process, the 5th to the 8th user successively respectively
Each time slot in each scheduling window obtains averagely descending actual speed rate value, and the wherein horizontal line in figure is the user's
The requirement speed of downlink business.From fig. 5, it can be seen that base station down handling capacity is substantially approached between 3.96 to 3.99
The downlink capacity value of base station；Fig. 6 and Fig. 7 then show, are wanted except the descending scheduling speed that the 6th user obtains is slightly above its business
Seek speed, the descending scheduling speed that other 7 users obtain is all substantially suitable with its business need speed.
Sum it up, simulation result shows, algorithm provided by the invention can be in the same of maximization base station system handling capacity
When so that each user obtains the scheduling rates suitable with its business need speed, obtains the Radio Resource of base station system
Make full use of and reasonably distribution uses.
It can be seen that from the scheduling process of a whole set of algorithm of the present invention and utilize static or low-speed mobile users channel status system
The characteristic that meter feature remains stable over, realizes quantifiable radio channel resource point with the help of classical probability
Match somebody with somebody, can preferably support that the service quality of the different business of different user will while base station down handling capacity is maximized
Ask, there is higher value in theory and actual application.
It is described above, patent preferred embodiment only of the present invention, but the protection domain of patent of the present invention is not limited to
This, any one skilled in the art is in the scope disclosed in patent of the present invention, according to the skill of patent of the present invention
Art scheme and its inventive concept are subject to equivalent substitution or change, belong to the protection domain of patent of the present invention.
Claims (2)
1. for the down channel allocation method based on demand of single carrier base stations system, it is characterised in that methods described includes following step
Suddenly：
1) base station system uses Adaptive Modulation and Coding technology on the basic scheduling block that each time is T, according to the letter of user
Channel state information applies different Modulation and Coding Scheme, and is located in certain a period of time, and base station needs to support that K are evenly distributed on
Cell is interior and is in the downlink business demand of static or low mobility state user；
2) prior information obtains：The formulation of channel assignment strategy is using M Scheduling Block as base unit, by prior record, base
Stand the channel status that K user is obtained in the starting point for formulating channel assignment strategy in preceding M substantially transmission block times
Statistical matrix, such as following formula：
<mrow>
<mi>Pr</mi>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mi>N</mi>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mi>N</mi>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mi>N</mi>
</mrow>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, Prk,nRepresent that k-th of user channel status within preceding M basic transmission block times is n number summation and M ratio
Value；1≤k≤K, 1≤n≤N, M >=1000；
3) the average symbol speed of K user is calculated based on above-mentioned prior information, K element size in vector is entered from big to small
Row sequence, take behindThe data of individual user, obtainThe channel status statistical matrix of individual user, according toIndividual use
Data in the channel status statistical matrix at family, obtainThe channel status maximum of individual user is n probability, so as to obtain base
The channel capacity theoretical value stood, it is specific as follows：
3.1) the average symbol speed of K user, such as following formula are calculated：
<mrow>
<msub>
<mi>R</mi>
<mrow>
<mi>a</mi>
<mi>v</mi>
<mi>e</mi>
</mrow>
</msub>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mi>N</mi>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mi>N</mi>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msub>
<mi>Pr</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mi>N</mi>
</mrow>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<msub>
<mi>r</mi>
<mn>1</mn>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>r</mi>
<mn>2</mn>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>r</mi>
<mi>N</mi>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, r1,r2,...,rN-1,rNFor the character rate of N number of Modulation and Coding Scheme；
3.2) K element size in vector is ranked up from big to small, take behindThe data of individual user, obtainThe channel status statistical matrix of individual user, such as following formula：
<mrow>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mi>N</mi>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mi>N</mi>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mover>
<mi>K</mi>
<mo>~</mo>
</mover>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mover>
<mi>K</mi>
<mo>~</mo>
</mover>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mover>
<mi>K</mi>
<mo>~</mo>
</mover>
<mo>,</mo>
<mi>N</mi>
</mrow>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
</mrow>
3.3) data of formula (3) are based on, are obtainedThe channel status maximum of individual user be n probability, such as following formula：
<mrow>
<msub>
<mi>pr</mi>
<mi>n</mi>
</msub>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<munderover>
<mo>&Pi;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mover>
<mi>K</mi>
<mo>~</mo>
</mover>
</munderover>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<munderover>
<mo>&Pi;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mover>
<mi>K</mi>
<mo>~</mo>
</mover>
</munderover>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>r</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>n</mi>
</munderover>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>r</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>-</mo>
<munderover>
<mo>&Pi;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mover>
<mi>K</mi>
<mo>~</mo>
</mover>
</munderover>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>r</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>n</mi>
</munderover>
<msub>
<mover>
<mi>Pr</mi>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>r</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>n</mi>
<mo>&GreaterEqual;</mo>
<mn>2</mn>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
</mrow>
The then channel capacity theoretical value such as following formula of base station：
<mrow>
<mi>C</mi>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>pr</mi>
<mi>n</mi>
</msub>
<mo>&times;</mo>
<msub>
<mi>r</mi>
<mi>n</mi>
</msub>
<mo>&times;</mo>
<mi>X</mi>
<mo>&divide;</mo>
<mi>T</mi>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>5</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, X=T/B, it is expressed as the modulation symbol number of each basic scheduling block；B is the bandwidth of single carrier base stations system；
4) Service control：If now descending K customer service requires that speed sum is more than the 0.85 of channel capacity theoretical value,
Service control measure is enabled, the requirement of some inferior grade business speed is gradually reduced according to the service priority provided in advance
Rate, or even partial service is abandoned, until the requirement speed sum of all business is reduced to the 0.85 of channel capacity theoretical value；If
Now descending K customer service requires that speed sum is less than the 0.7 of channel capacity theoretical value, then enables Service control measure, carry
The requirement speed of those high speed unrestricted services, until business need speed sum is improved to the 0.8 of channel capacity theoretical value
Left and right；
5) priority of K user is ranked up, and channel assignment strategy is formulated according to the priority of K user, specifically such as
Under：
5.1) set after the Service control of step 4), if the business of K user is not all abandoned, business need speed adjust
ForMatrix computations based on formula (1)：
<mrow>
<msub>
<mi>&theta;</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mo>=</mo>
<mfrac>
<msub>
<mi>Pr</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>r</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>n</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</munderover>
<msub>
<mi>Pr</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>r</mi>
</mrow>
</msub>
</mrow>
</mfrac>
<munderover>
<mo>&Pi;</mo>
<mrow>
<mi>l</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>K</mi>
</munderover>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>r</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>n</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</munderover>
<msub>
<mi>Pr</mi>
<mrow>
<mi>l</mi>
<mo>,</mo>
<mi>r</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>6</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, θk,nRepresent the channel status of k-th of user be both less than for n and remaining user channel status the value probability it is big
It is small, 1≤k≤K, 1≤n≤N；Then calculate：
<mrow>
<msub>
<mi>&lambda;</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<mfrac>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>&theta;</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mo>&times;</mo>
<msub>
<mi>r</mi>
<mi>n</mi>
</msub>
</mrow>
<msub>
<mover>
<mi>R</mi>
<mo>^</mo>
</mover>
<mi>k</mi>
</msub>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>7</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, λkRepresent that k-th of user can obtain in the case where oneself channel state values is more than other user situations during busy channel
Estimate scheduling character rate and the ratio of its business need speed；Based on λkValue size to user carry out priority ranking, value
Smaller User Priority is higher, carries out position adjustment to the matrix of formula (1) according to ranking results, matrix is after adjustment：
5.2) formula (8) is based on, is made
Wherein, 1≤k≤K, 1≤r≤N, 1≤n≤N；
It is calculated as follows numerical value：
<mrow>
<msub>
<mi>Z</mi>
<mrow>
<mi>l</mi>
<mo>,</mo>
<mi>k</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mo>=</mo>
<msub>
<mi>b</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mi>l</mi>
</mrow>
</msub>
<mo>&times;</mo>
<msub>
<mi>b</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mi>l</mi>
</mrow>
</msub>
<mo>...</mo>
<mo>&times;</mo>
<msub>
<mi>b</mi>
<mrow>
<mi>k</mi>
<mo>-</mo>
<mn>1</mn>
<mo>,</mo>
<mi>l</mi>
</mrow>
</msub>
<mo>&times;</mo>
<msub>
<mi>a</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>l</mi>
</mrow>
</msub>
<mo>&times;</mo>
<msub>
<mrow>
<mo>&lsqb;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>a</mi>
<mrow>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
<mo>,</mo>
<mi>l</mi>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>b</mi>
<mrow>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
<mo>,</mo>
<mi>l</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>&CircleTimes;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>a</mi>
<mrow>
<mi>k</mi>
<mo>+</mo>
<mn>2</mn>
<mo>,</mo>
<mi>l</mi>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>b</mi>
<mrow>
<mi>k</mi>
<mo>+</mo>
<mn>2</mn>
<mo>,</mo>
<mi>l</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>...</mo>
<mo>&CircleTimes;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>a</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mi>l</mi>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>b</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mi>l</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msub>
</mrow>
Wherein,These vectorial convolution algorithms are represented, [x]n-1Represent vector
(n-1)th element；Calculate again：
<mrow>
<msub>
<mi>&delta;</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<mfrac>
<mi>T</mi>
<mrow>
<msub>
<mover>
<mi>R</mi>
<mo>^</mo>
</mover>
<mi>k</mi>
</msub>
<mi>B</mi>
</mrow>
</mfrac>
<mo>&times;</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>l</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>K</mi>
</munderover>
<msub>
<mi>Z</mi>
<mrow>
<mi>l</mi>
<mo>,</mo>
<mi>k</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mo>&times;</mo>
<msub>
<mi>r</mi>
<mi>l</mi>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>9</mn>
<mo>)</mo>
</mrow>
</mrow>
It is located on some Scheduling Block of dispatch area, the channel status of the user after priority ranking is followed successively by s1,s2,...,
sK-1,sK, and smax=Max (s1,s2,...,sK-1,sK), then according to the result of formula (9), channel assignment strategy is formulated, it is as follows：
If a, vectorial δ=[δ1,δ2,...,δK] in all elements both greater than be equal to 1, then channel status is smaxAnd priority
Highest user obtains the right to use of the Scheduling Block；
If b, vectorial δ=[δ1,δ2,...,δK] in have L element be less than 1, according to priority from high to low search for first letter
Road state is smaxUser, if user corresponding element value δ in vectorkNo more than 1, then the use of the Scheduling Block is obtained
Power；If user corresponding element value δ in vectorkMore than 1, then one is produced in section [0,1] equally distributed random number
ω, ifThen the user obtains the right to use of the Scheduling Block；IfThen dispatcher
It can be competed and used by user of the L element less than 1, competitive strategy is as follows：
<mrow>
<mi>&chi;</mi>
<mo>=</mo>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>s</mi>
<msub>
<mi>y</mi>
<mi>l</mi>
</msub>
</msub>
<mo>+</mo>
<mfrac>
<mn>1</mn>
<msub>
<mi>I</mi>
<msub>
<mi>y</mi>
<mi>l</mi>
</msub>
</msub>
</mfrac>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>10</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein,The channel status of user is represented, andRepresent the priority rank of user；L >=1,
2. the down channel allocation method based on demand according to claim 1 for single carrier base stations system, it is characterised in that
Methods described also includes：
It is every using business maximum allowable delay as the cycle if the relatively low real time business of time delay index request in business be present
Individual real time business all distributes a small amount of dedicated time slot mutually to stagger；When the data delay of real time business approaches maximum delay, then
The time slot is directly taken on its dedicated time slot, if without using the time slot, all users are at war with according to step 5) and made
With.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410222180.8A CN104023399B (en) | 2014-05-23 | 2014-05-23 | For the down channel allocation method based on demand of single carrier base stations system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410222180.8A CN104023399B (en) | 2014-05-23 | 2014-05-23 | For the down channel allocation method based on demand of single carrier base stations system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104023399A CN104023399A (en) | 2014-09-03 |
| CN104023399B true CN104023399B (en) | 2017-12-15 |
Family
ID=51439913
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410222180.8A Active CN104023399B (en) | 2014-05-23 | 2014-05-23 | For the down channel allocation method based on demand of single carrier base stations system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104023399B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107124769B (en) * | 2017-04-24 | 2019-09-17 | 京信通信系统（中国）有限公司 | A kind of resource allocation method and base station |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101103574A (en) * | 2005-01-11 | 2008-01-09 | 松下电器产业株式会社 | Transmission power control method, transmission power control device and wireless transmitter |
| CN101977440A (en) * | 2007-01-09 | 2011-02-16 | 株式会社Ntt都科摩 | User device, base station apparatus, and method |
| CN102577485A (en) * | 2009-09-28 | 2012-07-11 | 夏普株式会社 | Wireless communication system, mobile station apparatus, base station apparatus, communication control method and control program |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002078021A (en) * | 2000-08-31 | 2002-03-15 | Nec Corp | Information distribution system and information distribution method |
-
2014
- 2014-05-23 CN CN201410222180.8A patent/CN104023399B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101103574A (en) * | 2005-01-11 | 2008-01-09 | 松下电器产业株式会社 | Transmission power control method, transmission power control device and wireless transmitter |
| CN101977440A (en) * | 2007-01-09 | 2011-02-16 | 株式会社Ntt都科摩 | User device, base station apparatus, and method |
| CN102577485A (en) * | 2009-09-28 | 2012-07-11 | 夏普株式会社 | Wireless communication system, mobile station apparatus, base station apparatus, communication control method and control program |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104023399A (en) | 2014-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101801091B (en) | Method and device for allocating resources in OFDM/MIMO system | |
| EP1536658B1 (en) | Opportunistic beamforming and scheduling of users in a communication system | |
| CN101868017B (en) | A kind of method and apparatus realizing CoMP downlink communication | |
| CN102858015B (en) | Multi-service scheduling method | |
| CN105634571A (en) | Pilot frequency pollution reduction method based on partial pilot frequency multiplexing in large-scale MIMO system | |
| CN104507169B (en) | Reduce the three dimensional resource dynamic allocation method and device of system uplink propagation delay time | |
| CN104717755A (en) | Downlink frequency spectrum resource distribution method with D2D technology introduced in cellular network | |
| JP2008011522A (en) | Method and apparatus for sub-channel allocation | |
| CN104168659B (en) | Multiple cell mimo system user scheduling method under MRT precoding strategies | |
| CN105119644A (en) | Space division mode switching method for single-user MIMO (Multiple Input Multiple Output) system based on SWIPT | |
| CN102300326B (en) | Scheduling method of multi-user multi-input multi-output (MIMO) communication system and base station | |
| CN103826312A (en) | Improved LTE (Long Term Evolution) scheduling method based on exponential rule | |
| CN104770036A (en) | System and methods to achieve optimum efficiency-Jain fairness in wireless systems | |
| EP3183932A1 (en) | Method and apparatus for determining clusters of access nodes | |
| CN101472298B (en) | User scheduling method and apparatus for TDD multi-input multi-output down emission system | |
| CN104023400B (en) | For the down channel allocation method based on demand of OFDM base station systems | |
| CN110445518B (en) | Pilot frequency distribution method based on micro cell clustering under large-scale MIMO heterogeneous network system | |
| CN101877913B (en) | User scheduling method in LTE (Long Term Evolution) system | |
| CN107734697A (en) | Low-complexity multi-user group technology based on NOMA systems | |
| CN106793132A (en) | A kind of resource allocation methods and network communicating system based on carrier aggregation | |
| CN106413110B (en) | A kind of dispatching method, device and network node | |
| CN104023399B (en) | For the down channel allocation method based on demand of single carrier base stations system | |
| CN104901732A (en) | Pilot frequency multiplexing method in dense node configuration system | |
| CN105611640B (en) | A kind of adjustable CoMP downlink user dispatching method of equitable degree | |
| CN107087279A (en) | It is a kind of based on the base station activation and beam-forming method of stablizing access relation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |