System and method for multiple-input multiple-output (MIMO) radio communication

Information

  • Patent Grant
  • 7194237
  • Patent Number
    7,194,237
  • Date Filed
    Friday, July 25, 2003
    23 years ago
  • Date Issued
    Tuesday, March 20, 2007
    19 years ago
Abstract
A system, method and device for MIMO radio communication of multiple signals between a first device having N plurality of antennas and a second device having M plurality of antennas. At the first device, a vector s representing L signals [s1 . . . sL] to be transmitted is processed with a transmit matrix A to maximize capacity of the channel between the first device and the second device subject to a power constraint that the power emitted by each of the N antennas is less than or equal to a maximum power. The power constraint for each antenna may be the same for all antennas or specific or different for each antenna. For example, the power constraint for each antenna may be equal to a total maximum power emitted by all of the N antennas combined divided by N. The transmit matrix A distributes the L signals [s1 . . . sL] among the N plurality of antennas for simultaneous transmission to the second device. At the second device, the signals received by the M plurality of antennas are processed with receive weights and the resulting signals are combined to recover the L signals.
Description
BACKGROUND OF THE INVENTION

The present invention is directed to a system and method to maximize capacity and/or range of a wireless radio communication link between two radio communication devices.


Multiple-input multiple-output (MIMO) radio communication techniques are known to enhance the received SNR for signals transmitted by one device to another. Research in MIMO radio algorithms has been conducted in which multiple signal streams are transmitted simultaneously from multiple antennas at one device to another device, thereby greatly enhancing the data rate of the wireless radio channel between two devices. One prior approach for transmitting multiple signals streams simultaneously by a plurality of antennas uses a power constraint on the total power transmitted by the plurality of antennas combined and a waterfilling solution. The waterfilling solution requires multiple full-power power amplifiers at the transmitting device since, for some channels, it is possible that all or nearly all the transmit power may be transmitted from one power amplifier. There is room for improving the design of devices capable of MIMO radio communication, particularly where it is desirable to fabricate the radio transceiver of the device in an integrated circuit.


SUMMARY OF THE INVENTION

Briefly, a system, method and device are provided for simultaneous radio communication of multiple signals (signal streams) between a first device having N plurality of antennas and a second device having M plurality of antennas. Unlike prior approaches, the approach taken herein is to impose a power constraint on each transmit antenna path at the transmitting device.


At the first device, a vector s representing L plurality of signals [s1 . . . sL] to be transmitted are processed with a transmit matrix A to maximize capacity of the channel between the first device and the second device subject to a power constraint that the power emitted by each of the N antennas is less than or equal to a maximum power. The power constraint for each antenna may be the same for all antennas or specific or different for each antenna. For example, the power constraint for each antenna may be equal to a total maximum power emitted by all of the N antennas combined divided by N. The transmit matrix A distributes the L plurality of signals [s1 . . . sL] among the N plurality of antennas for simultaneous transmission to the second device. At the second device, the signals received by the M plurality of antennas are processed with receive weights and the resulting signals are combined to recover the L plurality of signals. Solutions are provided for the cases when N>M and when N≦M.


The performance of a system in which the communication devices are designed around a power constraint at each antenna is nearly as good as the optimal waterfilling solution, yet provides significant implementation advantages. The radio transmitter can be implemented with power amplifiers that require lower power output capability, and thus less silicon area. Consequently, there is lower DC current drain by the transmitter, and lower on-chip interference caused by the power amplifiers.


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 system diagram showing two multiple-antenna radio communication devices, where multiple signal streams are simultaneously transmitted from a first device to a second device.



FIG. 2 is a flow chart depicting the mapping and multiplexing of signals to multiple antenna paths for simultaneous transmission.



FIG. 3 is a block diagram of a radio communication device capable of performing the MIMO radio communication techniques shown in FIG. 1.



FIG. 4 is a block diagram of an exemplary transmitter section of a modem forming part of the device shown in FIG. 3.



FIG. 5 is a block diagram of an exemplary receiver section of the modem.



FIG. 6 is a graphical plot that illustrates the relative performance of the MIMO radio techniques described herein.





DETAILED DESCRIPTION OF THE DRAWINGS

