System and method for antenna diversity using equal power joint maximal ratio combining

Information

  • Patent Grant
  • 7881674
  • Patent Number
    7,881,674
  • Date Filed
    Monday, July 16, 2007
    17 years ago
  • Date Issued
    Tuesday, February 1, 2011
    13 years ago
Abstract
An equal gain composite beamforming technique which includes the constraint that the power of the signal output by each antenna is the same, and is equal to the total power of the transmit signal divided by the number N of transmit antennas from which the signal is to be transmitted. By reducing output power requirements for each power amplifier, the silicon area of the power amplifiers are reduced by as much as N times (where N is equal to the number of transmit antennas) relative to a non-equal gain composite beamforming technique.
Description
BACKGROUND OF THE INVENTION

The present invention is directed to an antenna (spatial) processing useful in wireless communication applications, such as short-range wireless applications.


Composite Beamforming (CBF) is an antenna processing technique in which a first communication device, having a plurality of antennas, weights a signal to be transmitted by its antennas to a second communication device also having a plurality of antennas. Similarly, the second communication device weights and combines the received signals received by its antennas. A multiple-input/multiple-output (MIMO) optimized communication system is defined by CBF. The transmit weights and receive weights are determined to optimize the link margin between the devices, thereby significantly extending the range of communication between the two communication devices. Techniques related to composite beamforming are the subject matter of above-identified commonly assigned co-pending application.


There is room for still further enhancing this CBF technique to optimize cost and implementation issues at the expense of only slight degradation in performance. Such a solution is extremely valuable in manufacturing a cost-effective integrated circuit solution.


SUMMARY OF THE INVENTION

An equal gain composite beamforming technique is provided that adds the constraint that the power of the signal output by each of the plurality of transmit antennas is the same, and is equal to the total power of the transmit signal divided by the number N of transmit antennas from which the signal is to be transmitted. This reduces output power requirements at each antenna. By reducing output power requirements for each power amplifier, the silicon area of the power amplifiers are reduced by as much as N times (where N is the number of transmit antennas) relative to non-equal gain CBF. Many implementation advantages are achieved by equal gain CBF, including savings in silicon, power requirements, etc.


The above and other objects and advantages will become more readily apparent when reference is made to the following description taken in conjunction with the accompanying drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of two communication devices performing equal gain composite beamforming.



FIG. 2 shows frequency dependent weights for two antennas that are frequency shaped, but not equal gain.



FIG. 3 shows equal gain frequency dependent weights for two antennas.



FIG. 4 is a block diagram of a communication device capable of performing equal gain composite beamforming.



FIG. 5 is a flow diagram showing an adaptive algorithm to obtain equal gain transmit antenna weights for first and second communication devices in communication with each other.



FIG.6 is a graphical diagram illustrating convergence of the adaptive algorithm shown in FIG. 5



FIG. 7 is a graphical diagram illustrating a performance comparison between equal gain composite beamforming and non-equal gain composite beamforming.



FIG. 8 is a block diagram of a composite beamforming transmission process for a multi-carrier baseband modulation scheme.



FIG. 9 is a block diagram of a composite beamforming reception process for a multi-carrier baseband modulation scheme.



FIG. 10 is a block diagram of a composite beamforming transmission process for a single carrier baseband modulation scheme.



FIG. 11 is a block diagram of a composite beamforming reception process for a single carrier baseband modulation scheme.



FIG. 12 is a flow diagram for a process that is useful when one device on the communication link is composite beamforming capable and the other device uses antenna selection diversity capable.





DETAILED DESCRIPTION OF THE DRAWINGS

Referring first to FIG. 1, a system 10 is shown in which a first communication device and a second communication device 200 communicate with each other using radio frequency (RF) communication techniques. The devices use composite beamforming techniques when communicating with each other. In particular, communication device 100 has N plurality of antennas 110 and communication device 200 has M plurality of antennas 210. According to the composite beamforming (CBF) technique also described in the aforementioned co-pending application filed on even date, when communication device 100 transmits a signal to communication device 200, it applies to (i.e., multiplies or scales) a baseband signal s to be transmitted a transmit weight vector associated with a particular destination device, e.g., communication device 200, denoted wtx,1. Similarly, when communication device 200 transmits a baseband signal s to communication device 100, it multiplies the baseband signal s by a transmit weight vector wtx,2, associated with destination communication device 100. The (M×N) frequency dependent channel matrix from the N plurality of antennas of the first communication device 100 to M plurality of antennas of the second communication device 200 is H(k), and the frequency dependent communication channel (N×M) matrix between the M plurality of antennas of the second communication device and the N plurality of antennas of the first communication device is HT(k).


The transmit weight vectors wtx,1 and wtx2 each comprises a plurality of transmit weights corresponding to each of the N and M antennas, respectively. Each transmit weight is a complex quantity. Moreover, each transmit weight vector is frequency dependent; it may vary across the bandwidth of the baseband signal s to be transmitted. For example, if the baseband signal s is a multi-carrier signal of K sub-carriers, each transmit weight for a corresponding antenna varies across the K sub-carriers. Similarly, if the baseband signal s is a single-carrier signal (that can be divided or synthesized into K frequency sub-bands), each transmit weight for a corresponding antenna varies across the bandwidth of the baseband signal. Therefore, the transmit weight vector is dependent on frequency, or varies with frequency sub-band/sub-carrier k, such that wtx becomes wtx(f), or more commonly referred to as wtx(k), where k is the frequency sub-band/sub-carrier index.


