PCI partition and allocation for cellular network

Information

  • Patent Grant
  • 9838932
  • Patent Number
    9,838,932
  • Date Filed
    Wednesday, October 30, 2013
    11 years ago
  • Date Issued
    Tuesday, December 5, 2017
    7 years ago
Abstract
Generally discussed herein are systems and apparatuses that can implement Physical Cell Identity assignments that reduce collision or confusion of small cell identities at User Equipment and techniques for using the same. According to an example apparatus a device can be configured to estimate a location of the small cell eNodeB based on at least one of Global Positioning System (GPS) coordinates of the location of the small cell eNodeB and an RSRP measured at the small cell eNodeB, determine if the location of the small cell eNodeB is within a first region or a second region of a large cell transmission area, wherein the first and second regions do not overlap, and in response to determining which region the small cell eNodeB is deployed in, assign a PCI code from a respective group of available PCI codes to the small cell eNodeB.
Description
TECHNICAL FIELD

Examples generally relate to Physical Cell Identity (PCI) and more specifically to avoiding collision or confusion between User Equipment (UE) or base stations in a cellular network (e.g., a Long Term Evolution (LTE) network).


TECHNICAL BACKGROUND

PCI can help UEs distinguish different cells from each other by distinguishing different transmitters. In LTE, each cell is assigned a PCI upon deployment. The range of PCI is currently from 0-503. Assigning PCI to a large number of cells can create a problem because no two cells in range of a UE should be assigned the same PCI. If a UE receives communications from two cells with the same PCI, a PCI confusion or PCI collision can occur. These confusions or collisions can render the UE unable to identify the cell correctly. The number of small cells (e.g., micro, pico, or femto cells) is expected to increase in the future, thus exacerbating the problem.


A collision can occur when a UE is within range of two cells that each has the same PCI assigned and are simultaneously broadcasting to the UE. A confusion can occur when the UE is within range of two cells that each have the same PCI and the UE cannot distinguish between the two cells. Thus, to avoid or reduce the number of collisions a PCI should be unique in the area that a given cell covers, and to avoid or reduce the number of confusions a cell should not have neighbor cells with identical PCIs. Confusion can cause handover procedures from one cell to another cell to fail.





BRIEF DESCRIPTION OF THE DRAWINGS

In the drawings, which are not necessarily drawn to scale, like numerals may describe similar components in different views. Like numerals having different letter suffixes may represent different instances of similar components. The drawings illustrate generally, by way of example, but not by way of limitation, various embodiments discussed in the present document.



FIG. 1 illustrates an example of a Heterogeneous cellular Network (HetNet).



FIG. 2 illustrates an example of a partitioned HetNet that is configured to reduce collisions or confusions.



FIG. 3 illustrates an example of a technique for reducing the number of confusions or collisions experienced by a UE in a cellular network.



FIG. 4 is a schematic of an example of an electronic system, such as can be used in an LTE device, such as a large or small cell eNodeB, an Operations, Administration, or Maintenance (OAM) device, or a UE.





DESCRIPTION OF EMBODIMENTS

Examples in this disclosure relate to apparatuses and systems that include collision or confusion avoidance in a cellular network (e.g., an LTE network). Examples also relate to techniques of using and implementing the collision or confusion avoidance mechanisms.


The following description includes terms, such as first, second, etc. that are used for descriptive purposes only and are not to be construed as limiting. The examples of an apparatus or article described herein can be manufactured, used, or shipped in a number of positions and orientations.


Allocating PCI with only 504 unique PCI identifiers in a cell without a collision occurring can be challenging. With the number of small cells expected to be deployed in future generations of cellular networks (e.g., LTE Rel-12 and beyond) increasing, allocating PCI with only 504 unique PCI identifiers in a cell without a collision occurring can be challenging.



FIG. 1 shows an example of how a collision can occur. In the example of FIG. 1, a HetNet 100 can include two large cells 102A and 102B (e.g., macro cells or Primary cells (Pcells)), with each large cell 102A and 102B including a respective small cell 104A and 104B (e.g., micro cells, pico cells, or femto cells, or Secondary cells (Scells)). Each of the large cells 102A and 102B and small cells 104A and 104B can include a respective base station 110A, 110B, 110C, and 110D (e.g., enhanced Node B (eNodeB)). The HetNet 100 can include an Operations, Administration, and Maintenance device 108 communicatively coupled to the base stations 110A-110D. The small cells 104A or 104B can be communicatively coupled to the OAM 108 through the nearest, respective large cell 102A and 102B, such as to communicate to the OAM 108 by transmitting a communication from a base station 110C or 110D to a base station 110A or 110B, respectively, which can forward the communication to the OAM 108.


The small cells 104A and 104B are physically close to each other and each has the same PCI code of “1” in this example. The UE 106 situated between the two small cells 104A may not be able to distinguish between the two small cells 104A and 104B if it is within range of both small cells 104A and 104B simultaneously, because they have the same PCI. This is what is known as PCI collision.


As used herein, “large cell” refers to what is commonly known as a macro cell. Macrocells can have a transmission area of between about 1 kilometers and 30 kilometers, or even larger. As compared to “small cells”, large cells require more electric power to operate. As used herein, “small cell” refers to what are commonly known as microcells, picocells, and femtocells, or cells that are not considered “large cells” because of their transmission area or power requirements. A microcell can have a transmission area of between about 200 meters and 2 kilometers, a picocell can have a transmission area of between about 4 and 200 meters, and a femtocell can have a transmission area even smaller than that of a picocell. The large cell can provide the main coverage area of the cellular network and the small cell can complement the coverage area, such as to extend the coverage area or provide hot spots with relatively good cellular network connectivity and bandwidth in their transmission area. Thus, a small cell can reside within the large cell and can serve an area that is substantially smaller than the area served by the large cell.


In the current Third Generation Partnership Project (3GPP) specification, there are two PCI selection mechanisms: 1) centralized PCI assignment and 2) distributed PCI assignment. In centralized PCI assignment, the OAM device 108 signals a specific PCI value and a base station 110 (note that 110 as used herein, refers to base stations generally) can assign this value to the given cell. In distributed PCI assignment, the OAM device 108 signals a list of PCI values and the base station 110 can restrict this list by removing PCIs that are or have been reported by a UE 106 or are or have been reported by as used by a neighboring base station 110, such as over an x2 interface. Then the base station 110 can select a PCI value for the cell (e.g., randomly) from the remaining list of PCIs.


This disclosure proposes a number of PCI partitioning and allocation schemes that can reduce collisions or confusions. Available PCI codes can be split into N groups, such as an integer number of equal or unequal size groups. For example, assume there are 504 codes available for allocation to small cells 104 (note that 104 as used herein refers to small cells generally) in a given large cell transmission area. In a partition of N=4 groups, the 504 codes, {0-503}, can be split into group 1={0-150}; group 2={151-303}, group 3={304-403}; and group 4={404-503}. When a small cell 104 is deployed, the PCI assignment can be based on (e.g., a function of) a Reference Signal Received Power (RSRP) measured at a small cell 104 base station 110. The reference signal can be sent from a large cell 102. Note that “102” as used herein refers to large cells generally. As used herein “when” can mean “at or around the time”, “after”, or “in response to” as is appropriate for the context of usage.


A large cell 102 can include an RSRP map (e.g., a map that depicts generally the different areas of the large cell 102 transmission area that include relatively weak, and relatively strong, etc. RSRP). An OAM device 108 can be responsible for dictating the partitioning of the PCI codes relative to the RSRP map. Each partition of the PCI codes can map to a region on the RSRP map. When a small cell 104 is deployed, the map can be used to help determine the PCI code assignment. A PCI code can be picked at random for assignment or a fixed assignment protocol can be used (e.g., the PCI codes can be assigned in a predetermined order, such as alphabetical, numerical, alpha-numeric, or other order). A Global Positioning System (GPS) can help verify that the small cell 104 is in a particular location. Alternatively, the GPS can be used to determine the location of the deployed small cell 104, instead of using the RSRP value measured at the small cell 104 base station 110.



FIG. 2 shows an example of a network 200 that can include a number of large cells 102C, 102D, 102E, 102F, 102G, 102H, and 102I, some of which are contiguous with one another. In this example, all large cells 102C-102I have a region “A” (the region of the large cell 102C-102I that extends from the center of the respective large cell 102C-102I to the dotted line in the respective large cell 102C-102I). It is assumed, for simplicity, that a base station 110 (see FIG. 1) is positioned at the center of each large cell 102. Region “A” can correspond to a region in which a small cell 104 deployed therein is likely to measure an RSRP that is relatively high (e.g., an RSRP signal that is greater than one or more specified thresholds). This can be due to the base station 110 being relatively close to the small cell 104 when the small cell 104 is deployed in region “A”. Note that small cell 104D is deployed in region “A” of large cell 102C.


The small cells 104 located in the outer region, the region from the respective dotted line to the respective outer edge of the large cell 102 (e.g., region “B” of large cell 102D, 102E, and 102I; region “C” of large cell 102C, 102G, and 102H; and region “D” of large cell 102F) are likely to measure a relatively low RSRP (e.g., an RSRP that is less than or equal to a specified threshold or generally less than an RSRP measurement made from a base station 110 deployed in a region “A”). Note that small cell 104C is located in the outer region “C” of large cell 102C. A small cell 104 located in these large cells 102C-102I can be assigned, for example, a PCI code from the code group “1” if they are determined to reside in region “A”, a PCI code from the code group “2” if they are determined to reside in region “B”, group “3” if they are determined to reside in region “C”, group “4” if they are determined to reside in region “D”. In the example of FIG. 2, no two neighboring large cell 102C-102I regions (e.g., edges) are allocated the same group of PCI codes. The PCI allocation in this example can be relatively collision free, such as if the PCI codes are only used once.


