Document made
`
`available under
`
`the
`
`Patent Cooperation Treaty (PCT)
`
`International application number: PCTr’US2010f0393?2
`
`International filing date:
`
`21 June 2010 (21062010)
`
`Document type:
`
`Certified copy of priority document
`
`Document details:
`
`Country/[Office US
`Number:
`61f218,769
`
`Filing date:
`
`19 June 2009 (19.06.2009)
`
`Date of receipt at the International Bureau:
`
`30 January 2011 (30.01.2011)
`
`Remark:
`
`Priority document submitted or transmitted to the International Bureau in
`
`compliance with Rule 17.1(a),(b) or (b-bts')
`
`
`
`World Intellectual Property Organization (WIPO) - Geneva, Switzerland
`Organisation Mondiale de la Propriété intellectuelle (OMPI) - Genéve, Suisse
`1
`SAMSUNG 1010
`
`1
`
`SAMSUNG 1010
`
`

`

`“E fistgfiwéfiiflfififi’fig \Ei-fifiifi: §§§$§§ fififiififii fifiifixfixfifi’fi‘fi
`
`UNITED $111123 DEPARTMENT OI" (’OR-IM'ERCE
`
`Linitmi Stuns Putt-m and ’l‘radrmnrk (lfl'icc
`
`January 29, 20”
`
`Patten! am! 'I'mdemark Office.
`
`THIS IS TO CERTIFY THAT ANNEXED HERETO IS A TRUE COPY FROM
`THE RECORDS OF THE UNITED STATES PATENT AND TRADEMARK
`OFFICE OF THOSE PAPERS OF THE BELOW IDENTIFIED PATENT
`APPLICATION THAT MET THE REQUIREMENTS TO BE GRANTED A
`FILING DATE.
`
`APPLICATION NUMBER: 61/218,769
`FILING DATE: June 19, 2009
`RELATED PCT APPLICATION NUMBER: I’CT/USIO/39372
`
`THE COUNTRY CODE AND NUMBER OF YOUR PRIORITY
`APPLICATION, TO BE USED FOR FILING ABROAD UNDER THE PARIS
`CONVENTION, IS US6I/218, 769
`
`Certified by
`
`Under Secretary of Commerce
`fm' Intellecmal I’mperiy
`and Diructnr at” line Iinii'eti Sums
`
`2
`
`

`

`DOCKET NO. 09 25 4fiP|
`
`CLAIMS
`
`1.
`
`A method. comprising:
`
`associating a plurality of carriers utilized for communication into one or more
`
`timing groups of carriers;
`
`assigning a candidate carrier in at least one of the one or more timing groups for
`
`timing updates;
`
`receiving a timing offset from the candidate carrier during a timing update; and
`
`updating timing for each carrier in the at least one timing group based on the
`
`timing offset.
`
`2.
`
`The method of claim 1, wherein assigning the candidate carrier includes
`
`selecting the candidate carrier according to a hash function.
`
`3.
`
`The method of claim 2, wherein the hash function utilizes a variable key
`
`such that the candidate carrier differs for disparate timing updates.
`
`4.
`
`The method of claim 1, wherein assigning the candidate carrier is
`
`performed according to a received assignment from a base station associated with a
`
`subset of the plurality of carriers.
`
`5.
`
`The method of claim I, wherein associating the plurality of carriers into
`
`one or more timing groups includes evaluating a timing difference of each of the
`
`plurality of carriers and grouping the plurality of carriers according to a threshold
`difference.
`
`6.
`
`The method of claim 1, wherein associating the plulaiity of carriers into
`
`one or more timing groups is performed according to a grouping received from a base
`
`station associated with a subset of the piurality of carriers.
`
`3
`
`

`

`DOCKET NO. 09 25 46H
`
`1 6
`
`7.
`
`The method of claim 1, further comprising monitoring a downlink timing
`
`for each carrier in the at
`
`least one timing group and modifying the timing offset
`
`according to an average of the offset applied to the monitored downlink timings for each
`
`carrier.
`
`8.
`
`The method of claim 1. wherein carriers in the at least one of the one or
`
`more timing groups are transmitted at a common site.
`
`9.
`
`The method of claim 8, wherein the timing offset is received in a vector
`
`of a plurality of timing offsets for the at least one of the one or more timing groups from
`the common site.
`
`10.
`
`A wireless communications apparatus, comprising:
`
`at least one processor configured to:
`
`generate
`
`an
`
`association of a plurality of carriers utilized for
`
`communication into one or more timing groups according to a timing of each of
`
`the plurality ofcarriers;
`
`select a candidate carrier in at least one ofthe one or more timing groups
`
`for timing updates;
`
`obtain a timing offset from the candidate carrier during a timing update;
`
`and
`
`modify timing for each carrier in the at least one timing group based on
`
`the timing offset; and
`
`a memory coupled to the at least one processor.
`
`1 l.
`
`The wireless communications apparatus of claim 10, wherein the at least
`
`one processor seiects the candidate can'ier according to a hash function.
`
`l2.
`
`The wireless communications apparatus of claim ll, wherein the hash
`
`function utilizes a variable key such that
`
`the candidate carrier differs for disparate
`
`titning updates.
`
`4
`
`

`

`DOCKET NO. 09 25 46H
`
`1 7
`
`13.
`
`The wireless communications apparatus of claim 10, wherein the at least
`
`one processor selects the candidate carrier according to an assignment received from a
`
`base station associated with a subset of the plurality of carriers.
`
`14.
`
`The wireless communications apparatus of claim 10, wherein the at least
`
`one processor generates the association of the plurality of carriers into one or more
`
`timing groups by evaluating a timing difference of each of the plurality of carriers and
`
`grouping the plurality of carriers into the timing groups aCCordiug to a threshold
`difference.
`
`15.
`
`The wireless communications apparatus of claim 10, wherein the at least
`
`one processor generates the association of the plurality of carriers into one or more
`
`timing groups according to a grouping received from a base station associated with a
`
`subset of the plurality of carriers.
`
`16.
`
`The wireless communications apparatus of claim 10. wherein the at least
`
`one processor is further configured to monitor a downlink timing for each carrier in the
`
`at least one timing group and update the timing offset according to an average of the
`
`offset applied to the monitored downlink timings for each carrier.
`
`17.
`
`The wireless communications apparatus of claim 10, wherein carriers in
`
`the at least one of the one or more timing groups are transmitted at a common site.
`
`18.
`
`The wireless communications apparatus of claim [7. wherein the at least
`
`one processor obtains the timing offset in a vector ofa plurality of timing offsets for the
`
`at least one of the one or more timing groups from the common site.
`
`5
`
`

`

`DUCKS!“ NO. 09 25 46H
`
`1 8
`
`19.
`
`An apparatus. comprising:
`
`means for associating a plurality of carriers utilized for communication into one
`
`or more timing groups of carriers;
`
`means for assigning a candidate carrier in at least one of the one or more timing
`
`groups over which to receive timing updates;
`
`means for receiving a timing offset from the candidate carrier during a timing
`
`update; and
`
`means for updating timing for each carrier in the at least one timing group based
`
`on the timing offset.
`
`20.
`
`The apparatus of claim 19. wherein the means for assigning the candidate
`
`carrier selects the candidate carrier according to a hash function.
`
`21.
`
`The apparatus of claim 20, wherein the hash function utilizes a variable
`
`key such that the candidate carrier differs for disparate timing updates.
`
`22.
`
`The apparatus of ciaim 19, wherein the means for assigning the candidate
`
`carrier assigns the candidate carrier according to a received assignment from a base
`
`station associated with a subset of the plurality of carriers.
`
`23.
`
`The apparatus of claim 19, wherein the means for associating the
`
`plurality of carriers into one or more timing groups analyzes a timing difference of each
`
`of the plurality of carriers and groups the plurality of carriers according to a threshold
`difference.
`
`24.
`
`The apparatus of eiaim 191 wherein the means for associating the
`
`plurality of carriers into one or more timing groups associates according to a grouping
`
`received from a base station associated with a subset ofthe plurality ofcarriers.
`
`6
`
`

`

`DOCKET NO. 09 25 46H
`
`1 9
`
`25.
`
`The apparatus ofclaim 19. further comprising:
`
`means for monitoring a downlink timing for each carrier in the at
`
`least one
`
`timing group; and
`
`means for modifying the timing offset according to an average of the offset
`
`applied to the monitored downlink timings for each carrier.
`
`26.
`
`The apparatus of claim 19, wherein carriers in the at least one of the one
`
`or more timing groups are transmitted at a common site.
`
`27.
`
`The apparatus of claim 26, wherein the timing offset is received in a
`
`vector of a plurality of timing offsets for the at least one of the one or more timing
`
`groups from the common site.
`
`28.
`
`A computer program product, comprising:
`
`a computer readable medium. comprising:
`
`code for causing at least one computer to associate a plurality of carriers
`
`utilized for communication into one or more timing groups of carriers;
`
`code for causing the at least one computer to assign a candidate carrier in
`
`at least one of the one or more timing groups for timing updates;
`
`code for causing the at least one computer to receive a timing offset from
`
`the candidate carrier during a timing update: and
`
`code for causing the at least one computer to update timing for each
`
`carrier in the at least one timing group based on the timing offset.
`
`29.
`
`The computer program product of claim 28, wherein assigning the
`
`candidate carrier includes selecting the candidate carrier according to a hash function.
`
`30.
`
`The computer program product of claim 29, wherein the hash function
`
`utilizes a variable key such that
`
`the candidate carrier differs for disparate timing
`
`updates.
`
`7
`
`

`

`west?!“ no. 092546“
`
`20
`
`31.
`
`The computer program product of claim 28. wherein assigning the
`
`candidate carrier is performed according to a received assignment from a base station
`
`associated with a subset of the plurality of carriers.
`
`32.
`
`The computer program product of claim 28. wherein associating the
`
`plurality of carriers into one or more timing groups includes evaluating a timing
`
`difference of each of the plurality of carriers and grouping the plurality of carriers
`
`according to a threshold difference.
`
`33.
`
`The computer program product of claim 28. wherein associating the
`
`plurality of carriers into one or more timing groups is performed according to a
`
`grouping received from a base station associated with a subset of the plurality of
`carriers.
`
`34.
`
`The computer program product of claim 28, wherein the computer-
`
`readable medium further comprises;
`
`code for causing the at least one computer to monitor a downlink timing for each
`
`carrier in the at least one timing group; and
`
`code for causing the at least one computer to modify the timing offset according
`
`to an average of the offset applied to the monitored downlink timings for each carrier.
`
`35.
`
`The computer program product of claim 28, wherein carriers in the at
`
`[east one of the one or more tinting groups are transmitted at a common site.
`
`36.
`
`The computer program product of claim 35. wherein the timing ofTsct is
`
`received in a vector of a plurality of timing offsets for the at least one of the one or more
`
`timing groups from the common site.
`
`8
`
`

`

`
`
`EFS ID: 5554913
`
`Electronic Acknowledgement Receipt
`
`
`
`Application Number: 61218?69
`
`International Application Number:
`
`Confirmation Number:
`
`Title of Invention:
`
`TIMING ALIGNMENT IN A MULTICARRIER SYSTEM
`
`
`
`Payment information: Submitted with Payment
`
`First Named InventorlApplicant Name:
`Natha n E. Tenny
`
`
`Customer Number:
`
`23696
`
`Filer:
`
`Florin C.Cor1e!5usan Turner
`
`Attorney Docket Num her:
`092546P1
`
`
`
`
`Receipt Date:
`
`19-JUN-2009
`
`Filing Date:
`
`
`
`Application Type: Provisional
`
`Payment Type
`
`Payment was successfully received in RAM
`
`yes
`
`
`
`The Director of the USPTO is hereby authorized to charge indicated fees and credit any overpayment as follows:
`Charge any Additional Fees required under 3? GER. Section 121 (Miscellaneous fees and charges]
`
`9
`
`

`

`File Listing:
`
`Document
`
`.
`
`.
`
`File SimelBytes}!
`
`Multi
`
`Pages
`
`_
`092546Pi_20090619_ADSSIgn
`.
`.
`1
`Application Data Sheet
`no
`5
`aJFau‘ttlbddhbbiflfdflit‘)Ihlitic‘bllu
`ed.pdf
`I‘m?
`
`
`l4?4?8?
`
`
`Warnings:
`
`Information:
`
`This is notan USPTO supplied ADS fillable form
`
`The page size in the PDF is too large. The pages should be 8.5 x13 or A4. lfthis PDF is submitted, the pages will be resized upon entry into the
`Image File Wrapperand may affect subsequent processing
`
`2
`
`Specification
`
`092546P1_20090619_APP.pdf
`
`1685 23
`
`(”Night MKI‘JerJflm-JQ‘XakIJQ‘flW
`tin-6'0
`
`no
`
`20
`
`
`
`Information:
`
`
`.
`.
`I
`_
`.
`3
`Drawngs only b afkand White I'm
`092546Pi_20090519_DWG.pd— no
`2
`drawings
`If} |Denial!-|J|J.KRS?d)l-1W.¢6rifl(n~dll
`IEH
`
`
`?5626
`
`Warnings:
`Information:
`
`
`
`d'
`092546P'l 20090619 A
`— X df
`— ppen i
`p
`
`132?”
`Salk
`”JimUNSI‘XH‘WOMHU‘IIHH‘M
`
` Warnings:
`
`7
`
`2
`
`4
`
`Appendix to the Specification
`
`Warnings:
`Information:
`
`5
`
`Fee Worksheet [PTO-8H]
`
`fee—info.de — no
`Mifiblsmdltm-IKIDWJWDGTIMI:
`“$514
`
`29244
`
`Warnings:
`Information:
`
`Total Files Size [in bytes}
`
`1880893
`
`10
`
`10
`
`

`

`This Acknowledgement Receipt evidences receipt on the noted date by the USPTO of the indicated documents.
`characterized by theapplicant, and including page counts, whereapplicable. It serves as evidence of receipt similar to a
`Post Card, as described in MPEP 503.
`
`New Applications Under 35 U.S.C.111
`Ifa new application is being lFiled and the application includes the necessary components fora filing date (see 3? CFR
`1.53lbl-(dl and MPEP 506}, a Filing Receipt {3? CFR 1.54} will be issued in due course and the date shown on this
`Acknowledgement Receipt will establish the filing date ofthe application.
`
`National Stage of an International Application under 35 U.S.C. 3Tl
`lfa timely submission to enterthe national stage ofan international application is compliant with the conditions of 35
`U.S.C. 3i"! and other applicable requirements a Form PCTIDOIEOIQOS indicating acceptance ofthe application as a
`national stage submission under 35 U.S.C. 371 will be issued in addition to the Filing Receipt, in due course.
`
`New International Application Filed with the USPTO as a Receiving Office
`Ifa new international application is being filed and the international application includes the necessary components for
`an international filing date {see PCT Article 11 and MPEP1310}, a Notification of the international Application Number
`and ofthe International Filing Date (Form PCTIROHOS) will be issued in due course, subject to prescriptions concerning
`national security, and the date shown on this Acknowledgement Receipt will establish the international filing date of
`the application.
`
`
`
`
`
`
`11
`
`11
`
`

`

`lX)CK1--'.T N0. 092 5461’1
`
`1. Scope
`
`Apgendix A
`
`This document describes solutions to several issues that arise in relation to maintaining timing
`synchronisation for a UE in a moiticarrier LTE-Advanced {LTE-A') system.
`
`2. Baekgrou no
`
`In a single—carrier environment, the maintenance of timing synchronisation for a UE is well
`understood; the UE receives an uplirzlddowniink offset from the network. which occasionally
`needs to be updated, indicating how it should align its uplink transmissions in relation to the
`received downlink timing.
`
`In a multicarrier environment, however, the situation is less straightforward. Assuming that all
`carriers serving a single UE are transmitted front the same cell site. it appears that a common
`offset should be adequate; however. even eo—sitcd carriers could experience some variation in
`timing for a number ofreasons (e.g.. cable delays, distance between the base station site and a
`remote radio head}. which would make separate timing offsets per carrier beneficial or even
`necessary.
`
`3. Proposal
`
`3.1. Timing groups
`
`As a general framework, we propose that it should be possible to assign a UE to at least one so-
`called timing group. i.c., a group of carriers with uplink timings that are the same to within some
`tolerance. Depending on the tolerance, a timing group might consist of carriers that share a
`common controlling site (but may still have fine differences in timing). or only of carriers whose
`antennae are collocated. Different carriers with synchronised downlinks but significant
`differences in uplink timing for a given UE (cg. front different cell sites in a synchronous
`network) would not normally belong to the same timing group in this sense.
`
`There is no fundamental reason to assume that a UE would be assigned carriers from only one
`timing group; in principle. a UE with enough reception and decoding capabilities could listen to
`several sets of carriers with independent timing. Such a situation would ntost obviously arise if a
`UE were assigned to carriers from different cell sites: however, the current LTE design (with no
`soft handover), and the complexities that arise when attempting to design such a system, such a
`multiple—site assignment seems unlikely. Even so, ifthe tolerances defining a timing group are
`fine, it is possible that a UE could be assigned carriers ftom multiple timing groups originating
`from the same cell site. An example, in which a remote radio head belonging to the eNode B
`causes some carriers to have different timing from others, is shown in Figurc l.
`
`13
`
`i6
`
`17
`[8
`19
`20
`2]
`22
`23
`
`24
`25
`26
`27
`28
`29
`30
`3]
`32
`
`-1;7_
`
`12
`
`12
`
`

`

`IXJCKl-iT N0. 092 5461’l
`
`Appendix A
`
`Remote radio head
`
`
`
`Main eNB site
`
`
`
`M
`
`GNU-kw
`
`9
`10
`ll
`12
`13
`
`14
`15
`16
`17
`
`18
`19
`20
`21
`22
`
`23
`24
`25
`26
`
`Figure 1: Two timing groups from a single eNode B
`
`in such a case, the UE could be assigned to carriers in both groups A and B, and it would need to
`maintain timing separately for each group. This might require separate timing advance
`procedures for each group. or enhanced signalling allowing timing maintenance to take place for
`all groups in parallel.
`
`3.2. Carrier selection for random access
`
`Within each timing group. the UE may need to occasionally perfonn random access to update its
`timing (e.g.. if timing is maintained through a separate procedure for each timing group). By
`definition, this update only needs to be performed with one carrier of each tinting group; and the
`issue arises of how the UE should decide which carrier this is. At a minimum, the UE should be
`expected to behave intelligently enough not to perform unnecessary timing updates, i.e., to select
`a single carrier from the tinting group to use for its timing control.
`
`in principle. random access on any carrier in the group should work. However, it is desirable to
`avoid situations in which large numbers of UEs concentrate their random access attempts on a
`particuiar carrier, to minimise contention on the random access channel. To this end, we suggest
`that the system could adopt either a LIE—based or a network—based solution.
`
`A network—based solution is extremely simple: When the HE is assigned to carriers in a particular
`timing group, the network provides the UE with instiuctions regarding which carrier in that group
`to use for random access. The instructions could be absolute (“always use this carrier") or subject
`to relaxation based on conditions at the UE (“use this carrier preferentially, unless radio
`conditions on that carrier are worse than indicated by a threshold").
`
`in a UE—based approach, each UE would select a single carrier for random access for timing
`updates autonomously, based on some function that tends to distribute UEs more or less evenly
`across the timing group. A typical example would be a hash function, in which a UE associated
`with a timing group of n carriers provides some input to a hash function with it possible values.
`
`-2,r7_
`
`13
`
`13
`
`

`

`IXJCKl-iT N0. 093 5461’1
`
`Appendix A
`
`and the function’s output is the index of the carrier of the group that the UE will (prefer to) use
`for random access. (Again. the determination of the carrier could be absolute or subject to
`modification, as with the network-based solution.) There are many options for an appropriate
`haslt filnction; a UE identifier would be a typical input, with other values such as an eNode B
`identifier also potentially used. The inputs could be static or time-varying: if they are static
`(depending on characteristics of the UE and/or the serving cNode B), the UE will tend to use the
`same carrier for random access throughout its assignment to a particular group, while if the inputs
`vary with time (e.g., through the use of an input value derived from a time measurement, or a
`counter}, the UE will tend to "cycle” through the available carriers. The latter approach may be
`preferable, since it means that coincidental “spikes" in concentration (e. g.. when a particular site
`is serving a large number of UEs whose identities result in the same output from the hash
`Function} will tend to correct themselves overtime.
`
`Other UE-based distribution mechanisms are Feasible; for instance, instead of a fixed hash
`fiJnction. the UE could use a pseudorandom fiJnction to choose the carrier.
`In such a case, the
`determination could be made only at the time of carrier assignment (so that a given UE
`consistently uses the same carrier for timing) or at each request for a tinting update (so that each
`UE tends to balance its requests across the available carriers}.
`
`3.3. Granularity of timing alignment
`
`Within a timing group. if all carriers are precisely aligned in both downlink anti uplink timing.
`there is no ambiguity about what the “correct” timing alignment for a given UE should be.
`However. in the case of small differences between carrier transmission timing (cg... due to cable
`delays). carriers with the same tinting qflfret may nevertheless have different absolute timings.
`An example is shown in Figure 2.
`
`UL1
`
`I L2|
`|
`I
`|
`|
`
`DL
`
`DL
`
`Carrier 1
`
`I
`I
`.
`Carner2 tl
`
`ltII
`
`Figure 2: Ambiguous uplink timing
`
`A UE in the environment of Figure 2 could receive its timing information from either carrier 1 or
`carrier 2. The timings of the two carriers differ, but by less than the tolerance that the deployment
`requires for a timing group; and it follows that, depending on which carrier the UE received its
`last update from, a UE connected to both carriers could consider the correct uplink liming to be al
`either [IL] or ULZ in the figure.
`
`The simplest approach is for the UE simply to apply the timing offset to the carrier on which it
`received it, and assume that the timing of other carriers in the group is “close enough”; in terms of
`
`DCOCH-JONM-FUJN—
`
`—l
`
`_t_. My—
`
`13
`14
`15
`16
`l?
`
`18
`
`19
`20
`2]
`22
`23
`
`24
`
`25
`
`26
`27
`28
`29
`3t)
`
`3]
`32
`
`-3fl_
`
`14
`
`14
`
`

`

`[XJCKl-iT N0. 093 5461’1
`
`Appendix A
`
`OOH-JONM-FUJN—
`
`the figure. this would mean that the system considered UL] and UL? to be the same for purposes
`of uplink timing accuracy. As all alternative, however, the UE could apply the offset, not to the
`received downlink timing from the carrier that transmitted the offset, but to the average timing of‘
`tlte carriers in the timing group.
`In such a case, although the UE received its tinting infonnatiort
`From a particular carrier. it tracks tlte (downlittk) timing of each carrier in the group separately. so
`that when a single DUUL offset is received, the UE can apply the offset separately to each carrier
`and take an average of the resutts to provide a "happy medium“ uplink timing for use with all
`carriers in the group.
`
` DL1
`
`Actual UL timing = (DL1 + DL2)!2 + offset
`= (UL1 + UL2)!2
`
`UL1 :
`
`ED
`
`L2
`
`UL2
`
`10
`
`ll
`12
`l3
`
`I4
`
`15
`16
`l't'
`18
`I9
`20
`
`2]
`22
`23
`24
`25
`26
`27
`28
`
`Figure 3: UE averaging of uplink timing from two carriers
`
`Such an averaging behaviour could be either a specified U E behaviour (to allow greater downlirtk
`tolerances within a timing group while still keeping the variation in uplink timing acceptable) or
`left to UE implementation.
`
`3.4. Vector timing adjustment command
`
`In the event that a UE is assigned to several timing groups that are controlled from a common
`site, it may be able to receive timing adjustments for all groups with a single interaction with the
`base station. This is essentially a signalling optimisation. in the sense that the UE could in
`principle receive the same information by performing a separate timing adjustment for each
`group, but sending the adjustments as a vector reduces over-the-air activity, and in particular
`random access procedures, which are expensive in terms of radio resources and UE battery life.
`
`To implement such a command, the network would need to be aware of the timing groups itt
`which the UE is assigned to at least one carrier. This knowledge could be maintained
`autonomously in the network. so that upon determining the need to signal a timing advance to a
`particular UE, the network automatically includes tinting advance commands for all appropriate
`timing groups. Alternatively, the UE could request timing advance values for a particular set of
`timing groups (cg, the groups for which the UE‘s time-alignment timers are within some range
`of expiring}. However. the request for particular groups would represent a new MAC. control
`element, which would need to be transmitted over the air at random access with a potentially
`
`-4;7_
`
`15
`
`15
`
`

`

`lX)CK1--'.T N0. 092 5461’1
`
`Appendix A
`
`significant cost in radio resources. The preferred solution is therefore for the network to maintain
`knowledge of what timing groups require timing advance commands towards a particular UE.
`
`In a “degenerate" form of this vector approach. the network could opt to send only a single timing
`advance command per MAC element. but indicate which timing group the value is associated
`with. This approach would minimise the specification impact to the concerned MAC control
`element, since the existing infonnatiott only needs to be augmented by a group identifier.
`it is
`presumed that such an identifier could be sent with a small number of bits, e.g., as an index into
`the set oftiming groups with which the UE was configured. Such a mapping could be established
`by explicit signalling (in higher layers such as the RRC) at the time the UE is configured with
`particular carriers.
`
`1.
`
`A method of maintaining tintittg alignment between a mobile device and a network
`operating on a plurality of frequencies, the method comprising an association of the
`fiequencies into one or more timing groups, such that:
`
`the carriers in each tinting group share common transmission timing to within some first
`tolerance:
`
`a single timing advance value can be indicated to the UE for use with all the carriets in
`the group. such that the resulting uplink tittting when the UE transmits with this timing
`advance value towards any carrier in the group will be sufficiently accurate for
`communication with that carrier, where “sufficientiy accurate” is defined in terms of
`some second tolerance.
`
`The method of claim 1, wherein the carriets in each timing group are transmitted from
`antennas located at a common site.
`
`The method of claim I, wherein the UE may be assigned to communicate with carriers in
`one or more timing groups.
`
`The method of claim 3, wherein the UE maintains tithing synchronisation for each group
`to at least one of whose carriers it is assigned.
`
`‘Ji
`
`The method of claim 1, wherein the UE may maintain timing synchronisation in
`association with a random access procedure.
`
`The method of claim 5, wherein the UE performs random access for timing
`synchronisation on a single carrier of tltc timing group for which it requires timing
`information.
`
`The method of claim 6, wherein the carrier chosen within the group for randont access is
`assigned to the UE by the network in advance of the random access procedure.
`
`The tttcthod of claim 7. wherein the carrier for random access is signalled to the UE as
`part ofa dedicated radio resource configuration.
`
`The method of claim 7, wherein a criterion for using the indicated carrier is provided
`aiong with the assignment of the carrier.
`
`N
`
`oomuomhm
`
`l3
`14
`15
`lb
`17
`18
`19
`20
`2|
`22
`
`23
`24
`
`25
`26
`
`27
`28
`
`29
`30
`
`31
`32
`33
`
`34
`35
`
`36
`37
`
`38
`39
`
`-5fl_
`
`16
`
`16
`
`

`

`lX)CK1--'.T N0. 092 546l’l
`
`Appendix A
`
`b)
`
`Ur
`
`HJ
`
`9
`ll]
`
`11
`
`12
`
`13
`14
`
`15
`16
`
`1'?
`18
`
`19
`20
`
`2]
`22
`
`23
`24
`
`25
`26
`
`2?
`28
`
`29
`30
`
`IO.
`
`ll.
`
`The method ofclaim 9, wherein the criterion is a minimum signal quality threshold for
`the associated carrier.
`
`The method of claim 9, wherein the UE is provided with an alternative carrier to use for
`random access in case the criterion is not met by the assigned carrier.
`
`. The method of claim 9, wherein if the criterion is not met by the assigned carrier. the U E
`determines independently which carrier to use for random access.
`
`. The method ofclaim 6. wherein the carrier for random access is selected independently
`by the UE.
`
`14.
`
`15.
`
`16.
`
`17.
`
`18.
`
`19.
`
`20.
`
`21.
`
`22.
`
`23.
`
`24.
`
`25.
`
`26.
`
`The method of claim 13, wherein the UE seiects the carrier by applying a determination
`function across the set ot‘avaitable carriers in the timing group.
`
`The method of claim 14, wherein the dctenni nation function is a pseudorandom function.
`
`The method of claim 14, wherein the determination function is a hash function.
`
`The method of claim 16, wherein the hash function takes an identity of the UE as an
`input.
`
`The method of claim 16, wherein the hash function takes an identity of the network node
`controlling the carriers of the timing group as an input.
`
`The method of claim 16, wherein the hash function takes a time-varying value as an
`input.
`
`The method of claim 19, wherein the time—varying value is determined by a time
`measurement from an internal source in the UE.
`
`The method of claim 19, wherein the time-varying value is modified by an arithmetic
`operation each time it is used.
`
`The method ofclaim 13, wherein the UE selects the carrier at a time when radio
`resources are assigned to it on carriers associated with the tinting group.
`
`The method of claim 13, wherein the UE selects the carrier when the random access
`procedure is triggered.
`
`The method of claim 1, wherein the UE determines its uplink timing based on an average
`of tinting information from a plurality of carriers in the group.
`
`The method ofclaim 24. wherein the plurality ofcarriers in the group comprises the
`carriers within the group on which the UE has radio resources assigned.
`
`The method ofclaim 24, wherein the plurality ofcan‘icrs in the group comprises a set of
`carriers indicated to the UE by the network.
`
`-6fl_
`
`17
`
`17
`
`

