CN101080032A - A high-speed downlink packet access capacity estimation method and device - Google Patents

A high-speed downlink packet access capacity estimation method and device Download PDF

Info

Publication number
CN101080032A
CN101080032A CNA2007101076953A CN200710107695A CN101080032A CN 101080032 A CN101080032 A CN 101080032A CN A2007101076953 A CNA2007101076953 A CN A2007101076953A CN 200710107695 A CN200710107695 A CN 200710107695A CN 101080032 A CN101080032 A CN 101080032A
Authority
CN
China
Prior art keywords
integral
theta
rate
noise ratio
error rate
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.)
Pending
Application number
CNA2007101076953A
Other languages
Chinese (zh)
Inventor
吴中
李鹏
赵新胜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CNA2007101076953A priority Critical patent/CN101080032A/en
Publication of CN101080032A publication Critical patent/CN101080032A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

This invention discloses a method for estimating capacitance of high speed down packet access including the following steps: obtaining a corresponding relation of link effective data rate and received S/N ratio of a mobile station after a link layer applies adaptive modulation coding and quick-mixing automatic re-transmission to get user throughput, section throughput and proportion of the system meeting the needs of users of the system with a dispatch algorithm. This invention discloses a capacitance estimation device of high speed down packet access.

Description

A kind of high-speed downlink packet access capacity estimation method and device
Technical field
The present invention relates to communication technical field, relate in particular to a kind of HSDPA (High Speed DownlinkPacket Access, high speed downlink packet inserts) capacity estimation method and device.
Background technology
The develop rapidly of wireless data service has proposed new requirement to communication system.Gradually, can not satisfy people's requirement merely based on the mobile communication of speech, therefore mobile communication system in the future must be on the basis that guarantees voice service, provide and transmit picture file, receiving and dispatching mail, surf the web, even multimedia service such as movies on demand, to satisfy the demand business of user to high-speed data.
In order to provide on the existing network basis more at a high speed and more advanced wireless data communication service, the various enhancement techniques that are used for mobile data communication have appearred.As present HSDPA (High Speed DownlinkPacket Access, high speed downlink packet inserts) be 3GPP (Third Generation PartnershipProject, 3G (Third Generation) Moblie collaborative project group) in Release 5 and Release 6 release protocol on satisfying/the asymmetric demand of downstream data traffic and a kind of Enhanced Technology of proposing, existing WCDMA (Wideband Code Division Multiple Access can not changed, Wideband Code Division Multiple Access (WCDMA)) under the situation of network configuration, downstream data traffic speed is brought up to 10.8Mbit/s.The new technology that HSDPA adopts comprises AMC (Adaptive Modulation and Coding, Adaptive Modulation and Coding), H-ARQ (Hybrid Automatic Repeat Request, rapid mixing retransmits automatically), FS (Fast Scheduling, fast dispatch), FCS (Fast Cell Selection, fast cell select) etc.
The basic principle of AMC is based on channel status adjustment modulation and coded system, and wherein the assessment of channel status is from the feedback of receiver.In the system of configuration AMC, user near cell site generally uses high order modulation and high-rate coded, as 64QAM (64 Quadrature Amplitude Modulation, 64 phase quadrature amplitude modulation), R=3/4 Turbo code, and adopt low-order-modulated and low rate coding near the user of cell boarder, such as QPSK (Quadrature Phase Shift Keying, Quadrature Phase Shift Keying), R=1/2Turbo sign indicating number.The major advantage of AMC is: thus the user of correct position has higher data rate to increase the average throughput of sub-district; The method that reduces interference variations is to change modulation and coded system, rather than changes through-put power.
H-ARQ is meant that the recipient under the situation of decoding failure, preserves the data that receive, and requires the transmit leg data retransmission, and the recipient made up data that retransmit and the data that before received before decoding.H-ARQ can improve systematic function, and can adjust effective code element speed neatly, can also compensate because the error code that adopts link adaptation to bring.H-ARQ has two kinds of operational modes.A kind of is identical when launching for the first time when retransmitting, and this mode is referred to as chase or soft combining (soft merging) again; Another kind of data when retransmitting with last time launched differently, this mode is referred to as IR (Incremental Redundancy, incremental redundancy) again.The performance of a kind of mode in back is a kind of before being better than, but needs bigger internal memory when receiving.The default memory size of terminal is to design according to maximum data rate and soft combining mode that terminal can be supported.Thereby when maximum data rate, only may use soft combining.And when using lower data rate transport data, dual mode can use.
The realization of AMC is based on the accuracy and the real-time of feedback information, and the H-ARQ automatic adaptive is in the Real-time Channel state, and to metrology error and delay time insensitive.AMC combines with H-ARQ and has then handled the problem of each side.AMC selects rough message transmission rate, and H-ARQ carries out the adjustment of message transmission rate based on channel status.
Dispatching algorithm is being controlled shared resource allocation, has determined the behavior of whole system to a great extent.Should be during scheduling mainly based on channel condition, data volume and professional situations such as priority level to be launched such as consider simultaneously, and give full play to the ability of AMC and H-ARQ.Dispatching algorithm should be launched data to the user that moment has a best channel condition, can reach the highest user data rate and maximum data throughout in each moment like this, but also should be taken into account the fairness to each user simultaneously.Therefore, in a short time based on channel condition, and take into account throughput to all users long-term planted agent.In order to make system's short term variations of adaptive channel better, therefore in high-speed wireless link, dispatching algorithm is positioned at NodeB (base station) rather than is positioned at RNC (Radio Network Controller, radio network controller).Dispatching algorithm comprises polling dispatching (Round Robin), max carrier to interference scheduling (MaximumCarrier-to-Interference rate, Max C/I), Proportional Fair (Proportional Fair) etc.
Provided a kind of HSDPA volume calculation model in the prior art.Analyzed that H-ARQ tries to achieve the Frame average transmission number of times under certain signal to noise ratio condition to the influence of link throughput under the HSDPA system.H-ARQ is made up of FEC (Forward Error Correction, forward error correction) and ARQ, and what wherein forward error correction was adopted is Turbo code.Each packet call is transmission in several TTI (Transmission TimeInterval, Transmission Time Interval).Scheduling on the shared channel makes that the interior mistake that takes place of each TTI period is separate, so the number of retransmissions of the data of each TTI is independently.According to central-limit theorem, surpass 10 independent same distribution stochastic variables and be approximately Gaussian Profile.Then the number of transmissions of grouping bag is a Gaussian Profile, supposes that average is N s, variance is σ 2N sAnd σ 2Can calculate with the following method: at first, suppose that all mistakes can pass through CRC (Cyclical RedundancyCheck, CRC) and obtain.Hypothesis merges and only to use twice up-to-date transmission rather than all transmission versions in the algorithm, and especially at BLER (Block Error Rate, BLER (block error rate)) when being 10% left and right sides, the performance that merges up-to-date twice transmission block and all transmission block is close.Suppose that channel is slow fading, and the TTI time less than coherence time, then a TTI is in the period, channel status remains unchanged, MCS (Modulation Coding Scheme, modulation coding mode) adopts with a kind of system.
Make P eBe the decoding error rate after block of information is carried out error correction coding, P sBe the decoding error rate behind two continuous transmission versions of the same block of information of soft merging.The probability P of the j time successful decoded information piece then jFor
P j = P e j - 1 · P s j - 2 ( 1 - P e P s ) - - - [ 1 ]
The average transmission times N sFor
N s = 1 + P e - P e P s 1 - P e P s - - - [ 2 ]
And do not use the average transmission number of times of soft merging to be
N = 1 1 - P e - - - [ 3 ]
(Frame Error Rate, when FER) very big, the advantage of soft merging is apparent in view when target frame error rate.
In realizing process of the present invention, the inventor finds this method, and there are the following problems at least: the not restriction of taking into account system greatest admissible retransmission value and the error of transmission of backward channel acknowledgement frame when analyzing the H-ARQ performance; MCS probability distribution is not clearly derived in the analysis of Adaptive Modulation and Coding; Do not consider concrete cell topology when analyzing interference profile, as 19 sub-districts, 3 sector strucres; Only analyzed the effective data rate of link aspect, do not had of the influence of the dispatching technique of taking into account system aspect power system capacity.
Derived the link availability of frequency spectrum on the Nakagami-m fading channel in the prior art two, labor the influence of AMC technology to systematic function.For flat fading channel, channel quality can be by signal to noise ratio γ bWeigh.Because channel status remains unchanged in a frame, so describe γ with general Nakagami-m channel bStatistical nature.The received signal to noise ratio γ of every frame bBe one and obey the stochastic variable that Gamma distributes.
f γ b ( γ b ) = m m γ b m - 1 γ ‾ b m Γ ( m ) exp ( - mγ b γ ‾ b ) - - - [ 4 ]
γ wherein b:=E{ γ bBe the average received signal to noise ratio, Γ ( m ) : = ∫ 0 ∞ t m - 1 e - t dt Be the Gamma function, m is a Nakagami decline index (m 〉=1/2).The Nakagami-m channel model is represented a big class fading channel, is the Rayleigh channel when m=1.Because Ricean decline parameter K is corresponding one by one with Nakagami decline parameter m, so the Ricean channel also can be used Nakagami-m channel model approximate simulation.
For the AMC rule, MCS and real-time frame error rate depend on received signal to noise ratio γ bThe selection probability of every kind of MCS is:
Pr ( n ) = ∫ γ n γ n + 1 f γ b ( γ b ) d γ b = Γ ( m , m γ n γ ‾ b ) - Γ ( m , m γ n + 1 γ ‾ b ) Γ ( m ) - - - [ 5 ]
Wherein Γ ( m , x ) : = ∫ x ∞ t m - 1 e t dt Be the non-complete Gamma function that replenishes.The signal to noise ratio separation γ of MCS nDefinite method as follows.γ nBe to guarantee under the scene of transmission mode n, to make FER=P TargetSignal to noise ratio.P wherein TargetBe target frame error rate, FER is actual frame error rate, can be expressed as:
FER ( n ) &ap; 1 if 0 < &gamma; b < &gamma; pn a n exp ( - g n &gamma; b ) if &gamma; b &GreaterEqual; &gamma; pn - - - ( 6 )
Wherein n is the MCS sign, γ bIt is received signal to noise ratio.a n, g n, γ PnBe pattern independently.As grouping packet length N p=1080 o'clock, parameter value such as table 1.
The error rate expression argument value of table 1 convolutional encoding modulation transmissions pattern
Pattern 1 Pattern 2 Mode 3 Pattern 4 Pattern 5 Pattern 6
Modulation system BPSK QPSK QPSK 16-QAM 16-QAM 16-QAM
Code rate R C 1/2 1/2 3/4 9/16 3/4 3/4
Speed (bps) 0.50 1.00 1.50 2.25 3.00 4.50
a n 274.7229 90.2514 67.6181 50.1222 53.3987 35.3508
g n 7.9932 3.4998 1.6883 0.6644 0.3756 0.0900
γ pn(dB) -1.5331 1.0942 3.9722 7.7021 10.2488 15.9784
The signal to noise ratio separation can be expressed as so:
γ 0=0
&gamma; n = 1 g n ln ( a n P t arg et ) , n = 1,2 , . . . , N - - - [ 7 ]
γ N+1=+∞
The γ that tries to achieve by following formula n, can guarantee AMC mechanism accord with Q oS requirement.Under the prerequisite that keeps the target qos requirement, this AMC mechanism can maximize the availability of frequency spectrum.
In realizing process of the present invention, the inventor finds that there are the following problems at least in the prior art: H-ARQ is not made Accurate Analysis; Do not consider typical cell topology when analyzing interference profile, as 19 sub-districts, 3 sector strucres; Only analyzed the effective data rate of link aspect, do not had of the influence of the dispatching technique of taking into account system aspect power system capacity.
Summary of the invention
Embodiments of the invention provide a kind of high-speed downlink packet access capacity estimation method and device, with the estimation result about high-speed downlink packet access capacity who is tallied with the actual situation more accurately.
For achieving the above object, embodiments of the invention provide a kind of high-speed downlink packet access capacity estimation method, may further comprise the steps:
Obtain the link aspect and adopt the link effective data rate after Adaptive Modulation and Coding and rapid mixing retransmit automatically and the corresponding relation of travelling carriage received signal to noise ratio;
Obtain the ratio that user throughput, sector throughput and the system of system under dispatching algorithm satisfies the user according to described corresponding relation and reception bit signal to noise ratio probability distribution.
The volume calculation device that embodiments of the invention also provide a kind of high speed downlink packet to insert comprises:
Link aspect processing module is used to obtain the link aspect and adopts the link effective data rate after Adaptive Modulation and Coding and rapid mixing retransmit automatically and the corresponding relation of travelling carriage received signal to noise ratio;
The system level processing module is used for the corresponding relation that obtains according to described link aspect processing module and receives bit signal to noise ratio probability distribution, and user throughput, sector throughput and the system of the system that obtains under dispatching algorithm satisfies user's ratio.
Compared with prior art, embodiments of the invention have the following advantages:
Take all factors into consideration various key technologies (as Adaptive Modulation and Coding, rapid mixing retransmit automatically, fast dispatch etc.) to the influence of high-speed downlink packet access capacity, make properer the tallying with the actual situation of estimation result.Enlarge the scope of application of evaluation method, analyzed the capacity that high speed downlink packet inserts more all sidedly.
Description of drawings
Fig. 1 is in the embodiments of the invention one, a kind of flow chart of HSDPA capacity estimation method;
Fig. 2 is in the embodiments of the invention two, the calculation flow chart of link aspect;
Fig. 3 is in the embodiments of the invention two, the calculation flow chart of system level;
Fig. 4 is in the embodiments of the invention two, the schematic diagram of 19 sub-districts, 3 sector strucres;
Fig. 5 A to Fig. 5 C is in the embodiments of the invention two, the distributed constant schematic diagram of customer location under the different situations;
Fig. 6 is in the embodiments of the invention three, a kind of structural representation of HSDPA volume calculation device.
Embodiment
Below in conjunction with specific embodiments and the drawings, embodiments of the present invention are described further.
In the embodiments of the invention one, a kind of HSDPA capacity estimation method comprises the steps: as shown in Figure 1
Step s101, obtain the link aspect and adopt the link effective data rate behind AMC and the H-ARQ and the corresponding relation of travelling carriage received signal to noise ratio.
This step is the calculating of link aspect, the restriction of taking into account system greatest admissible retransmission value and the error of transmission of backward channel acknowledgement frame when analyzing the H-ARQ performance.Derive the link effective data rate that adopts behind AMC and the H-ARQ and the corresponding relation of travelling carriage received signal to noise ratio.
Step s102, according to above-mentioned corresponding relation with receive bit signal to noise ratio probability distribution and obtain the ratio that user throughput, sector throughput and the system of system under dispatching algorithm satisfies the user.Wherein receiving bit signal to noise ratio probability distribution obtains according to cell topology.
This step is the calculating of system level, analyzes the influence of fast dispatch to systematic function, provides the mathematic(al) representation that sector throughput, user throughput, system satisfy user's ratio, and these parameters can be represented the estimation result of HSDPA capacity.
In the embodiments of the invention two, the calculation process of link aspect is described.Comprise: the restriction of taking into account system greatest admissible retransmission value and the error of transmission of backward channel acknowledgement frame when analyzing the H-ARQ performance; Derive data packet transmission number of times probability distribution and average the number of transmissions; Can retransmit residue frame error rate afterwards in the hope of carrying out maximum times simultaneously.Based on this, analyze the link effective data rate that obtains under certain modulation coding mode and the code channel number combination.According to the residue frame error rate requirement of system, determine the signal-noise ratio threshold of modulation coding mode and code channel number combination again.To adopt the link effective data rate behind AMC and the H-ARQ and the corresponding relation of travelling carriage received signal to noise ratio at last.Particularly, as shown in Figure 2, comprise the steps:
Step s201, initialization comprise parameter required when setting channel model, modulation coding mode, code channel number, spreading rate, spreading factor, HSDPA Transmission Time Interval TTI, H-ARQ mode, feedback information error probability, Frame maximum retransmission and obtaining the physical layer error rate.
Step s202, obtain the error rate of physical layer.The error rate of physical layer can obtain by emulation, also can be approximate by classical formulas.Below be approximately example with classical formulas, the acquisition methods of the error rate is described.
Utilize the following upper bound to calculate the error rate P of Turbo code b:
P b &le; &Sigma; d = d f &infin; c d &CenterDot; P d - - - [ 8 ]
P wherein dFor Hamming distance from the pair-wise error probability that is two sequences of d.c dBe defined as the normalization Hamming distance from the whole weight that is the information bit of d, represented the average number of bit mistake.
c d = &Sigma; &omega; &Sigma; c = d - &omega; &omega; L &CenterDot; A &omega; , c TC - - - [ 9 ]
Wherein L is a weaving length, A ω, c TCFor the information weight is ω, the redundant bit weight is the number of codewords of c.
Under the environment of AWGN (Additive White Gauss Noise, white Gaussian noise channel), pair-wise error probability is when adopting the M-QAM modulation system:
P d &le; 1 log 2 M &CenterDot; [ 1 - ( 1 - P M ) 2 ] - - - [ 10 ]
P M = 2 ( 1 - 1 M ) Q ( dR c &CenterDot; 3 l og 2 M &gamma; b * ( M - 1 ) ) - - - [ 11 ]
&gamma; b * = &gamma; b N code = E b N t &CenterDot; N code - - - [ 12 ]
Wherein M is a modulation index, γ bFor travelling carriage receives bit signal to noise ratio, γ b *Be the received signal to noise ratio of the single code channel of travelling carriage, suppose that configuration equates to the power of each code channel.
Under the environment of the non-selective Rayleigh fading channel of frequency, pair-wise error probability when adopting the M-QAM modulation system and using diversity technique:
P d &le; &Integral; 0 &infin; P d ( &gamma; b * ) &CenterDot; p ( &gamma; b * ) d &gamma; b * - - - [ 13 ]
Wherein
p ( &gamma; b * ) = 1 ( d - 1 ) ! ( &gamma; b * ) d ( &gamma; b * ) d - 1 e - &gamma; b * / &gamma; &OverBar; b * - - - [ 14 ]
P d ( &gamma; b * ) &le; 1 log 2 M &CenterDot; [ 1 - ( 1 - P M ) 2 ] - - - [ 15 ]
P M = 2 ( 1 - 1 M ) Q ( dR c &CenterDot; 3 log 2 M &gamma; b * ( M - 1 ) ) - - - [ 16 ]
&gamma; b * = &gamma; b N code = E b N t &CenterDot; N code - - - [ 17 ]
Wherein M is a modulation index, γ bFor travelling carriage receives bit signal to noise ratio, γ b *Be the received signal to noise ratio of the single code channel of travelling carriage, suppose that configuration equates to the power of each code channel.
Step s203, the modulation coding mode for given, code channel number, spreading rate and spreading factor utilize the error rate result of physical layer to draw the relation that data frame transfer frame error rate and travelling carriage first receive the bit signal to noise ratio.
If each bit in the grouping bag has identical bit error rate, and the bit mistake is irrelevant, then transmits frame error rate first to be:
P e = 1 - ( 1 - P b ) N P - - - [ 18 ]
N p = W &CenterDot; log 2 M &CenterDot; R c &CenterDot; TTI SF - - - [ 19 ]
Wherein W is a spreading rate, P bBe bit error rate, N pBe grouping packet length, R cBe code rate.
Step s204, modulation coding mode, code channel number, spreading rate, spreading factor and H-ARQ mode (two kinds of Chase Combining and Incremental Redundancy) for given, utilize the error rate result of physical layer, provide the twice data frame transfer version merging frame error rate afterwards and the relation of travelling carriage reception bit signal to noise ratio.
Situation for Chase Combining H-ARQ:
Chase Combining HARQ adopts Rake receiver high specific folding.Then carry out adjacent two versions and merge frame error rate P afterwards sWith P eSimilar expression formula is arranged, as long as at formula [18] P bComputational process in γ b *=2 γ bGet final product P sExpression formula, see formula [12] or [17] of step s202.
Situation for Incremental Redundancy H-ARQ:
Consider to merge the situation of two transmission versions.Twice transmission is equivalent to code length and becomes twice, and code rate becomes original 1/2 once transmission.Promptly in formula [19], make N p'=2N p, at formula [18] P bComputational process in make R c'=R c/ 2 once transmission, get final product P sExpression formula, see formula [11] or [16] of step s202.
Step s205, the frame error rate after utilizing step s203 twice data frame transfer version of data frame transfer frame error rate and step s204 merging first, for given modulation coding mode, code channel number, spreading rate, spreading factor, feedback information error probability (empirical value desirable 0.01 or 0.1) and H-ARQ mode (two kinds of Chase Combining and Incremental Redundancy), obtain the relation that data frame transfer number of times probability distribution and travelling carriage receive the bit signal to noise ratio.
Suppose that the feedback acknowledgment channel is imperfect, error of transmission might take place in the feedback information ACK or the NACK of receiving terminal.But only can make confirmation lose, can not pass into ACK NACK or NACK is passed into ACK.Suppose that the confirmation fails rate is P fThe probability of the inferior successful decoded information piece of j (j>1) then, promptly the number of transmissions is that the probability of j is
P j=[1-(1-P e)(1-P f)][1-(1-P eP s)(1-P f)] j-2(1-P eP s)(1-P f) [20]
When j=1, P j=(1-P e) (1-P f).
Step s206, utilize step s205 data frame transfer number of times probability distribution, for given modulation coding mode, code channel number, spreading rate, spreading factor, feedback information error probability (empirical value desirable 0.01 or 0.1) and H-ARQ mode (comprising two kinds of Chase Combining and Incremental Redundancy), allow to obtain the relation that Frame average transmission number of times and travelling carriage receive the bit signal to noise ratio under the maximum retransmission restriction in certain system.
It is N that supposing the system allows maximum retransmission Max, then the average of the number of transmissions is
N s = &Sigma; j = 1 N max j P j - - - [ 21 ]
Calculating can get the average transmission number of times
N s = 1 + ( 1 - P f ) ( P e - P e P s ) ( 1 - P e P s ) ( 1 - P f )
- [ 1 - ( 1 - P e ) ( 1 - P f ) ] { ( 1 + N max ) [ 1 - ( 1 - P e P s ) ( 1 - P f ) ] N max - 1 - N max [ 1 - ( 1 - P e P s ) ( 1 - P f ) ] N max } ( 1 - P e P s ) ( 1 - P f ) - - - [ 22 ]
Step s207, the frame error rate after utilizing step s203 twice data frame transfer version of data frame transfer frame error rate and step s204 merging first, for given modulation coding mode, code channel number, spreading rate, spreading factor, feedback information error probability (empirical value desirable 0.01 or 0.1) and H-ARQ mode (two kinds of Chase Combining and Incremental Redundancy), allow under the maximum retransmission restriction in certain system, the system of providing carries out the relation of residue frame error rate and travelling carriage reception bit signal to noise ratio after maximum times retransmits.
AMC carries out work in conjunction with H-ARQ.Maximum times transmission N is carried out in definition MaxAfter the residue frame error rate:
FER r = [ 1 - ( 1 - P e ) ( 1 - P f ) ] [ 1 - ( 1 - P e P s ) ( 1 - P f ) ] N max - 1 - - - [ 23 ]
System is to FER rCertain requirement is arranged, must be no more than P Loss, i.e. FER r≤ P Loss, P LossBe target residue frame error rate.Have only as residue frame error rate FER rValue less than P LossThe time, Frame is just correctly received.
Step s208, utilize step s206 Frame average transmission number of times and step s207 residue frame error rate, for given transmission mode, as modulation coding mode, code channel number, spreading rate, spreading factor, feedback information error probability (empirical value desirable 0.01 or 0.1) and H-ARQ mode (two kinds of Chase Combining and Incremental Redundancy), provide the relation that link effective data rate and travelling carriage receive the bit signal to noise ratio.
When the modulation system that adopts when system is M-QAM or QPSK (order of modulation of QPSK and 4-QAM equate), code rate is R cTurbo code, N CodeDuring the combination of individual code channel, link effective data rate is:
R AMC = W &CenterDot; log 2 M &CenterDot; R c &CenterDot; N code &CenterDot; ( 1 - FER r ) SF &CenterDot; N s - - - [ 24 ]
Step s209, utilize step s207 residue frame error rate, given spreading rate, spreading factor, feedback information error probability (empirical value desirable 0.01 or 0.1) and H-ARQ mode (two kinds of Chase Combining and Incremental Redundancy), for the transmission mode correspondence of selecting modulation coding mode and code channel number combination, provide and reach a signal-noise ratio threshold that sets the goal residue frame error rate (empirical value is 1%).
Design object is a maximum data speed, satisfies qos requirement simultaneously.Suppose that through-put power remains unchanged.Cutting apart whole signal to noise ratio scope is N+1 nonoverlapping continuum, and interval separation is designated as { γ n} N=0 N+1Work as γ b∈ [γ n, γ N+1) time, preference pattern n.For fear of deep fade, work as γ b∈ [γ 0, γ 1) time, there are not valid data to propagate.
Provide the signal to noise ratio separation γ of MCS below nDefinite method.γ nBe to guarantee under the scene of transmission mode n, to make FER r=P LossSignal to noise ratio.
Ask FER rAbout γ bInverse function get:
γ b=f(FER r,MCS) [25]
The signal to noise ratio separation can be expressed as so:
γ 0=0
γ n=f(P loss,MCS n)n=1,2,...,N [26]
γ N+1=+∞
The γ that through type [26] is tried to achieve n, can guarantee AMC mechanism accord with Q oS requirement.Under the prerequisite that keeps the target qos requirement, this AMC mechanism can maximize the availability of frequency spectrum.
Step s210, the signal-noise ratio threshold that utilizes link effective data rate under the combination of the certain modulation coding mode of step s208 and code channel number and step 209 to obtain, given spreading rate, spreading factor, feedback information error probability (empirical value desirable 0.01 or 0.1) and H-ARQ mode (two kinds of Chase Combining and Incremental Redundancy), the relation that obtains adopting link effective data rate behind AMC and the H-ARQ and travelling carriage to receive the bit signal to noise ratio.
After adopting AMC mechanism, adjust MCS mode and code channel number according to the size adaptation ground of travelling carriage received signal to noise ratio.Convolution [24] [26] can obtain the corresponding relation of link effective data rate and travelling carriage received signal to noise ratio.Work as γ b∈ [γ n, γ N+1) time, preference pattern n obtains corresponding effective data rate by formula [24].For fear of deep fade, work as γ b∈ [γ 0, γ 1) time, there are not valid data to propagate.
In the embodiments of the invention two, the computational methods of system level have been described.When carrying out sub-district internal and external interference analysis, consider 19 sub-districts, 3 sector topology, analyze the influence of fast dispatch to systematic function, 19 sub-districts, 3 sector topology are typical cell topologies in the cellular network planning, are that the result that obtains of example analysis is the most representative with 19 sub-districts, 3 sector topology.At first when the activating moving platform fixed-site, obtain sector throughput, user throughput.Require and the activation of service factor for given service rate simultaneously, the system of providing satisfies user's ratio.Consider that then average sector throughput, user's average throughput and system when all activated location of mobile station evenly distributes satisfy user's ratio in serving sector.Concrete, the calculation process of system level comprises following flow process as shown in Figure 3:
Employing AMC that obtains among step s301, the obtaining step s210 and the link effective data rate behind the H-ARQ and travelling carriage receive the relation of bit signal to noise ratio.
Step s302, consideration 19 sub-districts shown in Figure 43 sector strucres, wherein the shadow region is a center cell, θ AjExpression base station j is at the antenna directional angle of terminal location, (γ j, θ Aj) expression base station j position coordinates; (γ, θ) position coordinates of expression terminal.
Orthogonal factor, path loss index, shadow fading average and standard deviation in given spreading factor, service channel power ratio, the sub-district, all activated location of mobile station is obtained the probability distribution that travelling carriage receives the bit signal to noise ratio necessarily not constantly in the sector.
Suppose: (1) considers 19 sub-districts, 3 sectorized cell structures as shown above, and the hexagon radius is R, and the antenna lobe function of base station transmit antennas is:
A ( &theta; Aj ) = - min [ 12 ( &theta; Aj &theta; 3 dB ) 2 , A m ] - - - [ 27 ]
In the formula, θ AjExpression base station j is at the antenna directional angle of terminal location, and its span is [π, π], makes θ 3dB=70 °, A m=20dB; (2) location of mobile station is evenly to distribute; (3) shadow fading of consideration logarithm normal distribution; (4) use polar coordinates (r, θ), this cell base station as with initial point, horizontal line is as pole axis; (r, propagation loss θ) is to travelling carriage in (a 5) i base station
L i ( r , &theta; ) = D - l 10 X i 10 = D - l e Y i = D - l K i - - - [ 28 ]
Wherein D is that (l is path loss exponent (representative value is 3 or 4) for r, distance θ) to travelling carriage in i base station.X iFor average is zero, standard deviation is σ XiGaussian (Gauss) distribute K iFor the lognormal stochastic variable, represent shadow fading.Consider the shade correlation between the sub-district, can be with X iBe modeled as following form:
X i=aζ c+bζ i [29]
In the formula, ζ cBe the shared factor of all base stations, and ζ iValue then different, and separate each other because of the base station; Suppose that the shade correlation between the sub-district is 0.5, then can make a=b=1/ , ζ iThe value such as the table 2 of standard deviation.
Table 2
Type of ground objects Dense city The shopping mall Highway, the arterial highway The city The suburb The rural area
Shadow fading standard deviation (dB) 11.7 11.7 6 9.4 7.2 6.2
I base station (r i, θ i) (r, decline θ) is to travelling carriage
L i ( r , &theta; ) = ( r 2 + r i 2 - 2 r i r cos ( &theta; i - &theta; ) ) - 1 2 K i - - - [ 30 ]
(r i, θ i) be the polar coordinates of each base station location.
(r, received signal to noise ratio θ) is travelling carriage
&gamma; b = E b N t = SF &CenterDot; &psi; PA ( &theta; A 0 ) L 0 ( r , &theta; ) / W N 0 + &Sigma; i = 1 18 PA ( &theta; Ai ) L i ( r , &theta; ) / W + ( 1 - &alpha; ) &CenterDot; PA ( &theta; A 0 ) L 0 ( r , &theta; ) / W
= SF &CenterDot; &psi; PA 0 ( &theta; ) K 0 r - l / W N 0 + &Sigma; i = 1 18 PA ( &theta; Ai ) ( r 2 + r i 2 - 2 r i r cos ( &theta; i - &theta; ) ) - 1 2 K i / W + PA ( &theta; A 0 ) K 0 r - l ( 1 - &alpha; ) / W - - - [ 31 ]
Wherein SF is a spreading factor, and ψ disposes power proportions to high-rate traffic channel for Node B.N 0Be thermal noise density, P and W are the maximum transmission power and the apread spectrum bandwidth of base station, and A (θ Aj) be equivalent to the power attenuation factor of transmitting antenna on the terminal direction of base station j, depend on the antenna directional angle θ of base station j on terminal location AjOwing to compare with total transmitted signal power, the background heat The noise can be ignored, so following formula can be exchanged into following form:
&gamma; b = SF &CenterDot; &psi; K 0 &Sigma; i = 1 18 A ( &theta; Ai ) A ( &theta; A 0 ) &CenterDot; J i - l K i + K 0 &CenterDot; ( 1 - &alpha; ) = SF &CenterDot; &psi; 10 X 0 / 10 &Sigma; i = 1 18 A ( &theta; Ai ) A ( &theta; A 0 ) &CenterDot; J i - l 10 x i / 10 + 10 X 0 / 10 &CenterDot; ( 1 - &alpha; )
= SF &CenterDot; &psi; 1 &Sigma; i = 1 18 A ( &theta; Ai ) A ( &theta; A 0 ) &CenterDot; J i - l 10 b ( &zeta; i - &zeta; 0 ) / 10 + ( 1 - &alpha; ) = SF &CenterDot; &psi; 1 &Sigma; i = 1 18 I i + ( 1 - &alpha; ) = SF &CenterDot; &psi; 1 X + ( 1 - &alpha; ) - - - [ 32 ]
J i = ( 1 + ( r i r ) 2 - 2 ( r i r ) cos ( &theta; i - &theta; ) ) 1 2 - - - [ 33 ]
In the formula [32],
Figure A20071010769500214
For certain terminal is the amount of a determining positions, so I iBe one group of separate lognormal variable, and limited separate lognormal stochastic variable sum can be approximately the lognormal stochastic variable, that is to say that X still is a lognormal variable, and then r bAlso obeys logarithm normal distribution, its average and variance can be tried to achieve by the Wilkinson method.
Step s303, utilize step s301 link effective data rate and step s302 travelling carriage to receive the probability distribution of bit signal to noise ratio, consider 19 sub-districts, 3 sector strucres, given spreading factor, the service channel power ratio, orthogonal factor in the sub-district, path loss index, shadow fading average and standard deviation, spreading rate, feedback information error probability (empirical value desirable 0.01 or 0.1), system allows maximum retransmit restriction and H-ARQ mode (two kinds of Chase Combining and Incremental Redundancy), all activated location of mobile station one is regularly obtained and is adopted different fast dispatch mechanism (as polling dispatching in the sector, the max carrier to interference scheduling, Proportional Fair etc.) sector throughput and user throughput the time.
A) Maximum C/I Scheduling Algorithm (max carrier to interference scheduling)
N user position is (r i, θ i) (i user's signal to noise ratio is γ during 1≤i≤N) i DBAnd the probability density function that is scheduled is:
f &gamma; i dB s ( &gamma; i dB ) = Pr ( &gamma; i dB = max j { &gamma; j dB } ) f &gamma; i dB ( &gamma; i dB )
= &Pi; j = 1 , j &NotEqual; i N Pr ( &gamma; i dB &le; &gamma; i dB ) f &gamma; i dB ( &gamma; i dB )
= &Pi; j = 1 , j &NotEqual; i N [ 1 - Q ( &gamma; i dB - 10 lg ( SF &CenterDot; &psi; ) - m n ( r j , &theta; j ) &sigma; n ( r j , &theta; j ) ) ]
&CenterDot; 1 2 &pi; &sigma; n exp [ - ( &gamma; i dB - 10 lg ( SF &CenterDot; &psi; ) - m n ( r i , &theta; i ) ) 2 2 &sigma; n 2 ( r i , &theta; i ) ] - - - [ 34 ]
Received signal to noise ratio γ when then i user is scheduled i DBThe probability that drops on the signal to noise ratio interval at MCS pattern n place is
Pr ( n ) = &Integral; &gamma; n dB &gamma; n + 1 dB f &gamma; i dB s ( &gamma; i dB ) d &gamma; i dB - - - [ 35 ]
Simultaneously, the average repeat time under the MCS pattern n is
N &OverBar; n = &Integral; &gamma; n dB &gamma; n + 1 dB N s f &gamma; i dB s ( &gamma; i dB ) d &gamma; i dB Pr ( n ) - - - [ 36 ]
Residue frame error rate under the MCS pattern n is
FER r ( n ) = &Integral; &gamma; n dB &gamma; n + 1 dB FER r &CenterDot; f &gamma; i dB s ( &gamma; i dB ) d &gamma; i dB Pr ( n ) - - - [ 37 ]
Then N user position is (r i, θ i) (i user's throughput is during 1≤i≤N)
Th ( r i , &theta; i ) = W SF &CenterDot; &Sigma; n = 1 N mcs N code ( n ) &CenterDot; log 2 M n &CenterDot; R c ( n ) &CenterDot; ( 1 - FE R r ( n ) ) &CenterDot; Pr ( n ) N &OverBar; n - - - [ 38 ]
Wherein, N MCSFor adopting the transmission mode sum, W is a spreading rate, and SF is a spreading factor, N Code(n), M nAnd R c(n) be respectively code channel number, order of modulation and code rate used when adopting transmission mode n.
N user position is (r i, θ i) (sector throughput of 1≤i≤N) is
Th ( r &RightArrow; , &theta; &RightArrow; ) = &Sigma; n = 1 N Th ( r i , &theta; i ) - - - [ 39 ]
B) Proportional Fair Scheduling Algorithm (Proportional Fair)
N user position is (r i, θ i) (i user's signal to noise ratio is γ during 1≤i≤N) i DBAnd the probability density function that is scheduled is
f &gamma; i dB s ( &gamma; i dB ) = Pr ( &gamma; i dB - &gamma; i dB &OverBar; = max j { &gamma; j dB - &gamma; j dB &OverBar; } ) f &gamma; i dB ( &gamma; i dB )
= &Pi; j = 1 , j &NotEqual; i N Pr ( &gamma; j dB - &gamma; j dB &OverBar; &le; &gamma; i dB - &gamma; i dB &OverBar; ) f &gamma; i dB ( &gamma; i dB )
= &Pi; j = 1 , j &NotEqual; i N [ 1 - Q ( &gamma; i dB - 10 lg ( SF &CenterDot; &psi; ) - m n ( r i , &theta; i ) &sigma; n ( r j , &theta; j ) ) ]
&CenterDot; 1 2 &pi; &sigma; n exp [ - ( &gamma; i dB - 10 lg ( SF &CenterDot; &psi; ) - m n ( r i , &theta; i ) ) 2 2 &sigma; n 2 ( r i , &theta; i ) ] - - - [ 40 ]
Received signal to noise ratio γ when then i user is scheduled i DBThe probability that drops on the signal to noise ratio interval at MCS pattern n place is
Pr ( n ) = &Integral; &gamma; n dB &gamma; n + 1 dB f &gamma; b dB s ( &gamma; b dB ) d &gamma; b dB - - - [ 41 ]
Simultaneously, the average repeat time under the MCS pattern n is
N &OverBar; n = &Integral; &gamma; n dB &gamma; n + 1 dB N s f &gamma; b dB s ( &gamma; b dB ) d &gamma; b dB Pr ( n ) - - - [ 42 ]
Residue frame error rate under the MCS pattern n is
FER r ( n ) = &Integral; &gamma; n dB &gamma; n + 1 dB FER r &CenterDot; f &gamma; b dB s ( &gamma; b dB ) d &gamma; b dB Pr ( n ) - - - [ 43 ]
Then N user position is (r i, θ i) (i user's throughput is during 1≤i≤N)
Th ( r i , &theta; i ) = W SF &CenterDot; &Sigma; n = 1 N mcs N code ( n ) &CenterDot; log 2 M n &CenterDot; R c ( n ) &CenterDot; ( 1 - FER r ( n ) ) &CenterDot; Pr ( n ) N &OverBar; n - - - [ 44 ]
N wherein Code(n), M nAnd R c(n) be respectively code channel number, order of modulation and code rate used when adopting transmission mode n, W is a spreading rate, and SF is a spreading factor.
N user position is (r i, θ i) (sector throughput of 1≤i≤N) is
Th ( r &RightArrow; , &theta; &RightArrow; ) = &Sigma; n = 1 N Th ( r i , &theta; i ) - - - [ 45 ]
Step s304, utilize step s303 user throughput, consider 19 sub-districts, 3 sector strucres, given spreading factor, the service channel power ratio, orthogonal factor in the sub-district, path loss index, shadow fading average and standard deviation, spreading rate, feedback information error probability (empirical value desirable 0.01 or 0.1), system allows maximum retransmit restriction and H-ARQ mode (two kinds of Chase Combining and IncrementalRedundancy), the service rate and the activation of service factor, all activated location of mobile station one is regularly obtained and is adopted different fast dispatch mechanism (as polling dispatching in the sector, the max carrier to interference scheduling, Proportional Fair etc.) system the time satisfies user's ratio.
Suppose that professional digit rate rate requirement is R, the activation of service factor is ρ.There is N the user who activates in system, and the user throughput that provides is Th (r i, θ i) (i=1,2 ..., N).The requirement that the user satisfies is
Th(r i,θ i)≥R·ρ [46]
If satisfying the number of users of following formula is N *, then user's ratio that system is satisfied is
P=N */N [47]
Step s305, utilize all activated location of mobile station one sector throughput and user throughput regularly in the step s303 sector, consider 19 sub-districts, 3 sector strucres, given spreading factor, the service channel power ratio, orthogonal factor in the sub-district, path loss index, shadow fading average and standard deviation, spreading rate, feedback information error probability (empirical value desirable 0.01 or 0.1), system allows maximum retransmit restriction and H-ARQ mode (two kinds of Chase Combining and Incremental Redundancy), when all activated location of mobile station evenly distributes in the sector, obtain and adopt different fast dispatch mechanism (as polling dispatching, the max carrier to interference scheduling, Proportional Fair etc.) average sector throughput and average user throughput the time.
Suppose that customer location is obeyed evenly distribution, the three kinds of situations shown in component 5A, 5B, the 5C that concern of span A and r in the sector.Suppose that diameter is 1, then the gross area is 3 /8.
Under situation shown in Fig. 5 A, A=2 π/3;
The gross area in such cases is:
S 1 = &Integral; 0 1 / 2 2 &pi; 3 rdr = &pi; 12 - - - [ 48 ]
Under situation shown in Fig. 5 B, obtain the relation of angle B and r earlier.Utilize sine,
r sin ( 2 &pi; / 3 ) = 1 / 2 sin C = 1 / 2 sin ( &pi; - ( 2 &pi; / 3 + B ) ) = 1 / 2 sin ( 2 &pi; / 3 + B ) - - - [ 49 ]
B=-π/6+arccos[/(4r) is then arranged], the value of A is so:
A = 2 &pi; 3 - 2 B = 2 &pi; 3 - 2 [ - &pi; 6 + arccos ( 3 4 r ) ] = &pi; - 2 arccos ( 3 4 r ) - - - [ 50 ]
The gross area in such cases is:
S 1 = &Integral; 1 / 2 3 / 2 [ &pi;r - 2 r arccos ( 3 4 r ) ] dr = &pi; 24 + 3 8 - - - [ 51 ]
Under situation shown in Fig. 5 C, in like manner can get
A = - 2 &pi; 3 + 2 arcsin ( 3 2 r ) - - - [ 52 ]
The gross area in such cases is
S 1 = &Integral; 3 / 2 1 [ - 2 &pi; 3 r + 2 r arcsin ( 3 2 r ) ] dr = 3 4 - &pi; 8 - - - [ 53 ]
(1) polling dispatching
Its average sector throughput is the same during unique user with service.Each user's average throughput is the 1/N of average sector throughput.
Provide the throughput when having only unique user in the sector below.If the position at user place be (r, θ), received signal to noise ratio γ then b DBThe probability that drops on the signal to noise ratio interval at MCS pattern n place is
Pr ( n ) = Q ( SNR n dB - 101 g ( SF &CenterDot; &psi; ) - m n ( r , &theta; ) &sigma; n ( r , &theta; ) ) - Q ( SNR n + 1 dB - 101 g ( SF &CenterDot; &psi; ) - m n ( r , &theta; ) &sigma; n ( r , &theta; ) ) - - - [ 54 ]
M wherein nAnd σ nValue and the position of travelling carriage (r, θ) relevant.
Average repeat time under the MCS pattern n is simultaneously
N &OverBar; n = &Integral; &gamma; n dB &gamma; n + 1 dB N s f &gamma; b dB ( &gamma; b dB ) d &gamma; b dB Pr ( n ) - - - [ 55 ]
Residue frame error rate under the MCS pattern n is:
FER r ( n ) = &Integral; &gamma; n dB &gamma; n + 1 dB FER r &CenterDot; f &gamma; b dB ( &gamma; b dB ) d &gamma; b dB Pr ( n ) - - - [ 56 ]
When adopting MCS nDuring pattern, modulation system is M n-QAM, code rate is R cEach transmission symbol carries R n=R cLog 2(M n) individual information bit.For coding transmission pattern not, R c=1.Adopting a bandwidth is B=1/T sThe Nyquist pulse shaping filter, T wherein sBe character rate.The position is that (r, user throughput θ) is
Th ( r , &theta; ) = W SF &CenterDot; &Sigma; n = 1 N mcs N code ( n ) log 2 M n &CenterDot; R c ( n ) &CenterDot; ( 1 - FER r ( n ) ) &CenterDot; Pr ( n ) N &OverBar; n - - - [ 57 ]
N wherein Code(n), M nAnd R c(n) be respectively code channel number, order of modulation and code rate used when adopting transmission mode n, W is a spreading rate, and SF is a spreading factor.
Consider that location of mobile station evenly distributes in serving sector, during then single user, the average throughput of sector is:
Th &OverBar; sec tor = &Integral; 0 1 / 2 ( &Integral; - &pi; / 3 &pi; / 3 Th ( r , &theta; ) &CenterDot; 8 3 9 d&theta; ) dr
+ &Integral; 1 / 2 3 / 2 ( &Integral; - { &pi; - 2 arccos [ 3 / ( 4 r ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r ) ] } / 2 Th ( r , &theta; ) &CenterDot; 8 3 9 d&theta; ) dr
+ &Integral; 3 / 2 1 ( &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r ) ] } / 2 Th ( r , &theta; ) &CenterDot; 8 3 9 d&theta; ) dr - - - [ 58 ]
This is the sector throughput when adopting Round Robin dispatching algorithm.Under a this N user was evenly distributed in situation in the sector, each user's average throughput was:
Th &OverBar; user = Th &OverBar; sec tor N - - - [ 59 ]
(2) max carrier to interference and Proportional Fair
A plurality of users are uniformly distributed in the sector, and then the average throughput of sector is expressed as for all possible distribution situation is carried out statistical average:
Th &OverBar; sec tor = ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; 1 d r 1 + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccos [ 3 / ( 4 r 1 ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r 1 ) ] } / 2 d &theta; 1 d r 1 + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 1 ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 1 ) ] } / 2 d&theta; 1 d r 1 )
&CenterDot; ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; 2 d r 2 + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccos [ 3 / ( 4 r 2 ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r 2 ) ] } / 2 d &theta; 2 d r 2 + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 2 ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 2 ) ] } / 2 d&theta; 2 d r 2 )
...
&CenterDot; ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; N d r N + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccos [ 3 / ( 4 r N ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r N ) ] } / 2 d &theta; N d r N + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r N ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r N ) ] } / 2 d&theta; N d r N )
Th ( r &RightArrow; , &theta; &RightArrow; ) ( 8 3 9 ) N - - - [ 60 ]
Under a this N user was evenly distributed in situation in the sector, each user's average throughput was:
Th &OverBar; user = Th &OverBar; sec tor N - - - [ 61 ]
Step s306, utilize all activated location of mobile station one system regularly in the step s304 sector to satisfy user throughput when all activated location of mobile station evenly distributes in user's ratio and the step s305 sector, consider 19 sub-districts, 3 sector strucres, given spreading factor, the service channel power ratio, orthogonal factor in the sub-district, path loss index, shadow fading average and standard deviation, spreading rate, feedback information error probability (empirical value desirable 0.01 or 0.1), system allows maximum retransmit restriction and H-ARQ mode (two kinds of ChaseCombining and Incremental Redundancy), the service rate and the activation of service factor, when all activated location of mobile station evenly distributes in the sector, obtain and adopt different fast dispatch mechanism (as polling dispatching, the max carrier to interference scheduling, Proportional Fair etc.) average system the time satisfies user's ratio.
A plurality of users are uniformly distributed in the sector, and then user's ratio that system is satisfied is the statistical average of all possible distribution situation, is expressed as:
P &OverBar; = ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; 1 dr 1 + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccos [ 3 / ( 4 r 1 ) ] } / 2 &pi; - 2 arccos [ 3 / ( 4 r 1 ) ] } / 2 d &theta; 1 dr 1 + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 1 ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 1 ) ] } / 2 d &theta; 1 dr 1 )
&CenterDot; ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; 2 dr 2 + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccos [ 3 / ( 4 r 2 ) ] } / 2 &pi; - 2 arccos [ 3 / ( 4 r 2 ) ] } / 2 d &theta; 2 dr 2 + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 2 ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 2 ) ] } / 2 d &theta; 2 dr 2 )
...
&CenterDot; ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; N dr N + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccos [ 3 / ( 4 r N ) ] } / 2 &pi; - 2 arccos [ 3 / ( 4 r N ) ] } / 2 d &theta; N dr N + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 2 ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 2 ) ] } / 2 d &theta; N dr N )
P &CenterDot; ( 8 3 9 ) N - - - [ 62 ]
By using the capacity estimation method of the HSDPA that the foregoing description provides, taken all factors into consideration that various key technologies such as Adaptive Modulation and Coding, rapid mixing retransmit automatically, fast dispatch etc. is to the influence of HSDPA capacity, comprises two aspects of link and system.In the link aspect, overcome the limitation of independent analysis AMC and H-ARQ performance, thereby made properer the tallying with the actual situation of estimation result.In system level, analyze the mathematic(al) representation of fast dispatch, thereby enlarged the scope of application of evaluation method the influence of systematic function.The capacity of HSDPA has been analyzed in the organically combination of volume calculation step of link aspect and system level in addition more all sidedly.
In the embodiments of the invention three, the volume calculation device of a kind of HSDPA comprises as shown in Figure 6: link aspect processing module 10, system level processing module 20 and parameter are provided with module 30.Wherein,
Link aspect processing module 10 is used to obtain the link aspect and adopts Adaptive Modulation and Coding AMC and rapid mixing to retransmit the link effective data rate behind the H-ARQ and the corresponding relation of travelling carriage received signal to noise ratio automatically.
System level processing module 20 is used for the corresponding relation that obtains according to link aspect processing module and receives bit signal to noise ratio probability distribution, and user throughput, sector throughput and the system of the system that obtains under dispatching algorithm satisfies user's ratio.
Parameter is provided with module 30, required parameter when being used to be provided with link aspect processing module and system level processing module and handling, required parameter comprised one or more in the parameter required when channel model, modulation coding mode, code channel number, spreading rate, spreading factor, high speed downlink packet insert Transmission Time Interval, rapid mixing and retransmit Frame maximum transmission times, feedback information error probability, the Frame maximum retransmission that mode, system allow automatically and obtain the physical layer error rate when link aspect processing module was handled; Frame maximum transmission times, the fast automatic mixing that required parameter comprised that cell topology, spreading factor, service rate require when the system level processing module was handled, the activation of service factor, spreading rate, feedback information error probability, system allow retransmits the average of orthogonal factor, path loss index, shadow fading in mode, fast dispatch mechanism, service channel power ratio, the sub-district and in the standard deviation one or more.
Wherein, link aspect processing module 10 further comprises:
Effective data rate obtains submodule 11, obtains Frame average transmission number of times and residue frame error rate, obtains link effective data rate;
Signal-noise ratio threshold obtains submodule 12, obtains signal-noise ratio threshold according to the residue frame error rate;
Corresponding relation obtains submodule 13, obtain the link effective data rate that submodule 11 obtains according to effective data rate, and signal-noise ratio threshold obtains the signal-noise ratio threshold that submodule 12 obtains, and obtains the corresponding relation that adopts AMC and H-ARQ link effective data rate and travelling carriage received signal to noise ratio.
Wherein, the system level processing module specifically comprises 20:
Throughput is obtained submodule 21, the corresponding relation that obtains according to link aspect processing module, and the probability distribution that receives the bit signal to noise ratio, sector and user throughput when obtaining location of mobile station and evenly distributing;
Ratio is obtained submodule 22, and the corresponding relation that obtains according to link aspect processing module, and the probability distribution that receives the bit signal to noise ratio obtain location of mobile station and satisfy user's ratio fixedly the time;
Estimation submodule 23, sector and user throughput when the location of mobile station that obtains according to throughput submodule 21 evenly distributes, and ratio obtains location of mobile station that submodule 22 obtains and satisfies user's ratio fixedly the time, satisfies user's ratio when obtaining location of mobile station and evenly distributing.
By using the volume calculation device of the HSDPA that above embodiment provides, comprise two aspects of link and system.In the link aspect, overcome the limitation of independent analysis AMC and H-ARQ performance, thereby made properer the tallying with the actual situation of estimation result.In system level, analyze the mathematic(al) representation of fast dispatch, thereby enlarged the scope of application of evaluation method the influence of systematic function.The capacity of HSDPA has been analyzed in the organically combination of volume calculation step of link aspect and system level in addition more all sidedly.
More than disclosed only be several specific embodiment of the present invention, still, the present invention is not limited thereto, any those skilled in the art can think variation all should fall into protection scope of the present invention.