Other configurations can be used in other examples. For example, each cell can be partitioned into fewer or more regions. The fewer or more regions can each correspond to specific ranges of RSRP values received at the base station 110, specific GPS coordinates received, or a combination thereof. It can be advantageous to configure two neighboring regions to be disjoint (e.g., non-overlapping) or be allocated PCI groups that are disjoint (e.g., do not overlap or contain a same element). Using such a configuration can help reduce collisions or confusions experienced by a UE 106.


The allocation or assignment of PCI codes can be geographically based, such as by using GPS coordinates to allocate or assign PCI codes based on geographic location. A combination of GPS coordinates corresponding to a location of a small cell 104 and RSRP received at the base station can be used to allocate to a small cell 104 a PCI code from a specific group of PCI codes.


In one or more embodiments, a base station 110 (e.g., a large cell eNodeB or a small cell eNodeB) or OAM 108 can determine if the RSRP value is greater than a specified threshold. In response to determining the RSRP is greater than the threshold, the base station 110 or OAM 108 can choose a PCI code (e.g., randomly or otherwise) from a group of available PCI codes and the base station 110 or OAM 108 can assign a specific PCI code to the deployed small cell 104 base station 110.


In the example of FIG. 2, after, or during, small cell 104 deployment and in response to determining the RSRP is greater than a specified threshold, the base station 110 or OAM 108 can determine that the small cell 104 is in region “A” (i.e. the region from the center of the large cell 102C, 102D, 102E, 102F, 102G, 102H, or 102I to the dotted line within the respective cell) and can assign a PCI code from a predetermined set of PCI codes allocated for that region to the small cell 104. In the example of FIG. 2, all regions labeled “A” can have small cells 104 with PCI codes allocated from the same group of PCI codes. That is, for example, region “A” of large cell 102C can include small cells allocated with a PCI code from group “1”, region “A” of large cell 102B can include small cells allocated with PCI codes from group “1”, and so on.


If the received RSRP measurement is less than the specified threshold, the respective large cell 102C-102I can assign a PCI value from a different group of PCI codes that corresponds to a region further from the center of the cell or outside of region “A”. In FIG. 2 each of these regions is labeled “B”, “C”, and “D”. These regions each extend from the dotted line to the periphery of their respective large cell 102C-102I. Note that RSRP can be used to accomplish this assignment because the RSRP generally decreases as the reference signal received traverses a further distance, which generally corresponds to the cell being further from the base station.


By allocating different PCI code groups to the outer regions (e.g., “B”, “C”, and “D”) and configuring adjacent outer regions to include different PCI code groups (e.g., in FIG. 2, region “B” is not contiguous with any other region “B”, region “C” is not contiguous with any other region “C”, and region “D” is not contiguous with any other region “D”), the likelihood of having a collision or confusion at a UE can be reduced. The likelihood can be further reduced by having a minimum distance between two regions that are allocated the same PCI code group. In the example of FIG. 2, the minimum distance between like PCI code groups is a large cell edge length.


In one or more embodiments, if a small cell 104 is determined to be within the region “A” of large cell 102C, 102G, or 102H, a PCI code from the group including PCI codes from groups “1”, “2”, and “4” can be selected and assigned to the small cell base station. In these embodiments, group “3” can be assigned to small cells 104 deployed in the outer region “C” of the large cells 102C, 102G, and 102H. Similar PCI group allocations and assignments can be made in the other large cells 102D, 102E, 102F, and 102I. If a small cell 104 is determined to be within the region “A” of large cell 102D, 102E, or 102I, a PCI code from the group including PCI codes from groups “1”, “3”, and “4” can be selected and assigned to the small cell 104 base station 110. In these embodiments, group “2” can be assigned to small cells 104 deployed in the outer region “B” of the large cells 102D, 102E, and 102I. If a small cell 104 is determined to be within the region “A” of large cell 102F a PCI code from the group including PCI codes from groups “1”, “2”, and “3” can be selected and assigned to the small cell 104 base station 110. In these embodiments, group “4” can be assigned to small cells 104 deployed in the outer region “D” of the large cell 102F.


Since no two neighboring (e.g., contiguous or adjacent) large cells 102, of the example shown in FIG. 2, have the same group of available PCI codes assigned to outer regions thereof, the system can be relatively or completely collision and confusion free, such as in an ideal case (e.g., where there are no large cells that are reusing PCI codes because there are too many small cells deployed therein).


When the group of available PCI codes has become the empty set, previously assigned PCI codes may be used again. In such cases, a collision or confusion may occur. By mapping where each PCI code is assigned, such as in the OAM 108 or a base station 110, a repeat PCI code can be intelligently selected so as to reduce the risk of collision or confusion. One such technique of assigning a repeat PCI code is to assign a PCI code previously assigned to a small cell 104 that is outside the transmission area or a small cell 104 that is a minimum distance away from the small cell that is being deployed.


There could be several approaches to allocating a PCI code to a small cell 104. The approach can vary depending on which entity determines the PCI code for the small cell 104.


If a large cell 102 base station 110 assigns the PCI code to the small cell 104 base station 110, then the following techniques can be used. After the small cell 104 powers on, it can operate as if it is a normal UE. The small cell 104 base station 110 can attach to a nearby large cell 102 (e.g., the closest large cell 102). In one or more embodiments, a relay can be used. The small cell 104 base station 110 can indicate to the large cell 102 base station 110 that it is the small cell 104 base station 110.


The small cell 104 base station 110 can measure an RSRP of a reference signal received from the large cell 102. RSRP can be determined based on a single received reference signal, an average of a plurality of received reference signals, or other method of determining RSRP. Measuring the RSRP can be done in a way so as to account for an anomaly in the received reference signal. The small cell 104 base station 110 can send a measurement report including RSRP of the reference signal(s). If possible, the small cell 104 base station 110 can also send the measurement report including RSRP of the neighboring small cells 104.


The large cell 102 can use the RSRP map and determine the PCI group based on the RSRP value received from the small cell 104. The large cell 102 can send the PCI code (e.g., randomly chosen from the group) to the small cell 104. Alternatively, the large cell 102 can send a list of available PCI codes to the small cell 104. The small cell 104 base station 110 can choose one of the PCI codes (e.g., randomly). The small cell 104 can indicate to the large cell 102 which PCI code was chosen. The large cell 102 can mark the PCI as used. The large cell 102 can relay to the OAM 108 which PCI code was used. The PCI code that was chosen may not be used again until all the PCI codes in the respective group have been used. The small cell 104 base station 110 can reconfigure and operate as a base station 110 (e.g., instead of as a UE 106) with the assigned PCI code.


If a small cell 104 base station 110 assigns the PCI code to itself, then the following techniques can be used. After the small cell 104 base station 110 powers on, it can register to OAM 108. The small cell 104 base station 110 can send its location information to the OAM 108. Alternatively, the small cell 104 can measure RSRP from multiple large cell 102 base stations 110 and determine which base station 110 is the closest or has the highest RSRP measurement.


The OAM 108 can provide a group of available PCI codes that correspond to the location information the small cell 104 has sent. The group of available PCI codes in each group can be PCI codes not yet assigned to other small cells 104. The OAM 108 can provide one or more thresholds to the small cell 104. The OAM 108 can indicate to the small cell 104 which group of available PCI codes corresponds to a respective range of locations or a respective range of RSRP measurements. For example, the OAM 108 can indicate that if the RSRP measurement is less than a first threshold, then the small cell 104 is to choose a PCI code from group “1”, and if the RSRP measurement is greater than or equal to the first threshold, then the small cell is to choose a PCI code from group “3”.


The small cell 104 can measure an RSRP of a reference signal from the large cell 102. Based on the measurement result, the small cell 104 can select the appropriate group of available PCI codes. If there are multiple PCIs in the selected group, the small cell 104 can choose one of them randomly. The small cell 104 can measure the RSRP when it has dual Radio Frequency (RF) capability to receive the reference signal from the large cell 102 base station 110 or when the small cell 104 base station 110 operates its own frequency carrier. If the small cell 104 base station 110 does not have the dual RF capability or the ability to operate its own frequency carrier, the small cell 104 base station 110 can select the group, and the corresponding PCI code, based on an RSRP measurement from a neighboring cell, such as from a UE 106 or base station 110 within the transmission area of the small cell 104 base station 110 that can measure the RSRP of the neighboring cell. Alternatively, the small cell 104 base station 110 can estimate the RSRP based on its location (e.g., GPS coordinates) or the location of a large cell 102 base station 110.


If an OAM device 108 assigns the PCI code to the small cell 104 base station 110, then the following techniques can be used. When the small cell 104 base station 110 powers on, the small cell 104 can send RSRP information to OAM 108. If the small cell 104 cannot measure RSRP, the small cell 104 can send its GPS location to the OAM 108. The OAM 108 can look up the small cell 104 location relative to the large cell 102 that the small cell 104 base station 110 will be communicating, either directly or indirectly, with. A group of available PCI codes can be selected from a mapping table. The OAM 108 can send a PCI code from the group of available PCI codes to small cell 104, such as a randomly selected PCI code. The OAM 108 can mark which PCI code was used, such as to help avoid another small cell 104 base station 110 being assigned the same PCI. If the small cell 104 base station 110 does not have GPS capability, an RF chain (e.g., the capability to measure RSRP), or other means of determining its location, the OAM 108 can assign an unused PCI code from any of the groups of available PCI codes. The OAM 108 can send the selected PCI code to the large cell 102 base station 110, which can forward the PCI code to the small cell 104 base station 110.


Due to imperfect beam shape, there may be some overlapping that can cause a PCI collision. In that case, the regular procedure to resolve the PCI collision in the current specification can be performed. Such resolutions can include a UE 106 reporting the collision or confusion to a base station 110 and the base station 110 assigning a different PCI code to the small cell 104 or the base station 110 forwarding the collision or confusion report to the OAM 108 and the OAM 108 assigning a different PCI code to the small cell 104.



