# Patent

## Title
System and method for RF signal combining and adaptive bit loading for data rate maximization in multi-antenna communication systems

## Abstract

A system and method for generating weight values based on maximum data rate for weighting elements included within signal weighting and combining arrangements used in various multi-antenna transmitter and receiver structures is disclosed herein. Weighting values for a given signal combining arrangement are set so as to maximize an output data rate of the applicable multi-antenna system in the presence of adaptive bit loading of the subcarriers of a transmitted signal. The disclosed techniques may be employed to maximize a data rate of a multi-antenna communication system by using adaptive bit loading and RF and baseband weighting schemes. In this case a search is conducted over various combinations of RF and baseband weights in order to find the weight combination which, when adaptive bit loading is also employed, maximizes the data rate.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS/INCORPORATION BY REFERENCE
This application is a Continuation application of U.S. application Ser. No. 10/886,510, filed Jul. 7, 2004, now U.S. Pat. No. 7,983,355, issued Jul. 19, 2011, which claims the benefit of U.S. Provisional Application No. 60/485,915, filed Jul. 9, 2003, and claims the benefit of U.S. Provisional Application No. 60/491,128, filed Jul. 29, 2003, which are all herein incorporated by reference in their entirety.
This application is also related to the following: U.S. Provisional Application No. 60/456,023, filed Mar. 17, 2003; U.S. application Ser. No. 10/801,930, filed Mar. 16, 2004, now U.S. Pat. No. 7,822,140, issued Oct. 26, 2010; U.S. application Ser. No. 12/911,979, filed Oct. 26, 2010, now U.S. Pat. No. 8,693,577, issued Apr. 8, 2014; U.S. Provisional Application No. 60/467,295, filed May 1, 2003; U.S. application Ser. No. 10/835,255, filed Apr. 29, 2004, now U.S. Pat. No. 7,539,274, issued May 26, 2009; U.S. Application No. 12/472,202, filed May 26, 2009, now U.S. Pat. No. 8,023,601, issued Sep. 20, 2011; U.S. application Ser. No. 10/903,876, filed Jul. 29, 2004, now U.S. Pat. No. 7,535,969, issued May 19, 2009; U.S. application Ser. No. 12/468,722, filed May 19, 2009, now U.S. Pat. No. 7,869,537, issued Jan. 11, 2011; and U.S. application Ser. No. 13/004,160, filed Jan. 11, 2011, now U.S. Pat. No. 8,767,860, issued Jul. 1, 2014.


