As used herein, the terms “user agent” and “UA” might in some cases refer to mobile devices such as mobile telephones, personal digital assistants, handheld or laptop computers, and similar devices that have telecommunications capabilities. Such a UA might consist of a UA and its associated removable memory module, such as but not limited to a Universal Integrated Circuit Card (UICC) that includes a Subscriber Identity Module (SIM) application, a Universal Subscriber Identity Module (USIM) application, or a Removable User Identity Module (R-UIM) application. Alternatively, such a UA might consist of the device itself without such a module. In other cases, the term “UA” might refer to devices that have similar capabilities but that are not transportable, such as desktop computers, set-top boxes, or network appliances. The term “UA” can also refer to any hardware or software component that can terminate a communication session for a user. Also, the terms “user agent,” “UA,” “user equipment,” “UE,” “user device” and “user node” might be used synonymously herein.
As telecommunications technology has evolved, more advanced network access equipment has been introduced that can provide services that were not possible previously. This network access equipment might include systems and devices that are improvements of the equivalent equipment in a traditional wireless telecommunications system. Such advanced or next generation equipment may be included in evolving wireless communications standards, such as long-term evolution (LTE). For example, an LTE system might include an enhanced node B (eNB), a wireless access point, or a similar component rather than a traditional base station. As used herein, the term “access node” will refer to any component of the wireless network, such as a traditional base station, a wireless access point, or an LTE eNB, that creates a geographical area of reception and transmission coverage allowing a UA or a relay node to access other components in a telecommunications system. In this document, the term “access node” and “access device” may be used interchangeably, but it is understood that an access node may comprise a plurality of hardware and software.
The term “access node” does not refer to a “relay node,” which is a component in a wireless network that is configured to extend or enhance the coverage created by an access node or another relay node. The access node and relay node are both radio components that may be present in a wireless communications network, and the terms “component” and “network node” may refer to an access node or relay node. It is understood that a component might operate as an access node or a relay node depending on its configuration and placement. However, a component is called a “relay node” only if it requires the wireless coverage of an access node or other relay node to access other components in a wireless communications system. Additionally, two or more relay nodes may used serially to extend or enhance coverage created by an access node.
An LTE system can include protocols such as a Radio Resource Control (RRC) protocol, which is responsible for the assignment, configuration, and release of radio resources between a UA and a network node or other LTE equipment. The RRC protocol is described in detail in the Third Generation Partnership Project (3GPP) Technical Specification (TS) 36.331. According to the RRC protocol, the two basic RRC modes for a UA are defined as “idle mode” and “connected mode.” During the connected mode or state, the UA may exchange signals with the network and perform other related operations, while during the idle mode or state, the UA may shut down at least some of its connected mode operations. Idle and connected mode behaviors are described in detail in 3GPP TS 36.304 and TS 36.331.
The signals that carry data between UAs, relay nodes, and access nodes can have frequency, time, and coding parameters and other characteristics that might be specified by a network node. A connection between any of these elements that has a specific set of such characteristics can be referred to as a resource. The terms “resource,” “communications connection,” “channel,” and “communications link” might be used synonymously herein. A network node typically establishes a different resource for each UA or other network node with which it is communicating at any particular time.
For a more complete understanding of this disclosure, reference is now made to the following brief description, taken in connection with the accompanying drawings and detailed description, wherein like reference numerals represent like parts.
It should be understood at the outset that although illustrative implementations of one or more embodiments of the present disclosure are provided below, the disclosed systems and/or methods may be implemented using any number of techniques, whether currently known or in existence. The disclosure should in no way be limited to the illustrative implementations, drawings, and techniques illustrated below, including the exemplary designs and implementations illustrated and described herein, but may be modified within the scope of the appended claims along with their full scope of equivalents.
In radio systems, a cell is a geographical area of reception and transmission coverage. Cells can overlap with each other. In the typical example, there is one access node associated with each cell. The size of a cell is determined by factors such as frequency band, power level, and channel conditions. Relay nodes, such as relay node 102, can be used to enhance coverage within or near a cell, or to extend the size of coverage of a cell. Additionally, the use of a relay node 102 can enhance throughput of a signal within a cell because the UA 110 can access the relay node 102 at a higher data rate or a lower power transmission than the UA 110 might use when communicating directly with the access node 106 for that cell. Transmission at a higher data rate creates higher spectrum efficiency, and lower power benefits the UA 110 by consuming less battery power.
Relay nodes, generally, can be divided into three types: layer one relay nodes, layer two relay nodes, and layer three relay nodes. A layer one relay node is essentially a repeater that can retransmit a transmission without any modification other than amplification and slight delay. A layer two relay node can decode a transmission that it receives, re-encode the result of the decoding, and then transmit the re-encoded data. A layer three relay node can have full radio resource control capabilities and can thus function similarly to an access node. The radio resource control protocols used by a relay node may be the same as those used by an access node, and the relay node may have a unique cell identity typically used by an access node. For the purpose of this disclosure, a relay node is distinguished from an access node by the fact that it requires the presence of at least one access node (and the cell associated with that access node) or other relay node to access other components in a telecommunications system. The illustrative embodiments are primarily concerned with layer two or layer three relay nodes. Therefore, as used herein, the term “relay node” will not refer to layer one relay nodes, unless specifically stated otherwise.
In communication system 100, the links that allow wireless communication can be said to be of three distinct types. First, when the UA 110 is communicating with the access node 106 via the relay node 102, the communication link between the UA 110 and the relay node 102 is said to occur over an access link 108. Second, the communication between the relay node 102 and the access node 106 is said to occur over a relay link 104. Third, communication that passes directly between the UA 110 and the access node 106 without passing through the relay node 102 is said to occur over a direct link 112. The terms “access link,” “relay link,” and “direct link” are used in this document according to the meaning described by
The UA 110 might be a mobile device that can move from one cell to another.
Each of the cells 210 contains a plurality of relay nodes 220. While four relay nodes 220 are shown in each of the cells 210, other numbers of relay nodes 220 could be present, and while the areas covered by the relay nodes 220 are not depicted overlapping, the relay node coverage areas might overlap. When the UA 110 is attached to one of the access nodes 106 via one of the relay nodes 220 and moves out of the coverage area of that relay node 220, the UA 110 might need to attach to the same access node 106 via another relay node 220 or to another access node 106 via another relay node 220.
When a UA is in a cell that has relay nodes, it is sometimes preferable that the UA connect to the cell's access node via a relay node rather than over a direct link. U.S. patent application Ser. No. 12/331,992, filed Dec. 10, 2008, by James Earl Womack, et al, entitled “Method and Apparatus for Discovery of Relay Nodes”, which is incorporated herein by reference as if reproduced in its entirety, discusses how a UA can discover that one or more relay nodes are nearby. The present disclosure deals with techniques for the UA to evaluate the discovered relay nodes and recommend a relay node to which the UA prefers to attach.
In an embodiment, the behavior of a moving UA differs depending on whether the UA is in the idle mode or in the connected mode. UA behavior in the idle mode will be considered first. The UA can save battery life by entering the idle mode in which it reduces its communications with an access node and monitors a signal that the access node provides. The UA can also monitor the power levels of other cells to determine whether it should reselect one of the other cells. An access node can page the UA when the access node needs to initiate communication with the UA, and the UA might then move from the idle mode (or idle state) to the connected mode (or connected state).
In an embodiment, while in the idle mode, the UA determines the signal strengths and related parameters of nearby relay nodes and uses this information to recommend which relay node the UA prefers to attach to when the UA moves from the idle mode to the connected mode. The UA sends its recommendation to an access node, and the access node can decide to accept or reject the recommendation.
The relay nodes may not send broadcast signals, but they typically do send reference symbols on the downlink to the UA. Two measurements have been standardized that measure the power of reference symbols. One is reference signal receive power (RSRP), and the other is reference signal receive quality (RSRQ). RSRP is a linear average of the received power of the cell-specific reference symbols. RSRQ is the ratio of RSRP and carrier received signal strength indication (RSSI).
In an embodiment, the UA does not use these measurements alone to evaluate the relay nodes. Instead, these measurements, or a subset thereof, might be combined with various parameters provided to the UA by an access node to derive a relay node selection rank. For example, the following parameters might be used in any combination to derive the relay node selection rank: an indication of preference or priority, a power offset value, a hysteresis value, an identifier of specific relay nodes, or any metadata about a relay node.
The preference or priority parameter can refer to a relay node that may be preferable for the UA to attach to, even when other nearby relay nodes have higher signal strengths or other parameters that may seem favorable. For example, a relay node in a high traffic area such as an airport terminal might have a higher signal strength than other nearby relay nodes. However, to prevent overloading the relay node, it may be preferable that some UAs attach to the other, lower power relay nodes. The relay node in the high traffic area might be assigned a preference or priority parameter that decreases the likelihood that a UA will attach to it.
The power offset parameter can refer to the difference in signal strength between two neighboring relay nodes. When other factors are not considered, a UA will generally tend to attach to a relay node that has a higher signal strength than nearby relay nodes. For example, when a UA attaches to a relay node, in one embodiment it is more efficient for the UA to stay in the current serving relay node unless a neighboring relay node can provide a higher signal strength. In order for the switch to the neighboring node to be worth the reconfiguration costs, the neighboring node's signal strength needs to be higher than the serving node's signal strength by a set amount, i.e., the power offset parameter. The power offset parameter can be set to zero in some cases.
The hysteresis value is a parameter that can prevent a UA from frequently switching back and forth between relay nodes. Due to vagaries in the strengths of relay node signals, a signal from one relay node that, at most times, is stronger than the signal from another relay node might occasionally be surpassed in strength by the other signal. If a UA always attached to the relay node with the higher signal strength, the UA might repeatedly alternate the relay node to which it attaches as the relay node with the higher signal strength alternates. To prevent this, a hysteresis value can be specified for a plurality of signal strengths such that a UA detaches from a first relay node and attaches to a second relay node only when the signal strength of the second relay node exceeds the signal strength of the first relay node for a specified number of consecutive measurements, throughout a specified length of time, or over some other hysteresis range. In one embodiment, when the signal strength of the neighboring node exceeds the signal strength of the serving node by the power offset for the time specified by the hysteresis value, the UA will detach from the serving node and attach to the neighboring node.
Upon determining the relay node power and receiving these parameters from an access node for a plurality of relay nodes, the UA can calculate a relay node selection rank for each of the relay nodes, determine the relay node with the highest relay node selection rank, and inform the access node that the UA would prefer to attach to the relay node with highest relay node selection rank upon leaving the idle mode. That is, an equation such as the following might be calculated in the UA for each nearby relay node:
RN_Reselect(RN)=RSRP(RN)+Preference(RN)+PowerOffset(RN)+Hysteresis
where RN_Reselect(RN) is the relay node selection rank, RSRP(RN) is the measured relay node power, Preference(RN) is the preference or priority parameter for the relay node, PowerOffset(RN) is the power offset parameter for the relay node, and Hysteresis is the hysteresis parameter for the relay node. Although Preference(RN), PowerOffset(RN), and Hysteresis are described here to be associated with a particular relay node, other possibilities exist. For example, Preference(RN), PowerOffset(RN), and Hysteresis may be associated with the access node associated with the relay node.
Further, it should be understood that RN_Reselect(RN) is not necessarily calculated by a simple addition as shown in the equation, but might be some other combination of data related to one or more of RSRP(RN), Preference(RN), PowerOffset(RN), and Hysteresis. For example, any of these parameters might be converted to a measurement unit that is compatible with the other parameters, or any of these parameters might be multiplied by a weighting factor to give the parameter a greater or lesser significance. The weighting factor of any of the parameters could be set to zero, thus eliminating the parameter from consideration. That is, a subset of the parameters could be used. Also, in other embodiments, other factors might be considered than those above, or other combinations of factors might be considered. An access node might provide the Preference(RN), PowerOffset(RN), and Hysteresis values to the UA through RRC signaling or on a broadcast channel.
To save battery life, an idle UA typically communicates with the network only when the UA moves out of a location so that the UA can be paged if needed in its new location. However, this may not be an appropriate time to report relay node power levels and related information, since the reported power level information is only relevant when the UA moves into the connected mode from the idle mode. In an embodiment, the identity of the relay node that the UA prefers based on the RN_Reselect(RN) value is reported to the access node when the UA is changing from the idle mode to the connected mode. In an embodiment, the identity of the relay node is included in an RRC Connection Setup Complete message or another relevant RRC uplink message that the UA sends to the access node.
When the UA is in the connected mode, a similar relay node measurement procedure and relay node ranking procedure may be applied. This could be initiated by a Radio Resource Control message from the network node or by a mode change of the UA (i.e., switching from the idle mode to the connected mode). For example, when the UA switches from the idle mode to the connected mode, the UA could start to monitor nearby relay nodes and perform a relay node ranking procedure. The UA could then report the results to a network node, i.e., the access node. In one embodiment, the UA recommends a relay node to which to attach based on the ranking procedure and reports the recommended relay node to the access node. The access node may or may not override the UA's recommendation. In another embodiment, the UA reports the candidates and their relative ranking, and the access node selects the relay node to which the UA connects. In an embodiment, a Measurement Report message is used for the UA's reporting. In the connected mode, the UA may continue monitoring the relay nodes and perform the ranking procedure and update the recommended relay node. Alternatively, the UA may monitor the nearby relay nodes only when it switches from the idle mode to the connected mode.
In an embodiment, when the UA is in the connected mode and attached to a relay node, the UA is not handed over from the relay node to another relay node, another cell, another network, another frequency, or another RAT. Instead, the UA is first handed over from the relay node to the access node associated with the relay node. The access node then hands the UA over to the other relay node, cell, network, frequency, or RAT. When the UA is handed over to another relay node, the relay node to which the UA is handed over might be selected based on the relay node selection rank as described above. In an example signaling flow, the access node first sends a Measurement Control Message to the UA, which may include the IDs of the nearby relay nodes, measurement configurations, etc. Then the UA may perform the measurement procedures and, based on the ranking procedure, the UA may send a Handover Request message to the access node which may include the ID of the candidate relay node that the UA wishes to switch to. After the access node receives the Handover Request message, the access node may accept the relay node handover request and send a Handover Command to the UA. Then the UA may start to access the target relay node using the information provided in the Handover Command message.
In another embodiment, when the UA is in the connected mode, the UA is handed over from a relay node directly to another relay node, another cell, another network, another frequency, or another RAT. In an example signaling flow, after the UA performs the relay node ranking and a target relay node is selected, the UA may directly access the target relay node. After the target relay node receives an access message, the target relay node may notify the access node and, if the access node accepts the handover, the target relay node will send an access response to the UA indicating the successful relay handover.
The UA 110 and other components described above might include a processing component that is capable of executing instructions related to the actions described above.
The processor 1310 executes instructions, codes, computer programs, or scripts that it might access from the network connectivity devices 1320, RAM 1330, ROM 1340, or secondary storage 1350 (which might include various disk-based systems such as hard disk, floppy disk, or optical disk). While only one CPU 1310 is shown, multiple processors may be present. Thus, while instructions may be discussed as being executed by a processor, the instructions may be executed simultaneously, serially, or otherwise by one or multiple processors. The processor 1310 may be implemented as one or more CPU chips.
The network connectivity devices 1320 may take the form of modems, modem banks, Ethernet devices, universal serial bus (USB) interface devices, serial interfaces, token ring devices, fiber distributed data interface (FDDI) devices, wireless local area network (WLAN) devices, radio transceiver devices such as code division multiple access (CDMA) devices, global system for mobile communications (GSM) radio transceiver devices, worldwide interoperability for microwave access (WiMAX) devices, and/or other well-known devices for connecting to networks. These network connectivity devices 1320 may enable the processor 1310 to communicate with the Internet or one or more telecommunications networks or other networks from which the processor 1310 might receive information or to which the processor 1310 might output information. The network connectivity devices 1320 might also include one or more transceiver components 1325 capable of transmitting and/or receiving data wirelessly.
The RAM 1330 might be used to store volatile data and perhaps to store instructions that are executed by the processor 1310. The ROM 1340 is a non-volatile memory device that typically has a smaller memory capacity than the memory capacity of the secondary storage 1350. ROM 1340 might be used to store instructions and perhaps data that are read during execution of the instructions. Access to both RAM 1330 and ROM 1340 is typically faster than to secondary storage 1350. The secondary storage 1350 is typically comprised of one or more disk drives or tape drives and might be used for non-volatile storage of data or as an over-flow data storage device if RAM 1330 is not large enough to hold all working data. Secondary storage 1350 may be used to store programs that are loaded into RAM 1330 when such programs are selected for execution.
The I/O devices 1360 may include liquid crystal displays (LCDs), touch screen displays, keyboards, keypads, switches, dials, mice, track balls, voice recognizers, card readers, paper tape readers, printers, video monitors, or other well-known input devices. Also, the transceiver 1325 might be considered to be a component of the I/O devices 1360 instead of or in addition to being a component of the network connectivity devices 1320.
In an embodiment, a method is provided for recommending a relay node to which a user agent attaches. The method includes recommending the relay node based on a relay node selection rank.
In another embodiment, another method is provided for recommending a relay node to which a user agent attaches. The method includes, when the user agent is in a connected mode, handing the user agent over to the relay node after handing the user agent over to an access node.
In another embodiment, a user agent is provided that includes a processor configured to recommend a relay node based on a relay node selection rank.
In another embodiment, a wireless communication system is provided. The system includes a component configured to receive an identity of a relay node recommended based on a relay node selection rank and to promote attaching a user agent to the relay node.
While several embodiments have been provided in the present disclosure, it should be understood that the disclosed systems and methods may be embodied in many other specific forms without departing from the scope of the present disclosure. The present examples are to be considered as illustrative and not restrictive, and the intention is not to be limited to the details given herein. For example, the various elements or components may be combined or integrated in another system or certain features may be omitted, or not implemented.
Also, techniques, systems, subsystems and methods described and illustrated in the various embodiments as discrete or separate may be combined or integrated with other systems, modules, techniques, or methods without departing from the scope of the present disclosure. Other items shown or discussed as coupled or directly coupled or communicating with each other may be indirectly coupled or communicating through some interface, device, or intermediate component, whether electrically, mechanically, or otherwise. Other examples of changes, substitutions, and alterations are ascertainable by one skilled in the art and could be made without departing from the spirit and scope disclosed herein.
This application is a continuation of U.S. patent application Ser. No. 13/865,810 filed on Apr. 18, 2013 entitled, “System and Method for Relay Node Selection”, which is a continuation of U.S. Pat. No. 8,446,856 issued on May 21, 2013 entitled, “System and Method for Relay Node Selection” Ser. No. 12/340,418, which are incorporated by reference herein as if reproduced in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
6014375 | Janky | Jan 2000 | A |
6512745 | Abe et al. | Jan 2003 | B1 |
6690657 | Lau et al. | Feb 2004 | B1 |
6785510 | Larsen | Aug 2004 | B2 |
7054633 | Seo et al. | May 2006 | B2 |
7061879 | Oprescu-Surcobe et al. | Jun 2006 | B2 |
7130614 | Sreemanthula et al. | Oct 2006 | B2 |
7227851 | Gopalakrishnan et al. | Jun 2007 | B1 |
7349665 | Zhu et al. | Mar 2008 | B1 |
7386036 | Pasanen | Jun 2008 | B2 |
7564827 | Das et al. | Jul 2009 | B2 |
7577124 | Yomo et al. | Aug 2009 | B2 |
7602843 | Cho et al. | Oct 2009 | B2 |
7673211 | Meyer et al. | Mar 2010 | B2 |
7706408 | Takagi et al. | Apr 2010 | B2 |
7724767 | Oksman | May 2010 | B2 |
7742448 | Ramachandran et al. | Jun 2010 | B2 |
7830837 | Park et al. | Nov 2010 | B2 |
7873002 | Cai | Jan 2011 | B2 |
7898948 | DiGirolamo et al. | Mar 2011 | B2 |
8040904 | Cai et al. | Oct 2011 | B2 |
8072918 | Muharemovic et al. | Dec 2011 | B2 |
8121552 | Agami et al. | Feb 2012 | B2 |
8175014 | Terry et al. | May 2012 | B2 |
8228851 | Wu | Jul 2012 | B2 |
8234534 | Park et al. | Jul 2012 | B2 |
8265016 | Xu | Sep 2012 | B2 |
8265128 | Yu et al. | Sep 2012 | B2 |
8281211 | Wang et al. | Oct 2012 | B2 |
8311061 | Yu et al. | Nov 2012 | B2 |
8335466 | Cai et al. | Dec 2012 | B2 |
8355388 | Womack et al. | Jan 2013 | B2 |
8391202 | Courseille | Mar 2013 | B2 |
8402334 | Yu et al. | Mar 2013 | B2 |
8428016 | Bhattad et al. | Apr 2013 | B2 |
8446856 | Womack et al. | May 2013 | B2 |
8576882 | Zhang et al. | Nov 2013 | B2 |
8605674 | Park et al. | Dec 2013 | B2 |
8699547 | Yu et al. | Apr 2014 | B2 |
8824359 | Cai et al. | Sep 2014 | B2 |
8837303 | Yu et al. | Sep 2014 | B2 |
8848594 | Womack et al. | Sep 2014 | B2 |
8856607 | Yu et al. | Oct 2014 | B2 |
9191878 | Womack et al. | Nov 2015 | B2 |
20020032032 | Haumont et al. | Mar 2002 | A1 |
20020155839 | Nisbet | Oct 2002 | A1 |
20020187746 | Cheng et al. | Dec 2002 | A1 |
20030096631 | Kayama et al. | May 2003 | A1 |
20030101274 | Yi et al. | May 2003 | A1 |
20030103480 | You et al. | Jun 2003 | A1 |
20040042492 | Suzuki et al. | Mar 2004 | A1 |
20040063451 | Bonta et al. | Apr 2004 | A1 |
20040266339 | Larsson | Dec 2004 | A1 |
20050014464 | Larsson | Jan 2005 | A1 |
20050037798 | Yamashita et al. | Feb 2005 | A1 |
20050042987 | Lee et al. | Feb 2005 | A1 |
20050148311 | Anderson | Jul 2005 | A1 |
20050232212 | Kang | Oct 2005 | A1 |
20060183421 | Proctor, Jr. et al. | Aug 2006 | A1 |
20060239455 | Kato | Oct 2006 | A1 |
20070002766 | Park et al. | Jan 2007 | A1 |
20070058661 | Chow | Mar 2007 | A1 |
20070070953 | Yoon et al. | Mar 2007 | A1 |
20070081483 | Jang et al. | Apr 2007 | A1 |
20070082621 | Lee et al. | Apr 2007 | A1 |
20070086387 | Kang | Apr 2007 | A1 |
20070097945 | Wang et al. | May 2007 | A1 |
20070104148 | Kang et al. | May 2007 | A1 |
20070153734 | Lee et al. | Jul 2007 | A1 |
20070155315 | Lee et al. | Jul 2007 | A1 |
20070171925 | Tanimoto | Jul 2007 | A1 |
20070206531 | Pajukoski et al. | Sep 2007 | A1 |
20070230605 | Osseiran et al. | Oct 2007 | A1 |
20070253421 | Cai | Nov 2007 | A1 |
20070274250 | Chen et al. | Nov 2007 | A1 |
20070287476 | Jeong et al. | Dec 2007 | A1 |
20070291696 | Zhang et al. | Dec 2007 | A1 |
20080002610 | Zheng et al. | Jan 2008 | A1 |
20080025248 | Naden | Jan 2008 | A1 |
20080025323 | Khan | Jan 2008 | A1 |
20080043671 | Moon et al. | Feb 2008 | A1 |
20080043710 | Zhou et al. | Feb 2008 | A1 |
20080056173 | Watanbe | Mar 2008 | A1 |
20080081628 | Ye et al. | Apr 2008 | A1 |
20080089282 | Malladi et al. | Apr 2008 | A1 |
20080101306 | Bertrand et al. | May 2008 | A1 |
20080101498 | Han et al. | May 2008 | A1 |
20080102794 | Keevill et al. | May 2008 | A1 |
20080107072 | Viorel et al. | May 2008 | A1 |
20080107076 | Ramachandran et al. | May 2008 | A1 |
20080107078 | Viorel et al. | May 2008 | A1 |
20080108303 | Okuda | May 2008 | A1 |
20080108304 | Suga | May 2008 | A1 |
20080159337 | Lee | Jul 2008 | A1 |
20080165776 | Tao et al. | Jul 2008 | A1 |
20080174470 | Lum et al. | Jul 2008 | A1 |
20080212513 | Tao et al. | Sep 2008 | A1 |
20080225765 | Marinier et al. | Sep 2008 | A1 |
20080225772 | Xu | Sep 2008 | A1 |
20080227449 | Gholmieh et al. | Sep 2008 | A1 |
20080227461 | Dayal et al. | Sep 2008 | A1 |
20080232284 | Dalsgaard et al. | Sep 2008 | A1 |
20080232493 | Zhang et al. | Sep 2008 | A1 |
20080247375 | Muharemovic et al. | Oct 2008 | A1 |
20080285500 | Zhang et al. | Nov 2008 | A1 |
20080285501 | Zhang et al. | Nov 2008 | A1 |
20080293358 | Andersson et al. | Nov 2008 | A1 |
20080310389 | Suzuki et al. | Dec 2008 | A1 |
20080311904 | Courseille | Dec 2008 | A1 |
20090010199 | Adachi et al. | Jan 2009 | A1 |
20090046641 | Wang et al. | Feb 2009 | A1 |
20090061892 | Lee et al. | Mar 2009 | A1 |
20090061920 | Horiuchi et al. | Mar 2009 | A1 |
20090111476 | Hamalainen et al. | Apr 2009 | A1 |
20090116423 | Ni et al. | May 2009 | A1 |
20090154533 | Khayrallah et al. | Jun 2009 | A1 |
20090190522 | Horn et al. | Jul 2009 | A1 |
20090191882 | Kovacs et al. | Jul 2009 | A1 |
20090196177 | Teyeb et al. | Aug 2009 | A1 |
20090196332 | Miyatani | Aug 2009 | A1 |
20090239568 | Bertrand et al. | Sep 2009 | A1 |
20090252079 | Zhang et al. | Oct 2009 | A1 |
20090252088 | Rao et al. | Oct 2009 | A1 |
20090264077 | Damnjanovic | Oct 2009 | A1 |
20090276672 | Lee et al. | Nov 2009 | A1 |
20090291679 | Wu | Nov 2009 | A1 |
20090303918 | Ma et al. | Dec 2009 | A1 |
20090313518 | Shen et al. | Dec 2009 | A1 |
20090325480 | Ji et al. | Dec 2009 | A1 |
20090325618 | Aiba et al. | Dec 2009 | A1 |
20100003977 | Pinheiro et al. | Jan 2010 | A1 |
20100005351 | Ahn et al. | Jan 2010 | A1 |
20100027457 | Okuda | Feb 2010 | A1 |
20100027458 | Wu et al. | Feb 2010 | A1 |
20100039947 | Li et al. | Feb 2010 | A1 |
20100046413 | Jin et al. | Feb 2010 | A1 |
20100046418 | Horn et al. | Feb 2010 | A1 |
20100056197 | Attar et al. | Mar 2010 | A1 |
20100061361 | Wu | Mar 2010 | A1 |
20100074209 | Montojo et al. | Mar 2010 | A1 |
20100080166 | Palanki et al. | Apr 2010 | A1 |
20100091759 | Stahl et al. | Apr 2010 | A1 |
20100098045 | Miyazaki | Apr 2010 | A1 |
20100103845 | Ulupinar et al. | Apr 2010 | A1 |
20100110967 | Sartori et al. | May 2010 | A1 |
20100120442 | Zhuang et al. | May 2010 | A1 |
20100131814 | Chiu | May 2010 | A1 |
20100135231 | Harada et al. | Jun 2010 | A1 |
20100135251 | Sambhwani et al. | Jun 2010 | A1 |
20100150022 | Cai et al. | Jun 2010 | A1 |
20100182992 | Chun et al. | Jul 2010 | A1 |
20100184434 | Jeong et al. | Jul 2010 | A1 |
20100202307 | Lee et al. | Aug 2010 | A1 |
20100271999 | Yu et al. | Oct 2010 | A1 |
20100296431 | Terry et al. | Nov 2010 | A1 |
20100297993 | Heo et al. | Nov 2010 | A1 |
20100302998 | Bao et al. | Dec 2010 | A1 |
20100322145 | Yu et al. | Dec 2010 | A1 |
20100322194 | Hu et al. | Dec 2010 | A1 |
20100323612 | Xu et al. | Dec 2010 | A1 |
20100323614 | Yu et al. | Dec 2010 | A1 |
20100323684 | Cai et al. | Dec 2010 | A1 |
20100325506 | Cai et al. | Dec 2010 | A1 |
20110026409 | Hu et al. | Feb 2011 | A1 |
20110041027 | Fong et al. | Feb 2011 | A1 |
20110044234 | Cai et al. | Feb 2011 | A1 |
20110092212 | Kubota | Apr 2011 | A1 |
20110110258 | Ishii et al. | May 2011 | A1 |
20110261763 | Chun et al. | Oct 2011 | A1 |
20110310897 | Cai et al. | Dec 2011 | A1 |
20110310912 | Cai et al. | Dec 2011 | A1 |
20110317648 | Lee et al. | Dec 2011 | A1 |
20120057560 | Park et al. | Mar 2012 | A1 |
20130094431 | Terry et al. | Apr 2013 | A1 |
20140286234 | Yu et al. | Sep 2014 | A1 |
20140362755 | Yu et al. | Dec 2014 | A1 |
20150163821 | Wu | Jun 2015 | A1 |
Number | Date | Country |
---|---|---|
1941666 | Apr 2007 | CN |
1960352 | May 2007 | CN |
101047431 | Oct 2007 | CN |
101141171 | Mar 2008 | CN |
101217337 | Jul 2008 | CN |
101222299 | Jul 2008 | CN |
101257492 | Sep 2008 | CN |
101296060 | Oct 2008 | CN |
1534035 | May 2005 | EP |
1773091 | Apr 2007 | EP |
1775983 | Apr 2007 | EP |
1883178 | Jan 2008 | EP |
1890402 | Feb 2008 | EP |
1919234 | May 2008 | EP |
1924009 | May 2008 | EP |
1940185 | Jul 2008 | EP |
1959708 | Aug 2008 | EP |
1995921 | Nov 2008 | EP |
2242306 | Oct 2010 | EP |
2004328665 | Nov 2004 | JP |
2006311253 | Nov 2006 | JP |
2007312244 | Nov 2007 | JP |
2008034335 | Feb 2008 | JP |
2008060951 | Mar 2008 | JP |
2008511210 | Apr 2008 | JP |
2008104096 | May 2008 | JP |
2008118499 | May 2008 | JP |
2008118500 | May 2008 | JP |
2008118651 | May 2008 | JP |
2008118652 | May 2008 | JP |
2008131649 | May 2008 | JP |
2008167141 | Jul 2008 | JP |
2008172754 | Jul 2008 | JP |
2008172759 | Jul 2008 | JP |
2008537379 | Sep 2008 | JP |
2008271270 | Nov 2008 | JP |
2009520435 | May 2009 | JP |
2009521891 | Jun 2009 | JP |
2009524323 | Jun 2009 | JP |
2009182944 | Aug 2009 | JP |
2009188926 | Aug 2009 | JP |
2009531898 | Sep 2009 | JP |
2009539299 | Nov 2009 | JP |
2010504665 | Feb 2010 | JP |
2010506447 | Feb 2010 | JP |
2010103638 | May 2010 | JP |
2010136337 | Jun 2010 | JP |
0137590 | May 2001 | WO |
2005064872 | Jul 2005 | WO |
2006024321 | Mar 2006 | WO |
2007048247 | May 2007 | WO |
2007053950 | May 2007 | WO |
2007053954 | May 2007 | WO |
2007060731 | May 2007 | WO |
2007064249 | Jun 2007 | WO |
2007073121 | Jun 2007 | WO |
2007078142 | Jul 2007 | WO |
2007083230 | Jul 2007 | WO |
2007110447 | Oct 2007 | WO |
2007131347 | Nov 2007 | WO |
2008004806 | Jan 2008 | WO |
2008009228 | Jan 2008 | WO |
2008022132 | Feb 2008 | WO |
2008034335 | Mar 2008 | WO |
2008040930 | Apr 2008 | WO |
2008047870 | Apr 2008 | WO |
2008050961 | May 2008 | WO |
2008078365 | Jul 2008 | WO |
2008084949 | Jul 2008 | WO |
2008103981 | Aug 2008 | WO |
2008109912 | Sep 2008 | WO |
2008115826 | Sep 2008 | WO |
2008133307 | Nov 2008 | WO |
2008149979 | Dec 2008 | WO |
2009017005 | Feb 2009 | WO |
2009088172 | Jul 2009 | WO |
2009154038 | Dec 2009 | WO |
2010002100 | Jan 2010 | WO |
Entry |
---|
Office Action dated May 23, 2014; U.S. Appl. No. 13/716,839, filed Dec. 17, 2012; 76 pages. |
Notice of Allowance dated Jun. 23, 2014; U.S. Appl. No. 13/716,839, filed Dec. 17, 2012; 10 pages. |
Office Action dated Sep. 11, 2013; U.S. Appl. No. 13/842,584, filed Mar. 15, 2013; 55 pages. |
Final Office Action dated Feb. 28, 2014; U.S. Appl. No. 13/842,584, filed Mar. 15, 2013; 9 pages. |
Advisory Action dated Apr. 17, 2014; U.S. Appl. No. 13/842,584, filed Mar. 15, 2013; 2 pages. |
Notice of Allowance dated Aug. 11, 2014; U.S. Appl. No. 13/842,584, filed Mar. 15, 2013; 30 pages. |
Office Action dated Dec. 20, 2013; U.S. Appl. No. 13/865,810, filed Apr. 18, 2013; 72 pages. |
Office Action dated May 16, 2014; U.S. Appl. No. 13/865,810, filed Apr. 18, 2013; 31 pages. |
Final Office Action dated Sep. 17, 2014; U.S. Appl. No. 13/865,810, filed Apr. 18, 2013; 42 pages. |
Office Action dated Oct. 16, 2014; U.S. Appl. No. 13/865,810, filed Apr. 18, 2013; 38 pages. |
Final Office Action dated Mar. 23, 2015; U.S. Appl. No. 13/865,810, filed Apr. 18, 2013; 43 pages. |
Advisory Action dated Jun. 12, 2015; U.S. Appl. No. 13/865,810, filed Apr. 18, 2013; 3 pages. |
Notice of Allowance dated Jul. 24, 2015; U.S. Appl. No. 13/865,810, filed Apr. 18, 2013; 14 pages. |
Office Action dated Oct. 19, 2015; U.S. Appl. No. 14/298,629, filed Jun. 6, 2014; 89 pages. |
Office Action dated Sep. 10, 2015; U.S. Appl. No. 14/465,528, filed Aug. 21, 2014; 8 pages. |
PCT International Search Report; PCT Application No. PCT/US2009/030967; dated Sep. 8, 2009; 5 pages. |
PCT Written Opinion of the International Searching Authority; PCT Application No. PCT/US2009/030967; dated Sep. 8, 2009; 9 pages. |
Australian Examination Report; Application No. 2009325082; dated Jul. 11, 2011; 2 pages. |
Australian Examination Report; Application No. 2009325082; dated Mar. 28, 2012; 3 pages. |
Canadian Office Action; Application No. 2,746,635; dated Apr. 18, 2013; 3 pages. |
Canadian Office Action; Application No. 2,746,635; dated Jan. 14, 2014; 3 pages. |
Canadian Office Action; Application No. 2,746,635; dated Jan. 22, 2015; 4 pages. |
Chinese Office Action; Application No. 200980149651.4; dated Aug. 23, 2013, 14 pages. |
Chinese Office Action as Received in Co-pending Application No. 200980149651.4 dated May 6, 2014; 3 pages. (No English translation available). |
Chinese Office Action; Application No. 200980149651.4; dated Nov. 24, 2014; 12 pages. |
Chinese Office Action; Application No. 200980149651.4; dated Jun. 5, 2015; 13 pages. |
Japanese Office Action; Application No. 2011-540716; dated Oct. 4, 2012; 15 pages. |
Japanese Office Action as Received in Co-pending Application No. 2011-540716 dated Dec. 13, 2013; 3 pages. (No English translation available). |
Korean Office Action; Application No. 10-2011-7015882; dated Sep. 18, 2012; 10 pages. |
Korean Office Action; Application No. 10-2011-7015882; dated Mar. 21, 2013; 7 pages. |
PCT International Search Report; PCT Application No. PCT/US2009/062551; dated Jan. 28, 2010; 4 pages. |
PCT Written Opinion of the International Searching Authority; PCT Application No. PCT/US2009/062551; dated Jan. 28, 2010; 5 pages. |
Canadian Office Action; Application No. 2,747,593; dated May 24, 2013; 3 pages. |
Canadian Office Action; Application No. 2,747,593; dated May 28, 2014; 4 pages. |
Canadian Office Action; Application No. 2,747,593; dated Mar. 26, 2015; 3 pages. |
PCT International Search Report; PCT Application No. PCT/US2009/062554; dated May 12, 2010; 6 pages. |
PCT Written Opinion of the International Searching Authority; PCT Application No. PCT/US2009/062554; dated May 12, 2010; 7 pages. |
Australian Office Action; Application No. 2009333788; dated Dec. 8, 2011; 3 pages. |
Canadian Office Action; Application No. 2,747,339; dated May 1, 2013; 2 pages. |
Canadian Office Action; Application No. 2,747,339; dated May 6, 2014; 2 pages. |
Chinese Office Action; Application No. 200980156929.0; dated Aug. 1, 2013; 14 pages. |
Chinese Office Action; Application No. 200980156929.0; dated Feb. 12, 2014; 13 pages. |
Chinese Office Action; Application No. 200980156929.0; dated Sep. 2, 2014; 7 pages. |
European Examination Report; Application No. 09748915.7 dated May 14, 2012; 3 pages. |
Japanese Office Action; Application No. 2011-542161; dated Nov. 1, 2012; 17 pages. |
Japanese Office Action; Application No. 2011-542161; dated Aug. 29, 2013; 7 pages. |
Korean Office Action; Application No. 10-2011-7016626; dated Jul. 17, 2012; 7 pages. |
Korean Office Action; Application No. 10-2011-7016626; dated Oct. 26, 2012; 8 pages. |
Korean Office Action; Application No. 10-2011-7016626; dated May 20, 2013; 5 pages. |
PCT International Search Report; PCT Application No. PCT/US2009/062557; dated Feb. 10, 2010; 4 pages. |
Office Action dated Jun. 16, 2011; U.S. Appl. No. 12/340,412, filed Dec. 19, 2008; 33 pages. |
Final Office Action dated Nov. 8, 2011; U.S. Appl. No. 12/340,412, filed Dec. 19, 2008; 19 pages. |
Office Action dated Feb. 17, 2012; U.S. Appl. No. 12/340,412, filed Dec. 19, 2008; 19 pages. |
Notice of Allowance dated Aug. 10, 2012; U.S. Appl. No. 12/340,412, filed Dec. 19, 2008; 17 pages. |
Office Action dated Jul. 12, 2010, 40 pages, U.S. Appl. No. 12/337,207, filed Dec. 17, 2008. |
Office Action dated Jan. 25, 2011, 39 pages, U.S. Appl. No. 12/337,207, filed Dec. 17, 2008. |
Office Action dated Jul. 13, 2011; U.S. Appl. No. 12/337,207, filed Dec. 17, 2008; 34 pages. |
Final Office Action dated Dec. 16, 2011; U.S. Appl. No. 12/337,207, filed Dec. 17, 2008; 37 pages. |
Advisory Action dated Mar. 2, 2012; U.S. Appl. No. 12/337,207, filed Dec. 17, 2008; 3 pages. |
Notice of Allowance dated Jun. 12, 2012; U.S. Appl. No. 12/337,207, filed Dec. 17, 2008; 20 pages. |
Office Action dated Oct. 12, 2012; U.S. Appl. No. 13/548,817, filed Jul. 13, 2012; 53 pages. |
Final Office Action dated Jan. 24, 2013; U.S. Appl. No. 13/548,817, filed Jul. 13, 2012; 33 pages. |
Advisory Action dated Apr. 12, 2013; U.S. Appl. No. 13/548,817, filed Jul. 13, 2012; 8 pages. |
Office Action dated Sep. 13, 2013; U.S. Appl. No. 13/548,817, filed Jul. 13, 2012; 37 pages. |
Notice of Allowance dated Mar. 17, 2014; U.S. Appl. No. 13/548,817, filed Jul. 13, 2012; 33 pages. |
Office Action dated Jul. 22, 2011; U.S. Appl. No. 12/337,235, filed Dec. 17, 2008; 36 pages. |
Final Office Action dated Jan. 9, 2012; U.S. Appl. No. 12/337,235, filed Dec. 17, 2008; 26 pages. |
Advisory Action dated Mar. 22, 2012; U.S. Appl. No. 12/337,235, filed Dec. 17, 2008; 10 pages. |
Notice of Allowance dated Sep. 11, 2012; U.S. Appl. No. 12/337,235, filed Dec. 17, 2008; 16 pages. |
Office Action dated May 26, 2010, 9 pages, U.S. Appl. No. 12/337,214, filed Dec. 17, 2008. |
Notice of Allowance dated Nov. 8, 2010, 10 pages, U.S. Appl. No. 12/337,214, filed Dec. 17, 2008. |
Notice of Allowance dated Mar. 25, 2011, 11 pages, U.S. Appl. No. 12/337,214, filed Dec. 17, 2008. |
Notice of Allowance dated May 27, 2011; U.S. Appl. No. 12/337,214, filed Dec. 17, 2008; 10 pages. |
Office Action dated Aug. 9, 2012; U.S. Appl. No. 12/916,214, filed Oct. 29, 2010; 51 pages. |
Final Office Action dated Nov. 27, 2012; U.S. Appl. No. 12/916,214, filed Oct. 29, 2010; 16 pages. |
Office Action dated Jul. 18, 2011; U.S. Appl. No. 12/340,432, filed Dec. 19, 2008; 6 pages. |
Office Action dated Sep. 16, 2011; U.S. Appl. No. 12/340,432, filed Dec. 19, 2008; 33 pages. |
Final Office Action dated Mar. 23, 2012; U.S. Appl. No. 12/340,432, filed Dec. 19, 2008; 28 pages. |
Notice of Allowance dated Jun. 20, 2012; U.S. Appl. No. 12/340,432, filed Dec. 19, 2008; 23 pages. |
Office Action dated Nov. 10, 2011; U.S. Appl. No. 13/216,819, filed Aug. 24, 2011; 19 pages. |
Final Office Action dated Apr. 19, 2012; U.S. Appl. No. 13/216,819, filed Aug. 24, 2011; 39 pages. |
Office Action dated Apr. 18, 2013; U.S. Appl. No. 13/216,819, filed Aug. 24, 2011; 37 pages. |
Final Office Action dated Sep. 17, 2013; U.S. Appl. No. 13/216,819, filed Aug. 24, 2011; 22 pages. |
Notice of Allowance dated Nov. 25, 2013; U.S. Appl. No. 13/216,819, filed Aug. 24, 2011; 16 pages. |
Office Action dated Aug. 17, 2010, 25 pages, U.S. Appl. No. 12/337,222, filed Dec. 17, 2008. |
Final Office Action dated Jan. 14, 2011, 16 pages, U.S. Appl. No. 12/337,222, filed Dec. 17, 2008. |
Office Action dated Feb. 1, 2012; U.S. Appl. No. 12/337,222, filed Dec. 17, 2008; 20 pages. |
Final Office Action dated Jun. 7, 2012; U.S. Appl. No. 12/337,222, filed Dec. 17, 2008; 16 pages. |
Office Action dated Dec. 3, 2012; U.S. Appl. No. 12/337,222, filed Dec. 17, 2008; 24 pages. |
Office Action dated May 29, 2013; U.S. Appl. No. 12/337,222, filed Dec. 17, 2008; 26 pages. |
Final Office Action dated Nov. 20, 2013; U.S. Appl. No. 12/337,222, filed Dec. 17, 2008; 28 pages. |
Office Action dated Jan. 31, 2013; U.S. Appl. No. 13/221,583, filed Aug. 30, 2011; 69 pages. |
Office Action dated May 10, 2013; U.S. Appl. No. 13/221,583, filed Aug. 30, 2011; 21 pages. |
Final Office Action dated Sep. 6, 2013; U.S. Appl. No. 13/221,583, filed Aug. 30, 2011; 23 pages. |
Advisory Action dated Dec. 6, 2013; U.S. Appl. No. 13/221,583, filed Aug. 30, 2011; 3 pages. |
Office Action dated Mar. 4, 2014; U.S. Appl. No. 13/221,583, filed Aug. 30, 2011; 33 pages. |
Final Office Action dated Jul. 10, 2014; U.S. Appl. No. 13/221,583, filed Aug. 30, 2011; 19 pages. |
Advisory Action dated Sep. 16, 2014; U.S. Appl. No. 13/221,583, filed Aug. 30, 2011; 18 pages. |
Office Action dated Feb. 5, 2013; U.S. Appl. No. 13/221,584, filed Aug. 30, 2011; 65 pages. |
Final Office Action dated May 14, 2013; U.S. Appl. No. 13/221,584, filed Aug. 30, 2011; 15 pages. |
PCT Written Opinion of the International Searching Authority; PCT Application No. PCT/US2009/062557; dated Feb. 10, 2010; 7 pages. |
Canadian Office Action; Application No. 2,747,625; dated May 3, 2013; 3 pages. |
European Examination Report; Application No. 09761065.3; dated May 7, 2012; 4 pages. |
European Examination Report; Application No. 09761065.3; dated May 16, 2013; 3 pages. |
Chinese Office Action; Application No. 200980157135.6; dated Jul. 25, 2013; 13 pages. |
Japanese Office Action; Application No. 2011-542162; dated Oct. 17, 2012; 10 pages. |
Japanese Office Action; Application No. 2013-066527; dated Jan. 23, 2014; 4 pages. |
PCT International Search Report; PCT Application No. PCT/US2009/062560; dated Mar. 1, 2010; 4 pages. |
PCT Written Opinion of the International Searching Authority; PCT Application No. PCT/US2009/062560; dated Mar. 1, 2010; 7 pages. |
Canadian Office Action; Application No. 2,747,343; dated May 24, 2013; 3 pages. |
Chinese Office Action; Application No. 200980156891.7; dated Jul. 19, 2013; 34 pages. |
Japanese Office Action; Application No. 2011-542163; dated Dec. 18, 2012; 7 pages. |
Japanese Office Action; Application No. 2011-542163; dated Jul. 18, 2013; 10 pages. |
PCT International Search Report; PCT Application No. PCT/US2009/062570; dated Feb. 22, 2010; 4 pages. |
PCT Written Opinion of the International Searching Authority; PCT Application No. PCT/US2009/062570; dated Feb. 22, 2010; 8 pages. |
Canadian Office Action; Application No. 2,750,828; dated Apr. 4, 2013; 4 pages. |
Chinese Office Action; Application No. 200980156931.8; dated Jul. 3, 2013; 28 pages. |
European Examination Report; Application No. 09756080.9; dated Jun. 15, 2012; 5 pages. |
Japanese Office Action; Application No. 2011-542164; dated Oct. 26, 2012; 7 pages. |
PCT International Search Report; PCT Application No. PCT/US2009/062571; dated Apr. 19, 2010; 6 pages. |
PCT Written Opinion of the International Searching Authority; PCT Application No. PCT/US2009/062571; dated Apr. 19, 2010; 6 pages. |
PCT International Preliminary Report on Patentability; PCT Application No. PCT/US2009/062571; dated Mar. 10, 2011; 8 pages. |
Canadian Office Action; Application No. 2,747,349; dated Jul. 12, 2013; 3 pages. |
Canadian Office Action; Application No. 2,747,349; dated Jun. 4, 2014; 3 pages. |
Chinese Office Action; Application No. 200980156892.1; dated Jul. 23, 2013; 16 pages. |
Chinese Office Action; Application No. 200980156892.1; dated Dec. 31, 2013; 16 pages. |
Chinese Office Action; Application No. 200980156892.1; dated Apr. 2, 2014; 20 pages. |
Japanese Office Action; Application No. 2011-542165; dated Oct. 26, 2012; 7 pages. |
Japanese Office Action; Application No. 2011-542165; dated Jun. 20, 2013; 7 pages. |
Japanese Office Action; Application No. 2011-542165; dated Nov. 6, 2013; 5 pages. |
Korean Office Action; Application No. 10-2011-7016425; dated Oct. 30, 2012; 9 pages. |
PCT International Search Report; PCT Application No. PCT/US2009/062574; dated Jul. 19, 2010; 6 pages. |
PCT Written Opinion of the International Searching Authority; PCT Application No. PCT/US2009/062574; dated Jul. 19, 2010; 9 pages. |
European Examination Report; Application No. 09752588.5; dated Aug. 28, 2015; 7 pages. |
PCT International Search Report; PCT Application No. PCT/US2009/064398; dated Mar. 18, 2010; 5 pages. |
PCT Written Opinion of the International Searching Authority; PCT Application No. PCT/US2009/064398; dated Mar. 18, 2010; 9 pages. |
Canadian Office Action; Application No. 2,747,377; dated Aug. 19, 2013; 3 pages. |
Chinese Office Action; Application No. 200980156928.6; dated Sep. 23, 2013; 15 pages. |
Japanese Office Action; Application No. 2011-542177; dated Oct. 26, 2012; 10 pages. |
Japanese Office Action; Application No. 2011-542177; dated Apr. 26, 2013; 12 pages. |
Japanese Office Action as Received in Co-pending Application No. 2011-540716 dated Aug. 22, 2014; 2 pages. (No English translation available). |
Soldani, David, et al.; Title: Wireless Relays for Broadband Access; IEEE Communications Magazine; Mar. 2008. pp. 58-66. |
Office Action dated Mar. 2, 2016; U.S. Appl. No. 12/916,214, filed Oct. 29, 2010; 55 pages. |
Final Office Action dated Mar. 24, 2016; U.S. Appl. No. 14/298,629, filed Jun. 6, 2014; 18 pages. |
Notice of Allowance dated Feb. 24, 2016; U.S. Appl. No. 14/465,528, filed Aug. 21, 2014; 89 pages. |
European Examination Report; Application No. 09789422.4; dated May 2, 2016; 7 pages. |
Chinese Office Action as Received in Co-pending Application No. 200980156892.1 dated Feb. 15, 2015; 6 pages. (No English translation available). |
Doppler, Klaus, et al.; “Assessment of Relay Based Deployment Concepts and Detailed Description of Multi-hop Capable RAN Protocols as Input for the Concept Group Work”; IST-4-027756 Winner II; D3.5.2 v1.0; Jun. 30, 2007; 24 pages. |
Ericsson; TSG-RAN WG1 #53; Title: A Discussion on Some Technology Components for LTE-Advanced; R1-082024; Kansas City, Missouri; May 5-9, 2008; 11 pages. |
IEEE P802.16j/D9; Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems—Multihop Relay Specification; Draft Amendment to IEEE Standard for Local and Metropolitan Area Networks; Feb. 4, 2009; 314 pages. |
Mitsubishi Electric; 3GPP TSG RAN WG1 #54 Meeting; Title: Basic Structure of Relaying under Multi-Antenna eNB; R1-082775; Jeju Island, Korea; Aug. 18-22, 2008; 4 pages. |
Motorola; Title: Classification of Relays; TSG-RAN WG1 #54; R1-083223; Jeju, South Korea; Aug. 18-22, 2008; 3 pages. |
Pabst, Ralf et al.; Title: Relay-Based Deployment Concepts for Wireless and Mobile Broadband Radio; IEEE Communications Magazine; Sep. 2004; pp. 80-89. |
3GPP TSG RAN WG1 Meeting #54; “Discussion on the Various Types of Relays”; R1-082397; Warsaw, Poland; Jun. 30-Jul. 4, 2008; 6 pages. |
Panasonic; 3GPP TSG RAN WG1 Meeting #54bis; Title: Discussion on the TD Relay and FD Relay for FDD System; R1-083676; Prague, Czech Republic; Sep. 29-Oct. 3, 2008; 5 pages. |
Qualcomm Europe; 3GPP TSG-RAN WG1 #54; Title: Operation of Relays in LTE-A; R1-083191; Jeju, S. Korea; Aug. 18-22, 2008; 5 pages. |
3GPP TSG RAN WG1 Meeting #55; “L2 Relay Interference Mitigation”; R1-084102; Prague, Czech Republic; Nov. 10-14, 2008; 6 pages. |
3GPP TSG RAN WG1 Meeting #55-bis; “Relay Control Signalling Resource Coordination”; R1-090027; Ljubljana, Slovenia; Jan. 12-16, 2009; 3 pages. |
Samsung; 3GPP TSG RAN WG1 Meeting #53bis; Title: Application of Network Coding in LTE-Advanced Relay; R1-082327; Warsaw, Poland; Jun. 30-Jul. 4, 2008; 4 pages. |
3GPP TSG RAN WG1 #54bis; “Decode and Forward Relays for E-UTRA Enhancements”; R1-083533; Prague, Czech Republic; Sep. 29-Oct. 3, 2008; 5 pages. |
Parkvall, Stefan, et al.; “The Evolution of WCDMA Towards Higher Speed Downlink Packet Data Access”; IEEE VTC; May 6, 2001; 5 pages. |
Rohde & Schwarz; “UMTS Long Term Evolution (LTE) Technology Introduction;” Application Note 1MA111; Sep. 2008; 55 pages. |
3GPP TSG RAN WG3 Meeting #57; “Correction of Synchronization, Handover, Trace, eMBMS Architecture, and S1 Common Functions and Procedures”; R3-071695/R2-073880; Athens, Greece; Aug. 20-24, 2007; 108 pages. |
3GPP TSG-RAN-WG1 Meeting #54bis; “Further Details and Considerations of Different Types of Relays”; R1-083712; Prague, Czech Republic; Sep. 29-Oct. 3, 2008; 6 pages. |
Sendonaris, Andrew, et al.; “User Cooperation Diversity—Part I: System Description”; IEEE Transactions on communications; vol. 51, No. 11; Nov. 2003; 12 pages. |
Sendonaris, Andrew, et al.; “User Cooperation Diversity—Part II: Implementation Aspects and Performance Analysis”; IEEE Transactions on Communications; vol. 51, No. 11; Nov. 2003; 10 pages. |
Tao, Jeffrey Z., et al.; “Aggregation in 802.16j—Enhanced Concatenation and MPDU Construction”; IEEE C802.16j-06/178r2; Nov. 7, 2006; 18 pages. |
Masato, Okuda, et al.; “MAC-PDU Reconstruction at RS”; IEEE C802.16j-07/022; Jan. 8, 2007; 3 pages. |
Office Action dated Aug. 19, 2011; U.S. Appl. No. 12/331,992, filed Dec. 10, 2008; 52 pages. |
Final Office Action dated Dec. 9, 2011; U.S. Appl. No. 12/331,992, filed Dec. 10, 2008; 24 pages. |
Office Action dated Feb. 14, 2014; U.S. Appl. No. 12/331,992, filed Dec. 10, 2008; 81 pages. |
Notice of Allowance dated Jun. 24, 2014; U.S. Appl. No. 12/331,992, filed Dec. 10, 2008; 10 pages. |
Office Action dated Jul. 21, 2011; U.S. Appl. No. 12/340,418, filed Dec. 19, 2008; 34 pages. |
Final Office Action dated Jan. 5, 2012; U.S. Appl. No. 12/340,418, filed Dec. 19, 2008; 22 pages. |
Final Office Action dated Oct. 2, 2012; U.S. Appl. No. 12/340,418, filed Dec. 19, 2008; 29 pages. |
Notice of Allowance dated Jan. 17, 2013; U.S. Appl. No. 12/340,418, filed Dec. 19, 2008; 25 pages. |
Office Action dated Mar. 21, 2012; U.S. Appl. No. 12/337,229, filed Dec. 17, 2008; 49 pages. |
Notice of Allowance dated Aug. 28, 2012; U.S. Appl. No. 12/337,229, filed Dec. 17, 2008; 6 pages. |
Notice of Allowance dated Jul. 1, 2016; U.S. Appl. No. 12/916,214, filed Oct. 29, 2010; 12 pages. |
Advisory Action dated Jun. 1, 2016; U.S. Appl. No. 14/298,629, filed Jun. 6, 2014; 6 pages. |
Indian Examination Report; Application No. 4184/CHENP/2011; dated Feb. 27, 2017; 9 pages. |
3GPP TR 36.814v0.4.1; 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Further Advancements for E-UTRA Physical Layer Aspects; Release 9; Feb. 2009; 31 pages. |
3GPP TR 36.913 v1.0.0; 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Requirements for Further Advancements for E-UTRA (LTE-Advanced) Release 8; May 2008; 13 pages. |
3GPP TS 36.212 v8.4.0; 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and Channel Coding; Release 8; Sep. 2008; 56 pages. |
3GPP TS 36.300 V8.6.0; 3rd Generation Partnership Project; 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; Sep. 2008; 137 pages. |
3GPP TS 36.304 v8.3.0; 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); User Equipment (UE) Procedures in Idle Mode; Release 8; Sep. 2008; 28 pages. |
3GPP TS 36.321 v8.3.0; 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA) Medium Access Control (MAC) Protocol Specification; Release 8; Sep. 2008; 36 pages. |
3GPP TS 36.321 V8.1.0; 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Medium Access Control (MAC) Protocol Specification; Release 8; Mar. 2008; 30 pages, 178 pages Large, Specify Pages Pertain to Applicant's Inventions. |
China Mobile, Vodafone, Huawei; TSG-RAN WG1 #54; Title: Application Scenarios for LTE-Advanced Relay; R1-082975; Jeju, Korea; Aug. 18-22, 2008; 7 pages. |
Notice of Allowance dated Oct. 21, 2016; U.S. Appl. No. 14/298,629, filed Jun. 6, 2014; 14 pages. |
European Examination Report; Application No. 09756368.8; dated Nov. 14, 2016; 5 pages. |
Chinese Office Action; Application No. 201410272909.2; dated Jan. 23, 2017; 12 pages. |
Chinese Office Action; Application No. 201410292932.8; dated Apr. 5, 2017; 9 pages. |
European Examination Report; Application No. 09789422.4; dated May 3, 2017; 5 pages. |
European Examination Report; Application No. 09748914.0; dated Jul. 10, 2017; 5 pages. |
Number | Date | Country | |
---|---|---|---|
20160028473 A1 | Jan 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13865810 | Apr 2013 | US |
Child | 14878613 | US | |
Parent | 12340418 | Dec 2008 | US |
Child | 13865810 | US |