Semi-Blind Channel Estimation for LTE DownLink

Size: px
Start display at page:

Download "Semi-Blind Channel Estimation for LTE DownLink"

Transcription

1 TECHNICAL UNIVERSITY OF DENMARK Semi-Blid Chael Estimatio for LTE DowLik by Nicolò Michelusi A thesis submitted i partial fulfillmet for the degree of Master of Sciece MSc i Telecommuicatio Egieerig Supervisors: Lars Christese Nokia Ole Wither DTU Jue 2009

2

3 TECHNICAL UNIVERSITY OF DENMARK Abstract Telecommuicatio Egieerig Departmet of Iformatics ad Mathematical Modelig IMM Master of Sciece Nicolò Michelusi I a MIMO system the umber of chael parameters is much larger tha i a typical SISO sceario, makig the chael estimatio task particularly critical. I fact, this icrease i the umber of chael parameters traslates ito a smaller estimatio accuracy, which is couteracted by trasmittig a loger pilot sequece. This i tur egatively impacts the badwidth efficiecy of the system, makig pilot based approaches less attractive. I this thesis we ivestigate the Semi-Blid approach to chael estimatio i MIMO- OFDM systems, ad i particular for LTE dowlik. This techique, by exploitig the observatios associated to the ukow symbols other the the pilot sequece to perform the chael estimate, potetially leads to a improvemet i the estimatio accuracy compared to the typical pilot based estimatio approach, without requirig a log pilot sequece, despite the large umber of parameters typical of a MIMO sceario. Through simulatios performed o the LTE system we show that the proposed Semi- Blid approaches lead to sigificat improvemets i the estimatio accuracy, both from a MSE ad BER perspective, compared to the typical pilot based techique. However, exploitig the true discrete distributio of the ukow symbols is computatioally demadig, therefore we propose the use of two approximatios o the ukow symbols: the Gaussia ad the Costat Modulus assumptios. These, though sub-optimal from a poit of view of the estimatio accuracy, still lead to sigificat improvemets with respect to the pilot based approach, while reducig the computatioal overhead icurred whe usig true discrete distributio of the ukow symbols.

4

5 Cotets Abstract iii List of Figures vii 1 Itroductio Chael Estimatio i MIMO systems MIMO-OFDM priciples ad system model MIMO model MIMO-OFDM model Model Assumptios Problem Formulatio Traiig sequece chael estimatio of MIMO-OFDM FIR chaels Maximum-Likelihood chael estimatio of a MIMO-OFDM FIR chael Chael Idetifiability Coditios Properties of ML chael estimator Bias of Maximum Likelihood chael estimator Variace of Maximum Likelihood chael estimator White Gaussia Noise at the receiver Semi-Blid chael estimatio Geeral formulatio of Semi-Blid ML estimatio of MIMO-OFDM FIR chaels Brief itroductio to the EM-Algorithm ML solutio through EM-algorithm Semi-Blid ML estimatio: true discrete distributio of the ukow symbols ML solutio through EM-algorithm Semi-Blid ML estimatio: Gaussia approximatio for the ukow symbols ML estimate through EM Algorithm Semi-Blid ML estimatio: Costat Modulus approximatio for the ukow symbols ML solutio through EM-algorithm Joit Semi-Blid Estimatio of chael ad oise covariace matrix Noise Model v

6 vi CONTENTS 4.2 Noise Covariace matrix Estimatio Joit Semi-Blid Estimatio of chael ad oise covariace matrix Pilot based approach Semi-Blid approach Simulatio Results ad Discussio LTE frame structure Simulatio setup Compariso of Semi-Blid ad pilot based approaches for differet atea setups T 1R MIMO T 2R MIMO T 1R MIMO T 2R MIMO, trasmissio rak S = T 2R MIMO, trasmissio rak S = Estimatio accuracy as a fuctio of the sub-carriers Estimatio accuracy as a fuctio of the costellatio order Covergece of the EM-Algorithm, Gaussia approximatio Joit Estimatio of Chael ad oise covariace matrix Coclusio 97 A Complex derivatives 101 B Computatio of the posterior mea of costat modulus symbols 103 C Cramér Rao lower boud 107 C.1 Ubiased Cramér Rao lower boud for Complex parameters C.2 Ubiased CRLB for pilot based estimator of MIMO-FIR chaels C.2.1 The Fisher Iformatio Matrix for the estimatio of h C.3 Ubiased CRLB for Semi-Blid estimatio of MIMO-OFDM FIR Chaels113 Bibliography 119

7 List of Figures 3.1 g N x for differet values of N Plot of fuctio gx ad its approximatio 1 e x Gaussia approximatio versus CM with uiform phase approximatio, stadard deviatio o the posterior expectatio; N = L = 1,R = T = LTE frame structure Pilot allocatio o oe resource block 12 sub-carriers times 7 OFDM symbols for the cases 1,2 ad 4 trasmittig ateas Compariso of pilot based ad Semi-Blid approaches MSE, 1T 1R MIMO-OFDM, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches BER, 1T 1R MIMO-OFDM, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches MSE, 1T 2R MIMO-OFDM, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches BER, 1T 2R MIMO-OFDM, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches MSE, 2T 1R MIMO-OFDM, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches MSE, equivalet chael, 2T 1R MIMO-OFDM, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches BER, 2T 1R MIMO-OFDM, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches MSE, 2T 2R MIMO-OFDM, trasmissio rak 1, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches BER, 2T 2R MIMO-OFDM, trasmissio rak 1, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches MSE, 2T 2R MIMO-OFDM, trasmissio rak 2, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches BER, 2T 2R MIMO-OFDM, trasmissio rak 2, 4-QAM, 72 sub-carriers Compariso of pilot based ad Semi-Blid approaches for differet umber of sub-carriers MSE, 1T 2R MIMO-OFDM, 4-QAM Compariso of pilot based ad Semi-Blid approaches for differet umber of sub-carriers BER, 1T 2R MIMO-OFDM, 4-QAM Compariso of pilot based ad Semi-Blid approaches for differet costellatio orders MSE, 1T 2R MIMO-OFDM, 72 sub-carriers Evolutio of MSE ad BER over the iteratios of the EM-algorithm, 1T 1R MIMO-OFDM, 4-QAM, 72 sub-carriers vii

8 viii LIST OF FIGURES 5.18 Evolutio of MSE ad BER over the iteratios of the EM-algorithm, 2T 2R MIMO-OFDM, trasmissio rak S = 2, 4-QAM, 72 sub-carriers Evolutio of MSE ad BER over the iteratios of the EM-algorithm, 1T 2R MIMO-OFDM, 4-QAM, 72 sub-carriers Joit Estimatio of chael ad oise covariace matrix, MSE of chael estimator, 2T 2R MIMO-OFDM, trasmissio rak 2, 4-QAM, 72 subcarriers Joit Estimatio of chael ad oise covariace matrix BER, 2T 1R MIMO-OFDM, 4-QAM, 72 sub-carriers

9 Chapter 1 Itroductio Durig the last few decades we have experieced a extraordiary growth of wireless commuicatios, which lead to the defiitio of ew mobile commuicatio stadards, with the aim of providig broadbad ubiquitous access to the Iteret. I this cotext, LTE Log Term Evolutio is a 3GPP project uder stadardizatio, promisig dowlik data rates of up to 300Mbps. This is accomplished by employig advaced techologies at the physical layer, such as Orthogoal Frequecy Divisio Multiplexig OFDM ad Multiple-Iput Multiple-Output MIMO to icrease the capacity of the wireless chael. Typically, the badwidth available to wireless commuicatio systems is limited by a series of factors, the most importat of which is the ature of the wireless chael. A defiig characteristic of the wireless chael is multipath fadig, which cosists i the variatio of the chael stregth over time ad frequecy, due to costructive ad destructive superpositio of multiple paths travelig from the trasmitter to the receiver through the wireless medium. The frequecy variatio of the chael is due to the fact that the sigal propagates through distict paths to the receiver, thus arrivig at distict times, causig a spreadig of the chael impulse respose over time, which is equivalet to frequecy selectivity i the frequecy domai. The time variatio of the chael is due to the fact that distict paths ecouter movig obstacles while propagatig through the wireless medium. Moreover, trasmitter ad receiver might be movig etities. These effects cause the chael impulse respose to vary over time. The time widow durig which the chael is assumed to be timeivariat is called time coherece, ad is approximately iversely proportioal to the speed of the receiver, typically of the order of magitude of a few ms. 1

10 2 Chapter 1 Itroductio Typically, wireless commuicatio is established betwee oe trasmittig ad oe receivig atea SISO, Sigle-Iput Sigle-Output systems. However, the capacity achievable i such systems is severely limited by fadig, sice the sigal is severely atteuated whe the chael is i a deep fade. I recet years, MIMO Multiple-Iput Multiple-Output has emerged as the ew atea techology. This has bee proposed as a techique to icrease the capacity ad the reliability of wireless chaels through the adoptio of multiple ateas at the trasmitter ad receiver sides. By adoptig multiple ateas at the receiver, multiple copies of the same sigal propagates through idepedet chaels. Globally, the probability that all the chaels are i a deep fade is reduced, thus improvig chael reliability. This techique is called Receive Diversity. A similar effect is achieved by adoptig multiple ateas at the trasmitter, a techique called Trasmit Diversity. By adoptig multiple ateas at both the trasmitter ad the receiver sides, multiple iformatio streams ca be multiplexed through the trasmittig atea array, a techique called Spatial Multiplexig. Compared to a SISO system, this techique allows a icrease i the capacity of the overall chael by a factor proportioal to the miimum betwee the umber of receivig ad the umber of trasmittig ateas actually to the chael rak. We suggest the iterested reader to read [1] for a thorough treatmet of MIMO systems ad the derivatio of this result. Although MIMO represet a solutio to icrease the capacity ad the reliability of wireless chaels, it is particularly challegig from a chael estimatio perspective. This is explaied i the followig sectio. 1.1 Chael Estimatio i MIMO systems Typically, chael estimatio is performed by isertig a sequece of symbols kow at the receiver termed pilot symbols i the trasmitted frame. At the receiver side the, by observig the output i correspodece of the pilot symbols, it is possible to estimate the chael. This approach is the most commoly used i commuicatio systems, for its low computatioal complexity ad robustess. Its drawback cosists i the fact that the pilot symbols do t carry useful iformatio, therefore they represet a badwidth waste. Moreover, most of the observatios those related to the ukow symbols are discarded i the estimatio process, thus represetig a missed opportuity to ehace the accuracy of the chael estimate. I a MIMO system, chael estimatio is eve more critical tha i a SISO system. I fact, a T R MIMO system where T ad R represet the umber of trasmittig