Claims (16)

1, a kind of capacity estimation method of high speed downlink packet access is characterized in that, comprises the steps:
Obtain the link aspect and adopt the link effective data rate after Adaptive Modulation and Coding and rapid mixing retransmit automatically and the corresponding relation of travelling carriage received signal to noise ratio;
Obtain the ratio that user throughput, sector throughput and the system of system under dispatching algorithm satisfies the user according to described corresponding relation and reception bit signal to noise ratio probability distribution.
2, the capacity estimation method that inserts of high speed downlink packet according to claim 1 is characterized in that the described step of obtaining the corresponding relation of link effective data rate and travelling carriage received signal to noise ratio specifically comprises:
Obtain the signal-noise ratio threshold of link effective data rate and transmission mode;
According to the signal-noise ratio threshold of described link effective data rate and described transmission mode, obtain the corresponding relation of link effective data rate and travelling carriage received signal to noise ratio.
3, the capacity estimation method that inserts as high speed downlink packet as described in the claim 2 is characterized in that the described step of obtaining link effective data rate specifically comprises:
Obtain data frame transfer frame error rate and twice data frame transfer version merging frame error rate afterwards first;
Merge frame error rate afterwards according to the described frame error rate of data frame transfer first and twice data frame transfer version, obtain data frame transfer number of times probability distribution;
According to described data frame transfer number of times probability distribution, obtain Frame average transmission number of times;
Merge frame error rate afterwards according to the described frame error rate of data frame transfer first and described twice data frame transfer version, obtain the residue frame error rate;
According to described Frame average transmission number of times and described residue frame error rate, the link effective data rate when obtaining described transmission mode and determining.
4, the capacity estimation method that inserts as high speed downlink packet as described in the claim 2 is characterized in that the described step of obtaining the signal-noise ratio threshold of transmission mode specifically comprises:
Obtain data frame transfer frame error rate and twice data frame transfer version merging frame error rate afterwards first;
Merge frame error rate afterwards according to the described frame error rate of data frame transfer first and described twice data frame transfer version, obtain the residue frame error rate;
According to described residue frame error rate, obtain the signal-noise ratio threshold of described transmission mode.
5, the capacity estimation method that inserts as high speed downlink packet as described in the claim 3 is characterized in that described data frame transfer number of times probability distribution P jFor:
Automatically retransmit mode for given modulation coding mode, code channel number, spreading rate, spreading factor, feedback information error probability and rapid mixing,
P j=[1-(1-P e)(1-P f)][1-(1-P eP s)(1-P f)] j-2(1-P eP s)(1-P f);
When j=1, P j=(1-P e) (1-P f);
Wherein, P eHeaded by the data transfer frame error rate, P sBe the frame error rate after twice transmission version merges, P fBe feedback acknowledgment information errors rate.
6, the capacity estimation method that inserts as high speed downlink packet as described in the claim 3 is characterized in that described Frame average transmission times N sFor:
Automatically retransmit mode for given modulation coding mode, code channel number, spreading rate, spreading factor, feedback information error probability and rapid mixing,
N s = 1 + ( 1 - P f ) ( P e - P e P s ) ( 1 - P e P s ) ( 1 - P f )
- [ 1 - ( 1 - P e ) ( 1 - P f ) ] { ( 1 + N max ) [ 1 - ( 1 - P e P s ) ( 1 - P f ) ] N max - 1 - N max [ 1 - ( 1 - P e P s ) ( 1 - P f ) ] N max } ( 1 - P e P s ) ( 1 - P f )
Wherein, N MaxBe the Frame maximum transmission times that system allows, P eHeaded by the data transfer frame error rate, P sBe the frame error rate after twice transmission version merges, P fBe feedback acknowledgment information errors rate.
7, the capacity estimation method that inserts as high speed downlink packet as described in claim 3 or 4 is characterized in that described residue frame error rate FER rFor:
Automatically retransmit mode for given modulation coding mode, code channel number, spreading rate, spreading factor, feedback information error probability and rapid mixing,
FER r = [ 1 - ( 1 - P e ) ( 1 - P f ) ] [ 1 - ( 1 - P e P s ) ( 1 - P f ) ] N max - 1 , And FER r≤ P Loss
Wherein, P eHeaded by the data transfer frame error rate, P sBe the frame error rate after twice transmission version merges, P fBe feedback acknowledgment information errors rate, P LossBe target residue frame error rate, N MaxFrame maximum transmission times for system's permission.
8, the capacity estimation method that inserts of high speed downlink packet according to claim 1 is characterized in that described reception bit signal to noise ratio probability distribution is:
Obtain described reception bit signal to noise ratio probability distribution according to cell topology.
9, the capacity estimation method that inserts of high speed downlink packet according to claim 1, it is characterized in that, state according to described corresponding relation and receive bit signal to noise ratio probability distribution and obtain the step that user throughput, sector throughput and the system of system under dispatching algorithm satisfy user's ratio and specifically comprise:
Receive the probability distribution and the link effective data rate of bit signal to noise ratio according to described travelling carriage, obtain sector and the user throughput of location of mobile station fixedly the time;
Sector and user throughput according to described location of mobile station fixedly the time, sector and user throughput when obtaining location of mobile station and evenly distributing;
Sector and user throughput according to described location of mobile station fixedly the time obtain location of mobile station and satisfy user's ratio fixedly the time;
Sector when evenly distributing according to described location of mobile station and user throughput, and described location of mobile station satisfies user's ratio fixedly the time satisfy user's ratio when obtaining location of mobile station and evenly distributing.
10, the capacity estimation method that inserts as high speed downlink packet as described in the claim 9 is characterized in that when dispatching algorithm was polling dispatching, user throughput was when described location of mobile station evenly distributed:
Th ( r , &theta; ) = W SF &CenterDot; &Sigma; n = 1 N mcs N code ( n ) &CenterDot; log 2 M n &CenterDot; R c ( n ) &CenterDot; ( 1 - FER r ( n ) ) &CenterDot; Pr ( n ) N &OverBar; n
Wherein Th (r, θ) expression 3 sectorized cell structure kind positions, 19 sub-districts be (r, user throughput θ), W are spreading rate, SF is a spreading factor, N MCSBe transmission mode sum, N Code(n), M nAnd R c(n) be respectively code channel number, order of modulation and code rate used when adopting transmission mode n, N is the average repeat time under the modulating-coding pattern n, FER r(n) be residue frame error rate under the modulating-coding pattern n, Pr (n) is received signal to noise ratio γ b DBDrop on the probability in the signal to noise ratio interval at modulating-coding pattern n place;
The average throughput Th of sector when described location of mobile station evenly distributes Sec torFor:
Th &OverBar; sec tor = &Integral; 0 1 / 2 ( &Integral; - &pi; / 3 &pi; / 3 Th ( r , &theta; ) &CenterDot; 8 3 9 d&theta; ) dr
+ &Integral; 1 / 2 3 / 2 ( &Integral; - { &pi; - 2 arccos [ 3 / ( 4 r ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r ) ] } / 2 Th ( r , &theta; ) &CenterDot; 8 3 9 d&theta; ) dr
+ &Integral; 3 / 2 1 ( &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r ) ] } / 2 Th ( r , &theta; ) &CenterDot; 8 3 9 d&theta; ) dr
11, the capacity estimation method that inserts as high speed downlink packet as described in the claim 9 is characterized in that when dispatching algorithm was max carrier to interference and Proportional Fair, the average throughput of described sector was when described location of mobile station evenly distributed:
Th &OverBar; sec tor = ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; 1 d r 1 + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccod [ 3 / ( 4 r 1 ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r 1 ) ] } / 2 d&theta; 1 dr 1 + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 1 ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 1 ) ] } / 2 d&theta; 1 dr 1 )
&CenterDot; ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; 2 d r 2 + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccod [ 3 / ( 4 r 2 ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r 2 ) ] } / 2 d&theta; 2 dr 2 + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 2 ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 2 ) ] } / 2 d&theta; 2 dr 2 )
. . .
&CenterDot; ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; N d r N + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccod [ 3 / ( 4 r N ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r N ) ] } / 2 d&theta; N dr N + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r N ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r N ) ] } / 2 d&theta; N dr N )
Th ( r &RightArrow; , &theta; &RightArrow; ) ( 8 3 9 ) N
Wherein,
Figure A2007101076950005C6
For N user position is (r 1, θ 1) (sector throughput of 1≤i≤N), that is:
Th ( r &RightArrow; , &theta; &RightArrow; ) = &Sigma; n = 1 N Th ( r i , &theta; i ) .
Described user's average throughput is:
Th &OverBar; user = Th &OverBar; sec tor N
Wherein, N is a number of users.
12, the capacity estimation method that inserts as high speed downlink packet as described in the claim 9 is characterized in that the user's ratio P that satisfies when described location of mobile station evenly distributes is:
P &OverBar; = ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; 1 d r 1 + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccod [ 3 / ( 4 r 1 ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r 1 ) ] } / 2 d&theta; 1 dr 1 + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 1 ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 1 ) ] } / 2 d&theta; 1 dr 1 )
&CenterDot; ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; 2 d r 2 + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccod [ 3 / ( 4 r 2 ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r 2 ) ] } / 2 d&theta; 2 dr 2 + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 2 ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r 2 ) ] } / 2 d&theta; 2 dr 2 )
. . .
&CenterDot; ( &Integral; 0 1 / 2 &Integral; - &pi; / 3 &pi; / 3 d &theta; N d r N + &Integral; 1 / 2 3 / 2 &Integral; - { &pi; - 2 arccod [ 3 / ( 4 r N ) ] } / 2 { &pi; - 2 arccos [ 3 / ( 4 r N ) ] } / 2 d&theta; N dr N + &Integral; 3 / 2 1 &Integral; - { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r N ) ] } / 2 { - 2 &pi; / 3 + 2 arcsin [ 3 / ( 2 r N ) ] } / 2 d&theta; N dr N )
P &CenterDot; ( 8 3 9 ) N
Wherein, user's ratio that system satisfied when P was the activating moving platform fixed-site, N is a number of users.
13, a kind of volume calculation device of high speed downlink packet access is characterized in that, comprising:
Link aspect processing module is used to obtain the link aspect and adopts the link effective data rate after Adaptive Modulation and Coding and rapid mixing retransmit automatically and the corresponding relation of travelling carriage received signal to noise ratio;
The system level processing module is used for the corresponding relation that obtains according to described link aspect processing module and receives bit signal to noise ratio probability distribution, and user throughput, sector throughput and the system of the system that obtains under dispatching algorithm satisfies user's ratio.
14, the volume calculation device that inserts as high speed downlink packet as described in the claim 13, it is characterized in that, also comprise: parameter is provided with module, required parameter when being used to be provided with described link aspect processing module and system level processing module and handling, required parameter comprised channel model when described link aspect processing module was handled, modulation coding mode, code channel number, spreading rate, spreading factor, high speed downlink packet inserts Transmission Time Interval, rapid mixing retransmits mode automatically, the Frame maximum transmission times that system allows, the feedback information error probability, Frame maximum retransmission and one or more in the required parameter when obtaining the physical layer error rate; Frame maximum transmission times, the fast automatic mixing that required parameter comprised that cell topology, spreading factor, service rate require when described system level processing module was handled, the activation of service factor, spreading rate, feedback information error probability, system allow retransmits the average of orthogonal factor, path loss index, shadow fading in mode, fast dispatch mechanism, service channel power ratio, the sub-district and in the standard deviation one or more.
15, the volume calculation device that inserts as high speed downlink packet as described in the claim 13 is characterized in that described link aspect processing module further comprises:
Effective data rate obtains submodule, is used for obtaining link effective data rate according to Frame average transmission number of times and residue frame error rate;
Signal-noise ratio threshold obtains submodule, is used for obtaining signal-noise ratio threshold according to the residue frame error rate;
Corresponding relation obtains submodule, be used for obtaining the link effective data rate that submodule obtains according to effective data rate, and signal-noise ratio threshold obtains the signal-noise ratio threshold that submodule obtains, and obtains the link effective data rate that adopts after Adaptive Modulation and Coding and rapid mixing retransmit automatically and the corresponding relation of travelling carriage received signal to noise ratio.
16, the volume calculation device that inserts as high speed downlink packet as described in the claim 13 is characterized in that described system level processing module specifically comprises:
Throughput is obtained submodule, is used for the corresponding relation that obtains according to described link aspect processing module, and receives bit signal to noise ratio probability distribution, sector and user throughput when obtaining location of mobile station and evenly distributing;
Ratio is obtained submodule, is used for the corresponding relation that obtains according to described link aspect processing module, and receives bit signal to noise ratio probability distribution, obtains location of mobile station and satisfies user's ratio fixedly the time;
The estimation submodule, sector and user throughput when the location of mobile station that is used for obtaining according to the throughput submodule evenly distributes, and ratio obtains location of mobile station that submodule obtains and satisfies user's ratio fixedly the time, satisfies user's ratio when obtaining location of mobile station and evenly distributing.
CNA2007101076953A 2007-05-25 2007-05-25 A high-speed downlink packet access capacity estimation method and device Pending CN101080032A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA2007101076953A CN101080032A (en) 2007-05-25 2007-05-25 A high-speed downlink packet access capacity estimation method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA2007101076953A CN101080032A (en) 2007-05-25 2007-05-25 A high-speed downlink packet access capacity estimation method and device

