# Patent

## Title
Method and apparatus for multi-user multi-input multi-output transmission

## Abstract

Embodiments of the present invention relate to methods and systems of transmitting data signals from at least one transmitting terminal with a spatial diversity capability to at least two receiving user terminals, each provided with spatial diversity receiving device. The methods and systems are useful, for example, in communication between terminals, e.g., wireless communication. In certain embodiments, transmission can be between a base station and two or more user terminals, wherein the base station and user terminals are each equipped with more than one antenna.

## Background
RELATED APPLICATIONS
The present application claims priority to and the benefit of, under 35 U.S.C. §119(e), U.S. Provisional Application No. 60/405,759, filed Aug. 22, 2002, which is hereby incorporated by reference.


BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a method for multi-user MIMO transmission, more in particular, a method for transmission between a base station and U (>1) user terminals, said base station and user terminals each equipped with more than one antenna, preferably in conjunction with considering the optimizing of joint transmit and receive filters, for instance in a MMSE context. Further disclosed are base station and user terminal devices suited for execution of said method.
2. Description of the Related Technology
Multi-input multi-output (MIMO) wireless communications have attracted a lot of interest in the recent years as they offer a multiplicity of spatial channels for the radio links, hence provide a significant capacity or diversity increase compared to conventional single antenna communications.
Multi-Input Multi-Output (MIMO) wireless channels have significantly higher capacities than conventional Single-Input Single-Output (SISO) channels. These capacities are related to the multiple parallel spatial subchannels that are opened through the use of multiple antennas at both the transmitter and the receiver. Spatial Multiplexing (SM) is a technique that transmits parallel independent data-streams on these available spatial subchannels in an attempt to approach the MIMO capacities.
In addition, Spatial-Division Multiple Access (SDMA) is very appealing due to its inherent reuse (simultaneously for various users due to the exploitation of the distinct spatial signatures of the users) of the precious frequency bandwidth.
Several MIMO approaches can be followed which can be classified according to whether or not they require channel knowledge at either the transmitter or the receiver. Typically, the best performance can be obtained when the channel is known at both sides.
The optimal solution is provided by SVD weights combined with a water-pouring strategy. However, this strategy must adaptively control the number of streams and also the modulation and coding in each stream, which makes it inconvenient for wireless channels.
A sub-optimal approach consists of using a fixed number of data streams and identical modulation and coding as in a single-user joint transmit-receive (TX-RX) MMSE optimization [H. Sampath and A. Paulraj, “Joint TX & RX Optimization for High Data Rate Wireless Communication Using Multiple Antennas”, Asilomar conf. On signals, systems and computers, pp. 215-219, Asilomar, Calif., November 1999]. This latter solution is more convenient but is not directly applicable to SDMA MIMO communications where a multi-antenna base station communicates at the same time with several multi-antenna terminals. Indeed, the joint TX-RX optimization requires channel knowledge at both sides, which is rather unfeasible at the terminal side (the terminal only knows its part of the multi-user wireless channel).
To approach the potential MIMO capacity while optimizing the system performance, several joint TX/RX MMSE designs have been proposed.
Two main design trends have emerged that enable Spatial Multiplexing corresponding to whether Channel State Information (CSI) is available at the transmitter. On the one hand, BLAST-like space-time techniques make use of the available transmit antennas to transmit as many independent streams and do not require CSI at the transmitter. On the other hand, the joint transmit and receive space-time processing takes advantage of the potentially available CSI at both sides of the link to maximize the system's information rate or alternatively optimize the system performance, under a fixed rate constraint.
Within multi-user MIMO transmission schemes multi-user interference results in a performance limitation. Further, the joint determination of optimal filters for both the base station and the user terminals in the case of a multi-user context is very complex.
SUMMARY OF CERTAIN INVENTIVE ASPECTS
Embodiments of the present invention provide a solution for the problem of multi-user interference in a multi-user MIMO transmission scheme, which results in a reasonably complex filter determination in the case of joint optimal filter determination, although the invention is not limited thereto.
The invention includes a method of multi-user MIMO transmission of data signals from at least one transmitting terminal with a spatial diversity capability to at least two receiving user terminals, each provided with spatial diversity receiving capability, comprising: dividing said data signals into a plurality of streams of (sub-user) data sub-signals; determining combined data signals in said transmitting terminal, said combined data signals being transformed versions of said streams of data sub-signals, such that at least one of said spatial diversity devices of said receiving user terminals only receives data sub-signals being specific for the corresponding receiving user terminal; inverse subband processing said combined data signals; transmitting with said spatial diversity device said inverse subband processed combined data signals; receiving on at least one of said spatial diversity receiving device of at least one of said receiving terminals received data signals, being at least a function of said inverse subband processed combined data signals; determining on at least one of said receiving terminals estimates of said data sub-signals from said received data signals; and collecting said estimates of said data sub-signals into estimates of said data signals.
In certain embodiments, the transmission of the inverse subband processed combined data signals is performed in a substantially simultaneous way. Typically, the spectra of the inverse subband processed combined data signals are at least partly overlapping.
In some embodiments, the step of determining combined data signals in the transmitting terminal is carried out on a subband by subband basis. In other embodiments, the step of determining the estimates of said data sub-signals in the receiving terminals comprises subband processing.
The determining combined data signals in the transmitting terminal may additionally comprise: determining intermediate combined data signals by subband processing of the data signals; and determining the combined data signals from the intermediate combined data signals.
In other embodiments, the subband processing includes orthogonal frequency division demultiplexing and the inverse subband processing includes orthogonal frequency division multiplexing.
In certain embodiments, the method includes subbands that are involved in inverse subband processing being grouped into sets, whereby at least one set includes at least two subbands and the step of determining combined data signals in the transmitting terminal comprises: determining relations between the data signals and the combined data signals on a set-by-set basis; and exploiting the relations between the data signals and the combined data signals for determining the data signals.
A guard interval may be introduced in the inverse subband processed combined data signals.
The determining combined data signals may further comprise transmitter filtering. Wherein the determining estimates of the sub-signals comprises receiver filtering, said transmitter filtering and said receiver filtering being determined on a user-by-user basis.
In certain embodiments, the number of streams of data sub-signals is variable. In other embodiments, the number of streams is selected in order to minimize the error between the estimates of the data sub-signals and the data sub-signals themselves. Alternatively, the number of streams may be selected in order to minimize the system bit error rate.
Another aspect includes a method of transmitting data signals from at least two transmitting terminals each provided with spatial diversity transmitting device to at least one receiving terminal with a spatial diversity receiving device comprising: dividing said data signals into a plurality of streams of (sub-user) data sub-signals; transforming versions of said streams of said data sub-signals into transformed data signals; transmitting from said transmitting terminals said transformed data signals; receiving on said spatial diversity receiving device received data signals being at least function of at least two of said transformed data signals; subband processing of at least two of said received data signals in said receiving terminal; applying a linear filtering on said subband processed received data signals, said linear filtering and said transforming being selected such that the filtered subband processed received data signals are specific for one of said transmitting terminals; determining estimates of said data sub-signals from said filtered subband processed received data signals in said receiving terminal; and collecting said estimates of said data sub-signals into estimates of said data signals.
In certain embodiments, the transmission is substantially simultaneous and the spectra of the transformed data signals are at least partly overlapping. Additionally, the transformation of the data sub-signals to transformed data sub-signals may comprise inverse subband processing.
In an alternative embodiment, the determining estimates of the data sub-signals from subband processed received data signals in the receiving terminal comprises: determining intermediate estimates of the data sub-signals from the subband processed received data signals in the receiving terminal; and obtaining the estimates of the data sub-signals by inverse subband processing the intermediate estimates.
Another aspect includes an apparatus for transmitting inverse subband processed combined data signals to at least one receiving user terminal with spatial diversity device comprising at least: at least one spatial diversity transmitter; circuitry configured to divide data signals into streams of data sub-signals; circuitry configured to combine data signals, such that at least one of said spatial diversity device of said receiving user terminals only receives data sub-signals being specific for the corresponding receiving user terminal; circuitry being adapted for inverse subband processing combined data signals; and circuitry being adapted for transmitting inverse subband processed combined data signals with said spatial diversity device.
Additionally, the circuitry is configured to combine data signals and may comprise a plurality of circuits, each configured to combine data signals based at least on part of the subbands of the data sub-signals.
In other embodiments, the spatial diversity transmitter comprises at least two transmitters and the circuitry configured to transmit inverse subband processed combined data signals comprises a plurality of circuits configured to transmit the inverse subband processed combined data signals with one of the transmitters of the spatial diversity device.
Yet another aspect includes an apparatus for transmitting data signals to at least one receiving terminal with the spatial diversity device, comprising at least: at least one spatial diversity transmitter; circuitry configured to divide data signals into streams of data sub-signals; circuitry configured to transform versions of the data sub-signals; and circuitry configured to transmit with the spatial diversity device the transformed versions of the data sub-signals, such that at least one of the spatial diversity devices of the receiving terminal only receives specific received data sub-signals.
A further aspect includes a method to calibrate a transceiver for wireless communication comprising at least one transmitter/receiver pair connected to an antenna branch, such that front-end mismatches in the transmitter/receiver pair can be compensated, comprising: providing a splitter, a directional coupler, a transmit/receive/calibration switch, a calibration noise source and a power splitter; matching the power splitter outputs between all branches of the transceiver, matching the directional couplers and matching the transmit/receive/calibration switches between all antenna branches of the transceiver; switching on the calibration connection of the transmit/receive/calibration switch; in each of the antenna branches, generating a known signal and calculating an averaged frequency response of the cascade of the transmitter and the receiver of the transmitter/receiver pair; connecting the transmit/receive/calibration switch so as to isolate the receiver from both the transmitter and the antenna; switching on the calibration noise source; calculating an averaged frequency response of all receiver branches of the transceiver; determining the values to be pre-compensated from the calculated averaged frequency responses of the cascade of the transmitter and the receiver of the transmitter/receiver pair and of all receiver branches of said transceiver; and pre-compensating the transmitter/receiver pair using the inverse of the values.
In certain embodiments, the transceiver is a base station transceiver. In addition, the pre-compensating may be performed digitally.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 illustrates a downlink communication set-up.
FIG. 2 illustrates an uplink communication set-up.
FIG. 3 illustrates the multi-user (U>1), MIMO (A>1, Bu≧1), multi-stream (Cu≧1) context of the systems and methods.
FIG. 4 illustrates the involved matrices.
FIGS. 5 and 6 illustrate simulations results for the block diagionalization approach used in the context of joined transmit and receive filter optimization.
FIG. 7 illustrates the matrix dimension for 8 antennas at the base station.
FIG. 8 illustrates a Spatial Multiplexing MIMO System.
FIG. 9 illustrates the existence (a) and distribution (b) of the optimal number of streams popt for a (6,6) MIMO system.
FIG. 10 illustrates popt's distribution for different reference rates R.
FIG. 11 illustrates the MSEp versus p for different SNR levels.
FIG. 12 illustrates a comparison between the exact MSEp and the simplified one.
FIG. 13 illustrates a comparison between the BER performance of the spatially optimized and conventional Tx/Rx MMSE.
FIG. 14 illustrates a comparison of the spatially optimized joint Tx/Rx MMSE to the optimal joint Tx/Rx MMSE and spatial adaptive loading for different reference rates R.
FIG. 15 illustrates a block diagram of a multi-antenna base station with calibration loop.
FIG. 16 illustrates the BER degradation with and without calibration.
FIG. 17 illustrates a second calibration method.



