CN104823492B - A kind of indicating means and device of Timing Advance TA values - Google Patents
A kind of indicating means and device of Timing Advance TA values Download PDFInfo
- Publication number
- CN104823492B CN104823492B CN201380002724.3A CN201380002724A CN104823492B CN 104823492 B CN104823492 B CN 104823492B CN 201380002724 A CN201380002724 A CN 201380002724A CN 104823492 B CN104823492 B CN 104823492B
- Authority
- CN
- China
- Prior art keywords
- tai
- groups
- message
- terminal
- ptcch
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W56/00—Synchronisation arrangements
- H04W56/0005—Synchronisation arrangements synchronizing of arrival of multiple uplinks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to mobile communication technology fields, disclose a kind of method and device of TA values instruction, and the program is:The first TS, the 2nd TS are distributed respectively with second terminal to distribute the first terminal on same PTCCH;Determine the TA of first terminal and the TA of second terminal;First message is sent on same PTCCH using the first TS, using the 2nd TS, second message is sent on same PTCCH, wherein, first message at least carries the TA that the TA of first terminal, second message at least carry second terminal, in this way, ensure that the TA values corresponding with this terminal that each terminal on PTCCH can be carried from parsing outbound message in the message received, to, it avoids in the prior art when there are when multiple MS, there are problems that MS can not obtain TA values on same PTCCH.
Description
Technical field
The present invention relates to field of communication technology, more particularly to a kind of the indicating means and device of TA values.
Background technology
GSM(Global System for Mobile Communications, global system for mobile communications)By long-term
Development, technical maturity and network coverage ability are all very strong, therefore, field of communication technology become key technology it
One.
In gsm, since the radius of society of GSM can reach 35KM, distance BS(Base Station, base station)Farther out
MS(Mobile Station, mobile station)The signal sent to BS, there are wave transmissions delay, needing could by certain time
The problem of reaching BS, and time delay is long can lead to such a case:The time slot for the signal that the MS that BS is received is sent is sent out with MS
The time slot for the number of delivering letters does not correspond to, for example, BS can just receive the signal that MS is sent on the first slot in the second time slot, MS is caused to send out
The signal sent is asynchronous with the time slot where BS received signals, therefore, postpones in order to compensate for wave transmissions, ensures BS's and MS
Signal synchronizes(That is MS sends signal on the first slot, and BS receives the signal on the first slot), MS is needed to send in advance
Signal, amount in advance is TA(Time Advance, Timing Advance).
In the prior art, MS determines that the method for TA values is as follows:
Step A:MS distributes to the TAI of the MS in BS(Timing Advance Index, Timing Advance index)It is corresponding
PTCCH/U((PTCCH Uplink, packet time lead control channel uplink;PTCCH(Packet Timing
Advance control channel, packet time lead control channel))On, periodically send AB(Access
Burst, access burst pulse);
Wherein, the structure of PTCCH is as shown in Figure 1A.
Step B:BS calculates the TA values of the MS according to the AB received;
Step C:BS carries calculated TA values in TA message(Message)In be sent to MS;
Wherein, TA message is with NB(Normal Burst, Normal bursts)Form is sent, structure such as Figure 1B institutes of NB
Show.
For example, MS sends AB in the position of TAI=0, then MS can most obtain newer TA values, TA in TA message2 soon
The structure of message is as shown in Figure 1 C, and TA message2 are a kind of specific TA message, TA message1, TA
The structure of each TA message of message2, TA message3 etc. is identical, the content of the time and carrying that only send
It is different.
Step D:MS parses the TA values corresponding with the MS carried in TA message received, and according to this
TA values send signal to BS.
In this step, each octet in the octet1-16 of TA message corresponds to a TAI, has also corresponded at this
PTCCH/U corresponding to TAI sends the MS of signal, then the TA values carried in the octet are just the corresponding TA values of the MS.
Currently, in order to improve decoded accuracy, BS can be distributed to MS when channel is established and is used on this channel
Channel estimation, the TS for improving decoded accuracy(Training Sequence, training sequence), TS included in NB structure in,
As shown in Figure 1B.
For hoist capacity, multiple MS are multiplexed on same physical channel, wherein multiple MS correspond to different TS, even if
The corresponding TA values of multiple MS are carried in TA message, but only MS sends TA message institutes in the TS and BS for determining distribution
When the TS of use is identical, the TA values corresponding with the MS carried in TAmessage can be just parsed, other MS cannot then be parsed
The corresponding TA values carried in TA message.
Invention content
The embodiment of the present invention provides a kind of indicating means and device of TA values, to solve in the prior art when same
There are when multiple MS, there are problems that MS can not obtain TA values on PTCCH.
In a first aspect, a kind of base station is provided, including:
Allocation unit, to distribute the first terminal and second on the first grouping Timing Advance control channel PTCCH eventually
The first training sequence TS, the 2nd TS are distributed in end respectively;
Determination unit, for determining the Timing Advance TA of the first terminal, the TA of the second terminal;
Transmission unit, for sending first message on the same PTCCH using the first TS, using described second
TS sends second message on the same PTCCH;
Wherein, the first message at least carries the TA of the first terminal, the second message at least carries described
The TA of two terminals.
With reference to first aspect, in the first possible implementation, the allocation unit is additionally operable to:
First time lead is distributed respectively for the first terminal and the second terminal indexes TAI and the 2nd TAI;
Wherein, the first TAI belongs to the first TAI groups, the 2nd TAI belongs to the 2nd TAI groups, the first TAI groups
, the twoth TAI group corresponding with the first TS and the 2nd TS are corresponding.
The possible realization method of with reference to first aspect the first, in second of possible realization method, the transmission
Unit is specifically used for:
It is corresponding in the included all TAI of next TAI groups of the first TAI groups of the same PTCCH
The first message is sent using the first TS in downlink frame;
It is corresponding in the included all TAI of next TAI groups of the 2nd TAI groups of the same PTCCH
The second message is sent using the 2nd TS in downlink frame.
Second of possible realization method with reference to first aspect, in the third possible realization method, the determination
Unit sends next TAI groups of the first TAI groups of the first message, is the adjacent next of the first TAI groups
A TAI groups;
Wherein, if the maximum value in all TAI in the first TAI groups is less than the TA update cycles of the first terminal
In all TAI in maximum value, then adjacent next TAI groups of the first TAI groups be than in the first TAI groups
The TAI groups belonging to TAI of the maximum value more than 1 in all TAI, and in adjacent next TAI groups of the first TAI groups
All TAI are all higher than the maximum value in all TAI in the first TAI groups;If in all TAI in the first TAI groups
Maximum value be equal to the maximum value in all TAI in the TA update cycles of the first terminal, then the first TAI groups
Adjacent next TAI groups be the first terminal the TA update cycles adjacent next TA update cycles in own
The TAI groups belonging to minimum TAI in TAI;
Next TAI groups that the determination unit sends the 2nd TAI groups of the second message are the 2nd TAI
Adjacent next TAI groups of group;
Wherein, if the maximum value in all TAI in the 2nd TAI groups is less than the TA update cycles of the second terminal
In all TAI in maximum value, then adjacent next TAI groups of the 2nd TAI groups be than in the 2nd TAI groups
The TAI groups belonging to TAI of the maximum value more than 1 in all TAI, and in adjacent next TAI groups of the 2nd TAI groups
All TAI are all higher than the maximum value in all TAI in the 2nd TAI groups;If in all TAI in the 2nd TAI groups
Maximum value be equal to the maximum value in all TAI in the TA update cycles of the second terminal, then the 2nd TAI groups
Adjacent next TAI groups be the second terminal the TA update cycles adjacent next TA update cycles in own
The TAI groups belonging to minimum TAI in TAI.
First with reference to first aspect is to the third possible realization method, in the 4th kind of possible realization method, institute
Allocation unit is stated to be additionally operable to:The 3rd TAI and the 3rd TS is distributed for the third terminal on the same PTCCH;
Wherein, the 3rd TAI and the first TAI belongs to same TAI groups, the 3rd TS and the first TS phases
Together.
First to fourth kind of possible realization method with reference to first aspect, in the 5th kind of possible realization method, institute
State all downlink frames point that the first TAI groups belonging to the first TAI of allocation unit distribution include carrying third message
Not corresponding TAI, wherein the third message is the message of the corresponding downlink frame carryings of the first TAI;
The 2nd TAI groups belonging to the 2nd TAI of the allocation unit distribution include the institute of the 4th message of carrying
There is the corresponding TAI of downlink frame, wherein the 4th message is the message of the corresponding downlink frame carryings of the 2nd TAI.
With reference to first aspect or first to the 5th kind of possible realization method of first aspect, possible at the 6th kind
In realization method, the transmission unit is specifically used for:
The first TS and at least once the 2nd TS at least once are respectively adopted on the same PTCCH, respectively
Send the first message, the second message.
Second aspect provides a kind of Timing Advance TA indicating means, including:
It is distributed respectively with second terminal to distribute the first terminal on the first grouping Timing Advance control channel PTCCH
First training sequence TS, the 2nd TS;
Determine the Timing Advance TA of the first terminal, the TA of the second terminal;
First message is sent on the same PTCCH using the first TS, using the 2nd TS, described same
Second message is sent on PTCCH;
Wherein, the first message at least carries the TA of the first terminal, the second message at least carries described
The TA of two terminals.
In conjunction with second aspect, in the first possible implementation, the TA of the determination first terminal, described
Before the TA of two terminals, the method further includes:
First time lead is distributed respectively for the first terminal and the second terminal indexes TAI and the 2nd TAI;
Wherein, the first TAI belongs to the first TAI groups, the 2nd TAI belongs to the 2nd TAI groups, the first TAI groups
, the twoth TAI group corresponding with the first TS and the 2nd TS are corresponding.
In conjunction with the first possible realization method of second aspect, in second of possible realization method, the use
First TS sends first message on the same PTCCH, using the 2nd TS, is sent on the same PTCCH
Second message specifically includes:
It is corresponding in the included all TAI of next TAI groups of the first TAI groups of the same PTCCH
The first message is sent using the first TS in downlink frame;
It is corresponding in the included all TAI of next TAI groups of the 2nd TAI groups of the same PTCCH
The second message is sent using the 2nd TS in downlink frame.
In conjunction with second of possible realization method of second aspect, in the third possible realization method, described first
Next TAI groups of TAI groups are adjacent next TAI groups of the first TAI groups;
Wherein, if the maximum value in all TAI in the first TAI groups is less than the TA update cycles of the first terminal
In all TAI in maximum value, then adjacent next TAI groups of the first TAI groups be than in the first TAI groups
The TAI groups belonging to TAI of the maximum value more than 1 in all TAI, and in adjacent next TAI groups of the first TAI groups
All TAI are all higher than the maximum value in all TAI in the first TAI groups;If in all TAI in the first TAI groups
Maximum value be equal to the maximum value in all TAI in the TA update cycles of the first terminal, then the first TAI groups
Adjacent next TAI groups be the first terminal the TA update cycles adjacent next TA update cycles in own
The TAI groups belonging to minimum TAI in TAI;
Next TAI groups of the 2nd TAI groups are adjacent next TAI groups of the 2nd TAI groups;
Wherein, if the maximum value in all TAI in the 2nd TAI groups is less than the TA update cycles of the second terminal
In all TAI in maximum value, then adjacent next TAI groups of the 2nd TAI groups be than in the 2nd TAI groups
The TAI groups belonging to TAI of the maximum value more than 1 in all TAI, and in adjacent next TAI groups of the 2nd TAI groups
All TAI are all higher than the maximum value in all TAI in the 2nd TAI groups;If in all TAI in the 2nd TAI groups
Maximum value be equal to the maximum value in all TAI in the TA update cycles of the second terminal, then the 2nd TAI groups
Adjacent next TAI groups be the second terminal the TA update cycles adjacent next TA update cycles in own
The TAI groups belonging to minimum TAI in TAI.
In conjunction with second aspect first to the third possible realization method, in the 4th kind of possible realization method, also
Including:The 3rd TAI and the 3rd TS is distributed for the third terminal on the same PTCCH;
Wherein, the 3rd TAI and the first TAI belongs to same TAI groups, the 3rd TS and the first TS phases
Together.
In conjunction with first to fourth kind of possible realization method of second aspect, in the 5th kind of possible realization method, institute
State the corresponding TAI of all downlink frames that the first TAI groups include carrying third message, wherein the third message is described
The message of the corresponding downlink frame carryings of first TAI;
The 2nd TAI groups include the corresponding TAI of all downlink frames of the 4th message of carrying, wherein the described 4th
Message is the message of the corresponding downlink frame carryings of the 2nd TAI.
It is possible at the 6th kind in conjunction with first to the 5th kind of possible realization method of second aspect or second aspect
It is described that first message is sent on the same PTCCH using the first TS in realization method, using the 2nd TS,
Second message is sent on the same PTCCH, is specifically included:
The first TS and at least once the 2nd TS at least once are respectively adopted on the same PTCCH, respectively
Send the first message, the second message.
The present invention has the beneficial effect that:
In the prior art, when being multiplexed multiple MS on same PTCCH, the corresponding TA of each terminal difference is carried sending
When the TA message of value, although repeatedly to send TA message, due to sending TA message only with a kind of TS, because
This, even if carrying the corresponding TA values of multiple MS in TA message, still, only assigned TS and BS sends TA
When TS used by message is identical, MS can just parse the TA values corresponding with the MS carried in TA message, other quilts
The TS and BS of distribution send the different MS of TS used by TA message, then cannot parse and be carried in TA message
Corresponding TA values, the problem of can not obtaining TA values accordingly, there exist some MS, and in the embodiment of the present invention, carry TA values sending
Message when, the corresponding TS of each MS are respectively adopted and are sent, in this way, ensuring that each end on the PTCCH
End can be from the TA values corresponding with this terminal carried in outbound message be parsed, to avoid existing in the message received
Have in technology when there are when multiple MS, there are problems that MS can not obtain TA values on same PTCCH.
Description of the drawings
Figure 1A is the structural schematic diagram of PTCCH in the prior art;
Figure 1B is the structural schematic diagram of NB in the prior art;
Fig. 1 C are the structural schematic diagram of TA message in the prior art;
Fig. 2 is the illustrative view of functional configuration of base station in the embodiment of the present invention;
Fig. 3 is the detail flowchart that TA values indicate in the embodiment of the present invention;
Fig. 4 A are the first way that TA message is sent in the embodiment of the present invention;
Fig. 4 B are the second way that TA message is sent in the embodiment of the present invention;
Fig. 4 C are the third mode that TA message is sent in the embodiment of the present invention;
Fig. 4 D are the 4th kind of mode that TA message is sent in the embodiment of the present invention;
Fig. 4 E are the fifth procedure that TA message is sent in the embodiment of the present invention;
Fig. 5 A are the embodiment one of the instruction process of TA values in the embodiment of the present invention;
Fig. 5 B are the first schematic diagram of embodiment one in the embodiment of the present invention;
Fig. 5 C are the second schematic diagram of embodiment one in the embodiment of the present invention;
Fig. 5 D are the embodiment two of the instruction process of TA values in the embodiment of the present invention;
Fig. 5 E are the schematic diagram of embodiment two in the embodiment of the present invention.
Specific implementation mode
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
The every other embodiment obtained without creative efforts, shall fall within the protection scope of the present invention.
In addition, the terms " system " and " network " are often used interchangeably herein.The terms " and/
Or ", only a kind of incidence relation of description affiliated partner, indicates may exist three kinds of relationships, for example, A and/or B, it can be with table
Show:Individualism A exists simultaneously A and B, these three situations of individualism B.In addition, character "/" herein, typicallys represent front and back
Affiliated partner is a kind of relationship of "or".
In the embodiment of the present invention, be first terminal of the distribution on same PTCCH with second terminal distribute respectively the first TS,
2nd TS;Determine the TA of first terminal and the TA of second terminal;First message is sent on same PTCCH using the first TS, is adopted
With the 2nd TS, second message is sent on same PTCCH, wherein first message at least carries TA, the second message of first terminal
The TA at least carrying second terminal, in this way, ensuring that each terminal on the PTCCH can be from the message received
The TA values corresponding with this terminal carried in parsing outbound message, exist when on same PTCCH in the prior art to solve
When multiple MS, there are problems that MS can not obtain TA values.
The preferred embodiment of the present invention is described in detail below in conjunction with the accompanying drawings.
As shown in fig.2, in the embodiment of the present invention, a kind of base station is provided, base station includes allocation unit 20, determination unit 21
With transmission unit 22, wherein
Allocation unit 20, for distributing the first TS, second respectively with second terminal for the first terminal on same PTCCH
TS;
Determination unit 21, for determining the TA of first terminal, the TA of second terminal;
Transmission unit 22, for using the first TS to send first message on same PTCCH, using the 2nd TS, same
Second message is sent on PTCCH;
Wherein, first message at least carries the TA that the TA of first terminal, second message at least carry second terminal.
Further, in the embodiment of the present invention, allocation unit 20 is additionally operable to:
The first TAI and the 2nd TAI are distributed respectively for first terminal and second terminal;
Wherein, the first TAI belongs to the first TAI groups, the 2nd TAI belongs to the 2nd TAI groups, the first TAI groups are corresponding with the first TS,
2nd TAI groups are corresponding with the 2nd TS.
In the embodiment of the present invention, optionally, transmission unit 22 is specifically used for:
The included corresponding downlinks of all TAI of next TAI groups of the first TAI groups on the same PTCCH
First message is sent using the first TS on frame;
The included corresponding downlinks of all TAI of next TAI groups of the 2nd TAI groups on the same PTCCH
Second message is sent using the 2nd TS on frame.
In the embodiment of the present invention, optionally, transmission unit 22 sends next TAI groups of the first TAI groups of first message,
For adjacent next TAI groups of the first TAI groups;
Wherein, if the maximum value in all TAI in the first TAI groups be less than it is all in the TA update cycles of first terminal
Maximum value in TAI, then adjacent next TAI groups of the first TAI groups are than the maximum in all TAI in the first TAI groups
TAI groups belonging to TAI of the value more than 1, and all TAI in adjacent next TAI groups of the first TAI groups are all higher than first
The maximum value in all TAI in TAI groups;If the maximum value in all TAI in the first TAI groups is equal to the TA of first terminal more
The maximum value in all TAI in the new period, then adjacent next TAI groups of the first TAI groups are that the TA of first terminal updates
The TAI groups belonging to minimum TAI in adjacent next TA update cycles in period in all TAI;
Transmission unit 22 send second message the 2nd TAI groups next TAI groups, for the 2nd TAI groups it is adjacent under
One TAI group;
Wherein, if the maximum value in all TAI in the 2nd TAI groups be less than it is all in the TA update cycles of second terminal
Maximum value in TAI, then adjacent next TAI groups of the 2nd TAI groups are than the maximum in all TAI in the 2nd TAI groups
TAI groups belonging to TAI of the value more than 1, and all TAI in adjacent next TAI groups of the 2nd TAI groups are all higher than second
The maximum value in all TAI in TAI groups;If the maximum value in all TAI in the 2nd TAI groups is equal to the TA of second terminal more
The maximum value in all TAI in the new period, then adjacent next TAI groups of the 2nd TAI groups are that the TA of second terminal updates
The TAI groups belonging to minimum TAI in adjacent next TA update cycles in period in all TAI.
Further, in the embodiment of the present invention, determination unit 21 is additionally operable to:For the third terminal on same PTCCH point
With the 3rd TAI and the 3rd TS;
Wherein, the 3rd TAI and the first TAI belongs to same TAI groups, and the 3rd TS is identical as the first TS.
In the embodiment of the present invention, optionally, the first TAI groups belonging to the first TAI that allocation unit 20 is distributed include carrying
The corresponding TAI of all downlink frames of third message, wherein third message is disappearing for the corresponding downlink frame carryings of the first TAI
Breath;The 2nd TAI groups belonging to the 2nd TAI that allocation unit 20 is distributed include that all downlink frames of the 4th message of carrying correspond to respectively
TAI, wherein the 4th message is the message of the 2nd TAI corresponding downlink frame carryings.
In the embodiment of the present invention, optionally, determination unit 21 is specifically used for:
TAI is distributed respectively for first terminal and second terminal;
Receive the AB that first terminal, second terminal are sent on the assigned corresponding physical channels of TAI respectively;
According to the AB that the first terminal that receives is sent respectively with second terminal, calculate separately first terminal TA, second
The TA of terminal.
In the embodiment of the present invention, optionally, transmission unit 22 is specifically used for:
The first TS and at least once the 2nd TS at least once are respectively adopted on same PTCCH, respectively send first message,
Second message.
As shown in fig.3, in the embodiment of the present invention, the detailed process of TA values instruction is as follows:
Step 300:The first TS, the 2nd TS are distributed respectively with second terminal for the first terminal on same PTCCH.
Step 310:Determine the TA of first terminal, the TA of second terminal.
Step 320:First message is sent on the same PTCCH using the first TS, using the 2nd TS in the same PTCCH
Upper transmission second message.
Wherein, first message at least carries the TA that the TA of first terminal, second message at least carry second terminal.This first
The content that message carries can there are many, for example, the TA of first terminal can be carried only, it is same at this that distribution can also be carried
The TA of all terminals on PTCCH can also carry distribution on the same PTCCH while carrying the TA of first terminal
Part terminal TA;Similarly, the content that second message carries can there are many, for example, the TA of second terminal can be carried only,
The TA of all terminals of the distribution on the same PTCCH can also be carried, can also be taken while carrying the TA of second terminal
The TA of part terminal with distribution on the same PTCCH.
Optionally, above-mentioned steps 310 can specifically include:
The first upstream message that first terminal is sent is received, and determines the TA of first terminal according to first upstream message;
The second upstream message that second terminal is sent is received, and determines the TA of second terminal according to second upstream message.
Wherein, the first upstream message and the second upstream message can be sent on the same PTCCH, can also be in other letters
It sends on road, is not limited herein, in addition, first upstream message and the second upstream message can be signalings, can also be number
According to block.
Optionally, the above method further includes distributing the first TAI for first terminal, and the 2nd TAI is distributed for second terminal, above-mentioned
Step 310 can specifically include:
The AB that first terminal is sent according to the first TAI on the same PTCCH is received, and is calculated according to the AB of first terminal
The TA of first terminal;
The AB that is sent on the same PTCCH according to the 2nd TAI of second terminal is received, the is calculated according to the AB of second terminal
The TA of two terminals.
Specifically, in step 320, first message is sent on the same PTCCH using the first TS, using the 2nd TS at this
On same PTCCH send second message mode can there are many, may refer to Fig. 4 A and Fig. 4 B.
For example, two terminals of the distribution on same PTCCH:First terminal A and second terminal B gives first terminal A distribution
The first TS be TS1, be TS2 to the 2nd TS of second terminal B distribution, then may be used in the message 2 in sending such as Figure 1A
TS1 at least carries the TA of first terminal A in message 2, at this point, message 2 is first message;TS2 may be used when sending message 3,
The TA of second terminal B is at least carried in message 3, at this point, message 3 is second message;TS1, message may be used when sending message 4
The TA of first terminal A is at least carried in 4, at this point, message 4 is first message;It is sent out in the TA update cycles of next first terminal A
TS2 may be used when sending message 1, the TA of second terminal B is at least carried in message 1, at this point, message 1 is second message;Class successively
It pushes away, it is specific as shown in Figure 4 A, wherein the MS in Fig. 4 A can be any one in first terminal A, second terminal B;
Alternatively, can also be, TS1 may be used when sending message 2 by BS, at least carry first terminal A's in message 2
TA, at this point, message 2 is first message;TS1 may be used when sending message 3, the TA of first terminal A is at least carried in message 3,
At this point, message 3 is first message;TS2 may be used when sending message 4, the TA of second terminal B is at least carried in message 4, this
When, message 4 is second message;TS2, message 1 may be used when the TA update cycles of next first terminal A sending message 1
In at least carry the TA of second terminal B, at this point, message 1 is second message;And so on, it is specific as shown in Figure 4 B, wherein figure
MS in 4B can be any one in first terminal A, second terminal B.
Optionally, when the terminal when distribution on same PTCCH is more than two, method shown in Fig. 4 C can be used,
It is described in detail below:
Distribution on same PTCCH there are three terminal:First terminal A, second terminal B and third terminal C, eventually to first
First TS of end A distribution is TS1, is TS2 to second terminal B the 2nd TS distributed, is to third terminal C the 3rd TS distributed
TS3 when then sending message, may be used TS1 in the message 2 in sending such as Figure 1A, first terminal A at least carried in message 2
TA, at this point, message 2 be first message;TS2 may be used when sending message 3, at least carry second terminal B's in message 3
TA, at this point, message 3 is second message;TS3 may be used when sending message 4, the TA of third terminal C is at least carried in message 4,
At this point, message 4 is third message;TS1, message may be used when the TA update cycles of next first terminal A sending message 1
The TA of first terminal A is at least carried in 1, at this point, message 1 is first message;TS2 is may be used when sending message 2, in message 2
The TA of second terminal B is at least carried, at this point, message 2 is second message;TS3 is may be used when sending message 3, in message 3 at least
The TA of third terminal C is carried, at this point, message 3 is third message;And so on, it is specific as shown in Figure 4 C, wherein in Fig. 4 C
MS can be any one in first terminal A, second terminal B, third terminal C.
Alternatively, can also be that TS1 may be used in the message 2 in sending such as Figure 1A, first is at least carried in message 2
The TA of terminal A, at this point, message 2 is first message;TS2 may be used when sending TA message 3, second is at least carried in message 3 eventually
The TA of B is held, at this point, message 3 is second message;TS3 may be used when sending message 4, third terminal C is at least carried in message 4
TA, at this point, message 4 be third message;It may be used when the TA update cycles of next first terminal A sending message 1
TS1 at least carries the TA of first terminal A in message 1, at this point, message 1 is first message;TS1 may be used when sending message 2,
The TA of first terminal A is at least carried in message 2, at this point, message 2 is also first message;TS2 may be used when sending message 3, disappear
The TA of second terminal B is at least carried in breath 3, at this point, message 3 is second message;TS3, message 4 may be used when sending message 4
In at least carry the TA of third terminal C, at this point, message 4 is third message;And so on, it is specific as shown in Figure 4 D, wherein figure
MS in 4D can be any one in first terminal A, second terminal B, third terminal C.
Optionally, same at this using the first TS when first message is identical as second message in above-mentioned steps 320
First message is sent on PTCCH, and second message is sent on the same PTCCH using the 2nd TS, may include:
N times first message is sent on the same PTCCH using the first TS;
N times second message is sent on the same PTCCH using the 2nd TS;
Wherein, N is positive integer.
For example, first terminal corresponds to the first TS, second terminal corresponds to the 2nd TS, if at the appointed time being had sent altogether in section
10 message will at least use first TS during sending message at this 10 times, also at least use one time second
TS。
It should be noted that above-mentioned first message, second message can be TA message, do not limit herein.
In the embodiment of the present invention, the first TS, second are distributed respectively with second terminal for the first terminal on same PTCCH
TS;Determine the TA of first terminal and the TA of second terminal;First message is sent on the same PTCCH using the first TS, is used
2nd TS sends second message on the same PTCCH so that each terminal on the PTCCH can disappear from what is received
The TA values with this terminal carried in outbound message are parsed in breath, are solved in the prior art when there are multiple MS on same PTCCH
When, there are problems that MS can not obtain TA values.
Optionally, under a kind of implement scene of the embodiment of the present invention, the determination first terminal of step 310 TA, second
Before the TA of terminal, further include:
The first TAI and the 2nd TAI are distributed respectively for first terminal and second terminal
Wherein, the first TAI belongs to the first TAI groups, the 2nd TAI belongs to the 2nd TAI groups, the first TAI groups are corresponding with the first TS,
2nd TAI groups are corresponding with the 2nd TS.
Wherein, there are many dividing modes of TAI groups, optionally, the first TAI groups include all downlinks of carrying third message
The corresponding TAI of frame, wherein third message is the message of the corresponding downlink frame carryings of the first TAI;
2nd TAI groups include the corresponding TAI of all downlink frames of the 4th message of carrying, wherein the 4th message is the
The message of the corresponding downlink frame carryings of two TAI.
For example, as shown in Figure 1A, the corresponding PTCCH/D of the corresponding PTCCH/U in TAI=0/1/2/3 are carried jointly
TA message1, then TAI=0/1/2/3 belong to same TAI groups;The corresponding PTCCH/U in TAI=4/5/6/7 is corresponding
PTCCH/D carries TA message2 jointly, then TAI=4/5/6/7 belongs to same TAI groups;TAI=8/9/10/11 is corresponding
The corresponding PTCCH/D of PTCCH/U carry TA message3 jointly, then TAI=8/9/10/11 belongs to same TAI groups;TAI=
The corresponding PTCCH/D of 12/13/14/15 corresponding PTCCH/U carry TA message4 jointly, then TAI=12/13/
14/15 belongs to same TAI groups.
Specifically, it is PTCCH/U that TAI is corresponding, and TA message is by PTCCH/D(PTCCH Downlink, packet time carry
Preceding amount control channel downlink)Carrying, specially:4 downlink TDMA(Time Division Multiple Access, time-division
Multiplexing access)Frame constitutes a PTCCH/D, carries a TA message, that is to say, that the corresponding PTCCH/U of 4 TAI values is corresponded to
PTCCH/D jointly carrying one TA message, wherein this 4 TAI values belong to same TAI groups.It should be pointed out that in this hair
In bright embodiment, TAI is corresponding with uplink frame, and uplink frame is corresponding with downlink frame again, that is to say, that by uplink frame, TAI indirectly with
Downlink frame is mapped, the corresponding TAI of the above-mentioned downlink frame referred to, actually, the corresponding uplink frame of downlink frame
Corresponding TAI.
Further, first message is sent on the same PTCCH using the first TS in step 320, is existed using the 2nd TS
Second message is sent on the same PTCCH, it can also be in the following way:
The included corresponding downlinks of all TAI of next TAI groups of the first TAI groups on the same PTCCH
First message is sent using the first TS on frame;
The included corresponding downlinks of all TAI of next TAI groups of the 2nd TAI groups on the same PTCCH
Second message is sent using the 2nd TS on frame.
Further, in order to improve the efficiency that terminal updates TA, next TAI groups of the first TAI groups can be the first TAI
Adjacent next TAI groups of group;Next TAI groups of 2nd TAI groups can be adjacent next TAI of the second TAI groups
Group.
Wherein, if the maximum value in all TAI in the first TAI groups be less than it is all in the TA update cycles of first terminal
Maximum value in TAI, then adjacent next TAI groups of the first TAI groups are than the maximum in all TAI in the first TAI groups
TAI groups belonging to TAI of the value more than 1, and all TAI in adjacent next TAI groups of the first TAI groups are all higher than first
The maximum value in all TAI in TAI groups;If the maximum value in all TAI in the first TAI groups is equal to the TA of first terminal more
The maximum value in all TAI in the new period, then adjacent next TAI groups of the first TAI groups are that the TA of first terminal updates
The TAI groups belonging to minimum TAI in adjacent next TA update cycles in period in all TAI;
Wherein, if the maximum value in all TAI in the 2nd TAI groups be less than it is all in the TA update cycles of second terminal
Maximum value in TAI, then adjacent next TAI groups of the 2nd TAI groups are than the maximum in all TAI in the 2nd TAI groups
TAI groups belonging to TAI of the value more than 1, and all TAI in adjacent next TAI groups of the 2nd TAI groups are all higher than second
The maximum value in all TAI in TAI groups;If the maximum value in all TAI in the 2nd TAI groups is equal to the TA of second terminal more
The maximum value in all TAI in the new period, then adjacent next TAI groups of the 2nd TAI groups are that the TA of second terminal updates
The TAI groups belonging to minimum TAI in adjacent next TA update cycles in period in all TAI.
Specifically, the TA update cycles of first terminal can be the interval between the updates of TA twice of first terminal, for example,
As shown in Figure 4 E, due to 4 TA can simultaneously be included in a piece of news in be sent to terminal, if then the TAI of first terminal be 0 to
In 3 when any value, TA update cycles of first terminal include 52 multi-frames where TAI=0 to 52 multi-frames where TAI=15;If
During the TAI of second terminal is 4 to 7 when any value, then the TA update cycles of second terminal include 52 multi-frames where TAI=4 extremely
52 multi-frames where TAI=15 further include being answered with where 52 multi-frames adjacent TAI=0 place multi-frames where the TAI=15 to TAI=3 52
Frame.Terminal will send an AB, and then each TA update cycle of BS in each of itself corresponding TA update cycles
The AB that terminal corresponding with the period is sent can be received only to receive the TA update cycles of each terminal
The corresponding TA of AB may be differed, and similarly, for the TA update cycles of each terminal, BS can be sent in corresponding subframe
Primary corresponding message, the content that only message carries may be different(I.e. TA values may be different).
For example, as shown in Figure 4 E, it is assumed that TAI=0,1,2 ..., 15, totally 15 TAI, base station all TAI be divided into four groups,
Wherein, TAI=0, TAI=1, TAI=2, TAI=3 belong to the first TAI groups, the corresponding downlink frame of each TAI in the first TAI groups
The message of carrying is TA message1;TAI=4, TAI=5, TAI=6, TAI=7 belong to the 2nd TAI groups, each in the 2nd TAI groups
The message of the corresponding downlink frame carryings of TAI is TA message2;TAI=8, TAI=9, TAI=10, TAI=11 belong to the 3rd TAI
Group, the message of the corresponding downlink frame carrying of each TAI is TA message3 in the 3rd TAI groups;TAI=12、TAI=13、TAI=
14, TAI=15 belong to the 4th TAI groups, and the message of the corresponding downlink frame carrying of each TAI is TA message4 in the 4th TAI groups;
If being assigned with four terminals simultaneously on same PTCCH:First terminal, second terminal, third terminal and the 4th terminal, base station point
The TAI of dispensing four terminals is respectively TAI=0, TAI=4, TAI=8, TAI=12, and for four terminals distribute respectively TS1,
TS2、TS3、TS4。
Further, since maximum of T AImax1=3 in all TAI in the first TAI groups are less than the TA of first terminal
Maximum of T AImax1 '=15 in all TAI in update cycle, and meet than in all TAI in the first TAI groups most
TAI groups belonging to big TAI of value TAImax1=3 more than 1, i.e. TAI groups belonging to TAI=4 are the 2nd TAI groups, the 2nd TAI groups
In all TAI be all higher than maximum of T AImax1=3 in all TAI in the first TAI groups, then it is corresponding in the 2nd TAI groups
TA message2 are sent using TS1 in downlink frame, which carries the TA information of first terminal.
Further, since maximum of T AImax4=15 in all TAI in the 4th TAI groups are equal to the TA of the 4th terminal
Maximum of T AImax4 '=15 in all TAI in update cycle, and the TA update cycles of the 4th terminal of satisfaction is adjacent next
The TAI groups belonging to minimum TAI in a TA update cycles in all TAI are the adjacent next of the TA update cycles of the 4th terminal
The first TAI groups in a TA update cycles, then the 4th terminal is on TAI=15 of the TA update cycles of the 4th terminal are corresponding
On row frame send AB after, base station using TS4 the TA update cycles of the 4th terminal adjacent next TA update cycles first
The message of the TA values comprising the 4th terminal is sent in the corresponding downlink frame of TAI groups, therefore the 4th terminal can be from the 4th
Corresponding TA values are parsed in the TAmessage1 of adjacent next TA update cycles of the TA update cycles of terminal.Class successively
It pushes away, sends the TA message2 for carrying second terminal TA information in the corresponding downlink frame of the 3rd TAI groups using TS2, herein not
It repeats again.
Further, in a kind of above-mentioned implement scene, further include:Third is distributed for the third terminal on the same PTCCH
TAI and the 3rd TS.Wherein, the 3rd TAI and the first TAI belongs to same TAI groups, and the 3rd TS is identical as the first TS.
Specifically, the 3rd TAI groups corresponding with first terminal first belonging to the 3rd TAI if third terminal distribution
As soon as the TAI groups belonging to TAI are identical, then the 3rd TS for third terminal distribution is the first TS;Alternatively, if third terminal
3rd TS of distribution is the first TS, then the 3rd TAI groups belonging to the 3rd TAI for third terminal distribution are that first terminal is corresponding
The first TAI groups belonging to first TAI.
For example, if the 3rd TS distributed to third terminal is identical as the first TS, i.e., terminal is increased in same PTCCH, but
TS does not increase, then when sending the TA information of third terminal, the TA information of the third terminal is carried and is sent out in first message
It send.
Further, if the TS to the 4th terminal distribution on the same PTCCH is in addition to the first TS and the 2nd TS
When other TS, when such as four TS, and the 4th TS and the first TS and the 2nd TS any one when being all different, then sending for the 4th end
When the TA information at end, the 4th TS to be used to send the message for the TA information for carrying the 4th terminal.
In a kind of above-mentioned implement scene, by being grouped to TAI, and the corresponding TS of each TAI is identical in same TAI groups, i.e.,
Distribution is identical in the TS of the terminal distribution of same TAI groups, so that the TA information in the terminal of the same TAI groups can carry
In same TA message, the TA updates promptness for being sent to each terminal and each terminal together is improved, while being saved and being eated dishes without rice or wine
Information flow-rate.
Concrete application scene is given below in embodiment for a better understanding of the present invention, for the process of TA values instruction, makees
Go out to be described in further detail(It is TA message to carry each terminal to distinguish the current message to be sent of corresponding TA values):
Embodiment one:As shown in Figure 5A:
Step 500:TAI1, TAI2 are distributed respectively for two terminals A, B on same PTCCH;
For example, TAI=0,1,2 ..., 15, totally 16 TAI, are that terminal A distributes TAI1=1, are that terminal B distributes TAI2=8.
Step 510:The TS distributed respectively for two terminals A, B on the same PTCCH is:TS1、TS2;
Step 520:The AB that terminal A, B is sent on the same PTCCH respectively is received, and calculates separately out terminal A, B pair
The TA values answered:TA1、TA2;
Specifically, terminal A, B respectively on the same PTCCH TAI1=1, send respectively in the corresponding uplink frame in TAI2=8
AB。
Step 530:The TA message1 for carrying TA1 are sent using TS1, and the TA for carrying TA2 is sent using TS2
message2。
In this step, TA1, TA2 can also be carried in TA message1, TA message2.
In this step, TS1 can be used and send TA message1, then TS2 is used to send TA message2, subsequently
TA message1 are sent using TS1, it can also be to use as shown in Figure 5 B subsequently to use TS2 to send TA message2
TS1 sends TA message1, then sends TA message1 using TS1, then, sends TA message2 using TS2, then so
TS2 is used to send TA message2 afterwards, in short, being exactly that TS1 at least once is respectively adopted to send the TA message1 for carrying TA1
TS2 sends the TA message2 for carrying TA2 at least once, as shown in Figure 5 C.
Embodiment two:As shown in Figure 5 D:
Step 5000:It is grouped for all TAI included on same PTCCH;
For example, all TAI included on the same PTCCH are TAI=0, and 1,2 ..., 15, totally 16 TAI, are grouped situation
It is as follows:TAI=0, TAI=1, TAI=2, TAI=3 are the first TAI groups;TAI=4, TAI=5, TAI=6, TAI=7 are the 2nd TAI groups;
TAI=8, TAI=9, TAI=10, TAI=11 are the 3rd TAI groups;TAI=12, TAI=13, TAI=14, TAI=15 are the 4th TAI groups.
Step 5100:Distribute TAI1 in the first TAI groups, second respectively for two terminals A, B on the same PTCCH
TAI2 in TAI groups;
For example, it can be that 5, TAI=1, TAI=5 are belonging respectively to the first TAI groups and the 2nd TAI groups that TAI1, which can be 1, TAI2,.
Step 5200:The TS distributed respectively for two terminals A, B on the same PTCCH is:TS1、TS2;
Step 5300:The AB that terminal A, B is sent respectively is received, and calculates separately out the corresponding TA values of terminal A, B:TA1、
TA2;
Step 5400:It is sent and is carried in the corresponding downlink frame of adjacent next TAI groups of the first TAI groups using TS1
The first message of TA1 is sent in the corresponding downlink frame of adjacent next TAI groups of the 2nd TAI groups using TS2 and carries TA2
Second message, as shown in fig. 5e.
For example, according to the grouping in step 5000, first is sent on TAI=4,5,6,7 corresponding downlink frames using TS1
Message sends second message using TS2 on TAI=8,9,10,11 corresponding downlink frames.
In embodiments of the present invention, TAI is corresponding with uplink frame, and uplink frame is corresponding with downlink frame again, that is to say, that by upper
Row frame, TAI are mapped with downlink frame indirectly, and the corresponding downlink frame of the above-mentioned TAI referred to, actually, TAI is right respectively
The corresponding downlink frame of uplink frame answered.
In the embodiment of the present invention, step 300- step 320 papers are that there are two different ends on same PTCCH
The case where holding and distributing different TS, in practical applications, there is also there are more than two different terminal quilts on same PTCCH
The case where distributing different TS respectively, still, if different TS transmission message are respectively adopted in such case, including step 300-
Therefore the technical solution of step 320 is no longer described in detail herein.
In practical applications, every time for the parameters such as terminal distribution TAI, TS when, be based on a connection TBF(Temporary
Block Flow, Temporary Block Flow)It carries out, and a terminal can support multiple TBF simultaneously, wherein each TBF can be considered as
One independent connection, therefore, the terminal in the application refer not only to a user, can also refer to above-mentioned refer to a TBF.
In conclusion in the embodiment of the present invention, divide respectively with second terminal to distribute the first terminal on same PTCCH
With the first TS, the 2nd TS;Determine the TA of first terminal and the TA of second terminal;Is sent on same PTCCH using the first TS
One message sends second message using the 2nd TS on same PTCCH, wherein first message at least carries first terminal
TA, second message at least carry the TA of second terminal, in this way, ensuring that each terminal of distribution on same PTCCH is equal
The TA values corresponding with this terminal that carrying can be parsed from the message received, so as to avoid in the prior art when same
There are when multiple MS, there are problems that MS can not obtain TA values on one physical channel.
The present invention be with reference to according to the method for the embodiment of the present invention, equipment(System)And the flow of computer program product
Figure and/or block diagram describe.It should be understood that can be realized by computer program instructions every first-class in flowchart and/or the block diagram
The combination of flow and/or box in journey and/or box and flowchart and/or the block diagram.These computer programs can be provided
Instruct the processor of all-purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine so that the instruction executed by computer or the processor of other programmable data processing devices is generated for real
The device of present one flow of flow chart or one box of multiple flows and/or block diagram or the function in multiple boxes.
These computer program instructions, which may also be stored in, can guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works so that instruction generation stored in the computer readable memory includes referring to
Enable the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one box of block diagram or
Function in multiple boxes.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that counted
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, in computer or
The instruction executed on other programmable devices is provided for realizing in one flow of flow chart or multiple flows and/or block diagram one
The step of function in a box or multiple boxes.
Although the above embodiment of the present invention has been described, created once a person skilled in the art knows basic
Property concept, then additional changes and modifications may be made to these embodiments.So it includes upper that the following claims are intended to be interpreted as
It states embodiment and falls into all change and modification of the scope of the invention.
Obviously, those skilled in the art can carry out the embodiment of the present invention various modification and variations without departing from this hair
The spirit and scope of bright embodiment.In this way, if these modifications and variations of the embodiment of the present invention belong to the claims in the present invention
And its within the scope of equivalent technologies, then the present invention is also intended to include these modifications and variations.
Claims (12)
1. a kind of base station, which is characterized in that including:
Allocation unit, to distribute the first terminal and second terminal point on the first grouping Timing Advance control channel PTCCH
The first training sequence TS, the 2nd TS are not distributed;
Determination unit, for determining the Timing Advance TA of the first terminal, the TA of the second terminal;
Transmission unit, for sending first message on same PTCCH using the first TS, using the 2nd TS, in institute
It states and sends second message on same PTCCH;
Wherein, the first message at least carries the TA of the first terminal, the second message at least carries described second eventually
The TA at end;
Wherein, the allocation unit is additionally operable to:
First time lead is distributed respectively for the first terminal and the second terminal indexes TAI and the 2nd TAI;
Wherein, the first TAI belongs to the first TAI groups, the 2nd TAI belongs to the 2nd TAI groups, the first TAI groups and institute
It is corresponding with the 2nd TS to state the first TS correspondences, the 2nd TAI groups.
2. base station as described in claim 1, which is characterized in that the transmission unit is specifically used for:
In the included corresponding downlinks of all TAI of next TAI groups of the first TAI groups of the same PTCCH
The first message is sent using the first TS on frame;
In the included corresponding downlinks of all TAI of next TAI groups of the 2nd TAI groups of the same PTCCH
The second message is sent using the 2nd TS on frame.
3. base station as claimed in claim 2, which is characterized in that the determination unit sends described the first of the first message
Next TAI groups of TAI groups are adjacent next TAI groups of the first TAI groups;
Wherein, if the maximum value in all TAI in the first TAI groups was less than in the TA update cycles of the first terminal
Maximum value in all TAI, then adjacent next TAI groups of the first TAI groups are than all in the first TAI groups
The TAI groups belonging to TAI of the maximum value more than 1 in TAI, and it is all in adjacent next TAI groups of the first TAI groups
TAI is all higher than the maximum value in all TAI in the first TAI groups;If in all TAI in the first TAI groups most
Big value is equal to the maximum value in all TAI in the TA update cycles of the first terminal, then the phase of the first TAI groups
All TAI in adjacent next TA update cycles that adjacent next TAI groups are the TA update cycles of the first terminal
In minimum TAI belonging to TAI groups;
Next TAI groups that the determination unit sends the 2nd TAI groups of the second message are the 2nd TAI groups
Adjacent next TAI groups;
Wherein, if the maximum value in all TAI in the 2nd TAI groups was less than in the TA update cycles of the second terminal
Maximum value in all TAI, then adjacent next TAI groups of the 2nd TAI groups are than all in the 2nd TAI groups
The TAI groups belonging to TAI of the maximum value more than 1 in TAI, and it is all in adjacent next TAI groups of the 2nd TAI groups
TAI is all higher than the maximum value in all TAI in the 2nd TAI groups;If in all TAI in the 2nd TAI groups most
Big value is equal to the maximum value in all TAI in the TA update cycles of the second terminal, then the phase of the 2nd TAI groups
All TAI in adjacent next TA update cycles that adjacent next TAI groups are the TA update cycles of the second terminal
In minimum TAI belonging to TAI groups.
4. base station as described in any one of claims 1-3, which is characterized in that the allocation unit is additionally operable to:For described same
Third terminal on one PTCCH distributes the 3rd TAI and the 3rd TS;
Wherein, the 3rd TAI and the first TAI belongs to same TAI groups, and the 3rd TS is identical as the first TS.
5. base station as described in any one of claims 1-3, which is characterized in that the first TAI of the allocation unit distribution
Affiliated the first TAI groups include the corresponding TAI of all downlink frames of carrying third message, wherein the third disappears
Breath is the message of the corresponding downlink frame carryings of the first TAI;
The 2nd TAI groups belonging to the 2nd TAI of allocation unit distribution include carry the 4th message it is all under
The corresponding TAI of row frame, wherein the 4th message is the message of the corresponding downlink frame carryings of the 2nd TAI.
6. base station as described in any one of claims 1-3, which is characterized in that the transmission unit is specifically used for:
The first TS and at least once the 2nd TS at least once are respectively adopted on the same PTCCH, sends respectively
The first message, the second message.
7. a kind of Timing Advance TA indicating means, which is characterized in that including:
It is distributed respectively with second terminal to distribute the first terminal on the first grouping Timing Advance control channel PTCCH channels
First training sequence TS, the 2nd TS;
Determine the Timing Advance TA of the first terminal, the TA of the second terminal;
First message is sent on same PTCCH using the first TS, using the 2nd TS, on the same PTCCH
Send second message;
Wherein, the first message at least carries the TA of the first terminal, the second message at least carries described second eventually
The TA at end;
Wherein, before the TA of the determination first terminal, the TA of the second terminal, the method further includes:
First time lead is distributed respectively for the first terminal and the second terminal indexes TAI and the 2nd TAI;
Wherein, the first TAI belongs to the first TAI groups, the 2nd TAI belongs to the 2nd TAI groups, the first TAI groups and institute
It is corresponding with the 2nd TS to state the first TS correspondences, the 2nd TAI groups.
8. the method for claim 7, which is characterized in that described to be sent out on the same PTCCH using the first TS
First message is sent, using the 2nd TS, second message is sent on the same PTCCH, specifically includes:
In the included corresponding downlinks of all TAI of next TAI groups of the first TAI groups of the same PTCCH
The first message is sent using the first TS on frame;
In the included corresponding downlinks of all TAI of next TAI groups of the 2nd TAI groups of the same PTCCH
The second message is sent using the 2nd TS on frame.
9. method as claimed in claim 8, which is characterized in that next TAI groups of the first TAI groups are described first
Adjacent next TAI groups of TAI groups;
Wherein, if the maximum value in all TAI in the first TAI groups was less than in the TA update cycles of the first terminal
Maximum value in all TAI, then adjacent next TAI groups of the first TAI groups are than all in the first TAI groups
The TAI groups belonging to TAI of the maximum value more than 1 in TAI, and it is all in adjacent next TAI groups of the first TAI groups
TAI is all higher than the maximum value in all TAI in the first TAI groups;If in all TAI in the first TAI groups most
Big value is equal to the maximum value in all TAI in the TA update cycles of the first terminal, then the phase of the first TAI groups
All TAI in adjacent next TA update cycles that adjacent next TAI groups are the TA update cycles of the first terminal
In minimum TAI belonging to TAI groups;
Next TAI groups of the 2nd TAI groups are adjacent next TAI groups of the 2nd TAI groups;
Wherein, if the maximum value in all TAI in the 2nd TAI groups was less than in the TA update cycles of the second terminal
Maximum value in all TAI, then adjacent next TAI groups of the 2nd TAI groups are than all in the 2nd TAI groups
The TAI groups belonging to TAI of the maximum value more than 1 in TAI, and it is all in adjacent next TAI groups of the 2nd TAI groups
TAI is all higher than the maximum value in all TAI in the 2nd TAI groups;If in all TAI in the 2nd TAI groups most
Big value is equal to the maximum value in all TAI in the TA update cycles of the second terminal, then the phase of the 2nd TAI groups
All TAI in adjacent next TA update cycles that adjacent next TAI groups are the TA update cycles of the second terminal
In minimum TAI belonging to TAI groups.
10. such as claim 7-9 any one of them methods, which is characterized in that further include:For on the same PTCCH
Third terminal distributes the 3rd TAI and the 3rd TS;
Wherein, the 3rd TAI and the first TAI belongs to same TAI groups, and the 3rd TS is identical as the first TS.
11. such as claim 7-9 any one of them methods, which is characterized in that the first TAI groups include carrying third message
The corresponding TAI of all downlink frames, wherein the third message is disappearing for the first TAI corresponding downlink frame carryings
Breath;
The 2nd TAI groups include the corresponding TAI of all downlink frames of the 4th message of carrying, wherein the 4th message
For the message of the corresponding downlink frame carryings of the 2nd TAI.
12. such as claim 7-9 any one of them methods, it is characterised in that, it is described to use the first TS described same
First message is sent on PTCCH, using the 2nd TS, is sent second message on the same PTCCH, is specifically included:
The first TS and at least once the 2nd TS at least once are respectively adopted on the same PTCCH, sends respectively
The first message, the second message.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2013/086695 WO2015066872A1 (en) | 2013-11-07 | 2013-11-07 | Method and apparatus for indicating timing advance (ta) value |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104823492A CN104823492A (en) | 2015-08-05 |
CN104823492B true CN104823492B (en) | 2018-09-07 |
Family
ID=53040774
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201380002724.3A Active CN104823492B (en) | 2013-11-07 | 2013-11-07 | A kind of indicating means and device of Timing Advance TA values |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN104823492B (en) |
WO (1) | WO2015066872A1 (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109819511B (en) | 2017-11-22 | 2021-09-21 | 华为技术有限公司 | Data transmission method and related device |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102014476A (en) * | 2009-10-10 | 2011-04-13 | 大唐移动通信设备有限公司 | Uplink synchronization method, system and equipment |
CN102187592A (en) * | 2008-10-17 | 2011-09-14 | 华为技术有限公司 | Method and apparatus of telecommunications |
CN103314623A (en) * | 2010-03-12 | 2013-09-18 | 捷讯研究有限公司 | Timing advance enhancements for cellular communications |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102083197B (en) * | 2010-12-23 | 2013-10-09 | 华为技术有限公司 | Method, equipment and system for processing time advance |
WO2012154114A1 (en) * | 2011-05-09 | 2012-11-15 | Telefonaktiebolaget L M Ericsson (Publ) | Device and method for extended ptcch space |
CN102647783B (en) * | 2012-04-19 | 2015-02-18 | 北京创毅讯联科技股份有限公司 | Control method for uplink time advance, base station, and terminal |
-
2013
- 2013-11-07 CN CN201380002724.3A patent/CN104823492B/en active Active
- 2013-11-07 WO PCT/CN2013/086695 patent/WO2015066872A1/en active Application Filing
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102187592A (en) * | 2008-10-17 | 2011-09-14 | 华为技术有限公司 | Method and apparatus of telecommunications |
CN102014476A (en) * | 2009-10-10 | 2011-04-13 | 大唐移动通信设备有限公司 | Uplink synchronization method, system and equipment |
CN103314623A (en) * | 2010-03-12 | 2013-09-18 | 捷讯研究有限公司 | Timing advance enhancements for cellular communications |
Also Published As
Publication number | Publication date |
---|---|
CN104823492A (en) | 2015-08-05 |
WO2015066872A1 (en) | 2015-05-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109245876B (en) | A kind of method of paging, the method and apparatus for communicating timing | |
CN106231677B (en) | Communication method and base station | |
CN102215094B (en) | Method, system and equipment for sending and receiving uplink feedback information | |
CN107690173B (en) | Random access method and equipment | |
CN103856309B (en) | Method and device for allocating sounding reference signal resources of collaborative cells | |
EP3785388B1 (en) | Time-domain allocation for repititions | |
CN101877908B (en) | Base stations and method for synchronously scheduling resources among same | |
CN101394668B (en) | Scheduling request signal sending method and device | |
US10735159B2 (en) | Uplink reference signal transmission method, user terminal, and base station | |
CN101808409A (en) | Method and system for configuration of measurement reference signals in LTE-A system | |
CN105917717B (en) | System and method for uplink OFDMA transmission | |
CN103718526B (en) | Pilot frequency collocation method, sending method and device | |
CN103517398B (en) | Device-to-device communication method and terminal | |
RU2634697C1 (en) | Semi-duplex method of duplex communication with frequency separation, base station, and terminal | |
CN108282880B (en) | A kind of method and device of the initial position of determining downstream data channel | |
CN104488335A (en) | Base station device, mobile station device, communication system, and communication method | |
CN104168656B (en) | A kind of detection reference signal SRS resource distribution method and device | |
CN109474994A (en) | A kind of system information transmission method, network side equipment and mobile communication terminal | |
CN103702408B (en) | The method and apparatus of uplink synchronous | |
CN101841919B (en) | Resource allocation method and device | |
CN104519592A (en) | Transmission method for device-to-device discovery signal, and user equipment | |
CN105991274A (en) | Data transmission method, feedback information transmission method and related equipment | |
CN101383639A (en) | Uplink power control information transmission method and device, uplink power control method and device | |
KR20210111300A (en) | Hybrid automatic retransmission feedback information transmission method, network device and terminal | |
CN104823492B (en) | A kind of indicating means and device of Timing Advance TA values |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
EXSB | Decision made by sipo to initiate substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |