2010 International ITG Workshop on Smart Antennas (WSA 2010)

Order-Recursive Precoding for Cooperative Multi-Point Transmission

J org Holfeld, Vincent Kotzsch and Gerhard Fettweis Vodafone Chair Mobile Communications Systems, TU-Dresden, Germany Email: {joerg.holfeld; vincent.kotzsch; fettweis}@ifn.et.tu-dresden.de
AbstractThis paper describes an order-recursive algorithm to calculate the Wiener transmit lter for coherent coordinated multi-point transmissions between several decentralized base stations to several decentralized mobile terminals in cellular radio networks. State of the art implementations do not offer the exibility to handle multiple transmission setups as required for multi-user precoding in conjunction with the proposed reduced complexity. A discussion of all signal processing steps shows how algebraic observations are mapped to physical parameters and how they reect the spatial eigenmodes. These observations can be integrated into a spatial scheduling process to extend the precoding coefcients recursively with additional spatial streams. Finally, experimental results with a hardware platform for cellular eld trials are presented that compare the proposed multiuser interference cancelation technique with a non-cooperative transmission. Index TermsCoherent coordinated multi-point (CoMP); LTE-Advanced; Order-recursive transmit lter; MIMO precoding

I. I NTRODUCTION In last decades cellular mobile communication systems emerged from single-input single-output (SISO) to multipleinput multiple-output (MIMO) multi-user (MU) transmission [1]. Gains for channel capacity and diversity are achieved by multiple transmit and receive antennas in conjunction with space-time codes and single user (SU) stream multiplexing [2]. With MU concepts these spatial degrees of freedom led to enhanced system capacity requiring channel state information at the transmitter (CSIT). In the last years much theoretic work has been done on spatial division multiple access (SDMA) techniques where users share spatial resources by MU interference handling [3]. State of the art base station (BS) deployments incorporate the inter-cell and inter-user interference with randomization or coordination which leads to restrictions on the allocated time-frequency resources and requires cell planning with frequency reuse. Spectral efciency is increased with full frequency reuse, but without interference avoidance particularly cell-edge users are penalized and suffer from intercell interference if the same time-frequency resources are shared. With cooperative base stations the spectral efciency can be increased when several mobile terminals (MT) are jointly served on the same time-frequency resources by spatial precoding or MU beamforming. With coherent coordinated multipoint transmission (CoMP) MU interference is mitigated by forming an effective channel through coherent superposition

of users downlink data. Especially cell-edge users with symmetric links gain from the joint transmission with minimized inter-cell and inter-user interference compared to conventional cellular mobile networks. The EASY-C project [4] aims at bringing the theoretic concepts of CoMP into practice in a test bed in Dresden downtown enabling multi-cell linear transmit processing. In a cellular system a scheduler may switch between a single link transmission comprising one BS and one MT or a single BS multi-user scenario or even the CoMP mode and vice versa. The precoder must be able to cope with different system setups or matrix dimensions respectively. Such an implementation requires a higher exibility to realize precoding algorithms for CoMP BSs compared to non-cooperative setups. Physical link parameters like non-line-of-sight (NLOS), LOS or correlated transmit and receive antenna patterns inuencing the CoMP MU-MIMO eigenvalue spread and nally the spatial diversity and multiplexing gains. Furthermore, in real-time hardware the link parameters are related to nite precision effects. This must be also considered since hardware architectures are constrained by a limited number of processing units and by the limited numerical precision. The goal to implement precoding for CoMP is to preserve high numerical stability respectively low error propagation between the processing stages in conjunction with the heterogeneous CoMP setups. This paper presents a data path architecture for CoMP as generalized matrix inverse with assessable link parameters, controllable error propagation and practical results from the TU-Dresden hardware platform. Notation: Boldface upper case letters denote matrices and lower case letters scalars or vectors respectively. The operators ()T , () and ()H denote the transpose, conjugate and transpose conjugate of a variable. RN M and CN M describe the real and complex space with dimensions of N M . The operator E{} expresses the expectation value and tr() indicates the trace. If H represents a matrix then H[a:b,c:d] selects rows a till b and columns c till d of it. IN is the identity matrix of dimension N N . II. S YSTEM M ODEL The considered multi-user downlink system employs an orthogonal frequency-division multiple access (OFDMA) scheme, where NBS base stations with all in all NT transmit antennas jointly transmit data to NMT mobile terminals with