DETAILED DESCRIPTION OF CERTAIN EMBODIMENTS
The following detailed description of certain embodiments presents various descriptions of specific embodiments of the present invention. However, the present invention can be embodied in a multitude of different ways. In this description, reference is made to the drawings wherein like parts are designated with like numerals throughout.
Embodiments of the systems and methods involve (wireless) communication between terminals. One can logically group the terminals on each side of the communication and refer to them as peers. The peer(s) on one side of the communication can embody at least two user terminals, whereas on the other side the peer(s) can embody at least one base station. Thus, the systems and methods can involve multi-user communications. The peers can transmit and/or receive information. For example, the peers can communicate in a half-duplex fashion, which refers to either transmitting or receiving at one instance of time, or in a full duplex fashion, which refers to substantially simultaneously transmitting and receiving.
Certain embodiments include MIMO wireless communication channels, as they have significantly higher capacities than conventional SISO channels. Several MIMO approaches may be used, depending on whether channel knowledge is available at either the transmit or receive side, as discussed below.
FIG. 1 illustrates a downlink communication set-up, and FIG. 2 illustrates an uplink communication set-up. Space Division Multiple Access (SDMA) techniques are introduced for systems making use of subband processing, and thus is consistent with a multi-carrier approach. As shown in FIGS. 1 and 2, communication peers 30, 230 include terminal(s) 40, 240 disposing of transmitting and/or receiving devices 80, 220 that are able to provide different spatial samples of the transmitted and/or received signals. These transmission and/or receiving devices are called spatial diversity devices. A peer at the base station side is called a processing peer 30, 230. A processing peer communicates with at least two terminals at an opposite peer 10, 340, which can operate at least partially simultaneously and the communicated signals' spectra can at least partially overlap. Note that Frequency Division Multiple Access techniques rely on signals spectra being non-overlapping while Time Division Multiple Access techniques rely on communicating signals in different time slots thus not simultaneously. The opposite peer(s) includes at least two user terminals 20, 330 (labeled in FIG. 1 as User Terminal 1 and User Terminal 2) using the same frequencies at the same time, and are referred to as the composite peer(s) 10, 340. The systems and methods involve (wireless) communication between terminals whereby at least the processing peer(s) 30, 230 disposes of subband processing capabilities.
The communication between a composite peer and a processing peer can include downlink (FIG. 1) and uplink (FIG. 2) transmissions. Uplink transmission refers to a transmission whereby the composite peer transmits data signals and the processing peer receives data signals. Downlink transmission refers to a transmission whereby the processing peer transmits data signals and the composite peer receives data signals. The uplink and downlink transmissions can be, for example, simultaneous (full duplex) with respect to the channel (for example, using different frequency bands), or they can operate in a time-duplex fashion (half duplex)(for example using the same frequency band), or any other configuration.
A (linear) pre-filter can be used at the transmit side, to achieve a block diagonalization of the channel. At the receiver side (linear) post-filtering can be applied.
(Wireless) transmission of data or a digital signal from a transmitting to a receiving circuit includes digital to analog conversion in the transmission circuit and analog to digital conversion in the receiving circuit. In addition, the apparatus in the communication set-up can have transmission and receiving devices, also referred to as front-end, incorporating these analog-to-digital and digital-to-analog conversions, including amplification or signal level gain control and realizing the conversion of the RF signal to the required baseband signal and vice versa. A front-end can comprise amplifiers, filters and mixers (down converters). As such, in the text all signals are represented as a sequence of samples (digital representation), thereby assuming that the above-mentioned conversion also takes place. This assumption does not limit the scope of the invention though. Communication of a data or a digital signal is thus symbolized as the transmission and reception of a sequence of (discrete) samples. Prior to transmission, the information contained in the data signals can be fed to one or more carriers or pulse-trains by mapping said data signals to symbols which consequently modulate the phase and/or amplitude of the carrier(s) or pulse-trains (e.g., using quadrature amplitude modulation (QAM) or quadrature phase shift keying (QPSK) modulation). The symbols belong to a finite set, which is called the transmitting alphabet. The signals resulting after performing modulation and/or front-end operations on the data signals are called transformed data signals, to be transmitted further.
After reception by the receiving device, the information contained in the received signals is retrieved by transformation and estimation processes. In some embodiments, these transformation and estimation processes can include demodulation, subband processing, decoding and equalization. In other embodiments, these transformation and estimation processes do not include demodulation, subband processing, decoding and equalization. After said estimation and transformation processes, received data signals are obtained, including symbols belonging to a finite set, which is called the receiving alphabet. The receiving alphabet is preferably equal to the transmitting alphabet.
Embodiments of the invention further include methods and systems for measuring the channel impulse responses between the transmission and/or reception devices of the individual user terminals at the composite peer on the one hand, and the spatial diversity device of the processing peer on the other hand. The channel impulse responses measurement can be either obtained on basis of an uplink transmission and/or on basis of a downlink transmission. Thus the measured channel impulse responses can be used by the processing peer and/or composite peer in uplink transmissions and/or in downlink transmissions. This, however, assumes perfect reciprocity between transceiver circuits, which usually is not the case in practice because of, e.g., the different filters being used in transmit and receive path. Additional methods are discussed below to address the non-reciprocity issue. Additional embodiments further include methods for determining the received data signal power and methods for determining the interference ratio of data signals.
The spatial diversity device ensures the reception or transmission of distinct spatial samples of the same signal. This set of distinct spatial samples of the same signal is called a spatial diversity sample. In certain embodiments, spatial diversity devices embody separate antennas. In these embodiments, the multiple antennas belonging to one terminal can be placed spatially apart (as shown in FIGS. 1 and 2), or they can use a different polarization. The multiple antennas belonging to one terminal are sometimes collectively called an antenna array. The systems and methods are maximally efficient if the distinct samples of the spatial diversity sample are sufficiently uncorrelated. In some embodiments, the sufficiently uncorrelated samples may be achieved by placing different antennas apart over a sufficiently large distance. For example, the distance between different antennas can be chosen to be half a wavelength of the carrier frequency at which the communication takes place. Spatial diversity samples are thus different from each other due to the different spatial trajectory from the transmitter to their respective receiver or vice versa. Alternatively, said spatial diversity samples may be different from each other due to the different polarization of their respective receivers or transmitters.
Certain embodiments of the systems and methods rely on the fact that at least the processing peer performs an inverse subband processing, called ISP in the sequel, in the downlink mode (FIG. 1) and subband processing, called SP in the sequel, in the uplink mode (FIG. 2). Furthermore, in the downlink mode, SP takes place either in the composite peer after reception (see FIG. 1, bottom) or in the processing peer before ISP (see FIG. 1, top). In the uplink mode ISP takes place either in the composite peer prior to transmission (see FIG. 2, bottom) or in the processing peer after SP (see FIG. 2, top). Concentrated scenarios refer to the situation where both ISP and SP are in either transmission direction carried out in the processing peer. The remaining scenarios, e.g., where ISP and SP are carried out in different peers in either transmission direction, are referred to as split scenarios.
In addition, the communication methods can transmit data signals from one peer to another peer, but due to transmission conditions, in fact only estimates of the data signals can be obtained in the receiving peer. The transmission methods typically are such that the data signal estimates approximate the data signals as closely as technically possible.
The systems and methods can include downlink transmission methods for communication between a base station and U (>1) user terminals. In some embodiments, a double level of spatial multiplexing is used. This refers to the users being spatially multiplexed (SDMA) and each user receiving spatially multiplexed bit streams (SDM). The methods may further include the steps of (linear) pre-filtering in the base station and possibly (linear) post-filtering in at least one of the user terminals. Substantially simultaneously C=ΣCu independent information signals are sent from the base transceiver station to the U remote transceivers, whereby, for each remote transceiver, the information Cu signals share the same conventional channel. The base transceiver station has an array of N (>1) base station antennas (defining a spatial diversity device). Each of the remote transceivers have an array of Mu (>1) remote transceiver antennas (also defining a spatial diversity device), Mu being terminal specific as each terminals may have different number of antennas. One advantage to such a method is that each of the U remote transceivers is capable of determining a close estimate of the Cu independent information signals, said estimate being constructed from a Mu component signal vector received at the related remote transceivers antenna array. The method comprises the step of dividing each of the C independent signals into a plurality of streams of Cu sub-signals and computing an N-component transmission vector U as a weighted sum of C N-component vectors VI, wherein the sub-signals are used as weighting coefficients.
Alternatively formulated, this aspect discloses a method for transmitting user specific data signals from at least one transmitting terminal 240 with a spatial diversity capability 220 to at least two receiving terminals 330 with a spatial diversity capability 320. The method comprises: dividing 205 the user data signals 200 into a plurality of streams of sub-user data sub-signals 210; determining 250 combined data signals 300 in the transmitted signals, whereby the combined data signals are transformed versions of the streams of sub-user data sub-signals 210, such that at least one of said spatial diversity device 320 of said receiving user terminals only receives data sub-signals being specific for the corresponding receiving user terminal (in other embodiments, ‘at least one’ can be understood to mean ‘substantially all’); inverse subband processing 260 the combined data signals 300; transmitting with the transmitting terminal spatial diversity device 220 the inverse subband processed combined data signals; receiving on at least one of the spatial diversity receivers 320 of at least one of the receiving terminals 330 received data signals; determining on at least one of said receiving terminals 330 estimates of the specific user data sub-signals from the received data signals; and collecting said estimates of the data sub-signals into estimates of the data signals.
A transmit pre-filter in the base station can be used to achieve a block diagonalization of the channel, resulting in a substantially zero multi-user interference. In this embodiment, each terminal then only has to eliminate its own inter-stream interference, which does not require information from the other users' channels. The vectors Vi are selected such that the Mu component signal vector received by the antennas of a particular remote transceiver substantially only contain signal contributions directly related to the Cu sub-signals of the original information signal that the remote transceiver should reconstruct. Determining combined data signals is essentially based on the distinct spatial signatures of the transmitted combined data signals (SDMA) and is such that the spatial diversity capability of a terminal receive the sub-data signals specific for the user of that terminal. This approach can be exploited in a multi-user SDMA MIMO TX-RX optimization context, which results in a decoupling of this overall optimization into several single user optimizations, where each optimization depends on a single-user MIMO channel. The close estimate of one of the Cu independent information signals is constructed from the M component signal vector received at the related remote transceivers antenna array by using the steps comprising: selecting M component vectors Pi and computing an Mu component receive vector as a weighted sum of the Mu component vectors Pi wherein the components of the Mu component signal vector are used as weighting coefficients. Thereafter, the components of the obtained weighted sum are combined in order to obtain the desired estimate. The vector Vi, Pi can be determined in a joint MMSE optimization scheme, independently for each remote terminal.
The transmission can be done substantially simultaneously. The spectra of the (transmitted) inverse subband processed combined data signals can be at least partly overlapping.
In the downlink split scenario, the determination of the data sub-signal estimates in the receiving terminals comprises subband processing 350 as shown in FIG. 1. In the downlink concentrated scenario determining 250 combined data signals in the transmitting terminal comprises: determining intermediate combined data signals 290 by subband processing 280 the data sub-signals 210, and determining 270 the combined data signals from the intermediate combined data signals.
Also included are uplink transmission methods for communication between U (>1) user terminals and a base station. As in the downlink case, a double level of spatial multiplexing may be used (SDMA-SDM). The methods further include the steps of pre-filtering in at least one of the transmitting user terminals and post-filtering in the base station. Substantially simultaneously C=ΣCu independent information signals are sent from the U user terminals to the base transceiver station, whereby, for each user terminal, the information Cu signals share the same conventional channel. Each of the user terminals have an array of Mu (>1) transmit antennas (also defining a spatial diversity device), Mu being terminal specific as each terminal may have different number of antennas. The base transceiver station has an array of N (>1) base station antennas (defining a spatial diversity device). In this way, the base station may be capable of determining a close estimate of the Cu independent information signals, said estimate being constructed from a N component signal vector received at the base station antenna array. The method further comprises the step of dividing each of the C independent signals into a plurality of streams of Cu sub-signals and computing a Mu-component transmission vector as a weighted sum of C Mu-component vectors, wherein the sub-signals are used as weighting coefficients.
Certain embodiments include a method of transmitting data signals 50 from at least two transmitting terminals 20, each provided with spatial diversity transmitter 60 to at least one receiving terminal 40 with a spatial diversity receiver 80, comprising: dividing 105 said data signals 50 into a plurality of streams of (sub-user) data sub-signals 108; transforming versions of said streams of said data sub-signals 108 into transformed data signals 108; transmitting from said transmitting terminals 20 said transformed data signals 70; receiving on said spatial diversity receiving device 80 received data signals being at least function of at least two of said transformed data signals 70; subband processing 90 of at least two of said received data signals in said receiving terminal 40; applying a linear filtering 95 on said subband processed received data signals, said linear filtering and said transforming being selected such that the filtered subband processed received data signals are specific for one of said transmitting terminals; determining 150 estimates of said data sub-signals 120 from said filtered subband processed received data signals 140 in said receiving terminal; and collecting said estimates of said data sub-signals into estimates of said data signals. This can comprise a joint detection operation, for example, a State Insertion Cancellation.
In certain embodiments, the transformed data signals can be transmitted substantially simultaneously. The spectra of the transformed data signals can be at least partly overlapping.
In the uplink split scenario the transformation of the data sub-signals 108 (see FIG. 2) to transformed data signals 70 comprises inverse subband processing 160. In the uplink concentrated scenario, the determination 150 of data sub-signal estimates from the obtained subband processed received data signals in the receiving terminal comprises the steps of: determining 100 intermediate estimates 130 of the data sub-signals from the subband processed received data signals in the receiving terminal; obtaining the estimates of the data sub-signals 120 by inverse subband processing 110 the intermediate estimates.
It is a characteristic of some embodiments that said transmission methods are not a straightforward concatenation of a Space Division Multiple Access technique and a multi-carrier modulation method. The methods for multi-user MIMO transmission include the use of a double level of spatial multiplexing. For example, the users may be spatially multiplexed (SDMA) and each user can receive spatially multiplexed bit streams (SDM). Further, said method includes the steps of pre-filtering in the transmitting station and post-filtering in at least one of said receive terminals.
Some embodiments implement a multicarrier modulation technique. An example of such a multicarrier modulation technique uses Inverse Fast Fourier Transform algorithms (IFFT) as ISP and Fast Fourier Transform algorithms (FFT) as SP, and the modulation technique is called Orthogonal Frequency Multiplexing (OFDM) modulation. It can be stated that in the uplink transmission method, the subband processing is orthogonal frequency division demultiplexing. It can also be stated that in the uplink transmission method, the inverse subband processing is an orthogonal frequency division multiplexing. It can also be stated that in the downlink transmission method, the subband processing is orthogonal frequency division demultiplexing. It can also be stated that in the downlink transmission method, the inverse subband processing is orthogonal frequency division multiplexing.
In concentrated scenarios, the processing that is carried out in the processing peer on samples between SP 90 280 (see FIGS. 1 and 2) and ISP 110 260 is called subband domain processing 270 100. In split scenarios, the processing that is carried out prior to ISP 160 260 in the transmitting terminals and after SP 90 350 in the receiving terminals, is called subband domain processing (e.g., item numeral 250 in FIG. 1). “Prior to ISP” refers to occurring earlier in time during the transmission or the reception, and the term “after SP” refers to occurring later in time during the transmission or the reception. In concentrated scenarios, the signals 130 140 290 300 (as shown in FIGS. 1 and 2) between the SP and the ISP are called signals in subband domain representation. In split scenarios, the signals 50 300 200 before the ISP in the transmitting terminals and the signals 360 140 120 after the SP in the receiving terminals are called signals in a subband domain representation.
In certain embodiments, the subband processing consists of Fast Fourier Transform (FFT) processing and the inverse subband processing consists of Inverse Fast Fourier Transform (IFFT) processing. FFT processing refers to taking the Fast Fourier Transform of a signal. Inverse FFT processing refers to taking the Inverse Fast Fourier Transform of a signal.
The transmitted sequence can be divided in data subsequences prior to transmission. The data subsequences correspond to subsequences that are processed as one block by the subband processing device. In case of multipath conditions, a guard interval containing a cyclic prefix or postfix is inserted between each pair of data subsequences in the transmitting terminal(s). If multipath propagation conditions are experienced in the wireless communication resulting in the reception of non-negligible echoes of the transmitted signal and the subband processing capability consists of (an) FFT and/or IFFT operation(s), this guard introduction results in the substantial equivalence between convolution of the time-domain data signals with the time-domain channel response on the one hand and multiplication of the frequency-domain data-signals with the frequency-domain channel response on the other hand. The insertion of the guard intervals can occur in both concentrated and split scenarios. Thus in certain embodiments of a split scenario, the transmitting terminal(s) insert guard intervals containing a cyclic prefix or postfix between each pair of data subsequences after performing ISP on the data subsequences and before transmitting the data subsequences. In another embodiment of a concentrated scenario, the guard intervals are inserted in the transmitted sequence between each pair of data subsequences without performing ISP on the data subblocks in the transmitting terminal(s). This can be formalized as follows by stating that in the uplink transmission methods the transformation of the data signals to transmitted data signals further comprises guard interval introduction. The guard interval introduction can be applied in the downlink transmission methods. Alternatively overlap and save techniques can be utilized also.
The terminal(s) disposing of the spatial diversity device dispose(s) of SP and/or ISP capability that enable subband processing of the distinct samples of the spatial diversity sample. Also, it disposes of the capability for combinatory processing. Combinatory processing refers to process data coming from subbands of the distinct samples in the spatial diversity sample. In the combinatory processing, different techniques can be applied to retrieve or estimate the data coming from the different distinct terminals or to combine the data to be transmitted to distinct terminals. Embodiments include methods for performing the combinatory processing, both for uplink transmission and for downlink transmission.
Combinatory processing in the downlink includes a communication situation whereby the peer disposing of spatial diversity capability, which is referred to as the processing peer, transmits signals to the composite peer, which embodies different terminals transmitting (at least partially simultaneous) so-called inverse subband processed combined data signals (having at least partially overlapping spectra). Determining 250 (see FIG. 1) combined data signals 300 in the transmitting terminal in the downlink transmission method refers to the combinatory processing.
Combinatory processing in the uplink includes a communication situation whereby the peer disposing of spatial diversity capability, which is referred to as the processing peer, receives signals from the composite peer, which embodies different terminals transmitting (at least partially simultaneous) transformed data signals (having at least partially overlapping spectra). The determination of estimates of the data sub-signals 120 (see FIG. 2) from the subband processed received data signals 140 in said receiving terminal in the uplink transmission method refers to the combinatory processing.
The downlink transmission methods are now discussed in more detail. Consider therefore a base station (BS) with A antennas and U simultaneous user terminals (UT) each having Bu (Mu) antennas. The BS simultaneously transmits several symbol streams towards the U UTs: C1 streams towards UT1, C2 streams towards UT2, and so on. Each user terminal UTu receives a mixture of the symbol streams and attempts to recover its own stream of Cu symbols. To this end, each UT can be fitted with a number of antennas Bu greater than or equal to Cu (Bu≧Cu). This transmission scheme can be referred to as SDM-SDMA: SDMA achieves the user separation and SDM achieves the per-user stream separation. The model is typically used for flat fading channels, but it also applies to frequency selective channels with multi-carrier transmission (e.g., OFDM), where flat fading conditions prevail on each sub-carrier.
FIG. 3 illustrates the set-up (the downlink transmission is illustrated from right to left). In the embodiment of FIG. 3, at each time instant k, the BS transmits the signal vector s(k) obtained by pre-filtering the symbol vector x(k), which itself results from stacking the U symbol vectors xu(k) as follows (vectors are represented as boldface lowercase and matrices as boldface uppercase; the superscript T denotes transpose):