While the terms frequency sub-band/sub-carrier are used herein in connection with beamforming in a frequency dependent channel, it should be understood that the term “sub-band” is meant to include a narrow bandwidth of spectrum forming a part of a baseband signal. The sub-band may be a single discrete frequency (within a suitable frequency resolution that a device can process) or a narrow bandwidth of several frequencies.


The receiving communication device also weights the signals received at its antennas with a receive antenna weight vector wrx(k). Communication device 100 uses a receive antenna weight vector wrx,1(k) when receiving a transmission from communication device 200, and communication device 200 uses a receive antenna weight vector wrx,2(k) when receiving a transmission from communication device 100. The receive antenna weights of each vector are matched to the received signals by the receiving communication device. The receive weight vector may also be frequency dependent.


Generally, transmit weight vector wtx,1 comprises a plurality of transmit antenna weights wtx,1,i1,i(k)eiφ1,i,(k), where β1,i(k) is the magnitude of the antenna weight, φ1,i,(k) is the phase of the antenna weight, i is the antenna index, and k is the frequency sub-band or sub-carrier index (up to K frequency sub-bands/sub-carriers). The subscripts tx,1 denote that it is a vector that communication device 100 uses to transmit to communication device 2. Similarly, the subscripts tx,2 denote that it is a vector that communication device 200 uses to transmit to communication device 100.


Under the constraint of an equal gain composite beamforming (EGCBF) process, the power of the transmit signal output by each transmit antenna is the same, and is equal to the total power associated with the transmit signal (Ptx) divided by the number of transmit antennas. Thus, for communication device 100, that is Ptx/N. For communication device 200, that is Ptx/M. Consequently, each power amplifier associated with an antenna need only support 1/N of the total output power. Example: For N=4, Ptx=17 dBm, each power amplifier need only support a max linear output power of 17−10log(4)=11 dBm. Thus, whereas for non-equal gain composite beamforming each power amplifier must support to the total transmit power, such is not the case for equal gain beamforming. The equal-gain constraint makes the power amplifier design much simpler. Equal gain CBF performs very close to non-equal gain CBF (within 1-2 dB), but costs significantly less to implement in terms of power amplifier requirements and affords the opportunity to deploy the power amplifiers on the same silicon integrated circuit as the RF circuitry.


When considering a frequency dependent communication channel, the EGCBF constraint implies that for each and every antenna i, the sum of the power |wtx,i (k)|2 of the antenna signal across all of frequencies of the baseband signal (the frequency sub-bands or sub-carrier frequencies k=1 to K) is equal to Ptx/N. This is the equal gain constraint applied to a frequency dependent channel represented by K sub-carrier frequencies or frequency sub-bands.


An additional constraint can be imposed on the frequency dependent equal gain constraint explained above. This additional constraint is a frequency shaping constraint which requires that at each frequency of the baseband signal to be transmitted (e.g., frequency sub-band or frequency sub-carrier k), the sum of the power of signals across all of the transmit antennas (|wtx,i (k)|2 for i=1 to N) is equal to Ptx/K. This constraint is useful to ensure that, in an iterative process between two communication devices, the transmit weights of the two devices will converge to optimal values. An additional benefit of this constraint is that the transmitting device can easily satisfy spectral mask requirements of a communication standard, such as IEEE 802.11x.


One solution to a system that combines the frequency selective equal gain constraint and the frequency shaping constraint is that |wtx,i (k)|2=Ptx/(KN). This solution says that the magnitude of each transmit antenna weight is Ptx/(KN). If the transmit weight vector is normalized to unity, i.e., divided by [Ptx/(KN)]1/2, then the vectors for all of the antennas across all of the k frequency sub-bands becomes a N×K matrix of phase values eiφik, where i is the antenna index and k is the sub-band/sub-carrier index.











j





φ11







j





φ21







j





φ31










j






φ

N

1










j





φ12






















j






φ

N

2










j





φ13






















j





φ





N





3
































j





φ1





K







j





φ2





K







j





φ3





K










j





φ





NK









FIG. 2 shows the magnitude of the antenna weights in a 2-antenna example that satisfy the frequency shaping constraint but not the equal gain constraint. The magnitude of the antenna weights for the two antennas at each of three exemplary frequency sub-bands (k, k+1, k+2) are shown. The sum of the magnitude of the antenna weights of both antennas at any of the frequency sub-bands shown adds to a constant value, Ptx/K.



FIG. 3 shows the magnitude of the antenna weights in the 2-antenna example that satisfy the equal gain constraint and the frequency shaping constraint. In this example, the total power at antenna 1 (i.e., the total area under the weight curve across k frequency sub-bands) is P/2 (N=2 in the example) and the total power of the antennas at any frequency sub-band k is P/K. Thus, the power or magnitude of the transmit antenna weight for any given antenna is equal (constant) across the bandwidth of the baseband signal, and is equal to P/(KN) for all k. In other words, at each antenna, the power is equally distributed across the bandwidth of the baseband signal.


