Implementing blind tuning in hybrid MIMO RF beamforming systems

Information

  • Patent Grant
  • 9065517
  • Patent Number
    9,065,517
  • Date Filed
    Monday, February 3, 2014
    11 years ago
  • Date Issued
    Tuesday, June 23, 2015
    9 years ago
Abstract
A system and a method for applying a blind tuning process to M antennas coupled via N beamformers to a multiple input multiple output (MIMO) receiving system having N channels, wherein M>N, are provided herein. The method includes the following steps: Periodically measuring channel fading rate at a baseband level to determine the number of antennas L out of K antennas connected to each one of the beamformers, to be combined at each one of the N beamformers; assigning the antennas to the subset L according to some criteria such as best quality indicator; repeatedly applying a tuning process to L antennas in each one of the N beamformers.
Description
FIELD OF THE INVENTION

The present invention relates generally to the field of radio frequency (RF) multiple-input-multiple-output (MIMO) systems and in particular to systems and methods for improving performance of MIMO systems by RF beamforming.


BACKGROUND OF THE INVENTION

Prior to setting forth a short discussion of the related art, it may be helpful to set forth definitions of certain terms that will be used hereinafter.


The term “MIMO” as used herein, is defined as the use of multiple antennas at both the transmitter and receiver to improve communication performance. MIMO offers significant increases in data throughput and link range without additional bandwidth or increased transmit power. It achieves this goal by spreading the transmit power over the antennas to achieve spatial multiplexing that improves the spectral efficiency (more bits per second per Hz of bandwidth) or to achieve a diversity gain that improves the link reliability (reduced fading), or increased antenna directivity.


The term “beamforming” sometimes referred to as “spatial filtering” as used herein, is a signal processing technique used in antenna arrays for directional signal transmission or reception. This is achieved by combining elements in the array in such a way that signals at particular angles experience constructive interference while others experience destructive interference. Beamforming can be used at both the transmitting and receiving ends in order to achieve spatial selectivity.


The term “beamformer” as used herein refers to RF circuitry that implements beamforming and usually includes a combiner and may further include switches, controllable phase shifters, and in some cases amplifiers and/or attenuators.


The term “Receiving Radio Distribution Network” or “Rx RDN” or simply “RDN” as used herein is defined as a group of beamformers as set forth above.


The term “hybrid MIMO RDN” as used herein is defined as a MIMO system that employs two or more antennas per channel (N is the number of channels and M is the total number of antennas and M>N). This architecture employs a beamformer for each channel so that two or more antennas are combined for each radio circuit that is connected to each one of the channels.


In hybrid MIMO RDN receiving systems, when the phases of the received signals from each antenna are properly adjusted or tuned with respect to one another, the individual signals may be combined and may result in an improved SNR or data throughput for the receiving system.


One tuning phase method is based on channel estimation of each antenna which contributes to the beamforming; the invention here is using a different method for identifying best-phase alignments for beamforming purposes; it is based on modifying phases iteratively while monitoring their combined signal quality.


When more than two antennas are involved, the number of iteration increases, thus longer periods of quasi-static fading are needed for stable process, as well as mechanism to address cases where quasi-static fading ceases to exist.


For example, in Cellular protocols, quality indicators are typically repeated ˜1000-2000 times per second. In WiFi protocols, they may have lower repetition rates, depending on traffic and number of users. In Mobile environment, fading change rate may vary between ˜10 times a second (static environment) and 100-200 times a second (vehicular), although it can be as fast as 1000-2000 times per second.


Consequently, when multiple antennas beamforming is based on an iterative process, it has to strike a balance between using the maximum number of available antennas, and the need to update each one of them fast enough to trace the fading variations.


As discussed above, various methods are known in the art for tuning of multiple-antenna beamformers. Each method has its advantages and disadvantages. One method is based on making a direct measurement of the antennas' signals phases & amplitudes and calculates corresponding corrections (can be carried out via channel estimation). Another method includes trying out various possible solutions and grading them per their impact on various quality indicators. This can be carried out via blind search of the best set of phases where there is a systematic gradient seeking method, or via blind scan where there is preference to try each and every possible phase value, or some other method where trial and error are the driver of the tuning process. All of these trial and error methods, including blind scan and blind search, are referred herein as “blind beamforming tuning algorithms” or simply: “blind algorithms”.


It is generally agreed that while channel estimation based method is the faster tuning method, it is not always the preferred one. For instance, in some cases, channel estimation requires digging info that may not be provided over standard signals coming out of baseband processors, while quality indicators needed for blind search may be readily available. Another consideration relates to dealing with interference—where co-channel undesired signals dominate, and when the receiver does not allocate resources for interference cancellation, then blind scan may yield better results (e.g., maximize the overall data rates).


SUMMARY

The present invention, in embodiments thereof, addresses the challenge deriving from the fact that blind algorithms with multiple antennas require relatively long convergence time. Embodiments of the present invention continuously update the beamforming process based on the fading environment. More specifically, by applying trade-offs among the participating antennas, algorithm resolution, and algorithm stability, embodiments of the present invention provide means for exploiting the available tools that can still be used without causing the algorithm to lose track. Therefore, a robust convergence metric is employed.


According to some embodiments of the present invention, a system for selecting a subset of L antennas from K antennas in each beamformer out of N beamformers is provided herein. The system includes a multiple-input-multiple-output (MIMO) receiving system comprising a MIMO baseband module having N branches; a radio distribution network (RDN) connected to the MIMO receiving system, the RDN comprising at least one beamformer, wherein each one of the beamformers is fed by two or more antennas, so that a total number of antennas in the system is M, wherein M is greater than N, wherein each one of the beamformers includes at least one combiner configured to combine signals coming from the antennas coupled to a respective beamformer into a combined signal, wherein the baseband module comprises an antenna subset selection module configured to: derive Mobility Monitoring Indicators (MMI) associated with the MIMO receiving system, and use a look up table to map MMI for each of the L antennas in each beamformer. Then the L antennas are each tuned over time using blind search/scan.


These additional, and/or other aspects and/or advantages of the present invention are set forth in the detailed description which follows.





BRIEF DESCRIPTION OF THE DRAWINGS

For a better understanding of the invention and in order to show how it may be implemented, references are made, purely by way of example, to the accompanying drawings in which like numerals designate corresponding elements or sections. In the accompanying drawings:



FIG. 1 is a high level block diagram illustrating a system according to some embodiments of the present invention;



FIG. 2 is a block diagram illustrating a an aspect according to embodiments of the present invention;



FIG. 3 is a flowchart diagram illustrating the blind search process with antenna subset selection according to embodiments of the present invention;



FIG. 4 is a flowchart diagram illustrating a subroutine to calculate Total Data Throughput Indicator (TDTI) according to some embodiments of the present invention;



FIG. 5 is a flowchart diagram illustrating a subroutine for antennas grading according to embodiments of the present invention;



FIG. 6 is a flowchart diagram illustrating a subroutine for coarse blind tuning according to embodiments of the present invention;



FIG. 7 is a flowchart diagram illustrating a subroutine for fine blind tuning according to embodiments of the present invention;



FIGS. 8 and 9 are circuit diagrams illustrating exemplary implementations of the system according to embodiments of the present invention; and



FIG. 10 is a high level flowchart illustrating a method according to some embodiment of the present invention.





The drawings together with the following detailed description make the embodiments of the invention apparent to those skilled in the art.


DETAILED DESCRIPTION

With specific reference now to the drawings in detail, it is stressed that the particulars shown are for the purpose of example and solely for discussing the preferred embodiments of the present invention, and are presented in the cause of providing what is believed to be the most useful and readily understood description of the principles and conceptual aspects of the invention. In this regard, no attempt is made to show structural details of the invention in more detail than is necessary for a fundamental understanding of the invention. The description taken with the drawings makes apparent to those skilled in the art how the several forms of the invention may be embodied in practice.


Before explaining the embodiments of the invention in detail, it is to be understood that the invention is not limited in its application to the details of construction and the arrangement of the components set forth in the following descriptions or illustrated in the drawings. The invention is applicable to other embodiments and may be practiced or carried out in various ways. Also, it is to be understood that the phraseology and terminology employed herein is for the purpose of description and should not be regarded as limiting.



FIG. 1 is a high level block diagram illustrating a system according to embodiments of the present invention. System 100 is a MIMO receiving system in a hybrid MIMO RDN configuration. In the hybrid MIMO RDN configuration, baseband module 120 receives N branches and is configured to operate, on the baseband level, in accordance with any known or legacy MIMO receiving scheme. System 100 further includes a radio distribution network 110 (RDN) connected to baseband module 120 via radio circuits 12-1 to 12-N. RDN 110 includes at least one beamformer with antenna amplification or attenuation functionality such as 140-1 and 140-N, being fed by two or more antennas such as 10-1-1 to 10-1-K1 through 10-N-1 to 10-N-KN, so that a total number of antennas in system 100 is M=K1+K2+ . . . +KN, wherein M is greater than N. Additionally, each one of the beamformers includes a combiner (not shown here) configured to combine signals coming from the antennas into a single combined signal converted to baseband by radio module 12-1 to 12-N. Baseband module 120 is configured, among other things, to tune RDN 110, for example by adjusting phase shifters located within beamformers 140-1 to 140-N. System 100 further includes antenna subset selection and tuning module 130.


In operation, antenna subset selection and tuning module 130 iteratively selects specific subset L of the K antennas on each one of the N beamformers, based on quality indicators being a subset of the best performing antennas from each group of antennas such as 10-1-1 to 10-1-K1 through 10-N-1 to 10-N-KN. The quality indicator may be, for example, a respective contribution to the total data rate of the antennas. It then applies a blind algorithm while constantly monitoring the fading rate change and adjusting the number of antennas participating in the blind algorithm accordingly.



FIG. 2 is a block diagram illustrating an aspect according to some embodiments of the present invention. The diagram provides a partial view of a hybrid MIMO RDN receiving system 200 that includes N beamformers 240-1 to 240-N. As can be seen, each beamformer is fed by K antennas. During the aforementioned selection process, a subset of L antennas is selected for participating in the blind algorithm process which involves iterative tuning of the antennas as will be explained below.



FIG. 3 is a flowchart diagram illustrating the blind search process with antenna subset selection according to embodiments of the present invention. Process 300 begins with step 310 where it measures Mobility Monitoring Indicators (MMI). Step 320 sets a revisit time T, being the time after which the channel may no longer be regarded as having the same characteristics so that the blind tuning process needs to be restarted from step 310. Then, process 300 goes to step 330 of grading each antenna by their Total Data Throughput Indicator (TDTI) using subroutine 300 so that grading each one of the K antennas, is based on their total data throughput coming from various data streams and wherein the selecting of said specific subset L is based on the total data throughput grades of the K antennas. The method then goes to step 340 for selecting the number of L antennas to participate in the beamforming that is predicted to require tuning process period short enough to fit into a quasi-static assumption associated with a given MMI value. L is a subset of antennas from K which is the number of the antennas on each beamformer. The TDTI is measured for each one of the K antennas and the L antennas with the highest TDTI are selected for the beamformer. After L antennas are selected, a beamforming coarse tuning algorithm is carried out in step 350. Next, step 360 executes fine tuning of the beamformer by subroutine 600 of FIG. 6 and goes to step 370. Step 370 goes to step 360 for continuing fine tuning if Timer T is not expired. Otherwise, step 370 will go to step 310 for measuring MMI again.


In some embodiments, the sub process in step 310 may start off with a continuous monitoring of MMI which may be performed by the receiver, e.g. by measuring Doppler, or measuring Pilot strength change rate, or other receiver quality indicators, providing a lookup table that is used to map estimated fading rate change or MMI into preferred number L out of K antennas used for beamforming.


Thus, the quality indicators are derivable from the lookup table. The lookup table will use a Mobility Monitor Indicator MMI, which will have several ranges as follows:
















For
0 > MMI > THRSH 1
boundaries of Static


For
THRESH 1 > MMI > THRSH 2
boundaries of Pedestrian


For
THRESH k > MMI > THRSH k + 1
boundaries vehicular k









The criterion for selecting a given antenna out of the K possible into the subset L for a given beamformer is TDTI for each antenna. Therefore, from time to time all antennas, the ones currently used in the subset, as well as the ones that are not, will be graded. Consequently, antennas selected for the subset will be the best L antennas, in terms of TDTI, out of K in each one of the N beamformers.



FIG. 4 is a flowchart diagram illustrating a subroutine 400 to calculate TDTI according to some embodiments of the present invention. Process 410 retrieves SINR for each layer from the baseband processor. Then, process 420 converts SINR to throughput indicator using CQI_TBS lookup table. One example of an embodiment for estimating total data throughput by SINRs and a CQI_TBS lookup table is described next. For the downlink data transmissions, the NodeB typically selects the modulation scheme and code rate depending on the Channel Quality Indicator (CQI) feedback transmitted by the User Equipment (UE) in the uplink. The reported CQI is not a direct indication of SINR. Instead, the UE reports the highest MCS (Modulation and Coding Scheme) that it can decode with a transport block error rate probability not exceeding 10% taking into account both the characteristics of the UE's receiver and radio channel quality. In LTE SU-MIMO spatial multiplexing scheme, at most two codewords are used, even if four layers are transmitted. Only one CQI and HARQ ACK/NACK feedback reporting is needed for all layers in one codeword, since all RBs belonging to the same codeword use the same MCS, even if a codeword is mapped to multiple layers. Process 430 calculates the TDTI based on SINRs and the CQI_TBS table by the following formula.