FIG. 3 is a block diagram of an example of a technique 300 to help reduce the number of PCI collisions or confusion in a cellular network. The method can include a PCI code to a small cell base station as a function of a location of the small cell base station. At 302, a location of a small cell base station can be estimated. The location estimation can be based on GPS coordinates of the small cell base station or an RSRP measured at the small cell base station. Estimating the location of the small cell base station can include comparing the RSRP to a first threshold. Estimating the location of the small cell base station can include comparing the RSRP to a second threshold. The second threshold can be less than the first threshold.


At 304, it can be determined if the location of the small cell base station is within a first region or a second region of a large cell transmission area. The first and second regions of the large cell transmission area can be disjoint or non-overlapping. The technique can include determining if the location of the small cell base station is within a third region of the large cell transmission area. The first, second, and third regions can be disjoint or non-overlapping. The first region can be a region of the large cell transmission area extending outward from a base station of the large cell. The second region can be a region of the large cell transmission area extending outward from an outer edge of the first region. The third region can be a region of the large cell transmission area extending outward from an outer edge of the second region.


At 306, if the small cell base station is determined to be in the first region, a PCI code from a first group of available PCI codes can be assigned to the small cell base station. The small cell base station can be determined to be within the first region if it is determined that the measured RSRP is greater than (or equal to) the first threshold. Assigning the PCI code from the first group of available PCI codes can include randomly choosing a PCI code from the first group of available PCI codes and assigning the randomly chosen PCI code to the small cell base station.


At 308, if the small cell base station is determined to be within the second region, a PCI code from a second group of available PCI codes can be assigned to the small cell base station. The first and second groups of available PCI codes can be disjoint. The small cell base station can be determined to be within the second region if it is determined that the measured RSRP is less than (or equal to) the second threshold. The small cell base station can be determined to be within the second region if it is determined that the measured RSRP is greater than (or equal to) the second threshold and less than the first threshold.


The small cell base station can be determined to be within the third region if it is determined that the RSRP is less than (or equal to) the second threshold.


The technique can include registering the small cell base station to an OAM device. The technique can include receiving the first threshold value from the OAM. The technique can include receiving the first and second sets of available PCI codes from the OAM. The technique can include indicating to the OAM device which PCI code was assigned.



FIG. 4 is a block diagram of a computing device, according to an example embodiment. One or more of the foregoing examples of UEs 106, base stations 110, OAMs 108, or other devices that is configured to allocate or partition PCI codes, may include a computing system, such as computing system 400 of FIG. 4. In one or more embodiments, multiple such computer systems are utilized in a distributed network to implement multiple components in a transaction based environment. An object-oriented, service-oriented, or other architecture may be used to implement such functions and communicate between the multiple systems and components. One example computing device in the form of a computer 410 may include a processing unit 402, memory 404, removable storage 412, and non-removable storage 414. Memory 404 may include volatile memory 406 and non-volatile memory 408. Computer 410 may include—or have access to a computing environment that includes—a variety of computer-readable media, such as volatile memory 406 and non-volatile memory 408, removable storage 412 and non-removable storage 414. Computer storage includes random access memory (RAM), read only memory (ROM), erasable programmable read-only memory (EPROM) & electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD ROM), Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium capable of storing computer-readable instructions. Computer 410 may include or have access to a computing environment that includes input 416, output 418, and a communication connection 420. The computer may operate in a networked environment using a communication connection to connect to one or more remote computers, such as database servers. The remote computer may include a personal computer (PC), server, router, network PC, a peer device or other common network node, or the like. The communication connection may include a Local Area Network (LAN), a Wide Area Network (WAN) or other networks.


Computer-readable instructions stored on a machine-readable storage device are executable by the processing unit 402 of the computer 410. A hard drive, CD-ROM, and RAM are some examples of articles including a non-transitory computer-readable medium. For example, a computer program 425 capable of providing instructions, which when executed by the processing unit 402 or other machine capable of executing the instructions, cause the processing unit to perform allocation or assignment of PCI based on a location of a small cell, such as a small cell that is being deployed. The instructions can be saved on a CD-ROM and loaded from the CD-ROM to a hard drive of the computer 410. The computer-readable instructions can allow the computer 410 (e.g., the processing unit 402) to implement the partition or assigning algorithm.


EXAMPLES AND NOTES

The present subject matter may be described by way of several examples.


Example 1 can include or use subject matter (such as an apparatus, a method, a means for performing acts, or a device readable memory including instructions that, when performed by the device, can cause the device to perform acts), such as can include or use an LTE device configured to assign a PCI code to a small cell eNodeB based on a location of the small cell eNodeB, wherein the LTE device can be configured to: (1) estimate a location of the small cell eNodeB based on at least one of Global Positioning System (GPS) coordinates of the location of the small cell eNodeB and an RSRP measured at the small cell eNodeB, (2) determine if the location of the small cell eNodeB is within a first region or a second region of a large cell transmission area, wherein the first and second regions do not overlap, (3) in response to determining the small cell eNodeB is within the first region, assign a PCI code from a first group of available PCI codes to the small cell eNodeB; and (4) in response to determining the small cell eNodeB is within the second region, assign a PCI code from a second group of available PCI codes to the small cell eNodeB, wherein the first group of PCI codes and the second group of PCI codes are disjoint.


Example 2 can include or use, or can optionally be combined with the subject matter of Example 1, to optionally include or use wherein the device is configured to perform at least one of: (1) estimate the location of the small cell eNodeB based on the RSRP measured at the small cell eNodeB, (2) compare the RSRP to a threshold, (3) in response to determining the RSRP is less than or equal to the threshold, determining the small cell eNodeB is within the second region, and (4) in response to determining the RSRP is greater than the threshold, determining the small cell eNodeB is within the first region.


Example 3 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-2, to optionally include or use wherein the LTE device is a large cell eNodeB.


Example 4 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-2, to optionally include or use wherein the LTE device is the small cell eNodeB, and the small cell eNodeB is further configured to perform at least one of: (1) register to an Operations, Administration, and Maintenance (OAM) device, receive the threshold value from the OAM, and receive the first and second sets of available PCI codes from the OAM.


Example 5 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-2, to optionally include or use wherein the LTE device is an Operations, Administration, and Maintenance (OAM) device.


Example 6 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-5, to optionally include or use wherein the assigned PCI code is chosen randomly from the respective first and second groups of available PCI codes.


Example 7 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-6 to optionally include or use wherein the location of the small cell eNodeB is estimated base on the GPS coordinates.


Example 8 can include or use, or can be optionally be combined with the subject matter of at least one of Examples 1-7, to include subject matter (such as an apparatus, a method, a means for performing acts, or a device readable memory including instructions that, when performed by the device, can cause the device to perform acts), such as can include or use at least one of (1) estimating a location of the small cell eNodeB based on at least one of Global Positioning System (GPS) coordinates of the location of the small cell eNodeB and an RSRP measured at the small cell eNodeB, (2) determining if the location of the small cell eNodeB is within a first region or a second region of a large cell transmission area, wherein the first and second regions do not overlap, (3) in response to determining the small cell eNodeB is within the first region, assigning a PCI code from a first group of available PCI codes to the small cell eNodeB, and (4) in response to determining the small cell eNodeB is within the second region, assigning a PCI code from a second group of available PCI codes to the small cell eNodeB, wherein the first group of PCI codes and the second group of PCI codes are disjoint.


Example 9 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-8 to optionally include or use at least one of: (1) comparing the RSRP to a threshold, in response to determining the RSRP is less than or equal to the threshold, determining the small cell eNodeB is within the second region, and in response to determining the RSRP is greater than the threshold, determining the small cell eNodeB is within the first region.


Example 10 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-9 to optionally include or use at least one of: (1) registering the small cell eNodeB to an Operations, Administration, and Maintenance (OAM) device, (2) receiving the threshold value from the OAM, and (3) receiving the first and second sets of available PCI codes from the OAM.


Example 11 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-10 to optionally include or use wherein assigning the PCI code from the first group of available PCI codes includes randomly assigning the PCI code from the first group of available PCI codes.


Example 12 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-11 to optionally include or use communicating to an Operations, Administration, and Maintenance device which PCI code was assigned.


Example 13 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-12 to optionally include or use wherein the first region corresponds to a region of the large cell extending outward from an eNodeB of the large cell and the second region corresponds to a region of the large cell extending outward from an outer edge of the first region.


Example 14 can include or use, or can optionally be combined with the subject matter of at least one of Examples 1-13 to optionally include or use wherein the threshold is a first threshold, wherein determining if the location of the small cell eNodeB is within the first region or the second region further includes determining if the location of the small cell eNodeB is within a third region of the large cell transmission area, wherein the first, second, and third regions do not overlap. Example 14 can optionally include or use at least one of: (1) comparing the RSRP to a second threshold, the second threshold less than the first threshold, in response to determining the RSRP is less than or equal to the second threshold and less than the first threshold, determining the small cell eNodeB is within the third region, and wherein determining the small cell eNodeB is within the second region includes further determining that the RSRP is greater than the second threshold and less than or equal to the first threshold.


The above detailed description includes references to the accompanying drawings, which form a part of the detailed description. The drawings show, by way of illustration, specific embodiments in which methods, apparatuses, and systems discussed herein can be practiced. These embodiments are also referred to herein as “examples.” Such examples can include elements in addition to those shown or described. However, the present inventors also contemplate examples in which only those elements shown or described are provided. Moreover, the present inventors also contemplate examples using any combination or permutation of those elements shown or described (or one or more aspects thereof), either with respect to a particular example (or one or more aspects thereof), or with respect to other examples (or one or more aspects thereof) shown or described herein.


In this document, the terms “a” or “an” are used, as is common in patent documents, to include one or more than one, independent of any other instances or usages of “at least one” or “one or more.” In this document, the term “or” is used to refer to a nonexclusive or, such that “A or B” includes “A but not B,” “B but not A,” and “A and B,” unless otherwise indicated. In this document, the terms “including” and “in which” are used as the plain-English equivalents of the respective terms “comprising” and “wherein.” Also, in the following claims, the terms “including” and “comprising” are open-ended, that is, a system, device, article, composition, formulation, or process that includes elements in addition to those listed after such a term in a claim are still deemed to fall within the scope of that claim. Moreover, in the following claims, the terms “first,” “second,” and “third,” etc. are used merely as labels, and are not intended to impose numerical requirements on their objects.