For EGCBF, the optimization problem becomes

argmax{wHtx,1(k)HH(k)H(k)wtx,1(k)}, subject to |wtx,i(k)|2=Ptx/(NK).  (1)


A closed-form solution to equation (1) is difficult to obtain since it requires the solution of a non-linear system of equations. However, the following necessary conditions for the solution to (1) have been derived and are given below:


Optimal wrx satisfies wrx=kHwtx for some nonzero constant k.


Optimal wtx satisfies Im(Λ*HHHe)=0, Λ=diag(eiφ0, eiφ1, . . . , eiφN-1), wtx=e=(eiφ0, eiφ1, . . . , eiφN-1)T. One solution to equation (1) is an adaptive algorithm for EGCBF. Although the algorithm is not necessarily optimal in terms of solving equation (1), it is simple to implement and simulations have verified that it converges reliably at the expense of only a 1-2 dB performance penalty relative to non-equal gain CBF. This adaptive algorithm is described hereinafter in conjunction with FIG. 5.


The communication devices at both ends of the link , i.e., devices 100 and 200 may have any known suitable architecture to transmit, receive and process signals. An example of a communication device block diagram is shown in FIG. 4. The communication device 300 comprises an RF section 310, a baseband section 420 and optionally a host 330. There are a plurality of antennas, e.g., four antennas 302, 304, 306, 308 coupled to the RF section 310 that are used for transmission and reception. The device may have only two antennas. The RF section 310 has a transmitter (Tx) 312 that upconverts baseband signals for transmission, and a receiver (Rx) 314 that downconverts received RF signals for baseband processing. In the context of the composite beamforming techniques described herein, the Tx 312 upconverts and supplies separately weighted signals to corresponding ones of each of the plurality of antennas via separate power amplifiers for simultaneous transmission. Similarly, the Rx 314 downconverts and supplies received signals from each of the plurality of antennas to the baseband section 320. The baseband section 320 performs processing of baseband signals to recover the information from a received signal, and to convert information in preparation for transmission. The baseband section 320 may implement any of a variety of communication formats or standards, such as WLAN standards IEEE 802.11x, Bluetooth™, as well as other standards.


The intelligence to execute the computations for the composite beamforming techniques described herein may be implemented in a variety of ways. For example, a processor 322 in the baseband section 320 may execute instructions encoded on a processor readable memory 324 (RAM, ROM, EEPROM, etc.) that cause the processor 322 to perform the composite beamforming steps described herein. Alternatively, an application specific integrated circuit (ASIC) may be configured with the appropriate firmware, e.g., field programmable gates that implement digital signal processing instructions to perform the composite beamforming steps. This ASIC may be part of, or the entirety of, the baseband section 320. Still another alternative is for the beamforming computations to be performed by a host processor 332 (in the host 330) by executing instructions stored in (or encoded on) a processor readable memory 334. The RF section 310 may be embodied by one integrated circuit, and the baseband section 320 may be embodied by another integrated circuit. The communication device on each end of the communication link need not have the same device architecture or implementation.


Regardless of the specific implementation chosen, the composite beamforming process is generally performed as follows. A transmit weight vector (comprising a plurality of complex transmit antenna weights corresponding to the number of transmit antennas) is applied to, i.e., scaled or multiplied by, a baseband signal to be transmitted, and each resulting weighted signal is coupled to a transmitter where it is upconverted, amplified and coupled to a corresponding one of the transmit antennas for simultaneous transmission. At the communication device on the other end of the link, the transmit signals are detected at each of the plurality of antennas and downconverted to a baseband signal. Each baseband signal is multiplied by a corresponding one of the complex receive antenna weights and combined to form a resulting receive signal. The architecture of the RF section necessary to accommodate the beamforming techniques described herein may vary with a particular RF design, and many are known in the art and thus is not described herein.


With reference to FIG. 5, an adaptive procedure 400 for determining near optimum transmit antenna weight vectors for first and second communication devices will be described. The antenna weight parameters in FIG. 4 are written with indexes to reflect communication between a WLAN access point (AP) and a station (STA), but without loss of generality, it should be understood that this process is not limited to WLAN application, but is useful in any short-range wireless application. The AP has Nap antennas and the STA has Nsta antennas. Assuming the AP begins with a transmission to the STA, the initial AP transmit weight vector wT,AP,0(k) is [1,1, . . . 1], equal gain and normalized by 1/(Nap)1/2 for all antennas and all frequency sub-bands/sub-carriers k. Phase for the transmit antenna weights is also initially set to zero. The index T indicates it is a transmit weight vector, index AP indicates it is an AP vector, index 0 is the iteration of the vector, and (k) indicates that it is frequency sub-band/sub-carrier dependent. The index i is the antenna index. The transmit weight vectors identified in FIG. 5 form an N x K matrix explained above.