TDTI
=




i
=
1


N
d




TBS


(

SINR
i

)




,





for Nd data streams, where TBS(SINRi) can be calculated by the floor function or by interpolation between two SINR entries in the table. Then, process 440 updates SINRs entries corresponding CQI in the lookup table when UE reports CQI feedback to NodeB. According to some embodiments, the SINR conversion in the lookup table is updated in a case a new CQI report arrives.









TABLE 1







CQI_TBS Lookup Table












CQI



1st Codeword
2nd Codeword


Index
Modulation
MCS
TBS
SINR (dB)
SINR (dB)















0







1
QPSK
0
536
2.0
1.5


2
QPSK
0
536
3.9
3.4


3
QPSK
2
872
5.9
5.4


4
QPSK
5
1736
7.8
7.3


5
QPSK
7
2417
9.7
9.2


6
QPSK
9
3112
11.6
11.1


7
16QAM
12
4008
13.6
13.1


8
16QAM
14
5160
15.5
15.0


9
16QAM
16
6200
17.4
16.9


10
64QAM
20
7992
19.4
18.9


11
64QAM
23
9912
21.3
20.8


12
64QAM
25
11448
23.2
22.7


13
64QAM
27
12576
25.1
24.6


14
64QAM
28
14688
27.1
26.6


15
64QAM
28
14688
29.0
28.5










FIG. 5 is a flowchart diagram illustrating a subroutine for antenna grading according to embodiments of the present invention. Subroutine 500 starts with selecting a specific beamformer for antenna grading at step 510. Then, step 520 keeps the other beamformers connected with the same settings using K or less antennas throughout the antenna grading subroutine for the selected beamformer. Intuitively, the other beamformers can provide beamforming gain, reduce overall noise of received signals and improve grading accuracy of the selected beamformer. Step 530 isolates the next antenna in the selected beamformer for grading. Next, step 540 measures SINR per layer with the selected beamformer using the isolated antenna and the other beamformers using K or less antennas as configured by step 520. All beamformers are connected to their respective radios. Step 550 calculates TDTI from the measured SINRs using CQI_TBL lookup table, and the TDTI is then assigned as the grade of the isolated antenna. Finally, step 560 exits if all antennas of the selected beamformer have been graded. Otherwise, it goes back to step 530 for grading the next antenna.


The effect of beamforming on reducing noise of received signals can be illustrated by the following example. Let X be a matrix denoting signals being transmitted and H denote the channel matrix modeling the propagation. Then the signals received by the receiver can be written as

Y=HWX+N,

where N is the additive noise matrix and W is the weights matrix.


For 2×2 channels, the matrices can be noted as







Y
=

[




y
1






y
2




]


,

H


[




h
11




h
12






h
21




h
22




]


,

W
=

[




k
1



0




0



k
2




]


,

X
=

[




x
1






x
2




]


,

N
=

[




n
1






n
2




]


,





then Y=HWX+N can be written as







[




y
1






y
2




]

=




[




h
11




h
12






h
21




h
22




]



[




k
1



0




0



k
2




]




[




x
1






x
2




]


+

[




n
1






n
2




]







Assuming that the receiver has the knowledge of H and W, the transmitted signals can be recovered as:













X
^

=




(

H





W

)


-
1



Y

=




(

H





W

)


-
1




(


H





WX

+
N

)


=

X
+



(
WH
)


-
1



N





,
where









H

-
1


=



1



h
11



h
22


-


h
12



h
21






[




h
22




-

h
12







-

h
21





h
11




]


=

[



a


b




c


d



]



,


W

-
1




[




1

k
1




0




0



1

k
2





]







The error of recovered signals can be derived as






E
=


[




e
1






e
2




]

=



X
^

-
X

=



W

-
1




H

-
1



N

=

[






an
1

+

bn
2



k
1









cn
1

+

dn
2



k
2





]









If channels from transmitter 1 and transmitter 2 are improved by a factor of k1 and k2 respectively (i.e., k1>1 and k2>1), then the error for x1 and x2 are reduced by a factor of 1/k1 and 1/k2.



FIG. 6 is a flowchart diagram illustrating a subroutine for a round of coarse blind tuning for a beamformer according to an exemplary embodiment of the present invention. Subroutine 600 begins with step 610 where it picks the best antenna among L selected antennas to participate in the beamformer according to its grade determined by the antenna grading subroutine 500. Step 620 adds the next best antenna into beamformer and measures TDTI using TDTI calculation routine as described in FIG. 4. Then, step 630 changes (or ‘flips’) the added antenna's phase by 180° and measures TDTI again. Next, step 640 chooses the better phase for the added antenna. Finally, step 650 goes to step 620 for adding next antenna until all L selected antennas have been included for the beamformer. During coarse blind tuning of the beamformer, more phases may be tested instead of just two phases, 0° and 180° as depicted in steps 630 and 640. For example, 0°, 120° and 240° may be used.



FIG. 7 is a flowchart diagram illustrating a subroutine for fine blind tuning according to an exemplary embodiment of the present invention. All selected antennas stay connected to the beamformer during the fine tuning process. Subroutine 700 begins with step 710 where it picks the best antenna among L selected antennas in the beamformer according to its grade determined by the antenna grading subroutine 500. Step 720 modifies the next best antenna's initial phase by about 90° on one direction (e.g., clockwise) and compares TDTI of modified to initial phase. Then, step 730 keeps the new phase and goes to step 770 if TDTI improves. Otherwise, it goes to next step 740. Step 740 modifies the next best antenna's phase by 180° to the other direction (e.g. counter clockwise) and compares TDTI of modified to initial phase. Then, step 750 keeps the new phase and goes to step 770 if TDTI improves. Otherwise, it goes to next step 760 to keep the original phase. Finally, step 770 goes to step 720 for fine tuning the next antenna until all L selected antennas have been fine tuned. During fine blind tuning of a selected antenna, other finer than 90° phase resolution may be tested. For example, 45° or 60° may be used.