Referring to FIGS. 1 and 2, a system 10 is shown in which a first radio communication device 100 having N antennas 110(1) to 110(N) communicates by a wireless radio link with a second communication device 200 having M antennas 210(1) to 210(M). In the explanation that follows, the first communication device transmits to the second communication device, but the same analysis applies to a transmission from the second communication device to the first. The multiple-input multiple-output (MIMO) channel response from the N antennas of the first communication device to the M antennas of the second communication device is described by the channel response matrix H. The channel matrix in the opposite direction is HT.


Device 100 will simultaneously transmit L plurality of signals s1, s2, . . . , sL by antennas 110(1) to 110(N). A vector s is defined that represents the L plurality of signals [s1 . . . sL] (at baseband) to be transmitted such that s=[s1 . . . sL]T. The number (L) of signals that can be simultaneously transmitted depends on the channel H between device 100 and device 200, and in particular L≦Rank of HHH≦min(N,M). For example, if N=4, and M=2, then L≦Rank of HHH≦2.


The device 100 has knowledge of the channel state (e.g., using training sequences, feedback, etc.), i.e., device 100 knows H. Techniques to obtain and update knowledge of the channel H at the transmitting device (between the transmitting device and a receiving device) are known in the art and therefore are not described herein. For example, training and feedback techniques are described in U.S. Pat. No. 6,144,711 to Raleigh et al.


Two matrices are introduced: V is the eigenvector matrix for HHH and Λ is the eigenvalue matrix for HHH. Device 100 transmits the product As, where the matrix A is the spatial multiplexing transmit matrix, where A=VD. The matrix D=diag(d1, . . . , dL) where |dp|2 is the transmit power in pth mode, or in other words, the power of the pth one of the L signals where p=1 to L. Device 200 receives HAs+n, and after maximal ratio combining for each of the modes, device 200 computes c=AHHHHAS+AHHHn=DHDΛs+DHVHHHn.


As shown in FIG. 2, at the first device 100, blocks of bits from a bit stream {b} are mapped onto a vector s with a mapping technique. The mapping technique may optionally include coded modulation to improve link margin. The bit stream {b} may be a file or collection of bits, representing any type of data, such as voice, video, audio, computer data, etc., that is divided or otherwise separated into discrete frames or blocks (generally referred to as signals) to be spatially multiplexed and simultaneously transmitted. One example is the simultaneous transmission of multiple IEEE 802.11×frames (each si may be a different frame) from the first device 100 to the second device 200, where, for example, the first device 100 is an IEEE 802.11 access point (AP) and the second device is a client station (STA). The product of the transmit matrix A and the vector s is a vector x. This matrix multiplication step effectively weights each element of the vector s across each of the N antennas, thereby distributing the plurality of signals among the plurality of antennas for simultaneous transmission. Components x1 through xN of the vector x resulting from the matrix multiplication block are then coupled to a corresponding antenna of the first communication device. For example, component x1 is the sum of all of the weighted elements of the vector s for antenna 1, component x2 is the sum of all of the weighted elements of the vector s for antenna 2, etc.


The transmit matrix A is a complex matrix comprised of transmit weights wT,ij, for i=1 to L and j=1 to N. Each antenna weight may depend on frequency to account for a frequency-dependent channel H. For example, for a multi-carrier modulation system, such as an orthogonal frequency division multiplexed (OFDM) system, there is a matrix A for each sub-carrier frequency k. In other words, each transmit weight wT,ij is a function of sub-carrier frequency k. For a time-domain (single-carrier) modulation system, each transmit weight wT,ij may be a tapped-delay line filter.


Prior approaches involve selecting the weights dp to maximize capacity







C
=




p
=
1

L



log


(

1
+

SNR
p


)




,


SNR
p

=

|

d
p



|
2




λ
p




E


(

|

s
p



|
2


)



E


(

|

n
p



|
2


)











subject to a total power constraint emitted by the plurality of transmit antennas combined on the transmit matrix A, i.e.,










P
TOT

=




Tr


(

AA
H

)


·
E

|

s
p



|
2


=



Tr


(


VDD
H



V
H


)


·
E

|

s
p



|
2









=


Tr


(


VDD
H



V
H


)


<


P
max