FIELD OF THE INVENTION
The present invention relates to communication systems utilizing transmitters and receivers having multiple antenna elements. More particularly, the present invention relates to a data rate maximization scheme using adaptive bit loading and RF-based signal weighting and combining, either exclusively or in combination with baseband signal weighting and combining, in connection with transmission and reception of signals using multi-antenna transmitters and receivers.
BACKGROUND OF THE INVENTION
Most current wireless communication systems are composed of nodes configured with a single transmit and receive antenna. However, for a wide range of wireless communication systems, it has been predicted that the performance, including capacity, may be substantially improved through the use of multiple transmit and/or multiple receive antennas. Such configurations form the basis of many so-called “smart” antenna techniques. Such techniques, coupled with space-time signal processing, can be utilized both to combat the deleterious effects of multipath fading of a desired incoming signal and to suppress interfering signals. In this way both the performance and capacity of digital wireless systems in existence or being deployed (e.g., CDMA-based systems, TDMA-based systems, WLAN systems, and OFDM-based systems such as IEEE 802.11a/g) may be improved.
The impairments to the performance of wireless systems of the type described above may be at least partially ameliorated by using multi-element antenna systems designed to introduce a diversity gain and suppress interference within the signal reception process. This has been described, for example, in “The Impact of Antenna Diversity On the Capacity of Wireless Communication Systems”, by J. H. Winters et al, IEEE Transactions on Communications, vol. 42, No. 2/3/4, pages 1740-1751, February 1994. Such diversity gains improve system performance by mitigating multipath for more uniform coverage, increasing received signal-to-noise ratio (SNR) for greater range or reduced required transmit power, and providing more robustness against interference or permitting greater frequency reuse for higher capacity.
Within communication systems incorporating multi-antenna receivers, it is known that a set of M receive antennas are capable of nulling up to M−1 interferers. Accordingly, N signals may be simultaneously transmitted in the same bandwidth using N transmit antennas, with the transmitted signal then being separated into N respective signals by way of a set of N antennas deployed at the receiver. Systems of this type are generally referred to as multiple-input-multiple-output (MIMO) systems, and have been studied extensively. See, for example, “Optimum combining for indoor radio systems with multiple users,” by J. H. Winters, IEEE Transactions on Communications, Vol. COM-35, No. 11, November 1987; “Capacity of Multi-Antenna Array Systems In Indoor Wireless Environment” by C. Chuah et al, Proceedings of Globecom '98 Sydney, Australia, IEEE 1998, pages 1894-1899 November 1998; and “Fading Correlation and Its Effect on the Capacity of Multi-Element Antenna Systems” by D. Shiu et al, IEEE Transactions on Communications vol. 48, No. 3, pages 502-513 March 2000.
One aspect of the attractiveness of multi-element antenna arrangements, particularly MIMOs, resides in the significant system capacity enhancements that can be achieved using these configurations. Under the assumption of perfect estimates of the applicable channel at the receiver, in a MIMO system with N transmit and N receive antenna elements, the received signal decomposes to N “spatially-multiplexed” independent channels. This results in an N-fold capacity increase relative to single-antenna systems. For a fixed overall transmitted power, the capacity offered by MIMOs scales linearly with the number of antenna elements. Specifically, it has been shown that with N transmit and N receive antennas an N-fold increase in the data rate over a single antenna system can be achieved without any increase in the total bandwidth or total transmit power. See, e.g., “On Limits of Wireless Communications in a Fading Environment When Using Multiple Antennas”, by G. J. Foschini et al, Wireless Personal Communications, Kluwer Academic Publishers, vol. 6, No. 3, pages 311-335, March 1998. In experimental MIMO systems predicated upon N-fold spatial multiplexing, more than N antennas are often deployed at a given transmitter or receiver. This is because each additional antenna adds to the diversity gain and antenna gain and interference suppression applicable to all N spatially-multiplexed signals. See, e.g., “Simplified processing for high spectral efficiency wireless communication employing multi-element arrays”, by G. J. Foschini, et al, IEEE Journal on Selected Areas in Communications, Volume: 17 Issue: 11, November 1999, pages 1841-1852.
Although increasing the number of transmit and/or receive antennas enhances various aspects of the performance of MIMO systems, the necessity of providing a separate RF chain for each transmit and receive antenna increases costs. Each RF chain is generally comprised of a low noise amplifier, filter, downconverter, and analog to digital to converter (A/D), with the latter three devices typically being responsible for most of the cost of the RF chain. In certain existing single-antenna wireless receivers, the single required RF chain may account for in excess of 30% of the receiver's total cost. It is thus apparent that as the number of transmit and receive antennas increases, overall system cost and power consumption may dramatically increase. It would therefore be desirable to provide a technique for utilizing relatively larger numbers of transmit/receive antennas without proportionately increasing system costs and power consumption.
The above-referenced copending non-provisional application Ser. No. 10/801,930 provides such a technique by describing a wireless communication system in which it is possible to use a smaller number of RF chains within a transmitter and/or receiver than the number of transmit/receiver antennas utilized. In the case of an exemplary receiver implementation, the signal provided by each of M (M>N) antennas is passed through a low noise amplifier and then split, weighted and combined in the RF domain with the signals from the other antennas of the receiver. This forms N RF output signals, which are then passed through N RF chains. The output signals produced by an A/D converter of each RF chain are then digitally processed to generate the N spatially-multiplexed output signals. By performing the requisite weighting and combining at RF using relatively inexpensive components, an N-fold spatially-multiplexed system having more than N receive antennas, but only N RF chains, can be realized at a cost similar to that of a system having N receive antennas. That is, receiver performance may be improved through use of additional antennas at relatively low cost. A similar technique can be used within exemplary transmitter implementations incorporating N RF chains and more than N transmit antennas.
The RF-based weighting techniques described in the above-referenced '930 non-provisional application advantageously enable the same type of combining of spatially weighted signals to be performed in the RF domain as is done at baseband. One advantage of these techniques is that RF weighting and combining may be performed using only N transmit and N receive RF chains, independent of the number of transmit and receive antennas. Furthermore, notwithstanding the fact that the '930 application describes RF-based weighting and combining, it remains possible to implement the digital signal processing schemes prior to conversion to analog/RF within the transmitter and subsequent to conversion to digital from analog/RF within the receiver. Such techniques may include successive interference cancellation in the case of MIMO systems (see, e.g., “V-BLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel,” in Proceedings of URSI ISSSE, September, 1998, pp. 295-300).
Although the techniques described in the '930 non-provisional application may not offer performance identical to baseband techniques in the case of temporal and/or frequency domain signal processing, it may still be preferable to employ such techniques as a result of the lower costs involved. Frequency domain processing is used in systems in which, for example, the transmitted signal consists of a number of frequency subcarriers. This type of signal processing is required to be performed when implementing systems based upon orthogonal frequency division multiplexing (OFDM), such as the wireless local area network systems popularly referred to simply as “802.11(a)” and “802.11(g)”. Alternatively, for the same or lower cost as is required by conventional approaches, the techniques of the '930 application may be employed to enable the use of a greater number of antennas, which may result in substantially superior performance relative to such conventional approaches.
In the above-referenced copending non-provisional application Ser. No. 10/835,255, techniques for generating RF-based weighting values designed to maximize an output signal-to-noise ratio of the receiver averaged over the applicable channel were presented. Although this performance measure may be suitable for application in systems in which frequency domain processing involves the use of the same modulation and coding for each subcarrier (e.g., in 802.11(a) systems), in many cases overall data rate may be increased by varying the modulation and coding employed among the various subcarriers. When such frequency domain processing is performed at baseband, it is known that the output data rate may be maximized by adaptive bit loading; see, e.g., “Adaptive bit loading for wireless OFDM systems,” A. N. Barreto and S. Furrer, International Symposium on Personal, Indoor and Mobile Radio Communications, 2001, September/October 2001, pages G-88-92, vol. 2. Consistent with the adaptive bit loading technique, the power at which each subcarrier is transmitted is scaled based on the channel gain (while maintaining the aggregate transmitted power constant) and the data rate in each subcarrier is adjusted to the maximum value attainable in view of a given performance measure characterizing the receiver (e.g., bit error rate). The set of baseband spatial weights associated with each subcarrier that are used during baseband processing computations are calculated independently of the bit loading parameters using closed-form expressions. Once these baseband spatial weights have been determined, calculation of adaptive bit loading parameters applicable to each transmitted subcarrier is then separately performed. See, e.g., “On implementation of bit-loading algorithms for OFDM systems with multiple-input multiple-output”, J. Gao and M. Faulkner, Proceedings of the IEEE Vehicular Technology Conference, 2002-Fall, pages 199-203, vol. 1.
Unfortunately, methods of calculating spatial weighting values independently of the bit loading parameters using closed-form expressions of the type described above are inapplicable to the cases described in the above-referenced copending non-provisional patent applications; that is, in cases in which signal weighting is performed exclusively in the RF domain or within both the RF and baseband domains.
SUMMARY OF THE INVENTION
The present invention is directed to a system and method for generating weight values based on maximum data rate for weighting elements included within the signal weighting and combining arrangements used in various multi-antenna transmitter and receiver structures. Specifically, the present invention may be applied to RF-based weighting and combining arrangements within multi-antenna transmitter and receiver structures disposed to process one or more information signals modulated upon respective pluralities of subcarrier signals. The present invention may also find application when both RF-based and baseband weighting and combining arrangements are incorporated within the same multi-antenna transmitter or receiver structure.
Consistent with the invention, the weighting values for a given signal combining arrangement are set so as to maximize an output data rate of the applicable multi-antenna system in the presence of adaptive bit loading of the subcarriers of a transmitted signal. The inventive weight generation method may be employed within several different types of multi-antenna communication systems including, for example, those described within the above-referenced copending non-provisional applications. In particular embodiments the inventive technique may be applied to a multi-antenna receiver within a “single channel” (SC) system (i.e., a system lacking spatial multiplexing), to a multi-antenna transmitter in a single channel system, or to the transmitter or receiver of a MIMO system employing spatial multiplexing.
As is described herein, the present invention may be employed to maximize a data rate of a multi-antenna communication system by using adaptive bit loading and RF and baseband weighting schemes. In this case a search is conducted over various combinations of RF and baseband weights in order to find the weight combination which, when adaptive bit loading is also employed, maximizes the data rate. This search may be performed globally or by using techniques such as simulated annealing.
In one aspect the present invention relates to an RF processing method practiced within a multi-antenna transmitter. In operation, the transmitter is disposed to transmit an RF input signal comprised of a plurality of subcarrier signals through a plurality of transmit antennas, thereby producing a corresponding plurality of RF output signals. The method includes adaptively bit loading the plurality of subcarrier signals in accordance with a corresponding plurality of bit loading values in order to form a corresponding plurality of bit-loaded subcarrier signals. The plurality of bit-loaded subcarrier signals are then converted into the RF input signal. The method further includes dividing the RF input signal in order to form a plurality of divided RF signals, which are then weighted in accordance with a corresponding plurality of transmit RF weighting values in order to form the plurality of RF output signals. Consistent with this aspect of the invention, the plurality of transmit RF weighting values and the plurality of bit loading values are selected so as to maximize an output data rate of the transmitter.
The invention is also directed to a signal weighting and combining method designed to be implemented within a receiver having a plurality of receive antennas disposed to produce a corresponding plurality of received RF signals. During operation of the receiver, the plurality of received RF signals are generated in response to a transmitted RF signal comprised of a plurality of subcarrier signals. The method includes weighting the plurality of received RF signals in accordance with a corresponding plurality of RF weighting values thereby forming a plurality of weighted RF signals. In this regard the RF weighting values are selected, and the plurality of subcarrier signals are bit-loaded, so as to maximize an output data rate. The method further includes combining ones of the plurality of weighted RF signals in order to form one or more combined RF signals.
In another aspect the invention pertains to an RF signal processing method capable of being implemented within a communication system including a multi-antenna transmitter. The transmitter is disposed to transmit multiple RF input signals, each of which is comprised of a plurality of subcarrier signals, through a plurality of transmit antennas so as to produce a corresponding plurality of spatially multiplexed RF output signal. The RF signal processing method includes adaptively bit loading the multiple pluralities of subcarrier signals in accordance with corresponding multiple pluralities of bit loading values in order to form corresponding multiple pluralities of bit-loaded subcarrier signals. The method further includes converting the multiple pluralities of bit-loaded subcarrier signals into the multiple RF input signals, which are then divided in order to form multiple pluralities of divided RF signals. The method also includes weighting the multiple pluralities of divided RF signals utilizing a set of transmit RF weighting values in order to form plural spatially-multiplexed weighted RF signals. In this regard the set of transmit RF weighting values and the multiple pluralities of bit loading values are selected so as to maximize an output data rate of the transmitter. Ones of the plural spatially-multiplexed weighted RF signals are then combined so as to form the plurality of spatially-multiplexed RF output signals.
The invention also relates to a signal weighting and combining method designed for implementation within a receiver having a plurality of receive antennas. During operation of the receiver, the plurality of receive antennas are disposed to produce a corresponding plurality of spatially multiplexed received RF signals in response to spatially multiplexed transmitted RF signal energy comprised of multiple pluralities of subcarrier signals. The method includes weighting the plurality of spatially multiplexed received RF signals in accordance with a corresponding plurality of receive RF weighting values, thereby forming a plurality of spatially multiplexed weighted RF signals. Consistent with the invention, the receive RF weighting values are selected, and the multiple pluralities of subcarrier signals are bit loaded, so as to maximize an output data rate. The method further includes combining ones of the plurality of spatially multiplexed weighted RF signals in order to form one or more spatially-multiplexed combined RF signals.



BRIEF DESCRIPTION OF THE DRAWINGS
For a better understanding of the nature of the features of the invention, reference should be made to the following detailed description taken in conjunction with the accompanying drawings, in which:
FIG. 1 illustratively represents a conventional MIMO communication system.
FIG. 2 shows a block diagram of a MIMO communication system having a transmitter and a receiver configured to effect RF-based weighting and combining.
FIG. 3 illustratively represents the transmitter and receiver structure of a SC-MIMO-OFDM system utilizing an RF weighting and combining arrangement and adaptive bit loading.
FIG. 4 illustratively represents the transmitter and receiver structure of a spatially-multiplexed (SM)-MIMO-OFDM system utilizing an RF weighting and combining arrangement and adaptive bit loading.