FIG. 8 and FIG. 9 are circuit diagrams illustrating exemplary implementations of the system according to embodiments of the present invention. Specifically, exemplary implementations of the beamformers operate in cooperation with antenna subset selection module 130. As opposed to the preferred implementation for RDN that use Channel Estimation for tuning, the Blind algorithm RDN implementation will have phase tuning for all antennas, including the MAIN. As opposed to the implementation for RDN that use Channel Estimation for tuning, the Blind RDN tuning implementation will have a set of N-1 combiners, allowing for combining only 2 antennas or only 3 antennas etc., to be selected per the measured fading rate change or MMI. As opposed to the preferred implementation for RDN that use Channel Estimation for tuning, the Blind Tuning RDN implementation will have pooling scheme allowing selecting a number of antennas for combining



FIG. 8 depicts an example of five antennas 801 to 805, each connected to a diversity module 810A to 810E where the diversity module controls phase and amplitude. The diversity modules are feeding 1:8 selectors 830A to 830E that are feeding a 1:5 RF combiner 840. The 1:8 selectors are also feeding three-way combiners 820A to 820J so that various triplets of antennas can be combined. A sixteen-way selector 850 selects alternative combiners including the single 1:5 combiner and the ten 1:3 combiners. Consequently, any three antennas out of five can be combined and selected as the input of a radio, as well as all five antennas combined. As shown in FIG. 8, the circuit is capable of isolating each antenna by routing the “bypass” signals from the antennas. In general and in this example, the grading of each one of the K antennas may be carried out by a process that includes isolating a given antenna and registering the reported signal to noise plus interference ratio (SINR) of each layer; converting each SINR to CQI and then to Data Rate via said lookup table; and summing them up to provide TDTI grading, while said process is carried out with K or less antennas at the other beamformers.



FIG. 9 depicts an example of four antennas 901 to 904, each connected to a diversity module 910A to 910D. The diversity modules are feeding 1:5 selectors 920A to 920D that are feeding a 1:4 RF combiner 940. The 1:5 selectors are also feeding three-way combiners 930A to 930D so that various triplets of antennas can be combined. A nine-way selector 950 selects alternative combiners including the single 1:4 combiner and the four 1:3 combiners. Consequently, any three antennas out of four can be selected as inputs of a radio, as well as all four antennas combined.



FIG. 10 is a high level flowchart illustrating a method 1000 according to some embodiment of the present invention. It should be understood that method 1000 is not limited to an implementation using the aforementioned exemplary architecture discussed above. Method 1000 may include the following stages: receiving multiple input multiple output (MIMO) radio frequency (RF) signals through M antennas coupled via N beamformers to a MIMO receiving system having N channels, wherein M>N 1010; measuring channel fading rate at a baseband level 1020; determining a number of antennas L to be combined out of K antennas of each one of the N beamformers, based on the measured fading rate 1030; and repeatedly or iteratively applying a tuning process to L antennas at each of the N beamformers 1040, wherein the repeated tuning ends when all L antennas are tuned but preferably before the channel fading rate has been changed.


As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or an apparatus. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.”


The aforementioned flowchart and block diagrams illustrate the architecture, functionality, and operation of possible implementations of systems and methods according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.


In the above description, an embodiment is an example or implementation of the inventions. The various appearances of “one embodiment,” “an embodiment” or “some embodiments” do not necessarily all refer to the same embodiments.


Although various features of the invention may be described in the context of a single embodiment, the features may also be provided separately or in any suitable combination. Conversely, although the invention may be described herein in the context of separate embodiments for clarity, the invention may also be implemented in a single embodiment.


Reference in the specification to “some embodiments”, “an embodiment”, “one embodiment” or “other embodiments” means that a particular feature, structure, or characteristic described in connection with the embodiments is included in at least some embodiments, but not necessarily all embodiments, of the inventions.


It is to be understood that the phraseology and terminology employed herein is not to be construed as limiting and are for descriptive purpose only.


The principles and uses of the teachings of the present invention may be better understood with reference to the accompanying description, figures and examples.


It is to be understood that the details set forth herein do not construe a limitation to an application of the invention.


Furthermore, it is to be understood that the invention can be carried out or practiced in various ways and that the invention can be implemented in embodiments other than the ones outlined in the description above.


It is to be understood that the terms “including”, “comprising”, “consisting” and grammatical variants thereof do not preclude the addition of one or more components, features, steps, or integers or groups thereof and that the terms are to be construed as specifying components, features, steps or integers.


If the specification or claims refer to “an additional” element, that does not preclude there being more than one of the additional element.


It is to be understood that where the claims or specification refer to “a” or “an” element, such reference is not be construed that there is only one of that element.


It is to be understood that where the specification states that a component, feature, structure, or characteristic “may”, “might”, “can” or “could” be included, that particular component, feature, structure, or characteristic is not required to be included.


Where applicable, although state diagrams, flow diagrams or both may be used to describe embodiments, the invention is not limited to those diagrams or to the corresponding descriptions. For example, flow need not move through each illustrated box or state, or in exactly the same order as illustrated and described.


Methods of the present invention may be implemented by performing or completing manually, automatically, or a combination thereof, selected steps or tasks.


The term “method” may refer to manners, means, techniques and procedures for accomplishing a given task including, but not limited to, those manners, means, techniques and procedures either known to, or readily developed from known manners, means, techniques and procedures by practitioners of the art to which the invention belongs.


The descriptions, examples, methods and materials presented in the claims and the specification are not to be construed as limiting but rather as illustrative only.


Meanings of technical and scientific terms used herein are to be commonly understood as by one of ordinary skill in the art to which the invention belongs, unless otherwise defined.


The present invention may be implemented in the testing or practice with methods and materials equivalent or similar to those described herein.


While the invention has been described with respect to a limited number of embodiments, these should not be construed as limitations on the scope of the invention, but rather as exemplifications of some of the preferred embodiments. Other possible variations, modifications, and applications are also within the scope of the invention. Accordingly, the scope of the invention should not be limited by what has thus far been described, but by the appended claims and their legal equivalents.

