US 7,545,778 B2Grant
Apparatus for antenna diversity using joint maximal ratio combining
Issue Date:2009-06-09
•16 Claims
•14 Drawing Sheets
Abstract
A transceiver using composite beamforming technique is provided wherein a first communication device has a plurality of antennas and the second communication has a plurality of antennas. When the first communication device transmits to the second communication device, the transmit signal is multiplied by a transmit weight vector for transmission by each the plurality of antennas and the transmit signals are received by the plurality of antennas at the second communication device. The optimum transmit weight vector and receive weight vector for communication between the first and second communication devices is determined so that there is effectively joint or composite beamforming between the communication devices.
Metadata
Assignee
- IPR Licensing, Inc.
Inventors
- Gary L. Sugar
- Chandra Vaidyanathan
- Yohannes Tesfai
Application Information
Application Number:US 11/231,161
Filing Date:2005-09-20
Priority Date:2002-03-01
Art Unit:2618
Classifications
IPC:
H04B7/216
Patent Drawings (14 sheets)
Description
Cross Reference to Related Applications
[0001] This application is a continuation of U.S. application Ser. No. 10/695,229, filed Oct. 28, 2003, which is a continuation of U.S. application Ser. No. 10/174,728, filed Jun. 19, 2002, which issued on Feb. 3, 2004 as U.S. Pat. No. 6,687,492, which in turn claims priority to U.S. Provisional Application No. 60/361,055, filed Mar. 1, 2002 and to U.S. Provisional Application No. 60/365,797 filed Mar. 21, 2002, which are incorporated by reference as if fully set forth.
Field of the Invention
[0002] The present invention is directed to antenna (spatial) signal processing useful in wireless communication applications, such as short-range wireless applications.
[0003] Antenna diversity schemes are well known techniques to improve the performance of radio frequency (RF) communication between two RF devices. Types of antenna diversity schemes include antenna selection diversity and maximal ratio combining. An antenna selection diversity scheme selects one of two antennas for transmission to a particular communication device based on which of the two antennas best received a signal from the particular communication device. On the other hand, maximal ratio combining schemes involve beamforming a signal to be transmitted by two or more antennas by scaling the signal with an antenna weight associated with each antenna. A signal received by a plurality of antennas can also be weighted by a plurality of receive antenna weights. Selection of the antenna weights to optimize communication between two communication devices is critical to the performance of maximal ratio combining schemes.
[0004] There is room for improving the maximal ratio combining antenna processing schemes to optimize the link margin between two RF communication devices.
Summary
[0005] An antenna signal processing scheme, hereinafter called composite beamforming (CBF), is provided to optimize the range and performance RF communication between two communication devices. Composite beamforming (CBF) is a multiple-input multiple-output (MIMO) antenna scheme that uses antenna signal processing at both ends of the communication link to maximize the signal-to-noise (SNR) and/or signal-to-noise-plus-interference (SNIR), thereby improving the link margin between two communication devices, as well as to provide for other advantages described herein.
[0006] Generally, a first communication device has a plurality of antennas and the second communication has a plurality of antennas. The first communication device transmits to the second communication device using a transmit weight vector for transmission by each the plurality of antennas and the transmit signals are received by the plurality of antennas at the second communication device. The second communication device determines the receive weight vector for its antennas, and from that vector, derives a suitable transmit weight vector for transmission on the plurality of antennas back to the first communication device. Several techniques are provided to determine the optimum frequency dependent transmit weight vector and receive weight vector across the bandwidth of a baseband signal transmitted between the first and second communication devices so that there is effectively joint or composite beamforming between the communication devices. The link margin between communication devices is greatly improved using the techniques described herein.
[0007] With the same antenna configuration, 2-antenna CBF (2-CBF) provides an SNR improvement of up to 10 dB over transmit/selection diversity when it is used at both ends of the link. A system design using 4 antennas at a first communication device and 2 antennas at a second communication device (hereinafter referred to as 4×2 CBF) provides nearly 14 dB of SNR improvement. In general, for a fixed number of antennas, CBF outperforms the well-known space-time block codes by up to 4 dB. Moreover, unlike space-time coding, CBF does not require a change to an existing wireless standard.
[0008] 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
[0009] FIG. 1 is a block diagram of two communication devices performing an antenna diversity scheme using composite beamforming.
[0010] FIG. 2 is a block diagram of a communication device that may be used at either end of a composite beamforming communication link.
[0011] FIG. 3 is a flow chart illustrating an adaptive method to obtain antenna beamforming weights for communication between first and second communication devices.
[0012] FIGS. 4 and 5 are graphical diagrams illustrating convergence properties of the adaptive method shown in FIG. 3 .
[0013] FIG. 6 is a diagram showing application of beamforming weights to a baseband signal for transmission in a frequency dependent communication channel.
[0014] FIG. 7 is a flow chart illustrating an adaptive algorithm to obtain antenna beamforming weights in a frequency dependent communication channel.
[0015] FIG. 8 is a block diagram of a composite beamforming transmission process for a multi-carrier baseband modulation scheme.
[0016] FIG. 9 is a block diagram of a composite beamforming reception process for a multi-carrier baseband modulation scheme.
[0017] FIG. 10 is a block diagram of a composite beamforming transmission process for a single carrier baseband modulation scheme.
[0018] FIG. 11 is a block diagram of a composite beamforming reception process for a single carrier baseband modulation scheme.
[0019] FIG. 12 is a flow chart of a beamforming training method where one communication device of a communication link uses antenna selection diversity.
[0020] FIG. 13 is a flow chart illustrating a collaborative method to obtain antenna processing parameters for communication between first and second communication devices.
Detailed Description of the Drawings
[0021] Referring first to FIG. 1 , a system 10 is shown in which a first communication device 100 and a second communication device 200 communicate with each other using radio frequency (RF) communication techniques. The techniques described herein are useful in any radio frequency (RF) communication application, such as short-range wireless applications. A wireless local area network (WLAN) is only an example of an application. For example, device 100 may be an access point (AP) in a WLAN, and device 200 may be a station (STA).
[0022] Generally, the device 100 has Nap antennas 110 and the device 200 has Nsta antennas 210. FIG. 1 shows an example where the device 100 has three antennas 110 and the device 200 has two antennas 210. A complex transmit symbol s at device 100 is scaled (multiplied) using a set of complex transmit antenna weights wtx,ap=[w0 . . . wNap−1]T before being transmitted through respective ones of the antennas 110 (T denotes the transpose operator). The received vector at device 200 is rsta=sH wtx,ap+n, where H is an Nsta by Nap channel matrix of unity variance, complex Gaussian random variables (to represent flat Rayleigh fading between each antenna), and n represents noise and interference. At device 200, a combiner C=(wrx,sta)Hr is applied; C is passed to a detection circuit (e.g., soft-decision QAM detector, etc.). If H is known at both the transmitter and the receiver, wtx,ap and wrx,sta may be selected to maximize the signal-to-noise ratio (SNR) at the output of the combiner subject to a transmit power constraint, i.e., (wtx,ap)H wtx,ap=1.
[0023] The SNR for C is maximized over wtx,ap and wrx,sta when wtx,ap is equal to emax, the unit norm eigenvector for the maximum eigenvalue λmax of the matrix HHH, and wrx,sta is a matched filter for Hemax, i.e., wrx,sta=k Hemax for some nonzero constant k. Under these conditions, the SNR for C is equal to λmax. Since H is a random matrix, λmax is a random variable. The distribution on λmax is well known, and can be found in M. Wennstrom, M. Helin, A. Rydberg, T. Oberg, “On the Optimality and Performance of Transmit and Receive Space Diversity in MIMO Channels”, IEEE Technical Seminar on MIMO Systems, London, December, 2001, which is incorporated herein by reference.
[0024] The transmit device and the receive device communicate using time-division-duplexing at the same frequency. The channel matrix for the reverse link is Hr=HT, and the optimum transmit weight vector wtx,ap is equal to the eigenvector for the maximum eigenvalue of HrHHr=H*HT (* denotes the conjugate operator). The maximum SNR at either end of the link is the same (since it is a well known result that the nonzero eigenvalues for both H*HT and HHH are the same). The beamforming technique that results from this analysis is hereinafter referred to as composite beamforming (CBF).
[0025] 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. 2 . 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 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. 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 protocol standards, not necessarily used in a WLAN.
[0026] 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) 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.
[0027] 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., 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.
[0028] Turning to FIG. 3 , a process 400 is shown for achieving optimum CBF between two communication devices. To restate the results from the previous discussion, the optimum receive and transmit weights at the AP are given by wrx,ap=emax(of HHH), wtx,ap=wrx,ap*. The optimum receive and transmit weights at the STA are given by wrx,sta=emax(of H*HT), wtx,sta=wrx,sta*. Additionally, wrx,sta=H wtx,ap, wrx,ap=HT wtx,ap. These properties can be utilized to design an adaptive/iterative algorithm that converges to the optimum eigenvector as follows.
[0029] Initially, in step 410, the AP uses an arbitrary set of transmit antenna weights to transmit a signal to the STA. When the STA receives the signal, the receive antenna weights at the STA are matched to the receive signal such that wrx,sta(0)=H wtx,ap(0). That is, the STA receive antenna weights are computed from the received signals at each of the antennas by matching to the received signals. In step 420, the STA computes the conjugate of the receive weight vector made up of the receive antenna weights for use as the transmit antenna weight vector for transmitting on the STA's antennas back to the AP. The AP receives the signal transmitted by the plurality of antennas of the STA and matches the receive antenna weights to the received signal.
[0030] In step 430, the AP updates the new transmit antenna weights by computing the conjugate of the receive weight vector (comprised of the AP receive antenna weights) divided by the norm of the AP receive weight vector. This process repeats in steps 440 through 460, ad infinitum. It can be shown that the weights converge to the eigenvector corresponding to the maximum eigenvalue. See G. Golub, C. V. Loan, “Matrix Computations”, 2nd edition, pp. 351.
[0031] Within a few iterations, the transmit weight vector and receive antenna weight vector of both devices will converge to values that optimize the SNR at each of the devices. At such point, the first communication device may store in a memory (in the baseband section or host processor section) the current optimum transmit antenna weights for a particular destination communication device indexed against an identifier for that communication device. The first communication device, such as an AP, may store in a look-up-table optimum transmit antenna weights indexed against corresponding identifiers (such as MAC addresses) for a plurality of other communication devices it communicates with.
[0032] The adaptive process of FIG. 3 will converge to optimum antenna weights even if one device has multiple antennas and can weight signals supplied thereto, and the other device is a merely a single antenna device. The device on the link with the multiple antennas and combining capability can still converge to its optimum transmit and receive weights for a single antenna device it communicates with.
[0033] With reference to FIGS. 4 and 5 , the convergence properties of the adaptive algorithm were studied over 1000 randomly generated channels. The average SNR at each receive antenna was set to 10 dB. The normalized antenna array gain at the output of the receive antenna array, |Hwtx|2/λmax(HHH) is used to study the performance. In FIG. 4 , (Nap=2, Nsta=2), it is shown that the adaptive algorithm loss is less than a 1 dB at the 3rd iteration with 95% probability. When the number of antenna elements is increased to four, only one additional iteration was required for the algorithm converge to less than 1 dB loss with 95% probability.
[0034] An advantage of adaptive composite beamforming is that no special training sequence is required for adaptation. In addition, no changes to existing protocols are necessary, and there is no impact on throughput. The antenna weights are updated when real information or data is transmitted between devices. Transmit and receive weight adaptation is the same regardless of whether CBF is implemented at both ends of the link. However, if the destination device uses selection diversity the performance can be improved by estimating the channel response.
[0035] The indoor wireless channel is a frequency dependent channel. Due to multi-path propagation the signal arrives at the receiver with different delays. The different delays cause the channel transfer function to be frequency selective. Therefore, to account for these delays, the antenna weights need to be adjusted according to the frequency dependent characteristics of the channel transfer function between the transmitting device and the receiving device.
[0036] Solutions for optimum antenna processing in a frequency selective channel are described hereinafter. Between any two communication devices, the communication channel will have a frequency response depending on frequency selective fading conditions, etc. The channel transfer function H(f) describes the frequency response and is used to select the optimum antenna transmit and receive weights for communication between those terminals.
[0037] To understand the frequency selective situation, reference is again made to FIG. 1 , where the frequency dependent Nsta by Nap transfer function between the first and communication device and the second communication devices is denoted by the H(f). The Nap by Nsta transfer function between the second communication device and the first communication device is HT(f). The transmit weights at the first and second communication devices are denoted by the Nap×1 vector wtx,ap(f) and the Nsta×1 vector wtx,sta(f) respectively.
wtx,ap(f)=[wtx,ap,1(f), wtx,ap,2(f), . . . wtx,ap,Nap(f)]T
wtx,sta(f)=[wtx,sta,1(f), wtx,sta,2(f), . . . wtx,sta,Nsta(f)]T
wtx,ap(f)=[wtx,ap,1(f), wtx,ap,2(f), . . . wtx,ap,Nap(f)]T
wtx,sta(f)=[wtx,sta,1(f), wtx,sta,2(f), . . . wtx,sta,Nsta(f)]T
[0038] The receive weights at the first and second communication devices are denoted by the Nap×1 vector wrx,ap(f) and the Nsta×1 vector wrx,sta(f), respectively
wrx,ap(f)=[wrx,ap,1(f), wrx,ap,2(f), . . . wrx,ap,Nap(f)]T
wrx,sta(f)=[wrx,sta,1(f), wrx,sta,2(f), . . . wrx,sta,Nsta(f)]T
wrx,ap(f)=[wrx,ap,1(f), wrx,ap,2(f), . . . wrx,ap,Nap(f)]T
wrx,sta(f)=[wrx,sta,1(f), wrx,sta,2(f), . . . wrx,sta,Nsta(f)]T
[0039] The transmit and receive weights (only the first communication device-second communication device link is described below but the results apply in the reverse direction with appropriate change in notation) are computed by optimizing a cost function, C, with a constraint on the maximum transmit power. In a communication system, the ultimate goal is to reduce bit-error rate (BER).
[0040] However, optimization using the BER as a cost function is not always analytically feasible. Therefore, cost functions that implicitly reduce the BER are usually selected. The cost function also depends on the receiver structure. Selection of the cost function for different modulation schemes and receiver structures is discussed.
[0041]
[0042] For a code division multiple access (CDMA) communication system, such as IEEE 802.11b, the receiver is assumed to be a RAKE receiver and the BER is a function of the SNIR (signal to noise+interference ratio) at the output of the RAKE receiver. Maximizing the SNIR at the output of the RAKE receiver minimizes the BER.
[0043]
[0044] For an orthogonal frequency division multiplex (OFDM) system, such as IEEE 802.11a, the receiver is a linear equalizer followed by a Viterbi decoder. Since the Viterbi decoder is a non-linear operator, optimizing the coded BER is very challenging. An alternative is to minimize the mean square error (MSE) at the output of the linear equalizer (note another possible approach is to minimize the uncoded BER).
[0045]
[0046] A single carrier modulation scheme, such as IEEE 802.11b, uses a decision feedback equalizer (DFE) at the receiver. The receiver is a non-linear receiver. The transmit, receive and feedback weights are computed jointly. This can be achieved by minimizing the MSE at the output of the DFE.
[0047]
[0048] For all cases considered, the optimum transmit weights are given by
wtx— ap(f)=p(f)emax(HH(f)H(f))
wtx
[0049] where emax is the eigenvector corresponding to the maximum eigenvalue of the matrix HH(f) H(f), where p(f) is a weighting function that weights each individual frequency bin and is based on the cost function. Typically, the solution to p(f) follows a waterpouring distribution.
[0050] For the linear equalizer case, the solution is given by
[0051]
[0052] For the DFE case, the solution is
[0053]
[0054] where μ is selected to satisfy the power constraint
[0055]
[0056] An optimal solution for p(f) requires knowledge of the channel and SNR at the receiver. A suboptimal solution is obtained by setting p(f) to a constant, p, across frequency.
wtx— ap(f)=p emax(HH(f)H(f))
wtx
[0057] This is referred to herein as a frequency shaping constraint. To explain further, the frequency shaping constraint 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 is equal to a constant value, 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.
[0058] This solution does not require knowledge of the receiver SNR and simulations have shown that the loss in performance over the optimal solution is negligible. However, this solution requires knowledge of the channel response at the transmitter.
[0059] For the cost functions maximizing the SNIR or minimizing the MSE for a linear equalizer, the optimum receive weights are given by
wrx,sta(f)=Rss−1(f)vmf,sta(f)
wrx,sta(f)=Rss−1(f)vmf,sta(f)
[0060] where vmf,sta(f) is matched to the received signal
vmf,sta(f)=H(f)wtx,ap(f)
and Rss(f) is the correlation matrix defined as
vmf,sta(f)=H(f)wtx,ap(f)
and Rss(f) is the correlation matrix defined as
[0061]
[0062] When the MSE of the DFE is the minimized, the optimum receive weights are given by
wrx,sta(f)=Rss−1(f)vmf,sta(f)(1+B(f))
wrx,sta(f)=Rss−1(f)vmf,sta(f)(1+B(f))
[0063] where B(f) is the feedback filter.
[0064] The weights for the reverse link are similar to the forward link and is summarized below. The optimum transmit weights at the second communication are given by
wtx— sta(f)=p(f)emax(H*(f)HT(f))
and the suboptimal transmit weights are
wtx— sta(f)=p emax(H*(f)HT(f))
wtx
and the suboptimal transmit weights are
wtx
[0065] Similarly, the receive weights at the first communication device are given by
wrx,ap(f)=Raa−1(f)vmf,ap(f)
where
vmf,ap(f)=HT(f)wtx,sta(f)
wrx,ap(f)=Raa−1(f)vmf,ap(f)
where
vmf,ap(f)=HT(f)wtx,sta(f)
[0066] and for DFE case
Raa(f)=σs2vmf,ap(f)vmf,apH(f)+σn2I
wrx,ap(f)=Rxx−1(f)vmf,ap(f)(1+B(f))
Raa(f)=σs2vmf,ap(f)vmf,apH(f)+σn2I
wrx,ap(f)=Rxx−1(f)vmf,ap(f)(1+B(f))
[0067] In the presence of co-channel interference Rss(f) is given by
[0068]
[0069] where the terms in the summation are the contribution due to the interferers. In this case, the optimum receive antenna weights minimize the contribution of the interferers and the noise. Therefore, in addition to diversity gain, optimum antenna combining at the receiver also provides interference suppression capability.
[0070] FIG. 6 illustrates how frequency selective beamforming weights are applied to a baseband signal. The baseband signal may be a single carrier signal or a multi-carrier signal. In either case, the baseband signal will have a bandwidth or spectrum. According to the composite beamforming (CBF) technique described herein, when communication device 100 transmits a signal to communication device 200, it applies (i.e., multiplies or scales) a baseband signal s to be transmitted by 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 variable k denotes the frequency dependent characteristic as explained further hereinafter.
[0071] The transmit weight vectors wtx,1 and wtx,2 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 varies 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 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 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.
[0072] 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.
[0073] The receiving communication device also weights the signals received at its antennas with a frequency dependent 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.
[0074] Generally, transmit weight vector wtx,1 comprises a plurality of transmit antenna weights wtx,1,i=β1,i(k)ejφ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 (up to N), 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.
[0075] The frequency shaping constraint described above may be imposed on the transmit weights for each antenna. As mentioned above, the constraint 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 a constant value, Ptx/K.
[0076] The relationship between transmit and receive weights are summarized below: The optimum receive and transmit weights at the first communication device are related as follows.
wtx,ap(f)=emax(HH(f)H(f)), vmf,sta(f)=H(f)wtx,ap(f)
wtx,ap(f)=emax(HH(f)H(f)), vmf,sta(f)=H(f)wtx,ap(f)
[0077] Similarly at the second communication device, the optimum receive and transmit weights are related as follows.
wtx,sta(f)=emax(H*(f)HT(f)), vmf,ap(f)=HT(f)wtx,sta(f)
Additionally,
vmf,ap(f)=wtx,ap*(f), vmf,sta(f)=wtx,ap*(f)
wtx,sta(f)=emax(H*(f)HT(f)), vmf,ap(f)=HT(f)wtx,sta(f)
Additionally,
vmf,ap(f)=wtx,ap*(f), vmf,sta(f)=wtx,ap*(f)
[0078] The properties outlined above can be utilized in an adaptive/iterative process 480 shown in FIG. 7 that is similar to the process shown in FIG. 3 . The antenna weight parameters in FIG. 4 are written with indexes to reflect communication between an AP and a STA, but without loss of generality, it should be understood that this process is not limited to a WLAN application, and is useful in any wireless application, such as a short-range application. The AP has Nap antennas and the STA has Nsta antennas. Assuming the AP begins with the first transmission to the STA, the initial AP transmit weight vector wT,AP,0(k) is [1,1, . . . 1], normalized by 1/(Nap)/1/2 for all antennas and all frequency sub-bands/sub-carriers k. Phase for the transmit antenna weights are 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. In step 482, a baseband signal is scaled by the initial AP transmit weight vector wT,AP,0(k), upconverted and transmitted to the STA by the Nap antennas. The transmitted signal is effectively altered by the frequency selective 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 484, the STA normalizes the receive weight vector wR,STA,0(k) and computes the conjugate of normalized receive weight vector to generate the STA's initial transmit weights for transmitting a signal back to the AP. In step 486, the STA processes the signal to be transmitted to the AP by the initial transmit weight vector, upconverts that signal and transmits it to the AP. The transmitted signal is effectively altered by the frequency selective 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 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 as shown by steps 488 and 490, 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.
[0079] When storing the transmit weights of a frequency 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.
[0080] With reference to FIG. 8 , a beamforming transmission process 500 is shown for a multi-carrier baseband modulation scheme. For an orthogonal frequency division multiplexed (OFDM) system used, for example, by the IEEE 802.11a standard, 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. Each of the N antennas has a transmit antenna weight wtx that is a function of k, i.e., wtx(k) over k=1 to K. The transmit antenna weights are computed by any of the processes described above 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 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 is 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 values may vary as a function of the sub-carrier frequency k. The frequency shaping constraint described above can also be applied to the antenna weights.
[0081] FIG. 9 shows a beamforming reception process 600 that is essentially the inverse of the transmission process 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 is 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).
[0082] FIGS. 10 and 11 show transmission and reception processes, respectively, for frequency dependent beamforming applied 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 in the time domain. FIG. 10 shows a beamforming transmission process 700 suitable for a single carrier modulation scheme. Since in a frequency dependent channel, the transmit antenna weights are frequency dependent, the passband of the baseband signal is synthesized into frequency bins (K bins) and transmit beamforming weights are computed for each frequency bin using any of the processes described above. 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 selective antenna weight 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. The frequency shaping constraint described above can also be applied to the antenna weights.
[0083] FIG. 11 shows a reception process 800 suitable for a single carrier modulation scheme. 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 several frequency sub-bands. Receive filters 830 are synthesized with the frequency response specified by the 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.
[0084] Referring next to FIG. 12 , a procedure is shown 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.
[0085] When the 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.
[0086] The sequence consists of 2 data units (such as an IEEE 802.11 MSDU ideally containing data that is actually meant for the STA so as not to incur a loss in throughput). In step 900, the first communication device sends the first data unit using the Tx weight vector [1 0 . . . 0]T. That is, the first communication device sends the first data unit exclusively by one of its N antennas. In step 910, the second communication device responds by transmitting a message using one of its' two antennas. The first device decodes the message from the second device, and obtains one row of the H matrix (such as the first row hr1). In step 920, the first device sends the second MSDU using a weight vector which is orthogonal to the first row of H (determined in step 910). When the second device receives the second MSDU, in step 930, standard selection diversity logic forces it to transmit a response message in step 930 using the other antenna, allowing the first device to see the second row of the H matrix, hr2. Now the first device knows the entire H matrix. The first device then decides which row of the H matrix will provide “better” MRC at the second device 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 transmit weight vector for further transmissions to that device until another change is detected in the channel.
[0087] For the frequency sensitive case, the process shown in FIG. 11 is repeated at each of a plurality of frequency sub-bands that span the bandwidth of a single carrier baseband signal to be communicated between the devices, or at each of the sub-carrier frequencies of a multi-carrier baseband signal to be communication between the devices.
[0088] Turning to FIG. 13 with continued reference to FIG. 1 , a method is described for a collaborative approach for maintaining channel response information at one communication device for transmission with another communication device. Initially, in step 1000, one communication device determines which other communication devices are CBF-capable using a special CBF-capability request message. For example, this message is sent by an AP whenever a new STA associates with the AP. Non-CBF-capable devices will not respond to the message since they will not recognize it without CBF capability. Once it has confirmed CBF capability, whenever a CBF-capable device (AP or STA) sends information to the other device, in step 1010, a CBF training sequence is generated and appended to a data unit. For example, in the context of IEEE 802.11x, when a directed media access control (MAC) Protocol Data Unit (MPDU) to another CBF-capable terminal, it appends a small (2*N orthogonal frequency division multiplexed (OFDM) symbols, N=the number of antennas of the transmitting device) CBF training sequence containing channel response information at the end of the MPDU data segment. For example, the CBF training sequence may comprise N consecutive 2-symbol long preamble sequences as defined in 802.11a. These N sequences are multiplied by respective ones of N linearly independent vectors that span the column matrix of the channel response matrix. Such N linearly independent vectors may be, for example, the transmitted using the transmit weight vectors [1 0 . . . 0]T, [0 1 0 . . . 0]T, . . . , [0 0 . . . 1]T. These vectors essentially cause individual sequences to be transmitted exclusively on separate ones of the antennas, and nevertheless produce a column vector of the channel response matrix H at the receiving terminal. The CBF training sequence is appended to the MPDU and transmitted to the destination communication device in step 1020. The transmitting terminal uses the optimum transmit weight vector when transmitting all other portions of the MPDU.
[0089] In step 1030, the destination device receives and decodes the normal portion of the incoming MPDU using a matched filter derived using the long preamble at the beginning of the incoming burst to determine the optimum phase and gain relationships on each receive antenna. Also, in step 1040, the destination device updates the transmit weight vector to use when transmitting to the source device (including the ACK to the incoming MPDU, for example) using the channel response matrix H derived from the CBF training sequence.
[0090] For example, suppose there are three antennas at the AP and two antennas at the STA. The CBF training sequence that the AP sends to the STA is transmitted using the transmit weight vectors [1 0 0]T, [0 1 0]T and [0 0 1]T. The channel response H vector between these two devices is a 2×3 matrix defined as [h11 h12]T, [h21 h22]T and [h31 h32]T. When these transmit weight vectors are applied to the symbol s and transmitted, the result is s[h11 h12]T, s[h21 h22]T and s[h31 h32]T. Therefore, the column vectors [h11 h12]T, [h21 h22]T and [h31 h32]T of the H matrix can be computed by dividing each receive vector ([r11 r12]T, [r21 r22]T and [r31 r32]T,, the receive output of the antennas at the STA) by s since the transmit symbol s is known at the STA because the STA will know the symbols used by the AP for the training sequence.
[0091] Using the method described above, a communication device may store the optimum transmit weight vectors for each of the other communication devices it communicates with. For example, an AP maintains a table mapping the MAC address for each STA to the optimum Tx weight vector for that STA. CBF-capable STAs may also store a table of such information when supporting communication in a peer-peer or ad-hoc network. All transmit weight vectors may be initially set to [1 0 . . . 0]T.
[0092] For a 4-CBF scheme (4 antennas at the AP) using 1500 byte packets at 54 Mbps, the loss in throughput for the above approach is approximately 8%. The loss in throughput could be made smaller using the following enhancements: one symbol long preambles instead of 2 in the training sequence; use the channel response training sequence only when it is needed; and/or transmitting the training sequence during the IEEE 802.11 SIFS interval.
[0093] The training sequence scheme described above can be applied to generate frequency dependent antenna weights. Steps 1010 through 1030 are repeated for each of a plurality of frequencies. For example, in the multi-carrier signal case, steps 1010 through 1040 are repeated K times, for each sub-carrier frequency. Similarly, for a single carrier modulation scheme, the training sequence would be applied for each of a plurality of frequency sub-bands that span the bandwidth of the baseband signal to be transmitted. In addition, the transmit weights can be frequency shaped so that the sum of the power across all of the antennas at a given frequency is constant.
[0094] The antenna processing techniques described herein can be incorporated into devices in a variety of ways. For example, an RF chip can be built that supports 2 Tx/Rx antenna ports, and one baseband chip that supports 2× to 4×CBF. One RF chip together with one baseband chip can be used in a network interface card, and two RF chips together with one baseband chip can be used in an AP for a system that supports 4-CBF at an AP, and 2-CBF in a STA. This system will perform up to 12 dB better than current state-of-the-art system.
[0095] From simulations for 2-antenna selection diversity in an indoor office environment w/50 ns RMS delay spread, 8 dB (4 dB) SNR is required for 802.11a (802.11b) at the lowest data rate. Including 6 dB of additional path loss for 802.11a at 5 GHz, a total of 6+8−4=10 dB of additional received signal power is required for 802.11a. For a path loss coefficient of 3.3 (indoor environment), 10 dB of additional signal power corresponds to ½ the range.
[0096] In addition, the antenna processing schemes described herein help reduce the performance degradation caused by interference. It has been shown through simulations that the interference immunity for a CBF-enhanced 802.11b network is approximately 2.2 times that of a non-CBF network. In other words, a CBF enhanced communication between two devices permits an interference source to be 2.2 times close to a receiving device without degrading reception performance at that device.
[0097] To again summarize, the antenna processing techniques described above provide up to a 14 dB (25×) SNR improvement over existing 802.11a/b implementations without requiring a change to the communication protocol or standard. Moreover, compared to current 2-antenna implementations, these techniques provide nearly three times more range per AP; 7.3 times more coverage area; four times less infrastructure cost at a fixed throughput per user; 7-10 times less infrastructure cost when optimized for coverage; 5 times more throughput per user at a fixed infrastructure cost; normalized and improved range for dual-mode 802.11a/b networks; and better interference immunity and higher data rates. As much as 10 times fewer APs are required to support a similar coverage area when CBF-enhanced APs are used.
[0098] To summarize, a method is provided that accomplishes communication between a first communication device and a second communication device using radio frequency (RF) communication techniques, comprising steps of applying a transmit antenna vector to a baseband signal to be transmitted from the first communication device to the second communication device, the transmit antenna 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; 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 one or more signals received by the N plurality of antennas from the second communication device, 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 plurality of antennas of the first communication device for transmitting signals to the second communication device by computing a conjugate of the receive weight vector of the first communication device divided by a norm of the conjugate of the receive weight vector. This same method may be embodied in the form of instructions encoded on a medium or in a communication device.
[0099] Also provided is a method that accomplishes communication between a first communication device and a second communication device, comprising steps of transmitting a first signal by one of N plurality of antennas of the first communication device; receiving 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; transmitting a second signal by the plurality of antennas of the first communication device using a transmit weight vector that is orthogonal to the first row of the channel response matrix; receiving a second response signal transmitted by a second of the two antennas of the second communication device and deriving therefrom a second row of the channel response matrix; 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 same method may be embodied in the form of instructions encoded on a medium or in a communication device.
[0100] Still further provided is a method that accomplishes communication between first and second communication devices comprising steps of generating a training sequence comprising a sequence of N consecutive symbols, where N is a number of antennas of the first communication device, and the N symbols are multiplied by respective ones of N linearly independent vectors that span columns of a channel response matrix between the plurality of antennas of the first communication device and a plurality of antennas of the second communication device, thereby producing N transmit signals; transmitting the N transmit signals from the plurality of antennas of the first communication device; receiving the N transmit signals at each of a plurality of antennas at the second communication device; at the second communication device, deriving from signals received by the plurality of antennas the channel response matrix between the first communication device and the second communication device; and at the second communication device, generating a transmit weight vector from the channel response matrix for transmitting a signal from the second communication device to the first communication device using the plurality of antennas of the second communication device. This same method may be embodied in the form of instructions encoded on a medium or in a communication device.
[0101] The above description is intended by way of example only.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A radio communication transceiver in an orthogonal frequency division multiplexed (OFDM) system using k sub-carrier frequencies, comprising:
a symbol mapping device for mapping a baseband signal to a set of communication symbols;
N plurality of antennas, each antenna associated with a processing path;
each processing path configured to process communication symbols, comprising:
a multiplier configured to multiply the communication symbols with a plurality of complex transmit antenna weights selected for optimized transmission across the bandwidth, each complex transmit antenna weight a function of the k sub-carrier frequencies and having a magnitude and a phase;
whereby N transmit signals are generated, each of which is weighted such that at substantially all sub-carrier frequencies of the OFDM signal, the sum of the power of the transmit signals across the N plurality of antennas of the transceiver is equal to a constant.
2. The transceiver of claim 1 wherein the complex transmit antenna weights are determined without knowledge of signal to noise ratio (SNR) for another system device intended for receiving the N transmit signals.
3. The transceiver of claim 1, wherein the multiplier performs its operation in frequency domain.
4. The transceiver of claim 1, each processing path further comprising:
a buffer for storing the output values of the multiplier.
5. The transceiver of claim 1, each processing path further comprising:
an inverse Fast Fourier Transform (IFFT) device configured to convert frequency domain values into time domain for each subcarrier frequency.
7. The transceiver of claim 6, each processing path further comprising:
a digital to analog converter;
an upconverter configured to upconvert the output of the lowpass filter to an appropriate RF signal for transmission; and
a power amplifier configured to amplify the output of the upconverter.
9. The transceiver of claim 1, wherein the number of subcarriers is 52.
10. A radio communication transceiver in an orthogonal frequency division multiplexed (OFDM) system using k sub-carrier frequencies that receives a transmitted signal from a first transmitter, comprising:
M plurality of antennas, each antenna associated with a processing path;
each processing path configured to process communication symbols, comprising:
a multiplier configured to multiply the communication symbols with a plurality of complex receive antenna weights that vary with frequency, each complex receive antenna weight a function of sub-carrier frequency and having a magnitude and a phase; and
a symbol mapping device for mapping a set of communication symbols to a baseband signal;
whereby M receive signals are generated, each of which is weighted by a function of matching to the received signal and a correlation matrix corresponding to the transmitted signal, in which at substantially all sub-carrier frequencies of the OFDM signal, the sum of the power of the transmit signals across the N plurality of transmit antennas of the first transmitter is equal to a constant.
11. The transceiver of claim 10 wherein the complex receive antenna weights are further determined by a feedback filter.
12. The transceiver of claim 10, wherein the multiplier performs its operation in frequency domain.
13. The transceiver of claim 10, each processing path further comprising:
a downconverter configured to downconvert the transmitted signal to a time domain RF signal;
an analog to digital converter; and
a lowpass filter.
14. The transceiver of claim 10, each processing path further comprising:
a buffer for storing the time domain signal in slots associated with each k sub-carrier frequency.
15. The transceiver of claim 10, each processing path further comprising:
a Fast Fourier Transform (FFT) device configured to convert time domain values into frequency domain for each k sub-carrier frequency.
16. The transceiver of claim 1, each processing path further comprising:
a cyclic prefix discarding device.
Patent Citations (135)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4121221(A) | 1978-10-01 | Meadows | Applicant |
| US4599734(A) | 1986-07-01 | Yamamoto | Applicant |
| US4639914(A) | 1987-01-01 | Winters | Applicant |
| US5274844(A) | 1993-12-01 | Harrison et al. | Applicant |
| US5394435(A) | 1995-02-01 | Weerackody | Applicant |
| US5437055(A) | 1995-07-01 | Wheatley, III | Applicant |
| US5457808(A) | 1995-10-01 | Osawa et al. | Applicant |
| US5491723(A) | 1996-02-01 | Diepstraten | Applicant |
| US5493307(A) | 1996-02-01 | Tsujimoto | Applicant |
| US5507035(A) | 1996-04-01 | Bantz et al. | Applicant |
| US5539832(A) | 1996-07-01 | Weinstein et al. | Applicant |
| US5570366(A) | 1996-10-01 | Baker et al. | Applicant |
| US5577265(A) | 1996-11-01 | Wheatley, III | Applicant |
| US5610617(A) | 1997-03-01 | Gans et al. | Applicant |
| US5752173(A) | 1998-05-01 | Tsujimoto | Applicant |
| US5761193(A) | 1998-06-01 | Derango et al. | Applicant |
| US5761237(A) | 1998-06-01 | Petersen et al. | Applicant |
| US5812531(A) | 1998-09-01 | Cheung et al. | Applicant |
| US5848105(A) | 1998-12-01 | Gardner et al. | Applicant |
| US5854611(A) | 1998-12-01 | Gans et al. | Applicant |
| US5898679(A) | 1999-04-01 | Brederveld et al. | Applicant |
| US5912921(A) | 1999-06-01 | Warren et al. | Applicant |
| US5924020(A) | 1999-07-01 | Forssen et al. | Applicant |
| US5930248(A) | 1999-07-01 | Langlet et al. | Applicant |
| US5982327(A) | 1999-11-01 | Vook et al. | Applicant |
| US6008760(A) | 1999-12-01 | Shattil | Applicant |
| US6023625(A) | 2000-02-01 | Myers, Jr. | Applicant |
| US6037898(A) | 2000-03-01 | Parish et al. | Applicant |
| US6038272(A) | 2000-03-01 | Golden et al. | Applicant |
| US6044120(A) | 2000-03-01 | Bar-David et al. | Applicant |
| US6058105(A) | 2000-05-01 | Hochwald et al. | Applicant |
| US6064338(A) | 2000-05-01 | Kobayakawa et al. | Examiner |
| US6091934(A) | 2000-07-01 | Berman et al. | Applicant |
| US6097771(A) | 2000-08-01 | Foschini | Applicant |
| US6118788(A) | 2000-09-01 | Kermani | Applicant |
| US6122260(A) | 2000-09-01 | Liu et al. | Applicant |
| US6124824(A) | 2000-09-01 | Xu et al. | Applicant |
| US6128986(A) | 2000-10-01 | Tsuzaki et al. | Examiner |
| US6141393(A) | 2000-10-01 | Thomas et al. | Applicant |
| US6141567(A) | 2000-10-01 | Youssefmir et al. | Applicant |
| US6144651(A) | 2000-11-01 | Rinchiuso et al. | Applicant |
| US6144711(A) | 2000-11-01 | Raleigh et al. | Applicant |
| US6147985(A) | 2000-11-01 | Bar-David et al. | Applicant |
| US6157340(A) | 2000-12-01 | Xu et al. | Applicant |
| US6157843(A) | 2000-12-01 | Derango et al. | Applicant |
| US6177906(B1) | 2001-01-01 | Petrus | Applicant |
| US6185440(B1) | 2001-02-01 | Barratt et al. | Applicant |
| US6195045(B1) | 2001-02-01 | Xu et al. | Applicant |
| US6211671(B1) | 2001-04-01 | Shattil | Applicant |
| US6252548(B1) | 2001-06-01 | Jeon | Applicant |
| US6252884(B1) | 2001-06-01 | Hunter | Applicant |
| US6266528(B1) | 2001-07-01 | Farzaneh | Applicant |
| US6295026(B1) | 2001-09-01 | Chen et al. | Applicant |
| US6298092(B1) | 2001-10-01 | Heath, Jr. | Applicant |
| US6307882(B1) | 2001-10-01 | Marzetta | Applicant |
| US6317466(B1) | 2001-11-01 | Foschini et al. | Applicant |
| US6327310(B1) | 2001-12-01 | Hochwald et al. | Applicant |
| US6331837(B1) | 2001-12-01 | Shattil | Applicant |
| US6349219(B1) | 2002-02-01 | Hochwald et al. | Applicant |
| US6351499(B1) | 2002-02-01 | Paulraj et al. | Applicant |
| US6362781(B1) | 2002-03-01 | Thomas et al. | Applicant |
| US6369758(B1) | 2002-04-01 | Zhang | Applicant |
| US6370182(B2) | 2002-04-01 | Bierly et al. | Applicant |
| US6377631(B1) | 2002-04-01 | Raleigh | Applicant |
| US6377636(B1) | 2002-04-01 | Paulraj et al. | Applicant |
| US6377819(B1) | 2002-04-01 | Gesbert et al. | Applicant |
| US6400699(B1) | 2002-06-01 | Airy et al. | Applicant |
| US6400780(B1) | 2002-06-01 | Rashid-Farrokhi et al. | Applicant |
| US6442214(B1) | 2002-08-01 | Boleskei et al. | Applicant |
| US6462709(B1) | 2002-10-01 | Choi | Applicant |
| US6463295(B1) | 2002-10-01 | Yun | Applicant |
| US6473467(B1) | 2002-10-01 | Wallace et al. | Applicant |
| US6522898(B1) | 2003-02-01 | Kohno et al. | Applicant |
| US6549786(B2) | 2003-04-01 | Cheung | Applicant |
| US6570929(B1) | 2003-05-01 | Eriksson | Applicant |
| US6584161(B2) | 2003-06-01 | Hottinen | Applicant |
| US6636568(B2) | 2003-10-01 | Kadous | Applicant |
| US6646600(B2) | 2003-11-01 | Vail et al. | Applicant |
| US6684064(B2) | 2004-01-01 | Kazakevich et al. | Applicant |
| US6687492(B1) | 2004-02-01 | Sugar et al. | Examiner |
| US6728294(B1) | 2004-04-01 | Kohno et al. | Examiner |
| US6728517(B2) | 2004-04-01 | Sugar et al. | Applicant |
| US6792033(B1) | 2004-09-01 | Maruta et al. | Examiner |
| US6862271(B2) | 2005-03-01 | Medvedev et al. | Applicant |
| US6873606(B2) | 2005-03-01 | Agrawal et al. | Applicant |
| US6873651(B2) | 2005-03-01 | Tesfai et al. | Applicant |
| US6888878(B2) | 2005-05-01 | Prysby et al. | Examiner |
| US6901122(B2) | 2005-05-01 | Nadgauda et al. | Examiner |
| US6940917(B2) | 2005-09-01 | Menon et al. | Applicant |
| US6956907(B2) | 2005-10-01 | Ketchum | Applicant |
| US6965762(B2) | 2005-11-01 | Sugar et al. | Examiner |
| US6980600(B1) | 2005-12-01 | Ratnarajah | Examiner |
| US7031368(B1) | 2006-04-01 | Maruta et al. | Examiner |
| US7342875(B2) | 2008-03-01 | Hammons et al. | Examiner |
| US2001/0012764(A1) | 2001-08-01 | Edwards et al. | Applicant |
| US2001/0015994(A1) | 2001-08-01 | Nam | Applicant |
| US2001/0046255(A1) | 2001-11-01 | Shattil | Applicant |
| US2001/0053143(A1) | 2001-12-01 | Li et al. | Applicant |
| US2002/0001316(A1) | 2002-01-01 | Hornsby et al. | Applicant |
| US2002/0024975(A1) | 2002-02-01 | Hendler | Applicant |
| US2002/0034191(A1) | 2002-03-01 | Shattil | Applicant |
| US2002/0039884(A1) | 2002-04-01 | Raynes et al. | Applicant |
| US2002/0045435(A1) | 2002-04-01 | Fantaske | Applicant |
| US2002/0064246(A1) | 2002-05-01 | Kelkar et al. | Applicant |
| US2002/0067309(A1) | 2002-06-01 | Baker et al. | Applicant |
| US2002/0072392(A1) | 2002-06-01 | Awater et al. | Applicant |
| US2002/0085643(A1) | 2002-07-01 | Kitchener et al. | Applicant |
| US2002/0102950(A1) | 2002-08-01 | Gore et al. | Applicant |
| US2002/0111142(A1) | 2002-08-01 | Klimovitch | Applicant |
| US2002/0118781(A1) | 2002-08-01 | Thomas et al. | Applicant |
| US2002/0122383(A1) | 2002-09-01 | Wu et al. | Applicant |
| US2002/0122501(A1) | 2002-09-01 | Awater et al. | Applicant |
| US2002/0127978(A1) | 2002-09-01 | Khatri | Applicant |
| US2002/0136170(A1) | 2002-09-01 | Struhsaker | Applicant |
| US2002/0141355(A1) | 2002-10-01 | Struhsaker et al. | Applicant |
| US2002/0147032(A1) | 2002-10-01 | Yoon et al. | Applicant |
| US2002/0158801(A1) | 2002-10-01 | Crilly, Jr. et al. | Applicant |
| US2002/0159537(A1) | 2002-10-01 | Crilly, Jr. | Applicant |
| US2002/0172186(A1) | 2002-11-01 | Larsson | Applicant |
| US2002/0172269(A1) | 2002-11-01 | Xu | Applicant |
| US2002/0196842(A1) | 2002-12-01 | Onggosanusi et al. | Applicant |
| US2003/0002450(A1) | 2003-01-01 | Jalali et al. | Applicant |
| US2003/0022693(A1) | 2003-01-01 | Gerogiokas et al. | Applicant |
| US2003/0032423(A1) | 2003-02-01 | Boros et al. | Applicant |
| US2003/0048761(A1) | 2003-03-01 | Jarett | Applicant |
| US2003/0108117(A1) | 2003-06-01 | Ketchum et al. | Applicant |
| US2003/0114108(A1) | 2003-06-01 | Frecassetti et al. | Applicant |
| US2003/0125090(A1) | 2003-07-01 | Zeira | Applicant |
| US2003/0139194(A1) | 2003-07-01 | Onggosanusi et al. | Applicant |
| US2003/0157954(A1) | 2003-08-01 | Medvedev et al. | Applicant |
| US2003/0181165(A1) | 2003-09-01 | Sugar et al. | Applicant |
| US2004/0072546(A1) | 2004-04-01 | Sugar et al. | Applicant |
| US2004/0104839(A1) | 2004-06-01 | Valazquez et al. | Applicant |
| WO1/45300 | 2001-06-01 | Applicant | |
| WO2/03568 | 2002-01-01 | Applicant |
Non-Patent Literature (46)
- Iserte et al., “Pre-and Post-Beamforming in MIMO Channels Applied to HIPERLAN/2 and OFDM”, IST Summit 2001, IST Mobile Communications Summit, Sep. 2001.Applicant
- Iserte et al., “Joint Beamforming Strategies in OFDM-MIMO Systems”, ICASSP 2002, IEEE International Conference on Acoustics, Speech and Signal Processing, May 2002.Applicant
- Lee et al., “Antenna Diversity for an OFDM System in a Fading Channel”, Proceeding of IEEE MILCOM 1999, Nov. 1999, pp. 1104-1109.Applicant
- Jakes, “Microwave Mobile Communications”, Copyright 1974, pp. 313-320 and pp. 489-498.Applicant
- Jungnickel et al., “A MIMO WLAN Based on Linear Channel Inversion”, IEE Seminar-MIMO Communication Systems from Concept TO Implementation, Dec. 2001, pp. 20/1-20/6.Applicant
- Stridh et al., “Spatial Characterization of Indoor Radio Channel Measurements at 5 GHz”, SAM 2000, Mar. 2000, pp. 58-62.Applicant
- Irmer et al., “MISO Concepts for Frequency-Selective Channels”, 2002 International Zurich Seminar on Broadband Communications Access, Feb. 19-21, 2002.Applicant
- Choi et al., “MISO CDMA Transmission with Simplified Receiver for Wireless Communication Handsets”, IEEE Transactions on Communications, vol. 49, No. 5, May 2002.Applicant
- Meyer-Ottens, et al. “Downlink Beamforming for W-CDMA Using Feedback and Interference Estimate”, Mar. 9, 2001.Applicant
- Yang et al., “On Joint Transmitter and Receive Optimization for Multiple-Input-Multiple-Output (MIMO) Transmission Systems”, IEEE Transactions on Communications, vol. 42, No. 12, Dec. 1994.Applicant
- Ivrlac et al., “On Channel Capacity of Correlated MIMO Channels”, ITG Fokusprojekt: Mobilkommunikation “Systeme mit Intelligenten Antennen”, Ilmenau, 2001.Applicant
- Chuah et al., “Capacity of Multi-Antenna Array Systems in Indoor Wireless Environment”, Nov. 1998, IEEE Globecom.Applicant
- Wallace et al., “Experimental Characterization of the MIMO Wireless Channel: Data Acquisition and Analysis”, Feb. 27, 2002, Department of Electrical and Computer Engineering, Brigham Young Universtiy.Applicant
- Love et al., “Equal Gain Transmission in Multiple-Input Multiple-Output Wireless Systems”, Nov. 2002, Proceedings of IEEE Globecom, pp. 1124-1128.Applicant
- “BLAST High-Level Overview”, Lucent Technologies, Jul. 18, 2000.Applicant
- “Lucent's ‘BLAST’ Chips to Take Off in Wireless”, EETimes.com, Oct. 16, 2002.Applicant
- Ariyavisitakul et al., “Optimum Space-Time Processors With Dispersive Interference—Unified Analysis And Required Filter Span”, 1999 IEEE International Conference On Communications, vol. 2, pp. 1244-1249, (1999).Applicant
- Aziz et al., “Indoor Throughput and Range Improvements Using Standard Complaint AP Antenna Diversity in IEEE 802.11a and ETSI HIPERLAN/2”, Vehicular Technology Conference, 2002, VTC 2001, Oct. 7-11, 2001, IEEE VTS 54th , vol. 4, pp. 2294-2298.Applicant
- Bablan et al., “Optimum Diversity Combining and Equalization in Digital Data Transmission with Applications to Cellular Mobile Radio-Part II: Numerical Results”; May 1992; IEEE Transactions on Communications, vol. 30, No. 5; pp. 895-907.Applicant
- Briesemeister et al., “Role-Based Multicast in Highly Mobile but Sparsely Connect Ad-Hoc Networks”; First Annual Workshop on Mobile Ad Hoc Networking & Computing; pp. 45-50; Aug. 2000.Applicant
- Brunner et al., “Downlink Beamforming for WCDMA Based on Uplink Channel Parameters”; Proceedings of 3rd European Personal Mobile Conference (EPMCC '99), Mar. 1999, pp. 375-380.Applicant
- Chiu et al., “OFDM Receiver Design”, EE225C, Fall 2000, University of California, Berkeley.Applicant
- Chizhik et al., “Keyholes, Correlations, and Capacities of Multielement Transmit and Receiver Antennas”, IEEE Transactions on Wireless Communications, vol. 1, No. 2, Apr. 2002, pp. 361-368.Applicant
- Golden et al., “Detection Algorithm and Initial Laboratory Results Using V-BLAST Space-Time Communication Architecture”, Electronic Letters, Jan. 7, 1999, vol. 35, No. 1.Applicant
- Golden et al., “V-BLAST: A High Capacity Space-Time Architecture for the Rich-Scattering Wireless Channel”, Bell Laboratories, Lucent Technologies, Proc. Int'l Symposium on Advanced Radio Technologies, Boulder, CO, Sep. 10, 1998.Applicant
- Golub et al., Matrix Computation, “7.3 Power Iterations”, The Johns Hopkins University Press, Second Edition, pp. 351, (1983).Applicant
- Heath et al., “A Simple Scheme for Transmit Diversity Using Partial Channel Feedback”, Signals, Systems & Computers, Conference Record of the Thirty-Second Asilomar Conference, Nov. 1-4, 1998; vol. 2; pp. 1073-1078.Applicant
- Iserte et al., “Iterative Algorithm for the Estimation of Distributed Sources Localization Parameters”, SSP 2001, 11th IEEE Workshop on Statistical Signal Processing, Aug. 2001.Applicant
- Jungnickel et al., “Performance of a MIMO System with Overlay Pilots”, IEEE GlobeCom 2001, pp. 594-598.Applicant
- Junqiang et al., “Spatial Multiuser Access with MIMO Smart Antennas for OFDM Systems”, IEEE VTC 2001, Sep. 2001, pp. 1553-1557.Applicant
- LAN MAN Standards Committee Of The IEEE Computer Society, “Information Technology—Telecommunications And Information Exchange Between Systems—Local And Metropolitan Area Networks—Specific Requirements—Part 11: Wireless LAN Medium Access Control (MAC) And Physical Layer (PHY) Specifications”, ANSI/IEEE Std 802.11, 1999 Edition (R2003), Reaffirmed Jun. 12, 2003).Applicant
- Li et al., “Adaptive Antenna Arrays For OFDM Systems With Cochannel Interference”, IEEE Transactions On Communications, vol. 47, No. 2, pp. 217-229, (Feb. 1999).Applicant
- Lucent Technologies, “Lucent Technologies: Chips Poised to Bring ‘BLAST’ Multiple Input/Multiple Output Technology to Laptops, PDAs and Other Mobile Devices”, Oct. 16, 2002, lucent.com.Applicant
- Morgan, “Interaction of Adaptive Antenna Arrays in an Arbitrary Environment”, The Bell System Technical Journal, Jan. 1965, pp. 23-47.Applicant
- Narula et al., “Efficient Use Of Side Information In Multiple-Antenna Data Transmission Over Fading Channels”, IEEE Journal On Selected Areas In Communications, vol. 16, No. 8, pp. 1423-1436, (Oct. 1998).Applicant
- Onggosanusi et al., “Performance Analysis Of Closed-Loop Transmit Diversity In The Presence Of Feedback Delay”, IEEE Transactions On Communications, vol. 49, No. 9, pp. 1618-1630, (Sep. 2001).Applicant
- Raleigh et al., “Spatio-Temporal Coding for Wireless Communication”, IEEE Transactions on Communications, vol. 46, No. 3, Mar. 1998, pp. 357-366.Applicant
- Sanchez et al., “CSMA/CA Beam Forming Antennas in Multi-hop Packet Radio”; Proc. For Swedish Workshop on Wireless Ad-Hoc Networks, Mar. 5-6, 2001.Applicant
- Stridh et al., “MIMO Channel Capacity on a Measured Indoor Radio Channel at 5.8 GHz”, Proc. of the Asilomar Conf. on Signals, Systems & Computers, vol. 1, Oct. 2000, pp. 733-737.Applicant
- Vaidyanathan et al., “The Role In Lossless Systems in Modern Digital Signal Processing: A Tutorial”, IEEE Transactions on Education, vol. 32, Aug. 1989, pp. 181-197.Applicant
- Wennström et al., “On The Optimality And Performance Of Transmit And Receive Space Diversity In MIMO Channels”, IEEE Seminar on Communications Systems from Concept to Implementations, (Dec. 12, 2001).Applicant
- Wolniansky et al., “V-BLAST: An Architecture for Realizing Very High Data Rates Over the Rich-Scattering Wireless Channel”, Proc. ISSSE-98, Pisa, Italy, Sep. 29, 1998.Applicant
- Yang et al., “Joint Transmitter—Receiver Optimization For Multi-Input Multi-Output Systems With Decision Feedback”, IEEE Transactions On Information Theory, vol. 40, No. 5, pp. 1334-1347, (Sep. 1994).Applicant
- Yeh, “An Analysis of Adaptive Retransmission Arrays in a Fading Environment”, The Bell System Technical Journal, Oct. 1970, pp. 1811-1825.Applicant
- Brunner, et al., “Downlink Beamforming for WCDMA Based on Uplink Channel Parameters”, Proc. EPMCC 1999, pp. 375-380, Mar. 1999.Applicant
- “Lucent's ‘BLAST’ Chips to Take Off in Wireless Market”, Semiconductor Business News, Oct. 16, 2002.Applicant