s(k)=[s1(k) . . . sA(k)]T=F·x(k)

x(k)=[x1(k)T . . . xU(k)T]T 

xu(k)=[x1u(k) . . . xCuu]T  (formula 1)

Assuming flat fading, the signal received by the uth terminal can be written as follows:

ru(k)=Hu·s(k)+nu(k)  (formula 2)

where Hu are the Bu rows of the full channel matrix H. In other words, Hu is the MIMO sub-channel from the BS to user u. The full channel matrix H has dimension





  
    (
    
      
        ∑
        
          u
          =
          1
        
        U
      
      ⁢
      
        B
        u
      
    
    )
  
  ×
  
    A
    .
  




Each user applies a linear post-filter Gu to recover an estimate of the transmitted symbol vector xu(k):





  
    
      
        
          
            
              
                
                  
                    x
                    ^
                  
                  u
                
                ⁡
                
                  (
                  k
                  )
                
              
              =
              
                
                  G
                  u
                
                ·
                
                  
                    r
                    u
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
            
          
        
        
          
            
              =
              
                
                  
                    G
                    u
                  
                  ·
                  
                    H
                    u
                  
                  ·
                  F
                  ·
                  
                    x
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
                +
                
                  
                    G
                    u
                  
                  ·
                  
                    
                      n
                      u
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          3
        
        )
      
    
  




Note that x(k) contains the symbols of all U users, hence MUI can cause severe signal-to-noise ratio degradation if not properly dealt with.

In order to zero out the MUI, in some embodiments the F matrix is designed such that it block diagonalizes the channel, e.g., the product H·F is block diagonal with the uth block in the diagonal being of dimension Bu×Bu. This ensures that, under ideal conditions, the MUI is substantially eliminated, leaving primarily per-user multi-stream interference, which will be tackled by a per-user processing.

First, it is noted that H is the vertical concatenation of the U “BS-to-user-u” matrices Hu and F is the horizontal concatenation of the U pre-filtering matrices Fu:

H=[H1T . . . HUT]T 

F=[F1 . . . FU]  (formula 4)

The block-diagonalization condition is fulfilled if each Fu is chosen so that its columns lie in the null-space of HCu where HCu is obtained by removing from H the Bu rows corresponding to user u (so Hcu has





  
    
      
        ∑
        
          
            k
            =
            1
          
          ,
          
            k
            ≠
            u
          
        
        U
      
      ⁢
      
        
          B
          k
        
        ⁢
        
          
        
        ⁢
        rows
      
    
    )
  
  :




Fuεnull{HCu}HCu·Fu=O  (formula 5)

To achieve this, matrix N is introduced which is built as follows: N1, the first columns of N, is an orthogonal basis for the null space of HC1; the other columns of N are built in the same way for user 2 to U:N=[N1 . . . Nu]. It is easy to see that each Nu has Du columns where Du is given by:




  
    
      
        
          D
          u
        
        =
        
          A
          -
          
            
              ∑
              
                
                  k
                  =
                  1
                
                ,
                
                  k
                  ≠
                  u
                
              
              U
            
            ⁢
            
              B
              k
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          6
        
        )
      
    
  




Matrix F is defined as N·E where E is also block diagonal with blocks of dimension Bu×Cu. This constrains F to use, per user u, a linear combination of Nu which indeed block diagonalizes the full channel matrix. These linear combinations are contained in the sub-blocks that make up the E matrix.

Matrix G is similarly designed as a block diagonal matrix where each block has dimension Cu×Bu. FIG. 4 illustrates the various matrices used together with their dimensions.

Globally, this strategy is advantageous because the pre- and post-filtering (F and G) can be calculated independently per user. Zeroing the MUI is also advantageous to combat near-far effects.

In certain embodiments, the requirements on the number of antennas are as follows:





  
    
      
        
          
            
              
                
                  
                    B
                    u
                  
                  ≥
                  
                    C
                    u
                  
                
              
            
            
              
                
                  
                    A
                    -
                    
                      
                        ∑
                        
                          
                            k
                            =
                            1
                          
                          ,
                          
                            k
                            ≠
                            u
                          
                        
                        U
                      
                      ⁢
                      
                        B
                        k
                      
                    
                  
                  ≥
                  
                    C
                    u
                  
                
              
            
          
          }
        
        ⁢
        
          
        
        ⁢
        for
        ⁢
        
          
        
        ⁢
        all
        ⁢
        
          
        
        ⁢
        u
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          7
        
        )
      
    
  




Within these limits, the scheme can accommodate terminals with different numbers of antennas, which is an additional advantageous feature.

A joint TX-RX MMSE optimization scheme is modified and extended to take the block diagonalization constraint into account. To this end, the joint TX-RX optimization per user is computed for a MUI free channel: the optimization is performed over channel Hu·Nu for user u. One has the following constrained minimization problem, with Pu denoting the transmit power of user u and the superscript H the Hermitian transpose:




  
    
      
        
          
            
              
                min
                ⁢
                
                  
                
              
              
                
                  E
                  u
                
                ,
                
                  G
                  u
                
              
            
            ⁢
            
              
            
            ⁢
            
              E
              ⁡
              
                [
                
                  
                    
                    
                      
                        
                          x
                          u
                        
                        ⁡
                        
                          (
                          k
                          )
                        
                      
                      -
                      
                        
                          
                            x
                            ^
                          
                          u
                        
                        ⁡
                        
                          (
                          k
                          )
                        
                      
                    
                    
                  
                  2
                  2
                
                ]
              
            
            ⁢
            
              
            
            ⁢
            
              s
              ·
              t
              ·
              
                
              
              ⁢
              
                trace
                ⁡
                
                  (
                  
                    
                      F
                      uH
                    
                    ⁢
                    
                      F
                      u
                    
                  
                  )
                
              
            
          
          =
          
            P
            u
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              min
              ⁢
              
                
              
            
            
              
                E
                u
              
              ,
              
                G
                u
              
            
          
          ⁢
          
            E
            ⁡
            
              [
              
                
                  
                  
                    
                      
                        x
                        u
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    -
                    
                      
                        G
                        u
                      
                      ⁡
                      
                        (
                        
                          
                            
                              H
                              u
                            
                            ⁢
                            
                              N
                              u
                            
                            ⁢
                            
                              E
                              u
                            
                            ⁢
                            
                              
                                x
                                u
                              
                              ⁡
                              
                                (
                                k
                                )
                              
                            
                          
                          +
                          
                            
                              n
                              u
                            
                            ⁡
                            
                              (
                              k
                              )
                            
                          
                        
                        )
                      
                    
                  
                  
                
                2
                2
              
              ]
            
          
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        
          
            s
            ·
            t
            ·
            
              
            
            ⁢
            
              trace
              ⁡
              
                (
                
                  
                    E
                    uH
                  
                  ⁢
                  
                    N
                    uH
                  
                  ⁢
                  
                    N
                    u
                  
                  ⁢
                  
                    E
                    u
                  
                
                )
              
            
          
          =
          
            P
            u
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          8
        
        )
      
    
  




The constrained optimization is transformed into an unconstrained one using the Lagrange multiplier technique. Then, one can minimize the following Lagrangian:





  
    
      
        
          L
          ⁡
          
            (
            
              μ
              ,
              
                E
                u
              
              ,
              
                G
                u
              
            
            )
          
        
        =
        
          

        
        ⁢
        
          
            E
            ⁡
            
              [
              
                
                  
                  
                    
                      
                        x
                        u
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    -
                    
                      
                        G
                        u
                      
                      ⁡
                      
                        (
                        
                          
                            
                              H
                              u
                            
                            ⁢
                            
                              N
                              u
                            
                            ⁢
                            
                              E
                              u
                            
                            ⁢
                            
                              
                                x
                                u
                              
                              ⁡
                              
                                (
                                k
                                )
                              
                            
                          
                          +
                          
                            
                              n
                              u
                            
                            ⁡
                            
                              (
                              k
                              )
                            
                          
                        
                        )
                      
                    
                  
                  
                
                2
                2
              
              ]
            
          
          +
          
            

          
          ⁢
          
            
              λ
              u
            
            ⁡
            
              (
              
                
                  trace
                  ⁡
                  
                    (
                    
                      
                        E
                        uH
                      
                      ⁢
                      
                        N
                        uH
                      
                      ⁢
                      
                        N
                        u
                      
                      ⁢
                      
                        E
                        u
                      
                    
                    )
                  
                
                -
                
                  P
                  u
                
              
              )
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          9
        
        )
      
    
  