`

`lX)CK1--'.T N0. 092 546l’l
`
`Appendix A
`
`27.
`
`28.
`
`29.
`
`30.
`
`3].
`
`32.
`
`33.
`
`34.
`
`35.
`
`36.
`
`37.
`
`38.
`
`39.
`
`40.
`
`41.
`
`The method ofclaim 3, wherein timing information for a plurality oftiming groups may
`be provided to the UE in a single message.
`
`The method ofclaim 2?, wherein the message is a tinting advance command.
`
`The method of claim 2?, wherein the message contains a vector of timing adjustment
`values for different timing groups.
`
`The method ofclain12?, wherein timing information is provided for all timing groups
`containing at least one carrier on which the UE has assigned radio resources.
`
`The method of claim 27, wherein timing information is provided for a proper subset of
`the timing groups containing carriers on which the UE has assigned radio resources.
`
`The method of claim 31, wherein the proper subset is determined based on a request from
`the UE.
`
`The method of claim 31, wherein the proper subset is determined by the network.
`
`The method of claim 33, wherein the message includes an indication of which timing
`groups are contained in the proper subset.
`
`The method of claim 34, wherein the indication of which timing groups are contained in
`the proper subset relies on a mapping of group identities shared between the network and
`the UE.
`
`The method of claim 35, wherein the mapping of group identities is configured in
`association with the assignment to the UE of dedicated radio resources on carriers in one
`or more of the concerned tinting groups.
`
`The method ofelaim 3. wherein a message directed to the UE may include timing
`information for at least one timing group other than the timing group containing the
`carrier on which the message is transmitted.
`
`The method of claim 37, wherein an indication of the timing group to which the
`information applies is included in the message.
`
`The method of claim 37, wherein the indication of the tinting groups relies on a mapping
`of group identities shared between the network and the UE.
`
`The method of claim 39, wherein the mapping of group identities is configured in
`association with the assignment to the UE of dedicated radio resources on carriers in one
`or more of the concerned timing groups.
`
`(Corresponding apparatus claitns, &c.)
`
`Ur
`
`H-ISN
`
`9
`
`10
`11
`
`12
`
`13
`14
`
`15
`16
`17
`
`18
`19
`20
`
`21
`22
`23
`
`24
`25
`
`26
`27
`
`28
`29
`30
`
`31
`
`-7fl_
`
`18
`
`18
`
`

`

`DOCKET NO. 09 25 46M
`
`Timing Alignment in a Multicarrier System
`
`Field
`
`BACKGROUND
`
`[000]]
`
`The present application relates generally to wireless communications, and more
`
`specifically to systems and methods for multicarrier system timing alignment.
`
`Background
`
`[0002|
`
`Wireless communication systems are widely deployed to provide various types
`
`of communication content such as voice. data. and so on. These systems may be
`
`multiple-access systems capable of supporting communication wi