The present disclosure relates generally to communication networks and, more particularly, to methods and systems for mitigating interference between different communication technologies utilized by a communication device.
Wireless communication networks such as wireless wide area networks (WWAN), wireless local area networks (WLAN), and wireless personal area networks (WPAN) have become increasingly common, with different types of networks (and the corresponding wireless technologies) frequently coexisting in a single communication device. For example, user devices (e.g., mobile handsets) designed to operate using a cellular technology (e.g., Long Term Evolution (LTE) cellular technology) are increasingly designed to also use other wireless technologies, such as Wi-Fi and/or Bluetooth, that operate in the same or nearby frequency bands. Moreover, communications utilizing the various wireless technologies often occur simultaneously. For example, a user device may transmit data on a cellular uplink channel while receiving data via a Bluetooth interface. As a result of this increasing overlap, interference between different wireless technologies has become a significant problem.
In an embodiment, a method, implemented in a communication device configured to transmit signals conforming to a first communication protocol, of determining when to disallow transmissions according to the first communication protocol, wherein a number of times that transmissions can be disallowed in a time frame is limited, includes determining, at one or more processors, a first measure of a benefit of disallowing transmission during a first time period within the time frame. The benefit of disallowing transmission during the first time period includes (i) an immediate benefit of disallowing transmission during the first time period, and (ii) a future benefit of having, for use in a subsequent portion of the time frame, a decremented number of opportunities to disallow transmission. The method also includes determining, at one or more processors, a second measure of a benefit of not disallowing transmission during the first time period. The benefit of not disallowing transmission during the first time period includes (i) an immediate benefit of not disallowing transmission during the first time period, and (ii) a future benefit of having, for use in the subsequent portion of the time frame, a non-decremented number of opportunities to disallow transmission. The non-decremented number is greater than the decremented number. The method also includes determining, at one or more processors, whether to disallow transmission according to the first communication protocol during the first time period at least in part by comparing the first measure to the second measure, and in response to determining to disallow transmission during the first time period, preventing, with one or more processors, the communication device from transmitting according to the first communication protocol during the first time period.
In another embodiment, a communication device includes a first transceiver configured to transmit signals conforming to a first communication protocol, a second transceiver configured to receive signals conforming to a second communication protocol different than the first communication protocol, and an arbiter processor unit coupled to (i) the first transceiver and (ii) the second transceiver. The arbiter processor unit is configured to determine when to disallow transmissions according to the first communication protocol, and a number of times that the arbiter processor unit can disallow transmissions in a time frame is limited. The arbiter processor unit is configured to determine when to disallow transmissions by being configured to determine a first measure of a benefit of disallowing transmission during a first time period within the time frame. The benefit of disallowing transmission during the first time period includes (i) an immediate benefit of disallowing transmission during the first time period, and (ii) a future benefit of having, for use in a subsequent portion of the time frame, a decremented number of opportunities to disallow transmission, determine a second measure of a benefit of not disallowing transmission during the first time period. The benefit of not disallowing transmission during the first time period includes (i) an immediate benefit of not disallowing transmission during the first time period, and (ii) a future benefit of having, for use in the subsequent portion of the time frame, a non-decremented number of opportunities to disallow transmission, and the non-decremented number is greater than the decremented number. The arbiter processor unit is also configured to determine when to disallow transmissions by being configured to, determine whether to disallow transmission according to the first communication protocol during the first time period at least by comparing the first measure to the second measure, and, when determining to disallow transmission during the first time period, to prevent the first transceiver from transmitting according to the first communication protocol during the first time period.
In another embodiment, a tangible, non-transitory computer-readable medium stores instructions for determining when to disallow transmissions according to a first communication protocol. A number of times that transmissions can be disallowed in a time frame is limited. The instructions, when executed by one or more processors, cause the one or more processors to determine a first measure of a benefit of disallowing transmission during a first time period within the time frame. The benefit of disallowing transmission during the first time period includes (i) an immediate benefit of disallowing transmission during the first time period, and (ii) a future benefit of having, for use in a subsequent portion of the time frame, a decremented number of opportunities to disallow transmission. The instructions also cause the one or more processors to determine a second measure of a benefit of not disallowing transmission during the first time period. The benefit of not disallowing transmission during the first time period includes (i) an immediate benefit of not disallowing transmission during the first time period, and (ii) a future benefit of having, for use in the subsequent portion of the time frame, a non-decremented number of opportunities to disallow transmission, and the non-decremented number is greater than the decremented number. The instructions also cause the one or more processors to determine whether to disallow transmission according to the first communication protocol during the first time period at least by comparing the first measure to the second measure, and, when determining to disallow transmission during the first time period, to prevent a communication device from transmitting according to the first communication protocol during the first time period.
In some scenarios, the LTE transmitter 12 transmits data over wireless link 22 at least in part simultaneously with the reception of data by the Wi-Fi receiver 14 over wireless link 32. Moreover, in some scenarios, the bands or channels utilized by the LTE and Wi-Fi communications are adjacent in frequency. If communications using the two wireless technologies are simultaneous, and are sufficiently close in frequency, the physical proximity of the antennas on the user device 10 can lead to a high level of interference that may significantly degrade reliability and throughput. For example, transmission of data over the LTE wireless link 22 results in interference via path 36 that can significantly degrade reliability and throughput of the Wi-Fi wireless link 32. Interference can also occur in the opposite direction (e.g., a Wi-Fi transmitter (not shown) in user device 10 may cause interference at an LTE receiver (not shown) in user device 10), or in communications from or between other wireless technologies of the user device 10, in some systems and scenarios.
Recently, it has been specified that, for an “in-device coexistence” (IDC) user equipment (UE) such as the user device 5 of
The decision, at the UE, of when to deny LTE uplink transmission may be viewed as a resource allocation problem. For example, if the eNB allows a UE only n opportunities to deny an LTE uplink transmission during a subframe over the course of p subframes (where p>n), the problem becomes how to allocate each of the n transmission denials across the p subframes. In particular, for each subframe, the problem may be framed as whether to use one of the n denial opportunities in that subframe, or to instead save the denial for a potentially more critical time in the future. The problem may be better understood by considering an example, such as the example schedule 50 shown in
If considered one subframe at a time, and without any consideration of future subframes, the decision whether to deny an LTE uplink transmission can be relatively straightforward. This “short-sighted” approach, however, may fail to provide satisfactory results when more critical Wi-Fi signals (and/or better Wi-Fi channel conditions, etc.) are expected in the future. Consider, for example, a simple scenario in which only a single LTE uplink transmission denial opportunity is allowed, and in which the short-sighted approach decides to deny the LTE uplink signal 60A at subframe i. While this may provide some near-term benefit (by allowing Wi-Fi signal 62A to be received without interference from LTE uplink signal 60A), that benefit is quickly overshadowed by the inability to deny transmission of the LTE uplink signal 60B at subframe i+1, at a time when it is more important that Wi-Fi signal 62B be received.
In embodiments described below, a framework is provided for autonomous denial of LTE uplink transmissions or, more generally, for denial of transmissions according to a particular communication protocol. Under this framework, in some embodiments, dynamic programming techniques are used to make decisions as to whether to deny a transmission in a particular time period (e.g., in an LTE subframe) by considering not only the immediate benefits of denying or allowing a transmission in a particular time period, but also the future benefits of denying or allowing that transmission. Dynamic programming is an optimization technique in which a complex problem is transformed into a sequence of relatively simple problems. Generally, an optimization problem is solved in multiple “stages” each having one or more possible “states,” with the solution for one stage being used in a recursive manner to help determine the solution for the next stage. A problem can only be solved using dynamic programming if the problem is formulated such that the problem exhibits certain properties (e.g., “optimal substructure”), and it is generally difficult to determine whether, and how, an optimization problem can be structured in order to have the requisite properties. In some embodiments, the inherent properties of dynamic programming provide efficient utilization of processing resources. Moreover, in some embodiments, the consideration of both immediate and future benefits allows an optimal (or near-optimal) allocation of a limited number of transmission denial opportunities within a particular time frame.
In some embodiments, the transmission denial techniques described below are implemented in a user device (such as user device 10 of
In one embodiment, a dynamic programming approach utilizes a function Ui(k), which represents the total utility/benefit of having k remaining LTE uplink transmit denial opportunities at the i-th of p subframes. In an embodiment, the function Ui(k) has the form:
Ui(k)=max{Ui+1(k)+Ri(no denial),Ui+1(k−1)+Ri(denial)} (Equation 1)
In Equation 1, Ri(no denial) is the immediate benefit of not denying LTE uplink transmission in subframe i, Ri(denial) is the immediate benefit of denying LTE uplink transmission in subframe i, Ui+1(k) is the future benefit of having k remaining LTE uplink transmit denial opportunities at the (i+1)-th subframe, and Ui+1(k−1) is the future benefit of having k−1 remaining LTE uplink transmit denial opportunities at the (i+1)-th subframe. As used herein, a benefit of using, or not using, a transmit denial opportunity in a particular time period (e.g., subframe) is referred to as an “immediate benefit” or a “future benefit,” depending on which time period is currently under consideration. In one embodiment, for example, and referring back to
In some embodiments, Equation 1 is solved at each stage (e.g., each subframe) for each of multiple values of k. In one embodiment, for example, Equation 1 is solved, at each stage, for each value of k from 0 to n, where n is the maximum number of LTE uplink transmission denials allowed over the course of p subframes. In some such embodiments, however, no solution is calculated for states that are not permitted or possible. In one embodiment and scenario where n>0 denial opportunities are provided, for example, Equation 1 is only solved, at the earliest subframe (i=1), for the case of k=n, because the full number of denial opportunities will always be available at the first subframe, and Equation 1 is only solved, at the next subframe (i=2), for the cases of k=n and k=n−1 because at most one denial opportunity will have been used by the second subframe, etc.
In some embodiments in which the user device (e.g., UE) knows future traffic scheduling for LTE uplink signals and/or Wi-Fi receive signals, Equation 1 is solved for all subframes i=1 to p using backward induction. In one embodiment, for example, Up(k) is solved first by using one or more boundary conditions, such as Up+1(k)=0 for all k (i.e., the benefit of having any remaining transmit denial opportunities left after the period of p subframes has expired is assumed to be zero). Next, Up−1(k) is solved, and then Up−2(k), and so on, in a recursive manner, until Ui(k) is solved for all subframes i. In one such embodiment, Equation 1 is only used, at each stage/subframe, for values of k that are greater than zero, with a simplified equation instead being used for the case of k=0 (because the benefit of a denial should not be considered if no denial opportunities remain). In one embodiment, for example, Equation 1 is used at each stage/subframe for k>1, but the following equation is used at each stage/subframe for k=0:
Ui(0)=Ui+1(0)+Ri(no denial) (Equation 2)
Once Ui(k) has been solved, for all stages/subframes i=1 to p, and for each state k (or for each permissible state k), in an embodiment, a decision of whether to deny or not deny is made for each subframe i. In an embodiment, the decision is made by comparing a total (immediate plus future) benefit of using a denial at subframe i with a total benefit of saving the denial for future use, and selecting the option with the higher total benefit. To this end, in an embodiment, the decision of whether to deny LTE uplink transmission at subframe i is made by comparing a first quantity Ui+1(k)+Ri(no denial) with a second quantity Ui+1(k−1)+Ri(denial). In this embodiment, the user device does not deny the transmission at subframe i if the first quantity is greater than the second quantity (or, in some embodiments, if the first quantity is greater than or equal to the second quantity), but does deny the transmission at subframe i if the second quantity is greater than the first quantity (or, in some embodiments, if the second quantity is greater than or equal to the first quantity). In an embodiment, the comparison is made for each subframe in a window of p subframes in order to generate a denial decision at each of the p subframes.
In the example scenario of
Using backward induction, in an embodiment, U4(k) is calculated first, for each k from k=0 to n (i.e., 0 to 2). Using Equations 1 and 2, and with the boundary condition U5(k)=0 for all k, in an embodiment, the values of U4(k) are calculated as follows:
U4(0)=U5(0)+R4(no denial)=0+10=10 (Equation 3)
U4(1)=max{U5(1)+R4(no denial),U5(0)+R4(denial)}=max{0+10,0+9=max10,9=10 (Equation 4)
U4(2)=max{U5(2)+R4(no denial),U5(1)+R4(denial)}=max{0+10,0+9=max10,9=10 (Equation 5)
At the next earliest stage/subframe, in an embodiment, the values of U4(k) are used to calculate values of U3(k) as follows:
U3(0)=U4(0)+R3(no denial)=10+10=20 (Equation 6)
U3(1)=max{U4(1)+R3(no denial),U4(0)+R3(denial)}=max{10+10,10+12=max20,22=22 (Equation 7)
U3(2)=max{U4(2)+R3(no denial),U4(1)+R3(Denial)}=max{10+10,10+12=max20,22=22 (Equation 8)
At the next earliest stage/subframe, in an embodiment, the values of U3(k) are used to calculate values of U2(k) as follows:
U2(0)=U3(0)+R2(no denial)=20+5=25 (Equation 9)
U2(1)=max{U3(1)+R2(no denial),U3(0)+R2(denial)}=max{22+5,20+14=max27,34=34 (Equation 10)
U2(2)=max{U3(2)+R2(no denial),U3(1)+R2(denial)}=max{22+5,22+14=max27,36=36 (Equation 11)
Finally, at the next earliest (i.e., first) stage/subframe, in an embodiment, the values of U2(k) are used to calculate values of U1(k) as follows:
U1(0)=U2(0)+R1(no denial)=25+6=31 (Equation 12)
U1(1)=max{U2(1)+R1(no denial),U2(0)+R1(denial)}=max{34+6,25+7=max40,32=40 (Equation 13)
U1(2)=max{U2(2)+R1(no denial),U2(1)+R1(denial)}=max{36+6,34+7=max42,41=42 (Equation 14)
In an embodiment, each calculated value of Ui(k) is stored in a memory, and then recalled from the memory when needed for future calculations, such that it is not necessary to calculate the same quantity multiple times. In one embodiment, for example, the value of U4(0) (i.e., the value 10) is stored in memory after being calculated in Equation 3, and is recalled from the memory for use in the calculations of Equations 6 and 7, and the value of U4(1) (i.e., also the value 10) is stored in the memory after being calculated in Equation 4, and is recalled from the memory for use in the calculations of Equations 7 and 8, etc.
It is seen in
Using this example decision criterion, and starting at box 102A with k=2 at subframe i=1, the decision at subframe i=1 is made by comparing U2(1)+R1(denial)=34+7=41 with the quantity U2(2)+R1(no denial)=36+6=42. Because the latter quantity is greater, the decision is made not to deny transmission at the first subframe (i=1), meaning that k will still be equal to 2 at the second subframe (i=2). Next, at box 102D, the decision at subframe i=2 is made by comparing U3(1)+R2 (denial)=22+14=36 with the quantity U3(2)+R2 (no denial)=22+5=27. Because the former quantity is greater, the decision is made to deny transmission at the second subframe (i=2), causing k to decrement to k=1 for the third subframe (i=3). Next, at box 102H, the decision at subframe i=3 is made by comparing U4(0)+R3 (denial)=10+12=22 with the quantity U4(1)+R3 (no denial)=10+10=20. Because the former quantity is greater, the decision is made to deny transmission at the third subframe (i=3), causing k to decrement to k=0 for the fourth and final subframe (i=4). As noted above, in an embodiment, a boundary condition is established by assuming that U5(k)=0 for all k. Next, at box 102L, the decision at subframe i=4 is made by comparing U5(−1)+R4 (denial)=0+9=9 with the quantity U5(0)+R4 (no denial)=0+10=10. Because the latter quantity is greater, the decision is made not to deny transmission at the fourth subframe (i=4). Of course, because k had already decremented to zero, there never was any possibility of denying transmission at the final subframe, in this embodiment and scenario. In some embodiments, therefore, comparisons of the above sort are not made for remaining subframes when it has already been determined that k has decremented to zero. Instead, in these embodiments, it is automatically decided/recognized that there will be no transmission denials in any remaining subframes (in the current window of p subframes) once k decrements to zero.
Moreover, in some embodiments, states that are not permitted in the example solution 100 are not calculated in order to conserve processing resources. In one embodiment in which n=2, for example, Ui(k) is not calculated for at least box 102C (i=1, k=0) and box 102B (i=1, k=1). As another example, in an embodiment in which n=2 and all denial opportunities must be used within the p subframes, Ui(k) is not calculated for at least box 102C (i=1, k=0), box 102B (i=1, k=1), box 102K (i=4, k=1) and box 102L (i=4, k=2).
In the example scenario of
In an embodiment, each window of p subframes in which n denials are allowed is fixed, with each window being adjacent to, but not overlapping, the next window of p subframes. In other embodiments, however, the window of p subframes is a moving window, whereby adjacent windows overlap each other.
The variables Ri(denial) and Ri(no denial) (and therefore Ui(k)) in the above examples represent different metrics according to different embodiments. In some embodiments, for example, Ri(denial) and Ri(no denial) represent throughputs that are expected based on predicted channel conditions and/or predicted traffic scheduling. In one such embodiment, Ri(denial) is a metric or value that increases as the expected Wi-Fi throughput during LTE subframe i increases, and/or Ri(no denial) is a metric or value that decreases as the expected Wi-Fi receive throughput during LTE subframe i increases (and/or as the expected LTE uplink throughput during subframe i decreases).
The various expected throughputs are estimated based on different factors, according to different embodiments. In one embodiment, for example, one or more of the Wi-Fi (and/or LTE uplink) throughputs is/are estimated based on channel conditions (e.g., signal-to-noise ratio, other scheduled communications that can cause interference, etc.) that are expected for the i-th subframe, and/or estimated based on an amount of data expected to be received by (Wi-Fi) or sent by (LTE) the user device during the i-th subframe. In one embodiment, for example, Ri(denial) is relatively large if Wi-Fi receive channel conditions are expected to be robust during the i-th subframe, and/or if LTE uplink channel conditions are expected to be poor during the i-th subframe, and Ri(no denial) is relatively large if Wi-Fi receive channel conditions are expected to be poor during the i-th subframe, and/or if LTE uplink channel conditions are expected to be robust during the i-th subframe.
Alternatively, or additionally, in an embodiment, Ri(denial) and Ri(no denial) represent measures of importance associated with the expected data/signal itself. In one such embodiment, for example, Ri(denial) is relatively large if a Wi-Fi signal with high priority data is expected to be received during the i-th subframe, and/or if no LTE uplink signal with high priority data is ready to be sent during the i-th subframe, and Ri(no denial) is relatively large if an LTE uplink signal with high priority data is ready to be sent during the i-th subframe, and/or if no Wi-Fi signal with high priority data is expected to be received during the i-th subframe.
In some embodiments, values of Ri(denial) and Ri(no denial) over the window of p subframes are based on a priori knowledge of Wi-Fi and/or LTE uplink traffic scheduling, and/or based on metrics (e.g., channel signal-to-noise ratios) that are assumed to be fixed for the duration of the window. In other embodiments, however, stochastic modeling is used to better capture the uncertainty associated with Wi-Fi and/or LTE signal prediction. In an embodiment, for example, Equations 1 and 2 are modified to account for probability distributions associated with traffic scheduling and/or channel conditions.
In an embodiment, the arbiter unit 170 makes LTE uplink denial decisions for the user device 150, and communicates those decisions to LTE transceiver 152. In one embodiment where the user device 150 implements one of the example techniques described above, the user device 150 receives an indication of the maximum number of LTE transmit denial opportunities (n) in a known window of p subframes from an eNB via LTE transceiver 152. In some embodiments, the eNB instead provides a maximum average denial rate (e.g., LTE uplink transmission may be denied up to 10% of all LTE subframes, up to 20% of all LTE subframes, etc.), or other suitable parameter from which n can be derived, and the arbiter unit 170 or another suitable unit in user device 150 calculates n accordingly.
In an embodiment, information needed to calculate the values of Ri(denial) and Ri(no denial), such as traffic scheduling information, channel state information, and/or other suitable information, is provided to the arbiter unit 170 of user device 150. In the embodiment shown in
In an embodiment, the method 200 is implemented in a communication device that is configured to transmit signals conforming to the first communication protocol. In some embodiments, the communication device is a user device (e.g., a smartphone, mobile handset, laptop, tablet device, etc.), such as user device 10 of
At block 210, a first measure of a benefit of disallowing transmission during a first time period within the time frame is determined. In one embodiment, the benefit of disallowing transmission during the first time period includes both an immediate benefit of disallowing transmission during the first time period, and a future benefit of having, for use in a subsequent portion of the time frame, a decremented number of opportunities to disallow transmission. In one embodiment in which the first time period is an i-th time period, for example, the first measure is the quantity Ui+1(k−1+Ri(denial), as discussed above in connection with Equation 1, with Ui+1k−1 being a measure of the future benefit and Ri(denial) being a measure of the immediate benefit. In an embodiment, Ui+1(k−1) and Ri(denial) are calculated by an arbiter unit such as arbiter unit 170 of
At block 220, a second measure of a benefit of not disallowing transmission during the first time period is determined. In one embodiment, the benefit of not disallowing transmission during the first time period includes both an immediate benefit of not disallowing transmission during the first time period, and a future benefit of having, for use in a subsequent portion of the time frame, a same (non-decremented) number of opportunities to disallow transmission. In one embodiment in which the first time period is an i-th time period, for example, the second measure is the quantity Ui+1(k)+Ri(no denial), as discussed above in connection with Equation 1, with Ui+1(k) being a measure of the future benefit and Ri(no denial) being a measure of the immediate benefit. In an embodiment, Ui+1(k) and Ri(no denial) are calculated by an arbiter unit such as arbiter unit 170 of
In some embodiments, the values of Ui+1(k−1) and Ui+1(k) in blocks 210 and 220, respectively, are calculated as a part of a recursive process, as discussed above in connection with Equations 1 or 2 and in connection with the example solution 100 of
At block 230, the first measure determined at block 210 is compared to the second measure determined at block 220, and it is determined, based at least in part on that comparison, whether to disallow transmission according to the first communication protocol during the first time period. In an embodiment, a determination is made to disallow transmission at block 230 only if the first measure is greater than, or greater than or equal to, the second measure.
If it is determined at block 230 to disallow the transmission, flow proceeds to block 240. At block 240, the communication device implementing the method 200 is prevented from transmitting according to the first communication protocol during the first time period. In various embodiments, the communication device is prevented from transmitting by sending a command to a transceiver in the communication device, or in some other suitable manner.
If it is determined at block 230 to not disallow the transmission, flow proceeds to block 250. At block 250, the communication device implementing the method 200 is not prevented from transmitting according to the first communication protocol during the first time period. In various embodiments, the communication device is not prevented from transmitting by sending a command (e.g., an enable command) to a transceiver in the communication device, by refraining from sending a command to not transmit (e.g., at a time when the transceiver would otherwise expect such a command), or in some other suitable manner.
In some embodiments, the order of the blocks of method 200 is changed, and/or some of the blocks are performed at least partially in parallel. For example, in one embodiment, the first measure and second measure are calculated (at blocks 210 and 220) substantially in parallel. Moreover, in some embodiments, the method 200 includes additional steps not shown in
At least some of the various blocks, operations, and techniques described above with reference to
When implemented in hardware, the hardware may comprise one or more of discrete components, an integrated circuit, an ASIC, a programmable logic device (PLD), etc.
While various aspects of the present invention have been described with reference to specific examples, which are intended to be illustrative only and not to be limiting of the invention, changes, additions and/or deletions may be made to the disclosed embodiments without departing from the scope of the invention.
This claims the benefit of U.S. Provisional Patent Application No. 61/738,289, entitled “Method of LTE Uplink Autonomous Denial for In-Device Coexistence (IDC)” and filed on Dec. 17, 2012, the disclosure of which is hereby incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
6614797 | Hippelainen | Sep 2003 | B1 |
7215659 | Chen et al. | May 2007 | B1 |
7277692 | Jones et al. | Oct 2007 | B1 |
8094597 | Chhabra et al. | Jan 2012 | B1 |
8121068 | Zhu | Feb 2012 | B2 |
8705427 | Chhabra et al. | Apr 2014 | B1 |
9119025 | Chhabra et al. | Aug 2015 | B1 |
20020136233 | Chen et al. | Sep 2002 | A1 |
20020181492 | Kasami et al. | Dec 2002 | A1 |
20030093513 | Hicks et al. | May 2003 | A1 |
20050059347 | Haartsen | Mar 2005 | A1 |
20070153749 | Waxman | Jul 2007 | A1 |
20080279163 | Desai | Nov 2008 | A1 |
20090245216 | Banerjea et al. | Oct 2009 | A1 |
20110097998 | Ko et al. | Apr 2011 | A1 |
20120164948 | Narasimha et al. | Jun 2012 | A1 |
20130114583 | Park et al. | May 2013 | A1 |
20130194938 | Immonen et al. | Aug 2013 | A1 |
20140126552 | Dayal et al. | May 2014 | A1 |
Entry |
---|
3GPP TR 36.816 V11.2.0, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Study on Signaling and Procedure for Interference Avoidance for In-Device Coexistence (Release 11)”, Dec. 2011, 44 pages. |
Chen, “Home Network Basis: Transmission Environments and Wired/Wireless Protocols,” Prentice Hall, pp. 1-26 (Jul. 2003). |
Golmie et al., “Bluetooth and WLAN Coexistence: Challenges and Solutions,” IEEE Wireless Comm., vol. 10, No. 6, pp. 22-29, (2003). |
Hiertz et al., “The IEEE 802.11 Universe,” IEEE Communications Magazine, pp. 62-70, (Jan. 2010). |
“How 802.11b/g Wireless WLAN and Bluetooth Can Play; Without Standards-Based Solutions, ICs Must Referee Spectrum Rivalry,” Philips Electronics, 5 pages (Sep. 2005). |
Quinnell, “WiFi and Bluetooth Fight for Bandwith,” EDN, 4 pages (Aug. 4, 2005). |
Specification of the Bluetooth System, Version 2.0: vol. 0, “Master Table of Contents & Compliance Requirements,” pp. 1-74; vol. 1, “Architecture & Terminology Overview,” pp. 1-92; vol. 2, “Core System Package [Controller Volume]”, pp. 1-814; vol. 4, “Core System Package [Host Volume],” pp. 1-250, (Nov. 4, 2004). |
“Wi-Fi Display Technical Specification Version 1.0.0”, Wi-Fi Alliance® Technical Committee, Wi-Fi Display Technical Task Group, 149 pages (Aug. 24, 2012). |
“Wi-Fi Peer-to-Peer (P2P) Technical Specification, Version 1.00”, Wi-Fi Alliance, pp. 1-135, Dec. 1, 2009. |
“WiFiIM and BluetoothIM —Interference Issues,” HP, 6 pages (Jan. 2002). |
Wojtiuk, “Bluetooth and WiFi Integration: Solving Co-Existence Challenges,” RF Design, 4 pages (Oct. 2004). |
IEEE Std 802.11IM 2012 (Revision of IEEE Std 802.11-2007) IEEE Standard for Information technology—Telecommunications and information exchange between systems—Local and metropolitan area networks—Specific requirements Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications, The Institute of Electrical and Electronics Engineers, Inc., pp. 1-2695 (Mar. 29, 2012). |
U.S. Appl. No. 12/260,867, Chhabra et al., “Method and Apparatus for Coexistent WLAN and PAN Communication with Intelligent PAN Slot Suppression,” filed Oct. 29, 2008. |
U.S. Appl. No. 12/260,875, Chhabra et al., “Method and Apparatus for Coexistent Wireless and Bluetooth Communication Using Power Save Polling,” filed Oct. 29, 2008. |
U.S. Appl. No. 12/260,995, Chhabra et al., “Method and Apparatus for Using Power Management Mode to Regulate Data Transmission when a Bluetooth Network and a Wireless Local Area Network Coexist,” filed Oct. 29, 2008. |
U.S. Appl. No. 14/136,860, Choi et al., “Method and System for Mitigating Interference between different Radio Access Technologies Utilized by a Communication Device,” filed Dec. 20, 2013. |
Number | Date | Country | |
---|---|---|---|
61738289 | Dec 2012 | US |