978-1-4244-6072-4/10/$26.00 2010 IEEE

39

NR receive antennas in total. The baseband model for a frequency at channel is described in frequency domain per subcarrier as = R HWx +n x
N R 1

x+n , =R H

(1)

Although the term HHH is regularized with the noise covariance matrix in (4), in interference (and not noise) limited environments with dense BS deployments the eigenvalue decomposition (EVD) of
nmin

C where x, x are the stacked user data streams which are originally transmitted and estimated after receive processing respectively. The transmit symbol covariance matrix is 2 given with x x = E{x xH } = x INR . It is assumed in the latter that all transmit symbols are uncorrelated and are modulated with equal mean power. The vector n CNR 1 is assumed to be additive white Gaussian noise (AWGN) with noise covariance matrix n n = E{n nH }. The spatial precoder W CNT NR forms together with the physical CN R N R . channel H CNR NT an effective channel H Additionally, the transmit lter is chosen to be sum power constraint as E{ Wx
2

HHH = UUH =
k=1

H 2 k uk uk ,

(6)

} = 2 tr(Wx x WH ) = ETx

(2)

with the power gain R to fulll the equality. Each of the NMT non-cooperative MTs spatially lters the received signal independently such that receive lter matrix R CNR NR is a block matrix of the compound MTs receive lters. Ideally and in the case of the Wiener transmit lter, each receive lter is simplied to a complex diagonal matrix R = 1 INR , because the multi-user interference should have been canceled at BS side. Each MT should estimate this scalar based on the effective channel. But real handset implementations have to employ more advanced synchronization and channel estimation techniques which is not the scope of this paper ([5][6]). The received signal to interference and noise ratio of the precoded user stream l is chosen as performance metric SINRl =
NR k=1,k=l

with the unitary matrix U UNR NR and RNR NR , can be regarded as bound to evaluate the system performance. In a MIMO multi-point scenario there exists at least 2 2 2 1 2 nmin dominant eigenvalues with uk as the corresponding eigenvector to eigenvalue 2 k and nmin = min(NBS , NMT ), because the spatial conditions are determined, e.g., through antenna correlations, path loss or shadowing effects. In the full rank case there exist at most nmin = min(NT , NR ) non-zero eigenvalues. Related to the EVD each spatial user stream is transmitted on a different eigenmode with the power allocated corresponding eigenvalues. With coherent CoMP the user streams are spatially decorrelated as the signal is received at the mobile terminal and so inter-cell and inter-user interference is avoided. With the eigenvalue decomposition the linear transmit lter can be reformulated using (4) and (5) as W = TxWF HH U + UH U and scalar TxWF as TxWF =
2 ETx /x

UH

(7)

tr ( + UH U)2

(8)

[l,l] H [l,k] H

2 2

+ n n ,[l,l]

, 1 l NR . (3)

n n 0

lim TxWF =

2 ETx /x nmin k=1 1 2 k

and l nmin .

(9)

This expresses a power ratio based on the effective channel H which contains the desired user stream [l, l] and other interfering streams [l, k ]. III. O RDER - RECURSIVE
PRECODING WITH SUBSPACE PROJECTIONS

A. Additive Transmit Filter Decomposition Linear precoding algorithms can be classied into the zero forcing (TxZF) and Wiener (TxWF) transmit lter [7] and, not considered here, block diagonalization [8] and iterative methods [9]. The TxWF was derived for the minimum mean squared error criterion as W = TxWF HH HHH + tr(n n ) INR ETx
2 ETx /x 1

The interpretation of (9) leads to following basic results: Under a xed number of transmit antennas in CoMP and with a xed TxWF each additional user stream increases the transmit 2 power. Otherwise for a xed ratio ETx /x each additional user stream reduces the SINR of the effective channel. Especially the smallest eigenvalues affect the transmit power or the SINR. The smallest eigenvalues also determine the performance from a numerical point of view as condition number, i.e., (H) =
2 2 1 /nmin 1.

(10)

(4)

TxWF =

tr HHH (HHH + )2

