The present invention relates generally to wireless communication systems and, more particularly, to a Single-Carrier Frequency Division Multiple Access (SC-FDMA) communication system that is further considered in the development of the 3rd Generation Partnership Project (3GPP) Evolved Universal Terrestrial Radio Access (E-UTRA) long term evolution (LTE).
Methods and apparatus are considered for the functionality and implementation of hopping for sequences used in the construction of Reference Signals (RS) or control signals transmitted in SC-FDMA communication systems.
The Uplink (UL) of the communication system is assumed, which corresponds to signal transmissions from mobile User Equipments (UEs) to a serving base station (Node B). A UE, also commonly referred to as terminal or mobile station, may be fixed or mobile and may be a wireless device, a cellular phone, a personal computer device, a wireless modem card, etc. A Node B is generally a fixed station and may also be called a Base Transceiver System (BTS), an access point, or some other terminology. A Node B may control multiple cells in a cellular communication system, as it is known in the art.
Several types of signals need to be supported for the proper functionality of the communication system. In addition to data signals, which convey the information content of the communication, control signals also need to be transmitted from UEs to their serving Node B in the UL and from the serving Node B to UEs in the downlink (DL) of the communication system. The DL refers to the communication from the Node B to UEs. Additionally, a UE having data or control transmission also transmits RSs, also known as pilots. These RSs primarily serve to provide coherent demodulation for the transmitted data or control signals by a UE.
The UEs are assumed to transmit data or control signals over a Transmission Time Interval (TTI), which is assumed to correspond to a sub-frame. The sub-frame is the time unit of a frame, which may consist of ten sub-frames.
The transmission BW is assumed to include frequency resource units, which will be referred to herein as resource blocks (RBs). Each RB may consist of 12 sub-carriers and UEs are allocated a multiple N of consecutive RBs 150 for Physical Uplink Shared Channel (PUSCH) transmission and 1 RB for Physical Uplink Control Channel (PUCCH) transmission.
As the data or control signal transmission is over a BW that can be (orthogonally) shared by multiple UEs, the corresponding physical layer channel may be respectively referred to as PUSCH or as PUCCH.
The UEs are also assumed to transmit control signals in the absence of any data signals. The control signals include, but are not limited to, positive or negative acknowledgment signals (ACK or NAK, respectively) and Channel Quality Indication (CQI) signals. The ACK/NAK signals are in response to the correct or incorrect, respectively, data packet reception by a UE in the DL of the communication system. The CQI signals are sent by a UE to inform its serving Node B of its Signal-to-Interference and Noise Ratio (SINR) conditions in order for the serving Node B to perform channel dependent scheduling in the DL of the communication system. Both ACK/NAK and CQI signals are accompanied by RS signals in order to enable their coherent demodulation at the Node B receiver. The physical layer channel conveying ACK/NAK or CQI control signaling may be referred as the PUCCH.
The ACK/NAK, CQI and associated RS signals are assumed to be transmitted by UEs in one RB using CAZAC sequences as it is known in the art and is subsequently described.
As it was previously mentioned, the ACK/NAK, CQI, and RS signals are assumed to be constructed from CAZAC sequences. An example of such sequences is the Zadoff-Chu (ZC) sequences whose elements are given by Equation (1) below:
L is the length of the CAZAC sequence, n is the index of an element of the sequence n={0, 1, 2 . . . , L−1}, and k is the index of the sequence itself. For a given length L, there are L−1 distinct sequences, if L is prime. Therefore, the entire family of sequences is defined as k ranges in {1, 2 . . . , L−1}. However, it should be noted that the CAZAC sequences used for the ACK/NAK, CQI, and RS transmission need not be generated using the exact above expression as it is further discussed below.
For CAZAC sequences of prime length L, the number of sequences is L−1. As the RBs are assumed to consist of an even number of sub-carriers, with 1 RB consisting of 12 sub-carriers, the sequences used to transmit the ACK/NAK, CQI, and RS can be generated, in the frequency or time domain, by either truncating a longer prime length (such as length 13) CAZAC sequence or by extending a shorter prime length (such as length 11) CAZAC sequence by repeating its first element(s) at the end (cyclic extension), although the resulting sequences do not fulfill the definition of a CAZAC sequence. Alternatively, the CAZAC sequences can be directly generated through a computer search for sequences satisfying the CAZAC properties.
A block diagram for the transmission through SC-FDMA signaling of a CAZAC-based sequence in the time domain is shown in
At the receiver, the inverse (complementary) transmitter functions are performed. This is conceptually illustrated in
An alternative generation method for the transmitted CAZAC sequence is in the frequency domain. This is depicted in
The reverse functions are again performed for the reception of the CAZAC-based sequence transmitted as in
The transmitted CAZAC-based sequence in
Different cyclic shifts of the same CAZAC sequence provide orthogonal CAZAC sequences. Therefore, different cyclic shifts of the same CAZAC sequence can be allocated to different UEs in the same RB for their RS or ACK/NAK, or CQI transmission and achieve orthogonal UE multiplexing. This principle is illustrated in
Referring to
CAZAC-based sequences of the same length typically have good cross-correlation properties (low cross-correlation values), which is important in order to minimize the impact of mutual interference in synchronous communication system and improve their reception performance. It is well known that ZC sequences of length L have optimal cross-correlation of √{square root over (L)}. However, this property does not hold when truncation or extension is applied to ZC sequences or when CAZAC-based sequences are generated through computer search. Moreover, CAZAC-based sequences of different lengths have a wide distribution of cross-correlation values and large values can frequently occur leading to increased interference.
The impact of large cross-correlations on the reception reliability of signals constructed from CAZAC-based sequences can be mitigated through sequence hopping. Pseudo-random hopping patterns are well known in the art and are used for a variety of applications. Any such generic pseudo-random hopping pattern can serve as a reference for sequence hopping. In this manner, the CAZAC-based sequence used between consecutive transmissions of ACK/NAK, CQI, or RS signals in different SC-FDMA symbols, can change in a pseudo-random pattern and this reduces the probability that CAZAC-based generated signals will be subjected to large mutual cross-correlations and correspondingly experience large interference over their transmission symbols.
There is therefore a need for supporting hopping of CAZAC-based sequences with minimum implementation complexity in order to reduce the average interference among CAZAC-based sequences.
There is another need for assigning CAZAC-based sequences through planning in different Node Bs and different cells of the same Node B in a communication system.
Finally, there is a need for minimizing the signaling overhead for communicating sequence hopping parameters or the sequence assignment (planning) from the serving Node B to the UEs.
The present invention has been made to address at least the above-mentioned problems and/or disadvantages and to provide at least the advantages described below. Accordingly, an aspect of the present invention provides an apparatus and method for supporting CAZAC-based sequence hopping or sequence planning.
Another aspect of the present invention enables CAZAC-based sequence hopping with minimum implementation complexity at a UE transmitter and a Node B receiver by applying the same hopping pattern to the sequences used for signal transmission in all possible channels.
Additionally, an aspect of the present invention enables CAZAC-based sequence hopping with minimum implementation complexity at a UE transmitter and a Node B receiver by limiting the total number of sequences in the sets of sequences for the possible resource block allocations to be equal to the smallest number of sequences obtained for one of the possible resource block allocations.
A further aspect of the present invention enables CAZAC-based sequence hopping and planning with minimum signaling overhead for communicating the sequence allocation parameters from the serving Node B to UEs.
According to one aspect of the present invention, a method is provided for transmitting a signal including a reference signal by a UE in a wireless communication system. The method includes receiving, from a base station, information indicating whether group hopping or sequence hopping for the reference signal is applied or not; transmitting, to the base station, the signal using a first sequence based on a plurality of sequence groups if the group hopping is applied; and transmitting, to the base station, the signal using a second sequence to which the sequence hopping is applied if the sequence hopping is applied and a number of resource blocks allocated for the second sequence is greater than or equal to a predetermined value
According to another aspect of the present invention, a UE is provided for transmitting a signal including a reference signal in a wireless communication system. The UE includes a transceiver; and a controller coupled with the transceiver and configured to receive, from a base station, information indicating whether group hopping or sequence hopping for the reference signal is applied or not, transmit, to the base station, the signal using a first sequence based on a plurality of sequence groups if the group hopping is applied, and transmit, to the base station, the signal using a second sequence to which the sequence hopping is applied if the sequence hopping is applied and a number of resource blocks allocated for the second sequence is greater than or equal to a predetermined value.
According to another aspect of the present invention, a method is provided for receiving a signal including a reference signal by a base station in a wireless communication system. The method includes transmitting information indicating whether group hopping or sequence hopping for the reference signal is applied or not; receiving, from a UE receiving the information, the signal using a first sequence based on a plurality of sequence groups if the group hopping is applied; and receiving, from the UE, the signal using a second sequence to which the sequence hopping is applied if the sequence hopping is applied and a number of resource blocks allocated for the second sequence is greater than or equal to a predetermined value.
According to another aspect of the present invention, a base station is provided for transmitting a signal including a reference signal in a communication system. The base station includes a transceiver; and a controller coupled with the transceiver and configured to transmit information indicating whether group hopping or sequence hopping for the reference signal is applied or not, receive, from a UE receiving the information, the signal using a first sequence based on a plurality of sequence groups if the group hopping is applied, and receive, from the UE, the signal using a second sequence to which the sequence hopping is applied if the sequence hopping is applied and a number of resource blocks allocated for the second sequence is greater than or equal to a predetermined value.
The above and other aspects, features and advantages of the present invention will be more apparent from the following detailed description when taken in conjunction with the accompanying drawings, in which:
Embodiments of the present invention are described in detail with reference to the accompanying drawings. The same or similar components are designated by the same or similar reference numerals although they are illustrated in different drawings. Detailed descriptions of constructions or processes known in the art may be omitted to avoid obscuring the subject matter of the present invention.
Additionally, although the present invention assumes a SC-FDMA communication system, it also applies to all Frequency Division Multiplexing (FDM) systems in general and to Orthogonal Frequency Division Multiple Access (OFDMA), Orthogonal Frequency Division Multiplexing (OFDM), Frequency Division Multiple Access (FDMA), Discrete Fourier Transform (DFT)-spread OFDM, DFT-spread OFDMA, Single-Carrier OFDMA (SC-OFDMA), and Single-Carrier OFDM in particular.
Methods of the embodiments of the invention solve problems related to the need for enabling sequence planning or sequence hopping for CAZAC-based sequences while minimizing the respective implementation complexity at a UE transmitter and at a Node B receiver and minimizing the signaling overhead required for configuring the sequence planning or the sequence hopping patterns.
As discussed in the foregoing background, the construction of CAZAC-based sequences may be through various methods. The number of sequences provided with cyclic extension or truncation of Zadoff-Chu (ZC) sequences depends on the sequence length. Some indicative values for corresponding RB allocations are shown in Table 1 where one RB is assumed to consist of 12 sub-carriers.
Since the number of CAZAC-based sequences depend on the corresponding sequence length, a number of sequences of larger length can be associated with each sequence of smaller length. For example, referring to Table 1, for cyclic extension of ZC sequences, each of the 10 sequences of length 12 can be associated (one-to-one mapping) with a set of 7 sequences of length 72 (since there are 70 sequences of length 72). Moreover, the number of sequences for small RB allocations, such as 1 RB or 2 RBs, is the smallest and defines the constraints in allocating different sequences in neighboring cells and Node Bs (a Node B may comprise of multiple cells). For these sequences, if a pseudo-random hopping pattern applies for their transmission, the same sequence may often be used in neighboring cells resulting to full interference of transmissions and associated degradation in the reception reliability of signals transmitted through the use of CAZAC-based sequences.
To mitigate the sequence allocation problem resulting from the small number of available CAZAC-based sequences for the smaller RB allocations, CAZAC sequences constructed through computer searches can be used as a larger number of sequences can be obtained in this manner. However, unlike CAZAC-based sequences obtained from cyclic extension or truncation of ZC sequences, a closed form expression for computer generated CAZAC sequences does not exist and such sequences need to be stored in memory. For this reason, their use is typically confined to small RB allocations where the shortage of CAZAC-based sequences is most acute. For the larger RB allocations, CAZAC-based sequences are generated through the implementation of a formula such as the one described for the generation of ZC sequences. About 30 computer generated CAZAC sequences can be obtained for 1 RB allocations and by obtaining the same number of sequences for 2 RB allocations, sequence planning and sequence hopping is then constrained by the number of sequences for 1, 2, or 3 RB allocations. In an embodiment this number is 30.
The invention considers cyclic extension of ZC sequences for the generation of CAZAC-based sequences for allocations equal to or larger than 3 RBs and computer generated CAZAC sequences for allocations of 1 RB or 2 RBs.
An embodiment of the invention assumes that PUCCH transmissions from a UE occupy one RB and allocations larger than 1 RB are used only for the PUSCH, which, in the embodiment, contains 2 RS transmission symbols per sub-frame. Therefore, only one sequence hopping opportunity exists within a PUSCH sub-frame.
For packet retransmissions based on Hybrid Automatic Repeat reQuest (HARQ), as it is known in the art, the interference experienced by the CAZAC-based sequence used for RS transmission will be different among retransmissions as different RB allocations (different size or different BW position leading to partial overlapping between two CAZAC sequences) are likely to be used for UEs in interfering cells during a packet retransmission. Moreover, the channel characteristics are likely to be different between retransmissions and this also leads to different cross-correlation characteristics among interfering CAZAC sequences. Therefore, extending the number of sequences for each RB allocation to more than 2 is of little or no benefit to the PUSCH reception quality.
For the above reasons, the invention considers the use of only a sub-set of sequences from the total set of available ones. These sequences may be fixed and selected according to their cross-correlation and/or according to their cubic metric values where small values are desired in both cases. Limiting the number of sequences that can be used for hopping for the larger RB allocations, reduces the number of sequence groups and corresponding hopping patterns that need to be supported and therefore reduces the complexity and signaling overhead to support sequence hopping.
Considering that the limitation of sequences, and therefore the limitation in hopping patterns, occurs for the smaller RB allocations and that an embodiment of the invention assumes 2 RS per PUSCH sub-frame, one sequence for small RB allocations can be associated with two sequences for the larger RB allocations. As the embodiment assumes 30 computer generated CAZAC sequences for 1 RB and 2 RB allocations, the grouping of sequences for different RB allocations results in 30 groups where each group includes one CAZAC-based sequence for allocations up to 5 RBs and two CAZAC sequences for allocations larger than 5 RBs (Table 1). The sequences in each group are different.
The grouping principle is summarized in Table 2. In an embodiment of the present invention, there are 30 sequence groups (one-to-one mapping is assumed between each sequence group and each sequence in a set of 30 sequences). Considering the number of available sequences from Table 1, it becomes apparent that only a sub-set of sequences is used for allocations of 4 RBs (30 out of set of 46 sequences are used), 5 RBs (30 out of set of 58 sequences are used), and 6 RBs or larger (60 out of a set of 70 or more sequences are used). As previously mentioned, the sub-set of these sequences may be fixed and selected for its cross-correlation and/or cubic metric properties. Therefore, the number of sequence groups is equal to the smallest sequence set size, which in the embodiment is equal to 30, with each group containing one sequence for allocations up to 5 RBs and two sequences for allocations larger than 5 RBs, and each set containing 30 sequences for allocations smaller than or equal to 5 RBs and 60 sequences for allocations larger than 5 RBs.
The invention considers that the CAZAC sequence allocation to cells or Node Bs is either through planning or hopping. If both sequence planning and sequence hopping could be supported in a communication system, the UEs are informed of the selection for planning or hopping through a respective indicator broadcasted by the Node B (one bit is needed to indicate whether sequence planning or sequence hopping is used).
Sequence planning assigns each of the 30 groups of sequences, with each group containing 1 sequence for allocations up to 5 RBs and 2 sequences for allocations larger than 5 RBs, to neighboring cells and Node Bs so that the geographical separation between cells using the same group of sequences is preferably maximized. The assignment may be explicit through broadcasting of group sequence number, which in an embodiment having 30 sequence groups can be communicated through the broadcasting of 5 bits, or it can be implicit by associating the group sequence number to the cell identity. This is equivalent to specifying one sequence from the set of sequences with the smallest size (because a one-to-one mapping between each of these sequences and each group of sequences is assumed). In the embodiment this can be either of the sets of 30 sequences corresponding to 1, 2, or 3 RB allocations.
This principle is illustrated in
Sequence hopping may still apply between the pair of sequences for allocations of 6 RBs or larger during the two RS transmission symbols of the PUSCH sub-frame as illustrated in
If sequence planning is not used, the invention assumes that sequence hopping applies instead for the sequences used for RS transmission between successive transmission instances for any possible RB allocation. The RS transmission in the two symbols of the PUSCH sub-frame in
In
Sequence hopping for both PUCCH signals (ACK/NAK, CQI, and RS) and the PUSCH RS can also be supported and the respective signaling is subsequently considered.
In order to maximize the PUCCH UE multiplexing capacity, all cyclic shifts (CS) of a CAZAC sequence are assumed to be used for the PUCCH transmission within a cell thereby necessitating the use of different CAZAC sequences in different cells (
Without SDMA or with SDMA applied to a maximum of 4 UEs per cell, assuming that 12 CS can be used, the same CAZAC sequence may be used among the adjacent cells of the same Node B with different CS used to discriminate the PUSCH RS in each cell as shown in
With SDMA applied to more than 4 UEs per cell (with 3 cells per Node B), it may not be possible to rely on the use of different CS to separate the PUSCH RS from UEs in different cells. Then, a different CAZAC-based sequence needs to be used per cell as is the case for the PUCCH (
If different CAZAC-based sequences are used for the PUSCH RS transmission in the cells of a Node B (
It should be noted that PUCCH signals (RS and/or ACK/NAK and/or CQI) may allow for more sequence hopping instances within a sub-frame (symbol-based sequence hopping), but the same hopping pattern can still apply as it only needs to have a longer time scale for the PUSCH RS. If the sequence hopping for PUCCH signals is slot based and not symbol based, the PUSCH and PUCCH use the same sequence hopping patterns.
If the same CAZAC sequence is used for the PUSCH RS transmission in different cells of the same Node B (
The shift can be specified by a number of bits equal to the number of sequences for the RB allocation of PUCCH signals. If the PUCCH RB allocation is the smallest one corresponding to 1 RB, this number is identical to the number of sequence groups (in the embodiment, 5 bits are needed to specify one of the 30 sequences in a set of sequences or, equivalently, one of the 30 sequence groups). Alternatively, such signaling overhead can be reduced by limiting the range of the shift to only the sequences with indexes adjacent to the ones used for the by the first sequence in the hopping pattern applied to the RS transmission for the data channel. In that case, only 2 bits are needed to indicate the previous, same, or next sequence.
The above are illustrated in
While the present invention has been shown and described with reference to certain embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present invention as defined by the appended claims.
This application is a Continuation Application of, and claims priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 15/399,396, filed in the U.S. Patent and Trademark Office (USPTO) on Jan. 5, 2017, which is a Continuation Application of, and claims priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 14/827,646, filed in the USPTO on Aug. 17, 2015, issued as U.S. Pat. No. 9,572,164 on Feb. 14, 2017, which is a Continuation Application of, and claims priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 13/861,845, filed in the USPTO on Apr. 12, 2013, issued as U.S. Pat. No. 9,113,471 on Aug. 18, 2015, which was a Continuation Application of, and claims priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 12/203,432, filed in the USPTO on Sep. 3, 2008, issued as U.S. Pat. No. 8,441,991 on May 14, 2013, which claims priority under 35 U.S.C. § 119(e) to U.S. Prov. App. No. 60/969,659, filed in the USPTO on Sep. 3, 2007, the entire content of each of which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5881095 | Cadd | Mar 1999 | A |
5937002 | Andersson | Aug 1999 | A |
6510172 | Miller | Jan 2003 | B1 |
7068631 | Eriksson | Jun 2006 | B2 |
7388897 | Salmenkaita | Jun 2008 | B2 |
7564910 | Kostic | Jul 2009 | B2 |
7653141 | Mo | Jan 2010 | B2 |
7724777 | Sutivong | May 2010 | B2 |
7778151 | Bertrand | Aug 2010 | B2 |
7796695 | Lee | Sep 2010 | B2 |
7852746 | Jalali | Dec 2010 | B2 |
7912092 | Kowalski | Mar 2011 | B2 |
8036166 | Tiirola et al. | Oct 2011 | B2 |
8432979 | Tiirola et al. | Apr 2013 | B2 |
8625652 | Chen | Jan 2014 | B2 |
20020177447 | Walton et al. | Nov 2002 | A1 |
20020194555 | Gueguen | Dec 2002 | A1 |
20040156341 | Cheng et al. | Aug 2004 | A1 |
20040258134 | Cho et al. | Dec 2004 | A1 |
20070140105 | Coon | Jun 2007 | A1 |
20070171889 | Kwon et al. | Jul 2007 | A1 |
20070183386 | Muharemovic et al. | Aug 2007 | A1 |
20070230600 | Bertrand et al. | Oct 2007 | A1 |
20070291696 | Zhang et al. | Dec 2007 | A1 |
20080165893 | Malladi et al. | Jul 2008 | A1 |
20080205375 | Onggosanusi et al. | Aug 2008 | A1 |
20080225785 | Wang et al. | Sep 2008 | A1 |
20080225791 | Pi et al. | Sep 2008 | A1 |
20080298433 | Tiirola et al. | Dec 2008 | A1 |
20090046645 | Bertrand et al. | Feb 2009 | A1 |
20100067464 | Higuchi | Mar 2010 | A1 |
20100075760 | Shimabukuro et al. | Mar 2010 | A1 |
20100111142 | Iwai et al. | May 2010 | A1 |
20100210274 | Iwai et al. | Aug 2010 | A1 |
20100254434 | Iwai et al. | Oct 2010 | A1 |
20100272022 | Iwai | Oct 2010 | A1 |
20110182266 | Iwai et al. | Jul 2011 | A1 |
20170117995 | Papasakellariou | Apr 2017 | A1 |
Number | Date | Country |
---|---|---|
2822316 | Sep 2002 | FR |
2001514811 | Sep 2001 | JP |
2006325264 | Nov 2006 | JP |
1020050085462 | Aug 2005 | KR |
2288538 | Jan 2006 | RU |
2290764 | Jan 2006 | RU |
WO 2006031239 | Mar 2006 | WO |
WO 2008111317 | Sep 2008 | WO |
WO 2008155904 | Dec 2008 | WO |
WO 2008155907 | Dec 2008 | WO |
WO 2009019878 | Feb 2009 | WO |
WO 2009057302 | May 2009 | WO |
WO 2009120828 | Oct 2009 | WO |
Entry |
---|
NTT DoCoMo, Ericsson, Mitsubishi Electric, NEC, Sequence Hopping and Cyclic-Shift Value Hopping for Uplink Reference Signal in E-UTRA, R1-071643, 3GPP TSG RAN WG1 Meeting #48bis, Mar. 26-30, 2007. |
Ericsson, “Uplink Reference Signals”, R1-063128, TSG-RAN WG1 #47, Nov. 6-10, 2006. |
Huawei, “Sequence Grouping Rule for UL DM RS”, R1-073518, 3GPP TSG RAN WG1 Meeting #50, Aug. 20-24, 2007. |
Texas Instruments, “Uplink Reference Signal Sequence Assignments in E-UTRA”, R1-073419, 3GPP TSG RAN WG1 #50, Aug. 15, 2007. |
Ericsson, “PUSCH RS”, R1-073048, TSG-RAN WG1 #49bis, Jun. 25, 2007. |
Motorola, E-UTRA Uplink Reference Signal Planning and Hopping Considerations, Agenda Item: 7.2.2, R1-073755, 3GPP TSG RAN1#50, Aug. 15, 2007. |
NEC Group, “Assignment of Base Sequence Group for UL DM RS”, R1-073453, 3GPP TSG RAN WG1 Meeting #50, Aug. 15, 2007. |
Motorola, Uplink Reference Signal Planning Aspects, Agenda Item: 5.11.2, R1-072684, 3GPP TSG RAN1#49bis, Jun. 20, 2007. |
Chinese Office Action dated Oct. 8, 2014 issued in counterpart application No. 201210359561.1. |
Korean Office Action dated Jan. 13, 2015 issued in counterpart application No. 10-2014-7026499. |
Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA) and Evolved Universal Terrestrial Radio Access Network (E-UTRAN); Overall Description, Stage 2, Release 8, 3rd Generation Partnership Project; 3 GPP TS 36.300 V8.1.0, Jun. 2007. |
Number | Date | Country | |
---|---|---|---|
20190245660 A1 | Aug 2019 | US |
Number | Date | Country | |
---|---|---|---|
60969659 | Sep 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15399396 | Jan 2017 | US |
Child | 16390625 | US | |
Parent | 14827646 | Aug 2015 | US |
Child | 15399396 | US | |
Parent | 13861845 | Apr 2013 | US |
Child | 14827646 | US | |
Parent | 12203432 | Sep 2008 | US |
Child | 13861845 | US |