DETAILED DESCRIPTION OF THE INVENTION
As is discussed below, the present invention is directed to a method of weighting and combining based upon maximum data rate for use in multi-antenna systems, including N-fold spatially-multiplexed multi-antenna systems, configured to implement adaptive bit loading upon the subcarriers of the transmitted signal energy. In order to facilitate appreciation of the principles of the invention, an overview is provided of exemplary architectures for implementing weighting and combining within such multi-antenna systems. This overview is followed by a detailed description of the inventive method of weight generation, which may be applied within the context of such weighting and combining schemes.
I. Overview of Architecture for RF Weighting and Combining
The above-referenced non-provisional copending patent applications disclose a method and apparatus for use in a wireless communication system which permits a smaller number of RF chains to be used within a transmitter and/or receiver than the number of transmit/receiver antennas utilized. In an exemplary implementation of the disclosed system within a spatially-multiplexed MIMO communication arrangement, a number (N) of RF chains are used in support of N-fold spatial multiplexing.
In the disclosed system, the signal provided by each of M (M>N) antennas of a receiver is passed through a low noise amplifier and then split, weighted and combined in the RF domain with the signals from the other antennas of the receiver. This forms N RF output signals, which are then passed through N RF chains. In this exemplary implementation each RF chain includes a filter, downconverter, and A/D converter. The output signals produced by the A/D converter of each RF chain are then digitally processed to generate the N spatially-multiplexed output signals. By performing the requisite weighting and combining at RF using relatively inexpensive components, an N-fold spatially-multiplexed system having more than N receive antennas, but only N RF chains, can be realized at a cost similar to that of a system having N receive antennas. That is, receiver performance may be improved through use of additional antennas at relatively low cost.
A similar technique can be used at a transmitter incorporating N RF chains and more than N transmit antennas. Specifically, in the exemplary embodiment the N RF chains are followed by RF splitters, weighting elements and combiners collectively operative to generate signals for each of the more than N transmit antennas. As at the receiver, by performing such weighting and combining in the RF domain using relatively inexpensive components, an N-fold spatially-multiplexed system having more than N transmit antennas, but only N RF chains, can be realized at a cost similar to that of a system having N transmit antennas. That is, transmitter performance may be improved through use of additional antennas at relatively low cost.
The reduced-complexity antenna arrangement and receiver disclosed in the above-referenced non-provisional copending patent applications is premised on performing, within the RF domain, some or all of the weighting and combining operations necessary for spatially-multiplexed communication. These operations may be performed using a plurality of RF chains within each transmitter/receiver that are fewer in number than the number of transmit/receive antennas deployed.
Spatial Multiplexing
As is known, spatial multiplexing (SM) provides a mode of signal transmission predicated upon the use of multiple antennas at both a transmitter and a receiver in such a way that the bit rate of a wireless radio link may be increased without correspondingly increasing power or bandwidth consumption. In the case in which N antennas are used at both a transmitter and a receiver, an input stream of information symbols provided to the transmitter is divided into N independent substreams. Spatial multiplexing contemplates that each of these substreams will occupy the same “channel” (e.g., time slot, frequency, or code/key sequence) of the applicable multiple-access protocol. Within the transmitter, each substream is separately applied to the N transmit antennas and propagated over an intervening multipath communication channel to a receiver. The composite multipath signals are then received by a receive array of N receive antennas deployed at the receiver. At the receiver, a “spatial signature” defined by the N phases and N amplitudes arising at the receive antenna array for a given substream is then estimated. Signal processing techniques are then applied in order to separate the received signals, which permits the original substreams to be recovered and synthesized into the original input symbol stream. The principles of spatially-multiplexed communication and exemplary system implementations are further described in, for example, “Optimum combining for indoor radio systems with multiple users”, by J. H. Winters, IEEE Transactions on Communications, Vol. COM-35, No. 11, November 1987, which is hereby incorporated by reference in its entirety.
Conventional MIMO System
The principles of the present invention may be more fully elucidated by first considering a conventional MIMO communication system, which is illustratively represented by FIG. 1. As shown, the MIMO system 100 of FIG. 1 includes a transmitter 110 depicted in FIG. 1A and a receiver 130 depicted in FIG. 1B. The transmitter 110 and receiver 130 include a set of T transmit RF chains and a set of R receive RF chains, respectively, which are configured to transmit and receive a group of N spatially-multiplexed signals. Within the system 100 it is assumed that either (i) T is greater than N and R is equal to N, (ii) T is equal to N and R is greater than N, or (iii) both T and R are greater than N.
Referring to FIG. 1A, an input signal S to be transmitted, which typically consists of a stream of digital symbols, is demultiplexed by demultiplexer 102 into N independent substreams S1, 2 . . . , N. The substreams S1, 2 . . . , N are then sent to digital signal processor (DSP) 105, which generates a set of T output signals T1, 2 . . . T. The T output signals T1, 2 . . . T are typically generated from the N substreams S1, 2 . . . , N by weighting, i.e., multiplying by a complex number, each of the N substreams S1, 2 . . . , N by T different weighting coefficients to form NT substreams. These N·T substreams are then combined in order to form the T output signals T1, 2 . . . T. The T output signals T1, 2 . . . , N are then converted to T analog signals A1, 2 . . . , T using a set of T digital-to-analog (D/A) converters 108. Each of the T analog signals A1, 2 . . . , T is then upconverted to the applicable transmit carrier RF frequency within a mixer 112 by mixing with a signal provided by a local oscillator 114. The resulting set of T RF signals (i.e., RF1, 2 . . . , T) are then amplified by respective amplifiers 116 and transmitted by respective antennas 118.
Referring now to FIG. 1B, the RF signals transmitted by the transmitter 110 are received by a set of R receive antennas 131 deployed at the receiver 130. Each of the R signals received by an antenna 131 is amplified by a respective low noise amplifier 133 and passed through a filter 135. The resultant filtered signals are then each downconverted from RF to baseband using mixers 137, each of which is provided with a signal from local oscillator 138. Although the receiver of FIG. 1B is configured as a homodyne receiver, a heterodyne receiver characterized by an intermediate IF frequency could also be used. The respective R baseband signals produced by the mixers 137 are then converted to digital signals using a corresponding set of R analog-to-digital (A/D) converters 140. The resulting R digital signals D1, 2 . . . , R are then weighted and combined using digital signal processor 142 to form N spatially-multiplexed output signals S′1, 2 . . . , N, which comprise estimates of the transmitted signals S1, 2 . . . , N. The N output signals S′1, 2 . . . , N are then multiplexed using a multiplexer 155 in order to generate an estimate 160 (S′) of the original input signal S.
RF Weighting and Combining in Spatially-Multiplexed Communication Systems
Turning now to FIG. 2, there is shown a block diagram of a MIMO communication system 200 having a transmitter 210 and receiver 250 configured in accordance with the principles of the above-referenced non-provisional patent applications. In the implementation of FIG. 2, the transmitter 210 and receiver 250 effect N-fold spatial multiplexing using only N transmit/receive RF chains, even though more than N transmit/receive antennas are respectively deployed at the transmitter 210 and receiver 250. Specifically, the transmitter 210 includes a set of MT transmit antennas 240 and the receiver includes a set of MR receive antennas 260, it being assumed that either (i) MT is greater than N and MR is equal to N, (ii) MT is equal to N and MR is greater than N, or (iii) both MT and MR are greater than N.
As shown in FIG. 2A, an input signal S to be transmitted is demultiplexed by demultiplexer 202 into N independent substreams SS1, 2 . . . , N. The substreams SS1, 2 . . . , N are then converted to N analog substreams AS1, 2 . . . , N using a corresponding set of D/A converters 206. Next, the N analog substreams AS1, 2 . . . , N are upconverted to the applicable transmit carrier RF frequency using a set of mixers 212 provided with the signal produced by a local oscillator 214. The resultant N RF signals (i.e., RF1, 2 . . . , N) are then each split MT ways by dividers 218 in order to form N·(MT) RF signals. These N·(MT) RF signals are each weighted using complex multipliers 226x,y, where x identifies a signal origination point at one of the N dividers 218 and y identifies a corresponding signal termination point at one of a set of MT combiners 230. The weighted RF signals are combined using the combiners 230, thereby yielding a set of MT output signals. A corresponding set of MT amplifiers 234 then amplify these MT output signals, with the amplified output signals then being transmitted using the MT antennas 240. The weighting values of the complex multipliers 226x,y may be generated so as to maximize the SNR or to minimize the BER of the output signal at the receiver.
Referring to FIG. 2B, the MT RF signals transmitted by the transmitter 210 are received by the set of MR receive antennas 260 deployed at the receiver 250. Each of the MR received signals is amplified by a respective low noise amplifier 264 and then split N ways by one of a set of MR dividers 268. The resulting MR·(N) split signals are then each weighted by respective weighting circuits 272x,y, where x identifies a signal origination point at one of the MR dividers 268 and y identifies a corresponding signal termination point at one of a set of N combiners 276. These weighted signals are then combined using the N combiners 276 in order to form a set of N signals, which are passed through a corresponding set of N filters 280. The resulting N filtered signals are then down-converted to baseband using a set of N mixers 282, each of which is provided with a carrier signal produced by a local oscillator 284. Although the receiver 250 is realized as a homodyne receiver in the embodiment of FIG. 2B, it could also be implemented as a heterodyne receiver characterized by an intermediate IF frequency. The N baseband signals produced by the mixers 282 are then converted to digital signals via a corresponding set of N A/D converters 286. The N digital signals are then further processed using digital signal processor 288 to form the N spatially-multiplexed output signals SS′1, 2 . . . , N, which are the estimates of the N independent substreams SS1, 2 . . . , N. The N output signals SS′1, 2 . . . , N are then multiplexed via a multiplexer 292 in order to generate the output signal S′, which is an estimate of the input signal S.
It is observed that the transmitter 210 and receiver 250 are capable of implementing, within the RF domain, the same spatial weighting or linear combining schemes as are conventionally implemented at baseband via the system 100 of FIG. 1. However, the DSP 288 within the inventive receiver 250 may still perform many other baseband signal processing operations potentially effected within the system 100, such as, for example, successive interference cancellation (see, e.g., “V-BLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel”, Proceedings of URSI ISSSE, September 1998, pp. 295-300). Again, it is a feature of the disclosed system that only N transmit/receive RF chains need be employed, even when substantially more than N transmit/receive antennas are deployed.
II. Weight Generation Method for RF Weighting and Combining and Adaptive Bit Loading Based on Maximum Output Data Rate
In an exemplary embodiment the present invention relates to a weight generation method for RF-based weighting and combining in a multi-antenna communication system predicated upon maximizing output data rate in the case when adaptive bit loading is also employed. In general, the embodiments described below are configured such that the signals received by multiple antennas are weighted and combined at RF using a single frequency-independent weight for each antenna. In an exemplary embodiment a single frequency-independent weight is defined such that the weight coefficients are constant over a given channel domain, including the frequency bandwidth, the tap delay profile, the time impulse response, and the Rake fingers profile. The weight generation method of the invention enables calculation of the weights that maximize the output data rate when adaptive bit loading is also performed at the transmitter. Furthermore, the method of the invention can also be used for weight generation at the transmitter when multiple antennas are used for transmission, with the transmitted signal split and weighted at RF using a single frequency-independent weight for each transmit antenna.
The teachings of the present invention are applicable to, for example, (i) receivers using multiple antennas in what are referred to herein as single channel systems (i.e., system lacking spatial multiplexing), (ii) transmitters using multiple antennas in single channel systems, and (iii) systems in which a smaller number of RF chains are used at the transmitter and/or receiver than the number of transmit/receiver antennas in a MIMO system with spatial multiplexing.
Although the present invention may be utilized in the development of RF-based weighting and combining schemes implemented using low-cost RF components, the teachings of the present invention are equally applicable to implementations containing both RF-based and baseband weighting and combining arrangements. Accordingly, both RF-based and baseband weighting and combining schemes are described hereinafter. In this regard various implementations using the weighting techniques of the invention may include only RF weighting and combining schemes while others contemplate use of both RF and baseband weighting and combining schemes. In general, it is expected that weighting and combining consistent with the invention may be more economically performed in the RF domain than at baseband, but that implementations including both RF-based and baseband combining arrangements may in certain cases offer superior performance results.
Exemplary Scenarios
The weight generation techniques of the present invention will be described hereinafter with reference to the exemplary scenarios illustratively represented by FIGS. 3-4. Specifically, the weight generation methods will be explained within the context of the following two scenarios: 1) a transmitter using multiple antennas and a receiver using multiple antennas in a single channel MIMO system without spatial multiplexing, and 2) a system whereby a smaller number of RF chains are used at the transmitter and/or receiver than the number of transmitter/receiver antennas in a MIMO system with spatial multiplexing. In each case, the signal-to-noise ratio after RF combining is discussed along with adaptive bit loading. Each of the cases may be implemented consistent with the invention using exclusively RF-based weighting and combining arrangements, as well as by using both RF-based and baseband arrangements.
FIG. 3 presents a single channel (SC) MIMO-OFDM system 300 in the case in which RF-based weighting and combining networks are employed within a transmitter 304 and a receiver 308. In the present exemplary case the combining weights 334 and 312 are implemented using RF-based elements capable of being defined by a single vector. The computation of the weights may be carried out in baseband, in which case the values of the weights are fed back to the RF domain via an internal bus.
In alternate implementations the RF-based weighting and splitting/combining arrangements 322, 352 within the transmitter 304 and receiver 308 of FIG. 3 may be complemented by similar arrangements at baseband. This results in a portion of the requisite weighting and combining being performed in the RF domain and the balance being effected at baseband.
In the embodiment of FIG. 3, the values of the RF weighting elements 334 and 312 utilized within the transmitter and receiver structures 304 and 308 are computed over space. In addition, exemplary implementations of the system structure of FIG. 3 adhere to the requirements of the 802.11a standard. That is, the transmitter 304 uses OFDM modulation, where a stream of Nt consecutive quadrature amplitude modulation (QAM)-modulated data symbols, denoted by {s1,0, s1,1, . . . , s1,Nt−1} is modulated onto a set of Nt orthogonal subcarriers, see, e.g., J. Heiskala and J. Terry, OFDM Wireless LANs: A Theoretical and Practical Guide, Sams Publishing, December 2001. Adaptive bit loading 316 is used to generate the subcarriers, whereby the power of each of the subcarriers, as well as the modulation, is adjusted to maximize the transmitted data rate in the manner described below. As a consequence, the data symbols communicated via the various subcarriers will not necessarily each be comprised of the same number of bits. The resultant data substreams are then converted, using an Inverse Fast Fourier Transform 320, into an OFDM signal. A cyclic prefix (CP) 324 is added to this signal to mitigate inter-symbol interference (ISI). The signal is then sent through a transmit RF chain 326, and the output is split and sent to the nT transmit antenna elements 330, each of which conveys a weighted version of the OFDM signal. It is observed that in the embodiment of FIG. 3 the combining weights 334 are implemented in the RF domain rather than at baseband, which enables the number of transmit RF chains to be reduced to one (i.e., transmit RF chain 326).
Referring again to FIG. 3, the transmit signal at tone k from the jth antenna 330 is