Claims
  • 1. A method comprising: receiving multiple input multiple output (MIMO) radio frequency (RF) signals through M antennas coupled via N beamformers to a MIMO receiving system having N channels, wherein M>N;measuring channel fading rate at a baseband level;grading each one of K antennas, based on their total data throughput coming from various data streams, wherein the total data throughput is represented by a total data throughput indicator (TDTI);determining a number of antennas L to be combined out of the K antennas of each one of the N beamformers, based on the measured fading rate, wherein the selecting of said specific subset L is based on the total data throughput grades of the K antennas; andrepeatedly applying a tuning process to L antennas at each of the N beamformers, wherein the tuning process comprises adjusting a phase of each of said L antennas to maximize a TDTI.
  • 2. The method according to claim 1, further comprising selecting a specific subset L of the K antennas on each one of the N beamformers, based on quality indicators.
  • 3. The method according to claim 2, wherein the quality indicator is respective contribution to total data rate.
  • 4. The method according to claim 1, wherein the channel fading rate is represented by measuring a mobility monitoring indicator (MMI).
  • 5. The method according to claim 1, wherein the TDTI is derivable via a lookup table based on a channel quality indicator (CQI) criterion and measured signal to noise plus interference ratio (SINR).
  • 6. The method according to claim 1, wherein the grading of each one of the K antennas is carried out by a process comprising: isolating a given antenna and registering the reported signal to noise plus interference ratio (SINR) of each layer;converting each SINR to channel quality indicator (CQI) and then to Data Rate via said lookup table; andsumming the Data Rates to provide total data throughput indicator (TDTI) grading, while said process is carried out with K or less antennas at the other beamformers.
  • 7. The method according to claim 6, further comprising a step of updating the SINR conversion in the lookup table in a case a new CQI report arrives.
  • 8. The method according to claim 1, wherein said tuning process includes at least one round of coarse tuning process.
  • 9. The method according to claim 1, wherein said tuning process includes a fine tuning process.
  • 10. A method comprising: receiving multiple input multiple output (MIMO) radio frequency (RF) signals through M antennas coupled via N beamformers to a MIMO receiving system having N channels, wherein M>N;measuring channel fading rate at a baseband level;determining a number of antennas L to be combined out of K antennas of each one of the N beamformers, based on the measured fading rate; andrepeatedly applying a tuning process to L antennas at each of the N beamformers, wherein said tuning process includes at least one round of coarse tuning process, said coarse tuning process comprising: selecting best graded antenna as an anchor;combining the anchor with the second best graded antenna and measure Total Data Throughput Indicator (TDTI);flipping the phase of the second best antenna by approximately 180°, and measuring the TDTI;choosing the better TDTI as preferred coarse phase;combining the next best graded antenna with the previously combined antennas and measure the TDTI;flipping the phase of the next best graded antenna and measure TDTI, and selecting the better TDTI as preferred coarse phase for the next best graded antenna;repeating the adding of antennas to the combiner per their grading until all L antennas are added.
  • 11. A system comprising M antennas;N beamformers connected to the M antennas;a multiple input multiple output (MIMO) receiving system having N channels, connected to the N beamformers, wherein M>N; andan antenna subset selection and tuning module configured to: measure channel fading rate at a baseband level;grade each one of the K antennas, based on their total data throughput coming from various data streams, wherein the total data throughput is represented by a total data throughput indicator (TDTI);determine a number of antennas L≦K to be combined at each one of the N beamformers, wherein K is a number of antennas connected to each one of the beamformers, based on the measured fading rate, wherein the selecting of said specific subset L is based on the total data throughput grades of the K antennas; andrepeatedly apply a tuning process to L antennas at each of the N beamformers, wherein the tuning process comprises adjusting a phase of each of said L antennas to maximize a TDTI.
  • 12. The system according to claim 11, wherein the antenna subset selection and tuning module is further configured to select a specific subset L of the K antennas on each one of the N beamformers, based on quality indicators.
  • 13. The system according to claim 12, wherein the quality indicator is respective contribution to total data rate.
  • 14. The system according to claim 11, wherein the channel fading rate is represented by measuring a mobility monitoring indicator (MMI).
  • 15. The system according to claim 11, wherein the TDTI is derivable via a lookup table based on a channel quality indicator (CQI) criterion and measured signal to noise plus interference ratio (SINR).
  • 16. The system according to claim 11, wherein the grading of each one of the K antennas is carried out by a process comprising: isolating a given antenna and registering the reported signal to noise plus interference ratio (SINR) of each layer;converting each SINR to CQI and then to Data Rate via said lookup table; andsumming the Data Rates to provide total data throughput indicator (TDTI) grading, while said process is carried out with K or less antennas at the other beamformers.
  • 17. The system according to claim 16, wherein the antennas subset selection and tuning module is further configured to update the SINR conversion in the lookup table in a case a new CQI report arrives.
  • 18. The system according to claim 11, wherein said tuning process includes at least one round of coarse tuning process.
  • 19. The system according to claim 11, wherein said coarse tuning process comprises: selecting best graded antenna as an anchor;combining the anchor with the second best graded antenna and measure Total Data Throughput Indicator (TDTI);flipping the phase of the second best antenna by approximately 180°, and measuring the TDTI;choosing the better TDTI as preferred coarse phase;combining the next best graded antenna with the previously combined antennas and measure the TDTI;flipping the phase of the next best graded antenna and measure TDTI, and selecting the better TDTI as preferred coarse phase for the next best graded antenna;repeating the adding of antennas to the combiner per their grading until all L antennas are added.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation application of U.S. non-provisional patent application Ser. No. 13/770,255 filed on Feb. 19, 2013, which is a continuation-in-part application of U.S. non-provisional patent application Ser. No. 13/630,146 filed on Sep. 28, 2012, which in turn claims benefit from U.S. provisional patent applications 61/652,743 filed on May 29, 2012; 61/657,999 filed on Jun. 11, 2012; and 61/665,592 filed on Jun. 28, 2012; U.S. non-provisional patent application Ser. No. 13/770,255 further claims benefit from U.S. provisional patent applications: 61/658,015 filed on Jun. 11, 2012; and 61/671,408 filed on Jul. 13, 2012, all of which are incorporated herein in their entirety.