(



assuming





E

|

s
p



|
2


=
1

)











The optimum solution to this problem is to use waterfilling to select the weights dp (i.e., use waterfilling to put more power in eigenchannels with higher SNR λp).


The waterfilling approach requires N full-power capable power amplifiers at the transmitting device since, for some channels, it is possible for the optimal solution to require all or nearly all the transmit power to be sent from one antenna path. To reiterate, the prior approaches constrain the total power emitted from all of the antenna paths combined, simply ΣPi=PTOT<Pmax (for i=1 to N antennas) where Pmax is a total power constraint and Pi is the power from transmit antenna path i.


A better approach is to use a power constraint for each individual transmit antenna path. One such constraint is that the power transmitted from each antenna is less than the total power transmitted from all N antennas combined (Pmax) divided by N, e.g., Pi≦Pmax/N for all i. Using this approach, referred to as the “antenna power constraint” approach, each power amplifier can be designed to output (no more than) Pmax/N average power, where Pmax is the maximum power of the transmission from all of the N antennas combined. A significant benefit of this approach is that the power amplifiers can be designed to have lower maximum output power capability, thus requiring less silicon area. The use of smaller and lower-output power amplifiers has the benefit of lower on-chip power amplifier interference and lower DC current drain.


Using a Pmax/N power constraint for each antenna, the problem becomes:

    • Maximize capacity C subject to

      (AAH)ii<Pmax/N, i=1, . . . , N.

      This is a difficult problem to solve for dp, since it involves finding the roots of a non-linear function using N Lagrange multipliers (one for each of the above N constraints). However, there is a simple non-optimal solution for each of two cases.


      Case 1: N≦M:


In this case, the transmitting device (having N plurality of antennas) multiplies the vector s representing the L signals [s1 . . . sL]T to be transmitted with the transmit matrix A (i.e., computes As), where the transmit matrix A is computed with D set equal to I·sqrt(Pmax/N) (where I is the identity matrix) enforcing equal power in each mode. As a result, HHH is Hermitian and (with probability 1) is full-rank, which means that V is orthonormal. Consequently, (AAH)ii=(VDDHVH)ii=(VVH)iiPmax/N=Pmax/N, which means that equal power Pmax/N is transmitted at each antenna by a corresponding power amplifier of device 100, and the total transmit power is equal to Pmax.


Case 2: N>M:


In this case, HHH is not full-rank. Let v1, . . . , vL denote the L eigenvectors for HHH having nonzero eigenvalues. Let V=[v1 . . . vL], and let D=sqrt(d·Pmax/N)·I, where the power for each mode is the same and dp=d for p=1 to L. The power in antenna path i is given by (d·Pmax/N)·(VVH)ii. Thus, the power emitted from each of the i antenna paths may be different. The transmitting device (having the N antennas) multiplies the vector s representing the L signals [s1 . . . sL]T to be transmitted with the transmit matrix A (i.e., computes As), where the transmit matrix A is computed with D set equal to sqrt(d·Pmax/N)·I, where the power for each mode is the same and dp=d for p=1 to L.


Approach 1: Set d=1/z, where






z
=


max
i




{


(

VV
H

)

ii

}

.







Then the maximum power from any antenna path is Pmax/N. The total power from all antenna paths can be shown to be at least Pmax/M and no greater than Pmax.


Approach 2: Set d=1. In this case, the total power emitted by the N plurality of antennas is Pmax/M and the power emitted by antenna i for i=1 to N is (Pmax/N)·(VVH)ii.


Assuming the power amplifiers at devices on both sides of the link have the same peak output power, then for Case 1 and Case 2/Approach 2, the total power transmitted from the N antenna device will be equal to the total power transmitted from the M antenna device. Hence, the link between the two devices is symmetric in these situations. Case 2/Approach 1 is slightly more complicated (since it requires a normalization step) but has more transmitted power than Approach 2.


The solutions described above are capable of performing within 1 dB of the Shannon limit for a symmetric system (same number of antennas on both sides of the link), but facilitate use of smaller and more efficient power amplifiers in the radio transceiver, and as a result, achieve lower on-chip interference between radio paths (caused by the power amplifiers) than the waterfilling solution.