The above description is intended to be illustrative, and not restrictive. For example, the above-described examples (or one or more aspects thereof) may be used in combination with each other. Other embodiments can be used, such as by one of ordinary skill in the art upon reviewing the above description. The Abstract is provided to comply with 37 C.F.R. §1.72(b), to allow the reader to quickly ascertain the nature of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. Also, in the above Detailed Description, various features may be grouped together to streamline the disclosure. This should not be interpreted as intending that an unclaimed disclosed feature is essential to any claim. Rather, inventive subject matter may lie in less than all features of a particular disclosed embodiment. Thus, the following claims are hereby incorporated into the Detailed Description as examples or embodiments, with each claim standing on its own as a separate embodiment, and it is contemplated that such embodiments can be combined with each other in various combinations or permutations. The scope of the invention should be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled.

Claims
  • 1. A Long Term Evolution (LTE) device configured to assign a Physical Cell Identity (PCI) code to a small cell eNodeB based on a location of the small cell eNodeB, wherein the LTE device is configured to: estimate a location of the small cell eNodeB based on at least one of Global Positioning System (GPS) coordinates of the location of the small cell eNodeB and an RSRP measured at the small cell eNodeB;determine if the location of the small cell eNodeB is within a first region of a first large cell transmission area of a first base station, a second region of hg fir large cell transmission area, a third region of a second large cell transmission area of a second base station, and a fourth region of a second large cell transmission area, wherein the first and second large cell transmission areas are contiguous, the first and second regions do not overlap, the third and fourth regions do not overlap, the second region surrounds the first region and is further from the first base station than the first region, the fourth region surrounds the third region and is further from the second base station than the third region;in response to determining the small cell eNodeB is within the first region, assign a PCI code from a first group of available PCI codes to the small cell eNodeB;in response to determining the small cell eNodeB is within the second region, assign a PCI code from a second group of available PCI codes to the small cell eNodeB;in response to determining the small cell eNodeB is within the third region, assign a PCI code from the first group of available PCI codes to the small cell eNodeB; andin response to determining the small cell eNodeB is within the fourth region, assign a PCI code from a third group of available PCI codes to the small cell eNodeB, wherein the first, second, and third groups of PCI codes are disjoint.
  • 2. The LTE device of claim 1, wherein the device is configured to: estimate the location of the small cell eNodeB based on the RSRP measured at the small cell eNodeB;compare the RSRP to a threshold;in response to determining the RSRP is less than or equal to the threshold, determining the small cell eNodeB is within the second region; andin response to determining the RSRP is greater than the threshold, determining the small cell eNodeB is within the first region.
  • 3. The LTE device of claim 2, wherein the LTE device is a large cell eNodeB.
  • 4. The LTE device of claim 2, wherein the LTE device is the small cell eNodeB, and the small cell eNodeB is further configured to: register to an Operations, Administration, and Maintenance (OAM) device;receive the threshold value from the OAM; andreceive the first, second, and third sets of available PCI codes from the OAM.
  • 5. The LTE device of claim 2, wherein the LTE device is an Operations, Administration, and Maintenance (OAM) device.
  • 6. The LTE device of claim 2, wherein the assigned PCI code is chosen randomly from the respective first, second, and third groups of available PCI codes.
  • 7. The LTE device of claim 1, wherein the location of the small cell eNodeB is estimated based on the GPS coordinates.
  • 8. A method of assigning a Physical Cell Identity (PCI) code to a small cell eNodeB as a function of a location of the small cell eNodeB, the method comprising: estimating the location of the small cell eNodeB based on at least one of Global Positioning System (GPS) coordinates of the location of the small cell eNodeB and an RSRP measured at the small cell eNodeB;determining if the location of the small cell eNodeB is within a first region of a first large cell transmission area of a first base station, a second region of the first large cell transmission area, a third region of a second large cell transmission area of a second base station, and a fourth region of a second large cell transmission area, wherein the first and second large cell transmission areas are contiguous, the first and second regions do not overlap, the third and fourth regions do not overlap, the second region surrounds the first region and is further from the first base station than the first region, the fourth region surrounds the third region and is further from the second base station than the third region;in response to determining the small cell eNodeB is within the first region, assigning a PCI code from a first group of available PCI codes to the small cell eNodeB;in response to determining the small cell eNodeB is within the second region, assigning a PCI code from a second group of available PCI codes to the small cell eNodeB;in response to determining the small cell eNodeB is within the third region, assign a PCI code from the first group of available PCI codes to the small cell eNodeB; andin response to determining the small cell eNodeB is within the fourth region, assign a PCI code from a third group of available PCI codes to the small cell eNodeB, wherein the first, second, and third groups of PCI codes are disjoint.
  • 9. The method of claim 8, wherein estimating the location of the small cell eNodeB based on the RSRP measured at the small cell eNodeB includes: comparing the RSRP to a threshold;in response to determining the RSRP is less than or equal to the threshold, determining the small cell eNodeB is within the second region; andin response to determining the RSRP is greater than the threshold, determining the small cell eNodeB is within the first region.
  • 10. The method of claim 9, further comprising: registering the small cell eNodeB to an Operations, Administration, and Maintenance (OAM) device;receiving the threshold value from the OAM; andreceiving the first, second, and third sets of available PCI codes from the OAM.
  • 11. The method of claim 10, wherein assigning the PCI code from the first group of available PCI codes includes randomly assigning the PCI code from the first group of available PCI codes.
  • 12. The method of claim 9, wherein the threshold is a first threshold, wherein determining if the location of the small cell eNodeB is within the first region or the second region further includes determining if the location of the small cell eNodeB is within a fifth region of the first large cell transmission area, wherein the first, second, and fifth regions do not overlap, and the method further comprises: comparing the RSRP to a second threshold, the second threshold less than the first threshold;in response to determining the RSRP is less than or equal to the second threshold and less than the first threshold, determining the small cell eNodeB is within the third region; andwherein determining the small cell eNodeB is within the second region includes further determining that the RSRP is greater than the second threshold and less than or equal to the first threshold.
  • 13. The method of claim 8, further comprising: communicating to an Operations, Administration, and Maintenance device which PCI code was assigned.
  • 14. The method of claim 8, wherein the first region corresponds to a region of the first large cell transmission area extending outward from an eNodeB of the first large cell and the second region corresponds to a region of the large cell transmission area extending outward from an outer edge of the first region.
  • 15. A non-transitory computer readable storage device comprising instructions stored thereon, the instructions, which when executed by a machine, cause the machine to perform operations comprising: estimating a location of a small cell eNodeB based on at least one of Global Positioning System (GPS) coordinates of the small cell eNodeB and an RSRP measured at the small cell eNodeB;determining if the location of the small cell eNodeB is within a first region of a first large cell transmission area of a first base station, a second region of the first large cell transmission area, a third region of a second large cell transmission area of a second base station, and a fourth region of a second large cell transmission area, wherein the first and second large cell transmission areas are contiguous, the first and second regions do not overlap, the third and fourth regions do not overlap, the second region surrounds the first region and is further from the first base station than the first region, the fourth region surrounds the third region and is further from the second base station than the third region;in response to determining the small cell eNodeB is within the first region, assigning a PCI code from a first group of available PCI codes to the small cell eNodeB;in response to determining the small cell eNodeB is not within the first region, assigning a PCI code from a second group of available PCI codes to the small cell eNodeB;in response to determining the small cell eNodeB is within the third region, assign a PCI code from the first group of available PCI codes to the small cell eNodeB; andin response to determining the small cell eNodeB is within the fourth region, assign a PCI code from a third group of available PCI codes to the small cell eNodeB, wherein the first, second, and third groups of PCI codes are disjoint.
  • 16. The storage device of claim 15, further comprising instructions stored thereon, which when executed by the machine, cause the machine to further perform operations comprising: comparing the RSRP to a threshold; in response to determining the RSRP is less than or equal to the threshold, determining the small cell eNodeB is within the second region; andin response to determining the RSRP is greater than the threshold, determining the small cell eNodeB is within the first region.
  • 17. The storage device of claim 16, further comprising instructions stored thereon, which when executed by the machine, cause the machine to further perform operations comprising: registering the small cell eNodeB to an Operations, Administration, and Maintenance (OAM) device;receiving the threshold value from the OAM; andreceiving the first, second, and third sets of available PCI codes from the OAM.
  • 18. The storage device of claim 16, wherein the instructions for assigning the PCI code from the first group of available PCI codes include instructions for randomly assigning the PCI code from the first group of available PCI codes.
  • 19. The storage device of claim 16, further comprising instructions stored thereon, which when executed by the machine, cause the machine to further perform operations comprising: communicating to an Operations, Administration, and Maintenance device which PCI code was assigned.
  • 20. The storage device of claim 19, wherein the first region corresponds to a region of the first large cell transmission area extending outward from an eNodeB of the first large cell transmission area and the second region corresponds to a region of the first large cell transmission extending outward from outer edge of the first region.
RELATED APPLICATION

This patent application is a U.S. National Stage Filing under 35 U.S.C. 371 from International Patent Application Serial Number PCT/US2013/067575, filed on Oct. 30, 2013, published on May 8, 2014 as WO/2014/070929 A1, which claims the benefit of priority, to U.S. Provisional Application Ser. No. 61/721,436, filed Nov. 1, 2012, all of which are incorporated herein by reference in their entirety.