(5)

If, under the limited precision, eigenvalues are rounded towards zero then the observed numerical rank is below the rank of H. Finally, the number of user streams cannot exceed the number of eigenmodes such that a spatial resource allocation may not include an additional stream which would reduce the SINR of the already precoded streams. A weak eigenmode may not be used in the water lling sense anyway.

40

B. Order-Recursive Updates In static setups like the SU-MIMO case a xed dimension of channel matrix H can be assumed. In contrast, MU-MIMO algorithms with CoMP must be designed for an upper number of cooperative base stations that serve an upper number of mobile terminals. Here, the rows of H are dened as set I to select all antenna links from all CoMP BSs to the receive antenna l at terminal side as spatial stream. With the set of selected spatial streams the Wiener transmit lter can be expressed as
H W[:,I ] = HH [I ,:] H[I ,:] H[I ,:] +

updates of regularized projections through the channel row vector H[I[l] ,:] into the existing precoding solution. The measure of linear independence between the user stream I[l] and the existing precoder W[:,I[1:l1]] is the angle cos I[l] = H[ I[l] ,:] e H[I[l],:] e , 0 I [ l] 2 (19)

1 [I , I ]

(11)

as function of H and the user stream order in I . If I[l] is completely dependent of the already spanned row space the angle is zero. Vice versa a fully independent I[l] is orthogonal. In this case the eigenvalue equals H[I[l],:] 2 . The eigenvalues in (7) bound the observed norms of e
2 1 H[I[l] ,:] PC (H[I e
[1:l1] ,:] 2

The novel idea of order-recursive precoding is based on a recursive lter structure where the precoder extended to stream l is computed from the prior set containing l 1 streams. With each step the set of already considered spatial streams I[1:l1] is extended to I[1:l] =
T I[1: l1]

2 HT [I[l] ,:] nmin ,

e >0

I[l]

(12)

In the simplest case the set can be an interval of the rst stream to stream l. But with this approach neither only a xed set of users must be considered nor a linear order must be kept. Furthermore, predened selection criterion can be applied. Instead of (11) the new precoding vector b CNT 1 for user stream I[l] is expressed as an additive matrix update of the existing precoding vectors with W[:,I[1:l]] = W[:,I[1:l1]] b d[T I[1:l1] ] b , (13)

and the vector d CNT 1 d[I[1:l] ] = H[I[l] ,:] W[:,I[1:l1] ] 1

T

(14)

(20) as partial eigenvalue estimates of every recursive step in which I[l] is larger than zero. The main advantage of subspace projections is the ability to propagate null elements in H[I[l] ,:] to the according position in W[:,I[l]] . With this approach it is inherently possible to handle multiple transmission scenarios such as SISO, MISO and MIMO up to a largest setup without an additional exception handler or reorganizing the matrix elements. A division by zero can be avoided by increasing the denominator with an arbitrary small non-zero number to ensure positive semideniteness. The full pseudo code with all dimensions and a complexity estimation is given in Algorithm 1 as reference for the implementation in a real-time prototyping system. The TxZF solution as a generalized matrix inversion is also known as the Grevilles theorem [10]. Its application and extension as minimum mean squared (MMSE) receive lter can be found in [11]. C. Update Sequence and Criteria With the index vectors of (12) the user streams are decoupled from the iteration numbering. Beforehand or in each recursion the sequence of each processed user stream can be computed based on update criterion as already given in (15). In bad conditioned CoMP scenarios weak eigenmodes can be skipped and the numerical stability is preserved. From the base station point of view the row vector I[l] in H is lled with zeros. This means that either a mobile terminal will not be served in CoMP or a stream to this MT is not included. It can switch to the receive diversity mode if multiple receive antennas are present. Furthermore, quality of service oriented precoding criteria like transmit power, SINRs or user stream priorities beside the condition number can be used as to decide how an additional user affects the system performance and stopping thresholds can be dened. With this minor extension the proposed solution can be extended towards a simple spatial scheduling or resource allocation methodology similar to the tree search of [12]. With each order recursive iteration a set

Finally, b is set dependent on a predened update criterion for order extension b = 0, H[I[l],:] := 0 if is not fullled b otherwise
2

(15) (16)

= e / e b

1/2

[I[1:l] ,I[1:l ]

d[I[1:l] ]

with vector e CNT 1 as

T e = HT [I[l] ,:] H[I[1:l1] ,:] d[I[l1] ] .

(17)

The order recursions are performed with subspace projections as formulated in (14) and (17) as e = (INT (W[:,I[1:l1]] H[I[1:l1] ,:] )T ) HT [I[l] ,:] (18)
PC (H
[I[1:l1] ,:] )

with the orthogonal projector PC (H[I ) onto the com[1:l1] ,:] plementary space which is spanned through the already considered row space of the channel matrix. With this approach the precoding matrix is additively extended with rank-one

41

of available and so far not scheduled user streams is scanned with respect to as scheduling strategy. D. Relation to a one step spatial predictor The approach of order-recursive precoding can be alternatively interpreted as a one step predictor within the spatial domain. With (17) the current realization of channel vector H[I[l] ,:] is predicted through the previous solution of precoder W[:,I[1:l1] ] multiplied with the channel matrix H[I[1:l1] ,:] to compute the instantaneous spatial prediction forward error e. With b the orthonormal vector of error vector e is determined as new precoding vector. Likewise, the backward prediction error is given in (13) through b d[T I[1:l1] ] as increment to the existing precoder. This result shows the relation to the commonly known Levinson recursion [13] for multidimensional observations instead of discrete samples. IV. I MPLEMENTATION D ETAILS For a transformation of (12) to (16) into a data path architecture all operations per recursive step are decomposed into the following basic operations: inner and element wise products, matrix-vector products, outer products and a real division. This leads to a vectorised design which is suitable for pipelined hardware architecture. In [11] a complexity comparison with the O-notation can 2 3 be found with the Cholesky ( O NR NT + 3 / 2 NR ) 2 3 and QR ( O 3/2NRNT + 1/3NR ) decompositions which shows the reduced operation count in 2 Algorithm 1 ( O 3/2 NT NR ). The division of (16) or line 11 in Algorithm 1 is the crucial operation in the proposed algorithm, because a high dynamic range must be covered with a nite precision xed-point arithmetic. Clipping occurs if the denominator of (16) exceeds the largest number in twos complement representation and furthermore the result of (16) can be rounded towards zero if it falls below the smallest fractional number. This behavior can be observed as SINR loss compared to double precision oating-point arithmetic. Which means that spatial streams may not be transmitted with the necessary power or cannot be supported for a proper interference suppression. With an observation of the projection norms e the precoding behavior can be controlled, e.g., in order to precode the next user stream with smallest projection norm. Here, can be used for pivoting to reduce the error propagation. Finally, the order-recursive lter was implemented on realtime FPGA hardware. Only 12 out of 96 xed-point multipliers are occupied on the Xilinx Virtex 4 FPGA. Furthermore, one precoding matrix is computed for up to NT = 6, NR = 6 in an overall delay of 1926 clock cycles and 100 MHz FPGA clock frequency. V. S ETUP AND E XPERIMENTAL R ESULTS A. Physical transmission parameters and laboratory setup The TU Dresden hardware equipment, that is shown in Figure 1, consists of two base stations and two mobile terminals with two transmit (NT = 4) and two receive MT

Algorithm 1 Order-Recursive Wiener Transmit Filter Require: H, , ETx 1: initialize W = 0 CN T N R , h, d, e, b CNT 1 and p2 , TxWF R
2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12:

for l = 1 to NR do set next user stream as I[l] according to h H[T I[l] ,:] T d[I[1:l1] ] W[: ,I[1:l1] ] h d[I[l] ] 1 e h H[T I[1:l1] ,:] d[I[1:l1] ] T T I[1:l] [ I[1:l1] I[l] ] T [ I ] d [1:l] [I[1:l] ,I[1:l] ] d[I[1:l] ] H [I ] p2 e e + dH d
[I[1:l] ]
[1:l]

b e /p2 T W[:,I[1:l]] W[:,I[1:l]] b d[I [1:l] ] 13: end for 2 /tr(W WT ) ETx /x 14: TxWF 15: W TxWF W 16: return W Basic operation count per iteration l: lines 5,6,8 matrix-vector-products: (l 1)(2NT + (l 1)) lines 9,10 inner/element-products: NT + (l 1) lines 11 outer-product: (l 1)NT lines 10 real-divison: 1 2 Overall complexity: O 3/2 NT NR

Figure 1. TU Dresden base station equipment for cooperative multi-point transmission.

antennas (NR = 2) respectively. The transmit antennas of each BS are set up in the middle of both short ends in an indoor laboratory with 8m distance and 2m above the oor (Figure 2). The antenna spacing between the rst and second transmit antenna is 30cm. Both MTs are positioned on the center line with symmetric distances to each BS antenna pair. Five basic positions are chosen, but furthermore the receive antennas are placed on random sub positions to collect in total about 430 measuring points. The physical parameters are summarized in Table I and are basically the physical layer parameters of 3GPP-LTE with

42

10

0.3m

8m

CDF

10

Rayleigh 2x2 Rayleigh 3x2 Rayleigh 4x2 BS1 2x2 BS2 2x2 CoMP 2x2 CoMP 4x2

Figure 2.

Laboratory setup.
10
2

Table I T RANSMISSION PARAMETERS FOR THE PHYSICAL LAYER . DL carrier frequency Bandwidth FFT size Sampling rate Subcarrier spacing Modulation scheme MT1/MT2 BSs / Tx antennas per BS MTs / Rx antennas per MT Allocated DL resource blocks Subcarriers per resource block 2.68 GHz 20 MHz 2048 30.72 MHz 15 kHz 64/16 QAM 2/2 2/1 10 12

10

10

10

Eigenvalue 1
10
0

CDF

10

Rayleigh 2x2 Rayleigh 3x2 Rayleigh 4x2 BS1 2x2 BS2 2x2 CoMP 2x2 CoMP 4x2

10

10

10

10

10

10

Eigenvalue 2
Figure 3. Measured distributions of the spatial eigenvalues for downlink CoMP and non CoMP transmission setups in comparison with at Rayleigh fading.

20 MHz bandwidth. In our setup both base stations are GPS synchronized rstly for a common reference clock signal to guarantee synchronized local oscillators and secondly for a correct frame timing. All mobile terminals send the estimated physical channel coefcients as broadcast feedback to both BSs by allocating separated uplink frequency resources. With the CSIT the precoding matrices are computed redundantly at each BS which avoids an additional high-rate backhaul among them. In order to evaluate the two different channel estimates at the MTs the LTE pilot scheme was modied. Frequency orthogonal cell-specic pilots are dened for the physical channel estimates and are sent back as feedback. Two pilots positions per transmit antenna and physical resource block (PRB) are dened every 6 subcarriers over a range of 10 allocated PRBs. Each MT linearly quantizes the coefcients of those PRBs with 16 bit per complex dimension with a xed SNR value of 20 dB per receive antenna. Furthermore, the effective channels are estimated with stream specic pilots within the 10 PRBs which are included like the cell-specic pilots but on shifted frequency orthogonal resources. Based on the stream specic transfer functions the scalar, here complex, TxWF is estimated by pilot remodulation to equalize the received user streams. Additionally, the SINR (3) is determined as power ratio of the desired spatial stream and the interfering stream of the other mobile terminal plus the noise power. B. CoMP channel characterization Since the MTs are positioned on the direct path between both transmit antenna pairs there is only one signicant channel tap that arises above the noise oor of the observed channel impulse responses (CIR) on a SISO link. In this line of sight dominated environment rather at channel transfer

functions occur. Between the rst and the 120th subcarrier a correlation coefcient of at least 0.5 could be determined. The static spatial environment leads to an innite channel coherence time. Because of this, almost noise free CSIT can be reported to each BS after averaging channel coefcients in time direction. Also the mean channel access delay, including all antenna links, lies only in an interval of about 5 CIR taps. For the cooperative transmission all BSs employ the global channel knowledge to compute the precoding matrices. In the latter, all physical channel matrices are normalized to meet a norm of NT in average for a comparison with the ideal at Rayleigh model. Based on the 4 2 matrices also alternative setups are evaluated to comprise a 2 2 CoMP with only the two rst transmit antennas as well as non-cooperative 2 2 MIMO schemes of each BS. In Figure 3 the cumulative density functions (CDF) of the largest and second largest eigenvalues are plotted. If the rst eigenvalues 1 are compared then the overdetermined spatial setup of the 4 2 CoMP contains the largest eigenvalues. The 2 2 CoMP and the 2 2 local MIMO setup of BS1 show a quite similar density distribution whereas a MU downlink transmission with the local BS2 exploits signicant smaller EVs in 30% of the positions compared to the ideal 2 2 Rayleigh channel. As already discussed in section III-A, the smallest eigenvalues limit the transmission performance. The 4 2 CoMP provides a second eigenmode that is comparable only with the 3 2 Rayleigh channel due to the small contribution of BS2 s EVs. This observation results in Figure 4 where the CDFs of the condition numbers are presented. Also here, 2 2 CoMP

43

1 0.9 0.8 0.7 0.6

CoMP 4x2 Stream Specific SINR [dB]

45 35 30 40 25 20 35 15 10 30 5 0 25 5 10 20 20 15 25 30 35 40 45

0.5 0.4 0.3 0.2 0.1 0 0 10

1 2 3

Rayleigh 2x2 Rayleigh 3x2 Rayleigh 4x2 BS1 2x2 BS2 2x2 CoMP 2x2 CoMP 4x2 10 10 10 10
4

Interfering BS: Sum Link SNR [dB]

CDF

Reference BS: Sum Link SNR [dB] NonCooperative Stream Specific SINR [dB]
45 35 30 40 25 20 35 15 10 30 5 0 25 5 10 20 20 15 25 30 35 40 45

Condition number
Figure 4. Measured distributions of spatial condition numbers.

and BS1 are similar, but slightly worse, conditioned as the 2 2 Rayleigh case. The results show also that BS2 would not be able in most of the observed situations to support more than one spatial data stream. In this 4 2 CoMP mode only 3 of the 4 transmit antennas contribute to an improved spatial condition number. Finally, the results conrm that in a multi-user transmission not always a full multi-user gain can be expected. Furthermore a precoding architecture is required that allows to handle multiple transmission setups and enables a performance tradeoff between MU resource allocation and transmit diversity. C. SINR comparison between CoMP and conventional OFDMA downlink transmission The SINR performance comparison follows from the frequency-orthogonal stream-specic pilots for MT1 and MT2 which are evaluated at each MT. The power ratios between the desired and the interfering stream are plotted in Figure 5. In this experiment not only the 4 2 CoMP with full CSIT also non-cooperative 2 2 precoding was realized. Each MT is served from one reference BS while the other BS is regarded as interferer. For this purpose the feedback coefcients to the interfering base station are lled with zeros to set the channel matrix H as a block matrix (H[1,3:4] = 0 and H[2,1:2] = 0). The SINR as a function of the chosen MT positions does not lead to results in which the cell-center and cell-edge performance was reected, because observed path losses could not be matched with the lab geometry. But on the other hand in the wave propagation environment different link attenuations occurred. So, the SINR is a function of the sum link powers amongst the reference and also the interfering BS antennas with a normalization to the received noise power (Sum Link SNR). Furthermore attenuators of 0dB, 10dB and 20dB are plugged symmetrically to each receive antenna to cover a wider range of receive power levels. The results show that the cell-center performance leads with both BS cooperation strategies to a SINR of at least 15dB.

Interfering BS: Sum Link SNR [dB]

Reference BS: Sum Link SNR [dB] Stream Specific SINR Gain [dB]
45 35 30 40 25 20 35 15 10 30 5 0 25 5 10 20 20 15 25 30 35 40 45

Interfering BS: Sum Link SNR [dB]

Reference BS: Sum Link SNR [dB]

Figure 5. Measured SINR as function of the normalized sum receive powers.

But the CoMP outperforms the non-cooperative mode, because there still occurred a minimum amount of interference power. The CoMP transmit diversity improved the SINR with additional 5-10dB. The major target of CoMP is to improve the cell-edge performance which is reected on the virtual cell-edge as diagonal in the gures. Here, the SINR of the non-cooperative MU transmission falls below 5-10dB whilst the CoMP scheme still achieves a SINR level over 15dB. The further the MT

44

moves into the direction of the interfering cell the more another cooperative BS supports the transmission and so the SINR gains reach at least 15dB. With these results a rst indoor verication of base station cooperation could be shown. Further outdoor measurements must conrm the feasibility in typical cellular propagation environments. VI. C ONCLUSION In this paper an efcient precoding algorithm for linear CoMP transmission was presented which can deal with variable matrix dimension and is of low complexity. Furthermore useful extensions were discussed towards a spatial scheduling to ensure precoding solutions under numerical rank deciencies. The proposed solution was realized in a real-time hardware. With this, indoor measurements characterized the MIMO environment and demonstrated the SINR gains of cooperative multi user downlink transmissions. ACKNOWLEDGMENTS The authors acknowledge the excellent cooperation of all project partners within the EASY-C project and the support by the German Federal Ministry of Education and Research (BMBF). The authors further acknowledge the substantial support of A. Navarro-Caldevilla, J. Heft, and M. P otschke. R EFERENCES
[1] Ming Jiang and L. Hanzo, Multiuser MIMO-OFDM for NextGeneration Wireless Systems, Proceedings of the IEEE, vol. 95, no. 7, pp. 14301469, July 2007. [2] D. Gesbert, M. Kountouris, R.W. Heath, Chan-Byoung Chae, and T. Salzer, Shifting the MIMO Paradigm, Signal Processing Magazine, IEEE, vol. 24, no. 5, pp. 3646, Sept. 2007. [3] Farooq Khan, LTE for 4G Mobile Broadband: Air Interface Technologies and Performance, Cambridge University Press, Cambridge, 2009. [4] R. Irmer, H.-p. Mayer, A. Weber, V. Braun, M. Schmidt, M. Ohm, N. Ahr, A. Zoch, C. Jandura, P. Marsch, and G. Fettweis, Multisite eld trial for LTE and advanced concepts, Communications Magazine, IEEE, vol. 47, no. 2, pp. 9298, February 2009. [5] G.L. Stuber, J.R. Barry, S.W. McLaughlin, Ye Li, M.A. Ingram, and T.G. Pratt, Broadband MIMO-OFDM wireless communications, Proceedings of the IEEE, vol. 92, no. 2, pp. 271294, Feb 2004. [6] V. Kotzsch, J. Holfeld, and G. Fettweis, Joint Detection and CFO Compensation in Asynchronous Multi-User MIMO OFDM Systems, in Vehicular Technology Conference, 2009. VTC Spring 2009. IEEE 69th, April 2009, pp. 15. [7] M. Joham, W. Utschick, and J.A. Nossek, Linear transmit processing in MIMO communications systems, Signal Processing, IEEE Transactions on, vol. 53, no. 8, pp. 27002712, Aug. 2005. [8] Q.H. Spencer and M. Haardt, Capacity and downlink transmission algorithms for a multi-user MIMO channel, in Signals, Systems and Computers, 2002. Conference Record of the Thirty-Sixth Asilomar Conference on, Nov. 2002, vol. 2, pp. 13841388 vol.2. [9] M. Schubert and H. Boche, Solution of the multiuser downlink beamforming problem with individual SINR constraints, Vehicular Technology, IEEE Transactions on, vol. 53, no. 1, pp. 1828, Jan. 2004. [10] Adi Ben-Israel and Thomas N. E. Greville, Generalized Inverses: Theory and Applications, Springer, Berlin, 2003. [11] D. Kuhling and A. Ibing, A novel low-complexity algorithm for linear MMSE MIMO receivers, in Wireless Pervasive Computing, 2008. ISWPC 2008. 3rd International Symposium on, May 2008, pp. 401405. [12] M. Fuchs, G. Del Galdo, and M. Haardt, Low-Complexity Space-TimeFrequency Scheduling for MIMO Systems With SDMA, Vehicular Technology, IEEE Transactions on, vol. 56, no. 5, pp. 27752784, Sept. 2007.

[13] Dimitris G. Manolakis, Vinay K. Ingle, and Stephen M. Kogon, Statistical and Adaptive Signal Processing: Spectral Estimation, Signal Modeling, Adaptive Filtering and Array Processing, Artech House Publishers, City, 2005.

45