In step 410, a baseband signal is scaled by the initial AP transmit weight vector wT,A,P,0(k), upconverted and transmitted to the STA. The transmitted signal is altered by the frequency dependent channel matrix H(k) from AP-STA. The STA receives the signal and matches its initial receive weight vector wR,STA,0(k) to the signals received at its antennas. In step 420, the STA gain normalizes the receive weight vector wR,STA,0(k) and computes the conjugate of gain-normalized receive weight vector to generate the STA's initial transmit weights for transmitting a signal back to the AP. The STA scales the signal to be transmitted to the AP by the initial transmit weight vector, upconverts that signal and transmits it to the AP. Computing the conjugate for the gain-normalized vector means essentially co-phasing the receive weight vector (i.e., phase conjugating the receive weight vector). The transmitted signal is effectively scaled by the frequency dependent channel matrix HT(k). At the AP, the receive weight vector is matched to the signals received at its antennas. The AP then computes the conjugate of the gain-normalized receive weight vector as the next transmit weight vector wT,AP,1(k) and in step 430 transmits a signal to the STA with that transmit weight vector. The STA receives the signal transmitted from the AP with this next transmit weight vector and matches to the received signals to compute a next receive weight vector wR,STA,1(k). Again, the STA computes the conjugate of the gain-normalized receive weight vector wR,STA,1(k) as its next transmit weight vector wT,STA,1(k) for transmitting a signal back to the AP. This process repeats for several iterations, ultimately converging to transmit weight vectors that achieve nearly the same performance as non-equal gain composite beamforming. This adaptive process works even if one of the devices, such as a STA, has a single antenna for transmission and reception. In addition, throughout the adaptive process, the frequency shaped constraint may be maintained so that for each antenna, the transmit antenna weight is constant across the bandwidth of the baseband signal.



FIG. 6 shows that the adaptive algorithm converges to performance loss that is less than 1 dB with 95% probability after 3-4 iterations. FIG. 7 shows simulation results that indicate that the performance degradation compared to the non-equal gain composite beamforming case is only 1-2 dB.


Each communication device stores the transmit antenna weights determined to most effectively communicate with each of the other communication devices that it may communicate with. The transmit antenna weights may be determined according to the adaptive algorithm described above. When storing the transmit weights of a transmit weight vector, in order to conserve memory space in the communication device, the device may store, for each antenna, weights for a subset or a portion of the total number of weights that span the bandwidth of the baseband signal. For example, if there are K weights for K frequency sub-bands or sub-carrier frequencies, only a sampling of those weights are actually stored, such as weights for every other, every third, every fourth, etc., k sub-band or sub-carrier. Then, the stored subset of transmit weights are retrieved from storage when a device is to commence transmission of a signal, and the remaining weights are generated by interpolation from the stored subset of weights. Any suitable interpolation can be used, such as linear interpolation, to obtain the complete set of weights across the K sub-bands or sub-carriers for each antenna.


With reference to FIG. 8, a beamforming transmission process 500 is shown for a multi-carrier baseband modulation scheme. For a multi-carrier modulation system, such as an orthogonal frequency division multiplexed (OFDM) system used in IEEE 802.11a, the data symbols are in the frequency domain. K symbols are assigned to K sub-carriers (K=52 for 802.11a). For convenience, each of the transmit antenna weights are described as a function of (k), the sub-carrier frequency. The equal gain transmit antenna weights are computed by any of the processes described herein at each of the sub-carrier frequencies. There is a signal processing path for each of the N antennas. In each signal processing path, a multiplier 510 multiplies the frequency domain symbol s(k) by the corresponding equal-gain transmit antenna weight wtx(k) and because wtx(k) has K values, there are K results from the multiplication process. The results are stored in a buffer 520 for k=1 to K. An inverse Fast Fourier Transform (IFFT) 530 is coupled to the buffer to convert the frequency domain results stored in buffer 520 to a digital time domain signal for each of the K sub-carriers. There may be some adjustment made for cyclic prefixes caused by the OFDM process. A filter 540 provides lowpass filtering of the result of the IFFT process. The digital results of the filtering process are converted to analog signals by a D/A 550. The outputs of the D/A 550 are coupled to RF circuitry 560 that upconverts the analog signals to the appropriate RF signal which is coupled via a power amplifier (PA) 570 to one of the N antennas 580. In this manner, for each antenna 580, the signal s(k) is multiplied by respective transmit antenna weights whose phase values may vary as a function of the sub-carrier frequency k.



FIG. 9 shows a reception process 600 that is essentially the inverse of the transmission process 500 shown in FIG. 8. There is a signal processing channel for each of the antennas 580. RF circuitry 610 downconverts the RF signals detected at each antenna 580 for each of the sub-carriers. An A/D 620 converts the analog signal to a digital signal. A lowpass filter 630 filters the digital signal. There may be some adjustment made for cyclic prefixes caused by the OFDM process. A buffer 640 stores the time domain digital signal in slots associated with each sub-carrier frequency k. An FFT 650 converts the time domain digital signal in buffer 640 to a frequency domain signal corresponding to each sub-carrier frequency k. The output of the FFT 650 is coupled to a multiplier 660 that multiplies the digital signal for each sub-carrier k by a corresponding receive antenna weight wrx(k) for the corresponding one of the N antennas. The outputs of each of the multipliers 660 are combined by an adder 670 to recover the digital frequency domain symbol s(k). The signal s(k) is then mapped back to symbol b(k).