where λu is a parameter that has to be selected to satisfy the power constraint. Following an approach similar to [H. Sampath, P. Stoica and A. Paulraj, “Generalised Linear Precoder and Decoder Design for MIMO Channels Using the Weighted MMSE Criterion”, IEEE Transactions on Communications, Vol. 49, No. 12, December 2001] and using the singular value decomposition (SVD) of Hu·Nu, one obtains the following transmit and receive filters Fu and Gu, per user:





  
    
      
        
          
            
              
                
                  H
                  u
                
                ⁢
                
                  N
                  u
                
              
              =
              
                
                  U
                  HN
                  u
                
                ⁢
                
                  
                    ∑
                    HN
                    u
                  
                  ⁢
                  
                    
                      (
                      
                        V
                        HN
                        u
                      
                      )
                    
                    H
                  
                
              
            
          
        
        
          
            
              
                
                  (
                  
                    ∑
                    E
                    u
                  
                  )
                
                2
              
              =
              
                
                  (
                  
                    
                      
                        σ
                        
                          λ
                        
                      
                      ⁢
                      
                        
                          (
                          
                            ∑
                            HN
                            u
                          
                          )
                        
                        
                          -
                          1
                        
                      
                    
                    -
                    
                      
                        
                          σ
                          2
                        
                        ⁡
                        
                          (
                          
                            ∑
                            HN
                            u
                          
                          )
                        
                      
                      
                        -
                        2
                      
                    
                  
                  )
                
                +
              
            
          
        
        
          
            
              
                F
                u
              
              =
              
                
                  
                    N
                    u
                  
                  ⁢
                  
                    E
                    u
                  
                
                =
                
                  
                    N
                    u
                  
                  ⁢
                  
                    V
                    HN
                    u
                  
                  ⁢
                  
                    ∑
                    E
                    u
                  
                
              
            
          
        
        
          
            
              
                G
                u
              
              =
              
                
                  
                    (
                    
                      
                        ∑
                        E
                        u
                      
                      ⁢
                      
                        ∑
                        HN
                        u
                      
                    
                    )
                  
                  
                    -
                    1
                  
                
                ⁢
                
                  
                    (
                    
                      U
                      HN
                      u
                    
                    )
                  
                  H
                
                ⁢
                `
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          10
        
        )
      
    
  




where (·)+ indicates that only the non-negative values are acceptable and, in the last line, only the non-zero values of the diagonal matrix are inverted.

To illustrate the performance of the proposed SDMA-MIMO scheme, a typical multi-user MIMO situation is considered first where a BS equipped with 6 to 8 antennas is communicating with three 2-antenna UTs. Hence, this set-up has 3×2=6 simultaneous symbol streams in parallel. The 3 input bit streams at the BS are QPSK modulated and demultiplexed into 2 symbol streams each. Each symbol stream is divided in packets containing 480 symbols and 100 channel realizations are generated. The entries of matrix H are zero mean independent and identically distributed (iid) Gaussian random variables with variance 1 and are generated independently for each packet. The total transmit power per symbol period across all antennas is normalized to 1.
FIG. 5 shows the performance of the proposed SDMA-MIMO system for the joint TX-RX MMSE design in solid line. Also shown in dotted line is the performance of a conventional single user MIMO system with the same number of antennas (6 to 8 antennas for the BS, 6 antennas for the UT). The scenario where the BS has 6 antennas is the fully loaded case: adding more parallel streams would introduce irreducible MUI. The scenarios where the BS has more than 6 antennas are underloaded and some diversity gain is expected. The single user system typically has a better performance since it has more degrees of freedom available at the receiver for spatial processing (for the conventional case, the receive filter matrix is 6×6 while for our multi-user MIMO case the 3 receive filter matrices are 2×2). An advantageous feature of the proposed SDMA MIMO system is that adding just one antenna at the BS provides a diversity gain of 1 to all simultaneous users. Also, the difference between single user and multi-user performance becomes negligible when the number of BS antennas increases.
Next, the case is considered of an increased number of antennas at the user terminal. Two symbol streams are sent to each terminal and the terminals have 3 antennas (same number at each terminal). The BS has 8 or 9 antennas to satisfy the requirement in formula (7). For comparison, 2 antennas at the UTs have also been simulated. All other parameters are substantially identical to those of the first simulation scenario. The simulation results are shown in FIG. 6. As expected, increasing the number of BS antennas from 8 to 9 provides a diversity improvement. However, increasing the number of receive antennas results in a reduced performance. This counter-intuitive result is due to the fact that the higher number of receive antennas reduces the number of columns of N and, hence, the apparent channel dimension over which the MMSE optimization takes place. More specifically, for 8 antennas at the BS, one has the matrix dimensions given in FIG. 7. It can be seen that the actual channel (Hu·Nu) available for per-user TX-RX MMSE optimization is smaller when the number of RX antennas is large. The BER curves corresponding to these two cases match closely with the BER curves of joint TX-RX MMSE optimization of a 2×4 and 3×2 MIMO system respectively, with a correction of 10 log10(3)=4.8 dB. This correction is due to the power being divided between three users in this exemplary SDMA MIMO system.
An SDMA MIMO scheme was proposed that allows to block-diagonalize the MIMO channel so that the MUI is completely cancelled. It was applied to a joint TX-RX MMSE optimization scheme with transmit power constraint. This design generally results in smaller per user optimization problems. The highest—and most economical—performance increase is shown to be achieved by increasing the number of antennas at the base station side. Increasing the number of antennas at the terminals beyond the number of parallel streams must be done carefully. This block diagonalization is very advantageous for MIMO-SDMA. In this context, it can be applied to a large range of schemes, including linear and non-linear filtering and optimizations, TX-only, RX-only or joint TX-RX optimization. It is also applicable for uplink and downlink. Extension to frequency selective channels is straightforward with multi-carrier techniques such as OFDM.
Consider an approach based on the assumption that the channel is slowly varying and hence channel state information can be acquired through either feedback or plain channel estimation in TDD-based systems and consider among the possible design criteria, the joint transmit and receive Minimum Mean Squared Error (Tx/Rx MMSE) criterion, for it is the optimal linear solution for fixed coding and modulation across the spatial subchannels. Note that the latter constraint is set to reduce the system's complexity and adaptation requirements in comparison to the optimal yet complex bit loading strategy. For a fixed number of spatial streams p and fixed symbol modulation, this design devises an optimal filter-pair (T,R) that decouples the MIMO channel into multiple parallel spatial subchannels. An optimum power allocation policy allocates power only to a selection of subchannels that are above a given Signal-to-Noise Ratio (SNR) threshold imposed by the transmit power constraint. Furthermore, more power is given to the weaker modes of the previous selection, and vice versa. It is clear that the data-streams assigned to the non-selected spatial subchannels are lost, giving rise to a high MMSE and consequently a non-optimal Bit-Error Rate (BER) performance. Moreover, the arbitrary and initial choice of the number of streams p leads to the use of weak modes that consume most of the power. The previous remarks show the impact of the choice of p on the power allocation efficiency as well as on the BER performance of the joint Tx/Rx MMSE design. Hence, it is relevant to consider the number of streams p as an additional design parameter rather than as a mere arbitrary fixed scalar.
In this further aspect of the systems and methods, the issue is addressed of optimizing the number of streams p of the joint Tx/Rx MMSE under fixed total average transmit power and fixed rate constraints for flat-fading MIMO channels in both a single user and multi-user context.
The considered point-to-point SM MIMO communication system is depicted in FIG. 8. It represents a transmitter (Tx) and a receiver (Rx), both equipped with multiple antennas. The transmitter first modulates 830 the signal received from coder (COD) 860 and interleaver (II) 870 and transmits bit-stream b according to a pre-determined modulation scheme (this implies the same symbol modulation scheme over all spatial substreams), then it demultiplexes 834 the output symbols into p independent streams. This spatial multiplexing modulation actually converts the serial symbol-stream s into p parallel symbol streams or equivalently into a higher dimensional symbol stream where every symbol now is a p-dimensional spatial symbol, for instance s(k) at time k. These spatial symbols are then pre-filtered by the transmit filter T 810 and sent onto the MIMO channel through the MT transmit antennas. At the receive side, the MR received signals are post-filtered by the receive filter R 820. The p output streams conveying the detected spatial symbols (k) are then multiplexed 840 and demodulated 844 to recover the initially transmitted bit-stream after being fed through deinterleaver (II−1) 880 and decoder (DECOD) 890. For a flat-fading MIMO channel, the global system equation is given by




  
    
      
        
          
            [
            
              
                
                  
                    
                      
                        s
                        ^
                      
                      1
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    
                      
                        s
                        ^
                      
                      p
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
            
            ]
          
          
            }
            
              
                s
                ^
              
              ⁡
              
                (
                k
                )
              
            
          
        
        =
        
          
            R
            ·
            H
            ·
            T
            ·
            
              
                [
                
                  
                    
                      
                        
                          s
                          1
                        
                        ⁡
                        
                          (
                          k
                          )
                        
                      
                    
                  
                  
                    
                      ⋮
                    
                  
                  
                    
                      
                        
                          s
                          p
                        
                        ⁡
                        
                          (
                          k
                          )
                        
                      
                    
                  
                
                ]
              
              
                }
                
                  s
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
            
          
          +
          
            R
            ·
            
              
                [
                
                  
                    
                      
                        
                          n
                          1
                        
                        ⁡
                        
                          (
                          k
                          )
                        
                      
                    
                  
                  
                    
                      ⋮
                    
                  
                  
                    
                      
                        
                          n
                          
                            M
                            R
                          
                        
                        ⁡
                        
                          (
                          k
                          )
                        
                      
                    
                  
                
                ]
              
              
                }
                
                  n
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          11
        
        )
      
    
  




where n (k) is the MR-dimensional receive noise vector at time k and H 850 is the (MR×MT) channel matrix whose (i,j)th entry, hij, represents the complex channel gain from the jth transmit antenna to the ith receive antenna. In the sequel, the sampling time index k is dropped for clarity.

The transmit and receive filters T 810 and R 820, represented by a (MT×p) and (p×MR) matrix respectively, are jointly designed to minimize the Mean Squared Error (MMSE) subject to average total transmit power constraint as stated in:




  
    
      
        {
        
          
            
              
                Min
                
                  R
                  ,
                  T
                
              
            
            
              
                E
                ⁢
                
                  {
                  
                    s
                    -
                    
                      
                        (
                        
                          RHTs
                          +
                          Rn
                        
                        )
                      
                      2
                      2
                    
                  
                  }
                
              
            
          
          
            
              
                subject
                ⁢
                
                  
                
                ⁢
                
                  to
                  :
                
              
            
            
              
                
                  trace
                  ⁡
                  
                    (
                    
                      TT
                      H
                    
                    )
                  
                
                =
                
                  P
                  T
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          12
        
        )
      
    
  




The statistical expectation E{ } is carried out over the data symbols s and noise samples n. Moreover, uncorrelated data symbols and uncorrelated zero-mean Gaussian noise samples with variance σn2 are assumed so that one has

E(ssH)=Ip E(nnH)=σn2IMR E(snH)=0  (formula 13)

The trace constraint states that the average total transmit power per p-dimensional spatial symbol s after pre-filtering with T equals PT.

Let H=U·Σp·V* be the Singular Value Decomposition (SVD) of the equivalent reduced channel corresponding to the p selected subchannels over which the p spatially multiplexed data-streams are to be conveyed. Considering the equivalent reduced channel corresponding to the p selected subchannels allows the reduction of the later introduced St and Sr to their diagonal square principal matrices as one gets rid of their unused null-part corresponding to the (MR-p) remaining and unused subchannels. These p spatial subchannels are represented by Σp, which is a diagonal matrix containing the first strongest p subchannels of the actual channel H. The optimization problem stated in formula 12 is solved using the Lagrange multiplier technique and leads to the optimal filter-pair (T,R):




  
    
      
        {
        
          
            
              
                T
                =
                
                  V
                  ·
                  
                    ∑
                    t
                  
                
              
            
          
          
            
              
                R
                =
                
                  
                    ∑
                    r
                  
                  ⁢
                  
                    ·
                    
                      U
                      H
                    
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          14
        
        )
      
    
  




where Σt is the (p×p) diagonal power allocation matrix that determines the power distribution among the p spatial subchannels and is given by





  
    
      
        {
        
          
            
              
                
                  ∑
                  t
                  2
                
                ⁢
                
                  =
                  
                    
                      [
                      
                        
                          
                            σ
                            n
                          
                          
                            λ
                          
                        
                        ⁢
                        
                          
                            ∑
                            p
                            
                              -
                              1
                            
                          
                          ⁢
                          
                            
                              -
                              
                                σ
                                n
                                2
                              
                            
                            ⁢
                            
                              ∑
                              p
                              
                                -
                                2
                              
                            
                          
                        
                      
                      ]
                    
                    +
                  
                
              
            
          
          
            
              
                
                  
                    subject  to:  trace
                  
                  ⁢
                  
                    (
                    
                      ∑
                      t
                      2
                    
                    )
                  
                
                =
                
                  P
                  T
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          15
        
        )
      
    
  




The complementary equalization matrix Σr is the (p×p) diagonal matrix given by:





  
    
      
        
          ∑
          r
        
        ⁢
        
          =
          
            
              
                λ
              
              
                σ
                n
              
            
            ⁢
            
              Σ
              t
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          16
        
        )
      
    
  




where [x]+=max(x,0) and λ is the Lagrange multiplier to be calculated to satisfy the trace constraint of formula 15. The filter-pair MMSE solution (T, R) of formula 14 clearly decouples the MIMO channel matrix H 850 into p parallel subchannels. Among the latter available subchannels, those above a given SNR threshold, imposed by the transmit power constraint, are allocated power as described in formula 15. Furthermore, more power is allocated to weaker modes of the previous selection and vice-versa leading to an asymptotic zero-forcing behavior as subsequently shown:





  
    
      
        
          RHT
          =
          
            
              
                
                  [
                  
                    
                      
                        σ
                        n
                      
                      
                        λ
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          p
                          =
                        
                        
                          -
                          1
                        
                      
                      ⁢
                      
                        
                          -
                          
                            σ
                            n
                            2
                          
                        
                        ⁢
                        
                          ∑
                          p
                          
                            -
                            2
                          
                        
                      
                    
                  
                  ]
                
                ·
                
                  
                    λ
                  
                  
                    σ
                    n
                  
                
              
              ⁢
              
                ∑
                p
              
            
            ->
            
              
                I
                p
              
              ⁢
              
                
              
              ⁢
              when
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            σ
            n
          
          ->
          0
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          17
        
        )
      
    
  




The above-described Tx/Rx MMSE design is derived for a given number of streams p, which is arbitrary chosen and fixed. Hence, the filter-pair solution can be accurately denoted as (Tp, Rp). These p streams will always be transmitted regardless of the power allocation policy that may, as previously explained, allocate no power to certain subchannels. The streams assigned to the latter subchannels are then lost, contributing to a bad overall BER performance. Furthermore, as the SNR increases, these initially disregarded modes may eventually be selected and may monopolize most of the power budget, leading to an inefficient power allocation solution. Both previous remarks highlight the influence of the choice of p on the system performance and power allocation efficiency. Hence, the motivation to include p as a design parameter in order to optimize the system performance.
For a fixed number of streams p and a fixed symbol modulation scheme across these streams, the optimal joint Tx/Rx MMSE solution, given by the filter-pair (Tp, Rp), gives rise the minimum Mean Squared Error MSEp:




  
    
      
        
          MSE
          p
        
        =
        
          trace
          ⁡
          
            [
            
              
                
                  
                    (
                    
                      
                        I
                        p
                      
                      -
                      
                        
                          ∑
                          t
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            ∑
                            p
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            ∑
                            r
                          
                        
                      
                    
                    )
                  
                  2
                
                
                  }
                  
                    imperfect
                    ⁢
                    
                      
                    
                    ⁢
                    equalization
                  
                
              
              +
              
                
                  
                    σ
                    n
                    2
                  
                  ⁢
                  
                    ∑
                    r
                    2
                  
                
                
                  }
                  
                    noise
                    ⁢
                    
                      
                    
                    ⁢
                    contribution
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          18
        
        )
      
    
  




which consists of two distinct contributions, namely the imperfect subchannel gain equalization contribution and the noise contribution. Certain embodiments of the systems and methods minimize MSEp with respect to the number of streams p under a fixed rate constraint. The same symbol modulation scheme is assumed across the spatial substreams for a low-complexity optimal joint Tx/Rx MMSE design. This symbol modulation scheme, however, can be adapted to p to satisfy the fixed reference rate R. Hence, the constellation size corresponding to a given number of spatial streams p is denoted Mp. The proposed optimization problem can be drawn:





  
    
      
        {
        
          
            
              
                Min
                p
              
            
            
              
                E
                ⁢
                
                  {
                  
                    MSE
                    p
                  
                  }
                
              
            
          
          
            
              
                subject  to:
              
            
            
              
                
                  p
                  ×
                  log
                  ⁢
                  
                    
                  
                  ⁢
                  2
                  ⁢
                  
                    (
                    
                      M
                      p
                    
                    )
                  
                
                =
                R
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          19
        
        )
      
    
  




The resulting design (popt, Mopt, Topt, Ropt) is referred to as the spatially optimized Joint Tx/Rx MMSE design. For rectangular QAM constellations (e.g., Es=2(Mp−1)/3), the constrained minimization problem formulated in formula 19 reduces to:




  
    
      
        
          Min
          p
        
        ⁢
        
          {
          
            trace
            ⁡
            
              [
              
                
                  
                    2
                    3
                  
                  ⁢
                  
                    (
                    
                      
                        2
                        
                          R
                          /
                          p
                        
                      
                      -
                      1
                    
                    )
                  
                  ⁢
                  
                    
                      (
                      
                        
                          I
                          p
                        
                        -
                        
                          
                            ∑
                            t
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            
                              ∑
                              p
                            
                            ⁢
                            
                              
                            
                            ⁢
                            
                              ∑
                              r
                            
                          
                        
                      
                      )
                    
                    2
                  
                
                +
                
                  
                    σ
                    n
                    2
                  
                  ⁢
                  
                    ∑
                    r
                    2
                  
                
              
              ]
            
          
          }
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          20
        
        )
      
    
  




The latter formulation suggests that optimal popt is the number of spatial streams that enables a reasonable constellation size Mopt, while achieving the optimal power distribution that balances, on the one hand, the achieved SNR on the used subchannels and, on the other hand, the receive noise enhancement.

To illustrate the existence of popt, the optimization problem of formula 20 is solved for a case-study MIMO set-up where MT=MR=6. An average total transmit power PT is assumed PT=1, an average receive SNR=20 dB and a reference rate R=12 bits/channel use. Moreover, as for all the included simulations, the MIMO channel is considered to be stationary flat-fading and is modeled as a MR×MT matrix with iid unit-variance zero-mean complex Gaussian entries. Moreover, perfect (error-free) Channel State Information (CSI) is assumed at both transmitter and receiver sides. FIG. 9 shows popt's existence (a) and distribution (b) when evaluated over a large number of channel realizations.
The reference rate R certainly determines, for a given (MT, MR) MIMO system, the optimal number of streams popt as the MSEp explicitly depends on R as shown in formula 20. This is illustrated in FIG. 10 where popt clearly increases as the reference rate R increases. Indeed, to convey a much higher rate R at reasonable constellation sizes, a larger number of parallel streams is desirable.
The dependence of popt on the SNR is investigated. For a sample channel of the previous MIMO case study, FIG. 10 illustrates the system's MSEp for different SNR values. As expected, the MSEp globally diminishes as the SNR increases. The optimal number of streams popt, however, stays the same for the considered channel. This result is predictable since the noise power σn2 is assumed to be the same on every receive antenna. In these circumstances, the power allocation matrix Σt basically acts on the subchannel gains (σp) (1≦p≦min(MT,MR)) in Σp trying to balance them while Σr equalizes these channel gains. Consequently, to convey a reference rate R through a given (MT, MR) MIMO channel using a transmit power PT, there exists a unique popt which is independent of the SNR. This allows the assumption of the asymptotic high SNR situation when computing popt. In a high SNR situation, the power budget is sufficient for Σt to select and allocate power to all p necessary modes as shown in formula 17. From this, one can find the expression of the Lagrange multiplier λ and re-write formula 15 as follows




  
    
      
        {
        
          
            
              
                
                  ∑
                  t
                  2
                
                ⁢
                
                  =
                  
                    
                      
                        σ
                        n
                      
                      
                        
                          
                            E
                            s
                          
                          ⁢
                          λ
                        
                      
                    
                    ⁢
                    
                      
                        ∑
                        p
                        
                          -
                          1
                        
                      
                      ⁢
                      
                        
                          -
                          
                            
                              σ
                              n
                              2
                            
                            
                              E
                              s
                            
                          
                        
                        ⁢
                        
                          ∑
                          p
                          
                            -
                            2
                          
                        
                      
                    
                  
                
              
            
          
          
            
              
                
                  
                    where:
                  
                  ⁢
                  
                    
                  
                  ⁢
                  λ
                
                =
                
                  
                    (
                    
                      
                        
                          
                            E
                            s
                          
                        
                        ⁢
                        
                          σ
                          n
                        
                        ⁢
                        
                          trace
                          ⁡
                          
                            (
                            
                              ∑
                              p
                              
                                -
                                1
                              
                            
                            )
                          
                        
                      
                      
                        
                          P
                          T
                        
                        +
                        
                          
                            σ
                            n
                            2
                          
                          ⁢
                          
                            trace
                            ⁡
                            
                              (
                              
                                ∑
                                p
                                
                                  -
                                  2
                                
                              
                              )
                            
                          
                        
                      
                    
                    )
                  
                  2
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          21
        
        )
      
    
  




Using the previous expressions of Σt and λ and that of Σr given in formula 16, the expression of MSEp reduces to:





  
    
      
        
          MSE
          p
        
        =
        
          
            
              E
              s
            
            ⁢
            
              σ
              n
              2
            
            ⁢
            
              
                trace
                ⁡
                
                  (
                  
                    ∑
                    p
                    
                      -
                      1
                    
                  
                  )
                
              
              2
            
          
          
            
              P
              T
            
            +
            
              
                σ
                n
                2
              
              ⁢
              
                trace
                ⁡
                
                  (
                  
                    ∑
                    p
                    
                      -
                      2
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          22
        
        )
      
    
  




For high SNRs, the second term in the denominator σn2·trace(Σp−2) is negligible compared to PT. Furthermore, the noise level can be removed. Hence, a simplified error expression Errp can be drawn





  
    
      
        
          Err
          p
        
        =
        
          
            2
            3
          
          ⁢
          
            
              (
              
                
                  2
                  
                    R
                    /
                    p
                  
                
                -
                1
              
              )
            
            ·
            
              
                trace
                (
                
                  ∑
                  p
                  
                    -
                    1
                  
                
                ⁢
                
                  
                
                )
              
              2
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          23
        
        )
      
    
  




The complex MSEp expression of formula 20, which depends on a large amount of parameters and which is composed of highly inter-dependent quantities, can be reduced to a simplified expression Errp that preserves the same monotony and thus the same popt as corroborated in FIG. 8. The simplified Errp, expressed in formula 23, is a product of only two terms, each depending on a single system parameter, namely the channel singular matrix Σp and the reference rate R. The proposed simplified Errp eases popt's computation and more advantageously does not require noise power estimation.
Previously, for channel realization, the existence was exhibited of an optimal number of spatial streams popt which minimizes the system's MMSEp. Consequently, a spatially optimized joint Tx/Rx MMSE design is described that adaptively determines and uses popt and its corresponding constellation size Mopt. In this section, it is investigated how the proposed design bit error rate (BER) performance compares to those of the conventional joint Tx/Rx MMSE and the optimal spatial adaptive loading, where the number of spatial streams p is arbitrarily fixed. FIG. 13 depicts the BER performance of the conventional joint Tx/Rx MMSE design for different fixed number of streams and that of our spatially optimized joint Tx/Rx MMSE for the case study (6,6) MIMO system. The optimized joint Tx/Rx MMSE offers a 10.4 dB SNR gain over full spatial multiplexing, where the maximum number of spatial streams is used p=min(MT,MR), at BER=10−2 and reference rate R=12 bits/channel use. Such a significant performance improvement can be attributed to one or more of several reasons. First, the optimized joint Tx/Rx MMSE design is mostly using popt=3, as can be seen in FIG. 9, which is lower than p=6 used in the full spatial multiplexing case. Reducing the number of used spatial streams allows a better exploitation of the system's spatial diversity, which explains in part the observed higher curve slope. Second, reducing the number of used streams translates into a higher gain equivalent channel. The optimized joint Tx/Rx MMSE design uses the best popt subchannels and discards the weak ones. In addition, the optimized constellation size Mopt guarantees an optimal BER performance. The latter point illustrates that the joint Tx/Rx MMSE design outperforms the conventional joint Tx/Rx MMSE design with fixed p=2 streams, whereas the latter case better illustrates the former points.
FIG. 14 illustrates the comparison between the BER performance of the spatially optimized joint Tx/Rx MMSE and that of the optimal joint Tx/Rx MMSE design for the previously considered MIMO set-up and different reference rates, namely R={12,18,24} bits per channel use. The optimal joint Tx/Rx MMSE refers to the design that adaptively (for each channel realization) determines and uses the number of spatial streams p and the constellation size Mp that minimizes the system BER under average total transmit power and rate constraints. FIG. 14 also illustrates a lower BER bound corresponding to the optimal performance of spatial adaptive loading, combined with MMSE detection. The loading algorithm used herein is the Fischer algorithm, although other analogous algorithms could alternatively be used.
The spatially optimized design clearly exhibits the same average performance as the optimal MMSE. This suggests that the optimization criterion, namely global MSE minimization (see, e.g., formula 19), equivalently minimizes the system's BER. Furthermore, the optimized joint Tx/Rx MMSE design exhibits less than 2 dB SNR loss at BER=10−3 compared to the spatial adaptive loading. This performance difference can be attributed at least in part to the adaptive loading that adapts not only the used number of streams, but also the constellation sizes across these streams, to achieve the lowest possible BER performance. The optimized joint Tx/Rx MMSE design assumes fixed constellations across the spatial streams to reduce the adaptation requirements and complexity. In addition, the optimized joint Tx/Rx MMSE appears to achieve the same diversity order as spatial adaptive loading, as their BER curves have substantially the same slope.
In some embodiments, wherein the number of spatial streams used by the spatial multiplexing joint Tx/Rx MMSE design are optimized, the spatial diversity offered by MIMO systems are better exploited, and hence, significantly improve the system's BER performance. Thus, the systems and methods include a new spatially optimized joint Tx/Rx MMSE design. For a (6,6) MIMO set-up, the latter proposed design exhibits a 10.4 dB gain over the full spatial multiplexing conventional design for a BER=10−2, a unit average total transmit power, a reference rate R=12 bits per channel use and iid channel. Furthermore, the optimality of the spatially optimized joint Tx/Rx MMSE is shown for fixed modulation across streams. Including the number of streams as a design parameter for spatial multiplexing MIMO systems can provide significant performance enhancement.
An alternative spatial-mode selection criterion targets the minimization of the system BER, which is applicable for both uncoded and coded systems. This criterion examines the BERs on the individual spatial modes in order to identify the optimal number of spatial streams to be used for a minimum system average BER.
Both described conventional and even-MSE joint Tx/Rx MMSE designs have been derived for a given number of spatial streams p which is arbitrarily chosen and fixed. These p streams will always be transmitted regardless of the power allocation policy that may, as previously highlighted, allocate no power to certain weak spatial subchannels. The data streams assigned to the latter subchannels are then lost, leading to a poor overall bit error rate (BER) performance. Furthermore, as the SNR increases, these initially disregarded modes will eventually be given power and will monopolize most of the available transmit power, leading to an inefficient power allocation strategy that detrimentally impacts the strong modes. Finally, it has been shown that the spatial subchannel gains exhibit decreasing diversity orders. This means that the weakest used subchannel sets the spatial diversity order exploited by joint Tx/Rx MMSE design. The previous remarks highlight the influence of the choice of p on the transmit power allocation efficiency, the exhibited spatial diversity order and thus on the joint Tx/Rx MMSE designs' bit error rate performance. Hence, it alternatively is proposed to include p as a design parameter to be optimized according to the available channel knowledge for an improved system BER performance, which is subsequently referred to as spatial-mode selection. This approach is applicable for both uncoded and coded systems.
It is advantageous to achieve a spatial-mode selection criterion that minimizes the system's BER. In order to identify such criterion, we can subsequently derive the expression of the conventional joint Tx/Rx MMSE design's average BER and analyze the respective contributions of the individual used spatial modes. For the used Gray-encoded square QAM constellations of size Mp and minimum Euclidean distance dmin=2, the conventional joint Tx/Rx MMSE design's average BER across p spatial modes, denoted BERconv, is approximated by




  
    
      
        
          BER
          conv
        
        =
        
          
            
              2
              
                
                  log
                  2
                
                ⁡
                
                  (
                  
                    M
                    p
                  
                  )
                
              
            
            ·
            
              (
              
                1
                -
                
                  1
                  
                    
                      M
                      p
                    
                  
                
              
              )
            
            ·
            
              1
              p
            
          
          ⁢
          
            
              ∑
              
                k
                =
                1
              
              p
            
            ⁢
            
              
            
            ⁢
            
              erfc
              ⁡
              
                (
                
                  
                    
                      
                        σ
                        k
                        2
                      
                      ⁢
                      
                        σ
                        Tk
                        2
                      
                    
                    
                      σ
                      n
                      2
                    
                  
                
                )
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          24
        
        )
      
    
  




where σk denotes the kth diagonal element of Σp, which represents the kth spatial mode gain. Similarly, σT k is the kth diagonal element of ΣT, whose square designates the transmit power allocated to the kth spatial mode. Hence, the argument





  
    
      σ
      k
      2
    
    ⁢
    
      σ
      
        T
        k
        2
      
    
  
  
    σ
    n
    2
  




is easily identified as the average Signal-to-Noise Ratio (SNR) normalized to the symbol energy Es, on the kth spatial mode. For a given constellation Mp, these average SNRs clearly determine the BER on their corresponding spatial modes. The conventional design's average BER performance, however, depends on the SNRs on all p spatial modes as shown in formula (24). Consequently, the (p×p) diagonal SNR matrix SNRp better characterizes the conventional design's BER, whose diagonal consists of the average SNRs on the p spatial modes:





  
    
      
        
          SNR
          p
        
        =
        
          
            
              
                ∑
                p
                2
              
              ⁢
              
                ·
                
                  
                
                ⁢
                
                  ∑
                  T
                  2
                
              
            
            ⁢
            
              
            
          
          
            σ
            n
            2
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          25
        
        )
      
    
  




Replacing the transmit power allocation matrix ΣT by its expression formulated in formula (21), the previous SNRp expression can be developed into:





  
    
      
        
          SNR
          p
        
        =
        
          
            [
            
              
                1
                
                  
                    σ
                    n
                  
                  ⁢
                  
                    
                      λ
                      ⁢
                      
                        
                      
                      ⁢
                      
                        E
                        s
                      
                    
                  
                
              
              ⁢
              
                
                  ∑
                  p
                
                ⁢
                
                  
                    -
                    
                      1
                      
                        E
                        s
                      
                    
                  
                  ⁢
                  
                    I
                    p
                  
                
              
            
            ]
          
          +
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          26
        
        )
      
    
  




The latter expression illustrates that the conventional joint Tx/Rx MMSE design induces uneven SNRs on the different p spatial streams. More importantly, formula (26) shows that the weaker the spatial mode is, the lower its experienced SNR. Since, the conventional joint Tx/Rx MMSE BER, BERconv, of formula (24) can be rewritten as follows:





  
    
      
        
          BER
          conv
        
        =
        
          
            
              2
              
                
                  log
                  2
                
                ⁡
                
                  (
                  
                    M
                    p
                  
                  )
                
              
            
            ·
            
              (
              
                1
                -
                
                  1
                  
                    
                      M
                      p
                    
                  
                
              
              )
            
            ·
            
              1
              p
            
          
          ⁢
          
            
              ∑
              
                k
                =
                1
              
              p
            
            ⁢
            
              
            
            ⁢
            
              erfc
              ⁡
              
                (
                
                  
                    
                      SNR
                      p
                    
                    ⁡
                    
                      (
                      
                        k
                        ,
                        k
                      
                      )
                    
                  
                
                )
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          27
        
        )
      
    
  




The previous SNR analysis further indicates that the p spatial modes exhibit uneven BER contributions and that that of the weakest pth mode, corresponding to the lowest SNR SNRp(p,p), dominates BERconv. Consequently, in order to minimize BERconv, the optimal number of streams to be used, popt, may be the one that maximizes the SNR on the weakest used mode under a fixed rate R constraint. The latter proposed spatial-mode selection criterion can be expressed:





  
    
      
        {
        
          
            
              
                Max
                p
              
            
            
              
                
                  SNR
                  p
                
                ⁡
                
                  (
                  
                    p
                    ,
                    p
                  
                  )
                
              
            
          
          
            
              
                subject
                ⁢
                
                  
                
                ⁢
                
                  to
                  :
                
              
            
            
              
                
                  p
                  ⨯
                  
                    
                      log
                      2
                    
                    ⁡
                    
                      (
                      
                        M
                        p
                      
                      )
                    
                  
                
                =
                R
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          28
        
        )
      
    
  




The rate constraint shows that, although the same symbol constellation may be used across spatial streams, the selection/adaptation of the optimal number of streams popt includes the joint selection/adaptation of the used constellation size Mopt. Using formula (26) for the considered square QAM constellations (i.e Es=2(Mp−1)/3), the spatial-mode selection criterion stated in formula (24) can be further refined into:





  
    
      
        
          BER
          conv
        
        =
        
          
            
              2
              
                
                  log
                  2
                
                ⁡
                
                  (
                  
                    M
                    p
                  
                  )
                
              
            
            ·
            
              (
              
                1
                -
                
                  1
                  
                    
                      M
                      p
                    
                  
                
              
              )
            
            ·
            
              1
              p
            
          
          ⁢
          
            
              ∑
              
                k
                =
                1
              
              p
            
            ⁢
            
              
            
            ⁢
            
              erfc
              ⁡
              
                (
                
                  
                    
                      SNR
                      p
                    
                    ⁡
                    
                      (
                      
                        k
                        ,
                        k
                      
                      )
                    
                  
                
                )
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          27
        
        )
      
    
  




The previous SNR analysis further indicates that the p spatial modes exhibit uneven BER contributions and that that of the weakest pth mode, corresponding to the lowest SNR SNRp(p,p), dominates BERconv. Consequently, in order to minimize BERconv, the optimal number of streams to be used, popt, may be the one that maximizes the SNR on the weakest used mode under a fixed rate R constraint. The latter proposed spatial-mode selection criterion can be expressed:





  
    
      
        {
        
          
            
              
                Max
                p
              
            
            
              
                
                  SNR
                  p
                
                ⁡
                
                  (
                  
                    p
                    ,
                    p
                  
                  )
                
              
            
          
          
            
              
                subject
                ⁢
                
                  
                
                ⁢
                
                  to
                  :
                
              
            
            
              
                
                  p
                  ⨯
                  
                    
                      log
                      2
                    
                    ⁡
                    
                      (
                      
                        M
                        p
                      
                      )
                    
                  
                
                =
                R
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          28
        
        )
      
    
  




The rate constraint shows that, though the same symbol constellation is used across spatial streams, the selection/adaptation of the optimal number of streams popt includes the joint selection/adaptation of the used constellation size Mopt. Using formula (26) for the considered square QAM constellations (i.e Es=2(Mp−1)/3), the spatial-mode selection criterion stated in formula (28) can be further refined into:





  
    
      
        
          p
          opt
        
        =
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              
                Max
                p
              
              ⁡
              
                [
                
                  
                    
                      1
                      
                        
                          σ
                          n
                        
                        ⁢
                        
                          
                            
                              2
                              3
                            
                            ⁢
                            
                              (
                              
                                
                                  2
                                  
                                    R
                                    /
                                    p
                                  
                                
                                -
                                1
                              
                              )
                            
                            ⁢
                            λ
                          
                        
                      
                    
                    ⁢
                    
                      σ
                      p
                    
                  
                  -
                  
                    1
                    
                      
                        2
                        3
                      
                      ⁢
                      
                        (
                        
                          
                            2
                            
                              R
                              /
                              p
                            
                          
                          -
                          1
                        
                        )
                      
                    
                  
                
                ]
              
            
            +
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          29
        
        )
      
    
  




The latter spatial-mode selection problem has to be solved for the current channel realization to identify the optimal pair {popt,Mopt} that minimizes the system's average BER, BERconv.

A spatial-mode selection is derived based on the conventional joint Tx/Rx MMSE design because this design represents the core transmission structure on which the even-MSE design is based. An exemplary strategy is to first use a spatial-mode selection to optimize the core transmission structure {ΣT,Σpopt,ΣR}, the even-MSE then additionally applies the unitary matrix Z, which is now a popt-tap IFFT, to further balance the MSEs and the SNRs across the used popt spatial streams.
A key element in the method described above is the block diagonalization concept, which is to be realized by carefully determining the matrices F and G. Indeed, the pre-filtering at the base station allows the pre-compensation of the channel phase (and amplitude) in such a way that simultaneous users receive their own signal free of MUI. Additionally, this technique includes quasi-perfect downlink channel knowledge, which can be acquired during the uplink or during the downlink and fed back by signaling. From the point of view of minimizing the signaling overhead and resistance to channel time-variations, the former approach is preferred. One starts from the assumption that the channel is reciprocal, so that the downlink channel matrix is simply the transpose of the uplink channel matrix.
However, the ‘channel’ is actually made up of several parts: the propagation channel (the medium between the antennas), the antennas and the transceiver RF, IF and baseband circuits at both sides of the link. The transceiver circuits are usually not reciprocal and this can jeopardize the system performance.
A system with a multi-antenna base station and a single antenna terminal is described. Note, however, that in other embodiments, the system is extended to a full MIMO scenario (multi-antenna base station and a multi-antenna terminal).
In the uplink, U user mobile terminals transmit simultaneously to a BS using A antennas. Each user u employs conventional OFDM modulation with N sub-carriers and cyclic prefix of length P. Each user signal is filtered, up-converted to RF, and transmitted over the channel to the BS. Each BS antenna collects the sum of the U convolutions and add white Gaussian noise (AWGN) noise. In each antenna branch, the BS then down-converts and filters the signals, removes the cyclic prefix and performs direct Fourier transform, which yields the frequency domain received signals ya[n]. If the cyclic prefix is sufficiently large and with proper carrier and symbol synchronization, the BS observes the linear channel convolutions as cyclic and the following linear frequency domain model results on each sub-carrier n:




  
    
      
        
          
            
              
                
                  [
                  
                    
                      
                        
                          
                            y
                            1
                          
                          ⁡
                          
                            [
                            n
                            ]
                          
                        
                      
                    
                    
                      
                        ⋮
                      
                    
                    
                      
                        
                          
                            y
                            A
                          
                          ⁡
                          
                            [
                            n
                            ]
                          
                        
                      
                    
                  
                  ]
                
                }
              
              
                
                  y
                  UL
                
                ⁡
                
                  [
                  n
                  ]
                
              
            
          
          
            =
          
          
            
              
                
                  
                    [
                    
                      
                        
                          
                            
                              h
                              11
                            
                            ⁡
                            
                              [
                              n
                              ]
                            
                          
                        
                        
                          ⋯
                        
                        
                          
                            
                              h
                              
                                1
                                ⁢
                                U
                              
                            
                            ⁡
                            
                              [
                              n
                              ]
                            
                          
                        
                      
                      
                        
                          ⋮
                        
                        
                          
                            
                          
                        
                        
                          ⋮
                        
                      
                      
                        
                          
                            
                              h
                              
                                A
                                ⁢
                                
                                  
                                
                                ⁢
                                1
                              
                            
                            ⁡
                            
                              [
                              n
                              ]
                            
                          
                        
                        
                          ⋯
                        
                        
                          
                            
                              h
                              AU
                            
                            ⁡
                            
                              [
                              n
                              ]
                            
                          
                        
                      
                    
                    ]
                  
                  }
                
                ⁢
                
                  
                
              
              
                
                  H
                  UL
                
                ⁡
                
                  [
                  n
                  ]
                
              
            
          
          
            ·
          
          
            
              
                
                  [
                  
                    
                      
                        
                          
                            x
                            1
                          
                          ⁡
                          
                            [
                            n
                            ]
                          
                        
                      
                    
                    
                      
                        ⋮
                      
                    
                    
                      
                        
                          
                            x
                            U
                          
                          ⁡
                          
                            [
                            n
                            ]
                          
                        
                      
                    
                  
                  ]
                
                }
              
              
                
                  x
                  UL
                
                ⁡
                
                  [
                  n
                  ]
                
              
            
          
          
            +
          
          
            
              
                [
                
                  
                    
                      
                        
                          n
                          1
                        
                        ⁡
                        
                          [
                          n
                          ]
                        
                      
                    
                  
                  
                    
                      ⋮
                    
                  
                  
                    
                      
                        
                          n
                          A
                        
                        ⁡
                        
                          [
                          n
                          ]
                        
                      
                    
                  
                
                ]
              
              
                }
                
                  n
                  ⁡
                  
                    [
                    n
                    ]
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          30
        
        )
      
    
  




where xUL[n] is the column vector of the U frequency domain symbols at sub-carrier n transmitted by the terminals, yUL[n] is the column vector of the A signals received by the BS antenna branches, and HUL is the composite uplink channel: In the sequel, the explicit dependency on [n] is dropped for clarity.

Including the terminal transmitters and the BS receiver, HUL[n] can be expressed as:

HUL=DRX,BS·H·DTX,MT  (formula 31)

where DRX,BS and DTX,MT are complex diagonal matrices containing, respectively, the BS receiver and mobile terminal transmitters frequency responses (as used herein, the letter D signifies that the matrices are diagonal). The matrix H includes the propagation channel itself, which is reciprocal. In order to recover the transmitted symbols, the BS uses a channel estimation algorithm that provides the estimate ĤUL affected by DRX,BS and DTX,MT.

For embodiments of the downlink, SDMA separation is achieved by applying a per-carrier pre-filter that pre-equalizes the channel. This pre-filtering is included in the FDL matrix of the frequency domain linear model:

yDL=HDL·FDL·DP·xDL+n  (formula 32)

where xDL is the column vector of the U symbols transmitted by the BS, yDL is the column vector of the U signals received by the terminals, DP is an optional power scaling diagonal matrix and HDL is the composite downlink channel. HDL is also affected by the BS and terminals hardware:

HDL=DRX,MT·HT·DTX,BS  (formula 33)

where DTX,BS and DRX,MT are complex diagonal matrices containing, respectively, the BS transmitter and mobile terminal receivers frequency responses and HT is the transpose of H, the uplink propagation channel; clearly, one can use HT for the downlink if the downlink transmission occurs without significant delay after the uplink channel estimation, compared to the coherence time of the channel. For the following description, the channel is assumed to be static or slowly varying, which is a valid assumption for indoor WLAN channels.

For the channel inversion strategy, the pre-filtering matrix is the inverse (or pseudo-inverse if U<A) of the transpose of the uplink channel matrix so that, preferably, the product of the pre-filtering matrix and the downlink channel matrix is the identity matrix. Assuming substantially perfect channel estimation, one can substitute HUL to ĤUL and express FDL as:

FDL=(ĤUL)−T≅(HUL)−T=(DRX,BS·H·DTX,MT)  (formula 34)

Finally, replacing FDL and HDL in the downlink linear system model (see formula 32), the received downlink signal per sub-carrier becomes:




  
    
      
        
          y
          DL
        
        =
        
          
            
              
                
                  
                    D
                    
                      RX
                      ,
                      MT
                    
                  
                  ⁢
                  
                    H
                    T
                  
                  ⁢
                  
                    D
                    
                      TX
                      ,
                      BS
                    
                  
                
                }
              
              
                H
                DL
              
            
            ⁢
            
              
            
            ·
            
              
            
            ⁢
            
              
                
                  
                    D
                    
                      RX
                      ,
                      BS
                    
                    
                      -
                      1
                    
                  
                  ⁢
                  
                    H
                    
                      -
                      T
                    
                  
                  ⁢
                  
                    D
                    
                      TX
                      ,
                      MT
                    
                    
                      -
                      1
                    
                  
                
                }
              
              
                
                  F
                  DL
                
                =
                
                  
                    (
                    
                      H
                      UL
                    
                    )
                  
                  
                    -
                    T
                  
                
              
            
            ⁢
            
              
            
            ·
            
              
            
            ⁢
            
              
                
                  D
                  p
                
                }
              
              Power
            
            ⁢
            
              
            
            ·
            
              
            
            ⁢
            
              x
              DL
            
          
          +
          n
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          35
        
        )
      
    
  




Note that the introduction of Dp allows this model to support other downlink strategies such as channel orthogonalization and, more generally, power control in the downlink.

The linear model presented above lends itself to several useful interpretations and highlights the origin of the MUI:

    
    
        The effect of channel pre-filtering may be altered by the two diagonal matrices appearing between HT and H−T. This is due to transceiver effects at the BS. What causes MUI is the BS non-reciprocity: DTX,BS·(DRX,BS)−1 is not equal to the identity matrix multiplied by a scalar, although this product is diagonal. However, the identity matrix, multiplied by an arbitrary complex scalar, could be “inserted” between HT and H−T without causing MUI.
        The terminal front-end effects (DTX,MT and DRX,MT) generally do not contribute to MUI. However, even with perfect BS reciprocity, DTX,MT and DRX,MT will result in scaling and rotation of the constellations received at the UT, which imposes the use of an equalizer at the UT. The power scaling matrix DP also contributes to amplitude modifications that must be equalized at the terminal. Note that the terminal equalizer is a conventional time-only equalizer (as opposed to space-time equalizers). This equalizer is also useful to compensate the unknown phase of the base station RF oscillator at TX time.
        The propagation matrix H in this model also includes the parts of the BS or terminals that are common to uplink and downlink, hence reciprocal. This is the case for the antennas and for any common component inserted between the antenna and the Tx/Rx switch (or circulator).
    
    


In an embodiment of the system, the MUI introduced by the BS front-end can be avoided by a calibration method that allows measuring the DTX,BS·(DRX,BS)−1 product at the BS so that the mismatches can be pre-compensated digitally at the transmitter.
The block diagram of the SDMA BS Transceiver with the calibration hardware is illustrated in FIG. 15. In this block diagram, the complex frequency response of each transmitter 1510 1514 is represented by a single transfer function dTX,BS,a[n] 1530 1534, which is, for the transmitter 1514 of antenna branch a, the concatenation (product) of the frequency response of the baseband section with the low pass equivalent of the IF/RF section frequency response. These terms are the diagonal elements of the DTX,BS[n] matrix. A similar definition holds for dRX,BS,a[n] 1540 1544.
Before calibration, the carrier frequency and the transceiver parameters that have an effect on the amplitude or phase response of the transmitter 1510 1514 and/or receiver 1520 1524 are set. This includes attenuator, power level, pre-selection filters, carrier frequency, gain of variable gain amplifiers, etc. Note that this may require several calibrations for a given carrier frequency. Once the parameters are set, the frequency responses are assumed static. The calibration is achieved in two steps: TX-RX calibration and RX-only calibration. Note that all described calibration operations are complex.
In one step, the transmit-receive calibration is performed (measurement of DTX,BS·DRX,BS). A transmit/receive/calibration switch 1550 1554 is put in calibration mode: T and R are connected, so as to realize a loopback connection where the transmitter signal is routed all the way from baseband to RF and back from RF to baseband in the receiver 1520 1524. The RF calibration noise source 1580 is turned off. In each antenna branch, a suitable known signal sa (an OFDM symbol with low peak-to-average power ratio) is generated by the digital modem so as to measure the frequency response of the cascaded transmitter and receiver. With the usual assumptions of perfect synchronization and cyclic prefix length, the frequency domain received signal is:

r1k=DTX·DRX·s+nk  (formula 36)

where s=[s1 . . . sA]T and nk is a noise vector, the main contribution of which comes from the LNA noise Figure 1560 1564. K measurements are taken, which is reflected by the index k. The DTX,BS·DRX,BS product can be estimated by averaging the K values of r1k:





  
    
      
        a
        =
        
          
            
              1
              K
            
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                K
              
              ⁢
              
                
              
              ⁢
              
                r
                k
                1
              
            
          
          ≅
          
            diag
            ⁢
            
              
            
            ⁢
            
              (
              
                
                  D
                  
                    TX
                    ,
                    BS
                  
                
                ⁢
                
                  
                
                ·
                
                  
                
                ⁢
                
                  D
                  
                    RX
                    ,
                    BS
                  
                
              
              )
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          37
        
        )
      
    
  




In an additional step, there is only receive calibration (measurement of DRX,BS). The transmit/receive/calibration switch 1550 1554 is connected so as to isolate the receiver 1520 1524 from both the transmitter 1510 1514 and the antenna 1570 1574. The calibration noise source 1580 is turned on. Its excess noise ratio (ENR) is typically sufficient to exceed the thermal noise generated by the LNAs 1560 1564 by 20 dB or more. The signal is sampled and measured at baseband in the receiver 1520 1524 of all antenna branches substantially simultaneously, which is advantageous for perfect phase calibration. The received frequency domain signal is:

r2k=DRX,BS·nrefk+nk  (formula 38)

where nref is the reference noise injected at RF, substantially identical at the input of all antenna branches. DRX,BS cannot be extracted directly, even by averaging, since nref appears as a multiplicative term. However, since an identical error coefficient in all antenna branches is allowed, nref can be eliminated by using the output of one of the antenna branches as reference and dividing the outputs of all branches by this reference value. Without loss of generality, we will take the signal in the first antenna branch r2,1k as reference. This division operation yields:





  
    
      
        
          b
          k
        
        =
        
          
            
              1
              
                r
                
                  2
                  ,
                  1
                
                k
              
            
            ·
            
              r
              2
              k
            
          
          =
          
            
              1
              
                
                  
                    d
                    
                      RX
                      ,
                      BS
                      ,
                      1
                    
                  
                  ·
                  
                    
                  
                  ⁢
                  
                    n
                    ref
                    k
                  
                
                +
                
                  n
                  l
                  k
                
              
            
            ⁢
            
              (
              
                
                  
                    D
                    
                      RX
                      ,
                      BS
                    
                  
                  ·
                  
                    n
                    ref
                    k
                  
                
                +
                
                  n
                  k
                
              
              )
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          39
        
        )
      
    
  




If the reference noise nref is much larger than the receiver noise n, this reduces after averaging K measurements to:





  
    
      
        c
        =
        
          
            
              1
              K
            
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                K
              
              ⁢
              
                b
                k
              
            
          
          ≅
          
            
              1
              
                d
                
                  RX
                  ,
                  BS
                  ,
                  1
                
              
            
            ⁢
            
              D
              
                RX
                ,
                BS
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          40
        
        )
      
    
  




which is a vector containing the frequency responses of the receiver branches with a complex error coefficient, common to all antenna branches.

In the division process, the r2,1k term is normally dominated by the reference noise multiplied by the frequency response dRX,BS,1 of the receiver chain of the first antenna branch. The magnitude of this frequency response is by design non-zero since the filters have low ripple and are calibrated in their passband. However, the amplitude of this term can be shown to be Rayleigh distributed and, hence, can in some cases be very low. It is therefore advantageous to substantially eliminate these values before the averaging process since the non-correlated LNA noise 1560 1564 is dominant in these cases. A suitable criteria is to remove from the averaging process those realizations where the absolute value of r2,1k is smaller than 0.15 . . . 0.25 times its mean value. Finally, the desired value is given by:

a./(c)2≅dRX,BS,12·diag(DTX,BS·DRX,BS−1)  (formula 41)

where ./ stands for element-wise division. These are the values that, in some embodiments, are pre-compensated digitally before transmission. The unknown dRX,BS,12 factor is substantially identical in all branches, but this does not introduce MUI.

A variance analysis of the estimation error of the DRX,BS·(DRX,BS)−1 product shows that with very mild parameter setting (20 dB ENR, 64 point FFT and 32 averages), one reaches an amplitude variance of 0.0008 and a phase variance of 0.0009. At 1 sigma, this corresponds to 0.24 dB amplitude and 1.72° phase differences. This can easily be improved with higher ENR ratio and/or more averaging. These values were obtained for errors before calibration as large as ±3 dB for the amplitude and ±π for the phase.
FIG. 16 shows the BER degradations with and without calibration. ‘5 degr. & 0.7 dB reciprocity mismatch’ indicates that both the phase and amplitude mismatches described above were introduced (a difficult matching requirement for complete TX and RX chain). Note that the 4-user case at a BER of 10−3 is not targeted because the required SNR is higher than 25 dB, even with ideal calibration.
Although this calibration method relieves the TX and RX chain from any matching requirement, it does introduce some matching requirement on the calibration hardware. For example:

    
    
        The splitter (1590 in FIG. 15) outputs are matched between branches
        The directional couplers are matched
        The TX/RX/calibration switch (1550 1554 in FIG. 15) are matched between branches

Mismatches in the calibration hardware can be included in the model by including 4 additional diagonal matrices (T, R, A and C are indicated in FIG. 15):

        DTA (TX-to-Antenna switch transfer function)
        DTR (TX-to-RX switch transfer function)
        DAR (Antenna-to-RX switch transfer function)
        DCR (Calibr. Noise-to-RX transfer function)

Then, the downlink model becomes:

yDL=DRX,MTHTDTADCRDTR−1DAR−1H−TDTX,MT−1DpxDL+n  (formula 42)

The mismatches introduced by the calibration hardware is advantageously minimized. However, this matching requirement is limited to a few components and is easier to achieve than the transmitter and receiver matching required when no calibration is included (matching of overall transfer functions including filters, mixers, LO phases, amplifiers, etc. . . . ).

    
    


An alternative way to solve the non-reciprocity problem is illustrated in FIG. 17. The meaning of the references is as follows: T1=complete TX transfer function (TF) until input of directional coupler #1 (DC1); R1=complete RX TF from DC1 input until the end of RX1 (so T/R switch 1740 1744 is included in T1 and R1); D1=TF of DC1 in the direct path; C1=TF from DC1 input, through coupled port until combined port of top splitter/combiner; T2, R2, D2 and C2 are similarly defined; TR=TF of reference TX until combined port of bottom splitter; and RR=TF from combined port of bottom splitter until the end of reference RX.
The unknowns TX1 1710, RX1 1720, TX2 1714, RX2 1724 are to be determined. Measurements are taken from TX1 1710 to RX-R 1730 and from TX2 1714 to RX-R 1730, yielding MT1=T1×C1×RR and MT2=T2×C2×RR. Next, measurements are taken from TX-R 1734 to RX1 1720 and from TX-R 1734 to RX2 1724, yielding MR1=TR×C1×R1 and MR2=TR×C2×R2. In a following step, the ratio of TX over RX measurements is computed for each branch:

    
    
        MT1/MR1=(T1×C1×RR)/(TR×C1×R1)=(T1/R1)×(RR/TR)
        MT2/MR2=(T2×C2×RR)/(TR×C2×R2)=(T2/R2)×(RR/TR)

These ratios are the desired measurements (T1/R1) and (T2/R2) with a common multiplicative error (RR/TR), which typically does not affect the reciprocity.

    
    


The measurement of the first branch is performed substantially simultaneously to the measurement of the second branch. The LO and sampling clock in the reference TX and RX are locked to the ones in the antenna branches. If needed, to measure the TX1 1710 and TX2 1714, the FDMA scheme with the sub-carriers can be used (e.g., odd sub-carriers from TX1, even sub-carriers from TX2). This approach offers several advantages: nothing needs to be calibrated or matched; compatibility with DBD3 (shared HW in Tx and Rx); can be used for more than 2 branches; no 4-position switch.

## Claims

1. A method of transmitting data signals from at least one transmitting terminal with a spatial diversity capability simultaneously to a plurality of receiving user terminals, each having a spatial diversity receiving capability, the method comprising:
dividing data signals into a plurality of streams of sub-user data sub-signals;
determining combined data signals in the at least one transmitting terminal, said combined data signals being transformed versions of said streams of data sub-signals, said determining comprising filtering said streams of data sub-signals with a filter so designed that at least one spatial diversity device of the receiving user terminals only receives data sub-signals being specific for the corresponding receiving user terminal and having interference between at least two streams of the plurality of streams of sub-user data sub-signals, said filtering being specific for the corresponding receiving user terminal;
inverse subband processing of said combined data signals;
transmitting, simultaneously to the plurality of receiving terminals, with said at least one spatial diversity device said inverse subband processed combined data signals; and
simultaneously on each of the plurality of receiving terminals:
receiving data signals by the spatial diversity receiving device of the receiving terminal, said received data signals being at least a function of said inverse subband processing of said combined data signals;
determining on the receiving terminal estimates of said data sub-signals from said received data signals;
processing, on the receiving terminal, said estimates of the sub-user data sub-signals to eliminate the interference between at least two streams of the plurality of streams; and
collecting by the receiving terminal said estimates of said data sub-signals into estimates of said data signals.

2. The method of claim 1, wherein the spectra of said inverse subband processed combined data signals are at least partly overlapping.

3. The method of claim 1, wherein determining combined data signals in said transmitting terminal is carried out on a subband by subband basis.

4. The method of claim 1, wherein determining said estimates of said data sub-signals in said receiving terminals comprises subband processing.

5. The method of claim 4, wherein said subband processing comprises orthogonal frequency division demultiplexing.

6. The method of claim 1, wherein determining combined data signals in said transmitting terminal comprises:
determining intermediate combined data signals by subband processing said data signals; and
determining said combined data signals from said intermediate combined data signals.

7. The method of claim 6, wherein said subband processing comprises orthogonal frequency division demultiplexing.

8. The method of claim 1, wherein said inverse subband processing comprises orthogonal frequency division multiplexing.

9. The method of claim 1, wherein:
said subbands, being involved in inverse subband processing, are grouped into sets, at least one set comprising at least two subbands;
determining combined data signals in said transmitting terminal comprises:
determining relations between said data signals and said combined data signals on a set-by-set basis; and
exploiting said relations between said data signals and said combined data signals for determining said data signals.

10. The method of claim 1, wherein in said inverse subband processed combined data signals a guard interval is introduced.

11. The method of claim 1, wherein determining estimates of said sub-signals comprises receiver filtering, said filtering in the at least one transmitting terminal and said receiver filtering being determined on a user-per-user basis.

12. The method of claim 1, wherein the number of said streams of data sub-signals is variable.

13. The method of claim 1, wherein the number of said streams is selected in order to minimize the error between said estimates of said data sub-signals and said data sub-signals.

14. The method of claim 1, wherein the number of said streams is selected in order to minimize the system bit error rate.

15. A system for transmitting data signals from at least one spatial diversity transmitter simultaneously to a plurality of receiving user terminals, each having a spatial diversity receiving capability, the system comprising:
at least one spatial diversity transmitter;
circuitry configured to divide data signals into streams of sub-user data sub-signals;
circuitry configured to determine combined data signals in the at least one spatial diversity transmitter, said combined data signals being transformed versions of said streams of data sub-signals, said determining comprising filtering said streams of data sub-signals with a filter so designed that at least one spatial diversity device of the receiving user terminals only receives data sub-signals being specific for the corresponding receiving user terminal and having interference between at least two streams of the plurality of streams of sub-user data sub-signals, said filtering being specific for the corresponding receiving user terminal;
circuitry configured to inverse subband process said combined data signals;
circuitry configured to transmit, simultaneously to the plurality of receiving terminals, said inverse subband processed combined data signals with said spatial diversity transmitter; and
circuitry configured to simultaneously on each of the plurality of receiving terminals:
receive data signals by the spatial diversity device of the receiving terminal, said received data signals being at least a function of said inverse subband processing of said combined data signals;
determine on the receiving terminal estimates of said data sub-signals from said received data signals;
process, on the receiving terminal, said estimates of the sub-user data sub-signals to eliminate the interference between at least two streams of the plurality of streams; and
collect by the receiving terminal said estimates of said data sub-signals into estimates of said data signals.

16. The apparatus of claim 15, wherein said circuitry configured to combine data signals comprises a plurality of circuits each configured to combine data signals based at least on part of the subbands of said data sub-signals.

17. The apparatus of claim 15, wherein said spatial diversity transmitter comprises at least two transmitters and said circuitry configured to transmit inverse subband processed combined data signals comprises a plurality of circuits, each being configured to transmit said inverse subband processed combined data signals with one of said transmitters of said spatial diversity device.

18. A system for transmitting data signals from at least one transmitting terminal with a spatial diversity capability simultaneously to a plurality of receiving user terminals, each having a spatial diversity receiving capability, the system comprising:
means for dividing data signals into a plurality of streams of sub-user data sub-signals;
means for determining combined data signals in the at least one transmitting terminal, said combined data signals being transformed versions of said streams of data sub-signals, said determining comprising filtering said streams of data sub-signals by a filter so designed that at least one spatial diversity device of the receiving user terminals only receives data sub-signals being specific for the corresponding receiving user terminal and having interference between at least two streams of the plurality of streams of sub-user data sub-signals, said filtering being specific for the corresponding receiving user terminal;
means for inverse subband processing of said combined data signals;
means for transmitting, simultaneously to the plurality of receiving terminals, with said at least one spatial diversity device said inverse subband processed combined data signals;
means for receiving data signals, simultaneously on each of the plurality of receiving terminals, by the spatial diversity receiving device of said receiving terminal, said received data signals being at least a function of said inverse subband processed combined data signals;
means for determining, on each of the plurality of receiving terminals, estimates of said data sub-signals from said received data signals; and
means for processing, on the receiving terminal, said estimates of the sub-user data sub-signals to eliminate the interference between at least two streams of the plurality of streams;
means for collecting, on each of the plurality of receiving terminals, said estimates of said data sub-signals into estimates of said data signals.

19. The system of claim 18, wherein said transmission of said inverse subband processed combined data signals is performed in a substantially simultaneous way.

20. The system of claim 18, wherein the spectra of said inverse subband processed combined data signals are at least partly overlapping.

21. The system of claim 18, wherein said means for determining combined data signals in said transmitting terminal comprises means for determining on a subband by subband basis.

22. The system of claim 18, wherein said means for determining said estimates of said data sub-signals in said receiving terminals comprises means for subband processing.

23. The system of claim 22, wherein said means for subband processing comprises orthogonal frequency division demultiplexing.

24. The system of claim 18, wherein said means for determining combined data signals in said transmitting terminal comprises:
means for determining intermediate combined data signals by subband processing said data signals; and
means for determining said combined data signals from said intermediate combined data signals.

25. The system of claim 24, wherein said means for subband processing comprises orthogonal frequency division demultiplexing.

26. The system of claim 18, wherein said means for inverse subband processing comprises orthogonal frequency division multiplexing.

27. The system of claim 18, wherein:
said subbands, being involved in inverse subband processing, are grouped into sets, at least one set comprising at least two subbands;
said means for determining combined data signals in said transmitting terminal comprises:
means for determining relations between said data signals and said combined data signals on a set-by-set basis; and
means for exploiting said relations between said data signals and said combined data signals for determining said data signals.

28. The system of claim 18, wherein said means for inverse subband processing combined data signals comprises a guard interval.

29. The system of claim 18, wherein said means for determining combined data signals further comprises means for transmitter filtering, and wherein said means for determining estimates of said sub-signals comprises means for receiver filtering; said means for transmitter filtering and said means for receiver filtering comprise means for determining on a user-per-user basis.

30. The system of claim 18, wherein the number of said streams of data sub-signals is variable.

31. The system of claim 18, wherein the number of said streams is selected in order to minimize the error between said estimates of said data sub-signals and said data sub-signals.

32. The system of claim 18, wherein the number of said streams is selected in order to minimize the system bit error rate.