txsj,k=vj·αks1,k  (1.)

The transmit vector at tone k is

txsk=v·αks1,k  (2.)

where s1,k is the transmitted symbol at the kth tone (where the subscript “1” indicates that only a single data stream is being transmitted in the single channel (SC) system 300), αk is the power scaling factor at tone k, and v is the transmit weight vector of size nT×1. Although the parameter v is preferably a function of the propagation channel 340, it is not a function of the channel frequency selectivity as it is common to all tones.
In order to keep the total transmit power across the tones (i.e., Nt·P) constant regardless of the number of transmit antenna elements 330 or of the power scaling, we assume that each of the digital symbols has a power P/nT, i.e.,

E[s1,ks*1,k]=P/nT  (3.)

If the total transmit power across the tones based on (2) and (3) is given by





  
    
      
        
          TX
          ⁢
          
            
          
          ⁢
          PW
        
        =
        
          
            
              ∑
              
                k
                =
                1
              
              
                N
                t
              
            
            ⁢
            
              E
              ⁡
              
                [
                
                  
                    α
                    k
                    *
                  
                  ⁢
                  
                    s
                    
                      1
                      ,
                      k
                    
                    *
                  
                  ⁢
                  
                    
                      v
                      _
                    
                    H
                  
                  ⁢
                  
                    v
                    _
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    α
                    k
                  
                  ⁢
                  
                    s
                    
                      1
                      ,
                      k
                    
                  
                
                ]
              
            
          
          =
          
            
              
                
                  
                  
                    v
                    _
                  
                  
                
                2
              
              ⁢
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  
                    N
                    t
                  
                
                ⁢
                
                  
                    
                      
                      
                        α
                        k
                      
                      
                    
                    2
                  
                  ⁢
                  
                    E
                    ⁡
                    
                      [
                      
                        
                          s
                          
                            1
                            ,
                            k
                          
                        
                        ⁢
                        
                          s
                          
                            1
                            ,
                            k
                          
                          *
                        
                      
                      ]
                    
                  
                
              
            
            =
            
              
                
                  
                    
                    
                      v
                      _
                    
                    
                  
                  2
                
                ⁢
                
                  P
                  /
                  
                    n
                    T
                  
                
                ⁢
                
                  
                    ∑
                    
                      k
                      =
                      1
                    
                    
                      N
                      t
                    
                  
                  ⁢
                  
                    
                      
                      
                        α
                        k
                      
                      
                    
                    2
                  
                
              
              =
              
                
                  N
                  t
                
                ⁢
                P
              
            
          
        
      
    
    
      
        (
        4.
        )
      
    
  




then the constraint on the frequency-scaled transmit weights is expressed as




  
    
      
        
          
            
              
              
                v
                _
              
              
            
            2
          
          ⁢
          
            
              ∑
              
                k
                =
                1
              
              
                N
                t
              
            
            ⁢
            
              
                
                
                  α
                  k
                
                
              
              2
            
          
        
        =
        
          
            N
            t
          
          ⁢
          
            n
            T
          
        
      
    
    
      
        (
        5.
        )
      
    
  




Once the signal has propagated through the channel 340, received signal energy is collected from each of the M receive antenna elements 350 of the receiver 308. This received signal energy may be expressed as an M-dimensional vector, where the received signal energy vector at tone k becomes:

rk=Hk·v·αks1,k+nk  (6.)

where rk=[r1,k, r2,k, . . . rM,k]T and nk=[n1,k, n2,k, . . . nM,k]T are M-dimensional vectors, with n being complex-valued additive white Gaussian noise (AWGN) with zero-mean and variance σ2.




  
    H
    k
  
  =
  
    [
    
      
        
          
            
              
                H
                
                  1
                  ,
                  1
                
              
              (
              
                e
                
                  j
                  ⁢
                  
                    
                      2
                      ⁢
                      π
                    
                    
                      N
                      t
                    
                  
                  ⁢
                  k
                
              
              )
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              
                H
                
                  1
                  ,
                  
                    n
                    T
                  
                
              
              (
              
                e
                
                  j
                  ⁢
                  
                    
                      2
                      ⁢
                      π
                    
                    
                      N
                      t
                    
                  
                  ⁢
                  k
                
              
              )
            
          
        
      
      
        
          ⋮
        
      
      
        
          
            
              
                H
                
                  M
                  ,
                  1
                
              
              (
              
                e
                
                  j
                  ⁢
                  
                    
                      2
                      ⁢
                      π
                    
                    
                      N
                      t
                    
                  
                  ⁢
                  k
                
              
              )
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              
                H
                
                  M
                  ,
                  
                    n
                    T
                  
                
              
              (
              
                e
                
                  j
                  ⁢
                  
                    
                      2
                      ⁢
                      π
                    
                    
                      N
                      t
                    
                  
                  ⁢
                  k
                
              
              )
            
          
        
      
    
    ]
  