11 Chapter 1 Itroductio 3 ad receivig ateas respectively ca be represeted as a set of RT idepedet SISO chaels, oe betwee each trasmittig-receivig atea pair. It is clear that the umber of chael parameters to estimate i a MIMO system icreases with the product RT. Uder this coditio, the pilot based chael estimatio approach has a severe limitatio: as we will also demostrate i the course of the thesis, a larger umber of parameters require the trasmissio of a loger pilot sequece. However, the trasmissio of a loger pilot sequece is ot desirable i a commuicatio system, sice they do t carry useful iformatio ad represet a badwidth waste. I this cotext, it becomes importat to develop a ew estimatio approach capable of improvig the chael estimatio accuracy without the eed to trasmit a loger pilot sequece. I this thesis the solutio proposed is Semi-Blid chael estimatio, which cosists i exploitig also the ukow iformatio other tha the pilot sequece to estimate the chael. The potetial advatage, compared to the pilot based approach, cosists i the fact that all the iformatio available at the receiver is exploited i the estimatio process, therefore there is a potetial improvemet i the achievable estimatio accuracy. However, this comes at the cost of a icreased receiver complexity with respect to a pilot based approach, as we will demostrate i the course of the thesis. We start the treatmet by modelig i sectio 1.2 the MIMO-OFDM system, ad itroducig the model assumptios used throughout the thesis. I sectio 1.3 we briefly formalize the chael estimatio problem i MIMO-OFDM systems. The, i chapter 2 we derive a Maximum-Likelihood estimator of MIMO-OFDM chaels usig the typical pilot based approach. We derive i particular a relatio betwee the estimatio accuracy ad the order of the MIMO-OFDM system that is the umber of trasmittig-receivig ateas, highlightig the weakesses of this approach for MIMO systems. I chapter 3 we treat i detail Semi-Blid chael estimatio of MIMO-OFDM chaels, studyig i particular three cases, depedig o the assumptios used for the ukow symbols i the estimatio process: i the first case we exploit the true discrete distributio, i the secod we approximate the distributio of the ukow symbols with a circular Gaussia distributio, i the third case we assume the symbols have costat amplitude ad phase uiformly distributed i [0, 2π valid oly for Costat Modulus costellatios. As we will show i the simulatio results i chapter 5, these three assumptios represet a trade-off betwee estimatio accuracy ad complexity: while usig the true discrete distributio of the ukow symbols is optimal from the poit of view of the estimatio accuracy, from the perspective of the computatioal complexity it is far too demadig; therefore the use of approximatios represet a solutio to reduce the computatioal overhead, i spite of a reduced estimatio accuracy. I geeral, sice i the Semi-Blid approach the Maximum Likelihood solutio caot be determied

12 4 Chapter 1 Itroductio i closed form, the use of iterative algorithms to coverge to a local maximum of the likelihood fuctio is required. We propose the Expectatio-Maximizatio algorithm as a geeral framework to solve this maximizatio problem, where the ukow symbols are treated as hidde variables. So far, we have assumed that the statistical properties of the oise are kow at the receiver. However, this is ot the case i a real commuicatio system. Moreover, the wireless chael is a shared medium. Cosequetly, the receiver udergoes iterferece from other users, whose statistical properties have to be estimated at the receiver. I chapter 4 we derive a algorithm for the joit estimatio of the oise covariace matrix ad of the chael usig the Semi-Blid approach. Fially, i chapter 5 we preset some simulatio results performed o the LTE system, comparig the performace achievable with the Semi-Blid approaches ad the pilotbased approach described i the thesis. 1.2 MIMO-OFDM priciples ad system model MIMO model MIMO Multiple-Iput Multiple-Output is the use of multiple ateas at the trasmitter ad receiver sides, with the purpose of combatig fadig ad icreasig the capacity of wireless commuicatio systems. Let T ad R be the umber of trasmittig ad receivig ateas, respectively. This MIMO system is labeled as T R MIMO, ad ca be represeted as a set of RT SISO chaels, oe betwee each trasmittig-receivig atea pair. Now, let s cosider the sigal at the receiver. Usig, ow ad i the rest of the thesis, the equivalet discrete basebad model, ad assumig that, durig the time spa we observe the evolutio of the model, the chael is time-ivariat block-fadig chael, each SISO chael, modeled as a Fiite Impulse Respose FIR filter of legth L, is described by meas of L complex taps. Therefore, the sigal received at atea r is give by the superpositio of the sigals trasmitted by each atea t = 0... T 1, filtered through the SISO chael betwee atea pairs r, t, plus the oise. This ca be writte as T 1 L 1 y r k = h l r, tx t k l + η r k 1.1 t=0 l=0

13 Chapter 1 Itroductio 5 where y r k is the sigal received o atea r at time k, h l r, t is the lth tap of the FIR SISO chael betwee atea pairs r, t, x t k is the sigal trasmitted through atea t at time k ad η r k is the oise o receivig atea r at time k. Now, stackig the observatios, the trasmitted sigal ad the oise at time k o the colum vectors yk, ηk ad xk respectively, ad lettig h l be a R T matrix with etries give by the lth tap betwee each atea pairs r, t, we ca rewrite 1.1 i matrix form as L 1 yk = h l xk l + ηk 1.2 l=0 which is the Iput-Output relatio of a MIMO system MIMO-OFDM model Now, we go oe step further, ad we defie the iput-output relatio of a MIMO-OFDM system. Orthogoal Frequecy Divisio Multiplexig OFDM is a modulatio techique which cosists i subdividig the available spectrum ito multiple sub-carriers orthogoal to each other. Each sub-carrier is the idepedetly modulated with a low-rate data stream, ad trasmitted through the chael. However, by combiig i the time domai the streams associated to each sub-carrier, the overall data rate achieved is much higher tha the data rates associated to the sigle streams. The advatage of this approach cosists i the fact that the frequecy-selective chael is trasformed ito a set of flat-fadig chaels. This is possible because the badwidth occupied by each subcarrier is much smaller tha the overall badwidth, therefore each sub-carrier udergoes approximately a flat-fadig chael. I this thesis, we treat the implemetatio of OFDM usig the DFT Discrete Fourier Trasform ad Cyclic Prefix, which is the actual implemetatio of OFDM i LTE. Let s cosider a MIMO-OFDM system with N sub-carriers, T trasmittig ad R receivig ateas T R MIMO. Let X k be the MIMO sigal trasmitted o sub-carrier at time k this is a T 1 vector. With OFDM, the time domai sigal is obtaied with the Iverse DFT trasformatio, through the relatio x k p = 1 X ke i2π p N p = CP... N N

14 6 Chapter 1 Itroductio Here x k p is the pth sample of the kth MIMO-OFDM symbol, where this latter term refers to the ordered set of the symbols trasmitted o all the sub-carriers, that is {X k, = 0... N 1}. These samples are the trasmitted i sequece through the chael across the ateas array. Observe that the time-domai sigal is composed of two parts: x k p, p = 0... N 1 is a whole period of the Iverse DFT, whereas x k p, p = CP 1 is the Cyclic Prefix of legth CP, which is added at the begiig of the time-domai stream to make the chael appear cyclic, as we show ow. Notice that, sice the DFT is a periodic sigal with period N, we have x k p = x k N + p, p = CP 1, therefore the isertio of the Cyclic Prefix correspods to the isertio of the last samples of the Iverse DFT at the begiig of the stream. Now, observe the Iput-Output relatio of a MIMO system give by 1.2. Sice the chael is FIR of legth L, the output of the model at time k depeds oly o the trasmitted symbols at times k L k. Therefore, assumig that the Cyclic Prefix satisfies the coditio CP L 1, the output i correspodece of the kth OFDM symbol, cosiderig oly the output samples p = 0... N 1, depeds solely o the symbols trasmitted o the kth symbol. I fact L 1 y k p = h l x p p l + η k p l=0 = 1 L 1 p l i2π h l e N X k + η k p p = 0... N N l=0 It is thus clear that Iter-Symbol Iterferece from previous OFDM symbols is elimiated by settig CP L 1. The, usig this assumptio o the legth of the Cyclic Prefix, ad lettig H be the frequecy domai chael, defied as N times the DFT of the time domai chael h l, we obtai y k p = 1 H X ke i2π p N + η k p p = 0... N N

15 Chapter 1 Itroductio 7 At the receiver, the time-domai sigal is processed usig the N-poits DFT. O subcarrier m we have Y m k = 1 N 1 y k pe i2π pm N N = 1 N = p=0 N 1 p m i2π H X k e N + 1 N 1 η k pm i2π pe N N p=0 p=0 H X kδ m + η m k = H m X m k + η m k 1.6 where η m is the oise vector o sub-carrier m at time k. From this relatio we see that the isertio of the Cyclic Prefix of legth CP L 1 has trasformed a frequecy selective chael ito a set of N flat-fadig chaels. Fially, assumig K OFDM symbols are trasmitted, ad collectig the received ad the trasmitted sigals ad the oise at time k o a matrix, we have the followig Iput-Output relatio for a MIMO-OFDM system: Y = H X + η for = 0... N Here, the subscript represets the sub-carrier idex, Y is the R K observatio matrix with etries Y r, k C represetig the sigal received o sub-carrier at time k o receivig atea r, X is the T K matrix of the trasmitted symbols with elemets X t, k C represetig the symbol trasmitted o sub-carrier at time k from trasmittig atea t, H is the R T chael matrix with etries H r, t C represetig the chael coefficiet betwee atea pair r, t, ad η is the R K oise matrix. Now, let s assume that the matrix of the trasmitted symbols X is a collectio of both pilot symbols, used at the receiver for performig the chael estimate, ad iformatio symbols. We assume also that, i order to suppress multi-atea iterferece durig the estimatio process, at a geeric time k o sub-carrier, either all the ateas are trasmittig pilots or oe of them i this case they are all trasmittig iformatio symbols. With these assumptios, we ca split the matrix of the trasmitted symbols ito the sum of two matrices, the former oe carryig the cotributio from the pilot symbols X tr, with ull etries i correspodece of the ukow symbols, the latter carryig the cotributio from the ukow symbols X bl, with ull etries i correspodece of the pilot symbols. Similarly, we ca split the observatio ad oise matrices ito the observatio ad oise matrices associated to pilot symbols Y tr ad η tr ad ukow symbols respectively Y bl ad η bl. Therefore, o each sub-carrier

16 8 Chapter 1 Itroductio we have the followig decompositio of the observatio, symbol ad oise matrices: X = X tr Y = Y tr η = η tr + X bl + Y bl + η bl Usig this otatio, we ca split the Iput-Output relatio 1.7 as 1.8 { tr Y = H X tr + η tr for = 0... N 1 Y bl = H X bl + η bl for = 0... N The first relatio describes the iput-output model associated to the pilot symbols, the secod istead describes the iput-output model associated to the iformatio symbols. Notice that, i the pilot based approach to chael estimatio, oly the first iputoutput relatio is cosidered, sice oly the pilot observatios are used for the estimate. Coversely, i the Semi-Blid approach all the iformatio is cosidered at the receiver, both Y tr ad Y bl Model Assumptios Based o the MIMO-OFDM model described i the previous sectio, we ow defie the geeral assumptios used throughout the thesis. I particular, we defie the assumptios o the ukow symbols ad o the oise at the receiver. As regards the ukow symbols, we assume that they are obtaied by ecodig across the trasmittig atea array a set of S idepedet streams. The model used is the followig: X bl = CV bl 1.10 where C is a T S precodig matrix, which ecodes S idepedet streams of symbols ito the T trasmittig ateas array, ad V bl is the S K matrix of the iformatio symbols. The etries of this matrix are assumed to be draw uiformly from a discrete costellatio C, idepedetly ad idetically distributed, with zero mea ad mea power σ 2 s. Therefore we have E[V kv k H ] = σ 2 si S. Notice that matrix C ecodes the symbols oly across the trasmittig ateas, ot across time. Its colums represet a set of Hadamard vectors, with the property that C H C = I S, where I S is the S S idetity matrix. Therefore, also the trasmitted symbols are idepedet across time ad across sub-carriers, but they are ot ecessarily idepedet across the trasmittig ateas.

17 Chapter 1 Itroductio 9 I our treatmet we assume S mi {R, T }, sice detector performace would be severely reduced i the case S > mi {R, T } ad good approximate detector desig is sigificatly harder for this case. This assumptio is coheret with the fact that the capacity of a MIMO system liearly icreases with the miimum betwee the umber of receivig ad the umber of trasmittig ateas, which correspods to the rak of the chael matrix assumig there is eough diversity i the wireless medium to make the chael matrix full-rak. As regards the oise, we assume it is a zero mea multivariate Gaussia process, statistically idepedet across time ad across sub-carriers, with covariace matrix o each sub-carrier E[η kη k H ] = Covη or equivaletly precisio matrix B η = Covη 1. Fially, observe that a OFDM system is desiged to support a chael of legth up to the legth of the Cyclic Prefix, i order to suppress Iter-Symbol Iterferece at the receiver. Therefore, i the course of our treatmet, we always assume that the coditio CP L 1 is fulfilled. Moreover, i the study of the chael estimators carried o i the followig chapters, we always assume that the chael legth L is kow at the receiver. 1.3 Problem Formulatio Now that we have defied the system model ad the assumptios used throughout the thesis, before proceedig with the treatmet it is importat to formulate the problem of chael estimatio i MIMO-OFDM systems. Problem Statemet 1.1 Chael Estimatio i MIMO-OFDM systems. Based o a set of observatios correspodig to pilot symbols Y tr ad to the ukow symbols Y bl, ad based o the sequece of trasmitted pilots X tr, the chael estimator attempts to approximate the ukow chael taps {H, = 0... N 1}. I our case, the chael is assumed to be a FIR filter of legth L, therefore there is a fuctioal depedecy of the chael taps i the frequecy domai, give by the Discrete Fourier Trasform. We ca i fact write L 1 H = h l e i2π l N = f h = 0... N l=0 where f. is a fuctio expressig the depedecy of H o the time domai chael h.

18 10 Chapter 1 Itroductio This fact has to be take ito accout i the estimatio process, as we will do i the course of the thesis. I order to read ad uderstad the followig chapters, the reader should be cofidet with the basics of estimatio theory, i particular with Maximum-Likelihood estimatio ad its properties. The iterested reader is suggested to read [2] or [3] for a geeral itroductio to estimatio theory.

19 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels I this chapter we derive a Maximum Likelihood estimator of MIMO-OFDM FIR chaels based solely o the trasmissio of a pilot sequece ad o the observatio of the correspodig output. We study the case of Gaussia oise at the receiver, idepedet across sub-carriers ad across time, with covariace matrix Covη o each sub-carrier. The we apply the results to the simpler case of white Gaussia oise at the receiver, with variace σw 2 o each receivig atea, i order to better uderstad the limits of applicability of the pilot based approach to MIMO systems. I this chapter ad i the followig, where we treat the Semi-Blid approach, we assume to have perfect kowledge of the statistics of the oise at the receiver. However, observe that this assumptio does ot hold true i practice, therefore the oise covariace matrix eeds to be estimated at the receiver as well. This issue is aalyzed i chapter 4 i detail. This chapter is orgaized as follows: based o the system model ad o the assumptios described i the previous chapter i sectio 1.2, i sectio 2.1 we derive a pilot based Maximum Likelihood ML estimator of MIMO-OFDM FIR chaels. We also aalyze the properties of such estimator, i terms of its mea ad its Mea Square Error ad we compare it with the Cramér Rao lower boud which is derived i sectio C.2 of the Appedix. I particular, we aalyze the case of white Gaussia oise at the receiver, sice this gives a deeper isight o the limits of the pilot approach whe applied to a MIMO system. 11

20 12 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels We also derive the ecessary coditio for the idetifiability of the MIMO-OFDM FIR chael, ad we determie the miimal pilot structure which satisfies these idetifiability coditios. 2.1 Maximum-Likelihood chael estimatio of a MIMO- OFDM FIR chael I this sectio, we derive a ML estimator of a MIMO-OFDM FIR chael usig the pilot based approach. As such, oly the observatios correspodig to pilot symbols are cosidered for the estimate Y tr, therefore the blid observatios Y bl are discarded i this chapter. Sice the chael is FIR of legth L, there is a fuctioal depedecy of the chael taps i the frequecy domai, expressed through the DFT L 1 H = h l e i2π l N = 0... N l=0 Therefore the Maximum-Likelihood solutio is determied with respect to the chael taps i the time-domai collected o the parameter matrix h, sice these represet a ucostraied set of parameters, from which the frequecy domai chael is determied through the liear trasformatio give above. Sice the oise at the receiver is statistically idepedet across sub-carriers ad across time, with covariace matrix Covη or equivaletly precisio matrix B η = Covη 1, the likelihood of the observatios, coditioed o the trasmitted pilots ad o the timedomai chael h, is give by p Y tr h, X tr = N 1 =0 { exp trace N 1 =0 [B η Y tr tr 1 K π R B η 2.2 H X tr Y tr ]} H H X tr where K tr is the umber of pilot symbols trasmitted o sub-carrier.

21 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels 13 The maximizatio of the likelihood fuctio 2.2 with respect to its argumets is equivalet to the miimizatio of the egative log-likelihood, give by N 1 l p Y tr h, X tr 1 = K tr l π R B η + N 1 + =0 trace [B η Y tr =0 H X tr Y tr ] H H X tr 2.3 I order to eforce the chael legth costrait, the miimizatio of 2.3 is performed with respect to the time-domai chael matrix h. Keepig oly the terms depedig o h, the ML estimate, ĥ, is solutio to the followig miimizatio problem: ĥ = mi h = mi h { N 1 =0 { N 1 =0 trace [B η Y tr trace H H B η H X tr H X tr Y tr N 1 X trh 2real ] } H H X tr 2.4 =0 trace H H B η Y tr X trh Sice this problem will be ecoutered ofte i the course of this thesis, we express the above equatio i a more geeral form, by defiig the two matrices Λ xx ad Λ yx } as { Λ xx = X tr yx = Y tr Λ X trh X trh = 0 N The, we ca rewrite 2.4 as ĥ = mi h { N 1 =0 trace H H B η H Λ xx N 1 2real =0 trace H H B η Λ H yx = mi h {f h} 2.6 where we have defied the cost fuctio } f h = N 1 =0 trace H H B η H Λ xx N 1 2real =0 trace H H B η Λ H yx 2.7 The miimizatio is carried out by computig the derivative of 2.7 with respect to the chael etries {h l r, t, l = 0... L 1, r = 0... R 1, t = 0... T 1}, ad equalig this derivative to zero. The complex derivative defied i Appedix A with respect to

22 14 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels etry h l r, t of the time-domai chael is give by N 1 f h h l r, t = [ ] trace δt, rb η H Λ xx δt, rb η Λ yx e i2π l N = =0 N 1 =0 [B η H Λ xx Λ l yx ei2π N = ]rt where δt, r is a matrix whose etries are equal to zero except for the etry at positio t, r which is equal to 1. Rewritig the above equatio i matrix form we have N 1 =0 B η Λ yx e i2π l N N 1 = =0 B η H Λ xx e i2π l N 2.9 Now, expressig H as the Fourier trasform of the time-domai chael, we obtai N 1 =0 B η Λ yx e i2π l N = L 1 N 1 p=0 =0 B η h p Λ l p i2π xx e N 2.10 I order to determie a solutio to this problem, let s cosider the etry at positio r, t of the above system of equatios, ad let s make explicit the matrix product operatio i the followig way N 1 =0 L 1 = B η Λ yx e i2π l N N 1 p=0 =0 L 1 = p=0 r 1 t 1 rt L 1 = N 1 p=0 =0 B η h p Λ xx e B η r, r 1 h p r 1, t 1 Λ xx t 1, te r 1 t 1 B η r, r 1 Λ l p i2π xx t 1, te N l p i2π N l p i2π N rt h p r 1, t where for coveiece we dropped the extrema of the sum over the sub-carrier umber. Now, let Γ tr xx be a LRT LRT matrix with elemets Γ tr xx RT l + T r + t; RT p + T r 1 + t 1 = = B η r, r 1 Λ l p i2π xx t 1, te N B η Λ xx l p i2π e N T r+t,t r 1 +t

23 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels 15 where the otatio A B represets the Kroecker product betwee A ad B, that is, assumig A is a M N matrix A0, 0 B A0, 1 B... A0, N 1 B. A1, 0 B A1, 1 B... A B = AM 1, 0 B AM 1, 1 B... AM 1, N 1 B The, let s redefie h as a LRT 1 colum vector with etries hrt l + T r + t = h l r, t 2.14 ad similarly let Γ tr yx be a colum vector with etries Γ tr yx RT l + T r + t = N 1 =0 B η Λ yx e i2π l N rt 2.15 The, we ca rewrite 2.10 i matrix form as Fially, assumig that Γ tr xx Γ tr yx = Γ tr xx h 2.16 is full rak, ad therefore ivertible we will discuss about the ecessary coditios i sectio 2.1.1, the Maximum Likelihood estimate of the time-domai chael is give by ĥ tr = Γ tr 1 xx Γ tr yx 2.17 The, lettig Ĥtr be a NRT dimesioal colum vector with elemets Ĥ tr RT + T r + t = H r, t 2.18 ad ŨN a N L matrix obtaied by takig the first L colums of the N N Fourier matrix U N with elemets U N, l = 1 N e i2π l N, we ca write the frequecy domai chael estimate as Ĥ tr = N ŨN I RT ĥtr 2.19 where I K is the K K idetity matrix. Sice this estimator will be used ofte i the course of our treatmet of Semi-Blid estimators, it is coveiet to iclude all the operatios ivolved i the estimatio of the time-domai chael ito a Black-Box, that is a fuctio H, takig as iput the

24 16 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels symbol autocorrelatio Λ xx, the correlatio betwee the observatios ad the trasmitted symbols Λ yx ad the oise precisio matrix B η o each sub-carrier the chael legth L, the umber of receivig ad trasmittig ateas R ad T are dropped for coveiece, ad returig the time-domai chael estimate. That is ĥ tr = H Λ xx, Λ yx, B η, = 0... N With these iputs we ca easily compute 2.12 ad 2.15, which ca the be used to estimate the chael usig We ow preset a result o the ecessary coditios for the idetifiability of the chael said i aother way, the chael is idetifiable if there are o ambiguities o the determiatio of the ML estimate Chael Idetifiability Coditios Theorem 2.1 Necessary idetifiability coditio of the chael for the pilot based approach through ML estimate. The ecessary but ot sufficiet coditio for the idetifiability of the chael is N 1 =0 rak X tr X trh LT 2.21 Proof. From equatio 2.17 we see that the chael matrix h is idetifiable if ad oly if Γ tr xx is ivertible, or equivaletly, if ad oly if it is full rak. Observe that Γ tr xx ca be rewritte i the followig form: Γ tr xx H = N ŨN I RT Λ ŨN I RT 2.22 where Λ is a block diagoal NRT NRT matrix obtaied by stackig the matrices B η Λ xx alog the diagoal. The for the rak of Γ tr xx, usig the product rule we have rak Γ tr xx { } mi rak ŨN I RT, rak Λ 2.23 Now, matrix ŨN is full rak, sice its colums belog to a set of orthoormal vectors the colums of the Fourier matrix U N represet a set of orthoormal vectors, therefore we have: rak ŨN I RT = LRT 2.24

25 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels 17 Λ is a block diagoal matrix, therefore its rak is equal to the sum of the raks of its diagoal blocks: rak Λ = N 1 =0 { rak B η Λ xx } 2.25 ad sice B η is a full-rak square matrix with rak R we ca rewrite, usig the fact that rak A B = rak A rak B: N 1 rak Λ = R =0 rak Λ xx 2.26 Fially, usig 2.23 we have: rak Γ tr xx { mi LT, N 1 =0 } rak Λ xx 2.27 Therefore, substitutig Λ xx rak is: = X tr X trh the ecessary coditio for Γ tr xx to be full N 1 =0 rak X tr X trh LT 2.28 which completes the proof. We ow preset aother broader ecessary coditio for the chael idetifiability, determiig the miimum umber of pilot symbols ecessary for the chael to be idetifiable. Lemma 2.2. The miimum umber of pilots ecessary for the chael to be idetifiable is { mi K tr }, T LT 2.29 Proof. I fact from chael idetifiability coditio 2.21 we have N 1 =0 rak X tr X trh LT 2.30

26 18 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels Now, for the pilot correlatio terms we have X tr X trh = k X tr kx trh k 2.31 where X tr k is the vector of the pilots trasmitted at time k, or zero if o pilots are trasmitted at time k. Observe that each matrix X tr kx trh k has rak oe if a pilot is trasmitted at time k, or rak zero otherwise, therefore, sice o sub-carrier K tr pilots are trasmitted, the rak of the correlatio matrices is give by rak X tr Fially we obtai X trh N 1 =0 = rak rak X tr k X tr X trh kx trh From the above iequality we see that, if mi { k { mi K tr { mi K tr }, T }, T K tr }, T < LT, the ecessarily coditio 2.21 is ot satisfied. Therefore a ecessary coditio o the umber of pilots is which proves the lemma. { mi K tr }, T LT 2.34 However observe that, eve if coditio 2.29 of the lemma is satisfied, the ecessary coditio 2.21 may still ot be satisfied. This is a cosequece of the iequality used i Assumig K tr T o all the N tr N sub-carriers carryig pilots, the above lemma reduces to the coditio N tr L Properties of ML chael estimator I this sectio we study the properties of the Maximum Likelihood chael estimator give by equatio 2.19, i terms of its Bias ad Variace. However, oly for the calculatio of the bias, we assume that the oise precisio matrix B η used for estimatig the chael is ot ecessarily equal to the true oise precisio matrix. This result will be used later durig the thesis. Therefore, let B η be the true oise precisio matrix o sub-carrier, ad B η the oe actually used to estimate the chael.

27 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels Bias of Maximum Likelihood chael estimator Calculatig the expectatio of 2.19 with respect to the observatios we obtai [Ĥtr ] E = N ŨN I RT [ Γ xx tr 1 E Γ tr yx ] 2.35 Now, usig B η istead of B η for the expressio of Γ tr xx [ ] E from 2.15 we have Γ tr yx ad Γ tr yx, for the etries of [ ] N 1 E Γ tr yx RT l + T r + t = p=0 =0 L 1 N 1 = B η H X tr =0 B η h p X tr X trh e i2π l N X trh rt l p i2π e N rt 2.36 where i the last equality we expressed the frequecy domai chael as the Fourier trasform of the time domai chael. The, makig explicit the matrix products we obtai [ ] E Γ tr yx RT l + T r + t = L 1 N 1 p=0 r 1 t 1 =0 B η r, r 1 X tr X trh t 1 t ei2π l p N hp r 1, t Recogizig ad substitutig i the above expressio the etries of Γ tr xx give by 2.12, we ca rewrite the above expressio as [ E Γ tr yx Fially, substitutig ito the bias of the estimator ] = Γ tr xx h 2.38 [Ĥtr ] E = N ŨN I RT Γ tr 1 xx Γ tr xx h = N ŨN I RT h = H 2.39 which demostrates that the ML estimator is ubiased. This results shows also that the ML chael estimator is ubiased eve if we do t use the true oise covariace matrix for the estimate. This result will be used i chapter 4 for the joit estimatio of the chael ad of the oise covariace matrix o each sub-carrier.

28 20 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels Variace of Maximum Likelihood chael estimator Now, we defie the Mea Square Error of the estimator as the sum of the Mea Square Error for the estimatio of each etry of the chael matrix, divided by the umber of etries. This ca be thought as the Mea Square Error for the estimatio of the chael matrix etries, averaged over all the etries. For the case uder cosideratio, the Mea Square Error correspods to the variace of the estimator sice the estimator is ubiased, as demostrated i Therefore for the variace we have = 1 RT E { [ Ĥtr trace H Ĥtr ]} H H Ĥtr Var = 1 NRT E = 1 { [ RT E trace ŨN ĥtr I RT h ĥtr H ]} H h ŨN I RT { [ ĥtr H trace h ĥtr h ]} 2.40 where i the last equality we used the fact that traceab = traceba, ad Ũ H N ŨN = I L. The, substitutig ito ĥtr the ML solutio give by 2.17 we obtai Ĥtr Var = 1 { RT trace Γ tr 2 xx E [ Γ tr yx [ E Γ tr yx ] [ Γ tr yx E Γ tr yx ] H ]} 2.41 where we used the fact that h = Γ tr 1 xx For the etries of the term E E = { [ Γ tr yx N 1 =0 [ E E { [ B η [B η Y tr [ Γ tr yx Γ tr yx Y tr E[Γ tr [ E ] Γ tr yx H X tr yx ] from 2.38 ad Γ tr xx is Hermitia. ] [ ] ] H E we have Γ tr yx [ E H X tr Γ tr yx Γ tr yx ] X trh ] H ] r 1 t 1 Γ tr yx l,r 1,t 1 ;p,r 2,t 2 ] } X trh l p i2π e N 2.42 r 2 t 2 }

29 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels 21 Now, makig explicit the matrix products we obtai E = = { [ Γ tr yx N 1 =0 s 1 s 2 [ E k Γ tr yx [ E Y tr B η r 1, s 1 X tr N 1 =0 ] [ Γ tr yx E Γ tr yx ] H ] H X tr Y tr s 1 k t 1, kb η s 2, r 2 X tr t 2, ke B η r 1, s 1 Cov η s1 s 2 B η s 2, r 2 s 1 s 2 l,r 1,t 1 ;p,r 2,t 2 } H X tr s 2 k l p i2π N k X tr = 2.43 ] t 1, kx tr t 2, ke l p i2π N where i the last equality we used the defiitio of oise covariace matrix Cov η. Fially, observig that s 1 s 2 B η r 1, s 1 Cov η s1 s 2 B η s 2, r 2 = B η Cov η B η r1 r 2 = B η r 1, r we obtai E = { [ Γ tr yx N 1 =0 [ E Γ tr yx B η r 1, r 2 ] X tr Γ tr yx [ E Γ tr yx ] H ] l,r 1,t 1 ;p,r 2,t 2 X trh e i2π l p N 2.45 t 2 t 1 } = ad comparig the above expressio with the etries of Γ tr xx {[ [ E Γ tr yx E Γ tr yx ] Γ tr yx [ E Γ tr yx ] H ]} i 2.12 we ca rewrite = Γ tr xx 2.46 Fially, substitutig this expressio ito the expressio for the variace of the estimator i 2.41 we obtai the followig result: Ĥtr Var = 1 RT trace Γ xx tr 1 which represets the variace MSE of the Maximum Likelihood estimator I coclusio, the Maximum Likelihood estimator derived i the previous sectio is Ĥtr ubiased with variace Var = 1 RT trace Γ tr 1 xx. I the Appedix, i sectio C.2 we derive the Cramér Rao lower boud for the pilot based approach, showig that the ML estimator achieves the CRLB for ay cofiguratio of the pilot grid.

30 22 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels White Gaussia Noise at the receiver I the previous sectio we derived the expressio for the ML FIR chael estimator for Gaussia oise at the receiver with covariace matrix Covη o each sub-carrier, ad we derived its properties i terms of bias ad variace. I order to better uderstad the estimatio accuracy achievable with the pilot based approach, it is iterestig to study the particular case of white Gaussia oise at the receiver, with variace σw 2 o all sub-carriers ad o all receivig ateas. I this case the covariace matrix is give by Covη = σ 2 wi R precisio matrix is give by B η = 1 σ 2 w I R., or equivaletly the Moreover, we also assume a typical sceario where the pilots are allocated o sub-carrier 0 < S tr ad the o the followig sub-carriers spaced by S tr, where S tr is the pilot sub-carriers spacig, a divisor of N. We also assume that o all these sub-carriers ad o all the trasmittig ateas the total power ρ assiged to the pilots is the same, ad that the pilot sequece is orthogoal across the trasmittig ateas array. This ca be mathematically writte as { tr X X trh = ρi T = 0 + ks tr, k = 0... N S tr 1 X tr X trh = 0 otherwise 2.48 Sice oly N S tr sub-carriers over N are used for the allocatio of pilots, ad the rak of X tr X trh is either 0 o pilots allocated o sub-carrier or T sub-carrier is used for allocatig pilots, the ecessary idetifiability coditio becomes: N 1 =0 rak X tr X trh = NT S tr LT 2.49 or equivaletly N S tr L, which is the same result obtaied i lemma 2.2, assumig that K tr T o the sub-carriers carryig pilots. I order to eforce the orthogoality of the pilot sequece across the trasmittig ateas, oe solutio is to trasmit a set of orthogoal vectors of symbol. For example, o the sub-carriers carryig pilots we may trasmit T pilots i T distict MIMO-OFDM symbols, where oe oly atea trasmits at a time with a power equal to ρ, while the others are silet, ad each atea

31 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels 23 trasmits a pilot o oe of the T time-slots. This ca be writte mathematically as ρe iθ X tr 0 ρe iθ = 0 0 ρe iθ ρe iθ This is the solutio used also to allocate the pilots i the LTE slots ad i the course of our simulatios. Substitutig 2.48 ito the expressio for Γ tr xx, we obtai Γ tr xx = Nρ S tr σw 2 I LRT 2.51 Notice that i this case the coditio N S tr L represets ot oly a ecessary but also a sufficiet coditio for the idetifiability of the chael. It ca be show that this pilot allocatio method is optimal i the case of white Gaussia oise, sice it miimizes the variace of the estimator. I fact, let s assume we have a pilot power costrait, that is trace X tr X trh = P 2.52 This traslates ito a costrait o the trace of matrix Γ tr xx, i fact trace Γ tr xx = 1 σw 2 LR trace X tr X trh = 1 LRT 1 σw 2 LRP = p=0 λ p 2.53 where i the last equality we used the fact that the trace of Γ xx is equivalet to the sum of its eigevalues {λ p }. The optimizatio of the pilot structure is performed by miimizig the variace of the estimator, give by 2.47, uder the costrait Usig the Lagrage multipliers i order to eforce the costrait we have the followig cost fuctio: f = 1 RT trace = 1 RT LRT 1 p=0 Γ xx tr µ λ p + µ LRT 1 p=0 LRT 1 p=0 λ p 1 σ 2 w LRP = λ p 1 σw 2 LRP = 2.54

32 24 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels The, calculatig the derivative of the cost fuctio with respect to the eigevalue λ r ad equalig it to zero we have λ r = 1 RT µ 2.55 Fially, eforcig the power costrait we obtai λ r = P σ 2 wt r 2.56 which demostrates that the optimal Γ xx miimizig the variace of the estimator is give by Γ tr xx = P σ 2 wt I LRT 2.57 This is achieved with the pilot allocatio method 2.48, by settig P = NT ρ S tr. For the variace of the estimator, substitutig Γ tr xx ito 2.47 we have Var Ĥtr = LS trσw 2 Nρ 2.58 Notice that i a commo system the average trasmissio power per sub-carrier σ 2 T x is the same o all sub-carriers, ad is equally distributed across the trasmittig ateas. The, usig this assumptio, sice ρ is the total power assiged to the pilots o each trasmittig atea ad o each sub-carrier, ρ NT S tr = σ 2 T x N T OT, where N T OT is the total umber of pilot symbols allocated o the OFDM grid. Therefore we ca rewrite the variace as Var Ĥtr = σ2 wlt σt 2 x N T OT = LT SNR N T OT 2.59 where SNR = σ2 T x σ 2 w is the sigal to oise ratio of the system. The above expressio highlights some importat limitatios of the pilot based approach. Observe that the variace of the estimator grows proportioally to the umber of trasmittig ateas, ad iversely to the umber of pilots N T OT. This implies that a larger umber of trasmittig ateas has to be compesated by a loger pilot sequece, i order to achieve a give estimatio accuracy while keepig fixed the other parameters. This behavior ca be easily uderstood by ispectig the pilot allocatio structure 2.50, which we showed to be optimal sice it miimizes the variace of the estimator: oly oe atea trasmits at a time, sice i this way the iterferece from the other ateas is suppressed, ad each receivig atea is able to effectively estimate the SISO chael betwee itself ad the atea trasmittig the pilot symbol. Therefore T pilot symbols

33 Chapter 2 Traiig sequece chael estimatio of MIMO-OFDM FIR chaels 25 are eeded for all the ateas to trasmit oe pilot, i other words the umber of pilot symbols ecessary to achieve a give estimatio accuracy is proportioal to the umber of trasmittig ateas. It is clear that, as the order of the MIMO system icreases, while keepig fixed the other parameters, i order to achieve a acceptable estimatio accuracy more pilots have to be collected at the receiver. This i tur is achieved either elargig the observatio time, or allocatig more pilots o the OFDM grid. However, the first approach larger observatio time compromises the ability of the receiver to track fast-varyig chaels, which is ot acceptable i a Mobile Commuicatio System. O the other had, the secod approach more pilots o the OFDM grid compromises the badwidth efficiecy of the system, sice the pilots represet a waste of badwidth. Therefore, it becomes importat to exploit also other iformatio at the receiver tha relyig solely o pilots. The approach studied i this thesis for improvig the estimatio accuracy cosists i exploitig also the ukow symbols at the receiver semi-blid chael estimatio. I the ext chapter we study differet Semi-Blid approaches ad algorithms, ad we compare them with the pilot based approach studied i this chapter.

34

35 Chapter 3 Semi-Blid chael estimatio I chapter 2 we have derived a Maximum Likelihood estimator of a MIMO-OFDM FIR chael based exclusively o pilot symbols, assumig Gaussia oise at the receiver with covariace matrix Covη o sub-carrier. We have also show that the estimatio accuracy of such a estimator equals the correspodig Cramér Rao lower boud ad, i the case of white Gaussia oise at the receiver, ad orthogoal pilots, equally spaced across the sub-carriers, the variace of the estimator is give by equatio 2.59 ad reported here Var Ĥtr = σ2 wlt σt 2 x N T OT = LT SNR N T OT 3.1 where N T OT is the total umber of pilots used for the estimate. From this result it is clear that, i order to improve the estimatio accuracy, for a give sigal to oise ratio ad umber of trasmittig ateas, a larger umber of pilot observatios have to be collected at the receiver. I a MIMO-OFDM system it is required to estimate a larger umber of parameters with respect to a simple SISO system. This egatively impacts the accuracy of the estimator. I fact, observig the expressio give above, we see that the variace for the estimatio of the etries of the chael matrix icreases liearly with the umber of trasmittig ateas. Moreover, otice that the oe give above represets the average variace per etry of the chael matrix. If we sum the variace for the estimatio of each chael etry, istead of averagig it over the umber of etries, the overall variace is a quadratic fuctio of the umber of trasmittig ateas ad a liear fuctio of the umber of receivig ateas. This depedecy o the dimesio of the MIMO- OFDM system, i the case of estimatio techiques based o pilots aloe, traslates ito the eed for a loger traiig sequece with respect to a simple SISO i order to achieve a give performace. This is achieved either by elargig the observatio time, 27

Semi-Blind Channel Estimation for LTE DownLink

Semi-Blind Channel Estimation for LTE DownLink TECHNICAL UNIVERSITY OF DENMARK Semi-Blid Chael Estimatio for LTE DowLik by Nicolò Michelusi A thesis submitted i partial fulfillmet for the degree of Master of Sciece (MSc) i Telecommuicatio Egieerig

More information

OFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI

OFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI MIMO-OFDM OFDM Precoder for Miimizig BER Upper Boud of MLD uder Imperfect CSI MCRG Joit Semiar Jue the th 008 Previously preseted at ICC 008 Beijig o May the st 008 Boosar Pitakdumrogkija Kazuhiko Fukawa

More information

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

More information

Properties and Hypothesis Testing

Properties and Hypothesis Testing Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.

More information

Session 5. (1) Principal component analysis and Karhunen-Loève transformation

Session 5. (1) Principal component analysis and Karhunen-Loève transformation 200 Autum semester Patter Iformatio Processig Topic 2 Image compressio by orthogoal trasformatio Sessio 5 () Pricipal compoet aalysis ad Karhue-Loève trasformatio Topic 2 of this course explais the image

More information

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy

More information

Direction of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c

Direction of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c 4th Iteratioal Coferece o Advaced Materials ad Iformatio Techology Processig (AMITP 06) Directio of Arrival Estimatio Method i Uderdetermied Coditio Zhag Youzhi a, Li eibo b, ag Hali c Naval Aeroautical

More information

Statistical Inference Based on Extremum Estimators

Statistical Inference Based on Extremum Estimators T. Rotheberg Fall, 2007 Statistical Iferece Based o Extremum Estimators Itroductio Suppose 0, the true value of a p-dimesioal parameter, is kow to lie i some subset S R p : Ofte we choose to estimate 0

More information

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio

More information

Frequency Domain Filtering

Frequency Domain Filtering Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee

More information

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y

More information

Problem Set 4 Due Oct, 12

Problem Set 4 Due Oct, 12 EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios

More information

Diversity Combining Techniques

Diversity Combining Techniques Diversity Combiig Techiques Whe the required sigal is a combiatio of several waves (i.e, multipath), the total sigal amplitude may experiece deep fades (i.e, Rayleigh fadig), over time or space. The major

More information

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator Ecoomics 24B Relatio to Method of Momets ad Maximum Likelihood OLSE as a Maximum Likelihood Estimator Uder Assumptio 5 we have speci ed the distributio of the error, so we ca estimate the model parameters

More information

Linear Algebra Issues in Wireless Communications

Linear Algebra Issues in Wireless Communications Rome-Moscow school of Matrix Methods ad Applied Liear Algebra August 0 September 18, 016 Liear Algebra Issues i Wireless Commuicatios Russia Research Ceter [vladimir.lyashev@huawei.com] About me ead of

More information

Time-Domain Representations of LTI Systems

Time-Domain Representations of LTI Systems 2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable

More information

Chapter 7: The z-transform. Chih-Wei Liu

Chapter 7: The z-transform. Chih-Wei Liu Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability

More information

A statistical method to determine sample size to estimate characteristic value of soil parameters

A statistical method to determine sample size to estimate characteristic value of soil parameters A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig

More information

TMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods

TMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Substantiation of the Water Filling Theorem Using Lagrange Multipliers

Substantiation of the Water Filling Theorem Using Lagrange Multipliers J.A. Crawford U048 Water Fillig o Multiple Gaussia Chaels.doc Substatiatio of the Water Fillig heorem Usig Lagrage Multipliers Shao s capacity theorem states that i the case of parallel statistically idepedet

More information

Basics of Probability Theory (for Theory of Computation courses)

Basics of Probability Theory (for Theory of Computation courses) Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Symmetric Two-User Gaussian Interference Channel with Common Messages

Symmetric Two-User Gaussian Interference Channel with Common Messages Symmetric Two-User Gaussia Iterferece Chael with Commo Messages Qua Geg CSL ad Dept. of ECE UIUC, IL 680 Email: geg5@illiois.edu Tie Liu Dept. of Electrical ad Computer Egieerig Texas A&M Uiversity, TX

More information

Principle Of Superposition

Principle Of Superposition ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 9 Multicolliearity Dr Shalabh Departmet of Mathematics ad Statistics Idia Istitute of Techology Kapur Multicolliearity diagostics A importat questio that

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION OF FIBONACCI VECTORS CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College

More information

Statistical Pattern Recognition

Statistical Pattern Recognition Statistical Patter Recogitio Classificatio: No-Parametric Modelig Hamid R. Rabiee Jafar Muhammadi Sprig 2014 http://ce.sharif.edu/courses/92-93/2/ce725-2/ Ageda Parametric Modelig No-Parametric Modelig

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: Representations and Algorithms in Molecular Biology CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by

More information

Reliability and Queueing

Reliability and Queueing Copyright 999 Uiversity of Califoria Reliability ad Queueig by David G. Messerschmitt Supplemetary sectio for Uderstadig Networked Applicatios: A First Course, Morga Kaufma, 999. Copyright otice: Permissio

More information

Output Analysis and Run-Length Control

Output Analysis and Run-Length Control IEOR E4703: Mote Carlo Simulatio Columbia Uiversity c 2017 by Marti Haugh Output Aalysis ad Ru-Legth Cotrol I these otes we describe how the Cetral Limit Theorem ca be used to costruct approximate (1 α%

More information

Efficient GMM LECTURE 12 GMM II

Efficient GMM LECTURE 12 GMM II DECEMBER 1 010 LECTURE 1 II Efficiet The estimator depeds o the choice of the weight matrix A. The efficiet estimator is the oe that has the smallest asymptotic variace amog all estimators defied by differet

More information

Linear Regression Demystified

Linear Regression Demystified Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to

More information

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig

More information

4. Hypothesis testing (Hotelling s T 2 -statistic)

4. Hypothesis testing (Hotelling s T 2 -statistic) 4. Hypothesis testig (Hotellig s T -statistic) Cosider the test of hypothesis H 0 : = 0 H A = 6= 0 4. The Uio-Itersectio Priciple W accept the hypothesis H 0 as valid if ad oly if H 0 (a) : a T = a T 0

More information

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015 ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],

More information

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

Discrete Mathematics for CS Spring 2008 David Wagner Note 22 CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig

More information

Introduction to Machine Learning DIS10

Introduction to Machine Learning DIS10 CS 189 Fall 017 Itroductio to Machie Learig DIS10 1 Fu with Lagrage Multipliers (a) Miimize the fuctio such that f (x,y) = x + y x + y = 3. Solutio: The Lagragia is: L(x,y,λ) = x + y + λ(x + y 3) Takig

More information

BER results for a narrowband multiuser receiver based on successive subtraction for M-PSK modulated signals

BER results for a narrowband multiuser receiver based on successive subtraction for M-PSK modulated signals results for a arrowbad multiuser receiver based o successive subtractio for M-PSK modulated sigals Gerard J.M. Jasse Telecomm. ad Traffic-Cotrol Systems Group Dept. of Iformatio Techology ad Systems Delft

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors 5 Eigevalues ad Eigevectors 5.3 DIAGONALIZATION DIAGONALIZATION Example 1: Let. Fid a formula for A k, give that P 1 1 = 1 2 ad, where Solutio: The stadard formula for the iverse of a 2 2 matrix yields

More information

t distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference

t distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference EXST30 Backgroud material Page From the textbook The Statistical Sleuth Mea [0]: I your text the word mea deotes a populatio mea (µ) while the work average deotes a sample average ( ). Variace [0]: The

More information

1 Duality revisited. AM 221: Advanced Optimization Spring 2016

1 Duality revisited. AM 221: Advanced Optimization Spring 2016 AM 22: Advaced Optimizatio Sprig 206 Prof. Yaro Siger Sectio 7 Wedesday, Mar. 9th Duality revisited I this sectio, we will give a slightly differet perspective o duality. optimizatio program: f(x) x R

More information

Exponential Families and Bayesian Inference

Exponential Families and Bayesian Inference Computer Visio Expoetial Families ad Bayesia Iferece Lecture Expoetial Families A expoetial family of distributios is a d-parameter family f(x; havig the followig form: f(x; = h(xe g(t T (x B(, (. where

More information

THE KALMAN FILTER RAUL ROJAS

THE KALMAN FILTER RAUL ROJAS THE KALMAN FILTER RAUL ROJAS Abstract. This paper provides a getle itroductio to the Kalma filter, a umerical method that ca be used for sesor fusio or for calculatio of trajectories. First, we cosider

More information

Since X n /n P p, we know that X n (n. Xn (n X n ) Using the asymptotic result above to obtain an approximation for fixed n, we obtain

Since X n /n P p, we know that X n (n. Xn (n X n ) Using the asymptotic result above to obtain an approximation for fixed n, we obtain Assigmet 9 Exercise 5.5 Let X biomial, p, where p 0, 1 is ukow. Obtai cofidece itervals for p i two differet ways: a Sice X / p d N0, p1 p], the variace of the limitig distributio depeds oly o p. Use the

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should be doe

More information

ADVANCED DIGITAL SIGNAL PROCESSING

ADVANCED DIGITAL SIGNAL PROCESSING ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE

More information

Frequency Response of FIR Filters

Frequency Response of FIR Filters EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5 CS434a/54a: Patter Recogitio Prof. Olga Veksler Lecture 5 Today Itroductio to parameter estimatio Two methods for parameter estimatio Maimum Likelihood Estimatio Bayesia Estimatio Itroducto Bayesia Decisio

More information

6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition

6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition 6. Kalma filter implemetatio for liear algebraic equatios. Karhue-Loeve decompositio 6.1. Solvable liear algebraic systems. Probabilistic iterpretatio. Let A be a quadratic matrix (ot obligatory osigular.

More information

Orthogonal Gaussian Filters for Signal Processing

Orthogonal Gaussian Filters for Signal Processing Orthogoal Gaussia Filters for Sigal Processig Mark Mackezie ad Kiet Tieu Mechaical Egieerig Uiversity of Wollogog.S.W. Australia Abstract A Gaussia filter usig the Hermite orthoormal series of fuctios

More information

1.0 Probability of Error for non-coherent BFSK

1.0 Probability of Error for non-coherent BFSK Probability of Error, Digital Sigalig o a Fadig Chael Ad Equalizatio Schemes for ISI Wireless Commuicatios echologies Sprig 5 Lectures & R Departmet of Electrical Egieerig, Rutgers Uiversity, Piscataway,

More information

The DOA Estimation of Multiple Signals based on Weighting MUSIC Algorithm

The DOA Estimation of Multiple Signals based on Weighting MUSIC Algorithm , pp.10-106 http://dx.doi.org/10.1457/astl.016.137.19 The DOA Estimatio of ultiple Sigals based o Weightig USIC Algorithm Chagga Shu a, Yumi Liu State Key Laboratory of IPOC, Beijig Uiversity of Posts

More information

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.

More information

6 Sample Size Calculations

6 Sample Size Calculations 6 Sample Size Calculatios Oe of the major resposibilities of a cliical trial statisticia is to aid the ivestigators i determiig the sample size required to coduct a study The most commo procedure for determiig

More information

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive

More information

The standard deviation of the mean

The standard deviation of the mean Physics 6C Fall 20 The stadard deviatio of the mea These otes provide some clarificatio o the distictio betwee the stadard deviatio ad the stadard deviatio of the mea.. The sample mea ad variace Cosider

More information

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

Characterization and Simulation of HF Propagation in a realistic disturbed and horizontally inhomogeneous Ionosphere

Characterization and Simulation of HF Propagation in a realistic disturbed and horizontally inhomogeneous Ionosphere Characterizatio ad Simulatio of HF Propagatio i a realistic disturbed ad horizotally ihomogeeous Ioosphere Vadim E. Gherm ad Nikolay N.Zerov Departmet of Radiophysics Uiversity of St.Petersburg St.Petersburg

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

Slide Set 13 Linear Model with Endogenous Regressors and the GMM estimator

Slide Set 13 Linear Model with Endogenous Regressors and the GMM estimator Slide Set 13 Liear Model with Edogeous Regressors ad the GMM estimator Pietro Coretto pcoretto@uisa.it Ecoometrics Master i Ecoomics ad Fiace (MEF) Uiversità degli Studi di Napoli Federico II Versio: Friday

More information

10-701/ Machine Learning Mid-term Exam Solution

10-701/ Machine Learning Mid-term Exam Solution 0-70/5-78 Machie Learig Mid-term Exam Solutio Your Name: Your Adrew ID: True or False (Give oe setece explaatio) (20%). (F) For a cotiuous radom variable x ad its probability distributio fuctio p(x), it

More information

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A. Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)

More information

Random Variables, Sampling and Estimation

Random Variables, Sampling and Estimation Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig

More information

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio

More information

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser FIR Filters Lecture #7 Chapter 5 8 What Is this Course All About? To Gai a Appreciatio of the Various Types of Sigals ad Systems To Aalyze The Various Types of Systems To Lear the Skills ad Tools eeded

More information

Information-based Feature Selection

Information-based Feature Selection Iformatio-based Feature Selectio Farza Faria, Abbas Kazeroui, Afshi Babveyh Email: {faria,abbask,afshib}@staford.edu 1 Itroductio Feature selectio is a topic of great iterest i applicatios dealig with

More information

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of

More information

Bayesian Methods: Introduction to Multi-parameter Models

Bayesian Methods: Introduction to Multi-parameter Models Bayesia Methods: Itroductio to Multi-parameter Models Parameter: θ = ( θ, θ) Give Likelihood p(y θ) ad prior p(θ ), the posterior p proportioal to p(y θ) x p(θ ) Margial posterior ( θ, θ y) is Iterested

More information

Physics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001.

Physics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001. Physics 324, Fall 2002 Dirac Notatio These otes were produced by David Kapla for Phys. 324 i Autum 2001. 1 Vectors 1.1 Ier product Recall from liear algebra: we ca represet a vector V as a colum vector;

More information

Vector Quantization: a Limiting Case of EM

Vector Quantization: a Limiting Case of EM . Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z

More information

10. Comparative Tests among Spatial Regression Models. Here we revisit the example in Section 8.1 of estimating the mean of a normal random

10. Comparative Tests among Spatial Regression Models. Here we revisit the example in Section 8.1 of estimating the mean of a normal random Part III. Areal Data Aalysis 0. Comparative Tests amog Spatial Regressio Models While the otio of relative likelihood values for differet models is somewhat difficult to iterpret directly (as metioed above),

More information

Matrix Representation of Data in Experiment

Matrix Representation of Data in Experiment Matrix Represetatio of Data i Experimet Cosider a very simple model for resposes y ij : y ij i ij, i 1,; j 1,,..., (ote that for simplicity we are assumig the two () groups are of equal sample size ) Y

More information

Expectation-Maximization Algorithm.

Expectation-Maximization Algorithm. Expectatio-Maximizatio Algorithm. Petr Pošík Czech Techical Uiversity i Prague Faculty of Electrical Egieerig Dept. of Cyberetics MLE 2 Likelihood.........................................................................................................

More information

Soo King Lim Figure 1: Figure 2: Figure 3: Figure 4: Figure 5: Figure 6: Figure 7:

Soo King Lim Figure 1: Figure 2: Figure 3: Figure 4: Figure 5: Figure 6: Figure 7: 0 Multivariate Cotrol Chart 3 Multivariate Normal Distributio 5 Estimatio of the Mea ad Covariace Matrix 6 Hotellig s Cotrol Chart 6 Hotellig s Square 8 Average Value of k Subgroups 0 Example 3 3 Value

More information

Estimation of Backward Perturbation Bounds For Linear Least Squares Problem

Estimation of Backward Perturbation Bounds For Linear Least Squares Problem dvaced Sciece ad Techology Letters Vol.53 (ITS 4), pp.47-476 http://dx.doi.org/.457/astl.4.53.96 Estimatio of Bacward Perturbatio Bouds For Liear Least Squares Problem Xixiu Li School of Natural Scieces,

More information

ECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors

ECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors ECONOMETRIC THEORY MODULE XIII Lecture - 34 Asymptotic Theory ad Stochastic Regressors Dr. Shalabh Departmet of Mathematics ad Statistics Idia Istitute of Techology Kapur Asymptotic theory The asymptotic

More information

1 Hash tables. 1.1 Implementation

1 Hash tables. 1.1 Implementation Lecture 8 Hash Tables, Uiversal Hash Fuctios, Balls ad Bis Scribes: Luke Johsto, Moses Charikar, G. Valiat Date: Oct 18, 2017 Adapted From Virgiia Williams lecture otes 1 Hash tables A hash table is a

More information

2D DSP Basics: 2D Systems

2D DSP Basics: 2D Systems - Digital Image Processig ad Compressio D DSP Basics: D Systems D Systems T[ ] y = T [ ] Liearity Additivity: If T y = T [ ] The + T y = y + y Homogeeity: If The T y = T [ ] a T y = ay = at [ ] Liearity

More information

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample.

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample. Statistical Iferece (Chapter 10) Statistical iferece = lear about a populatio based o the iformatio provided by a sample. Populatio: The set of all values of a radom variable X of iterest. Characterized

More information

Probability, Expectation Value and Uncertainty

Probability, Expectation Value and Uncertainty Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such

More information

Abstract Vector Spaces. Abstract Vector Spaces

Abstract Vector Spaces. Abstract Vector Spaces Astract Vector Spaces The process of astractio is critical i egieerig! Physical Device Data Storage Vector Space MRI machie Optical receiver 0 0 1 0 1 0 0 1 Icreasig astractio 6.1 Astract Vector Spaces

More information

[412] A TEST FOR HOMOGENEITY OF THE MARGINAL DISTRIBUTIONS IN A TWO-WAY CLASSIFICATION

[412] A TEST FOR HOMOGENEITY OF THE MARGINAL DISTRIBUTIONS IN A TWO-WAY CLASSIFICATION [412] A TEST FOR HOMOGENEITY OF THE MARGINAL DISTRIBUTIONS IN A TWO-WAY CLASSIFICATION BY ALAN STUART Divisio of Research Techiques, Lodo School of Ecoomics 1. INTRODUCTION There are several circumstaces

More information

CALCULATING FIBONACCI VECTORS

CALCULATING FIBONACCI VECTORS THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet

More information

The Maximum-Likelihood Decoding Performance of Error-Correcting Codes

The Maximum-Likelihood Decoding Performance of Error-Correcting Codes The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

Fig. 2. Block Diagram of a DCS

Fig. 2. Block Diagram of a DCS Iformatio source Optioal Essetial From other sources Spread code ge. Format A/D Source ecode Ecrypt Auth. Chael ecode Pulse modu. Multiplex Badpass modu. Spread spectrum modu. X M m i Digital iput Digital

More information

Chapter 6 Principles of Data Reduction

Chapter 6 Principles of Data Reduction Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a

More information

Geometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT

Geometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT OCTOBER 7, 2016 LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT Geometry of LS We ca thik of y ad the colums of X as members of the -dimesioal Euclidea space R Oe ca

More information

Introduction to Optimization Techniques. How to Solve Equations

Introduction to Optimization Techniques. How to Solve Equations Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually

More information

Improved Class of Ratio -Cum- Product Estimators of Finite Population Mean in two Phase Sampling

Improved Class of Ratio -Cum- Product Estimators of Finite Population Mean in two Phase Sampling Global Joural of Sciece Frotier Research: F Mathematics ad Decisio Scieces Volume 4 Issue 2 Versio.0 Year 204 Type : Double Blid Peer Reviewed Iteratioal Research Joural Publisher: Global Jourals Ic. (USA

More information

xn = x n 1 α f(xn 1 + β n) f(xn 1 β n)

xn = x n 1 α f(xn 1 + β n) f(xn 1 β n) Proceedigs of the 005 Witer Simulatio Coferece M E Kuhl, N M Steiger, F B Armstrog, ad J A Joies, eds BALANCING BIAS AND VARIANCE IN THE OPTIMIZATION OF SIMULATION MODELS Christie SM Currie School of Mathematics

More information

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Inverse Matrix. A meaning that matrix B is an inverse of matrix A. Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix

More information

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information