The subject disclosure relates to methods and apparatus for tuning circuit components of a communication device.
Cellular telephone devices have migrated to support multi-cellular access technologies, peer-to-peer access technologies, personal area network access technologies, and location receiver access technologies, which can operate concurrently. Cellular telephone devices in the form of smartphones have also integrated a variety of consumer features such as MP3 players, color displays, gaming applications, cameras, and other features. Cellular telephone devices can be required to communicate at a variety of frequencies, and in some instances are subjected to a variety of physical and function use conditions.
These and other factors can result in a need for tunability of more than one circuit component of a transceiver. For example, tunable circuits can be used to adjust an impedance match of an antenna over a frequency range to improve output power. Difficulties, however, can arise when attempting to tune the matching circuit for signal reception. Tunable circuits can also be used with amplifiers and filters. Additionally, tuning circuits can be placement on a radiating element of an antenna to enable on-antenna tuning. By combining more than one tuning technique in a single communication device, multiple tuning algorithms may be required.
Reference will now be made to the accompanying drawings, which are not necessarily drawn to scale, and wherein:
The subject disclosure describes, among other things, illustrative embodiments tuning multiple circuit components of a communication circuit. Other embodiments are contemplated by the subject disclosure.
One embodiment of the subject disclosure includes a computer-readable storage medium including computer instructions which, responsive to being executed by at least one processor, cause the at least one processor to perform operations including identifying an order of execution of a plurality of tuning algorithms, where each of the plurality of tuning algorithms controls one of a tunable reactive element, a control interface, or both of one of a plurality of circuit components of a radio frequency circuit of a communication device. Responsive to executing the computer instructions the at least one processor can further perform operations including executing a first tuning algorithm of the plurality of tuning algorithms according to the order of execution, detecting a stability condition of the first tuning algorithm, and executing a second tuning algorithm of the plurality of tuning algorithms responsive to the detected stability condition of the first tuning algorithm
One embodiment of the subject disclosure includes a portable communication device including a plurality of circuit components of a radio frequency circuit, where each of circuit component of the plurality of circuit components comprises one of a tunable reactive element, a control interface, or both for enabling at least one of a plurality of tuning algorithms to control an operation of the circuit component. The portable communication device can further include a memory storing computer instructions, and a controller coupled to the memory and the tunable reactive element of each of the plurality of circuit components. Responsive to executing the computer instructions the controller can perform operations including executing a first tuning algorithm of the plurality of tuning algorithms according to an order of execution of a plurality of tuning algorithms, detecting a stability condition of the first tuning algorithm, and executing a second tuning algorithm of the plurality of tuning algorithms responsive to the detected stability condition of the first tuning algorithm.
One embodiment of the subject disclosure includes a method for detecting, by a processor, a plurality of use cases of a communication device, and determining, by the processor, an initial tuning state for each of a plurality of tuning algorithms according to the plurality of use cases, where each of the plurality of tuning algorithms controls one of a tunable reactive element, a control interface, or both of one of a plurality of circuit components of a radio frequency circuit. The method can further include configuring, by the processor, each of the plurality of tuning algorithms according to their respective initial tuning state, executing, by the processor, a first tuning algorithm of the plurality of tuning algorithms according to an order of execution of the plurality of tuning algorithms, detecting, by the processor, a stability condition of the first tuning algorithm, and executing, by the processor, a second tuning algorithm of the plurality of tuning algorithms responsive to the detected stability condition of the first tuning algorithm.
The UI 104 can include a depressible or touch-sensitive keypad 108 with a navigation mechanism such as a roller ball, a joystick, a mouse, or a navigation disk for manipulating operations of the communication device 100. The keypad 108 can be an integral part of a housing assembly of the communication device 100 or an independent device operably coupled thereto by a tethered wireline interface (such as a USB cable) or a wireless interface supporting, for example, Bluetooth. The keypad 108 can represent a numeric keypad commonly used by phones, and/or a QWERTY keypad with alphanumeric keys. The UI 104 can further include a display 110 such as monochrome or color LCD (Liquid Crystal Display), OLED (Organic Light Emitting Diode) or other suitable display technology for conveying images to an end user of the communication device 100. In an embodiment where the display 110 is touch-sensitive, a portion or all of the keypad 108 can be presented by way of the display 110 with navigation features.
The display 110 can use touch screen technology to also serve as a user interface for detecting user input. As a touch screen display, the communication device 100 can be adapted to present a user interface with graphical user interface (GUI) elements that can be selected by a user with a touch of a finger. The touch screen display 110 can be equipped with capacitive, resistive or other forms of sensing technology to detect how much surface area of a user's finger has been placed on a portion of the touch screen display. This sensing information can be used to control the manipulation of the GUI elements or other functions of the user interface. The display 110 can be an integral part of the housing assembly of the communication device 100 or an independent device communicatively coupled thereto by a tethered wireline interface (such as a cable) or a wireless interface.
The UI 104 can also include an audio system 112 that utilizes audio technology for conveying low volume audio (such as audio heard in proximity of a human ear) and high volume audio (such as speakerphone for hands free operation). The audio system 112 can further include a microphone for receiving audible signals of an end user. The audio system 112 can also be used for voice recognition applications. The UI 104 can further include an image sensor 113 such as a charged coupled device (CCD) camera for capturing still or moving images.
The power supply 114 can utilize common power management technologies such as replaceable and rechargeable batteries, supply regulation technologies, and/or charging system technologies for supplying energy to the components of the communication device 100 to facilitate long-range or short-range portable applications. Alternatively, or in combination, the charging system can utilize external power sources such as DC power supplied over a physical interface such as a USB port or other suitable tethering technologies.
The location receiver 116 can utilize location technology such as a global positioning system (GPS) receiver capable of assisted GPS for identifying a location of the communication device 100 based on signals generated by a constellation of GPS satellites, which can be used for facilitating location services such as navigation. The motion sensor 118 can utilize motion sensing technology such as an accelerometer, a gyroscope, or other suitable motion sensing technology to detect motion of the communication device 100 in three-dimensional space. The orientation sensor 120 can utilize orientation sensing technology such as a magnetometer to detect the orientation of the communication device 100 (north, south, west, and east, as well as combined orientations in degrees, minutes, or other suitable orientation metrics).
The communication device 100 can use the transceiver 102 to also determine a proximity to a cellular, WiFi, Bluetooth, or other wireless access points by sensing techniques such as utilizing a received signal strength indicator (RSSI) and/or signal time of arrival (TOA) or time of flight (TOF) measurements. The controller 106 can utilize computing technologies such as a microprocessor, a digital signal processor (DSP), and/or a video processor with associated storage memory such as Flash, ROM, RAM, SRAM, DRAM or other storage technologies for executing computer instructions, controlling, and processing data supplied by the aforementioned components of the communication device 100.
Other components not shown in
The communication device 100 as described herein can operate with more or less of the circuit components shown in
The tunable capacitors 404-408 can each utilize technology that enables tunability of the reactance of the component. One embodiment of the tunable capacitors 404-408 can utilize voltage or current tunable dielectric materials. The tunable dielectric materials can utilize, among other things, a composition of barium strontium titanate (BST). In another embodiment, the tunable reactive element 310 can utilize semiconductor varactors. Other present or next generation methods or material compositions that result in a voltage or current tunable reactive element are contemplated by the subject disclosure for use by the tunable reactive element 310 of
The DC-to-DC converter 304 can receive a DC signal such as 3 volts from the power supply 114 of the communication device 100 in
Although the tunable reactive element 310 is shown in a unidirectional fashion with an RF input and RF output, the RF signal direction is illustrative and can be interchanged. Additionally, either port of the tunable reactive element 310 can be connected to a feed point of the antenna 206, a radiating element of the antenna 206 in an on-antenna configuration, or between antennas for compensating cross-coupling when diversity antennas are used. The tunable reactive element 310 can also be connected to other circuit components of a transmitter or a receiver section such as filters, power amplifiers, and so on.
In another embodiment, the tunable matching network 202 of
The tunable reactive elements 310 and 504 of
With the flip open a user is likely to hold the bottom flip 802 with one hand while positioning the top flip 804 near the user's ear when an audio system of the phone 800, such audio system 112 of
For a phone 900 with a slideable keypad 904 (illustrated in
The number of hands and fingers used in the portrait mode may be determined by the particular type of game being played by the user. For example, a particular video game may require a user interface where a single finger in portrait mode is sufficient for controlling the game. In this scenario, it may be assumed that the user is holding the smartphone 1000 in one hand in portrait mode and using a finger with the other. By empirical analysis, a possible range of impedances of the internal antenna can be determined when using this video game in portrait mode. Similarly, if the video game selected has a user interface that is known to require two hands in landscape mode, another estimated range of impedances of the internal antenna can be determined empirically.
A multimode phone 1100 capable of facilitating multiple access technologies such as GSM, CDMA, LTE, WiFi, GPS, and/or Bluetooth in two or more combinations can provide additional insight into possible ranges of impedances experienced by two or more internal antennas of the multimode phone 1100. For example, a multimode phone 1100 that provides GPS services by processing signals received from a constellation of satellites 1102, 1104 can be empirically analyzed when other access technologies are also in use. Suppose, for instance, that while navigation services are enabled, the multimode phone 1100 is facilitating voice communications by exchanging wireless messages with a cellular base station 1106. In this state, an internal antenna of the GPS receiver may be affected by a use case of a user holding the multimode phone 1100 (e.g., near the user's ear or away from the user's ear). The affect on the GPS receiver antenna and the GSM antenna by the user's hand position can be empirically analyzed.
Suppose in another scenario that the antenna of a GSM transceiver is in close proximity to the antenna of a WiFi transceiver. Further assume that the GSM frequency band used to facilitate voice communications is near the operational frequency of the WiFi transceiver. Also assume that a use case for voice communications may result in certain physical states of the multimode phone 1100 (e.g., slider out), which can result in a probable hand position of the user of the multimode phone 1100. Such a physical and functional use case can affect the impedance range of the antenna of the WiFi transceiver as well as the antenna of the GSM transceiver.
A close proximity between the WiFi and GSM antennas and the near operational frequency of the antennas may also result in cross-coupling between the antennas, thereby changing the load impedance of each of the antennas. Cross-coupling under these circumstances can be measured empirically. Similarly, empirical measurements of the impedances of other internal antennas can be measured for particular physical and functional use configurations when utilizing Bluetooth, WiFi, Zigbee, or other access technologies in peer-to-peer communications with another communication device 1108 or with a wireless access point 1110.
The number of physical and functional use cases of a communication device 100 can be substantial when accounting for combinations of access technologies, frequency bands, antennas of multiple access technologies, antennas configured for diversity designs such as multiple-input and multiple output (MIMO) antennas, and so on. These combinations, however, can be empirically analyzed to load impedances and affects on other tunable circuits. The empirical data collected can be recorded in the look-up table of
Tunable matching networks 1306 and 1310 (such as those shown in
It should be noted that the illustrations of
The physical use case can be determine from electromechanical sensors, proximity sensors, or other sensing technology to determine a physical state of the communication device 100 (e.g., flip open, slider out, antenna retrieved, etc.). The functional use cases can be determined from flags, registers, or other indicators used by the controller 106 to track the operational state of the communication device 100 (e.g., frequency band, access technology(ies) in use, software applications in use and their corresponding user interface profiles, etc.). Based on the physical and functional use cases, the controller 106 can determine from a look-up table stored in memory (such as illustrated in
At step 1604, the controller 106 can configure tuning algorithms according to the open loop states. The tuning algorithms can include without limitation, a tuning algorithm for on-antenna tuning, a tuning algorithm for the matching network, a tuning algorithm for the multimode filters, a tuning algorithm for controlling output power of a power amplifier of a transmitter section, a tuning algorithm for controlling linearity and efficiency of the power amplifier, and so forth. The open loop states can indicate an initial tuning state for configuring a tunable reactive element or network used by the tunable circuit components shown in
At step 1608, the tunable algorithms can determine inputs to the control loops of each algorithm. The inputs can be determined from the sensing circuits used by each tuner. For example, referring to
Once these determinations have been made, the controller 106 can enable execution of the tuning algorithms. In one embodiment, the tuning algorithms can be invoked according to an order of execution, which may be predefined by assigning priority levels to the algorithms. To distinguish between priority levels, each tuning algorithm can be given a numerical weight. The numerical weight can be fixed, or variable depending on, for example, an aggregate performance of the tuning algorithms. In one embodiment, the on-antenna tuner can be given the highest priority and is thereby executed first at step 1610. After measuring the state of the antenna 1518 at step 1612, the on-antenna tuner can determine at step 1614 whether a desired performance threshold (e.g., a desired impedance of the antenna 1518) has been achieved. If it has not, then the tuning algorithm can proceed to step 1615 and adjust the tunable reactive element 1516. A condition of stability can be attained by the on-antenna tuning algorithm by achieving the desired threshold at step 1614 for tuning the antenna 1518.
Since the change in impedance of the tunable reactive element 1516 can affect other tunable circuit components, the control loop repeats at step 1608 where all tuning algorithms are given an opportunity to measure the state of their corresponding tunable circuit component. To avoid contention between algorithms, and excessive execution time by any particular algorithm, the controller 106 can utilize semaphore flags and set timers when executing tuning algorithms. In a multitasking arrangement, semaphore flags can enable the tuning algorithms to detect which tuning algorithm(s) is/are active, and thereby avoid overlaps between tuning algorithms which can cause undesirable and perhaps unstable conditions between algorithms. Timers can be used to balance computing resources supplied to the tuning algorithms, control the effective tuning rate of the algorithms, and avoid any one algorithm burdening or slowing the tuning rate of another algorithm.
In addition to semaphores and timers, the tuning algorithms can be configured to limit the rate or speed of tuning used by the algorithm. The tuning algorithms can also be configured to limit a magnitude of each tuning step applied to a corresponding circuit component, limit a number of tuning steps applied to the corresponding circuit component, limit tuning of the corresponding circuit component to a specific tuning range, or combinations thereof. Moreover, each of the tuning algorithms can be given an opportunity to request a cycle to tune outside of a given execution order. For instance, a tuning algorithm with a higher priority level can preempt a tuning algorithm of lower priority. When preemption occurs, the controller 106 can cause the lower priority tuning algorithm to cease operation until the requesting algorithm has achieved a desirable tuning threshold, at which time the controller 106 can re-enable to lower priority tuning algorithm.
A tuning algorithm may seek preemption as a result of executing step 1608. For instance, a tuning algorithm that made an adjustment may have negatively impacted another algorithm's prior tuning performance. The severity of the impact can be sufficient to invoke a preemption request by the algorithm. To prevent excessive preemption requests, each algorithm can be assigned a preemption threshold that defines an acceptable range of error inadvertently applied by tuning effects of other algorithms. The preemption threshold can provide hysteresis to dampen preemption requests and add further stability to the overall control loop.
In addition to semaphores, timers, and preemptive requests, the controller 106 can be configured to monitor the performance of the tuning algorithms collectively, and thereby determine an aggregate or accumulation error caused by the algorithms. The aggregate error can provide for a measure of a gap between a desirable system tuning threshold for the entire control loop and actual performance. The controller 106 can be adapted to change the priority levels of the tuning algorithms, and their respective execution order based on this aggregate measure. Furthermore, the controller 106 can also analyze a measure of error experienced by each algorithm and adjust priority levels to assist one or more algorithms that are struggling to achieve their respective thresholds. Tuning thresholds of each tuning algorithm can also be modified by the controller 106 based on the aggregate error and/or individual measures of error if the controller 106 determines that the overall tuning performance of the control loop has not reached a desirable system threshold. For example, the tuning thresholds can be modified by raising or lowering the respective thresholds of the tuning algorithms to achieve the desirable system threshold.
In yet another embodiment, the controller 106 can be configured to execute a “parent” tuning algorithm that oversees the performance of the tuning algorithms collectively. In one embodiment, individual tuning algorithms can assert a “fault flag” which they can set when the algorithm detects a fault condition within itself. The fault condition can indicate an inability by the tuning algorithm to converge on a desired threshold within a predetermined period. A fault condition can also indicate that the tuning algorithm has converged to a state of operation that is undesirable. The “parent” tuning algorithm can act on this differently than preemption requests as described above. For example, if a particular tuning algorithm maintains the fault flag for more than one iteration, the parent tuning algorithm may restart all of the tuning algorithms to allow them to determine a new set of stable conditions.
Referring back to
Once the desirable figure of merit threshold has been achieved, the controller 106 can invoke the tuning algorithm for the power amplifier at step 1622. It should be noted that the desirable tuning thresholds of each tuning algorithm can be hierarchical. Thus, a first desirable threshold may serve as a coarse tuning threshold, while subsequent thresholds can be more aggressive towards achieving a tuning target. Additionally, it should be noted that thresholds may not in all instances require optimal performance of a particular tuning stage. For instance, to avoid a SAR requirement, one or more of the tuning algorithms may be configured to operate below their optimal range. In addition, tuning thresholds may differ between operational states of the communication device 100 (e.g., frequency band selected, whether tuning is taking place between transmit bursts, or during a transmit burst, and so on.). Further, as noted earlier, tuning thresholds may be varied by the controller 106 when analyzing the collective performance of the tuning algorithms as well as individual performance of select algorithms.
At step 1624, the tuning algorithm controlling the output power of the amplifier 1502 can measure with sensor 1508 output power relative to a power step applied to the amplifier 1502. If the output power is outside of expected tuning threshold(s) at step 1626, then the tuning algorithm can proceed to step 1627 where it adjusts a tunable reactive element, bias, power supply or combinations thereof of the power amplifier 1502. After the adjustment, the control loop returns to step 1608 where the tuning algorithms are given an opportunity to determine how the adjustment at step 1627 has impacted them. If the impact is within their respective preemption thresholds, then the tuning algorithm of step 1622 can continue the tuning process until the output power of the amplifier 1502 has achieved or exceeded the desired tuning threshold at step 1626, or until such time as the tuning period has expired or preemption has occurred. Once the tuning threshold of step 1626 has been achieved, the controller 106 can invoke the tuning algorithm at step 1628 which controls the efficiency and linearity of the power amplifier 1502.
Tuning efficiency and linearity can be controlled by varying the bias and supply power used by the power amplifier 1502 with or without the use of a tunable reactive element. The forward detector 1508 can supply a signal which can be digitally sampled with an analog to digital converter. The digital data derived from the sampled signal can be processed by the tuning algorithm to determine a measure of the output power of the amplifier 1502. The tuning algorithm can also utilize the sampled signal to calculate peak power and average output power of the amplifier 1502. A current sensor (not shown) can be used to measure the current drain of the power amplifier 1502. At step 1632 the tuning algorithm can utilize the measurements of output power and current drain to compute the efficiency of the amplifier 1502. In addition, the tuning algorithm can utilize the measurements of peak power, average output power and knowledge of the modulation present on the transmitted signal to determine the linearity of the amplifier 1502. The efficiency and linearity can be compared to corresponding thresholds to determine at step 1632 if an adjustment is necessary at step 1633. If either of these measures is outside the desirable thresholds, then the tuning algorithm can calculate and assert an adjustment to among other things the bias voltage(s), the power supply, the supply voltage, and/or controls to a tunable reactive element coupled to the amplifier 1502. The control loop then returns to step 1608. Once the efficiency and linearity have achieved their respective thresholds, the controller 106 can return to step 1608 and continue the tuning process described above.
Alternatively, if the communication device 100 has changed its physical or functional state (e.g., speakerphone has been asserted, flip has been closed, and/or the frequency band has been changed to a lower band, etc.), then the controller 106 can interrupt the tuning algorithms and proceed to step 1602 and reinitiate the configuration of the algorithms and circuit components according to the open-loop settings derived from the look-up table of
As noted earlier, optimization of any one tuning algorithm or attribute controlled by a tuning algorithm may not always be desirable.
The tunable capacitances can be tuned over a range such as, for example, 0.3 to 1 times a nominal value C. For instance, if the nominal value of the tunable capacitance is 5 pF, the tunable range can be from 1.5 to 5 pF. In an exemplary embodiment, PTC1 can have a nominal capacitance of 5 pF and is tunable over the 0.3 to 1 times range, the first impedance L1 can have a value of 3.1 nH, and the second impedance L2 can have a value of 2.4 nH and the second tunable capacitance PTC2 can have a nominal value of 20 pF and can be tuned over a range of 0.3 to 1 times the nominal value. It will be appreciated that the tunable capacitances in the illustrated embodiment could be tuned or adjusted over their ranges in an effort to improve the matching characteristics of the antenna 1710 under various operating conditions. Thus, under various use conditions, operating environments and at various frequencies of operation, the tunable capacitances can be adjusted to attain a desired level of performance.
Next, a current figure of merit (FOM) is calculated at step 1820. The current FOM is based on the one or more performance metrics, as well as other criteria. The current FOM is then compared to a target FOM at step 1825. The target FOM is the optimal or desired performance requirements or objective for the closed-loop system. As such, the target FOM can be defined by a weighted combination of any measurable or predictable metrics. For instance, if it is desired to maximize the efficiency of the transmitter, the target FOM can be defined to result in tuning the matching network accordingly. Thus, depending on the goal or objective, the target FOM can be defined to tune the matching network to achieve particular goals or objectives. As a non-limiting example, the objectives may focus on total radiated power (TRP), total isotropic sensitivity (TIS), efficiency and linearity. Furthermore, the target FOM may be significantly different for a TDM system and an FDM system. It should be understood that the target FOM may be calculated or selected based on various operating conditions, prior measurements, and modes of operation or, the target FOM can be determined at design time and hard-coded into the closed-loop tuning algorithm 1800.
If it is determined that the current FOM is not equal to the target FOM, or at least within a threshold value of the target FOM 1830, new tuning values can be calculated or selected at step 1835. However, if the current FOM is equal to or within the defined threshold, then processing continues by once again measuring the performance metrics 1810 and repeating the process. Finally, if the current FOM needs to be adjusted towards the target FOM, the tuning algorithm can determine new tuning values for the matching network in an effort to attain or achieve operation at the target FOM 340. In some embodiments, this new tuning value may also be stored as a new default tuning value of the transmitter at the given state of operation. For instance, in one embodiment, a single default value can be used for all situations, and as such, the latest tuning values can be stored in a variable location. In other embodiments, a default tuning state may be maintained for a variety of operational states, such as band of operation, use case scenario (i.e., hand held, antenna up/down, slider in/out, etc.) and depending on the current operational state, the new tuning values may be stored into an appropriate default variable.
In one embodiment, the closed-loop tuning algorithm can tune one or more of the tunable components of the circuit of
In other embodiments, the tunable components can be set based on look-up tables or a combination of look-up tables and by performing fine-tuning adjustments. For instance, the step of calculating tuning values at step 1835 may involve accessing initial values from a look-up table and then, on subsequent loops, fine tuning the values of the components in the circuit of
In one embodiment where a communication device is operating within a TDM environment, the tuning algorithm can be configured to optimize the operation of the transmitter during a transmit time slot. In such an embodiment, the performance metric may be the transmitter return loss. In addition, the target FOM in such an embodiment may be a function of the transmitter return loss. In this embodiment, the tuning algorithm can be configured to minimize the FOM or the transmitter return loss. More particularly, for the circuit illustrated in
The adjustment values for PTC1 and PTC2 can be determined in a variety of ways. For instance, in one embodiment the values may be stored in memory for various transmitter frequencies and usage scenarios. In other embodiments, the values may be heuristically determined by making adjustments to the tuning circuit, observing the effect on the transmitter return loss, and compensating accordingly. In yet another embodiment, a combination of a look-up table combined with heuristically determined tuning can be used to adjust the matching network of
During the receiver time slot, the tuning algorithm can be reconfigured to optimize or improve the performance of the receiver. Similar to the adjustments during the transmit time slot, particular performance parameters may be measured and used to calculate a current FOM. However, it may be difficult to measure such performance parameters for the receiver. In one embodiment the tuning algorithm can be configured to apply a translation to the tuning values of the matching network derived during the transmitter time slot, to improve performance during the receive time slot. During the design of the transmitter and receiver circuitry, the characteristics of performance between the transmitter operation and receiver operation can be characterized. This characterization can then be used to identify an appropriate translation to be applied. The translation may be selected as a single value that is applicable for all operational states and use cases or, individual values which can be determined for various operational states and use cases.
In the illustrated example, the performance is determined to be greatly improved for the receiver time slot if the value of PTC2 for receiver operation is adjusted to be 0.6 times the value of PTC2 used for the optimal transmitter setting and the value of PTC 1 remains the same. This is true for each of the illustrated cases except at the 915 MHz/960 MHz operational state. At 960 MHz, it is apparent that significant receiver improvement can be realized by also adjusting the value of PTC1 from its transmitter value. In the illustrated example, by examining the characteristics of the circuitry it can be empirically derived that a suitable equation for operation of the receiver at 960 MHz can be:
PTC1—Rx=PTC1—Tx+1−1.8*PTC2—Tx.
It should be noted that this equation is a non-limiting example of an equation that can be used for a particular circuit under particular operating conditions and the subject disclosure is not limited to utilization of this particular equation.
For instance, various states, components or conditions can be sensed and analyzed to determine or detect a current state or a current use case for the communication device. Based on this information, a particular translation value or function may be retrieved and applied. Such translations can be determined during the design phase when implementing the communication device and stored in a memory device of the communication device. The translations can be applied to the closed loop system 1800 at step 2030. When operation returns to the transmitter time slot at step 2035, the closed-loop algorithm 1800 again takes over to optimize operation based on the target FOM.
It should be understood that the translation applied to the closed-loop tuning algorithm 1800 during the receiver time slot can be based on the particular tuning circuit in use and can be determined during design phase of the communication device or on an individual basis during manufacturing and testing of the communication device. As such, the specific translations identified herein are for illustrative purposes only and should not be construed to limit the embodiments described by the subject disclosure.
For TDM systems, a tuning algorithm can operate to optimize operation of the communication device by tuning the matching circuit for an antenna according to a target FOM. During the receiver time slot, a translation can be applied to the tuned components to improve receiver performance. The target FOM can be based on a variety of performance metrics such as the reflection loss of the transmitter. The values for the tuned components can be set based on operational conditions determined by a look-up table, or by the use of heuristics during operation. The translations applied during the receiver operation can be determined empirically based on the design of the circuitry and/or testing and measurements of the operation of the circuit. In one embodiment, the tuning algorithm can tune the matching circuit during transmit mode based on non-receiver related metrics and then retune the circuit during receive mode operation based on a translation to optimize or attain a desired level of receiver operation.
In one embodiment when the communication device is operating within an FDM environment, the tuning algorithm can be adjusted so that the matching characteristics represent a compromise between optimal transmitter and receiver operation. Several techniques can be applied to achieve this compromise. In one embodiment, the translation applied in the TDM illustration above can be modified to adjust a tuning circuit as a compromise between the optimal transmit and receive settings. For instance, in the example circuit illustrated in
In another embodiment, the tuning algorithm can be configured to attain a target FOM that is based on one or more transmitter related metrics (such as return loss) and the values of the adjustable components of a tunable circuit. In this embodiment, the tuning algorithm can continuously attempt to maintain a compromised state of operation that keeps the operation of the transmitter and the receiver at a particular target FOM that serving as a compromised performance metric level.
In the particular illustration applied to the circuit of
The operational goal of a tuning algorithm can be to attempt to maintain the matching circuit at a point where the operational metrics for the transmitter are at a target value (e.g., −12 dB) and the estimated desired receiver operation is proximate. In one embodiment, an equation used to express a target FOM for such an arrangement can be stated as follows:
Target FOM=f(Tx—RL,TX—RL_Target)+f(PTC2,PTC1)
Where: TX_RL is the measure transmitter return loss and TX_RL_Target is the targeted transmitter return loss.
In an embodiment suitable for the circuit provided in
FOM=(Tx—RL−Tx—RL_Target)+(C2*PTC2−C1*PTC1),
Where C1 and C2 are preference constants or scaled values, and if Tx_RL>Tx_RL_Target then Tx_RL=Tx_RL_Target.
In operation, the foregoing embodiments can be used in a tuning algorithm to optimize a transmitter based on a target reflected loss to attain operation at the desired contour 2110 (as shown in
In the illustrated example, the target FOM can be the point at which the reflected loss contour is closest to the expected same valued reflected loss contour for the receiver. However, other performance goals may also be sought and the subject disclosure is not limited to this particular example. For instance, in other embodiments, the target FOM may be selected to encourage operation at a mid-point between optimal transmitter performance and expected optimal receiver performance. In yet another embodiment, the target FOM may be selected to encourage operation at a point that is a mid-point between a desired transmitter metric and an estimated or measured equivalent for the receiver metric.
In the example illustrated in
Another embodiment of a tuning algorithm may take into consideration historical performance of the tunable components as well as current values. As an example, as the tunable components are adjusted, changes in the current FOM will occur in a particular direction (i.e., better or worse). As an example, if tuning adjustments result in the current FOM falling on the top portion of a desired performance contour, making a particular adjustment may result in making the current FOM worse or better. If the adjustment was known to cause a certain result when the current FOM is located on the bottom of the contour and this time, the opposite result occurs, then this knowledge can help identify where the current FOM is located on the contour. Thus, knowing this information can be used in combination with operation metrics to attain the operation at the target FOM. For instance, the target FOM may be a function of operational metrics, current states of the tunable components, and the knowledge of previous results from adjusting the tunable components.
Stated another way, when a current FOM is calculated, the adjustments to reach the target FOM may take into consideration past reactions to previous adjustments. Thus, the adjustment to the tunable components may be a function of the FOM associated with a current setting and, the change in the current FOM resulting from previous changes to the tunable components.
In another embodiment in which the communication device is operating in an FDM environment, the FOM may be optimized similar to the operation in the TDM environment. For example, the FOM can be a function of the transmitter reflected loss metric and the tuning algorithm can be configured to optimize the FOM based on this metric. Once optimized, the tunable components can be adjusted based on a predetermined translation to move the FOM from an optimized state for the transmitter to a position that is somewhere between the optimal transmitter setting and the optimal receiver setting.
The aforementioned embodiments of a tuning algorithm and other variants can be applied to all or a subset of the algorithms described in
Upon reviewing the aforementioned embodiments, it would be evident to an artisan with ordinary skill in the art that said embodiments can be modified, reduced, or enhanced without departing from the scope and spirit of the claims described below. For example, the configurations shown in
It should be understood that devices described in the exemplary embodiments can be in communication with each other via various wireless and/or wired methodologies. The methodologies can be links that are described as coupled, connected and so forth, which can include unidirectional and/or bidirectional communication over wireless paths and/or wired paths that utilize one or more of various protocols or methodologies, where the coupling and/or connection can be direct (e.g., no intervening processing device) and/or indirect (e.g., an intermediary processing device).
The machine may comprise a server computer, a client user computer, a personal computer (PC), a tablet PC, a smart phone, a laptop computer, a desktop computer, a control system, a network router, switch or bridge, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. It will be understood that a communication device of the subject disclosure includes broadly any electronic device that provides voice, video or data communication. Further, while a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methods discussed herein.
The computer system 2200 may include a processor (or controller) 2202 (e.g., a central processing unit (CPU), a graphics processing unit (GPU, or both), a main memory 2204 and a static memory 2206, which communicate with each other via a bus 2208. The computer system 2200 may further include a video display unit 2210 (e.g., a liquid crystal display (LCD), a flat panel, or a solid state display. The computer system 2200 may include an input device 2212 (e.g., a keyboard), a cursor control device 2214 (e.g., a mouse), a disk drive unit 2216, a signal generation device 2218 (e.g., a speaker or remote control) and a network interface device 2220.
The disk drive unit 2216 may include a tangible computer-readable storage medium 2222 on which is stored one or more sets of instructions (e.g., software 2224) embodying any one or more of the methods or functions described herein, including those methods illustrated above. The instructions 2224 may also reside, completely or at least partially, within the main memory 2204, the static memory 2206, and/or within the processor 2202 during execution thereof by the computer system 2200. The main memory 2204 and the processor 2202 also may constitute tangible computer-readable storage media.
Dedicated hardware implementations including, but not limited to, application specific integrated circuits, programmable logic arrays and other hardware devices can likewise be constructed to implement the methods described herein. Applications that may include the apparatus and systems of various embodiments broadly include a variety of electronic and computer systems. Some embodiments implement functions in two or more specific interconnected hardware modules or devices with related control and data signals communicated between and through the modules, or as portions of an application-specific integrated circuit. Thus, the example system is applicable to software, firmware, and hardware implementations.
In accordance with various embodiments of the subject disclosure, the methods described herein are intended for operation as software programs running on a computer processor. Furthermore, software implementations can include, but not limited to, distributed processing or component/object distributed processing, parallel processing, or virtual machine processing can also be constructed to implement the methods described herein.
While the tangible computer-readable storage medium 622 is shown in an example embodiment to be a single medium, the term “tangible computer-readable storage medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “tangible computer-readable storage medium” shall also be taken to include any non-transitory medium that is capable of storing or encoding a set of instructions for execution by the machine and that cause the machine to perform any one or more of the methods of the subject disclosure.
The term “tangible computer-readable storage medium” shall accordingly be taken to include, but not be limited to: solid-state memories such as a memory card or other package that houses one or more read-only (non-volatile) memories, random access memories, or other re-writable (volatile) memories, a magneto-optical or optical medium such as a disk or tape, or other tangible media which can be used to store information. Accordingly, the disclosure is considered to include any one or more of a tangible computer-readable storage medium, as listed herein and including art-recognized equivalents and successor media, in which the software implementations herein are stored.
Although the present specification describes components and functions implemented in the embodiments with reference to particular standards and protocols, the disclosure is not limited to such standards and protocols. Each of the standards for Internet and other packet switched network transmission (e.g., TCP/IP, UDP/IP, HTML, HTTP) represent examples of the state of the art. Such standards are from time-to-time superseded by faster or more efficient equivalents having essentially the same functions. Wireless standards for device detection (e.g., RFID), short-range communications (e.g., Bluetooth, WiFi, Zigbee), and long-range communications (e.g., WiMAX, GSM, CDMA, LTE) are contemplated for use by computer system 2200.
The illustrations of embodiments described herein are intended to provide a general understanding of the structure of various embodiments, and they are not intended to serve as a complete description of all the elements and features of apparatus and systems that might make use of the structures described herein. Many other embodiments will be apparent to those of skill in the art upon reviewing the above description. Other embodiments may be utilized and derived therefrom, such that structural and logical substitutions and changes may be made without departing from the scope of this disclosure. Figures are also merely representational and may not be drawn to scale. Certain proportions thereof may be exaggerated, while others may be minimized. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
Although specific embodiments have been illustrated and described herein, it should be appreciated that any arrangement calculated to achieve the same purpose may be substituted for the specific embodiments shown. This disclosure is intended to cover any and all adaptations or variations of various embodiments. Combinations of the above embodiments, and other embodiments not specifically described herein, are contemplated by the subject disclosure.
The Abstract of the Disclosure is provided with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, it can be seen that various features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separately claimed subject matter.
Number | Name | Date | Kind |
---|---|---|---|
2745067 | True | May 1956 | A |
3117279 | Ludvigson | Jan 1964 | A |
3160832 | Beitman | Dec 1964 | A |
3390337 | Beitman | Jun 1968 | A |
3443231 | Roza | May 1969 | A |
3509500 | McNair | Apr 1970 | A |
3571716 | Hill | Mar 1971 | A |
3590385 | Sabo | Jun 1971 | A |
3601717 | Kuecken | Aug 1971 | A |
3794941 | Templin | Feb 1974 | A |
3919644 | Smolka | Nov 1975 | A |
3990024 | Hou | Nov 1976 | A |
3995237 | Brunner | Nov 1976 | A |
4186359 | Kaegebein | Jan 1980 | A |
4201960 | Skutta | May 1980 | A |
4227256 | O'Keefe | Oct 1980 | A |
4383441 | Willis | May 1983 | A |
4476578 | Gaudin | Oct 1984 | A |
4493112 | Bruene | Jan 1985 | A |
4777490 | Sharma | Oct 1988 | A |
4799066 | Deacon | Jan 1989 | A |
4965607 | Wilkins | Oct 1990 | A |
4980656 | Duffalo | Dec 1990 | A |
5032805 | Elmer | Jul 1991 | A |
5142255 | Chang | Aug 1992 | A |
5177670 | Shinohara | Jan 1993 | A |
5195045 | Keane | Mar 1993 | A |
5200826 | Seong | Apr 1993 | A |
5212463 | Babbitt | May 1993 | A |
5243358 | Sanford | Sep 1993 | A |
5258728 | Taniyoshi | Nov 1993 | A |
5276912 | Siwiak | Jan 1994 | A |
5301358 | Gaskill | Apr 1994 | A |
5307033 | Koscica | Apr 1994 | A |
5310358 | Johnson | May 1994 | A |
5312790 | Sengupta | May 1994 | A |
5334958 | Babbitt | Aug 1994 | A |
5371473 | Trinh | Dec 1994 | A |
5409889 | Das | Apr 1995 | A |
5427988 | Sengupta | Jun 1995 | A |
5430417 | Martin | Jul 1995 | A |
5446447 | Carney | Aug 1995 | A |
5448252 | Ali | Sep 1995 | A |
5451567 | Das | Sep 1995 | A |
5451914 | Stengel | Sep 1995 | A |
5457394 | McEwan | Oct 1995 | A |
5472935 | Yandrofski | Dec 1995 | A |
5479139 | Koscica | Dec 1995 | A |
5486491 | Sengupta | Jan 1996 | A |
5496795 | Das | Mar 1996 | A |
5502372 | Quan | Mar 1996 | A |
5524281 | Bradley | Jun 1996 | A |
5548837 | Hess et al. | Aug 1996 | A |
5561407 | Koscica | Oct 1996 | A |
5564086 | Cygan | Oct 1996 | A |
5589844 | Belcher et al. | Dec 1996 | A |
5593495 | Masuda | Jan 1997 | A |
5635433 | Sengupta | Jun 1997 | A |
5635434 | Sengupta | Jun 1997 | A |
5640042 | Koscica | Jun 1997 | A |
5679624 | Das | Oct 1997 | A |
5689219 | Piirainen | Nov 1997 | A |
5693429 | Sengupta | Dec 1997 | A |
5694134 | Barnes | Dec 1997 | A |
5699071 | Urakami | Dec 1997 | A |
5721194 | Yandrofski | Feb 1998 | A |
5766697 | Sengupta | Jun 1998 | A |
5777581 | Lilly | Jul 1998 | A |
5778308 | Sroka | Jul 1998 | A |
5786727 | Sigmon | Jul 1998 | A |
5812572 | King | Sep 1998 | A |
5812943 | Suzuki | Sep 1998 | A |
5830591 | Sengupta | Nov 1998 | A |
5846893 | Sengupta | Dec 1998 | A |
5874926 | Tsuru | Feb 1999 | A |
5880635 | Satoh | Mar 1999 | A |
5886867 | Chivukula | Mar 1999 | A |
5892482 | Coleman et al. | Apr 1999 | A |
5929717 | Richardson | Jul 1999 | A |
5963871 | Zhinong | Oct 1999 | A |
5969582 | Boesch | Oct 1999 | A |
5982099 | Barnes et al. | Nov 1999 | A |
5990766 | Zhang | Nov 1999 | A |
6009124 | Smith | Dec 1999 | A |
6020787 | Kim | Feb 2000 | A |
6020795 | Kim | Feb 2000 | A |
6029075 | Das | Feb 2000 | A |
6045932 | Jia | Apr 2000 | A |
6061025 | Jackson | May 2000 | A |
6074971 | Chiu | Jun 2000 | A |
6096127 | Dimos | Aug 2000 | A |
6100733 | Dortu | Aug 2000 | A |
6101102 | Brand | Aug 2000 | A |
6115585 | Matero | Sep 2000 | A |
6125266 | Matero et al. | Sep 2000 | A |
6133883 | Munson | Oct 2000 | A |
6172385 | Duncombe | Jan 2001 | B1 |
6215644 | Dhuler | Apr 2001 | B1 |
6242989 | Barber | Jun 2001 | B1 |
6281748 | Klomsdorf et al. | Aug 2001 | B1 |
6281847 | Lee | Aug 2001 | B1 |
6343208 | Ying | Jan 2002 | B1 |
6377142 | Chiu | Apr 2002 | B1 |
6377217 | Zhu | Apr 2002 | B1 |
6377440 | Zhu | Apr 2002 | B1 |
6384785 | Kamogawa | May 2002 | B1 |
6404614 | Zhu | Jun 2002 | B1 |
6408190 | Ying | Jun 2002 | B1 |
6414562 | Bouisse | Jul 2002 | B1 |
6415562 | Donaghue | Jul 2002 | B1 |
6452776 | Chakravorty | Sep 2002 | B1 |
6461930 | Akram | Oct 2002 | B2 |
6466774 | Okabe | Oct 2002 | B1 |
6492883 | Liang | Dec 2002 | B2 |
6514895 | Chiu | Feb 2003 | B1 |
6525630 | Zhu | Feb 2003 | B1 |
6531936 | Chiu | Mar 2003 | B1 |
6535076 | Partridge | Mar 2003 | B2 |
6535722 | Rosen | Mar 2003 | B1 |
6538603 | Chen | Mar 2003 | B1 |
6556102 | Sengupta | Apr 2003 | B1 |
6556814 | Klomsdorf | Apr 2003 | B1 |
6570462 | Edmonson | May 2003 | B2 |
6590468 | du Toit | Jul 2003 | B2 |
6590541 | Schultze | Jul 2003 | B1 |
6597265 | Liang | Jul 2003 | B2 |
6608603 | Alexopoulos | Aug 2003 | B2 |
6624786 | Boyle | Sep 2003 | B2 |
6640085 | Chatzipetros | Oct 2003 | B1 |
6657595 | Phillips | Dec 2003 | B1 |
6661638 | Jackson | Dec 2003 | B2 |
6670256 | Yang | Dec 2003 | B2 |
6710651 | Forrester | Mar 2004 | B2 |
6724611 | Mosley | Apr 2004 | B1 |
6724890 | Bareis | Apr 2004 | B1 |
6737179 | Sengupta | May 2004 | B2 |
6747522 | Pietruszynski et al. | Jun 2004 | B2 |
6759918 | Du Toit | Jul 2004 | B2 |
6765540 | Toncich | Jul 2004 | B2 |
6768472 | Alexopoulos | Jul 2004 | B2 |
6774077 | Sengupta | Aug 2004 | B2 |
6795712 | Vakilian | Sep 2004 | B1 |
6825818 | Toncich | Nov 2004 | B2 |
6839028 | Lee | Jan 2005 | B2 |
6845126 | Dent | Jan 2005 | B2 |
6859104 | Toncich | Feb 2005 | B2 |
6862432 | Kim | Mar 2005 | B1 |
6864757 | Du Toit | Mar 2005 | B2 |
6868260 | Jagielski | Mar 2005 | B2 |
6888714 | Shaw | May 2005 | B2 |
6905989 | Ellis | Jun 2005 | B2 |
6906653 | Uno | Jun 2005 | B2 |
6907234 | Karr | Jun 2005 | B2 |
6920315 | Wilcox et al. | Jul 2005 | B1 |
6943078 | Zheng | Sep 2005 | B1 |
6946847 | Nishimori | Sep 2005 | B2 |
6949442 | Barth | Sep 2005 | B2 |
6961368 | Dent | Nov 2005 | B2 |
6964296 | Memory | Nov 2005 | B2 |
6965837 | Vintola | Nov 2005 | B2 |
6993297 | Smith | Jan 2006 | B2 |
7009455 | Toncich | Mar 2006 | B2 |
7071776 | Forrester | Jul 2006 | B2 |
7106715 | Kelton | Sep 2006 | B1 |
7107033 | D du Toit | Sep 2006 | B2 |
7113614 | Rhoads | Sep 2006 | B2 |
7151411 | Martin | Dec 2006 | B2 |
7176634 | Kitamura | Feb 2007 | B2 |
7176845 | Fabrega-Sanchez | Feb 2007 | B2 |
7180467 | Fabrega-Sanchez | Feb 2007 | B2 |
7221327 | Toncich | May 2007 | B2 |
7298329 | Diament | Nov 2007 | B2 |
7299018 | Van Rumpt | Nov 2007 | B2 |
7312118 | Kiyotoshi | Dec 2007 | B2 |
7332980 | Zhu | Feb 2008 | B2 |
7332981 | Matsuno | Feb 2008 | B2 |
7339527 | Sager | Mar 2008 | B2 |
7426373 | Clingman | Sep 2008 | B2 |
7427949 | Channabasappa et al. | Sep 2008 | B2 |
7453405 | Nishikido et al. | Nov 2008 | B2 |
7468638 | Tsai | Dec 2008 | B1 |
7469129 | Blaker et al. | Dec 2008 | B2 |
7535080 | Zeng et al. | May 2009 | B2 |
7535312 | McKinzie | May 2009 | B2 |
7539527 | Jang | May 2009 | B2 |
7596357 | Nakamata | Sep 2009 | B2 |
7633355 | Matsuo | Dec 2009 | B2 |
7642879 | Matsuno | Jan 2010 | B2 |
7667663 | Hsiao | Feb 2010 | B2 |
7705692 | Fukamachi et al. | Apr 2010 | B2 |
7711337 | McKinzie | May 2010 | B2 |
7714676 | McKinzie | May 2010 | B2 |
7714678 | Ueki | May 2010 | B2 |
7728693 | Masters | Jun 2010 | B2 |
7768400 | Lawrence et al. | Aug 2010 | B2 |
7786819 | Ella | Aug 2010 | B2 |
7795990 | du Toit | Sep 2010 | B2 |
7852170 | McKinzie | Dec 2010 | B2 |
7865154 | Mendolia | Jan 2011 | B2 |
7907094 | Kakitsu et al. | Mar 2011 | B2 |
7917104 | Manssen et al. | Mar 2011 | B2 |
7949309 | Rofougaran | May 2011 | B2 |
7969257 | du Toit | Jun 2011 | B2 |
7991363 | Greene | Aug 2011 | B2 |
8112043 | Knudsen et al. | Feb 2012 | B2 |
8170510 | Knudsen et al. | May 2012 | B2 |
8190109 | Ali et al. | May 2012 | B2 |
8204446 | Scheer | Jun 2012 | B2 |
8217732 | McKinzie | Jul 2012 | B2 |
8299867 | McKinzie | Oct 2012 | B2 |
8320850 | Khlat | Nov 2012 | B1 |
8325097 | McKinzie, III et al. | Dec 2012 | B2 |
8405563 | McKinzie et al. | Mar 2013 | B2 |
8421548 | Spears et al. | Apr 2013 | B2 |
8442457 | Harel et al. | May 2013 | B2 |
8457569 | Blin | Jun 2013 | B2 |
8472888 | Manssen et al. | Jun 2013 | B2 |
8558633 | McKinzie, III | Oct 2013 | B2 |
8564381 | McKinzie | Oct 2013 | B2 |
8594584 | Greene et al. | Nov 2013 | B2 |
8620236 | Manssen et al. | Dec 2013 | B2 |
8620246 | McKinzie et al. | Dec 2013 | B2 |
8620247 | McKinzie et al. | Dec 2013 | B2 |
8655286 | Mendolia | Feb 2014 | B2 |
8674783 | Spears et al. | Mar 2014 | B2 |
8693963 | du Toit et al. | Apr 2014 | B2 |
20020008672 | Griffin | Jan 2002 | A1 |
20020030566 | Bozler | Mar 2002 | A1 |
20020109642 | Gee et al. | Aug 2002 | A1 |
20020118075 | Ohwada | Aug 2002 | A1 |
20020145483 | Bouisse | Oct 2002 | A1 |
20020167963 | Joa-Ng | Nov 2002 | A1 |
20020183013 | Auckland et al. | Dec 2002 | A1 |
20020187780 | Souissi | Dec 2002 | A1 |
20020191703 | Ling | Dec 2002 | A1 |
20020193088 | Jung | Dec 2002 | A1 |
20030060227 | Sekine | Mar 2003 | A1 |
20030071300 | Yashima | Apr 2003 | A1 |
20030114124 | Higuchi | Jun 2003 | A1 |
20030142022 | Ollikainen | Jul 2003 | A1 |
20030193997 | Dent | Oct 2003 | A1 |
20030199286 | D du Toit | Oct 2003 | A1 |
20030210206 | Phillips | Nov 2003 | A1 |
20030216150 | Ueda | Nov 2003 | A1 |
20030232607 | Le Bars | Dec 2003 | A1 |
20040009754 | Smith | Jan 2004 | A1 |
20040090372 | Nallo | May 2004 | A1 |
20040100341 | Luetzelschwab | May 2004 | A1 |
20040127178 | Kuffner | Jul 2004 | A1 |
20040137950 | Bolin | Jul 2004 | A1 |
20040202399 | Kochergin | Oct 2004 | A1 |
20040227176 | York | Nov 2004 | A1 |
20040232982 | Ichitsubo et al. | Nov 2004 | A1 |
20040257293 | Friedrich | Dec 2004 | A1 |
20040263411 | Fabrega-Sanchez et al. | Dec 2004 | A1 |
20050007291 | Fabrega-Sanchez | Jan 2005 | A1 |
20050032488 | Pehlke | Feb 2005 | A1 |
20050032541 | Wang | Feb 2005 | A1 |
20050042994 | Otaka | Feb 2005 | A1 |
20050059362 | Kalajo | Mar 2005 | A1 |
20050082636 | Yashima | Apr 2005 | A1 |
20050085204 | Poilasne et al. | Apr 2005 | A1 |
20050093624 | Forrester et al. | May 2005 | A1 |
20050130608 | Forse | Jun 2005 | A1 |
20050130699 | Kim | Jun 2005 | A1 |
20050208960 | Hassan | Sep 2005 | A1 |
20050215204 | Wallace | Sep 2005 | A1 |
20050264455 | Talvitie | Dec 2005 | A1 |
20050282503 | Onno | Dec 2005 | A1 |
20060003537 | Sinha | Jan 2006 | A1 |
20060009165 | Alles | Jan 2006 | A1 |
20060077082 | Shanks et al. | Apr 2006 | A1 |
20060099915 | Laroia et al. | May 2006 | A1 |
20060160501 | Mendolia | Jul 2006 | A1 |
20060183431 | Chang et al. | Aug 2006 | A1 |
20060183433 | Mori et al. | Aug 2006 | A1 |
20060183442 | Chang et al. | Aug 2006 | A1 |
20060205368 | Bustamante | Sep 2006 | A1 |
20060281423 | Caimi | Dec 2006 | A1 |
20070013483 | Stewart | Jan 2007 | A1 |
20070035458 | Isao | Feb 2007 | A1 |
20070042725 | Poilasne | Feb 2007 | A1 |
20070042734 | Ryu | Feb 2007 | A1 |
20070063788 | Zhu | Mar 2007 | A1 |
20070080888 | Mohamadi | Apr 2007 | A1 |
20070082611 | Terranova et al. | Apr 2007 | A1 |
20070085609 | Itkin | Apr 2007 | A1 |
20070111681 | Alberth et al. | May 2007 | A1 |
20070142014 | Wilcox | Jun 2007 | A1 |
20070149146 | Hwang | Jun 2007 | A1 |
20070171879 | Bourque | Jul 2007 | A1 |
20070182636 | Carlson | Aug 2007 | A1 |
20070184825 | Lim et al. | Aug 2007 | A1 |
20070194859 | Brobston | Aug 2007 | A1 |
20070197180 | McKinzie et al. | Aug 2007 | A1 |
20070200766 | McKinzie | Aug 2007 | A1 |
20070285326 | McKinzie | Dec 2007 | A1 |
20070293176 | Yu | Dec 2007 | A1 |
20080007478 | Jung | Jan 2008 | A1 |
20080018541 | Pang | Jan 2008 | A1 |
20080055016 | Morris | Mar 2008 | A1 |
20080081670 | Rofougaran | Apr 2008 | A1 |
20080090539 | Thompson | Apr 2008 | A1 |
20080094149 | Brobston | Apr 2008 | A1 |
20080106350 | McKinzie | May 2008 | A1 |
20080122553 | McKinzie | May 2008 | A1 |
20080122723 | Rofougaran | May 2008 | A1 |
20080129612 | Wang | Jun 2008 | A1 |
20080158076 | Walley | Jul 2008 | A1 |
20080261544 | Guillaume | Oct 2008 | A1 |
20080274706 | Blin | Nov 2008 | A1 |
20080285729 | Glasgow et al. | Nov 2008 | A1 |
20080294718 | Okano | Nov 2008 | A1 |
20080300027 | Weiping | Dec 2008 | A1 |
20080305749 | Ben-Bassat | Dec 2008 | A1 |
20080305750 | Alon et al. | Dec 2008 | A1 |
20080309617 | Kong et al. | Dec 2008 | A1 |
20090002077 | Rohani et al. | Jan 2009 | A1 |
20090027286 | Ohishi | Jan 2009 | A1 |
20090082017 | Chang et al. | Mar 2009 | A1 |
20090109880 | Kim et al. | Apr 2009 | A1 |
20090121963 | Greene | May 2009 | A1 |
20090149136 | Rofougaran | Jun 2009 | A1 |
20090180403 | Tudosoiu | Jul 2009 | A1 |
20090184879 | Derneryd | Jul 2009 | A1 |
20090215446 | Hapsari et al. | Aug 2009 | A1 |
20090231220 | Yang et al. | Sep 2009 | A1 |
20090253385 | Dent et al. | Oct 2009 | A1 |
20090264065 | Song | Oct 2009 | A1 |
20090278685 | Potyrailo | Nov 2009 | A1 |
20090323582 | Proctor et al. | Dec 2009 | A1 |
20100041348 | Wilcox et al. | Feb 2010 | A1 |
20100053009 | Ahmadreza | Mar 2010 | A1 |
20100060531 | Rappaport | Mar 2010 | A1 |
20100073103 | Spears et al. | Mar 2010 | A1 |
20100085260 | McKinzie | Apr 2010 | A1 |
20100105425 | Asokan | Apr 2010 | A1 |
20100156552 | McKinzie et al. | Jun 2010 | A1 |
20100232474 | Rofougaran | Sep 2010 | A1 |
20100244576 | Hillan et al. | Sep 2010 | A1 |
20100285836 | Horihata et al. | Nov 2010 | A1 |
20100302106 | Knudsen et al. | Dec 2010 | A1 |
20100304688 | Knudsen | Dec 2010 | A1 |
20110002080 | Ranta | Jan 2011 | A1 |
20110012790 | Badaruzzaman | Jan 2011 | A1 |
20110014879 | Alberth et al. | Jan 2011 | A1 |
20110086600 | Muhammad | Apr 2011 | A1 |
20110086630 | Manssen et al. | Apr 2011 | A1 |
20110102290 | Milosavljevic | May 2011 | A1 |
20110105023 | Scheer et al. | May 2011 | A1 |
20110116423 | Rousu et al. | May 2011 | A1 |
20110117863 | Camp et al. | May 2011 | A1 |
20110121079 | Lawrence et al. | May 2011 | A1 |
20110133994 | Korva | Jun 2011 | A1 |
20110183628 | Baker | Jul 2011 | A1 |
20110183633 | Isao | Jul 2011 | A1 |
20110195679 | Lee et al. | Aug 2011 | A1 |
20110237207 | Bauder | Sep 2011 | A1 |
20110249760 | Chrisikos et al. | Oct 2011 | A1 |
20110256857 | Chen et al. | Oct 2011 | A1 |
20110281532 | Joo et al. | Nov 2011 | A1 |
20110299438 | Mikhemar | Dec 2011 | A1 |
20120051409 | Brobston et al. | Mar 2012 | A1 |
20120075159 | Chang | Mar 2012 | A1 |
20120094708 | Park | Apr 2012 | A1 |
20120100802 | Mohebbi | Apr 2012 | A1 |
20120112851 | Manssen | May 2012 | A1 |
20120112852 | Manssen et al. | May 2012 | A1 |
20120119843 | du Toit et al. | May 2012 | A1 |
20120119844 | du Toit et al. | May 2012 | A1 |
20120214421 | Hoirup | Aug 2012 | A1 |
20120243579 | Premakanthan et al. | Sep 2012 | A1 |
20120286586 | Balm | Nov 2012 | A1 |
20120295554 | Greene | Nov 2012 | A1 |
20120295555 | Greene et al. | Nov 2012 | A1 |
20130005277 | Klomsdorf et al. | Jan 2013 | A1 |
20130052967 | Black et al. | Feb 2013 | A1 |
20130106332 | Williams et al. | May 2013 | A1 |
20130137384 | Desclos et al. | May 2013 | A1 |
20130215846 | Yerrabommanahalli et al. | Aug 2013 | A1 |
Number | Date | Country |
---|---|---|
101640949 | Feb 2010 | CN |
19614655 | Oct 1997 | DE |
102009018648 | Oct 2010 | DE |
0685936 | Jun 1995 | EP |
0909024 | Apr 1999 | EP |
1079296 | Feb 2001 | EP |
1137192 | Sep 2001 | EP |
1298810 | Apr 2006 | EP |
2328233 | Jun 2011 | EP |
2388925 | Nov 2011 | EP |
2424119 | Feb 2012 | EP |
03276901 | Mar 1990 | JP |
9321526 | Dec 1997 | JP |
10209722 | Aug 1998 | JP |
100645526 | Nov 2006 | KR |
10-0740177 | Jul 2007 | KR |
WO-0107184 | Sep 2001 | WO |
2006031170 | Mar 2006 | WO |
WO-2008030165 | Mar 2008 | WO |
WO-2009064968 | May 2009 | WO |
2009108391 | Sep 2009 | WO |
WO-2009155966 | Dec 2009 | WO |
WO-2011044592 | Apr 2011 | WO |
2011084716 | Jul 2011 | WO |
WO-2011133657 | Oct 2011 | WO |
WO-2011028453 | Oct 2011 | WO |
2012067622 | May 2012 | WO |
2012085932 | Jun 2012 | WO |
Entry |
---|
Huang, Libo et al., “Theoretical and experimental investigation of adaptive antenna impedance matching for multiband mobile phone applications”, IEEE, Sep. 7, 2005, 13-17. |
Patent Cooperation Treaty, “International Search Report and Written Opinion”, Nov. 16, 2011, International Application No. PCT/US/2011/038543. |
Bezooijen, A. et al., “A GSM/EDGE/WCDMA Adaptive Series-LC Matching Network Using RF-MEMS Switches”, IEEE Journal of Solid-State Circuits, vol. 43, No. 10, Oct. 2008, 2259-2268. |
Du Toit, , “Tunable Microwave Devices With Auto Adjusting Matching Circuit”, U.S. Appl. No. 13/302,617, filed Nov. 22, 2011. |
Du Toit, , “Tunable Microwave Devices With Auto-Adjusting Matching Circuit”, U.S. Appl. No. 13/302,649, filed Nov. 22, 2011. |
Greene, , “Method and Apparatus for Tuning a Communication Device”, U.S. Appl. No. 13/108,463, filed May 16, 2011. |
Greene, , “Method and Apparatus for Tuning a Communication Device”, U.S. Appl. No. 13/108,589, filed May 16, 2011. |
Hoirup, , “Method and Apparatus for Radio Antenna Frequency Tuning”, U.S. Appl. No. 13/030,177, filed Feb. 18, 2011. |
Hyun, S. , “Effects of strain on the dielectric properties of tunable dielectric SrTi03 thin films”, Applied Physics Letters, 2004 American Institute of Physics. |
Ida, I. et al., “An Adaptive Impedence Matching System and Its Application to Mobile Antennas”, TENCON 2004, IEEE Region 10 Conference, See Abstract ad p. 544, Nov. 21-24, 2004, 543-547. |
Manssen, , “Method and Apparatus for Managing Interference in a Communication Device”, U.S. Appl. No. 61/326,206, filed Apr. 20, 2010. |
Manssen, , “Method and Apparatus for Tuning Antennas in a Communication Device”, U.S. Appl. No. 12/941,972, filed Nov. 8, 2010. |
Manssen, , “Method and Apparatus for Tuning Antennas in a Communication Device”, U.S. Appl. No. 13/005,122, filed Jan. 12, 2011. |
McKinzie, , “Adaptive Impedance Matching Module (AIMM) Control Architectures”, U.S. Appl. No. 13/293,544, filed Nov. 11, 2011. |
McKinzie, , “Adaptive Impedance Matching Module (AIMM) Control Architectures”, U.S. Appl. No. 13/293,550, filed Nov. 11, 2011. |
McKinzie, , “Method and Apparatus for Adaptive Impedance Matching”, U.S. Appl. No. 13/217,748, filed Aug. 25, 2011. |
Mendolia, , “Method and Apparatus for Tuning a Communication Device”, U.S. Appl. No. 13/035,417, filed Feb. 25, 2011. |
Paratek Microwave, Inc., , “Method and Appartus for Tuning Antennas in a Communication Device”, International Application No. PCT/US11/59620; Filed Nov. 7, 2011. |
Patent Cooperation Treaty, , “International Search Report and Written Opinion”, International Application No. PCT/US2010/046241, Mar. 2, 2011. |
Patent Cooperation Treaty, , “International Search Report and Written Opinion”, International Application No. PCT/US2010/056413, Jul. 27, 2011. |
Patent Cooperation Treaty, “International Search Report and Written Opinion”, PCT Application No. PCT/US08/005085, Jul. 2, 2008. |
Payandehjoo, Kasra , “Novel Techniques for Coupling Reduction in Multi-Antenna Hand-held Devices”, IEEE Student Member, 1-8. |
Pervez, N.K. , “High Tunability barium strontium titanate thin films for RF circuit applications”, Applied Physics Letters, 2004 American Institute of Physics. |
Petit, Laurent , “MEMS-Switched Parasitic-Antenna Array for Radiation Pattern Diversity”, IEEE Transactions on Antennas and Propagation, vol. 54, No. 9, Sep. 2009, 2624-2631. |
Qiao, et al., “Antenna Impedance Mismatch Measurement and Correction for Adaptive COMA Transceivers”, IEEE, 2005. |
Qiao, et al., “Measurement of Antenna Load Impedance for Power Amplifiers”, The Department of Electrical and Computer Engineering, University of California, San Diego, Nov. 13, 2004. |
Spears, , “Methods for Tuning an Adaptive Impedance Matching Network With a Look-Up Table”, U.S. Appl. No. 13/297,951, filed Nov. 16, 2011. |
Stemmer, Susanne , “Low-loss tunable capacitors fabricated directly on gold bottom electrodes”, University of California Postprints 2006. |
Taylor, T.R. , “Impact of thermal strain on the dielectric constant of sputtered barium strontium titanate thin films”, Applied Physics Letters, 2002 American Institute of Physics. |
Tombak, Ali , “Tunable Barium Strontium Titanate Thin Film Capacitors for RF and Microwave Applications”, IEEE Microwave and Wireles Components Letters, vol. 12, Jan. 2002. |
Xu, Hongtao , “Tunable Microwave Integrated Circuits using BST Thin Film Capacitors with Device”, Integrated Ferroelectrics, Department of Electrical Engineering and Computer Engineering, University of California, 2005. |
Zuo, S. , “Eigenmode Decoupling for Mimo Loop-Antenna Based on 180 Coupler”, Progress in Electromagnetics Research Letters, vol. 26, Nov. 20, 2011. |
Number | Date | Country | |
---|---|---|---|
20130325149 A1 | Dec 2013 | US |