FIGS. 10 and 11 show transmission and reception processes, respectively, that are applicable to a single-carrier baseband modulation scheme, such as that used by the IEEE 802.11b standard. The data symbols in such a system are m the time domain. FIG. 10 shows a beamforming transmission process 700. Since in a frequency dependent channel, the transmit antenna weights are frequency dependent, the passband of the time-domain baseband signal is synthesized into frequency bins or sub-bands (K bins or sub-bands) and equal gain transmit beamforming weights are computed for each frequency bin using any of the processes described herein. There are processing channels for each antenna. In each processing channel, transmit filters 710 are synthesized with the frequency response specified by the beamforming weights. Thus, each transmit filter 710 has a frequency response defined by the transmit antenna weight wtx(f) associated with that antenna. The data symbol s(n) is passed through the transmit filter 710 which in effect applies the frequency dependent antenna weight wtx(f) to the data symbol s(n). The D/A 720 converts the digital output of the transmit filter 710 to an analog signal. The RF circuitry 730 upconverts the analog signal and couples the upconverted analog signal to an antenna 750 via a power amplifier 740.



FIG. 11 shows a reception process 800 suitable for a single carrier system. There is a processing channel for each antenna 750. In each processing channel, RF circuitry 810 downconverts the received RF signal. An A/D 820 converts the downconverted analog signal to a digital signal. Like the frequency dependent transmit antenna weights, the receive antenna weights are computed for the plurality of frequency sub-bands. Receive filters 830 are synthesized with the frequency response specified by the frequency dependent receive beamforming weights wrx(f) and the received digital signal is passed through filters 830 for each antenna, effectively applying a frequency dependent antenna weight to the received signal for each antenna. The results of the filters 830 are combined in an adder 850, and then passed to a demodulator 860 for demodulation.



FIG. 12 shows a procedure for use when only one of the two devices supports beamforming. For example, N-CBF is supported at a first communication device (an AP) but not at a second communication device (a STA). In this case, the STA is likely to support 2-antenna Tx/Rx selection diversity as discussed previously. If this is the case, it is possible for the AP to achieve 3 dB better performance than Nth order maximal ratio combining (MRC) at both ends of the link.


When a STA associates or whenever a significant change in channel response is detected, the AP sends a special training sequence to help the STA select the best of its two antennas. The training sequence uses messages entirely supported by the applicable media access control protocol, which in the following example is IEEE 802.11x.


The sequence consists of 2 MSDUs (ideally containing data that is actually meant for the STA so as not to incur a loss in throughput). In step 900, the AP sends the first MSDU using a Tx weight vector having equal gain orthogonal transmit weights (also optionally frequency shaped). For example, if the number of AP antennas is 4, the transmit weight vector is [1 1 1 1]T. In step 910, the 2-antenna selection diversity STA responds by transmitting a message using one of its' two antennas; the antenna that best received the signal from the AP. The AP decodes the message from the STA, and obtains one row of the H matrix (such as the first row hr1). In step 920, the AP sends the second MSDU using a frequency dependent transmit weight vector which is orthogonal to the first row of H (determined in step 610), and equal-gain normalized such that the magnitude of the signals at each antenna is equal to P/N. In addition, the transmit weight vector may be frequency shaped across so that at each frequency of the baseband signal, the sum of the power output by the antennas of the first communication device is constant across. When the STA receives the second MSDU, it forces the STA to transmit a response message in step 630 using the other antenna, allowing the AP to see the second row of the H matrix, such as hr2. Now the AP knows the entire H matrix. The AP then decides which row of the H matrix will provide “better” MRC at the STA by computing a norm of each row, hr1 and hr2, of the H matrix and, and selecting the row that has the greater norm as the frequency dependent transmit weight vector for further transmissions to that STA until another change is detected in the channel. The row that is selected is equal gain normalized before it is used for transmitting to that STA.


Equal gain composite beamforming provides significant advantages. By reducing output power requirements for each power amplifier, the silicon area of the power amplifiers are reduced by as much as N times (where N is equal to the number of antennas) relative to non-equal gain CBF. The silicon area savings translates into a cost savings due to (1) less silicon area, and (2) the ability to integrate the power amplifiers onto the same die (perhaps even the same die as the radio frequency transceiver itself).


The efficiency (efficiency being defined as the output power divided by DC current consumption) for each power amplifier is N times larger in the EGCBF case than in the non-equal gain CBF case. With EGCBF, the same output power as non-equal CBF is achieved with N times less DC current.


Equal gain CBF reduces power requirements for each of the power amplifiers, which in turn increases the output impedance of each of the power amplifiers (since impedance is inversely proportional to current, and supply current requirements will be reduced). When the output impedance of the power amplifier is increased, the matching networks required for the power amplifiers are greatly simplified and require less silicon area. Moreover, reducing power requirements for the individual power amplifiers provides greater flexibility for systems with low supply voltage.