The antenna power constraint need not be the same for each of the transmit antennas and may be specific to or different for each antenna. Moreover, even if a different antenna power constraint is used for each antenna, each of the antenna-specific power constraints may be less than or equal to Pmax/N.


The device 200 with M plurality of antennas will transmit to device 100 subject to the same type of power constraint at each of the M plurality of antennas. The cases described above are applied where M is compared relative to N, and the appropriate solution is used for transmitting signals to device 100.



FIG. 3 shows a block diagram of a radio communication device suitable for devices 100 and 200. Device 100 comprises a modem 120, a plurality of digital-to-analog converters (DACs) 130, a plurality of analog-to-digital converters (ADCs) 140, a MIMO radio transceiver 150 coupled to antennas 110(1) to 110(N) and a control processor 160. The modem 120, also referred to as a baseband signal processor, performs the baseband modulation of signals to be transmitted (vector s) and the baseband demodulation of received signals. In so doing, the modem 120 multiplies the vector s representing the L signals [s1 . . . sL]T to be transmitted by the transmit matrix A. The DACs 130 are complex DACs that convert the digital baseband modulated signals representing As to corresponding analog signals coupled to transmit paths in the MIMO radio transceiver 150. The ADCs 140 convert the received analog signals from corresponding receive paths in the MIMO radio transceiver 150 to digital signals for baseband demodulation by the modem 120. In the baseband demodulation process, the modem 120 will apply appropriate receive weights to the received signals to recover the L signals [s1 . . . sL]T. The MIMO radio transceiver 150 comprises a plurality of radio transceivers each comprising a transmitter 152(i) and a receiver 154(i) associated with and coupled to a corresponding antenna by a corresponding switch 156(i). Each transmitter includes a power amplifier (not shown). The MIMO radio transceiver 150 may be a single integrated circuit or two or more separate integrated circuits. An example of a single-integrated MIMO radio transceiver is disclosed in co-pending and commonly assigned U.S. patent application Ser. No. 10/065,388, filed Oct. 11, 2002, the entirety of which is incorporated herein by reference.


There are many ways to implement the modem 120. FIGS. 4 and 5 show block diagrams of examples of the transmitter section 120A and receiver sections 120B, respectively, of the modem 120, for a multi-carrier, e.g., orthogonal frequency division multiplexed (OFDM) application. Generally, matrix multiplication of the type described above is performed independently on each OFDM subcarrier to optimize performance for indoor frequency-selective fading channels. With reference to FIG. 4, the transmitter section 120A of the modem comprises a scrambler block 310, a block 315 of convolutional encoders, a block 320 of interleavers, a spatial multiplexer block 325 that performs the matrix multiplication with the transmit matrix A that is different at each of the OFDM sub-carriers k (i.e., A=A(k)), a subcarrier modulator 330, a block 335 of inverse Fast Fourier Transforms (IFFTs) and a block 340 of low pass filters. The output of the low pass filters block 340 is coupled to the DACs 130 (FIG. 3). A preamble generator 350 is also provided and is coupled to the DACs 130. As shown in FIG. 4, assuming the modem is in an N antenna device, there are L instances of blocks 315, 320 and 325 to perform processing on each baseband transmit signal stream and N instances of blocks 335, 340 and 130 for processing signals associated with each transmit antenna path.


The receiver section 120B shown in FIG. 5 comprises a block 415 of resamplers, a block of lowpass filters 420, a block 425 of numerically controlled oscillators (NCOs), a block 430 of FFTs, a block of equalizers 435 in which the receive weights are applied to the receive signals, a block of de-interleavers 440 and a block of convolutional decoders 445. A preamble processing and automatic gain control (AGC) block 450 and a channel estimator block 455 are also provided for channel estimation computations and other functions. The preamble and AGC block 450 recovers a preamble in the received signal and the channel estimator 455 generates knowledge about the channel H, which knowledge is supplied to the equalizer 435 to compute and apply receive weights to the signals output by the FFT block 430. Assuming the modem is in an N antenna device, there are N instances of blocks 415, 420, 425 and 430 to perform processing on each received signal stream and L instances of blocks 435, 440 and 445 to recover the L signals.