is an M×nT matrix which is the channel frequency response of the L-tap channel impulse response denoted by {h0, h1, . . . , hL-1}). The relationship between frequency-domain H and time-domain h is:





  
    
      
        
          H
          ⁡
          
            (
            
              e
              
                j
                ⁢
                
                  
                    2
                    ⁢
                    π
                  
                  
                    N
                    t
                  
                
                ⁢
                k
              
            
            )
          
        
        =
        
          
            ∑
            
              l
              =
              0
            
            
              L
              -
              1
            
          
          ⁢
          
            
              h
              1
            
            ⁢
            
              e
              
                
                  -
                  j
                
                ⁢
                
                  
                    2
                    ⁢
                    π
                  
                  
                    N
                    t
                  
                
                ⁢
                1
                ⁢
                k
              
            
          
        
      
    
    
      
        (
        7.
        )
      
    
  




The signal energy received at each of the M antenna elements 350 is weighted at RF by a weighting element 312, which may be characterized by a one-dimensional vector u that is common to all tones. The weighted signal energy produced by the M weighting elements 312 is then summed and down-converted 356 from RF to baseband. Next, the cyclic prefix (CP) is removed 360. The resultant symbols are then mapped, subsequent to a serial-to-parallel conversion 364, to the subcarriers of a fast Fourier transform (FFT) 368. The combined received signal at the output of the FFT 368 can thus be written as:

yk=ŝ1,k=uH·rk=uHHk·v·αks1,k+uHnk  (8.)

where yk is the estimate of s1,k.
The corresponding output SNR at tone k is:




  
    
      
        
          SNR
          k
        
        =
        
          
            
              
                
                  
                  
                    
                      
                        u
                        _
                      
                      H
                    
                    ⁢
                    
                      
                        H
                        k
                      
                      ·
                      
                        v
                        _
                      
                    
                  
                  
                
                2
              
              ⁢
              
                
                  
                  
                    α
                    k
                  
                  
                
                2
              
              ⁢
              
                E
                ⁡
                
                  [
                  
                    
                      s
                      
                        1
                        ,
                        k
                      
                    
                    ⁢
                    
                      s
                      
                        1
                        ,
                        k
                      
                      *
                    
                  
                  ]
                
              
            
            
              
                σ
                2
              
              ⁢
              
                
                  
                  
                    u
                    _
                  
                  
                
                2
              
            
          
          =
          
            
              
                
                  
                  
                    
                      
                        u
                        _
                      
                      H
                    
                    ⁢
                    
                      
                        H
                        k
                      
                      ·
                      
                        v
                        _
                      
                    
                  
                  
                
                2
              
              ⁢
              
                
                  
                  
                    α
                    k
                  
                  
                
                2
              
              ⁢
              
                P
                /
                
                  n
                  T
                
              
            
            
              
                σ
                2
              
              ⁢
              
                
                  
                  
                    u
                    _
                  
                  
                
                2
              
            
          
        
      
    
    
      
        (
        9.
        )
      
    
  




In the above-identified copending provisional and non-provisional patent applications, approaches are described for selecting the transmit and receive weights u and v so as to maximize the SNR averaged over the tones or to minimize the BER. However, these approaches are generally applicable to cases in which the same modulation is applied to each subcarrier of the transmitted signal. As is described further below, the present invention provides a method for maximizing the overall data rate for a given set of transmit and receive weights when adaptive bit loading is applied to the signal subcarriers. Although many variations of this method may be employed, adaptive bit loading typically involves selecting (i) the power for each subcarrier in accordance with “waterfilling” techniques (i.e., in which more power is allocated to those subcarriers characterized by relatively higher SNR at the receiver, with the total power distributed among all subcarriers remaining constant) and (ii) the data rate (modulation) in each subcarrier to be the maximum possible in view of the desired output SNR and/or BER. The use of adaptive bit loading advantageously increases the data rate for a given set of transmit and receive weights relative to systems in which uniform power and modulation is applied to each subcarrier.
However, it has been found that neither the transmit/receive weights that maximize the average output SNR nor those that minimize the BER necessarily maximize the data rate when bit loading is also employed. Instead, in one aspect the present invention contemplates that both the transmit/receive weights and adaptive bit loading parameters be jointly determined so as to maximize this data rate. This joint determination is preferably effected by searching over all possible sets of weights (with quantization), calculating the data rate for each set of weights when adaptive bit loading is also employed, and identifying the set of weights which in combination with adaptive bit loading yields the highest data rate. Other search methods (e.g., simulated annealing) may be utilized in alternate implementations.
In connection with this search for an optimum set of weighting values in the presence of adaptive bit loading, each tone k may be characterized by the following parameters:

    
    
        SNRk: output SNR
        αk: power scaling factor
        Rk: coded bit rate (associated to a pair of modulation and coding rate)
        BERk: bit error rate
    
    


In exemplary embodiments of the invention this search entails jointly determining the (i) transmit and receive weights u and v, and (ii) distribution of subcarrier power scaling factors αk and bit rate Rk such that the overall data rate RT is maximized, where RT is defined as




  
    
      
        
          R
          T
        
        =
        
          
            ∑
            
              k
              =
              1
            
            
              N
              t
            
          
          ⁢
          
            R
            k
          
        
      
    
    
      
        (
        10.
        )
      
    
  




This joint determination is performed under the constraint that the bit error rate at each tone is equal to or smaller than a pre-selected bound, i.e.,

BERk≦bound,k=1, . . . ,Nt 

A BER associated with each bit rate Rk may be determined for a given SNRk; that is, the BER at each tone k (BERk) may be expressed as a function of the bit rate and SNR as follows:

BERk=fRk(SNRk)  (11.)

The search for the set of transmit/receive weights which maximizes the data rate RT (Equation (10)) under the above constraints may be mathematically summarized as follows:





  
    
      
        
          
            
              
                
                  
                    
                      
                        
                          
                            
                              argmax
                              
                                
                                  u
                                  _
                                
                                ,
                                
                                  v
                                  _
                                
                                ,
                                
                                  {
                                  
                                    α
                                    k
                                  
                                  }
                                
                                ,
                                
                                  {
                                  
                                    R
                                    k
                                  
                                  }
                                
                              
                            
                            ⁡
                            
                              (
                              
                                R
                                T
                              
                              )
                            
                          
                          ⁢
                          
                            
                          
                          ⁢
                          subject
                          ⁢
                          
                            
                          
                          ⁢
                          to
                        
                        ⁢
                        
                          

                        
                        ⁢
                        1
                      
                      )
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        
                        
                          v
                          _
                        
                        
                      
                      2
                    
                    ⁢
                    
                      
                        ∑
                        
                          k
                          =
                          1
                        
                        
                          N
                          t
                        
                      
                      ⁢
                      
                        
                          
                          
                            α
                            k
                          
                          
                        
                        2
                      
                    
                  
                  =
                  
                    
                      N
                      t
                    
                    ⁢
                    
                      n
                      T
                    
                  
                
                ⁢
                
                  

                
                ⁢
                2
              
              )
            
            ⁢
            
              
            
            ⁢
            
              BER
              k
            
          
          ≤
          bound
        
        ,
        
          
        
        ⁢
        
          k
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          
            N
            t
          
          .
        
      
    
    
      
        (
        12.
        )
      
    
  




where the coded bit rate Rk may be selected from the various rates presented in Table 1. It is to be understood that the coded bit rates Rk set forth in Table 1 are merely exemplary, and coded bit rates Rk corresponding to essentially any pair of modulation/coding rate values may be utilized. In operation, when Rk=0 is selected the kth subcarrier is not used for transmission; that is, no transmit power is allocated to the kth tone, typically because of adverse propagation characteristics of the channel 340 at such tone.










TABLE 1





Rk (bps/Hz)
Modulation
Coding Rate

















0
NA
NA


0.5
BPSK
1/2


0.75
BPSK
3/4


1
QPSK
1/2


2
16QAM
1/2


4
64QAM
2/3


4.5
64QAM
3/4