Publications (1)

Publication Number Publication Date
CN101080032A true CN101080032A (en) 2007-11-28

Family

ID=38907213

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2007101076953A Pending CN101080032A (en) 2007-05-25 2007-05-25 A high-speed downlink packet access capacity estimation method and device

Country Status (1)

Country Link
CN (1) CN101080032A (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102664705A (en) * 2012-04-03 2012-09-12 西北工业大学 Aircraft data link adaptive encoding and modulation method
CN102833762A (en) * 2011-06-13 2012-12-19 中兴通讯股份有限公司 Method and device for determining user throughout of LTE (long term evolution) system cell
CN101860916B (en) * 2009-04-08 2013-01-23 大唐移动通信设备有限公司 Resource scheduling method and device
CN103139697A (en) * 2008-02-29 2013-06-05 皇家Kpn公司 Telecommunications network and method for time-based network access
CN103530814A (en) * 2013-09-30 2014-01-22 中国南方电网有限责任公司超高压输电公司南宁局 Telesignalisation data simulation system for 500kV area control centers
CN106737868A (en) * 2017-01-16 2017-05-31 深圳汇创联合自动化控制有限公司 A kind of mobile-robot system
CN110572226A (en) * 2019-07-15 2019-12-13 兰州理工大学 Method for calculating average channel capacity of FTN transmission system under double-Gamma turbulent channel

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103139697A (en) * 2008-02-29 2013-06-05 皇家Kpn公司 Telecommunications network and method for time-based network access
CN101860916B (en) * 2009-04-08 2013-01-23 大唐移动通信设备有限公司 Resource scheduling method and device
CN102833762A (en) * 2011-06-13 2012-12-19 中兴通讯股份有限公司 Method and device for determining user throughout of LTE (long term evolution) system cell
CN102833762B (en) * 2011-06-13 2017-10-27 中兴通讯股份有限公司 The user throughput of LTE system cell determines method and device
CN102664705A (en) * 2012-04-03 2012-09-12 西北工业大学 Aircraft data link adaptive encoding and modulation method
CN102664705B (en) * 2012-04-03 2014-10-29 西北工业大学 Aircraft data link adaptive encoding and modulation method
CN103530814A (en) * 2013-09-30 2014-01-22 中国南方电网有限责任公司超高压输电公司南宁局 Telesignalisation data simulation system for 500kV area control centers
CN103530814B (en) * 2013-09-30 2016-04-20 中国南方电网有限责任公司超高压输电公司南宁局 The remote signalling amount simulation system of 500kV Regional Control Center
CN106737868A (en) * 2017-01-16 2017-05-31 深圳汇创联合自动化控制有限公司 A kind of mobile-robot system
CN110572226A (en) * 2019-07-15 2019-12-13 兰州理工大学 Method for calculating average channel capacity of FTN transmission system under double-Gamma turbulent channel
CN110572226B (en) * 2019-07-15 2021-11-12 兰州理工大学 Method for calculating average channel capacity of FTN transmission system under double-Gamma turbulent channel

Similar Documents

Publication Publication Date Title
CN1309195C (en) Method of link adaptation in enhanced cellular systems to discriminate between high and low variability
CN1853385A (en) Method for scheduling uplink transmissions from user equipments by a base station determining a measure of a quality of service, and corresponding base station, user equipment and communication system
CN1555612A (en) Method and apparatus for controlling uplink transmissions of a wireless communication system
CN101053272A (en) Efficient rise over thermal (rot) control during soft handover
CN101053269A (en) Resource allocation in communication networks
CN1173500C (en) High-speed down data packet accessing system support method to different service quality business
CN1695398A (en) Method and system for a data transmission in a communication system
CN101080032A (en) A high-speed downlink packet access capacity estimation method and device
CN1902975A (en) Hybrid tdm/ofdm/cdm reverse link transmission
CN1809982A (en) Quality determination for a wireless communications link
CN101044773A (en) A method and an apparatus for scheduling transmissions and retransmissions in a cellular communication system based on the load of said system
CN1914838A (en) Transmitting/receiving apparatus and transmitting/receiving method
CN1771752A (en) Base station device and mobile communication system
CN101040559A (en) Packet transmission control device and packet transmission control method
CN1788444A (en) Method and system for a data transmission in a communication system
CN1376000A (en) Method for resending data by using automatic repeated ask through back-ward link
CN1791249A (en) Wireless base station and mobile station
CN1662074A (en) Method and apparatus for scheduling packet
CN1969586A (en) Transfer rate control method, transmission power control method, transmission power ratio control method, mobile communication system, mobile station, and radio base station
CN1736072A (en) Method, station and medium storing a program for a priority based scheduler with variable scheduling periods and variable scheduled periods
CN1853367A (en) Radio communication apparatus and subcarrier assignment method
CN1788507A (en) Radio base station device and mobile communication system
CN101044706A (en) Packet transmission control apparatus and packet transmission control method
CN1619973A (en) Mobile communication terminal and method of controlling transmission power
CN1520643A (en) Optimization of MCS and multicode with TFCI signaling

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Open date: 20071128