As suggested in the description above of FIGS. 4 and 5, a first device passes channel response information to a second device by sending a known OFDM training sequence once through each antenna in, for example, a packet preamble. For a frequency domain implementation, the second device performs a space-frequency decomposition (SFD) given this channel information, and uses the SFD data to process received signals from that device, and to transmit signals back to the other device. This assumes reciprocity in the link, and therefore MIMO phase calibration at each device needs to be performed. Techniques for MIMO phase calibration are disclosed in commonly assigned and co-pending U.S. patent application Ser. No. 10/457,293, filed Jun. 9, 2003, the entirety of which is incorporated herein by reference. Information regarding constellation order as a function of subcarrier index and eigenchannel may also be included in preamble. Each subcarrier has an associated constellation order for each eigenchannel. In the transmitter section 120A, a multi-dimensional vector trellis encoder (VTE) may be used to map input bits from the scrambler onto OFDM constellation symbols. Examples of multi-dimensional VTE's are known in the art. Other techniques for obtaining channel state information are known in the art as suggested above.


A modem may be built that applies the power constraint principles described above to a time-domain system implementation where tapped delay-line filters are used.



FIG. 6 illustrates how the more efficient antenna power constraint described herein compares to the optimal waterfilling approach.


In sum, a system and method are provided for MIMO radio communication between a first device having N plurality of antennas and a second device having M plurality of antennas. At the first device, a vector s representing L signals [s1 . . . sL] to be transmitted is processed with a transmit matrix A to maximize capacity of the channel between the first device and the second device subject to a power constraint that the power emitted by each of the N antennas is less than a maximum power, whereby the transmit matrix A distributes the L signals [s1 . . . sL] among the N plurality of antennas for simultaneous transmission to the second device. Similarly, a radio communication device is provided comprising N plurality of antennas, N plurality of radio transmitters each coupled to a corresponding one of the plurality of antennas, and a baseband signal processor coupled to the N plurality of radio transmitters to process a vector s representing L signals [s1 . . . sL] to be transmitted with a transmit matrix A to maximize capacity of the channel between the first device and the second device subject to a power constraint that the power emitted by each of the N antennas is less than a maximum power, whereby the transmit matrix A distributes the L signals [s1 . . . sL] for simultaneous transmission to the second device by the N plurality of antennas. The transmit matrix A is computed subject to the power constraint being different for one or more of the N antennas or being the same for each of the N plurality of antennas. For example, in the latter case, the transmit matrix A may be computed subject to the power constraint for each of the N plurality of antennas being equal to a total maximum power emitted by all of the N plurality of antennas combined divided by N.


The above description is intended by way of example only.

