Embodiment
Basic thought of the present invention is: in the up link control at the physical layer Base-Band Processing, carry out scheduling of resource, the operation of DPRAM data space and the up channel base band signal process of random access procedure based on hierarchy; Hierarchy comprises: inner all task schedulings of organization and management physical layer and coordinated scheduling layer, carry out the equipment control layer of corresponding task and the Drive Layer of carrying out base band signal process according to the data that the slave unit management level are obtained according to the resource of dispatch layer configuration.
Be described in further detail below in conjunction with the enforcement of accompanying drawing technical scheme.
The present invention is based on the up link controlling schemes of hierarchy, physical layer up link control at bottom, disclosed the up link mode of operation of physical layer, be based on hierarchy, mutual, the collaborative angle solution up link control of each interlayer, can finally finish the processing of up each channel and the carrying and the signal emission of general service data from base band signal process.
A kind of up-link control method based on hierarchy mainly comprises following content:
From the physical layer software angle of TD-SCDMA system, the whole software framework has been introduced the hierarchy design, and being divided into is three layers: dispatch layer, equipment control layer and Drive Layer.Dispatch layer is used for the scheduling and the coordination of inner all processes of organization and management physical layer (being also referred to as task); The equipment control layer is used for finishing corresponding task under the resources supplIes of the time of appointment and dispatch layer configuration, and the carrying data are to Drive Layer; Drive Layer is used to finish specifically independently function realization, that is: the data that carrying comes according to the equipment control layer are carried out the function such as base band signal process.Finish all processes of physical layer (being also referred to as task) under, the coordinated mutual by the three.
Below to each layer, and the module that relates generally to of each layer set forth.
With regard to dispatch layer, for common uplink service, do not comprise that high speed uplink packet inserts (HSUPA) business, the process that dispatch layer relates to comprises at random (RACH) process of access, dedicated channel (DCH) process of transmitting, mainly finish up each process and protocol stack mutual, activate deexcitation, resource calculating, resource bid and to equipment control layer transmission net side parameter.These work are mainly by the module of dispatch layer, top control module-physical layer scheduling top control module (L1S) as dispatch layer is finished, in the L1S module schedules control procedure, can be according to current different physical layer state, for multiple task requests from protocol stack, consider the restriction of public resources such as hardware designs and radio frequency, carry out unified scheduling of resource, the process of potentially conflicting is distributed on the different time quantums carries out, with the purpose that realizes managing conflict.
With regard to the equipment control layer, the process that the equipment control layer is relevant is finished by the module-reception sending module (RTX) of equipment control layer, and here, the RTX module specifically is divided into the RX module that is used to control the TX module of transmission and is used to control reception.The function that the RTX module is mainly finished comprises: hardware devices such as the order of response scheduling layer (channel configuration, channel deletion), dispatching management uplink physical channel processing (TX) equipment, uplink transport channel processing (UTR) equipment, the result that hardware is produced carry out reprocessing.The triggering of control procedure mainly is derived from the interrupt signal that time management unit (TPU) produces, and TPU proposes previous time migration (offset) when transmit events regularly arrives, and by message informing TX equipment, finishes related data by TX equipment and handles.At aspect of performance, TX equipment is smaller for channel configuration, the shared cpu resource of deletion, its place that mainly takies cpu resource is the reprocessing part, main algorithm has transmission block cascade and segmentation algorithm, chnnel coding, radio frames length equalization algorithm, parameters of rate matching computational algorithm etc., can satisfy the physical layer up link sequential and the control requirement of 3GPP agreement defined substantially.
With regard to Drive Layer, the module that Drive Layer is relevant comprises that TX drives and UTR drives, and finishes physical channel processing and transmission channel respectively and handles.The main work of handling comprises: by the scheduling internal event and the condition managing of software realization; The TX/UTR hardware register of being realized by software disposes; By hard-wired CRC coding; By hard-wired chnnel coding; By hard-wired TFCI coding; By interweaving the hard-wired first time, also can be described as 1st and interweave); By hard-wired rate-matched; By hard-wired bit scramble; By interweaving the hard-wired second time, also can be described as 2nd interweave (frame relevant, time slot relevant); Support DTX by the software realization.
In sum, the present invention pays close attention in the TD-SCDMA system, up channel in the physical layer software of UE is handled and link design, according to the physical layer behavioural norm of 3GPP regulation and according to the operational norm of real time operating system (OSEck), the mode that adopts level to divide, divide by different levels, and guarantee different levels and the sequential relationship of module and the logical relation of software and hardware, demonstrated fully the principle of gathering in loose coupling is tight; Introduce resource bid, solve in certain time period the problem of a plurality of interprocedual resource contentions of physical layer; Adopt the DPRAM data space to read and use database table tennis Buffer, guarantee the sequential correctness and the parameter correctness of switching reprovision of data carrying; Base band signal process adopts the algorithm that is different from prior art, and is more superior.The key technology that adopts based on hierarchy has: public resource scheduling and resource bid, DPRAM data space read with database in use, the base band signal process of table tennis BUFFER, with the processing of finally finishing up each channel and the carrying and the emission of general service data.
Below to the present invention's elaboration of giving an example.
Embodiment one: to insert at random is example, sets forth the scheduling of resource of random access procedure in the up channel processing procedure.
The required resource of random access procedure is not fixed, and need calculate according to the configuration parameter of protocol stack, initiates new random access procedure at every turn and all need calculate these resources, and these resources comprise: 1) UP sending time slots; 2) FPACH receiving slot; 3) PRACH sending time slots (or E_RUCCH sending time slots).
For calculating above-mentioned 3 part resources, only need calculate preceding 2 part resources for the uplink synchronous of direct-cut operation initiation and get final product by the random access procedure of protocol stack initiation or the enhancing random access procedure of initiating by HSUPA.
Random access procedure is its Resources allocation by the L1S task, and wherein the reception of UP sending time slots and FPACH receiving slot is by the L1S module schedules, and the transmission of PRACH sending time slots is arranged in the RTX module and realizes because its sequential is nervous.
As shown in Figure 2:
The 0th subframe, protocol stack message (PS message) issues, L1S activates the RACH process, computational resource is also applied for resource, the resource that common random access procedure need be applied for is UP, the FPACH of the 6th~12 subframe, free time (IDLE) resource of PRACH time slot, and enhancement mode inserts the TX resource that also needs additionally to apply for the 6th subframe at random;
The 1st~5 subframe, each subframe L1S is a random access procedure application resource.Up to the 5th subframe application return value is True, and L1S issues the parameter configuration message (comprising the RSCP value) that UP sends to RTX, in the time of the RTX configuration parameter, the UP time slot of next subframe is opened for TX;
The 6th subframe, RTX sends UP, and L1S issues the parameter configuration message that FPACH receives to RTX, in the time of the RTX configuration parameter, sends out message informing to RFC the FPACH time slot of next subframe is opened for RX;
The 7th~10 subframe, RTX monitors corresponding FPACH Burst, and each subframe is sent out message informing to RFC the FPACH time slot of next subframe is opened for RX;
The 10th subframe, RTX successfully receives FPACH Burst, calculates PRACH and sends subframe numbers, and the PRACH sending time slots is changed to TX;
The 12nd subframe, after PRACH (or E-RUCCH) sent and finishes, RTX (HSPA) mechanical floor can be given the RACH process by feedback message, and the RACH process sends this to protocol stack and inserts successful replying at random.
Receiving after the FPACH of UE success is if complete random access procedure also needs to send the PRACH physical channel.As shown in Figure 3, consider a kind of limiting case, that is: when the FPACH receiving slot be TS6, during PRACH TTI=20ms, need be the RF resource of 4 subframes of transmission application of PRACH,, so be divided into following 4 kinds of situations because any subframe of FPACH in WT subframe all might receive:
FPACH receives that in the n subframe transmission subframe of PRACH is: n+2, n+3, n+4, n+5;
FPACH receives that in the n+1 subframe transmission subframe of PRACH is: n+4, n+5, n+6, n+7;
FPACH receives that in the n+2 subframe transmission subframe of PRACH is: n+4, n+5, n+6, n+7;
FPACH receives that in the n+3 subframe transmission subframe of PRACH is: n+6, n+7, n+8, n+9.
So the possible sending time slots of PRACH has accounted for from the n+2 subframe until the n+9 subframe, the PRACH sending time slots of these subframes all must be occupied to get off.In this case, together with the resource of UP and FPACH, whole random access procedure has been applied for the radio frequency resource of 11 subframes altogether.
Because the receiving slot of FPACH is TS6, if RTX equipment successfully receives FPACH in the n subframe, the time point that reports L1S so can be delayed the n+1 subframe, so at this moment, L1S has little time PRACH time slot with the n+2 subframe and is changed to TX and dispatches RTX more simultaneously send PRACH in the n+2 subframe, consider the existence of this worst case, so L1S only is that the radio frequency time slot that possible use is changed to IDLE in application PRACH resource, the radio frequency time slot that will be sent PRACH by RTX mechanical floor oneself is changed to the TX state.
If all successfully do not listen to FPACH Burst in the WT subframe, RTX can report L1S in the result that the n+4 subframe will be failed so, and L1S will send resource at the RPACH that the n+5 subframe discharges thereafter, waits for and initiates random access procedure next time again.
Embodiment two: the operation of setting forth DPRAM data space in the up channel processing procedure.
Exchange is undertaken by DPRAM between physical layer and the protocol stack, for the read operation of having only the general service data, is mainly finished by L1S.Its implementation is: L1S begins to inquire about the data cases (that is: whether having data to read among the inquiry DPRAM) among the DPRAM under the scheduling arrangement of each subframe, if there are data to read, then according to the data cases of inquiring about, with the The data that reads directly the mode of copy be transported among the upstream hardware RAM or adopt the mode that starts DMA, the data that read are transported among the upstream hardware RAM.Whether L1S and TX module adopt the mode of global variable sign FLAG to notify each subframe to have data to be transported to needs in the upstream hardware to send, if there are not data to send, then send by the DTX mode and sends the SB data.Need and whether there be the mark of data to leave in together in the mechanical floor database with the transmission block size parameters such as (TBSize) in the data head in the time of the carrying data, be convenient to the TX inquiry and uses this parameter.Concrete sequential relationship as shown in Figure 4, as seen: 1) under the situation that does not have high speed business HSUPA, protocol stack issues data at the interrupt line (dotted arrow of arrow points top) of preceding 3 subframes on TTI border, L1S can recognize at the interrupt line (solid arrow of arrow points top) of preceding 2 subframes on TTI border upstream data among the DPRAM, the mode that adopts DMA by the L1S decision then or directly copy copies the data among the DPRAM among the RAM of UTR hardware, RTX can determine new data in preceding 1 subframe on TTI border and will send, collocating uplink hardware is done work such as coding, and hardware can come into force on the TTI border and launch; 2) under the situation that high speed business HSUPA is arranged, except occurring above-mentioned 1) situation, also might issue data at preceding 3 frame interrupt lines (dotted arrow of the arrow points top) protocol stack on TTI border, locate to issue the UPA data at this subframe interrupt line (dotted arrow of arrow points below) simultaneously, L1S need move common upstream data among the UTR hardware RAM in the moment point of TS5 so, simultaneously the UPA data being moved to the high speed uplink transmission channel handles among (EUTR) hardware RAM, could upgrade the read data position among the DPRAM then, somewhat bad here is exactly because DMA does not have priority, cause to remove earlier common upstream data and removing the UPA data, but consider that common upstream data amount is little among the UPA, so should influence little; 3) from top 1) and 2) 2 as can be seen, L1S reads general data and has two to the place of UTR hardware from DPRAM: preceding 2 subframes in TTI border; (may there be a risk at the TS5 place of preceding 3 subframes in TTI border, but old data just begin to have encoded at the TS1 of this subframe, hardware can initiatively pour into old data in the internal RAM, so the new general service data of TS5 can not cover the old data of influence, and common upstream data amount seldom when considering UPA, should encode before TS5 and finish, new data is to old data also not influence).
Owing to physical layer receives in the process of transmitting at channel, protocol stack tends to occur the parameter variation and needs physical layer to support operations such as the reprovision of channel, switching, and main channel has DCH, and this moment, physical layer needed the old and new to dispose use simultaneously, promptly will preserve two covers and dispose.This just relates to the use of table tennis BUFFFER in the physical layer equipment layer data storehouse.
L1S is receiving under the newly-built situation of channel, in the corresponding clear position in parameter channel configuration write device layer data storehouse, and writes down current use channel deposit position (that is to say still B cover configuration of A cover configuration).
L1S is under the situation of receiving channel reprovision, switching, in the corresponding clear position in parameter channel configuration write device layer data storehouse, up to this cover current use channel of new record deposit position more during configuration take-effective.
From as can be seen above, the renewal of the parameter configuration of L1S/ mechanical floor database comes into force in real time.L1S will preserve two cover channel configuration pointer and channel and the current use channel of record deposit positions, and notes the renewal (moment point of renewal is in the previous subframe in the TTI border of new argument configuration take-effective) of " writing down current use channel deposit position ".
Embodiment three: the base band signal process of setting forth up channel in the up channel processing procedure.
For up link, the possible value of N_data depends on distributes to the number of physical channels P of sign indicating number branch combination transmission channel (CCTrCH) separately
Max, also depend on their characteristic, as spreading factor, the length of middle pilot tone and transformat combination indication (TFCI), the use of through-put power control (TPC) and multiframe structure.The upper strata can be to independent minimal frequency spreading factor of each physical channel indication, and perhaps, high-rise notice UE can decide in its sole discretion and change up spreading factor.
For in a radio frames or subframe, when TTI=5ms, each transmission channel (TrCHi) in radio frames or the subframe, bit number retransmitted or punching is defined as Δ N
I, jIf Δ N
I, j=0, then the dateout of rate-matched is identical with the input data, the speed matching algorithm at this moment not needing to carry on an agreement.Otherwise, go out rate matching pattern by algorithm computation, need parameter E in this algorithm
Ini, E
Plus, E
MinusAnd X
iWherein, E
Ini, E
Plus, E
MinusCan be referred to as the E parameter.E
IniUse the initial value of variable E for speed matching algorithm; Use the increment of variable E for speed matching algorithm; E
MinusUse the decrement of variable E for speed matching algorithm.
(1), the calculating of Ni: Ni is illustrated in the bit number of the previous radio frames of transmission channel i rate-matched.Fig. 5 is the concrete calculation process of Ni, may further comprise the steps:
Step 101, begin to carry out for circulation: for (i=0; I<MAXIMUM_UL_TRCH; I++).Here, i is a cyclic variable; MAXIMUM_UL_TRCH is maximum uplink transport channel number.
Step 102, judge Trch[i] whether state be activation, if then execution in step 103; Otherwise, execution in step 104.Here, Trch[i] be i transmission channel.
Step 103, calculate Trch[i] the bit number n_bits that comprises the CRC check position.
Here, n_bits=Trch[i] .wTb_size+Trch[i] .wCrc_size;
n_bits=n_bits*(Trch[i].wTb_num);
WTb_size is the transmission block size; WCrc_size is verification and size; WTb_num transmission block number.
Step 104, Trch[i] Ni=0, for circulation of returning step 101 is up to loop ends.
Step 105, type of coding are convolutional encoding.
Step 106, transmission block cascade and segmentation maximum code block length Z=504.
Step 107, obtain the bit number code_block_size that code block is counted n_code_block and each code block.
Step 108, judge whether to be 1/2 convolutional encoding, if then execution in step 110; Otherwise, execution in step 109.
Step 109, chnnel coding n_bits=(code_block_size*3+24) * n_code_block.
Step 110, chnnel coding n_bits=(code_block_size*2+16) * n_code_block.
Step 111, type of coding are the Turbo coding.
Step 112, transmission block cascade and segmentation maximum code block length Z=5114.
Step 113, obtain the bit number code_block_size that code block is counted n_code_block and each code block.
Step 114, chnnel coding n_bits=(code_block_size*3+12) * n_code_block.
Step 115, do not encode.
Step 116, n_code_block=1code_block_size=n_bits.
Step 117, the balanced Ni=n_bits/TTI of radio frames length.
Step 118, obtain Trch[i] the Ni value, for circulation of returning step 101 is up to loop ends.
(2), the calculating of N_data: the data bit that calculates in the CCTrCH frame is counted N_data.Calculate principle following content arranged:
Temp1, temp2 refer to intermediate variable; PL is the punching parameter; RM is the semi-static rate-matched characteristic of transmission channel i.
Two, calculate
If high-rise to independent minimal frequency spreading factor Spmin of each physical channel appointment, the N_data value is chosen from the sequence that following ascending order is arranged:
Change up spreading factor if high-rise notice UE can decide in its sole discretion, then the N_data value is chosen from the sequence that following ascending order is arranged:
Here, U is the data bit variable of each physical channel; First subscript Pmax of U is the physical channel sequence number, and up Pmax is 2 at the most; Second subscript (sPmax) min of U is a spreading factor number.
System of selection:, choose first more than or equal to the value of temp2 value as N_data from the left side of sequence.
Three, according to the content in above-mentioned second step, revise the number of physical channel and the data length of each physical channel, calculate N
Data
Fig. 6 is the concrete calculation process of N_data, may further comprise the steps:
Step 201, initialization.
Step 202, calculating total_RMN=∑ RM[i] * N[i] and RMN[i]=RM[i] * N[i].
Step 203, RMmin=min (RM[i]).
Step 204, the initial N_data of calculating; Calculate temp2=[PL*total_RMN/RMmin earlier].
Step 205, judge whether UE changes radio frequency (SF) voluntarily, if then execution in step 214; Otherwise, execution in step 206.
Step 206, for (t=0; T<wUl_ts_num; T++).Here, wUl_ts_num is the ascending time slot number.
Step 207, for (i=0; I<RU_Max; I++).Here, RU is a code channel; RU_Max is the maximum of code channel.
Step 208, calculate the non-DATA bit ControlBitNum[i of each RU]=(TFCI coded word+TPC_SS bit).
Step 209, press the significant bit that Spmin calculates each RU of radio frames and count RUBitNum, the 5msRACH bit number reduces by half.
Step 210, calculate each RU data bit RUBitNum=RUBitNum-ControlBitNum[i].
Step 211, N_data=N_data+RUBitNum adds up.Here, RUBitNum is the code channel number of bits.
Step 212, judge whether N_data>=temp2, if then execution in step 213; Otherwise, execution in step 206.
Step 213, output N_data.
Step 214, for (t=0; T<wUl_ts_num; T++).
Step 215, for (i=0; I<RU_Max; I++).
Step 216, for (sf=16; Sf>=1; Sf=sf/2).Here, sf is a spreading factor.
Step 217, calculate the non-DATA bit ControlBitNum[i of each RU]=(TFCI coded word+TPC_SS bit).
Step 218, each RU calculate significant bit and count RUBitNum from SF=16, and the 5msRACH bit number reduces by half.
Step 219, SF_Select[i]>>=1; RUBitNum<<=1.
Step 220, calculate each RU data bit RUBitNum=RUBitNum-ControlBitNum[i].
Step 221, N_data+=RUBitNum.
Step 222, judge whether N_data>=temp2 or to the sf of high-rise configuration, if then execution in step 223; Otherwise, execution in step 214.
Step 223, output N_data.
(3), the calculating principle of Delta_N includes following content:
According to actual data b it number N _ data that can send and the RM parameter of each TrCH, give each TrCH the data bit number that pro rata distribution can send, and the bit number Delta_N that is punched or repeat.
The computing formula of concrete pro rate is as follows:
Z
0,j=0;
ΔN
i,j=Z
i,j-Z
i-1,j-N
i,j for?all?i=1...I;
Here, in the above-mentioned formula, N
I, jBe illustrated in the bit number of the previous radio frames of transmission channel i rate-matched;
Δ N
I, jIf, then represent the bit number that each radio frames repeats among the transmission channel i for just; If for negative, then represent the bit number of each radio frames punching among the transmission channel i;
RM
iThe semi-static rate-matched characteristic of expression transmission channel i, this value is set by high-level signaling;
N
Data, jRepresent total number of bits that the CCTrCH channel can be used in the radio frames;
I represents to form a transmission channel number among the CCTrCH;
Z
I, jBe the intermediate variable that is used to calculate;
Fig. 7 is the concrete calculation process of Delta_N, may further comprise the steps:
Step 301, for (i=1; I<TransNum-1; I++).
Step 302, Z[i]=(RMN[i] * N_data)/Total_RMN; Z[0]=Z[1].
Step 303, judge whether for circulation finishes, if then execution in step 304; Otherwise, execution in step 301.
=0, if then execution in step 305; Otherwise, execution in step 307.Here, "!=" represent to be not equal to.
Step 305, calculating Delta_N[i]=Z[i]-Z[i-1]-N[i]; Delta_N[0]=Z[0]-N[0].
Step 306, check the N[i on all channels]+Delta_N[i] whether equal N_data, if then return for circulation; Otherwise, execution in step 311.
Step 307, judge whether the N[i on all transmission channels] add up and be 0; If then execution in step 308; Otherwise, execution in step 310.
Step 308, Delta_N[i]=0.
Step 309, return UTR_IND_NO_DATA_TO_TRANSMIT, expression does not have data to need transmission.
Step 310, return UTR_ERROR_DELTA_N_IMPOSSIBLE, the value of the Delta_N that expression is wrong.
Step 311, return UTR_ERROR_RM_INIT_INCORRECT, expression rate-matched initialization mistake.
(4), Fig. 8 is the selection of speed matching algorithm, concrete selection course may further comprise the steps:
Step 401, judge whether Δ N
I, j=0; If then execution in step 402; Otherwise, execution in step 403.
Step 402, the no speed matching algorithm of employing.
Step 403, judge whether Δ N
I, j>0; If then execution in step 407; Otherwise, execution in step 404.
Step 404, judge whether that type of coding is a Turbo coding, if then execution in step 405; Otherwise, execution in step 406.
Step 405, select Turbo punching algorithm according to parameter number of sub-frames (frame_number) in Fi and the state machine.Here, Fi is the multiple of Transmission Time Interval.
Step 406, employing convolution are deleted the punching algorithm.
Step 407, employing repetition bits algorithm.
Following Fig. 9 and Figure 10 are respectively E CALCULATION OF PARAMETERS flow process under the different coding type, that is: Fig. 9 is for selecting the specific implementation process of the corresponding E calculation of parameter of carrying out of the punching algorithm shown in the step 405; Figure 10 is for selecting the specific implementation process of the corresponding E calculation of parameter of carrying out of the punching algorithm shown in the step 406.
5) as shown in Figure 9, adopt the process of Turbo punching algorithm computation E parameter may further comprise the steps:
Step 501, judge whether Delta_N=0, if then return; Otherwise, execution in step 502.
Step 502, Xi=Ni/3.
Step 503, the 1st check bit, b=2, a=2.
Step 504, BitSubNum=Delta_N>>1." BitSubNum=Delta_N>>1 " expression Delta_N moves to right one.
Step 505, calculating q=Xi/ are (BitSubNum).
Step 506, judge whether q<=2, if then execution in step 507; Otherwise, execution in step 509.
Step 507, for (i=0; I<TTI; I++).
Step 508, S[(3*i+1) %TTI]=i%2.
Step 509, judge whether (q﹠amp; 1)=0, if then execution in step 510; Otherwise, execution in step 517.
Step 510, use toss about in bed to be divided by ask greatest common divisor gcd (q, TTI).
Step 511, qnew=q-gcd/TTI.
Step 512, for (i=0; I<TTI; I++).
Step 513, S[((i*qnew) %TTI+1) %TTI]=(i*qnew)/TTI.
Step 514, obtain the E parameter and be:
Eplus_1=2*Xi;
Eminus_1=2*abs(BitSubNum);
Eini_1=(2*S[P1Fi]*abs(BitSubNum)+Xi)%(2*Xi)。
Step 515, judge whether Eini_1=0, if, execution in step 516; Otherwise, return.
Step 516, Eini_1=2*Xi.
Step 517, qnew=q.
Step 518, the 2nd check bit, b=3, a=1.
Step 519, BitSubNum=(Delta_N+1)>>1.
Step 520, judge whether BitSubNum=0, if then return; Otherwise, execution in step 521.
Step 521, calculating q=Xi/ are (BitSubNum).
Step 522, judge whether q<=2, if then execution in step 523; Otherwise, execution in step 525.
Step 523, for (i=0; I<TTI; I++).
Step 524, S[(3*i+2) %TTI]=i%2.
Step 525, judge whether (q﹠amp; 1)=0, if then execution in step 526; Otherwise, execution in step 533.
Step 526, use toss about in bed to be divided by ask greatest common divisor gcd (q, TTI).
Step 527, qnew=q-gcd/TTI.
Step 528, for (i=0; I<TTI; I++).
Step 529, S[((i*qnew) %TTI+2) %TTI]=(i*qnew)/TTI.
Step 530, obtain the E parameter and be:
Eplus_2=Xi;
Eminus_2=abs(BitSubNum);
Eini_2=(S[P1Fi]*abs(BitSubNum)+Xi)%Xi。
Step 531, judge whether Eini_2=0, if then execution in step 532; Otherwise, return.
Step 532, Eini_2=Xi.
Step 533, qnew=q.
As shown in figure 10, adopt convolution to delete that the process of punching algorithm computation E parameter may further comprise the steps:
Step 601, judge whether Delta_N=0, if, then return, otherwise, execution in step 602.
Step 602, Xi=Ni, a=2, BitSubNum=Delta_N.
Step 603, calculating R=Delta_N mod Ni.
Step 604, judge whether R ≠ 0 and R<=Ni/2, if then execution in step 605; Otherwise, execution in step 606.
Step 605, calculating q=Ni/R.
Step 606, calculating q=Ni/ (R-Ni).
Step 607, judge whether (q﹠amp; 1)=0, if then execution in step 608; Otherwise, execution in step 609.
Step 608, use toss about in bed to be divided by ask greatest common divisor gcd (| q|, TTI).
Step 609, qnew=q.
Step 610, qnew=q+gcd/TTI.
Step 611, for (i=0; I<TTI; I++).
Step 612, S[(|i*qnew|%TTI) %TTI]=| i*qnew|/TTI.
Step 613, obtain the E parameter and be:
Eplus=2*Xi;
Eminus=2*abs(BitSubNum);
Eini=(2*S[P1Fi]*abs(BitSubNum)+1)%(2*Xi)。
A kind of up link control system based on hierarchy, this system comprises: the up link control unit, be used in up link control, carry out scheduling of resource, the operation of DPRAM data space and the up channel base band signal process of random access procedure based on hierarchy at the physical layer Base-Band Processing; Described hierarchy comprises: inner all task schedulings of organization and management physical layer and coordinated scheduling layer, carry out the equipment control layer of corresponding task and the Drive Layer of carrying out base band signal process according to the data that the slave unit management level are obtained according to the resource of dispatch layer configuration.
Here, the up link control unit is further used for carrying out based on described hierarchy under the situation of described random access procedure scheduling of resource, realize resource bid and scheduling by described dispatch layer, initiate new random access procedure at every turn and all need calculate the resource that comprises UP sending time slots, FPACH receiving slot and PRACH sending time slots.
Here, the up link control unit is further used under based on the situation of carrying out the operation of described DPRAM data space based on described hierarchy, after the equipment control layer obtains the resource of described dispatch layer configuration, resource according to the dispatch layer configuration, carry out the operation of DPRAM data space, for the read operation of having only the general service data, under the module controls of dispatch layer, inquire about data cases among the current DPRAM at each subframe scheduling, if there are data to read, then the direct mode of selecting to read according to the data cases that inquires that copies of The data is transported in the upstream hardware random asccess memory, or the mode that the The data of selecting to read starts DMA is transported in the upstream hardware random asccess memory.
Here, the up link control unit is further used for carrying out under the situation of described up channel base band signal process based on described hierarchy, when the data of obtaining according to the slave unit management level are carried out base band signal process, the Ni N_data that obtains exporting by input, the N_data Delta_N that obtains exporting by input, Delta_N by input carries out the rate-matched of selecting, the final E parameter that obtains to be used for the baseband signal emission; Wherein, Ni is the bit number in the previous radio frames of transmission channel i rate-matched; N_data is that a sign indicating number divides the data bit number in combination transmission channel (CCTrCH) frame; Delta_N is the bit number of punching or repetition.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.