To summarize, a method is provided that accomplishes applying a transmit weight vector to a baseband signal to be transmitted from the first communication device to the second communication device, the transmit weight vector comprising a complex transmit antenna weight for each of N plurality of antennas of the first communication device, wherein each complex transmit antenna weight has a magnitude and a phase whose values may vary with frequency across a bandwidth of the baseband signal, thereby generating N transmit signals each of which is weighted across the bandwidth of the baseband signal, wherein the magnitude of the complex transmit antenna weight associated with each antenna is such that the power to be output at each antenna is the same and is equal to the total power to be output by all of the N antennas divided by N; receiving at the N plurality of antennas of the first communication device a signal that was transmitted by the second communication device; determining a receive weight vector comprising a plurality of complex receive antenna weights for the N plurality of antennas of the first communication device from the signals received by the N plurality of antennas, wherein each receive antenna weight has a magnitude and a phase whose values may vary with frequency; and updating the transmit weight vector for the N plurality of antennas of the first communication device for transmitting signals to the second communication device by gain normalizing the receive weight vector and computing a conjugate thereof. This process may be performed such that at substantially all frequencies of the baseband signal, the sum of the magnitude of the complex transmit antenna weights across the plurality of antennas of the first communication device is constant. Moreover, where the bandwidth of the baseband signal comprises K plurality of frequency sub-bands, the magnitude of the complex transmit antenna weights associated with each of the N plurality of antennas is such that the power to be output by each antenna is the same and is equal to 1/(KN) of the total power to be output for all of the K frequency sub-bands. This process may be embodied by instructions encoded on a medium or in a communication device.


In addition, a method is provided that accomplishes a method for communicating signals from a first communication device to a second communication device using radio frequency (RF) communication techniques, comprising: applying to a first signal to be transmitted from the first communication device to the second communication device a transmit weight vector, the transmit weight vector comprising a complex transmit antenna weight for each of the N plurality of antennas, wherein each complex transmit antenna weight has a magnitude and a phase whose values may vary with frequency across a bandwidth of the baseband signal, thereby generating N transmit signals each of which is weighted across the bandwidth of the baseband signal, wherein the magnitude of the complex transmit antenna weights associated with each antenna is such that the power to be output at each antenna is the same and is equal to the total power to be output by all of the N antennas divided by N; from a first response signal at the plurality of antennas of the first communication device transmitted from a first of two antennas of the second communication device, deriving a first row of a channel response matrix that describes the channel response between the first communication device and the second communication device; applying to a second signal for transmission by the plurality of antennas of the first communication device a transmit weight vector that is orthogonal to the first row of the channel response matrix, and wherein the transmit weight vector comprises a plurality of complex transmit antenna weights, wherein each complex transmit antenna weight has a magnitude and a phase whose values may vary with frequency across a bandwidth of the second signal, thereby generating N transmit signals each of which is weighted across the bandwidth of the baseband signal, wherein the magnitude of the complex transmit antenna weights associated with each antenna is such that the power to be output at each antenna is the same and is equal to the total power to be output by all of the N antennas divided by N; deriving a second row of the channel response matrix from a second response signal received from a second of the two antennas of the second communication device; and selecting one of the first and second rows of the channel response matrix that provides better signal-to-noise at the second communication device as the transmit weight vector for further transmission of signals to the second communication device. This process may be performed such that at substantially all frequencies of the baseband signal, the sum of the magnitude of the complex transmit antenna weights across the plurality of antennas of the first communication device is constant. Moreover, where the bandwidth of the baseband signal comprises K plurality of frequency sub-bands, the magnitude of the complex transmit antenna weights associated with each of the N plurality of antennas is such that the power to be output by each antenna is the same and is equal to 1/(KN) of the total power to be output for all of the K frequency sub-bands. This process may be embodied by instructions encoded on a medium or in a communication device.


The above description is intended by way of example only.

Claims
  • 1. A wireless communication device, comprising: a plurality of N antennas;a baseband processor configured to determine a receive weight vector of a plurality of complex receive antenna weights for each of the plurality of N antennas, the receive antenna weights applied to a received baseband signal;compute a transmit weight vector by computing a conjugate of the receive weight vector, the transmit weight vector comprising a complex transmit antenna weight for each of plurality of N antennas of the communication device, wherein each complex transmit antenna weight has a magnitude and a phase whose values may vary with frequency across a bandwidth of the baseband signal, thereby generating a plurality of N transmit signals each of which is weighted across the bandwidth of the baseband signal to be transmitted from corresponding ones of the plurality of N antennas to a second communication device, wherein the magnitude of the complex transmit antenna weight associated with each antenna is such that the power to be output at each antenna is the same and is equal to the total power to be output by all of the N antennas divided by N and such that the sum of the power at each corresponding frequency across the plurality of transmit signals is equal to a constant;apply the transmit weight vector to a baseband signal for transmission via the plurality of N antennas; andupdate the transmit weight vector by repeating the determining of the receive weight vector and computing of the transmit weight vector each time signals are received to update the transmit weight vector.
  • 2. The device of claim 1, wherein the bandwidth of the baseband signal comprises K plurality of frequency sub-bands, and the magnitude of the complex transmit antenna weights associated with each of the plurality of N antennas is such that the power to be output by each antenna is the same and is equal to 1/(KN) of the total power to be output for all of the K frequency sub-bands of the communication device.
  • 3. The device of claim 2, further comprising a baseband memory configured to store, for each of the N antennas, complex transmit antenna weights for a subset of the K frequency sub-bands or sub-carriers.
  • 4. The device of claim 3, wherein the baseband processor and the stored subset of complex transmit antenna N and generate therefrom the complete set of antenna weights for all of the K frequency sub-bands or sub-carriers using interpolation techniques.
  • 5. The device of claim 1, wherein the receive weight vector, the transmit weight vector and the baseband signal of the are applied to each of K frequency sub-bands of the baseband signal that correspond to sub-carriers of a multi-carrier baseband signal or synthesized frequency sub-bands of a single carrier baseband signal.