Claims
  • 1. A method of simultaneously transmitting signals over a channel between a first device having N plurality of antennas and a second device having M plurality of antennas, the method comprising: processing a vector s representing L signals [s1 . . . sL] with a transmit matrix A that is computed to maximize capacity of the channel by multiplying the vector s with the transmit matrix A, wherein the transmit matrix A is equal to VD, where V is an eigenvector matrix for HHH, H is the channel response from the first device to the second device, D=diag(d1, . . ., dL) and |dp|2 is the transmit power for p=1 to L; andtransmitting with a power constraint for each individual transmit antenna path, wherein if N≦M, then D=I·sqrt(Pmax/N), with I as an identity matrix, such that the power transmitted by each of the N plurality of antennas is the same and equal to Pmax/N; and if N>M, then D=sqrt(d·Pmax/N)·I, such that the power transmitted by antenna i for i=1 to N is (d·Pmax/N)·(VVH)ii, and dp=d for p=1 to L.
  • 2. The method of claim 1, wherein the transmit matrix A is computed subject to the power constraint.
  • 3. The method of claim 1, wherein if N>M, then d=1/z and
  • 4. The method of claim 1, wherein if N>M, then d=1, such that the power emitted by antenna i for i=1 to N is (Pmax/N)·(VVH)ii, and the total power emitted from the N plurality of antennas combined is Pmax/M.
  • 5. The method of claim 1, and further comprising: receiving at the M plurality of antennas signals transmitted by the first device; andprocessing the signals received at each of the plurality of M antennas with receive weights and combining the resulting signals to recover the L signals.
  • 6. The method of claim 1, wherein each of the L signals is baseband modulated using a multi-carrier modulation process, and wherein the processing comprises multiplying the vector s with a transmit matrix A(k) at each of a plurality of sub-carriers k.
  • 7. A radio communication device for simultaneously transmitting signals over a channel between N transmit antennas and M receive antennas, the radio communication device comprising: a. N plurality of antennas;b. N plurality of radio transmitters each coupled to a corresponding one of the plurality of antennas; andc. a baseband signal processor coupled to the N plurality of radio transmitters to process a vector s representing L signals [s1 . . . sL] with a transmit matrix A that is computed to maximize capacity of the channel by multiplying the vector s with the transmit matrix A, wherein the transmit matrix A is equal to VD, where V is an eigenvector matrix for HHH, H is the channel response from the first device to the second device, D=diag(d1, . . . , dL) and |dp|2 is the transmit power for p=1 to L; and to transmit according to a power constraint for each individual transmit antenna path, wherein if N≦M, then D=I·sqrt(Pmax/N), with I as an identity matrix, such that the power transmitted by each of the N plurality of antennas is the same and equal to Pmax/N; and if N>M, then D=sqrt(d·Pmax/N)·I, such that the power transmitted by antenna i for i=1 to N is (d·Pmax/N)·(VVH)ii, and dp=d for p=1 to L.
  • 8. The device of claim 7, wherein the transmit matrix A is computed subject to the power constraint.
  • 9. The device of claim 7, wherein if N>M, then d=1/z and
  • 10. The device of claim 7, wherein if N>M, then d=1, such that the power emitted by antenna i for i=1 to N is (Pmax/N)·(VVH)ii, and the total power emitted from the N plurality of antennas combined is Pmax/M.
  • 11. The device of claim 7, wherein each of the L signals is baseband modulated using a multi-carrier modulation process, and the baseband signal processor multiplies the vector s with a transmit matrix A(k) at each of a plurality of sub-carriers k.
  • 12. A radio communication system for simultaneously transmitting signals over a channel between N transmit antennas and M receive antennas, the radio communication system comprising: a. a first device comprising: i. N plurality of antennas;ii. N plurality of radio transmitters each coupled to a corresponding one of the plurality of antennas; andiii. a baseband signal processor coupled to the N plurality of radio transmitters to process a vector s representing L signals [s1 . . . sL] with a transmit matrix A that is computed to maximize capacity of the channel by multiplying the vector s with the transmit matrix A, wherein the transmit matrix A is equal to VD, where V is an eigenvector matrix for HHH, H is the channel response from the first device to the second device, D=diag(d1, . . . , dL) and |dp|2 is the transmit power for p=1 to L; and to transmit according to a power constraint for each individual transmit antenna path, wherein if N≦M, then D=I·sqrt(Pmax/N), with I as an identity matrix, such that the power transmitted by each of the N plurality of antennas is the same and equal to Pmax/N; and if N>M, then D=sqrt(d·Pmax/N)·I, such that the power transmitted by antenna i for i=1 to N is (d·Pmax/N)·(VVH)ii, and dp=d for p=1 to L;b. the second device comprising: i. M plurality of antennas;ii. M plurality of radio receivers each coupled to a corresponding one of the plurality of antennas; andiii. a baseband signal processor coupled to the M plurality of radio receivers to process signals output by the plurality of radio receivers with receive weights and combining the resulting signals to recover the L signals [s1 . . . SL].
  • 13. The system of claim 12, wherein if N>M, then d=1/z and
  • 14. The system of claim 12, wherein if N>M, then d=1, such that the power emitted by antenna i for i=1 to N is (Pmax/N)·(VVH)ii, and the total power emitted from the N plurality of antennas combined is Pmax/M.
  • 15. The system of claim 12, wherein each of the L signals is baseband modulated using a multi-carrier modulation process, and the baseband signal processor multiplies the vector s with a transmit matrix A(k) at each of a plurality of sub-carriers k.
Parent Case Info

This application claims priority to U.S. Provisional Application No. 60/319,437, filed Jul. 30, 2002, to U.S. Provisional Application No. 60/461,672, filed Apr. 10, 2003, and to U.S. Provisional Application No. 60/479,945, filed Jun. 19, 2003. The entirety of each of these applications is incorporated herein by reference.