In summary, for each given set of weights, u and v, and set of power scaling factors αk, the output SNR at tone k can be computed according to Equation (9). Given SNRk, the value for Rk is found by jointly selecting the modulation and coding rate pair that yields the maximum bit rate while maintaining the applicable BERk within a predefined range.
In practical implementations, the search for the optimal combination of bit loading parameters and weighting values is performed consistent with Equation (12) relative to both the amplitudes and phases of the weights u and v. The phases of course belong to a finite range between 0 and 360 degrees, and are typically varied in increments of between 1 and 10 degrees during the search process. The amplitudes of the weighting values optimizing Equation (12) will generally fall within a range of between 0 and 20 dB, and are typically varied between 0.1 and 1 dB during consecutive iterations of the search process.
The adaptive bit loading parameters and the weights u and v are preferably modified as frequently as the applicable channel changes state. For example, in the case of a slowly-varying channel it would be necessary to change the weights u and v only relatively infrequently. In certain embodiments channel variations are characterized by a parameter generally characterized as channel coherence time. The channel coherence time is defined as the period of time during which the state characteristics of the applicable channel remain fairly stable; that is, a high correlation exists between the channel state at the beginning and end of the period. In these embodiments the weighting and bit loading values are changed at a frequency related to the channel coherence time.
In certain embodiments channel coherence time may be derived from channel state information (CSI) acquired at the applicable receiver and fed back to the transmitter via a control message. In these embodiments, a training sequence composed of known symbols is sent from the transmitter to the receiver. At the receiver, the channel is estimated based on the received signal and the known sequence of symbols. There exist many channel estimation techniques based on training sequences; see, e.g., J.-J. van de Beek et al., “On Channel Estimation in OFDM Systems,” IEEE 45th Vehicular Technology Conference, vol. 2, 25-28 Jul. 1995, pp. 815-819, which is incorporated herein by reference. In cases in which the applicable uplink and downlink channels are substantially identical, the transmitter may receive a training sequence via the uplink channel and derive CSI. This enables determination of the transmit/receive weighting values and adaptive bit loading parameters at the transmitter without the need for feedback of channel state information.
FIG. 4 illustratively represents a MIMO-OFDM system 400 which includes a transmitter 404 and a receiver structure 408 configured to support spatially-multiplexed communication utilizing RF-based and baseband combining. The transmitter 404 is composed of nT transmitting antenna elements 412, each of which conveys a weighted combination of N distinct sub-streams (i.e. spatially-multiplexed signals). In the implementation of FIG. 4 each of the N (i.e., 2) sub-streams is modulated using OFDM modulation techniques. That is, in the system 400 multiple streams 414 of Nt consecutive data symbols, denoted by {si,o, si,1, . . . , si,Nt−1}, i=1, . . . , N, are modulated onto each of a set of Nt orthogonal subcarriers. Adaptive bit loading 418 is used to generate the subcarriers, whereby the power of each of the subcarriers, as well as the modulation, is adjusted to maximize the transmitted data rate. As a consequence, the data symbols communicated through channel 420 via the various subcarriers will not necessarily each be comprised of the same number of bits. The data substreams produced via adaptive bit loading 418 are then converted, using an Inverse Fast Fourier Transform 422, into a OFDM signal for each of the N spatially-multiplexed signals. A cyclic prefix (CP) 424 is added to each signal to mitigate inter-symbol interference (ISI). Each signal is then sent through a transmit RF chain 426, and the outputs are split and sent to the nT transmitting antenna elements 412 after being weighted by a combining weight 434 within RF-based weighting and combining network 432. In this configuration, the transmit signal at tone k out of the jth antenna element 412 is:




  
    
      
        
          txs
          
            j
            ,
            k
          
        
        =
        
          
            ∑
            
              i
              =
              1
            
            N
          
          ⁢
          
            
              
                v
                
                  j
                  ,
                  i
                
              
              ·
              
                α
                
                  i
                  ,
                  k
                
              
            
            ⁢
            
              
                s
                
                  i
                  ,
                  k
                
              
              .
            
          
        
      
    
    
      
        (
        13.
        )
      
    
  




The transmit vector at tone k is




  
    
      
        
          
            txs
            _
          
          k
        
        =
        
          
            
              V
              ·
              
                
                  α
                  _
                
                k
              
            
            ⁢
            
              
                s
                _
              
              k
            
          
          =
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              
                
                  
                    v
                    _
                  
                  i
                
                ·
                
                  α
                  
                    i
                    ,
                    k
                  
                
              
              ⁢
              
                
                  s
                  
                    i
                    ,
                    k
                  
                
                .
              
            
          
        
      
    
    
      
        (
        14.
        )
      
    
  




where V is a matrix of values of the combining weights 434 of size nT×N. It is observed that the matrix V does not depend on the index k, since in the exemplary embodiment the value of each combining weight is constant over all frequency tones. In order to maintain a constant total transmit power across the tones (i.e., Nt·P) irrespective of the number of transmit antenna elements 412 or of the power scaling effected through adaptive bit loading 418, we assume that each of the digital symbols has a power P/nT, i.e.,

E[si,ks*i,k]=P/nT,i=1, . . . ,N  (15.)

Based on (14) and (15), the total transmit power across all frequency tones is given by:





  
    
      
        
          TX
          ⁢
          
            
          
          ⁢
          PW
        
        =
        
          
            
              ∑
              
                k
                =
                1
              
              
                N
                t
              
            
            ⁢
            
              
                ∑
                
                  i
                  =
                  1
                
                N
              
              ⁢
              
                E
                ⁡
                
                  [
                  
                    
                      α
                      
                        i
                        ,
                        k
                      
                      *
                    
                    ⁢
                    
                      s
                      
                        i
                        ,
                        k
                      
                      *
                    
                    ⁢
                    
                      
                        v
                        _
                      
                      i
                      H
                    
                    ⁢
                    
                      
                        v
                        _
                      
                      i
                    
                    ⁢
                    
                      α
                      
                        i
                        ,
                        k
                      
                    
                    ⁢
                    
                      s
                      
                        i
                        ,
                        k
                      
                    
                  
                  ]
                
              
            
          
          =
          
            
              
                ∑
                
                  i
                  =
                  1
                
                N
              
              ⁢
              
                
                  
                    
                    
                      
                        v
                        _
                      
                      i
                    
                    
                  
                  2
                
                ⁢
                
                  
                    ∑
                    
                      k
                      =
                      1
                    
                    
                      N
                      t
                    
                  
                  ⁢
                  
                    
                      
                        
                        
                          α
                          
                            i
                            ,
                            k
                          
                        
                        
                      
                      2
                    
                    ⁢
                    
                      E
                      ⁡
                      
                        [
                        
                          
                            s
                            
                              i
                              ,
                              k
                            
                          
                          ⁢
                          
                            s
                            
                              i
                              ,
                              k
                            
                            *
                          
                        
                        ]
                      
                    
                  
                
              
            
            =
            
              
                
                  P
                  /
                  
                    n
                    T
                  
                
                ⁢
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    N
                  
                  ⁢
                  
                    
                      
                        
                        
                          
                            v
                            _
                          
                          i
                        
                        
                      
                      2
                    
                    ⁢
                    
                      
                        ∑
                        
                          k
                          =
                          1
                        
                        
                          N
                          t
                        
                      
                      ⁢
                      
                        
                          
                          
                            α
                            
                              i
                              ,
                              k
                            
                          
                          
                        
                        2
                      
                    
                  
                
              
              =
              
                
                  N
                  t
                
                ⁢
                P
              
            
          
        
      
    
    
      
        (
        16.
        )
      
    
  




Using (16), the constraint on the frequency-scaled transmit weights is expressed as





  
    
      
        
          
            ∑
            
              i
              =
              1
            
            N
          
          ⁢
          
            
              
                
                
                  
                    v
                    _
                  
                  i
                
                
              
              2
            
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                
                  N
                  t
                
              
              ⁢
              
                
                  
                  
                    α
                    
                      i
                      ,
                      k
                    
                  
                  
                
                2
              
            
          
        
        =
        
          
            N
            t
          
          ⁢
          
            n
            T
          
        
      
    
    
      
        (
        17.
        )
      
    
  




The signal received by the antenna elements 440 of receiver 408 at tone k may be expressed in vector form as:

rk=Hk·V·αksk+nk  (18.)

Referring again to FIG. 4, this received signal vector is multiplied in the RF domain by an M×N matrix U of combining weights 444 arranged within RF-based weighting and combining network 442. The resulting output signal at tone k is given by

yk=UH·rk=UHHk·V·αksk+UHnk  (19.)

Expression (19) can also be written as:

yk=Hkn·αksk+ηk  (20.)

where Hkn=UHHk·V and ηk=UHnk.

The N×1 vector yk is converted 450 into baseband and the cyclic prefix is removed 454. After serial to parallel conversion 458 and FFT processing 460, the received baseband signals are processed within a baseband weighting and combining network 462 using an additional set of weights 464 so as to separate and recover the several spatially-multiplexed signals. The final output signal produced by the receiver 408 may be expressed as:

zk=WkHyk=WkHHkη·αksk+WkHηk  (21.)

The output signal corresponding to the ith spatially-multiplexed signal, at tone k is:





  
    
      
        
          z
          
            i
            ,
            k
          
        
        =
        
          
            
              
                w
                _
              
              
                k
                ,
                i
              
              H
            
            ⁢
            
              
                y
                _
              
              k
            
          
          =
          
            
              
                
                  w
                  _
                
                
                  k
                  ,
                  i
                
                H
              
              ⁢
              
                U
                H
              
              ⁢
              
                
                  H
                  k
                
                ·
                V
                ·
                
                  
                    α
                    _
                  
                  k
                
              
              ⁢
              
                
                  s
                  _
                
                k
              
            
            +
            
              
                
                  w
                  _
                
                
                  k
                  ,
                  i
                
                H
              
              ⁢
              
                U
                H
              
              ⁢
              
                
                  n
                  _
                
                k
              
            
          
        
      
    
    
      
        (
        22.
        )
      
    
  
  
    
      
        
          z
          
            i
            ,
            k
          
        
        =
        
          
            
              
                w
                _
              
              
                k
                ,
                i
              
              H
            
            ⁢
            
              U
              H
            
            ⁢
            
              
                H
                k
              
              ·
              
                
                  v
                  _
                
                i
              
              ·
              
                α
                
                  i
                  ,
                  k
                
              
            
            ⁢
            
              s
              
                i
                ,
                k
              
            
          
          +
          
            
              
                w
                _
              
              
                k
                ,
                i
              
              H
            
            ⁢
            
              
                U
                H
              
              ⁡
              
                (
                
                  
                    
                      ∑
                      
                        j
                        ≠
                        i
                      
                    
                    ⁢
                    
                      
                        
                          H
                          k
                        
                        ·
                        
                          
                            v
                            _
                          
                          j
                        
                        ·
                        
                          α
                          
                            j
                            ,
                            k
                          
                        
                      
                      ⁢
                      
                        s
                        
                          j
                          ,
                          k
                        
                      
                    
                  
                  +
                  
                    
                      n
                      _
                    
                    k
                  
                
                )
              
            
          
        
      
    
    
      
        (
        23.
        )
      
    
  