PCT Information
Filing Document Filing Date Country Kind
PCT/US2013/067575 10/30/2013 WO 00
Publishing Document Publishing Date Country Kind
WO2014/070929 5/8/2014 WO A
US Referenced Citations (176)
Number Name Date Kind
1789317 McLeish Jan 1931 A
4524849 Riddle Jun 1985 A
5685391 Gundlach Nov 1997 A
6386320 Clavel May 2002 B1
7965651 Du et al. Jun 2011 B2
8072963 Suzuki Dec 2011 B2
8150477 Cho et al. Apr 2012 B2
8174957 Ko et al. May 2012 B2
8504086 So Aug 2013 B2
8599715 Kim et al. Dec 2013 B2
8660197 Lindgren et al. Feb 2014 B2
8681627 Choudhury et al. Mar 2014 B2
8792426 Montojo et al. Jul 2014 B2
8885458 Diachina et al. Nov 2014 B2
8917702 Wegmann Dec 2014 B2
9042881 Kwon et al. May 2015 B2
9100160 Martinez Tarradell et al. Aug 2015 B2
9225399 Shan et al. Dec 2015 B2
9225759 Vannithamby et al. Dec 2015 B2
9253698 Zhang et al. Feb 2016 B2
9277471 He et al. Mar 2016 B2
9332469 Davydov et al. May 2016 B2
9363727 Chou et al. Jun 2016 B2
9420511 Gupta Hyde et al. Aug 2016 B2
9572077 Zhang et al. Feb 2017 B2
9585075 Khoryaev et al. Feb 2017 B2
9609564 Davydov et al. Mar 2017 B2
9674753 He et al. Jun 2017 B2
20010051994 Serizawa et al. Dec 2001 A1
20030072392 Beadle et al. Apr 2003 A1
20030226096 Shen et al. Dec 2003 A1
20040208183 Balachandran et al. Oct 2004 A1
20050008081 Yamazaki et al. Jan 2005 A1
20050026616 Cavalli et al. Feb 2005 A1
20050032555 Jami et al. Feb 2005 A1
20050117491 Sako et al. Jun 2005 A1
20050120265 Pline et al. Jun 2005 A1
20050124372 Lundby et al. Jun 2005 A1
20050135468 Asuri et al. Jun 2005 A1
20050146829 Schoenborn Jul 2005 A1
20050148348 Cramby et al. Jul 2005 A1
20060058033 Marsan et al. Mar 2006 A1
20060104379 Li et al. May 2006 A1
20060117155 Ware et al. Jun 2006 A1
20060126708 Van Den Bogaert Jun 2006 A1
20060286946 Akkarakaran et al. Dec 2006 A1
20070044000 Shen et al. Feb 2007 A1
20070111747 Lundby et al. May 2007 A1
20070291673 Demirhan et al. Dec 2007 A1
20070298725 Ryu Dec 2007 A1
20080188247 Worrall Aug 2008 A1
20080267165 Bertrand et al. Oct 2008 A1
20090129259 Malladi et al. May 2009 A1
20090238131 Montojo et al. Sep 2009 A1
20090245187 Nam et al. Oct 2009 A1
20090268624 Imamura et al. Oct 2009 A1
20100074109 Klingenbrunn et al. Mar 2010 A1
20100097937 Pietraski et al. Apr 2010 A1
20100113060 Bai May 2010 A1
20100216453 Kallin et al. Aug 2010 A1
20100272037 Lee et al. Oct 2010 A1
20100278038 Stahle et al. Nov 2010 A1
20110038279 Cho Feb 2011 A1
20110038326 Davies Feb 2011 A1
20110043275 Fuks et al. Feb 2011 A1
20110044165 Ni et al. Feb 2011 A1
20110059744 Won Mar 2011 A1
20110065443 Yellin et al. Mar 2011 A1
20110110347 Mun May 2011 A1
20110149728 Lee Jun 2011 A1
20110176502 Chung et al. Jul 2011 A1
20110190000 Kwun Aug 2011 A1
20110205886 Maruyama et al. Aug 2011 A1
20110244877 Farajidana et al. Oct 2011 A1
20110255635 Lee et al. Oct 2011 A1
20110261858 Baldemair et al. Oct 2011 A1
20110267854 Flannery et al. Nov 2011 A1
20110294491 Fong et al. Dec 2011 A1
20110300858 Lee et al. Dec 2011 A1
20110310769 Lee et al. Dec 2011 A1
20110319065 Dalsgaard et al. Dec 2011 A1
20120033643 Noh et al. Feb 2012 A1
20120039252 Damnjanovic et al. Feb 2012 A1
20120039298 Lee et al. Feb 2012 A1
20120052860 Faronius et al. Mar 2012 A1
20120057479 Maruyama et al. Mar 2012 A1
20120057519 Kim et al. Mar 2012 A1
20120083283 Phan et al. Apr 2012 A1
20120093124 Zhang et al. Apr 2012 A1
20120102240 Wei et al. Apr 2012 A1
20120106517 Charbit et al. May 2012 A1
20120113844 Krishnamurthy May 2012 A1
20120155406 Kim et al. Jun 2012 A1
20120170508 Sawai Jul 2012 A1
20120176885 Lee et al. Jul 2012 A1
20120176924 Wu et al. Jul 2012 A1
20120207047 Liao et al. Aug 2012 A1
20120207105 Geirhofer et al. Aug 2012 A1
20120213057 Zhang et al. Aug 2012 A1
20120213116 Koo et al. Aug 2012 A1
20120213137 Jeong et al. Aug 2012 A1
20120218913 Park et al. Aug 2012 A1
20120220286 Chen et al. Aug 2012 A1
20120230290 Seo et al. Sep 2012 A1
20120250662 Kuo Oct 2012 A1
20120252518 Karampatsis et al. Oct 2012 A1
20120264483 Chin et al. Oct 2012 A1
20120300685 Kim et al. Nov 2012 A1
20120320791 Guo et al. Dec 2012 A1
20130003668 Xiao et al. Jan 2013 A1
20130005385 Hunukumbure et al. Jan 2013 A1
20130039439 Kameya Feb 2013 A1
20130051277 Hakola et al. Feb 2013 A1
20130051310 Kim et al. Feb 2013 A1
20130053024 Zou et al. Feb 2013 A1
20130073671 Nagpal et al. Mar 2013 A1
20130077484 Zhao et al. Mar 2013 A1
20130077583 Kim Mar 2013 A1
20130080597 Liao Mar 2013 A1
20130089065 Koorapaty et al. Apr 2013 A1
20130107778 Ryu et al. May 2013 A1
20130114587 Khoryaev et al. May 2013 A1
20130170467 Ogawa et al. Jul 2013 A1
20130195041 Papasakellariou et al. Aug 2013 A1
20130195070 Bashar et al. Aug 2013 A1
20130196679 Widell et al. Aug 2013 A1
20130201936 Chen et al. Aug 2013 A1
20130258874 Khoshnevis et al. Oct 2013 A1
20130272215 Khoryaev et al. Oct 2013 A1
20130294307 Johansson et al. Nov 2013 A1
20130295905 Islam et al. Nov 2013 A1
20130301558 Zakrzewski Nov 2013 A1
20130303206 Starsinic et al. Nov 2013 A1
20130329545 Wu et al. Dec 2013 A1
20130343252 Chakraborty et al. Dec 2013 A1
20140016614 Velev et al. Jan 2014 A1
20140016714 Chen et al. Jan 2014 A1
20140018085 Young et al. Jan 2014 A1
20140029625 Edmiston Jan 2014 A1
20140036750 Yavuz et al. Feb 2014 A1
20140036795 Martinez Tarradell et al. Feb 2014 A1
20140044029 Chou et al. Feb 2014 A1
20140050086 Himayat et al. Feb 2014 A1
20140057640 Nagata et al. Feb 2014 A1
20140071952 Kim et al. Mar 2014 A1
20140086174 Nam et al. Mar 2014 A1
20140092733 Johansson et al. Apr 2014 A1
20140094125 Behravan et al. Apr 2014 A1
20140112194 Novlan et al. Apr 2014 A1
20140113667 Keller et al. Apr 2014 A1
20140119261 Wang et al. May 2014 A1
20140120967 Purnadi et al. May 2014 A1
20140226616 Ihm et al. Aug 2014 A1
20140269383 He et al. Sep 2014 A1
20140269779 Shan et al. Sep 2014 A1
20140286215 Koc et al. Sep 2014 A1
20140286302 Khoryaev et al. Sep 2014 A1
20140295856 Chou et al. Oct 2014 A1
20140321296 Balraj Oct 2014 A1
20140357259 Tomeczko et al. Dec 2014 A1
20150009928 Sohn et al. Jan 2015 A1
20150029874 Davydov et al. Jan 2015 A1
20150043438 Fwu et al. Feb 2015 A1
20150092738 Chakraborty et al. Apr 2015 A1
20150171939 Davydov et al. Jun 2015 A1
20150215928 Davydov et al. Jul 2015 A1
20150230179 Gupta et al. Aug 2015 A1
20150230214 Tong et al. Aug 2015 A1
20150230234 Choi et al. Aug 2015 A1
20150237521 Davydov et al. Aug 2015 A1
20150249947 Zhang et al. Sep 2015 A1
20150304076 Lee et al. Oct 2015 A1
20150358931 Koorapaty et al. Dec 2015 A1
20160119842 Zhang et al. Apr 2016 A1
20160157241 He et al. Jun 2016 A1
20160183281 Yeh et al. Jun 2016 A1
Foreign Referenced Citations (57)
Number Date Country
102340344 Feb 2012 CN
102724673 Oct 2012 CN
104782157 Jul 2015 CN
104782166 Jul 2015 CN
104885514 Sep 2015 CN
104904137 Sep 2015 CN
104904256 Sep 2015 CN
104937977 Sep 2015 CN
105557032 May 2016 CN
105637917 Jun 2016 CN
2154918 Feb 2010 EP
2369883 Sep 2011 EP
2624473 Aug 2013 EP
2733983 May 2014 EP
2782389 Sep 2014 EP
2915358 Sep 2015 EP
2915368 Sep 2015 EP
1020090093758 Sep 2009 KR
1020110011145 Feb 2011 KR
1020120033283 Apr 2012 KR
1020120094369 Aug 2012 KR
1020120096408 Aug 2012 KR
WO-0251189 Jun 2002 WO
WO-2004045083 May 2004 WO
WO-2004114683 Dec 2004 WO
WO-2011105726 Sep 2011 WO
WO-2011123550 Oct 2011 WO
WO-2011134401 Nov 2011 WO
WO-2011149533 Dec 2011 WO
WO-2012021879 Feb 2012 WO
WO-20120025825 Mar 2012 WO
WO-2012044328 Apr 2012 WO
WO-2012050503 Apr 2012 WO
WO-2012063041 May 2012 WO
WO-2012065033 May 2012 WO
WO-2012067555 May 2012 WO
WO-2012109989 Aug 2012 WO
WO-2012111937 Aug 2012 WO
WO-2012112281 Aug 2012 WO
WO-2012121757 Sep 2012 WO
WO-2012134579 Oct 2012 WO
WO-2012141884 Oct 2012 WO
WO-2012144645 Oct 2012 WO
WO-2013064385 May 2013 WO
WO-2014070321 May 2014 WO
WO-2014070347 May 2014 WO
WO-2014070359 May 2014 WO
WO-2014070410 May 2014 WO
WO-2014070411 May 2014 WO
WO-2014070480 May 2014 WO
WO-2014070602 May 2014 WO
WO-2014070649 May 2014 WO
WO-2014070768 May 2014 WO
WO-2014070778 May 2014 WO
WO-2014070901 May 2014 WO
WO-2014070929 May 2014 WO
WO-2014070933 May 2014 WO
Non-Patent Literature Citations (191)
Entry
“3GPP MTC Standard TTA M2M Seminar”, ETRI Standards Research Center, [Online] retrieved from the internet:<edu.tta.or.kr/sub3/down.php?No=123&file=M2M—1-4.pdf>, (Oct. 23, 2012).
“3GPP TSG-SA5 Meeting #86 Change Request 32.762”, New Orleans. S5-123029., (Nov. 12, 2012), 14 pgs.
“U.S. Appl. No. 14/119,228, Preliminary Amendment dated Nov. 21, 2013”, 9 pgs.
“U.S. Appl. No. 14/124,457, Preliminary Amendment dated Dec. 6, 2013”, 7 pgs.
“U.S. Appl. No. 14/124,939, Preliminary Amendment dated Dec. 9, 2013”, 9 pgs.
“U.S. Appl. No. 14/124,964, Preliminary Amendment dated Dec. 9, 2013”, 9 pgs.
“U.S. Appl. No. 14/125,472, Preliminary Amendment dated Dec. 11, 2013”, 9 pgs.
“U.S. Appl. No. 14/125,767, Preliminary Amendment dated Dec. 12, 2013”, 11 pgs.
“U.S. Appl. No. 14/126,611, Final Office Action dated May 22, 2015”, 11 pgs.
“U.S. Appl. No. 14/126,611, Non Final Office Action dated Oct. 23, 2014”, 10 pgs.
“U.S. Appl. No. 14/126,611, Preliminary Amendment dated Dec. 16, 2013”, 11 pgs.
“U.S. Appl. No. 14/126,611, Response filed Jan. 23, 2015 to Non Final Office Action dated Oct. 23, 2014”, 12 pgs.
“U.S. Appl. No. 14/126,654, Examiner Interview Summary dated Feb. 25, 2015”, 5 pgs.
“U.S. Appl. No. 14/126,654, Non Final Office Action dated Nov. 6, 2014”, 34 pgs.
“U.S. Appl. No. 14/126,654, Preliminary Amendment dated Dec. 16, 2013”, 10 pgs.
“U.S. Appl. No. 14/126,654, Response fled Mar. 6, 2015 to Non Final Office Action dated Nov. 6, 2014”, 18 pgs.
“U.S. Appl. No. 14/126,998, Preliminary Amendment dated Dec. 17, 2013”, 8 pgs.
“U.S. Appl. No. 14/127,015, Preliminary Amendment dated Dec. 17, 2013”, 8 pgs.
“U.S. Appl. No. 14/127,092, Preliminary Amendment dated Dec. 17, 2013”, 10 pgs.
“U.S. Appl. No. 14/127,621, Preliminary Amendment dated Dec. 19, 2013”, 8 pgs.
“CSI Collision Handling for CoMP”, R1-123468, 3GPP TSG RAN WG1 #70, Samsung, (Aug. 2012), 3 pgs.
“Discussion on reduction of CSI processing complexity to support CoMP”, R1-124368, 3GPP TSG RAN WG1 #70bis, Samsung, (Oct. 2012), 4 pgs.
“Evaluation of MTC Device triggering”, HTC, TD S2-110732, 3GPP TSG SA WG2 Meeting #83, (Feb. 2011), 2 pgs.
“Evolved Universal Terrestrial Radio Access (E-UTRA); Radio Resource Control (RRC)”, 3GPP TS 36.331 V11.4.0 (Jun. 2013) Technical Specification Group Radio Access Network; Protocol specification (Release 11), (Jun. 2013), 346 pgs.
“Evolved Universal Terrestrial Radio Access (E-UTRA); Radio Resource Control (RRC);”, 3GPP TS 36.331 V11.1.0 (Sep. 2012) Technical Specification Group Radio Access Network; Protocol specification (Release 11), (Sep. 2012), 325 pgs.
“Evolved Universal Terrestrial Radio Access (E-UTRA); Study on signalling and procedure for interference avoidance for in-device coexistence”, 3GPP TR 36.816 V11.1.0 (Sep. 2011) Technical Specification Group Radio Access Network (Release 11), (Sep. 2011), 44 pgs.
“Inter-RAT mobility for UE under IDC interference”, 3GPP TSG-RAN WG2 #79bis; R2-124725; Agenda Item 7.6.3; LG Electronics Inc., (Oct. 8, 2012), 1 pg.
“Inter-RAT operation for in-device coexistence”, 3GPP TSG RAN WG2 Meeting #80; R2125750; Agenda Item 7.6.1; Intel Corporation, (Nov. 12, 2012), 2 pgs.
“International Application Serial No. PCT/US2013/060146, International Preliminary Report on Patentability dated May 14, 2015”, 7 pgs.
“International Application Serial No. PCT/US2013/060146, International Search Report dated Dec. 27, 2013”, 5 pgs.
“International Application Serial No. PCT/US2013/060146, Written Opinion dated Dec. 27, 2013”, 5 pgs.
“International Application Serial No. PCT/US2013/062442, International Preliminary Report on Patentability dated May 14, 2015”, 11 pgs.
“International Application Serial No. PCT/US2013/062442, International Search Report dated Feb. 18, 2014”, 10 pgs.
“International Application Serial No. PCT/US2013/062442, Written Opinion dated Feb. 18, 2014”, 9 pgs.
“International Application Serial No. PCT/US2013/063063, International Preliminary Report on Patentability dated May 14, 2015”, 6 pgs.
“International Application Serial No. PCT/US2013/063063, International Search Report dated Dec. 31, 2013”, 5 pgs.
“International Application Serial No. PCT/US2013/063063, Written Opinion dated Dec. 31, 2013”, 4 pgs.
“International Application Serial No. PCT/US2013/064385, International Preliminary Report on Patentability dated May 14, 2015”, 10 pgs.
“International Application Serial No. PCT/US2013/064385, International Search Report dated Jan. 29, 2014”, 3 pgs.
“International Application Serial No. PCT/US2013/064385, Written Opinion dated Jan. 29, 2014”, 8 pgs.
“International Application Serial No. PCT/US2013/064387, International Preliminary Report on Patentability dated May 14, 2015”, 6 pgs.
“International Application Serial No. PCT/US2013/064387, International Search Report dated Jan. 28, 2014”, 4 pgs.
“International Application Serial No. PCT/US2013/064387, Written Opinion dated Jan. 28, 2014”, 4 pgs.
“International Application Serial No. PCT/US2013/065599, International Preliminary Report on Patentability dated May 14, 2015”, 6 pgs.
“International Application Serial No. PCT/US2013/065599, International Search Report dated Feb. 10, 2014”, 4 pgs.
“International Application Serial No. PCT/US2013/065599, Written Opinion dated Feb. 10, 2014”, 4 pgs.
“International Application Serial No. PCT/US2013/066786, International Preliminary Report on Patentability dated May 14, 2015”, 8 pgs.
“International Application Serial No. PCT/US2013/066786, International Search Report dated Feb. 12, 2014”, 4 pgs.
“International Application Serial No. PCT/US2013/066786, Written Opinion dated Feb. 12, 2014”, 6 pgs.
“International Application Serial No. PCT/US2013/067043, International Preliminary Report on Patentability dated May 14, 2015”, 8 pgs.
“International Application Serial No. PCT/US2013/067043, International Search Report dated Feb. 25, 2014”, 4 pgs.
“International Application Serial No. PCT/US2013/067043, Written Opinion dated Feb. 25, 2014”, 6 pgs.
“International Application Serial No. PCT/US2013/067306, International Preliminary Report on Patentability dated May 14, 2015”, 9 pgs.
“International Application Serial No. PCT/US2013/067306, International Search Report dated Jan. 17, 2014”, 3 pgs.
“International Application Serial No. PCT/US2013/067306, Written Opinion dated Jan. 17, 2014”, 7 pgs.
“International Application Serial No. PCT/US2013/067317, International Preliminary Report on Patentability dated May 14, 2015”, 9 pgs.
“International Application Serial No. PCT/US2013/067317, International Search Report dated Feb. 7, 2014”, 3 pgs.
“International Application Serial No. PCT/US2013/067317, Written Opinion dated Feb. 7, 2014”, 7 pgs.
“International Application Serial No. PCT/US2013/067522, International Preliminary Report on Patentability dated May 14, 2015”, 8 pgs.
“International Application Serial No. PCT/US2013/067522, International Search Report dated Feb. 12, 2014”, 3 pgs.
“International Application Serial No. PCT/US2013/067522, Written Opinion dated Feb. 12, 2014”, 6 pgs.
“International Application Serial No. PCT/US2013/067575, International Preliminary Report on Patentability dated May 14, 2015”, 8 pgs.
“International Application Serial No. PCT/US2013/067575, International Search Report dated Feb. 21, 2014”, 3 pgs.
“International Application Serial No. PCT/US2013/067575, Written Opinion dated Feb. 21, 2014”, 6 pgs.
“International Application Serial No. PCT/US2013/067582, International Preliminary Report on Patentability dated May 14, 2015”, 6 pgs.
“International Application Serial No. PCT/US2013/067582, International Search Report dated Nov. 27, 2013”, 3 pgs.
“International Application Serial No. PCT/US2013/067582, Written Opinion dated Nov. 27, 2013”, 4 pgs.
“Radio Frequency (RF) requirements for Multicarrier and Multiple Radio Access Technology (Multi-RAT) Base Station (BS)”, 3GPP TR 37.900 V11.0.0. Technical Specification Group Radio Access Network. Release 11., (Sep. 24, 2012), 75 pgs.
“Relay System Simulation Results with Coverage Boosting and Control Channel Modeling”, 3GPP TSG RAN WG1 Meeting #59, R1-094838, Motorola, (2009), 12 pgs.
“Telecommunication management; Self-Organizing Networks (SON); Self-healing concepts and requirements”, 3GPP TS 32.541 V10.0.0. Technical Specification Group Services and System Aspects. Release 10., (Mar. 2011), 21 pgs.
“The Mobile Broadband Standard”, 3GPP List of Work Items, [Online] retrieved from the internet:<http://www.3gpp.org/DynaReport/WI-List.html>.
“Title Change Request”, 3GPP TSG-RAN WG2 Meeting #79bis; R2-125108, (Oct. 8, 2012), 5 pgs.
“Triggering a detached MTC device”, InterDigital Communications, TD S2-110673, 3GPP TSG SA WG2 Meeting #83, (Feb. 2011), 4 pgs.
“TSG-SA5 Meeting #86 Change Request 32.766”, New Orleans. S5-123194., (Nov. 12, 2012), 26 pgs.
Doppler, Klaus, et al., “Device-to-Device Communication as an Underlay to LTE-Advanced Networks”, IEEE Communications Magazine, 47(12), (Dec. 2009), 42-49.
Hong, Wei, et al., “Considering In-Device Coexistence interference from WiFi point of view”, IEEE 802.11-13/0880-00, (Jul. 17, 2013), 13 pgs.
Lei, Lei, et al., “Operator controlled device-to-device communications in LTE-advanced networks”, IEEE Wireless Communications, 19(3), (Jun. 2012), 96-104.
“U.S. Appl. No. 14/119,228, Non Final Office Action dated Jun. 19, 2015”, 6 pgs.
“U.S. Appl. No. 14/119,228, Response filed Jul. 31, 2015 to Non Final Office Action dated Jun. 19, 2015”, 10 pgs.
“U.S. Appl. No. 14/124,457, Non Final Office Action dated Jul. 15, 2015”, 18 pgs.
“U.S. Appl. No. 14/126,611, Notice of Allowance dated Aug. 19, 2015”, 12 pgs.
“U.S. Appl. No. 14/126,611, Response filed Jul. 24, 2015 to Final Office Action dated May 22, 2015”, 9 pgs.
“U.S. Appl. No. 14/126,654, Final Office Action dated Jun. 18, 2015”, 36 pgs.
“U.S. Appl. No. 14/126,654, Response filed Aug. 28, 2015 to Final Office Action dated Jun. 18, 2015”, 15 pgs.
“U.S. Appl. No. 14/127,092, Non Final Office Action dated Jul. 6, 2015”, 28 pgs.
“U.S. Appl. No. 14/119,228, Notice of Allowance dated Sep. 29, 2015”, 8 pgs.
“U.S. Appl. No. 14/124,457, Response filed Nov. 11, 2015 to Non Final Office Action dated Jul. 15, 2015”, 11 pgs.
“U.S. Appl. No. 14/124,939, Non Final Office Action dated Oct. 29, 2015”, 31 pgs.
“U.S. Appl. No. 14/125,472, Non Final Office Action dated Jan. 22, 2016”, 8 pgs.
“U.S. Appl. No. 14/125,472, Non Final Office Action dated Oct. 29, 2015”, 11 pgs.
“U.S. Appl. No. 14/125,767, Notice of Allowance dated Dec. 24, 2015”, 15 pgs.
“U.S. Appl. No. 14/126,654, Notice of Allowance dated Sep. 29, 2015”, 21 pgs.
“U.S. Appl. No. 14/126,998, Non Final Office Action dated Sep. 25, 2015”, 24 pgs.
“U.S. Appl. No. 14/127,092, Examiner Interview Summary dated Oct. 9, 2015”, 3 pgs.
“U.S. Appl. No. 14/127,092, Final Office Action dated Jan. 6, 2016”, 25 pgs.
“U.S. Appl. No. 14/127,092, Response Non Final Office Action dated Jul. 6, 2015”, 11 pgs.
“U.S. Appl. No. 14/127,621, Non Final Office Action dated Jan. 14, 2016”, 19 pgs.
“U.S. Appl. No. 15/013,658, Preliminary Amendment dated Feb. 3, 2016”, 9 pgs.
“Chinese Application Serial No. 201380051478.0, Preliminary Amendment dated Oct. 20, 2015”, W/ English Claims, 18 pgs.
“Chinese Application Serial No. 201380051528.5, Voluntary Amendment dated Dec. 9, 2015”, not in English, 13 pgs.
“Chinese Application Serial No. 201380051575.X, Voluntary Amendment dated Dec. 21, 2015”, not in English, 13 pgs.
“Japanese Application Serial No. 2015-534837, Office Action dated Jan. 19, 2016”, w/ English Translation, 5 pgs.
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Study on signalling and procedure for interference avoidance for in-device coexistence (Release 11)”, 3GPP Standard; 3GPP TR 36.816, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, vol. RAN WG2, No. V11.2.0,, (Dec. 22, 2011), 1-44.
“3rd Generation Partnership Project;Technical Specification Group Radio Access Network;Further Advancements for E-UTRAPhysical Layer Aspects(Release 9)”, 3GPP Draft; TR 36.814—200, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex; France, vol . RAN WG1 , no. San Francisco, USA; 20100222, (Apr. 8, 2010).
“Aperiodic CSI Feedback for Rel-11 CoMP”, 3GPP Draft; RI-123365 Aperiodic CSI Feedback for REL-11 Comp, 3rd Generation Partnership Project, vol. RAN WG, Retrieved from the Internet: <URL:http://www.3gpp.org/ftp/tsg—ran/WGI—RL1/TSGR1—70/Docs/>, (Aug. 5, 2012).
“U.S. Appl. No. 14/124,457, Notice of Allowance dated Feb. 8, 2016”, 9 pgs.
“U.S. Appl. No. 14/124,939, Final Office Action dated Jun. 17, 2016”, 30 pgs.
“U.S. Appl. No. 14/124,939, Response filed Feb. 29, 2016 to Non Final Office Action dated Oct. 29, 2015”, 15 pgs.
“U.S. Appl. No. 14/124,964, Non Final Office Action dated Apr. 8, 2016”, 14 pgs.
“U.S. Appl. No. 14/124,964, Respnse filed Jul. 8, 2016 to Non Final Office Action dated Apr. 8, 2016”, 13 pgs.
“U.S. Appl. No. 14/125,472, Non Final Office Action dated Jun. 9, 2016”, 10 pgs.
“U.S. Appl. No. 14/125,472, Response filed Apr. 22, 2016 to Non Final Office Action dated Jan. 22, 2016”, 12 pgs.
“U.S. Appl. No. 14/125,767, 312 Amendment filed Jan. 22, 2016”, 10 pgs.
“U.S. Appl. No. 14/125,767, PTO Response to 312 Amendment dated Feb. 9, 2016”, 2 pgs.
“U.S. Appl. No. 14/126,998, Final Office Action dated May 12, 2016”, 24 pgs.
“U.S. Appl. No. 14/126,998, Response filed Feb. 23, 2016 to Non Final Office Action dated Sep. 25, 2015”, 11 pgs.
“U.S. Appl. No. 14/127,015, Non Final Office Action dated Jul. 18, 2016”, 8 pgs.
“U.S. Appl. No. 14/127,015, Response filed Jun. 24, 2016 to Restriction Requirement dated Apr. 26, 2016”, 8 pgs.
“U.S. Appl. No. 14/127,015, Restriction Requirement dated Apr. 26, 2016”, 10 pgs.
“U.S. Appl. No. 14/127,092, Notice of Allowance dated Apr. 13, 2016”, 16 pgs.
“U.S. Appl. No. 14/127,092, Response filed Mar. 7, 2016 to Final Office Action dated Jan. 6, 2016”, 14 pgs.
“U.S. Appl. No. 14/127,621, Final Office Action dated May 26, 2016”, 25 pgs.
“U.S. Appl. No. 14/127,621, Non Final Office Action dated Sep. 2, 2016”, 22 pgs.
“U.S. Appl. No. 14/127,621, Response filed Aug. 23, 2016 to Final Office Action dated May 26, 2016”, 9 pgs.
“U.S. Appl. No. 14/990,239, Non Final Office Action dated Aug. 12, 2016”, 9 pgs.
“U.S. Appl. No. 15/013,658, Non Final Office Action dated May 20, 2016”, 50 pgs.
“U.S. Appl. No. 15/013,658, Response filed Aug. 12, 2016 to Non Final Office Action dated May 20, 2016”, 16 pgs.
“U.S. Appl. No. 14/127621, Response filed Aug. 14, 2016 to Non Final Office Action dated Jan. 14, 2016”, 12 pgs.
“CSI Collision Handling for CoMP”, R1-123468, 3GPP TSG RAN WG1, (2012), 3 pgs.
“Device Trigger Information”, 3gpp Draft; S2-120650, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France, vol. Sa Wg2, No. Vancouver, (Jan. 31, 2012).
“European Application Serial No. 13850277.8, Extended European Search Report dated Aug. 2, 2016”, 8 pgs.
“European Application Serial No. 13850323.0, Extended European Search Report dated Jul. 14, 2016”, 12 pgs.
“European Application Serial No. 13850951.8, Extended European Search Report dated May 25, 2016”, 9 pgs.
“European Application Serial No. 13851603.4, Extended European Search Report dated Jul. 14, 2016”, 11 pgs.
“European Application Serial No. 13851994.7, Extended European Search Report dated Jun. 28, 2016”, 10 pgs.
“European Application Serial No. 13851996.2, Extended European Search Report dated Jul. 18, 2016”, 15 pgs.
“European Application Serial No. 16163446.4, Extended European Search Report dated Jul. 20, 2016”, 11 pgs.
“Introduction of Rel-11 features”, 3GPP Draft; RI-124012-36.213 CR0389 (REL-11, B) Introduction of REL-11 Features, 3rd Generation Partnership Project (3GPP), Retrieved from the Internet: <URL:http://www.3gpp.org/ftp/tsg—ran/WGI—RL1/TSGR1—70/Docs/>, (Sep. 19, 2012).
“Japanese Application Serial No. 2015-534837, Response filed Apr. 14, 2016 to Office Action dated Jan. 19, 2016”, 21 pgs.
“Korean Application Serial No. 2015-7008322, Office Action dated Jul. 22, 2016”, With English Translation, 15 pgs.
“Maximum number of CSI processes”, 36PP Draft; RI-124290, 3rd Generation Partnership Project (36PP), Mobile Competence Centre,NEC Group, Retrieved from the Internet<URL:http://www.3gpp.org/ftp/tsg—ran/WGI—RLI/TSGRI—70b/Docs>, (Sep. 29, 2012).
“MTC small data Identification mechanism for non-SMS Small Data Transmission Solution”, 3gpp Draft; S2-114341—MTC—Small—Data—Identification, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France, (Oct. 4, 2011).
“Periodic CSI Feedback for Rel-11 CoMP”, NTT DOCOMO, 3GPP Draft; RI-123364 Periodic CSI Feedback for REL-11 Comp, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre, Retrieved from the Internet: <URL:http://www.3gpp.org/ftp/tsg—ran/WGI RL1/TSGR1—70/Docs/>, (Aug. 5, 2012).
“Relay System Simulation Results with Coverage Boosting and Control Channel Modeling”, 3GPP Draft: RI-094838—Relay SYSSIM Results W Coverage Boosting and CCH Modeling—. 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France (Nov. 4, 2009).
“Remaining details of periodic CSI reporting”, 3GPP Draft; RI-124723 Remaining Details of Periodic CSI Reporting, 3rd Generation Partnership Project (3GPP), Retrieved from the Internet: <URL:http://www.3gpp.org/ftp/tsg—ran/WGI—RLI/TSGRI—71/Docs>, (Nov. 2, 2012).
“Remaining Signaling Issues for the IDC operation”. 3GPP Draft; R2-124472-Signaling, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 vol. RAN WG2, no. Bratislava. Slovakia; 20121008-20121012, [Online] retrieved from the internet:http://www.3gpp.org/ftp/tsg—ran/WG2—RL2/TSGR2—79bis/Docs/, (Sep. 28, 2012).
“Triggering procedure over Tsp”, 3gpp Draft; S2-120558—Tsp—Trigger—Proc, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex France, vol. Sa Wg2, No. Vancouver, (Jan. 31, 2012).
“Update HSS based device trigger solution”, 3GPP TSG SA WG2 Meeting #86: TD S2-113082, (Jul. 15, 2011), 5 pgs.
Huawei, et al., “Bandwidth reduction for low cost MTC UE and text proposal”, 3GPP Draft; RI-120051, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France,vol. RAN WG1, no. Dresden, Germany; 20120206-20120210, XP050562638, (Jan. 31, 2012).
Huawei, et al., “Periodic CSI feedback collision handling for CoMP”, 3GPP Draft; RI-123104, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre, Retrieved from the Internet: <URL:http://www.3gpp.org/ftp/tsg—ran/WGI—RL1/TSGR1—70/Docs/>, (Aug. 5, 2012), 7 pgs.
Kanzaki, Mitsuru, “Three-legged Ladder”, Japanese Laid-open Utility Model Publication No. 7-32198, (Jun. 16, 1995), 21 pgs.
Nishina, Koichi, et al., “Stepladder”, Japanese Laid-open Utility Model Publication No. 62-52700, (Apr. 1, 1987), 8 pgs.
Suzuki, Masaaki, et al,, “Three-Leg Type Ladder”, Patent Abstracts of Japan 09-112165, (Apr. 28, 1997), 8 pgs.
“U.S. Appl. No. 14/124,939, Advisory Action dated Oct. 26, 2016”, 5 pgs.
“U.S. Appl. No. 14/124,939, Non Final Office Action dated Dec. 19, 2016”, 37 pgs.
“U.S. Appl. No. 14/124,939, Response filed Mar. 20, 2017 to Non Final Office Action dated Dec. 19, 2016”, 14 pgs.
“U.S. Appl. No. 14/124,939, Response filed Oct. 17, 2016 to Final Office Action dated Jun. 17, 2016”, 10 pgs.
“U.S. Appl. No. 14/124,964, Notice of Allowance dated Oct. 19, 2016”, 15 pgs.
“U.S. Appl. No. 14/125,472, Notice of Allowability dated Jan. 23, 2017”, 2 pgs.
“U.S. Appl. No. 14/125,472, Notice of Allowance dated Nov. 8, 2016”, 5 pgs.
“U.S. Appl. No. 14/125,472, Response filed Sep. 9, 2016 to Non Final Office Action dated Jun. 9, 2016”, 11 pgs.
“U.S. Appl. No. 14/126,998, Non Final Office Action dated Nov. 28, 2016”, 27 pgs.
“U.S. Appl. No. 14/126,998, Response filed Mar. 28, 2017 to Non Final Office Action dated Nov. 28, 2016”, 9 pgs.
“U.S. Appl. No. 14/126,998, Response filed Oct. 11, 2016 to Final Office Action dated May 12, 2016” , 8 pgs.
“U.S. Appl. No. 14/127,015, Advisory Action dated Mar. 28, 2017”, 3 pgs.
“U.S. Appl. No. 14/127,015, Final Office Action dated Dec. 13, 2016”, 9 pgs.
“U.S. Appl. No. 14/127,015, Non Final Office Action dated May 8, 2017”, 11 pgs.
“U.S. Appl. No. 14/127,015, Response filed Mar. 13, 2017 to Final Office Action dated Dec. 13, 2016” , 12 pgs.
“U.S. Appl. No. 14/127,015, Response filed Oct. 18, 2016 to Non Final Office Action dated Jul. 18, 2016”, 9 pgs.
“U.S. Appl. No. 14/127,621, Final Office Action dated Mar. 7, 2017”, 30 pgs.
“U.S. Appl. No. 14/127,621, Response filed May 8, 2017 to Final Office Action dated Mar. 7, 2017”, 10 pgs.
“U.S. Appl. No. 14/127,621, Response filed Dec. 1, 2016 to Non Final Office Action dated Sep. 2, 2016”, 11 pgs.
“U.S. Appl. No. 14/990,239, Corrected Notice of Allowance dated Oct. 26, 2016”, 2 pgs.
“U.S. Appl. No. 14/990,239, Notice of Allowance dated Oct. 5, 2016”, 7 pgs.
“U.S. Appl. No. 14/990,239, Response filed Sep. 9, 2016 to Non Final Office Action dated Aug. 12, 2016”, 11 pgs.
“U.S. Appl. No. 15/013,658, Final Office Action dated Oct. 21, 2016”, 43 pgs.
“U.S. Appl. No. 15/013,658, Notice of Allowance dated Jan. 26, 2017”, 7 pgs.
“U.S. Appl. No. 15/013,658, Response filed Dec. 21, 2016 to Final Office Action dated Oct. 21, 2016”, 14 pgs.
“European Application Serial No. 13850277.8, Response filed Feb. 28, 2017 to Extended European Search Report dated Aug. 2, 2016”, 10 pgs.
“European Application Serial No. 13850951.8, Communication pursuant to Article 94(3) EPC dated Apr. 10, 2017”, 5 pgs.
“European Application Serial No. 13850951.8, Response filed Dec. 12, 2016 to Extended European Search Report dated May 25, 2016”, 10 pgs.
“European Application Serial No. 13851603.4, Response filed Feb. 13, 2017 to Extended European Search Report dated Jul. 14, 2016”, 15 pgs.
“European Application Serial No. 13851994.7, Response filed Jan. 11, 2017 to Extended European Search Report dated Jun. 28, 2016”, 13 pgs.
“European Application Serial No. 13851996.2, Response filed Feb. 13, 2017 to Extended European Search Report dated Jul. 18, 2016”, 8 pgs.
“European Application Serial No. 13851996.2, Response filed Apr. 4, 2017 to Extended European Search Report dated Jul. 18, 2016”, 7 pgs.
“European Application Serial No. 16163446.4, Response filed Feb. 23, 2017 to Office Action dated Aug. 29, 2016”, 17 pgs.
“Korean Application Serial No. 2015-7008322, Response filed Sep. 22, 2016 to Office Action dated Jul. 22, 2016”, W/ English Translation of Claims, 33 pgs.
“U.S. Appl. No. 14/124,939, Final Office Action dated Jun. 23, 2017”, 37 pgs.
“U.S. Appl. No. 14/126,998, Final Office Action dated Jun. 22, 2017”, 30 pgs.
“U.S. Appl. No. 14/127,621, Advisory Action dated May 30, 2017”, 2 pgs.
“Chinese Application Serial No. 201380051575.X, Office Action dated Apr. 1, 2017”, w/ English Translation, 28 pgs.
Related Publications (1)
Number Date Country
20150245221 A1 Aug 2015 US
Provisional Applications (1)
Number Date Country
61721436 Nov 2012 US