US Referenced Citations (141)
Number Name Date Kind
4121221 Meadows Oct 1978 A
4599734 Yamamoto Jul 1986 A
4639914 Winters Jan 1987 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
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
5752173 Tsujimoto May 1998 A
5761193 Derango et al. Jun 1998 A
5761237 Petersen et al. Jun 1998 A
5812531 Cheung et al. Sep 1998 A
5848105 Gardner et al. Dec 1998 A
5898679 Brederveld et al. Apr 1999 A
5912921 Warren et al. Jun 1999 A
5930248 Langlet et al. Jul 1999 A
5982327 Vook et al. Nov 1999 A
6008760 Shattil Dec 1999 A
6023625 Myers, Jr. Feb 2000 A
6037898 Parish et al. Mar 2000 A
6038272 Golden Mar 2000 A
6044120 Bar-David et al. Mar 2000 A
6058105 Hochwald 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
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. et al. Oct 2001 B1
6307882 Marzetta Oct 2001 B1
6314147 Liang et al. Nov 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
6452964 Yoshida Sep 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 Jun 2003 B2
6636568 Kadous Oct 2003 B2
6646600 Vail et al. Nov 2003 B2
6661856 Calderbank et al. Dec 2003 B1
6684064 Kazakevich et al. Jan 2004 B2
6687492 Sugar et al. Feb 2004 B1
6763073 Foschini et al. Jul 2004 B2
6771706 Ling et al. Aug 2004 B2
6922445 Sampath et al. Jul 2005 B1
6963619 Gesbert et al. Nov 2005 B1
6968013 Awater et al. Nov 2005 B2
20010012764 Edwards et al. Aug 2001 A1
20010015994 Nam Aug 2001 A1
20010015999 Nam Aug 2001 A1
20010046255 Shattil Nov 2001 A1
20010053143 Li 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
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 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. Oct 2002 A1
20020172186 Larsson Nov 2002 A1
20020172269 Xu Nov 2002 A1
20020191535 Sugiyama et al. Dec 2002 A1
20020196842 Onggosanusi et al. Dec 2002 A1
20030002450 Jalali et al. Jan 2003 A1
20030003880 Ling et al. Jan 2003 A1
20030022693 Gerogiokas et al. Jan 2003 A1
20030032423 Boros et al. Feb 2003 A1
20030043929 Sampath Mar 2003 A1
20030048761 Jarett Mar 2003 A1
20030072379 Ketchum Apr 2003 A1
20030072382 Raleigh et al. Apr 2003 A1
20030108117 Ketchum et al. Jun 2003 A1
20030114108 Frecassetti et al. Jun 2003 A1
20030125040 Walton et al. Jul 2003 A1
20030125090 Zeira Jul 2003 A1
20030130012 Brunner et al. Jul 2003 A1
20030139194 Onggosanusi et al. Jul 2003 A1
20030161282 Medvedev et al. Aug 2003 A1
20030162566 Shapira et al. Aug 2003 A1
20030165189 Kadous Sep 2003 A1
20030181165 Sugar et al. Sep 2003 A1
20030181171 Sim et al. Sep 2003 A1
20030185309 Pautler et al. Oct 2003 A1
20030190897 Lei et al. Oct 2003 A1
20030218973 Oprea et al. Nov 2003 A1
20040002364 Trikkonen et al. Jan 2004 A1
20040013212 Benesty et al. Jan 2004 A1
20040023621 Sugar et al. Feb 2004 A1
20040095907 Agee et al. May 2004 A1
20040171385 Haustein et al. Sep 2004 A1
20040184398 Walton et al. Sep 2004 A1
20050094598 Medvedev et al. May 2005 A1
Foreign Referenced Citations (6)
Number Date Country
2107989 Mar 1998 RU
2238611 Oct 2004 RU
2005100514 Jun 2005 RU
0145300 Jun 2001 WO
0203568 Jan 2002 WO
WO0203568 Jan 2002 WO
Related Publications (1)
Number Date Country
20040023621 A1 Feb 2004 US
Provisional Applications (3)
Number Date Country
60319437 Jul 2002 US
60479945 Jun 2003 US
60461672 Apr 2003 US