where zi,k is the estimate of si,k.

The corresponding output SINR is:





  
    
      
        
          SINR
          
            i
            ,
            k
          
        
        =
        
          
            
              σ
              s
              2
            
            ⁢
            
              
                
                
                  α
                  
                    i
                    ,
                    k
                  
                
                
              
              2
            
            ⁢
            
              
                w
                _
              
              
                k
                ,
                i
              
              H
            
            ⁢
            
              U
              H
            
            ⁢
            
              
                H
                k
              
              ·
              
                
                  v
                  _
                
                i
              
            
            ⁢
            
              
                v
                _
              
              i
              H
            
            ⁢
            
              H
              k
              H
            
            ⁢
            U
            ⁢
            
              
                w
                _
              
              
                k
                ,
                i
              
            
          
          
            
              
                σ
                s
                2
              
              ⁢
              
                
                  ∑
                  
                    j
                    ≠
                    i
                  
                
                ⁢
                
                  
                    
                      
                      
                        α
                        
                          j
                          ,
                          k
                        
                      
                      
                    
                    2
                  
                  ⁢
                  
                    
                      w
                      _
                    
                    
                      k
                      ,
                      i
                    
                    H
                  
                  ⁢
                  
                    U
                    H
                  
                  ⁢
                  
                    
                      H
                      k
                    
                    ·
                    
                      
                        v
                        _
                      
                      j
                    
                  
                  ⁢
                  
                    
                      v
                      _
                    
                    j
                    H
                  
                  ⁢
                  
                    H
                    k
                    H
                  
                  ⁢
                  U
                  ⁢
                  
                    
                      w
                      _
                    
                    
                      k
                      ,
                      i
                    
                  
                
              
            
            +
            
              
            
            ⁢
            
              
                σ
                2
              
              ⁢
              
                
                  w
                  _
                
                
                  k
                  ,
                  i
                
                H
              
              ⁢
              
                U
                H
              
              ⁢
              U
              ⁢
              
                
                  w
                  _
                
                
                  k
                  ,
                  i
                
              
            
          
        
      
    
    
      
        (
        24.
        )
      
    
  




In the above-identified copending provisional and non-provisional patent applications, approaches are described for selecting the transmit and receive weights u and v so as to maximize the SNR averaged over the tones or to minimize the BER. However, these approaches are generally applicable to cases in which the same modulation is applied to each subcarrier of the transmitted signal. As was mentioned above with regard to the previous scenario of FIG. 3, the present invention provides a method for maximizing the overall data rate for a given set of transmit and receive weights using adaptive bit loading. Specifically, for a given set of transmit and receive weights for each of the spatially-multiplexed signals, the subcarrier powers and modulation for each signal can be chosen to maximize the overall data rate using adaptive bit loading.
As may be appreciated from Equation (24), in the present exemplary scenario the power in a given tone of one spatially-multiplexed signal affects the output SINR for that tone in the other spatially-multiplexed signals. It follows that achievement of an optimal SINR generally requires adaptive bit loading to be performed jointly for all signals at each tone. This may be characterized as “multiuser” adaptive bit loading, for which techniques have been derived in other contexts, see, e.g., “A simple multiuser bit loading algorithm for multicarrier WLAN”, A. G. Armada, IEEE International Conference on Communications, Volume: 4, 2001, pages 1168-1171, and “Multiuser DMT: a multiple access modulation scheme”, S. N. Diggavi, Global Telecommunications Conference, 18-22 Nov. 1996, pages 1566-1570, vol. 3. In one aspect, the present invention contemplates that multiuser adaptive bit loading may be employed in conjunction with RF-based and possibly baseband weighting and combining techniques in order to increase data rate relative to the case in which adaptive bit loading is not utilized. However, it has been found that such data rate is optimized only when the weighting values and bit loading parameters are jointly determined; that is, neither the weights that maximize the average output SNR nor those that minimize the BER necessarily maximize the data rate when bit loading is also employed. One method of performing this joint determination is to search over all possible sets of weights, calculating the data rate with multiuser adaptive bit loading for each set of weights. The set of weights which, in combination with multiuser adaptive bit loading, yield the highest data rate is selected for use within the system 400. In alternate embodiments other search methods, such as simulated annealing, may be invoked.
In the context of the present scenario, tone k of an ith spatially-multiplexed signal is characterized by the following parameters:

    
    
        SINRi,k: the output SINR
        αi,k: the power scaling factor
        Ri,k: the coded bit rate (associated to a pair of modulation and coding rate)
        BERi,k: the bit error rate

In this context, the search involves jointly determining (i) the transmit and receive weight matrices U, V and Wk, and (ii) the distribution of subcarrier power scaling factors (αi,k) and bit rate (Ri,k) such that the overall data rate RT is maximized, where RT is defined as

    
    






  
    
      
        
          R
          T
        
        =
        
          
            ∑
            
              i
              =
              1
            
            N
          
          ⁢
          
            
              ∑
              
                k
                =
                1
              
              
                N
                t
              
            
            ⁢
            
              R
              
                i
                ,
                k
              
            
          
        
      
    
    
      
        (
        25.
        )
      
    
  




In the exemplary embodiment maximization of RT is performed under the constraint that the bit error rate at each tone for each spatially-multiplexed signal (BERi,k) is equal to or smaller than a pre-selected bound, i.e., that

BERi,k≦bound,k=1, . . . ,Nt;i=1, . . . ,N 

Each bit rate Ri,k has an associated BER, given SINRi,k, i.e., the BER at tone k is a function of the bit rate and SINR as

BERi,k=fRi,k(SINRi,k)  (26.)

The global search for the set of transmit/receive weights which maximizes the data rate RT under the above constraints may be mathematically summarized as follows:





  
    
      
        
          
            
              
                
                  
                    
                      
                        
                          
                            
                              argmax
                              
                                U
                                ,
                                V
                                ,
                                
                                  W
                                  k
                                
                                ,
                                
                                  {
                                  
                                    α
                                    
                                      i
                                      ,
                                      k
                                    
                                  
                                  }
                                
                                ,
                                
                                  {
                                  
                                    R
                                    
                                      i
                                      ,
                                      k
                                    
                                  
                                  }
                                
                              
                            
                            ⁡
                            
                              (
                              
                                R
                                T
                              
                              )
                            
                          
                          ⁢
                          
                            
                          
                          ⁢
                          subject
                          ⁢
                          
                            
                          
                          ⁢
                          to
                        
                        ⁢
                        
                          

                        
                        ⁢
                        1
                      
                      )
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          i
                          =
                          1
                        
                        N
                      
                      ⁢
                      
                        
                          
                            
                            
                              
                                v
                                _
                              
                              i
                            
                            
                          
                          2
                        
                        ⁢
                        
                          
                            ∑
                            
                              k
                              =
                              1
                            
                            
                              N
                              t
                            
                          
                          ⁢
                          
                            
                              
                              
                                α
                                
                                  i
                                  ,
                                  k
                                
                              
                              
                            
                            2
                          
                        
                      
                    
                  
                  =
                  
                    
                      N
                      t
                    
                    ⁢
                    
                      n
                      T
                    
                  
                
                ⁢
                
                  

                
                ⁢
                2
              
              )
            
            ⁢
            
              
            
            ⁢
            
              BER
              
                i
                ,
                k
              
            
          
          ≤
          bound
        
        ,
        
          
        
        ⁢
        
          k
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          
            N
            t
          
          ;
          
            
          
          ⁢
          
            i
            =
            1
          
        
        ,
        ...
        ⁢
        
          
        
        ,
        N
      
    
    
      
        (
        27.
        )
      
    
  




In an alternative embodiment, the baseband weights at the receiver, Wk, can be withdrawn from the global search of Equation (27) and determined through the following closed-form solution for a given U, V, and {αi,k}:

Wk=(HkηRs,kHkηH+Rη,k)−1HkηRs,k  (28.)

where Rs,k=σs2diag(αk) and Rη,k=E[ηkηkH]=σ2UHU.