Parent Case Info

This application is a continuation of U.S. application Ser. No. 10/800,610, filed Mar. 15, 2004, which is a continuation of U.S. application Ser. No. 10/174,689, filed Jun. 19, 2002, pending, which in turn claims priority to U.S. Provisional Application No. 60/361,055, filed Mar. 1, 2002, to U.S. Provisional Application No. 60/365,797 filed Mar. 21, 2002, and to U.S. Provisional Application No. 60/380,139, filed May 6, 2002. The entirety of each of the aforementioned applications are incorporated herein by reference.

US Referenced Citations (158)
Number Name Date Kind
4121221 Meadows Oct 1978 A
4599734 Yamamoto Jul 1986 A
4639914 Winters Jan 1987 A
4811420 Avis et al. Mar 1989 A
5274844 Harrison et al. Dec 1993 A
5394435 Weerackody Feb 1995 A
5437055 Wheatley, III Jul 1995 A
5457808 Osawa et al. Oct 1995 A
5491723 Diepstraten Feb 1996 A
5493307 Tsujimoto Feb 1996 A
5493722 Gunn et al. Feb 1996 A
5507035 Bantz et al. Apr 1996 A
5539832 Weinstein et al. Jul 1996 A
5570366 Baker et al. Oct 1996 A
5577265 Wheatley, III Nov 1996 A
5610617 Gans et al. Mar 1997 A
5621732 Osawa Apr 1997 A
5752173 Tsujimoto May 1998 A
5761193 Derango et al. Jun 1998 A
5761237 Petersen et al. Jun 1998 A
5771462 Olsen Jun 1998 A
5812531 Cheung et al. Sep 1998 A
5848105 Gardner et al. Dec 1998 A
5854611 Gans et al. Dec 1998 A
5898679 Brederveld et al. Apr 1999 A
5912921 Warren et al. Jun 1999 A
5924020 Forssen et al. Jul 1999 A
5930248 Langlet et al. Jul 1999 A
5982327 Vook et al. Nov 1999 A
5999826 Whinnett Dec 1999 A
6008760 Shattil Dec 1999 A
6018642 Adachi Jan 2000 A
6023625 Myers, Jr. Feb 2000 A
6037898 Parish et al. Mar 2000 A
6038272 Golden et al. Mar 2000 A
6044120 Bar-David et al. Mar 2000 A
6058105 Hochwald et al. May 2000 A
6064338 Kobayakawa et al. May 2000 A
6091934 Berman et al. Jul 2000 A
6097771 Foschini Aug 2000 A
6118788 Kermani Sep 2000 A
6122260 Liu et al. Sep 2000 A
6124824 Xu et al. Sep 2000 A
6141393 Thomas et al. Oct 2000 A
6141567 Youssefmir et al. Oct 2000 A
6144651 Rinchiuso et al. Nov 2000 A
6144711 Raleigh et al. Nov 2000 A
6147985 Bar-David et al. Nov 2000 A
6157340 Xu et al. Dec 2000 A
6157843 Derango et al. Dec 2000 A
6177906 Petrus Jan 2001 B1
6185440 Barratt et al. Feb 2001 B1
6195045 Xu et al. Feb 2001 B1
6211671 Shattil Apr 2001 B1
6218986 Yukitomo et al. Apr 2001 B1
6249250 Namekata et al. Jun 2001 B1
6252548 Jeon Jun 2001 B1
6252884 Hunter Jun 2001 B1
6266528 Farzaneh Jul 2001 B1
6295026 Chen et al. Sep 2001 B1
6298092 Heath, Jr. Oct 2001 B1
6307882 Marzetta Oct 2001 B1
6317466 Foschini et al. Nov 2001 B1
6327310 Hochwald et al. Dec 2001 B1
6331837 Shattil Dec 2001 B1
6349219 Hochwald et al. Feb 2002 B1
6351499 Paulraj et al. Feb 2002 B1
6362781 Thomas et al. Mar 2002 B1
6369758 Zhang Apr 2002 B1
6370182 Bierly et al. Apr 2002 B2
6377631 Raleigh Apr 2002 B1
6377636 Paulraj et al. Apr 2002 B1
6377819 Gesbert et al. Apr 2002 B1
6400699 Airy et al. Jun 2002 B1
6400780 Rashid-Farrokhi et al. Jun 2002 B1
6442214 Boleskei et al. Aug 2002 B1
6462709 Choi Oct 2002 B1
6463295 Yun Oct 2002 B1
6473467 Wallace et al. Oct 2002 B1
6522898 Kohno et al. Feb 2003 B1
6549786 Cheung Apr 2003 B2
6570929 Eriksson May 2003 B1
6584161 Hottinen et al. Jun 2003 B2
6625162 Myojo et al. Sep 2003 B2
6636568 Kadous Oct 2003 B2
6646600 Vail et al. Nov 2003 B2
6684064 Kazakevich et al. Jan 2004 B2
6687492 Sugar et al. Feb 2004 B1
6728294 Kohno et al. Apr 2004 B1
6728517 Sugar et al. Apr 2004 B2
6792033 Maruta et al. Sep 2004 B1
6862271 Medvedev et al. Mar 2005 B2
6873606 Agrawal et al. Mar 2005 B2
6873651 Tesfai et al. Mar 2005 B2
6888878 Prysby et al. May 2005 B2
6895255 Bridgelall May 2005 B1
6901122 Nadgauda et al. May 2005 B2
6904021 Belcea Jun 2005 B2
6940917 Menon et al. Sep 2005 B2
6956907 Ketchum Oct 2005 B2
6961545 Tehrani et al. Nov 2005 B2
6963742 Boros et al. Nov 2005 B2
6970682 Crilly, Jr. et al. Nov 2005 B2
6980600 Ratnarajah Dec 2005 B1
6983167 Adachi et al. Jan 2006 B2
7027536 Al-Dhahir Apr 2006 B1
7031368 Maruta et al. Apr 2006 B1
7042860 Kasami et al. May 2006 B2
7155231 Burke et al. Dec 2006 B2
7224758 Banister May 2007 B1
7224942 Dent May 2007 B2
7230940 Fantaske Jun 2007 B2
7277409 Thermond et al. Oct 2007 B1
7340279 Chen et al. Mar 2008 B2
7342875 Hammons et al. Mar 2008 B2
20010012764 Edwards et al. Aug 2001 A1
20010015994 Nam Aug 2001 A1
20010046255 Shattil Nov 2001 A1
20010053143 Li et al. Dec 2001 A1
20010053699 McCrady et al. Dec 2001 A1
20020001316 Hornsby et al. Jan 2002 A1
20020024975 Hendler Feb 2002 A1
20020034191 Shattil Mar 2002 A1
20020039884 Raynes et al. Apr 2002 A1
20020045435 Fantaske Apr 2002 A1
20020051430 Kasami et al. May 2002 A1
20020064246 Kelkar et al. May 2002 A1
20020067309 Baker et al. Jun 2002 A1
20020072392 Awater et al. Jun 2002 A1
20020085643 Kitchener et al. Jul 2002 A1
20020102950 Gore et al. Aug 2002 A1
20020111142 Klimovitch Aug 2002 A1
20020118781 Thomas et al. Aug 2002 A1
20020122383 Wu et al. Sep 2002 A1
20020122501 Awater et al. Sep 2002 A1
20020127978 Khatri Sep 2002 A1
20020136170 Struhsaker Sep 2002 A1
20020141355 Struhsaker et al. Oct 2002 A1
20020147032 Yoon et al. Oct 2002 A1
20020158801 Crilly, Jr. et al. Oct 2002 A1
20020159537 Crilly, Jr. et al. Oct 2002 A1
20020172186 Larsson Nov 2002 A1
20020172269 Xu Nov 2002 A1
20020196842 Onggosanusi et al. Dec 2002 A1
20030002450 Jalali et al. Jan 2003 A1
20030022693 Gerogiokas et al. Jan 2003 A1
20030032423 Boros et al. Feb 2003 A1
20030048761 Jarett Mar 2003 A1
20030108117 Ketchum et al. Jun 2003 A1
20030114108 Frecassetti et al. Jun 2003 A1
20030125090 Zeira Jul 2003 A1
20030139194 Onggosanusi et al. Jul 2003 A1
20030157954 Medvedev et al. Aug 2003 A1
20030181165 Sugar et al. Sep 2003 A1
20040072546 Sugar et al. Apr 2004 A1
20040104839 Velazquez et al. Jun 2004 A1
20050192048 Bridgelall Sep 2005 A1
20070117513 Kasami et al. May 2007 A1
Foreign Referenced Citations (5)
Number Date Country
9940648 Aug 1999 WO
9957820 Nov 1999 WO
0145300 Jun 2001 WO
0169800 Sep 2001 WO
0203568 Jan 2002 WO
Related Publications (1)
Number Date Country
20080014977 A1 Jan 2008 US
Provisional Applications (3)
Number Date Country
60361055 Mar 2002 US
60365797 Mar 2002 US
60380139 May 2002 US
Continuations (2)
Number Date Country
Parent 10800610 Mar 2004 US
Child 11879156 US
Parent 10174689 Jun 2002 US
Child 10800610 US