US Referenced Citations (292)
Number Name Date Kind
4044359 Applebaum et al. Aug 1977 A
4079318 Kinoshita Mar 1978 A
4359738 Lewis Nov 1982 A
4540985 Clancy et al. Sep 1985 A
4628320 Downie Dec 1986 A
5162805 Cantrell Nov 1992 A
5363104 Richmond Nov 1994 A
5444762 Frey et al. Aug 1995 A
5732075 Tangemann et al. Mar 1998 A
5915215 Williams et al. Jun 1999 A
5936577 Shoki et al. Aug 1999 A
5940033 Locher et al. Aug 1999 A
6018317 Dogan et al. Jan 2000 A
6046655 Cipolla Apr 2000 A
6101399 Raleigh et al. Aug 2000 A
6163695 Takemura Dec 2000 A
6167286 Ward et al. Dec 2000 A
6215812 Young et al. Apr 2001 B1
6226507 Ramesh et al. May 2001 B1
6230123 Mekuria et al. May 2001 B1
6259683 Sekine et al. Jul 2001 B1
6297772 Lewis Oct 2001 B1
6321077 Saitoh et al. Nov 2001 B1
6335953 Sanderford, Jr. et al. Jan 2002 B1
6370378 Yahagi Apr 2002 B1
6377783 Lo et al. Apr 2002 B1
6393282 Iimori May 2002 B1
6584115 Suzuki Jun 2003 B1
6697622 Ishikawa et al. Feb 2004 B1
6697633 Dogan et al. Feb 2004 B1
6834073 Miller et al. Dec 2004 B1
6842460 Olkkonen et al. Jan 2005 B1
6927646 Niemi Aug 2005 B2
6975582 Karabinis et al. Dec 2005 B1
6987958 Lo et al. Jan 2006 B1
7068628 Li et al. Jun 2006 B2
7177663 Axness et al. Feb 2007 B2
7190964 Damnjanovic et al. Mar 2007 B2
7257425 Wang et al. Aug 2007 B2
7299072 Ninomiya Nov 2007 B2
7391757 Haddad et al. Jun 2008 B2
7392015 Farlow et al. Jun 2008 B1
7474676 Tao et al. Jan 2009 B2
7499109 Kim et al. Mar 2009 B2
7512083 Li Mar 2009 B2
7606528 Mesecher Oct 2009 B2
7634015 Waxman Dec 2009 B2
7646744 Li Jan 2010 B2
7719993 Li et al. May 2010 B2
7742000 Mohamadi Jun 2010 B2
7769107 Sandhu et al. Aug 2010 B2
7898478 Niu et al. Mar 2011 B2
7933255 Li Apr 2011 B2
7970366 Arita et al. Jun 2011 B2
8078109 Mulcay Dec 2011 B1
8115679 Falk Feb 2012 B2
8155613 Kent et al. Apr 2012 B2
8194602 van Rensburg et al. Jun 2012 B2
8280443 Tao et al. Oct 2012 B2
8294625 Kittinger et al. Oct 2012 B2
8306012 Lindoff et al. Nov 2012 B2
8315671 Kuwahara et al. Nov 2012 B2
8369436 Stirling-Gallacher Feb 2013 B2
8509190 Rofougaran Aug 2013 B2
8520657 Rofougaran Aug 2013 B2
8526886 Wu et al. Sep 2013 B2
8588844 Shpak Nov 2013 B2
8599955 Kludt et al. Dec 2013 B1
8599979 Farag et al. Dec 2013 B2
8644413 Harel et al. Feb 2014 B2
8649458 Kludt et al. Feb 2014 B2
8666319 Kloper et al. Mar 2014 B2
8744511 Jones, Iv et al. Jun 2014 B2
8767862 Abreu et al. Jul 2014 B2
8780743 Sombrutzki et al. Jul 2014 B2
8797969 Harel et al. Aug 2014 B1
8891598 Wang et al. Nov 2014 B1
8942134 Kludt et al. Jan 2015 B1
20010029326 Diab et al. Oct 2001 A1
20010038665 Baltersee et al. Nov 2001 A1
20020024975 Hendler Feb 2002 A1
20020051430 Kasami et al. May 2002 A1
20020065107 Harel et al. May 2002 A1
20020085643 Kitchener et al. Jul 2002 A1
20020107013 Fitzgerald Aug 2002 A1
20020115474 Yoshino et al. Aug 2002 A1
20020181426 Sherman Dec 2002 A1
20020181437 Ohkubo et al. Dec 2002 A1
20030087645 Kim et al. May 2003 A1
20030114162 Chheda et al. Jun 2003 A1
20030153322 Burke et al. Aug 2003 A1
20030153360 Burke et al. Aug 2003 A1
20030186653 Mohebbi et al. Oct 2003 A1
20030203717 Chuprun et al. Oct 2003 A1
20030203743 Sugar et al. Oct 2003 A1
20040023693 Okawa et al. Feb 2004 A1
20040056795 Ericson et al. Mar 2004 A1
20040063455 Eran et al. Apr 2004 A1
20040081144 Martin et al. Apr 2004 A1
20040121810 Goransson et al. Jun 2004 A1
20040125899 Li et al. Jul 2004 A1
20040125900 Liu et al. Jul 2004 A1
20040142696 Saunders et al. Jul 2004 A1
20040147266 Hwang et al. Jul 2004 A1
20040156399 Eran Aug 2004 A1
20040166902 Castellano et al. Aug 2004 A1
20040198292 Smith et al. Oct 2004 A1
20040228388 Salmenkaita Nov 2004 A1
20040235527 Reudink et al. Nov 2004 A1
20040264504 Jin Dec 2004 A1
20050068230 Munoz et al. Mar 2005 A1
20050068918 Mantravadi et al. Mar 2005 A1
20050075140 Famolari Apr 2005 A1
20050129155 Hoshino Jun 2005 A1
20050147023 Stephens et al. Jul 2005 A1
20050163097 Do et al. Jul 2005 A1
20050245224 Kurioka Nov 2005 A1
20050250544 Grant et al. Nov 2005 A1
20050254513 Cave et al. Nov 2005 A1
20050265436 Suh et al. Dec 2005 A1
20050287962 Mehta et al. Dec 2005 A1
20060041676 Sherman Feb 2006 A1
20060092889 Lyons et al. May 2006 A1
20060094372 Ahn et al. May 2006 A1
20060098605 Li May 2006 A1
20060111149 Chitrapu et al. May 2006 A1
20060135097 Wang et al. Jun 2006 A1
20060183503 Goldberg Aug 2006 A1
20060203850 Johnson et al. Sep 2006 A1
20060227854 McCloud et al. Oct 2006 A1
20060264184 Li et al. Nov 2006 A1
20060270343 Cha et al. Nov 2006 A1
20060271969 Takizawa et al. Nov 2006 A1
20060285507 Kinder et al. Dec 2006 A1
20070041398 Benveniste Feb 2007 A1
20070058581 Benveniste Mar 2007 A1
20070076675 Chen Apr 2007 A1
20070093261 Hou et al. Apr 2007 A1
20070097918 Cai et al. May 2007 A1
20070115914 Ohkubo et al. May 2007 A1
20070152903 Lin et al. Jul 2007 A1
20070217352 Kwon Sep 2007 A1
20070223380 Gilbert et al. Sep 2007 A1
20070249386 Bennett Oct 2007 A1
20080043867 Blanz et al. Feb 2008 A1
20080051037 Molnar et al. Feb 2008 A1
20080081671 Wang et al. Apr 2008 A1
20080125120 Gallagher et al. May 2008 A1
20080144737 Naguib Jun 2008 A1
20080165732 Kim et al. Jul 2008 A1
20080238808 Arita et al. Oct 2008 A1
20080240314 Gaal et al. Oct 2008 A1
20080247370 Gu et al. Oct 2008 A1
20080267142 Mushkin et al. Oct 2008 A1
20080280571 Rofougaran et al. Nov 2008 A1
20080285637 Liu et al. Nov 2008 A1
20090003299 Cave et al. Jan 2009 A1
20090028225 Runyon et al. Jan 2009 A1
20090046638 Rappaport et al. Feb 2009 A1
20090058724 Xia et al. Mar 2009 A1
20090121935 Xia et al. May 2009 A1
20090137206 Sherman et al. May 2009 A1
20090154419 Yoshida et al. Jun 2009 A1
20090187661 Sherman Jul 2009 A1
20090190541 Abedi Jul 2009 A1
20090227255 Thakare Sep 2009 A1
20090239486 Sugar et al. Sep 2009 A1
20090268616 Hosomi Oct 2009 A1
20090285331 Sugar et al. Nov 2009 A1
20090322610 Hants et al. Dec 2009 A1
20090322613 Bala et al. Dec 2009 A1
20100002656 Ji et al. Jan 2010 A1
20100037111 Ziaja et al. Feb 2010 A1
20100040369 Zhao et al. Feb 2010 A1
20100067473 Cave et al. Mar 2010 A1
20100111039 Kim et al. May 2010 A1
20100117890 Vook et al. May 2010 A1
20100135420 Xu et al. Jun 2010 A1
20100150013 Hara et al. Jun 2010 A1
20100172429 Nagahama et al. Jul 2010 A1
20100195560 Nozaki et al. Aug 2010 A1
20100195601 Zhang Aug 2010 A1
20100208712 Wax et al. Aug 2010 A1
20100222011 Behzad Sep 2010 A1
20100234071 Shabtay et al. Sep 2010 A1
20100278063 Kim et al. Nov 2010 A1
20100283692 Achour et al. Nov 2010 A1
20100285752 Lakshmanan et al. Nov 2010 A1
20100291931 Suemitsu et al. Nov 2010 A1
20100303170 Zhu et al. Dec 2010 A1
20100316043 Doi et al. Dec 2010 A1
20110019639 Karaoguz et al. Jan 2011 A1
20110032849 Yeung et al. Feb 2011 A1
20110032972 Wang et al. Feb 2011 A1
20110085532 Scherzer et al. Apr 2011 A1
20110105036 Rao et al. May 2011 A1
20110116489 Grandhi May 2011 A1
20110134816 Liu et al. Jun 2011 A1
20110150050 Trigui et al. Jun 2011 A1
20110150066 Fujimoto Jun 2011 A1
20110151826 Miller et al. Jun 2011 A1
20110163913 Cohen et al. Jul 2011 A1
20110205883 Mihota Aug 2011 A1
20110205998 Hart et al. Aug 2011 A1
20110228742 Honkasalo et al. Sep 2011 A1
20110249576 Chrisikos et al. Oct 2011 A1
20110273977 Shapira et al. Nov 2011 A1
20110281541 Borremans Nov 2011 A1
20110299437 Mikhemar et al. Dec 2011 A1
20110310827 Srinivasa et al. Dec 2011 A1
20110310853 Yin et al. Dec 2011 A1
20120014377 Joergensen et al. Jan 2012 A1
20120015603 Proctor et al. Jan 2012 A1
20120020396 Hohne et al. Jan 2012 A1
20120027000 Wentink Feb 2012 A1
20120028671 Niu et al. Feb 2012 A1
20120033761 Guo et al. Feb 2012 A1
20120034952 Lo et al. Feb 2012 A1
20120045003 Li et al. Feb 2012 A1
20120051287 Merlin et al. Mar 2012 A1
20120064838 Miao et al. Mar 2012 A1
20120069828 Taki et al. Mar 2012 A1
20120076028 Ko et al. Mar 2012 A1
20120076229 Brobston et al. Mar 2012 A1
20120088512 Yamada et al. Apr 2012 A1
20120092217 Hosoya et al. Apr 2012 A1
20120100802 Mohebbi Apr 2012 A1
20120115523 Shpak May 2012 A1
20120155349 Bajic et al. Jun 2012 A1
20120155397 Shaffer et al. Jun 2012 A1
20120163257 Kim et al. Jun 2012 A1
20120163302 Takano Jun 2012 A1
20120170453 Tiwari Jul 2012 A1
20120170672 Sondur Jul 2012 A1
20120201153 Bharadia et al. Aug 2012 A1
20120201173 Jain et al. Aug 2012 A1
20120207256 Farag et al. Aug 2012 A1
20120212372 Petersson et al. Aug 2012 A1
20120213065 Koo et al. Aug 2012 A1
20120218962 Kishiyama et al. Aug 2012 A1
20120220331 Luo et al. Aug 2012 A1
20120230380 Keusgen et al. Sep 2012 A1
20120251031 Suarez et al. Oct 2012 A1
20120270531 Wright et al. Oct 2012 A1
20120270544 Shah Oct 2012 A1
20120281598 Struhsaker et al. Nov 2012 A1
20120314570 Forenza et al. Dec 2012 A1
20120321015 Hansen et al. Dec 2012 A1
20120327870 Grandhi et al. Dec 2012 A1
20130010623 Golitschek Jan 2013 A1
20130017794 Kloper et al. Jan 2013 A1
20130023225 Weber Jan 2013 A1
20130044877 Liu et al. Feb 2013 A1
20130051283 Lee et al. Feb 2013 A1
20130058239 Wang et al. Mar 2013 A1
20130070741 Li et al. Mar 2013 A1
20130079048 Cai et al. Mar 2013 A1
20130094437 Bhattacharya Apr 2013 A1
20130094621 Luo et al. Apr 2013 A1
20130095780 Prazan et al. Apr 2013 A1
20130101073 Zai et al. Apr 2013 A1
20130156016 Debnath et al. Jun 2013 A1
20130156120 Josiam et al. Jun 2013 A1
20130170388 Ito et al. Jul 2013 A1
20130190006 Kazmi et al. Jul 2013 A1
20130208587 Bala et al. Aug 2013 A1
20130208619 Kudo et al. Aug 2013 A1
20130223400 Seo et al. Aug 2013 A1
20130229996 Wang et al. Sep 2013 A1
20130229999 Da Silva et al. Sep 2013 A1
20130235720 Wang et al. Sep 2013 A1
20130242853 Seo et al. Sep 2013 A1
20130242899 Lysejko et al. Sep 2013 A1
20130242965 Horn et al. Sep 2013 A1
20130242976 Katayama et al. Sep 2013 A1
20130272437 Eidson et al. Oct 2013 A1
20130301551 Ghosh et al. Nov 2013 A1
20130331136 Yang et al. Dec 2013 A1
20130343369 Yamaura Dec 2013 A1
20140010089 Cai et al. Jan 2014 A1
20140010211 Asterjadhi et al. Jan 2014 A1
20140029433 Wentink Jan 2014 A1
20140071873 Wang et al. Mar 2014 A1
20140086077 Safavi Mar 2014 A1
20140086081 Mack et al. Mar 2014 A1
20140098681 Stager et al. Apr 2014 A1
20140119288 Zhu et al. May 2014 A1
20140185501 Park et al. Jul 2014 A1
20140185535 Park et al. Jul 2014 A1
20140192820 Azizi et al. Jul 2014 A1
20140204821 Seok et al. Jul 2014 A1
20140307653 Liu et al. Oct 2014 A1
Foreign Referenced Citations (8)
Number Date Country
1 867 177 May 2010 EP
2 234 355 Sep 2010 EP
2009-278444 Nov 2009 JP
WO 03047033 Jun 2003 WO
WO 03073645 Sep 2003 WO
WO 2010085854 Aug 2010 WO
WO 2011060058 May 2011 WO
WO 2013192112 Dec 2013 WO
Non-Patent Literature Citations (97)
Entry
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/630,146 dated Jan. 22, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/630,146 dated Mar. 27, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/762,159 dated Apr. 16, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/762,191 dated May 2, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/762,188 dated May 15, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/776,204 dated May 21, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/770,255 dated Jun. 6, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/776,068 dated Jun. 11, 2013.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/762,159 dated Jun. 20, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/775,886 dated Jul. 17, 2013.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/762,191 dated Jul. 19, 2013.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/630,146 dated Jul. 31, 2013.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/762,188 dated Aug. 19, 2013.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/770,255 dated Sep. 17, 2013.
Ahmadi-Shokouh et al., “Pre-LNA Smart Soft Antenna Selection for MIMO Spatial Multiplexing/Diversity System when Amplifier/Sky Noise Dominates”, European Transactions on Telecommunications, Wiley & Sons, Chichester, GB, vol. 21, No. 7, Nov. 1, 2010, pp. 663-677.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/889,150 dated Sep. 25, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/955,320 dated Oct. 15, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/776,204 dated Oct. 23, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/925,454 dated Oct. 28, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/955,194 dated Oct. 30, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/013,190 dated Nov. 5, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/776,068 dated Nov. 5, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/010,771 dated Dec. 17, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/065,182 dated Dec. 17, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/068,863 dated Dec. 17, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/011,521 dated Dec. 23, 2013.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/775,886 dated Jan. 7, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/018,965 dated Jan. 13, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/858,302 dated Jan. 16, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/042,020 dated Jan. 16, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/102,539 dated Jan. 27, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/087,376 dated Jan. 29, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/776,204 dated Jan. 31, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/094,644 dated Feb. 6, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/955,320 dated Feb. 21, 2014.
Huang et al., “Antenna Mismatch and Calibration Problem in Coordinated Multi-point Transmission System,” IET Communications, 2012, vol. 6, Issue 3, pp. 289-299.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/109,904 dated Feb. 27, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/925,454 dated Mar. 7, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/172,500 dated Mar. 26, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/065,182 dated Mar. 25, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/068,863 dated Mar. 25, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/010,771 dated Apr. 4, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/085,352 dated Apr. 7, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/889,150 dated Apr. 9, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/955,194 dated Apr. 9, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/097,765 dated Apr. 22, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/087,376 dated May 9, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/143,580 dated May 9, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/776,068 dated May 13, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/013,190 dated May 20, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/085,252 dated Jun. 18, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/094,644 dated Jun. 24, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/102,539 dated Jun. 24, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/011,521 dated Jul. 1, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/109,904 dated Jul. 2, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/889,150 dated Jul. 8, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/250,767 dated Jul. 10, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/085,352 dated Jul. 23, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/013,190 dated Jul. 25, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/198,280 dated Jul. 29, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/042,020 dated Jul. 31, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/010,771 dated Aug. 6, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/306,458 dated Aug. 13, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/297,898 dated Aug. 15, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/085,252 dated Aug. 27, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/181,844 dated Aug. 29, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/296,209 dated Sep. 4, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/097,765 dated Sep. 8, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/143,580 dated Sep. 8, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/198,155 dated Sep. 12, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/173,640 dated Oct. 6, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/449,431 dated Oct. 10, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/011,521 dated Oct. 20, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/320,920 dated Oct. 23, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/889,150 dated Nov. 10, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/775,886 dated Nov. 17, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/198,280 dated Nov. 18, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/480,920 dated Nov. 18, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/481,319 dated Nov. 19, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/273,866 dated Nov. 28, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/042,020 dated Dec. 1, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/888,057 dated Dec. 3, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/297,898 dated Dec. 5, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/281,358 dated Dec. 16, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/250,767 dated Dec. 26, 2014.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/097,765 dated Dec. 31, 2014.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/181,844 dated Jan. 5, 2015.
International Search Report and Written Opinion for PCT International Application No. PCT/US2014/065635 dated Feb. 13, 2015.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/320,920 dated Feb. 23, 2015.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/775,886 dated Mar. 23, 2015.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/449,431 dated Mar. 23, 2015.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/273,866 dated Mar. 25, 2015.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/517,114 dated Apr. 6, 2015.
Notice of Allowance issued by the United States Patent and Trademark Office for U.S. Appl. No. 13/925,454 dated Apr. 14, 2015.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/543,357 dated Apr. 23, 2015.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/450,625 dated Apr. 28, 2015.
Office Action issued by the United States Patent and Trademark Office for U.S. Appl. No. 14/250,767 dated Apr. 29, 2015.
Related Publications (1)
Number Date Country
20140219404 A1 Aug 2014 US
Provisional Applications (5)
Number Date Country
61652743 May 2012 US
61657999 Jun 2012 US
61665592 Jun 2012 US
61658015 Jun 2012 US
61671408 Jul 2012 US
Continuations (1)
Number Date Country
Parent 13770255 Feb 2013 US
Child 14171736 US
Continuation in Parts (2)
Number Date Country
Parent 13630146 Sep 2012 US
Child 13770255 US
Parent 13770255 Feb 2013 US
Child 13770255 US