The closed-form expression of Equation (28) corresponds to the known minimum mean squared error (MMSE) solution (i.e., the Wiener-Hopf solution), see, e.g., S. Haykin, Adaptive Filter Theory, 3rd Ed., Prentice Hall, 1996, and effectively minimizes the mean squared error between the transmitted and estimated symbols. Consistent with this approach, the combination of RF weighting and bit loading parameters which maximize the data rate are initially determined, and then Wk is automatically derived from these parameters to minimize the mean squared error in accordance with Equation (28).

In summary, for each given set of weights U, V and Wk and set of power scaling factors αk, the output SINR at tone k for all spatially-multiplexed signals can be computed according to Equation (24). Given the set of SINRi,k for all spatially-multiplexed signals, the value for the set Ri,k is found by jointly selecting the modulation and coding rate pair that yields the maximum overall bit rate while maintaining the applicable BERk for all spatially-multiplexed signals within an acceptable range. The weighting values and adaptive bit loading parameters selected in accordance with Equation (27) or (28) will generally be modified based upon changes in channel conditions in the manner described above with reference to the previous scenario.
The foregoing description, for purposes of explanation, used specific nomenclature to provide a thorough understanding of the invention. However, it will be apparent to one skilled in the art that the specific details are not required in order to practice the invention. In other instances, well-known circuits and devices are shown in block diagram form in order to avoid unnecessary distraction from the underlying invention. Thus, the foregoing descriptions of specific embodiments of the present invention are presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed, obviously many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the invention and its practical applications, to thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications as are suited to the particular use contemplated. It is intended that the following Claims and their equivalents define the scope of the invention.

## Claims

1. In a multi-antenna transmitter disposed to transmit an input signal as a plurality of radio frequency (RF) output signals via a corresponding plurality of transmit antennas, said input signal having a plurality of subcarrier signals, an RF signal processing method comprising:
performing a joint calculation to determine both a plurality of transmit RF weighting values based on a plurality of bit loading values, and the plurality of bit loading values based on the plurality of transmit RF weighting values;
adaptively bit loading said plurality of subcarrier signals in accordance with corresponding ones of the plurality of bit loading values in order to form a corresponding plurality of bit-loaded subcarrier signals;
upconverting said plurality of bit-loaded subcarrier signals to create an RF input signal;
dividing said RF input signal in order to form a plurality of divided RF signals; and
weighting said plurality of divided RF signals in accordance with corresponding ones of the plurality of transmit RF weighting values in order to form said plurality of RF output signals,
wherein selection of said plurality of transmit RF weighting values and of said plurality of bit loading values are performed so as to provide a desired data rate of said transmitter.

2. The RF signal processing method of claim 1, wherein the plurality of subcarrier signals includes a first subcarrier signal and a second subcarrier and
wherein the adaptively bit loading includes assigning numbers of bits to each of the first subcarrier signal and the second subcarrier signal depending on their corresponding channel characteristics.

3. The RF signal processing method of claim 2, wherein the first subcarrier signal has better channel characteristics than the second subcarrier signal, and
wherein the adaptively bit loading includes assigning a larger number of bits to the first subcarrier signal than a second number of bits assigned to the second subcarrier signal.

4. The RF signal processing method of claim 1, wherein the plurality of subcarrier signals includes a first subcarrier signal and a second subcarrier signal, and
wherein the adaptively bit loading includes supplying transmission powers to each of the first subcarrier signal and the second subcarrier signal depending on their corresponding channel characteristics.

5. The RF signal processing method of claim 4, wherein the first subcarrier signal has better channel characteristics than the second subcarrier signal, and
wherein the adaptively bit loading includes supplying a larger transmission power to the second subcarrier signal than an average transmission power supplied to the plurality of subcarrier signals.

6. The RF signal processing method of claim 5, wherein the adaptively bit loading includes, when supplying a larger transmission power to the second subcarrier signal, reducing transmission power supplied to at least one of the remaining subcarrier signals from among the plurality of subcarrier signals so as to substantially maintain the average transmission power.

7. The RF signal processing method of claim 1, wherein the plurality of subcarrier signals includes a first subcarrier signal and a second subcarrier signal,
wherein the adaptively bit loading includes assigning numbers of bits to each of the first subcarrier signal and the second subcarrier signal depending on their corresponding channel characteristics, and
wherein the adaptively bit loading includes supplying transmission powers to each of the first subcarrier signal and the second subcarrier signal depending on their corresponding channel characteristics.

8. The RF signal processing method of claim 1, further comprising encoding the plurality of bit-loaded subcarrier signals into an encoded signal,
wherein the upconverting converts the encoded signal to create the RF input signal, and
wherein each of the plurality of divided RF signals represents the encoded signal.

9. The RF signal processing method of claim 8, further comprising transmitting the plurality of subcarrier signals, the plurality of bit-loaded subcarrier signals, and the encoded signal over a single transmit path.

10. The RF signal processing method of claim 8, wherein each of the plurality of RF output signals is a weighted version of the encoded signal.

11. The RF signal processing method of claim 1, further comprising simultaneously determining the plurality of transmit RF weighting values and the plurality of bit loading values.

12. The RF signal processing method of claim 11, wherein the determining includes calculating a data rate for each of a plurality of sets of RF weighting values and selecting one set from among the plurality of sets of transmit RF weighting values, which in combination with adaptive bit loading, provides the desired data rate, and
wherein the selected one set of transmit RF weighting values includes the plurality of transmit RF weighting values.

13. The RF signal processing method of claim 1, wherein an RF output signal of the plurality of RF output signals includes a plurality of subcarrier frequencies,
wherein the plurality of subcarrier frequencies each includes a corresponding one of the upconverted plurality of bit-loaded subcarrier signals.

14. The RF signal processing method of claim 13, wherein a single transmit RF weighting value from among the plurality of transmit RF weighting values is applied to each of the upconverted plurality of bit-loaded subcarrier signals included in the RF output signal.

15. The RF signal processing method of claim 13, further comprising calculating a single transmit RF weighting value, as part of the plurality of transmit RF weighting values, for weighting each of the upconverted plurality of bit-loaded subcarrier signals included in the RF output signal.

16. The RF signal processing method of claim 1, wherein the plurality of transmit RF weighting values are calculated to be frequency-independent for their corresponding divided RF signals.

17. A multi-antenna transmitter configured to transmit an input signal as a plurality of radio frequency (RF) output signals, the input signal having a plurality of subcarrier signals, the transmitter comprising:
at least one circuit or processor configured to:
perform a joint calculation to determine both a plurality of transmit RF weighting values based on a plurality of bit loading values, and the plurality of bit loading values based on the plurality of transmit RF weighting values;
adaptively bit load the plurality of subcarrier signals in accordance with the corresponding plurality of bit loading values in order to form a corresponding plurality of bit-loaded subcarrier signals;
upconvert the plurality of bit-loaded subcarrier signals to create the RF input signal;
divide the RF input signal in order to form a plurality of divided RF signals; and
weight the plurality of divided RF signals in accordance with the corresponding plurality of transmit RF weighting values in order to form the plurality of RF output signals, wherein selection of the plurality of transmit RF weighting values and of the plurality of bit loading values are performed so as to provide a desired data rate of the transmitter; and

a plurality of transmit antennas configured to transmit corresponding ones of the plurality of RF output signals.

18. The multi-antenna transmitter of claim 17, wherein the plurality of subcarrier signals includes a first subcarrier signal and a second subcarrier signal, and
wherein the at least one circuit or processor is configured to adaptively bit load the plurality of subcarrier signals by assigning numbers of bits to each of the first subcarrier signal and the second subcarrier signal depending on their corresponding channel characteristics.

19. The multi-antenna transmitter of claim 18, wherein the first subcarrier signal has better channel characteristics than the second subcarrier signal, and
wherein the at least one circuit or processor is configured to adaptively bit load the plurality of subcarrier signals by assigning a larger number of bits to the first subcarrier signal than a second number of bits assigned to the second subcarrier signal.

20. The multi-antenna transmitter of claim 17, wherein the plurality of subcarrier signals includes a first subcarrier signal and a second subcarrier signal, and
wherein the at least one circuit or processor is configured to adaptively bit load the plurality of subcarrier signals by supplying transmission powers to each of the first subcarrier signal and the second subcarrier signal depending on their corresponding channel characteristics.

21. The multi-antenna transmitter of claim 20, wherein the first subcarrier signal has better channel characteristics than the second subcarrier signal, and
wherein the at least one circuit or processor is configured to adaptively bit load the plurality of subcarrier signals by supplying a larger transmission power to the second subcarrier signal than an average transmission power supplied to the plurality of subcarrier signals.

22. The RF signal processing method of claim 21, wherein the at least one circuit or processor is configured to adaptively bit load the plurality of subcarrier signals by, when supplying a larger transmission power to the second subcarrier signal, reducing transmission power supplied to at least one of the remaining subcarrier signals from among the plurality of subcarrier signals so as to substantially maintain the average transmission power.

23. The multi-antenna transmitter of claim 17, wherein the plurality of subcarrier signals includes a first subcarrier signal and a second subcarrier signal,
wherein the at least one circuit or processor is configured to adaptively bit load the plurality of subcarrier signals by assigning numbers of bits to each of the first subcarrier signal and the second subcarrier signal depending on their corresponding channel characteristics, and by supplying transmission powers to each of the first subcarrier signal and the second subcarrier signal depending on their corresponding channel characteristics.