CN101123448B - An enhanced allocation method and structure for random access control channel resource - Google Patents
An enhanced allocation method and structure for random access control channel resource Download PDFInfo
- Publication number
- CN101123448B CN101123448B CN2006100892343A CN200610089234A CN101123448B CN 101123448 B CN101123448 B CN 101123448B CN 2006100892343 A CN2006100892343 A CN 2006100892343A CN 200610089234 A CN200610089234 A CN 200610089234A CN 101123448 B CN101123448 B CN 101123448B
- Authority
- CN
- China
- Prior art keywords
- rucch
- fpach
- prach
- message
- rucchi
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000013468 resource allocation Methods 0.000 claims abstract description 17
- 108010003272 Hyaluronate lyase Proteins 0.000 claims description 34
- 230000002708 enhancing effect Effects 0.000 claims description 27
- 230000005540 biological transmission Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000005728 strengthening Methods 0.000 description 4
- 238000012790 confirmation Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 238000011144 upstream manufacturing Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a reinforced random access control channel resource allocation method. Information length of E-RUCCH is adjusted according to the physical resources of the PRACH channel; physical resource sharing relation of E-RUCCH and PRACH and transmitting time of FPACHI are defined according to the information length of E-RUCCH; accordingly, PRACH physical resource is made full use of, and wasting of resources is reduced to some extent. By adopting the invention, E-RUCCH information content can be read out in a short time when the information length of E-RUCCH is smaller than the information length of PRACH by defining the fixed E-RUCCH information length, and the access time lag is reduced by comparing the invention with the prior art. In addition, the invention also provides a reinforced random access control channel device to be more applicable for the reinforced random access course of TD-SCDMA system.
Description
Technical field
The present invention relates to the communications field, relate in particular to a kind of random access control channel resource allocation methods and device of enhancing.
Background technology
High speed uplink packet inserts (HSUPA, High Speed Uplink Packet Access) be the technology of being developed for transmitting high speed upstream data in the 3G (Third Generation) Moblie, can be used to the desired multimedia of international mobile communication standards in 2000 (IMT2000, International Mobile Telecommunications 2000), video flowing and other IP operation that provide complete.
HSUPA is subscriber equipment (UE, User Equipment) sends an enhancement techniques from data to system.Because whether UE can send data control by system, so needing to send one to system before sending data to system, UE inserts request, when system (Node B) when determining that UE can send data, to distribute available physical resource and power for UE, and these control messages are notified to UE, UE begins to send uplink strengthening data after receiving control messages, as shown in Figure 1.
In above-mentioned enhancing access procedure, when UE need be when system sends the HSUPA upstream data, UE need send random access control channel (E-RUCCH, the E-DCH Random accessUplink Control Channel) message that strengthens to system.
Yet, be directly E-RUCCH to be mapped on the Physical Random Access Channel (PRACH, physical random access channel) in existing implementation, E-RUCCH takies the physical resource identical with PRACH.Obviously, prior art does not provide the Resource Allocation Formula that is specifically designed to E-RUCCH in the E-RUCCH access procedure, therefore, and can't the existing physical resource of better utilization.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of random access control channel resource allocation methods of enhancing, can improve resource utilization, reduces access delay.
Another technical problem that the present invention will solve is to provide a kind of random access control channel device of enhancing, to be fit to the enhancing random access procedure of TD-SCDMA system more.
The technical scheme that realizes the object of the invention is as follows:
A kind of random access control channel resource allocation methods of enhancing, wherein:
When the spreading factor of Physical Random Access Channel PRACH equals 16, the message-length L of the random access control channel E-RUCCH of enhancing
IEBe set to 2; When the spreading factor of PRACH less than 16 the time, the message-length L of E-RUCCH then
IEBe set to 1;
When the spreading factor of PRACH equaled 16 or 8, the spreading factor of the E-RUCCH of shared resource was identical with the spreading factor of PRACH with it;
Wherein: described E-RUCCH with the PRACH of code channel corresponding to same physical access channel FPACH; Work as N
RACHiWith N
E-RUCCHiWhen equating:
The transmitting time of the FPACHi corresponding with E-RUCCH satisfies: (SFN mod L
IE)=(n
E-RUCCHiMod L
IE), wherein: L
IEBe the length of E-RUCCH message relevant with FPACHi in the subframe, SFN is system's subframe numbers, n
E-RUCCHiBe the numbering of the E-RUCCH relevant with i FPACH, scope from 0 to N
E-RUCCHi-1, N
E-RUCCHiBe and i the E-RUCCH number that FPACH is relevant, N
RACHiIt is the number of the PRACH relevant with i FPACH.
A kind of random access control channel resource allocation methods of enhancing, wherein:
When the spreading factor of Physical Random Access Channel PRACH equals 16, the message-length L of the random access control channel E-RUCCH of enhancing
IEBe set to 2; When the spreading factor of PRACH less than 16 the time, the message-length L of E-RUCCH then
IEBe set to 1;
When the spreading factor of PRACH equaled 16 or 8, the spreading factor of the E-RUCCH of shared resource was identical with the spreading factor of PRACH with it;
Wherein: the random access control channel E-RUCCH of described enhancing with the Physical Random Access Channel PRACH of code channel corresponding to same physical access channel FPACH; Work as N
E-RUCCHiBe N
RACHiAnd L
IEIn smaller value the time:
The transmitting time of the FPACHi corresponding with E-RUCCH satisfies: (SFN mod L
IE)=n
E-RUCCHi, wherein: L
IEBe the length of E-RUCCH message relevant with FPACHi in the subframe, SFN is system's subframe numbers, n
E-RUCCHiBe the numbering of the E-RUCCH relevant with i FPACH, scope from 0 to N
E-RUCCHi-1.
Preferably, if n
RACHiSmaller or equal to L
IE, n then
E-RUCCHiEqual n
RACHi
Wherein: FPACH is judged in the base station
iCarrying be to insert at random or strengthen when inserting at random, send acknowledge message in the following manner:
When the base station subframe (SFN ' mod L
i)=n
RACHiAfter sending the affirmation message FPACHi that inserts at random, wanting at interval at least, Li-1 subframe transmission strengthens the affirmation message FPACHi that inserts at random;
When the base station subframe (SFN ' mod L
IE)=n
E-RUCCHAfter sending the affirmation message that strengthens access at random, want L at interval at least
IE-1 subframe sends the affirmation message FPACHi that inserts at random.
A kind of random access control channel resource allocation methods of enhancing, wherein:
When the spreading factor of Physical Random Access Channel (PRACH) equals 16, the message-length L of the random access control channel of enhancing (E-RUCCH)
IEBe set to 2; When the spreading factor of PRACH less than 16 the time, the message-length L of E-RUCCH then
IEBe set to 1;
When the spreading factor of PRACH equaled 16 or 8, the spreading factor of the E-RUCCH of shared resource was identical with the spreading factor of PRACH with it;
By the corresponding relation of broadcasting definition FPACH and E-RUCCH, wherein, FPACH takies identical physical resource or takies different physical resources with E-RUCCH, and FPACH
iTransmitting time satisfy:
(SFN’mod?L
i)＝n
RACHi；n
RACHi＝0，...，N
RACHi-1，N
RACHi≤L
i；
(SFN’mod?L
iE)＝n
E-RUCCHi；n
E-RUCCHi＝0，...，N
E-RUCCHi-1，N
E-RUCCHi?≤L
iE；
Wherein, SFN ' is a subframe numbers of confirming arrival, FPACH
iBe that the FPACH channel number is the channel of i, L
IEBe in the subframe with FPACH
iThe length of relevant E-RUCCH message, L
iBe in the subframe with FPACH
iThe length of relevant RACH message, n
E-RUCCHiBe the numbering of the E-RUCCH relevant with i FPACH, scope from 0 to N
E-RUCCHi-1, n
RACHiBe the numbering of the PRACH relevant with i FPACH, scope from 0 to N
RACHi-1, N
E-RUCCHiBe and i the E-RUCCH number that FPACH is relevant, N
RACHiIt is the number of the PRACH relevant with i FPACH.
Wherein: FPACH is judged in the base station
iCarrying be to insert at random or strengthen when inserting at random, send acknowledge message in the following manner:
When the base station subframe (SFN ' mod L
i)=n
RACHiTransmission is carried on FPACH
iThe affirmation message that inserts at random after, wanting at interval at least, Li-1 subframe transmission be carried on FPACH
iThe affirmation message that inserts at random of enhancing;
When the base station subframe (SFN ' mod L
IE)=n
E-RUCCHTransmission is carried on FPACH
iThe affirmation message that inserts at random of enhancing after, want L at interval at least
IE-1 subframe sends and is carried on FPACH
iThe affirmation message that inserts at random.
Compared with prior art, technical scheme provided by the invention has following beneficial effect:
1, reduces the wasting of resources to a certain extent
The message-length of the last carrying of E-RUCCH is fixed, and for the TD-SCDMA system, E-RUCCH message only needs the code channel of a SF=8, the perhaps code channel of two SF=16.The present invention is because according to the message-length definition E-RUCCH of E-RUCCH and physical resource shared relationship and the FPACH of PRACH
iTransmitting time, can utilize the PRACH physical resource fully, reduce the wasting of resources to a certain extent.
2, reduce access delay
The present invention has been because defined fixing E-RUCCH message-length, so during less than the PRACH message-length, can solve the E-RUCCH message content at the E-RUCCH message-length in the short period of time, existing relatively scheme has reduced access delay.
Below in conjunction with the drawings and specific embodiments the present invention is further described.
Description of drawings
Fig. 1 is that existing techniques in realizing strengthens the schematic diagram that inserts at random;
Fig. 2 strengthens the random access procedure schematic diagram in the TD-SCDMA system;
Fig. 3 is an E-RUCCH resource allocation method flow chart of the present invention;
Fig. 4 is the signalling time slot structural representation of E-RUCCH of the present invention.
Embodiment
Be that the present invention is further described for example with the TD-SCDMA system below.
Explanation hereinafter for convenience is defined as follows earlier:
FPACHi:FPACH channel number i;
L
i: the length of the RACH message relevant in the subframe with FPACHi;
L
IE: the length of the E-RUCCH message relevant in the subframe with FPACHi;
N
RACHi: the number of the PRACH relevant with i FPACH;
N
E-RUCCHi: with i the E-RUCCH number that FPACH is relevant;
n
RACHi: the numbering of the PRACH relevant, scope with i FPACH from 0 to N
RACHi-1;
n
E-RUCCHi: the numbering of the E-RUCCH relevant, scope with i FPACH from 0 to N
E-RUCCHi-1;
WT: be used to wait for that network is to a maximum that sends the number of subframes of Signature Confirmation;
SFN ': the subframe numbers of confirming arrival;
SFN: system's subframe numbers.
In the TD-SCDMA system, following a kind of enhancing random access scheme is arranged, as shown in Figure 2:
1, UE sends the SYNC_UL sign indicating number that is used to strengthen access;
2, Node B is collisionless detect the enhancing SYNC_UL sign indicating number that UE sends after, can judge UE is the access at random that strengthens, and sends physical access channel (FPACH, Forward physical access channel) message to this UE;
3, UE sends the data that strengthen and inserts request after receiving FPACH message, and the data of enhancing insert request and are mapped on the PRACH resource;
4, after Node B receives that the data of the enhancing of UE insert request, judge whether to allow this UE to send uplink strengthening data;
If 5 systems allow UE to send uplink strengthening data, send configuration messages such as physical resource, power to UE, UE begins to send uplink strengthening data subsequently.
In said process, the channel that the E-RUCCH access procedure is comprised has:
UpPCH, the SYNC_UL sign indicating number sends on UpPCH, sets up synchronously;
FPACH, the base station is by FPACH channel response UE, and suitable turn-on time and the transmitting power of notice UE;
And PRACH, RACH is mapped to one or more PRACH, can determine the RACH capacity flexibly according to the needs of operator.
Wherein, the transmission of PRACH timing and transmitted power are to be provided with according to the time adjustment amount of FPACH indication and the path loss of expectation received power and measurement.
UE listens to relevant FPACH after sending SYNC_UL, obtains network validation from WT subframe subsequently.UE will read the FPACHi relevant with launching SYNC_UL from the subframe that satisfies following relationship:
(SFN?mod?Li)＝n
RACHi?n
RACHi＝0，...，N
RACHi-1
UE receives after the relevant FPACHi of SYNC_UL, and two subframes of being separated by send E-RUCCH message on relevant PRACH.If Li is greater than 1, and the subframe numbers of confirming is odd number, and UE need wait for a subframe again.
Yet the resource allocation methods of above-mentioned E-RUCCH may the wasting of resources, and promptly the E-RUCCH message-length of going up carrying is fixed, and for the TD-SCDMA system, E-RUCCH message only needs the code channel of a SF=8, the perhaps code channel of two SF=16.When the physical resource of notifications PRACH during, will there be waste greater than the required resource of E-RUCCH.In addition, if Li also can bring certain access delay greater than the TTI length of E-RUCCH.
For this reason, the invention provides the Resource Allocation Formula of three kinds of E-RUCCH, E-RUCCH is not mapped directly to PRACH, but E-RUCCH and PRACH share physical resource, thereby solve the problem of the wasting of resources to a certain extent.
The last loaded information bit number of E-RUCCH is fixed, so the message-length of E-RUCCH is also fixed.In order to improve resource utilization, the message-length of E-RUCCH is done an adjustment according to the physical resource of PRACH channel.In addition, the message-length according to E-RUCCH defines E-RUCCH and the physical resource shared relationship of PRACH and the transmitting time of FPACH.
Below, as shown in Figure 3, the Resource Allocation Formula of R-EUCCH is described respectively.
When the spreading factor (SF, Spread Factor) of PRACH equals at 16 o'clock, the message-length L of E-RUCCH
IEBe 2; When the SF of PRACH less than 16 the time, the message-length L of E-RUCCH
IEBe 1.
When the SF of PRACH equaled 16 or 8, the SF of the E-RUCCH of shared resource was identical with the spreading factor of PRACH with it.
Scheme one:
E-RUCCH and PRACH share physical resource.
When the SF of PRACH equaled 4, the SF of the E-RUCCH of shared resource equaled 8 with it, and each SF equals 4 code channel can split into the code channel that 2 SF equal 8, the code channel that E-RUCCH code selection Taoist monastic name is less.
Each E-RUCCH and a PRACH Channel Sharing physical resource, E-RUCCH with the PRACH of code channel corresponding to same FPACH.
The PRACH number corresponding with FPACH is N
RACHi, the E-RUCCH number corresponding with FPACH is N
E-RUCCHi, and at N
E-RUCCHi=N
RACHiUnder the situation:
Work as FPACH
iSatisfied its launch time when last carrying strengthened the affirmation message that inserts:
(SFN mod L
IE)=(n
E-RUCCHiMod L
IE) (need utilize two idle bits on the FPACHi, send n
E-RUCCHi/ L
IE)
Node B need be FPACH
iCarrying inserts the judgement that still strengthens access confirmation message at random, reaches the collision of avoiding E-RUCCH and PRACH.
Wherein, the transmitting time of FPACH is done special regulation two reasons:
1, avoids the collision of resource;
2, determine FPACH sends acknowledge message at which PRACH.
For example: the length of a RACH message is 10ms, if FPACH can the resource collision will take place in the affirmation message of arbitrary subframe transmission PRACHi channel.FPACH has sent an acknowledge message in subframe 0, and UE can send RACH message on the PRACHi of subframe 3 and 4 channel.And then FPACH has sent an acknowledge message again on subframe 1, and UE will send RACH message on the PRACHi of subframe 4 and 5 channel.The collision of RACH message has just taken place in subframe 4 like this.
UE will be numbered (n after receiving FPACH
E-RUCCHi/ L
IE) * L
IE+ (SFN ' mod L
IE) channel send the E-RUCCH data.
Concrete application by embodiment one explanation scheme one:
Suppose RACH message-length Li=4, E-RUCCH message-length L
IE=2.SYNC-UL (1,2,3,4) is used for inserting at random, and SYNC-UL (5,6,7,8) is used for E-RUCCH and inserts, and is as shown in table 1:
| SFN | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| UE sends on UpPCH | 1 2 | 3 4 | 5 6 | 7 8 | 5 7 | |||||||||
| UE sends affirmation on FPACH | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 5 | 7 |
| UE sends on PRACH 0 (E-RUCCH0) | 4 | 4 | 4 | 4 | 5 | 5 | ||||||||
| UE sends on PRACH 1 (E-RUCCH1) | 1 | 1 | 1 | 1 | 5 | 5 | 7 | 7 | ||||||
| UE sends on PRACH 2 (E-RUCCH2) | 2 | 2 | 2 | 2 | 6 | 6 | ||||||||
| UE sends on PRACH 3 (E-RUCCH3) | 3 | 3 | 3 | 3 | 7 | 7 |
First line identifier is subframe numbers in the table 1, can be understood as the unit of a time.Receive SYNC-UL5 at the 2nd subframe Node B, fed back FPACH message in the 5th subframe, Node B determines to allow UE send E-RUCCH message in the 8th and 9 subframes on E-RUCCH1 in the table.But UE is after receiving FPACH message, only according to the subframe numbers 5 that receives FPACH, because (5mod2)=(1mod2)=(3mod2) (determine) according to the FPACH transmitting time formula of scheme one, both can be at E-RUCCH1, also can be on E-RUCCH3, to send E-RUCCH message, so FPACH also needs to send message (n
E-RUCCHi/ L
IE), again according to (n
E-RUCCHi/ L
IE), UE just can judge and need be numbered (n
E-RUCCHi/ L
IE) * L
IE+ (SFN ' mod L
IE) E-RUCCH go up to send E-RUCCH message.
Scheme two:
E-RUCCH and PRACH share physical resource.
When the SF of PRACH equaled 4, the SF of the E-RUCCH of shared resource equaled 8 with it, and each SF equals 4 code channel can split into the code channel that 2 SF equal 8, the code channel that E-RUCCH code selection Taoist monastic name is less.
Each E-RUCCH and a PRACH Channel Sharing physical resource, E-RUCCH with the PRACH of code channel corresponding to same FPACH.
The PRACH number corresponding with FPACH is N
RACHi, the E-RUCCH number corresponding with FPACH is N
E-RUCCHi, and at N
E-RUCCHi=min{N
RACHi, L
IEUnder the situation:
Work as n
RACHi≤ L
IEThe time, n
E-RUCCHi=n
RACHi
Work as FPACH
iSatisfied its launch time when last carrying strengthened the affirmation message that inserts:
(SFN?mod?L
iE)＝n
E-RUCCHi
Scheme three:
Corresponding relation by broadcasting definition FPACH and E-RUCCH:
Work as FPACH
iSatisfied its launch time when last carrying strengthened the affirmation message that inserts:
(SFN?mod?L
iE)＝n
E-RUCCHi
In scheme three, the message-length of E-RUCCH can not be subjected to the restriction of PRACH physical resource, and selects the length of E-RUCCH message according to actual needs.
For example, the spreading factor of PRACH is 16, and two PRACH channels are arranged, and the shared code channel of these two channels is 0 and 1, and this moment, the message-length of E-RUCCH can select 5ms also can select 10ms.E-RUCCH can share physical resource with PRACH also can take other physical resource.
Node B need be FPACH in method one, two, three
iCarrying inserts the judgement that still strengthens access confirmation message at random, reaches the collision of avoiding E-RUCCH and PRACH:
When Node B subframe (SFN ' mod L
i)=n
RACHiSend one
Affirmation message FPACHi after, can not in Li-1 subframe subsequently, send
(with
There is the physics resource-sharing
) affirmation message FPACHi;
When Node B subframe (SFN ' mod L
IE)=n
E-RUCCHSend one
Affirmation message FPACHi after, can not be at L subsequently
IESend in-1 subframe
(with
There is the physics resource-sharing
) affirmation message FPACHi.
UE receives after the relevant FPACHi of SYNC_UL, and two subframes of being separated by send to strengthen on relevant E-RUCCH and insert request message.If L
IEGreater than 1, and the PRACH of the E-RUCCH place physical channel of confirming numbering n
RACHBe odd number, UE need wait for a subframe again.
For scheme two:
UE receive behind the FPACH will be numbered (SFN ' mod L
IE) channel send the E-RUCCH data.
Scheme two is actual to be that of scheme three realizes special case.Scheme three can be decomposed into following two kinds of situations:
1) corresponding relation of FPACHi and PRACH, and the transmitting time of FPACHi satisfies original rule.
(SFN’mod?Li)＝n
RACHi；
n
RACHi=0 ..., N
RACHi-1, N
RACHi≤ L
i, L
iIt is the PRACH message-length.
2) corresponding relation of FPACHi and E-RUCCH, and the transmitting time of FPACHi also satisfies original rule.
(SFN’mod?L
iE)＝n
E-RUCCHi；
n
E-RUCCHi=0 ..., N
E-RUCCHi-1, N
E-RUCCHi≤ L
IE, L
IEIt is the E-RUCCH message-length.
Determine that the shared physical resource of E-RUCCH has dual mode, the one, by broadcasting direct notice, be scheme three; The 2nd, set up the well-determined relation of E-RUCCH and PRACH, just scheme two.
The E-RUCCH number must satisfy original regular N in scheme two
E-RUCCHi≤ L
IE, and the number of E-RUCCH can not be greater than the number of PRACH, so have: N
E-RUCCHi=min{N
RACHi, L
IE.
When for the PRACH number of same FPACH channel greater than L
IEThe time, in order to guarantee the unique definite relation of E-RUCCH and PRACH, when making the numbering of E-RUCCH and PRACH identical, can share identical physical resource.
Concrete application by embodiment two explanation schemes two and three:
Suppose RACH message-length Li=4, E-RUCCH message-length LiE=2.SYNC-UL (1,2,3,4) is used for inserting at random, and SYNC-UL (5,6,7,8) is used for E-RUCCH and inserts, and is as shown in table 2.Table 2:
| SFN | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| UE sends on UpPCH | 1 2 | 3 4 | 5 6 | 7 8 | 5 7 | |||||||||
| UE sends affirmation on FPACH | 1 | 2 | 3 | 4 | 5 | 6 | 5 | 7 | ||||||
| UE sends on PRACH 0 (E-RUCCH0) | 4 | 4 | 4 | 4 | 5 | 5 | ||||||||
| UE sends on PRACH 1 (E-RUCCH1) | 1 | 1 | 1 | 1 | 5 | 5 | 6 | 6 | 7 | 7 | ||||
| UE sends on PRACH 2 | 2 | 2 | 2 | 2 | ||||||||||
| UE sends on PRACH 3 | 3 | 3 | 3 | 3 |
In the scheme two, E-RUCCH0 can only with the shared physical resource of PRACH0, E-RUCCH1 can only with the shared physical resource of PRACH1; In the scheme three, E-RUCCH0 or E-RUCCH1 can or take separated physical resource with the shared physical resource of any one PRACHx.
In addition, message content and the encoding process process to the E-RUCCH carrying is respectively described below:
1, the signaling content of the E-RUCCH of TD-SCDMA system carrying comprises:
Serving cell and adjacent sub-district path loss information (SNPL, Serving and Neighbour CellPathloss), 5 bits are mapped as a metric;
The relative maximum transmission power that UE can use (UPH, UE Power Headroom), 5 bits;
Highest priority data accounts for the ratio (HLBS, Highest priority Logicalchannel Buffer Status) of total buffer memory, and 4 bits are mapped as different percentage values;
Total E-DCH buffer status (TEBS, Total E-DCH Buffer Status), 5 bits are mapped as different cache size grades;
Highest priority logical channel ID (HLID, Highest priority Logical channel ID), 4 bits, different I D characterizes different priorities;
The HSUPA ID of UE number (H-RNTI, E-DCH Radio Network TemporaryIdentifier), 16 bits.
In addition, the structure of time slot that E-RUCCH adopted has two kinds:
1, time slot format #0 (Time slot format), corresponding E-RUCCH message-length is 10ms;
2, time slot format #10 (Time slot format), corresponding E-RUCCH message-length is 5ms.
Structure of time slot as shown in Figure 4, time slot format #0 is identical with the structure of time slot format #10, difference is both spreading factor differences.It comprises: data symbol (Data symbols) 352 chips, intermediate code (Midamble) 144 chips, data symbol (Data symbols) 352 chips, and protection (GP) 16 chips, 864 chips altogether at interval.
2, encoding process process
CRC check code length is 16; Convolutional encoding; Rate-matched; Bit add around; Intra-frame interleaving; The physical channel mapping.
Above-described embodiment of the present invention does not constitute the qualification to protection range of the present invention.Any any modification of being done within the spirit and principles in the present invention, be equal to and replace and improvement etc., all should be included within the claim protection range of the present invention.
Claims (5)
1. the random access control channel resource allocation methods of an enhancing is characterized in that:
When the spreading factor of Physical Random Access Channel (PRACH) equals 16, the message-length L of the random access control channel of enhancing (E-RUCCH)
IEBe set to 2; When the spreading factor of PRACH less than 16 the time, the message-length L of E-RUCCH then
IEBe set to 1;
When the spreading factor of PRACH equaled 16 or 8, the spreading factor of the E-RUCCH of shared resource was identical with the spreading factor of PRACH with it;
Described E-RUCCH with the PRACH of code channel corresponding to same physical access channel (FPACH); Work as N
RACHiWith N
E-RUCCHiWhen equating:
The FPACH corresponding with E-RUCCH
iTransmitting time satisfy: (SFN mod L
IE)=(n
E-RUCCHiMod L
IE), wherein: FPACH
iBe that the FPACH channel number is the channel of i, L
IEBe in the subframe with FPACH
iThe length of relevant E-RUCCH message, SFN is system's subframe numbers, n
E-RUCCHiBe the numbering of the E-RUCCH relevant with i FPACH, scope from 0 to N
E-RUCCHi-1, N
E-RUCCHiBe and i the E-RUCCH number that FPACH is relevant, N
RACHiIt is the number of the PRACH relevant with i FPACH.
2. the random access control channel resource allocation methods of an enhancing is characterized in that:
When the spreading factor of Physical Random Access Channel (PRACH) equals 16, the message-length L of the random access control channel of enhancing (E-RUCCH)
IEBe set to 2; When the spreading factor of PRACH less than 16 the time, the message-length L of E-RUCCH then
IEBe set to 1;
When the spreading factor of PRACH equaled 16 or 8, the spreading factor of the E-RUCCH of shared resource was identical with the spreading factor of PRACH with it;
Described E-RUCCH with the PRACH of code channel corresponding to same physical access channel (FPACH); Work as N
E-RUCCHiBe N
RACHiAnd L
IEIn smaller value the time:
The FPACH corresponding with E-RUCCH
iTransmitting time satisfy: (SFN mod L
IE)=n
E-RUCCHi, wherein: FPACH
iBe that the FPACH channel number is the channel of i, L
IEBe in the subframe with FPACH
iThe length of relevant E-RUCCH message, SFN is system's subframe numbers, n
E-RUCCHiBe the numbering of the E-RUCCH relevant with i FPACH, scope from 0 to N
E-RUCCHi-1, N
E-RUCCHiBe and i the E-RUCCH number that FPACH is relevant, N
RACHiIt is the number of the PRACH relevant with i FPACH.
3. resource allocation methods as claimed in claim 2 is characterized in that:
If n
RACHiSmaller or equal to L
IE, n then
E-RUCCHiEqual n
RACHi
4. the random access control channel resource allocation methods of an enhancing is characterized in that:
When the spreading factor of Physical Random Access Channel (PRACH) equals 16, the message-length L of the random access control channel of enhancing (E-RUCCH)
IEBe set to 2; When the spreading factor of PRACH less than 16 the time, the message-length L of E-RUCCH then
IEBe set to 1;
When the spreading factor of PRACH equaled 16 or 8, the spreading factor of the E-RUCCH of shared resource was identical with the spreading factor of PRACH with it;
By the corresponding relation of broadcasting definition physical access channel (FPACH) and E-RUCCH, wherein, FPACH takies identical physical resource or takies different physical resources with E-RUCCH, and FPACH
iTransmitting time satisfy:
(SFN’mod?L
i)＝n
RACHi；n
RACHi＝0，...，N
RACHi-1，N
RACHi≤L
i；
(SFN’mod?L
iE)＝n
E-RUCCHi；n
E-RUCCHi＝0，...，N
E-RUCCHi-1，N
E-RUCCHi≤L
iE；
Wherein, SFN ' is a subframe numbers of confirming arrival, FPACH
iBe that the FPACH channel number is the channel of i, L
IEBe in the subframe with FPACH
iThe length of relevant E-RUCCH message, L
iBe in the subframe with FPACH
iThe length of relevant RACH message, n
E-RUCCHiBe the numbering of the E-RUCCH relevant with i FPACH, scope from 0 to N
E-RUCCHi-1, n
RACHiBe the numbering of the PRACH relevant with i FPACH, scope from 0 to NR
ACHi-1, N
E-RUCCHiBe and i the E-RUCCH number that FPACH is relevant, N
RACHiIt is the number of the PRACH relevant with i FPACH.
5. as claim 1 or 3 or 4 described resource allocation methods, it is characterized in that: FPACH is judged in the base station
iCarrying be to insert at random or strengthen when inserting at random, send acknowledge message in the following manner:
When the base station subframe (SFN ' mod L
i)=n
RACHiTransmission is carried on FPACH
iThe affirmation message that inserts at random after, want L at interval at least
i-1 subframe sends and is carried on FPACH
iThe affirmation message that inserts at random of enhancing, L wherein
iBe in the subframe with FPACH
iThe length of relevant RACH message;
When the base station subframe (SFN ' mod L
IE)=n
E-RUCCHTransmission is carried on FPACH
iThe affirmation message that inserts at random of enhancing after, want L at interval at least
IE-1 subframe sends and is carried on FPACH
iThe affirmation message that inserts at random;
Wherein, SFN ' is a subframe numbers of confirming arrival.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100892343A CN101123448B (en) | 2006-08-10 | 2006-08-10 | An enhanced allocation method and structure for random access control channel resource |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100892343A CN101123448B (en) | 2006-08-10 | 2006-08-10 | An enhanced allocation method and structure for random access control channel resource |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101123448A CN101123448A (en) | 2008-02-13 |
| CN101123448B true CN101123448B (en) | 2011-04-20 |
Family
ID=39085644
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006100892343A Active CN101123448B (en) | 2006-08-10 | 2006-08-10 | An enhanced allocation method and structure for random access control channel resource |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101123448B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101547497B (en) * | 2008-03-25 | 2011-04-13 | 大唐移动通信设备有限公司 | Method, system and device for triggering random accessing |
| CN101572944B (en) * | 2008-04-29 | 2013-12-04 | 华为技术有限公司 | Resource selection method in random access and terminal apparatus |
| CN101873699B (en) * | 2009-04-27 | 2013-02-20 | 电信科学技术研究院 | Method, system and device for distributing high-speed shared control channel |
| CN101958855B (en) * | 2009-07-13 | 2012-08-22 | 联芯科技有限公司 | Method, device and system for generating PRACH baseband signal |
| US8434336B2 (en) * | 2009-11-14 | 2013-05-07 | Qualcomm Incorporated | Method and apparatus for managing client initiated transmissions in multiple-user communication schemes |
| CN102348163B (en) * | 2010-08-04 | 2016-06-22 | 电信科学技术研究院 | Multimedia broadcast multi-broadcasting business Single frequency network subframe indicating means, system and equipment |
| CN103220716B (en) * | 2012-01-18 | 2017-10-13 | 中兴通讯股份有限公司 | Up-link wireless public resource method for reconfiguration and device |
| WO2014023012A1 (en) * | 2012-08-10 | 2014-02-13 | 华为技术有限公司 | Method and device for detecting physical random access channel conflict |
| CN103858500B (en) | 2012-09-29 | 2018-02-06 | 华为技术有限公司 | Control information sending method, method of reseptance and equipment |
| CN103634918B (en) * | 2013-12-19 | 2016-09-28 | 武汉邮电科学研究院 | The resource allocation methods of TTI bundling in LTE system |
| CN111666147B (en) * | 2019-03-07 | 2022-06-07 | 上海商汤智能科技有限公司 | Resource scheduling method, equipment, system and central server |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1188584A (en) * | 1995-05-17 | 1998-07-22 | 夸尔柯姆股份有限公司 | Random access communications channel for data services |
| CN1234169A (en) * | 1996-10-18 | 1999-11-03 | 艾利森电话股份有限公司 | Randon access in mobile telecommunications system |
| CN1301436A (en) * | 1998-05-15 | 2001-06-27 | 艾利森电话股份有限公司 | Random access in a mobile telecommunications system |
| CN1383632A (en) * | 2000-06-12 | 2002-12-04 | 三星电子株式会社 | Method of assigning uplink random access channel in CDMA mobile communication system |
| CN1401197A (en) * | 2000-02-24 | 2003-03-05 | 西门子信息通讯网络公司 | Method for optimizing the random access procedures in the cdma cellular networks |
-
2006
- 2006-08-10 CN CN2006100892343A patent/CN101123448B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1188584A (en) * | 1995-05-17 | 1998-07-22 | 夸尔柯姆股份有限公司 | Random access communications channel for data services |
| CN1234169A (en) * | 1996-10-18 | 1999-11-03 | 艾利森电话股份有限公司 | Randon access in mobile telecommunications system |
| CN1301436A (en) * | 1998-05-15 | 2001-06-27 | 艾利森电话股份有限公司 | Random access in a mobile telecommunications system |
| CN1401197A (en) * | 2000-02-24 | 2003-03-05 | 西门子信息通讯网络公司 | Method for optimizing the random access procedures in the cdma cellular networks |
| CN1383632A (en) * | 2000-06-12 | 2002-12-04 | 三星电子株式会社 | Method of assigning uplink random access channel in CDMA mobile communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101123448A (en) | 2008-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101123448B (en) | An enhanced allocation method and structure for random access control channel resource | |
| US8310919B2 (en) | Cellular communication system, network controller and method for obtaining feedback from subscriber communication units | |
| US8228947B2 (en) | Method and apparatus for communicating protocol data unit in a radio access network | |
| WO2017045496A1 (en) | Downlink control method and apparatus | |
| CN108347760B (en) | Power distribution method and device for uplink channel | |
| KR20080111308A (en) | Method for transmitting data of radio bearer having priority in wirelss communication system | |
| EP2745598A1 (en) | Optimized system access procedures | |
| US20090088173A1 (en) | Channel allocation device and channel allocation method | |
| CN101242622A (en) | Uplink resource distributing method, system and user terminal | |
| CN102595633A (en) | Random access method, user equipment and network equipment | |
| US8964616B2 (en) | System and method for scheduling cell broadcast message | |
| KR100913416B1 (en) | Information transmitting method in mobile communication system | |
| CN102711216A (en) | Transmission resource selection method, user equipment, determining method and access network equipment | |
| CN104469747A (en) | Method and terminal for receiving downlink data | |
| CN101188796A (en) | A traffic control method between wireless network controller and base station | |
| WO2008086728A1 (en) | A method, system, base-station for notifying the terminal to process the message and a terminal for processing the message | |
| CN102883278B (en) | A kind of transmission method of cluster multi call business downlink data | |
| CN102215574A (en) | Configuration and application method of semicontinuous scheduling resource | |
| CN105556996A (en) | Mbms group service data transmission method, base station and user equipment | |
| KR20080097920A (en) | Uplink access method for receiving a broadcast and multicast service | |
| CN101212377A (en) | Messaging channel configuration and application method in uplink enhanced system | |
| CN102118853A (en) | Terminal state notification method, terminal state determination method, wireless communication system and network equipment | |
| CN101291334B (en) | Scheduling method for wireless resource of data link layer in WIMAX system | |
| CN101677465B (en) | MAC entity allocation method and device in CCCH signalling transmission | |
| CN101860906B (en) | Method and system for determining data transmission format in state transfer process |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: INST OF TELECOMMUNICATION SCIENCE AND TECHNOLGOY Free format text: FORMER OWNER: DATANG MOBILE COMMUNICATION EQUIPMENT CO., LTD. Effective date: 20110427 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100083 NO. 29, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING TO: 100083 NO. 40, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20110427 Address after: 100083 No. 40, Haidian District, Beijing, Xueyuan Road Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100083 Haidian District, Xueyuan Road, No. 29, Patentee before: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder |
Address after: 100083 No. 40, Haidian District, Beijing, Xueyuan Road Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100083 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| CP01 | Change in the name or title of a patent holder | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210609 Address after: 100085 1st floor, building 1, yard 5, Shangdi East Road, Haidian District, Beijing Patentee after: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. Address before: 100083 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |