CONSTANT FALSE ALARM RATE (CFAR) DETECTION BASED ESTIMATORS WITH APPLICATIONS TO SPARSE WIRELESS CHANNELS


 Hubert Booth
 2 years ago
 Views:
Transcription
1 CONSTANT FALSE ALARM RATE (CFAR) DETECTION BASED ESTIMATORS WITH APPLICATIONS TO SPARSE WIRELESS CHANNELS A Thesis Submitted to the Graduate School of Engineering and Sciences of İzmir Institute of Technology in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE in Electrical and Electronics Engineering by Ümit KARACA October 26 İZMİR
2 We approve the thesis of Ümit KARACA Date of Signature October 26 Assist. Prof. Serdar ÖZEN Supervisor Department of Electrical and Electronics Engineering İzmir Institute of Technology October 26 Assist. Prof. Mustafa Aziz ALTINKAYA Department of Electrical and Electronics Engineering İzmir Institute of Technology October 26 Assoc. Prof. Olcay AKAY Department of Electrical and Electronics Engineering Dokuz Eylül University October 26 Prof. F.Acar SAVACI Head of Department Department of Electrical and Electronics Engineering İzmir Institute of Technology Assoc. Prof. Dr. Semahat ÖZDEMİR Head of the Graduate School
3 ABSTRACT CONSTANT FALSE ALARM RATE (CFAR) DETECTION BASED ESTIMATORS WITH APPLICATIONS TO SPARSE WIRELESS CHANNELS We provide Constant False Alarm Rate (CFAR) based thresholding methods for training based channel impulse response (CIR) estimation algorithms for communication systems which utilize a periodically transmitted training sequence within a continuous stream of information symbols. After obtaining the CIR estimation by using known methods in the literature, there are estimation errors which causes performance loss at equalizers. The channel estimation error can be seen as noise on CIR estimations and CFAR based thresholding methods, which are used in radar systems to decide the presence of a target, can effectively overcome this problem. CFAR based methods are based on determining threshold values which are computed by distribution of channel noise. We provide exact and approximate distribution of channel noise appear at CIR estimate schemes. We applied Cell AveragingCFAR (CACFAR) and Order StatisticCFAR (OS CFAR) methods on the CIR estimations. The performance of the CFAR estimators are then compared by their Least Square error in the channel estimates. The Signal to Interference plus Noise Ratio (SINR) performance of the decision feedback equalizers (DFE), of which the tap values are calculated based on the CFAR estimators, are also provided. iii
4 ÖZET SABİT YANLIŞ ALARM ORANI SEZİMLEME TABANLI KANAL KESTİRİMİ VE YO GUN OLMAYAN TEKİL KANALLARA UYGULAMALARI Bu çalışmada, haberleşme sistemlerinde kullanılan Kanal Dürtü Yanıtı (CIR) kestirimlerinin eşiklemesinde kullanılmak üzere, Sabit Yanlış Alarm Oranı (CFAR) sezimleme tabanlı metotlar ele alınmıştır. Haberleşme literatüründe bilinen yöntemlerle elde edilen kanal dürtü yanıtları, kestirim hatası taşımakta, bu durum denkleştiricilerde performans kaybına neden olmaktadır. Bu kestirim hatası, kanal dürtü yanıtındaki gürültü olarak de gerlendirilebilir. Radar sistemlerinde hedef tespit edilmesinde kullanılan Sabit Yanlış Alarm Oranı (CFAR) sezimleme tabanlı eşikleme metotları, bahsedilen bu gürültünün temizlenmesinde kullanılabilir. Sabit Yanlış Alarm Oranı (CFAR) sezimleme tabanlı metotlar, kanal gürültüsünün istatistiksel da gılımı yardımıyla hesaplanan eşik de gerlerine dayanmaktadır. Proje kapsamında, Hücre Ortalamalı (CACFAR) ve İstatistiksel Sıralamalı (OS CFAR) Sabit Yanlış Alarm Oranı sezimleme tabanlı metotlar kullanılarak elde edilen eşik de gerleri, çeşitli kanal kestirimlerine uygulanmıştır. Bahsedilen metotların performansları, eşikleme işleminden sonra elde edilen kanal kestirim sinyallerinin En Küçük Kareler Hataları (NLSE) karşılaştırılarak gösterilmiştir. Ayrıca, Sinyallerin Girişim ve Gürültüye Oranları (SINR), Karar Geridönüşümlü Denkleştiriciler (DFE) kullanılarak gösterilmiştir. iv
5 TABLE OF CONTENTS LIST OF FIGURES vii LIST OF TABLES ix LIST OF ABBREVIATIONS x CHAPTER. INTRODUCTION Motivation Organization and Contributions of the Thesis CHAPTER 2. SIGNAL AND CHANNEL MODEL Introduction Overview of the Data Transmission Model CHAPTER 3. GENERALIZED LEAST SQUARES BASED CHANNEL ESTIMA TION Method of Least Squares Existing Channel Estimation Methods LeastSquares Channel Estimation Correlation Based Channel Estimation Covariance Matrix Update Based Iterative Channel Estimation Further Improvements to the Initial Channel Estimate Statistical Analysis of Baseline Noise Approximations of Distribution Iterative Algorithm to Calculate the Channel Estimate Other Approaches Background (Matching Pursuit) CHAPTER 4. CONSTANT FALSE ALARM RATE (CFAR) BASED THRESH OLDING Introduction Using CFAR Techniques for Channel Estimation v
6 4.2.. Approximations and Further Simplifications Cell Averaging (CA) CFAR Based Detection Order Statistic (OS) CFAR Based Detection Simulations CHAPTER 5. CHANNEL ESTIMATEBASED DECISION FEEDBACK EQUAL IZERS Simulations REFERENCES APPENDICES APPENDIX A. 8VSB PULSE SHAPE Complex RootRaised Cosine Pulse Complex Raised Cosine Pulse APPENDIX B. TEST CHANNELS vi
7 LIST OF FIGURES Figure Page Figure 2. System block diagram Figure 2.2 Data frame Figure 3. Correlation properties of finite PN sequences Figure 3.2 Figure 3.3 The histogram of the real and imaginary parts of the 48th tap value of the term ( A H A ) ( ) A H Hd + Qη [ Na Lq:N+N c +L q] The normality plot of the real and imaginary parts of the 48th tap value of the term ( A H A ) ( ) A H Hd + Qη [ Na L q :N+N c +L q ] Figure 4. CellAveraging CFAR Figure 4.2 NLSE of CACFAR and CAGOCFAR for different window size. 45 Figure 4.3 K versus alpha Figure 4.4 CIR estimations for Channel Figure 4.5 CIR estimations for Channel Figure 4.6 CIR estimations for Channel Figure 4.7 CIR estimations for Channel 3plus Figure 4.8 CIR estimations for Channel Figure 4.9 CIR estimations for Channel Figure 4. CIR estimations for Channel Figure 4. CIR estimations for Channel Figure 4.2 CIR estimations for Channel Figure 4.3 NLSE values of CIR estimates versus SNR(dB) for Channel... 6 Figure 4.4 NLSE values of CIR estimates versus SNR(dB) for Channel Figure 4.5 NLSE values of CIR estimates versus SNR(dB)for Channel Figure 4.6 NLSE values of CIR estimates versus SNR(dB) for Channel 3plus 64 Figure 4.7 NLSE values of CIR estimates versus SNR(dB) for Channel Figure 4.8 NLSE values of CIR estimates versus SNR(dB) for Channel Figure 4.9 NLSE values of CIR estimates versus SNR(dB) for Channel vii
8 Figure 4.2 NLSE values of CIR estimates versus SNR(dB) for Channel Figure 4.2 NLSE values of CIR estimates versus SNR(dB) for Channel Figure 5. DFE Equalizer Figure 5.2 Residual Channel after FeedForward Filter Figure 5.3 Residual Channel after FeedBack Filter Figure 5.4 SINR DFE versus SNR for Channel for various channel estimates. 78 Figure 5.5 SINR DFE versus SNR for Channel 2 for various channel estimates. 79 Figure 5.6 SINR DFE versus SNR for Channel 3 for various channel estimates. 8 Figure 5.7 SINR DFE versus SNR for Channel 3plus for various channel estimates Figure 5.8 SINR DFE versus SNR for Channel 4 for various channel estimates. 82 Figure 5.9 SINR DFE versus SNR for Channel 5 for various channel estimates. 83 Figure 5. SINR DFE versus SNR for Channel 6 for various channel estimates. 84 Figure 5. SINR DFE versus SNR for Channel 7 for various channel estimates. 85 Figure 5.2 SINR DFE versus SNR for Channel 8 for various channel estimates. 86 viii
9 LIST OF TABLES Table Page Table 4. K values computed from Equation (4.49) Table B. Simulated 9 Channel Impulse Responses ix
10 LIST OF ABBREVIATIONS AR CFAR CACFAR CAGOCFAR CIR DFE DTV ISI LE LMS LS ML MLSE MMSE MP MSE OSCFAR RLS SINR SNR VSB Autoregressive Constant False Alarm Rate Cell Averaging Constant False Alarm Rate Cell Averaging GreatestOf Constant False Alarm Rate Channel Impulse Response Decision Feedback Equalizer Digital Television InterSymbol Interference Linear Equalizer Least Mean Square Least Squares Maximum Likelihood Maximum Likelihood Sequence Estimation (Estimator) Minimum Meansquared Error Matching Pursuit Meansquared Error Order Statistic Constant False Alarm Rate Recursive Least Square SignaltoInterferencePlusNoise Ratio SignaltoNoise Ratio Vestigial Sideband x
11 CHAPTER INTRODUCTION.. Motivation In mobile wireless and digital television (DTV) channels multipath phenomena is generally attributed to the randomly changing propagation characteristics as well as the reflection, diffraction and scattering of the transmitted waves from the buildings, large moving vehicles/airplanes, mountains, ionosphere, sea surface. Many types of impairments are observed on these channels such as Doppler spread, fading, multipath spread (or delay spread), nonlinear distortion, frequency offset, phase jitter, thermal and/or impulsive noise, co and adjacent channel interference. This research focuses mainly on the effects of multipath spread and thermal noise. Large delay spread induces significant intersymbol interference (ISI) where the received symbols are a function of several adjacent symbols. A large Doppler spread causes rapid variations in the channel impulse response characteristics, and necessitates a fast converging adaptive algorithm. When the channel exhibits a deep fade, it results in a very low received signal power. Among various remedies to these problems which have been proposed thus far, the diversity reception and the multicarrier transmission combined with advanced adaptive signal processing algorithms to estimate and to track the channel variations are considered to be among the most prominent alternatives. However multicarrier transmission is out of the scope of this research. Multipath channels are generally modelled in the form of frequency selective fading as well as Rayleigh or Rician fading. As the receivers employ diversity to combat the combined effects of multipath and fading in the form of antenna arrays, as well as polarization diversity, more advanced signal processing is required at the receiver frontend to estimate and track the channel parameter variations. In order to be able to come up with better signal processing algorithms first the underlying wireless channel characteristics must be well understood and proper analytical models must be developed. As the demand increases for higher data rates and more bandwidth, the effects
12 of all aforementioned channel impairments become more severe. Better channel models, and more advanced algorithms for channel estimation, tracking and equalization are still on the current agenda of communication system researchers and designers..2. Organization and Contributions of the Thesis This research has been completed under the following two major constraints: We considered that the transmission scheme is fixed and has been standardized as in (ATSC Standard A/53 995) ; thus we were constrained to work with and implement algorithms which can only be implemented at the receivers. In other words we assumed no changes will take place to the existing North American DTV transmission standard. This eliminates the possibility of transmitter/receiver joint optimization, or any proposals of improvements to the transmission format. Due to having very high data rate, the digital TV system requires algorithms with relatively low complexity. Highly recursive algorithms or blind algorithms that require long averaging to get useful estimates is outside the focus of this research. By the time a blind algorithm converge to a reasonably reliable estimate of the channel, the channel may change significantly thus making the CIR estimate useless. For these reasons we mainly concentrated on training sequence based channel estimation algorithms. Total of five chapters follow the Introduction chapter: Chapter 2 presents the channel and signal model where the signal model obeys the American DTV transmission standard (ATSC Standard A/53 995). Notation and main important sets of equations are introduced which will be primarily used in the sequel of the thesis. Chapter 3 first overviews the method of (generalized) least squares, and applies it to the signal/channel model that has been introduced in Chapter 2. Then the correlation based initial channel estimation is also introduced. Correlation based channel estimation is considered, since it is readily available in digital receivers for frame synchronization purpose. Then the problems associated with both of these methods 2
13 will be presented. The most important contribution of Chapter 3 is the development of a detailed statistical model of the baseline noise which is a byproduct of any type of correlation processing in the receiver. However, as will be shown, this statistical model is actually a function of the channel impulse response which we are trying to estimate. For this very reason we then provide an iterative algorithm to find the generalized least squares channel estimate where the covariance matrix of the baseline noise is incorporated into the channel estimation scheme. Each iteration also involves a thresholding, which is accomplished by two different methods: (i) constant false alarm rate (CACFAR) based thresholding, and (ii) order statistic (OSCFAR) based thresholding. Chapter 4 overviews Constant False Alarm Rate (CFAR) based thresholding methods. Cell Averaging (CA) and Order Statistic (OS) based CFAR methods are introduced by the help of statistic distribution given in Chapter 2. In Chapter 5, we provide the derivation for the Decision Feedback Equalizers. The CIR estimates thresholded by CFAR methods provided in previous chapters are used for calculating the DFE filter tap values. We then provide the signaltointerferenceplusnoise (SINR) performance at the DFE output. 3
14 CHAPTER 2 SIGNAL AND CHANNEL MODEL 2.. Introduction For the communications systems utilizing periodically transmitted training sequence, leastsquares (LS) based channel estimation algorithms or the correlation based channel estimation algorithms have been the most widely used two alternatives. Both methods use a stored copy of the known transmitted training sequence at the receiver. The properties and the length of the training sequence are generally different depending on the particular communication system s standard specifications. In addition, a training sequence could also be utilized in a communication system not only for channel estimation purpose but also for synchronization purpose, to indicate the beginning and/or end of a transmitted data frame or packet. In the sequel, although the examples following the derivations of the blended channel estimator will be drawn from the ATSC digital TV 8VSB system (Hillery 2), to the best of our knowledge it could be applied with minor modifications to any digital communication system with linear modulation which employs a training sequence. Overview of the data transmission model in Section 2.2 provides the necessary background and introduces the notation which will be entirely used in the rest of the thesis Overview of the Data Transmission Model We will briefly go over the data transmission model. The baseband transmitted signal waveform of data rate /T symbols/sec depicted in Figure 2. is represented by s(t) = k I k q(t kt ) (2.) where {I k A {α,..., α M } C } is the transmitted data sequence, which is a discrete Mary sequence taking values on the generally complex Mary alphabet A, 4
15 I n δ(t nt ) n q(t) s(t) c(t) η(t) q ( t) y(t) t = nt y[n] Equalizer ĥ[n] Channel Estimator Î n Figure 2.: System block diagram. h(t) is the composite channel including transmit end receive filters as well as the physical channel. which also constitutes the two dimensional employed modulation constellation. q(t) is the transmitter pulse shaping filter of finite support [ T q /2, T q /2]. The overall complex pulse shape will be denoted by p(t) and is given by p(t) = q(t) q ( t) (2.2) where q ( t) is the receiver matched filter impulse response. Although it is not required, for the sake of simplifying the notation, we assume that the span of the transmit and receive filters, T q, is integer multiple of the symbol period, T ; that is T q = N q T = 2L q T, L q Z +. We also note that for 8VSB system (Hillery 2) the transmitter pulse shape is the Hermitian symmetric rootraised cosine pulse, which implies q(t) = q ( t). In the sequel q[n] q(t) t=nt will be used to denote both the transmit and receive filters. The physical channel between the transmitter and the receiver is denoted by c(t), and throughout this paper the concatenation of p(t) and the channel will be denoted by h(t, τ), and is defined as h(t, τ) = q(t) c(t, τ) q ( t) = p(t) c(t, τ). (2.3) The physical channel c(t, τ) is generally described by the impulse response c(t, τ) = L k= K c k (τ)δ(t τ k ) (2.4) which describes a timevarying channel, and {c k (τ)} C, where K k L, and t, τ R, {τ k } denote the multipath delays, or the TimeOfArrivals (TOA). We will 5
16 assume that the timevariations of the channel is slow enough that c(t, τ) = c(t) can be assumed to be a fixed (static) intersymbol interference (ISI) channel throughout the training period; that is we will assume that c k (τ) = c k, which in turn implies c(t) = L k= K c k δ(t τ k ) (2.5) for t NT, where N is the number of training symbols. In general c k = c k e j2πf cτ k with ck being the amplitude of the k th multipath, and f c is the carrier frequency. It is also inherently assumed that τ k < for K k, τ =, and τ k > for k L. The particular choice of the summation indices K and L, the number of maximum anticausal and causal multipath delays respectively, will be clarified in the discussion of correlation based channel estimation and onwards. It is important to clarify that the multipath delays τ k are not assumed to be at integer multiples of the sampling period T. Indeed it is one of the main contributions of this paper that we show an accurate and robust way to recover the pulse shape back into the concatenated channel estimate when the multipath delays are not exactly at the sampling instants. By combining Equations (2.3) and (2.5) (and by dropping the τ index) we get L h(t) = p(t) c(t) = c k p(t τ k ). (2.6) k= K Since both p(t) and c(t) are complex valued functions, the overall channel impulse response h(t) is also complex valued. We can write them in terms of their real and imaginary parts: p(t) = p I (t) + jp Q (t), (2.7) c(t) = c I (t) + jc Q (t), (2.8) h(t) = h I (t) + jh Q (t). (2.9) Then h(t) = p(t) c(t) = (p I (t) + jp Q (t)) (c I (t) + jc Q (t)) 6
17 = (p I (t) c I (t) p Q (t) c Q (t)) +j (p } {{ } I (t) c Q (t) + p Q (t) c I (t)). (2.) } {{ } h I (t) h Q (t) By using the notation introduced here the matched filter output y(t) is given by y(t) = ( ) I k δ(t kt ) h(t) + ν(t) (2.) k where ν(t) = η(t) q ( t) denotes the complex (colored) noise process after the pulse matched filter, with η(t) being a zeromean white Gaussian noise process with spectral density ση 2 per real and imaginary part. Similar to Equations ( ) y(t) can be also written in terms of its real and imaginary parts: y(t) = y I (t) + jy Q (t). Sampling the matched filter output at the symbol rate we obtain the discretetime representation of the overall communication system as y[n] y(t) t=nt = k I k h[n k] + ν[n]. (2.2)... a a... a N d N d N+... d N... Training Sequence Data Sequence Figure 2.2: Data frame: N symbols of known training sequence followed by N N information symbols. Referring to Figure 2.2, the transmitted symbols are composed of frames (or packets) of length N, where the first N symbols are the training symbols. Within a frame of length N, the symbols are denoted by I k = a k, for k N d k, for N n N, (2.3) 7
18 where the distinction of first N symbols is made to indicate that they are the known training symbols, and it is possible that the a k s belong to a certain subset of the Mary constellation alphabet A; that is {a k Ã A {α,..., α M }}. In fact for the 8VSB system the signal alphabet is A {±, ±3, ±5, ±7}, while the training sequence can only take binary values within the set Ã { 5, +5}. In the sequel the sampled matched filter output signal y[n] will be used extensively in vector form, and to help minimize introducing new variables, the notation of y [n :n 2 ] with n 2 n, will be adopted to indicate the column vector y [n :n 2 ] = [y[n ], y[n + ],, y[n 2 ]] T. Same notation will also be applied to the noise variables η[n] and ν[n]. Without loss of generality symbol rate sampled, complex valued, composite CIR h[n] can be written as a finite dimensional vector h = [h[ N a ], h[ N a + ],, h[ ], h[], h[],, h[n c ], h[n c ]] T (2.4) where N a and N c denote the number of anticausal and the causal taps of the channel, respectively, and are given by { } τ K T N q N a = round, and N c = round T { τl + T N q and N a +N c + is the total memory of the channel. Based on Equation (2.2) and assuming that N N a + N c +, we can write the pulse matched filter output corresponding only to the known training symbols: T }, y[n c ] = h[ N a ]a Nc+N a + + h[]a Nc + + h[n c ]a + ν[n c ] y[n c + ] = h[ N a ]a Nc+N a+ + + h[]a Nc+ + + h[n c ]a + ν[n c + ].. y[n N a ] = h[ N a ]a N + +h[]a N Na + +h[n c ]a N Na N c +ν[n N a ] which can be written compactly as y [Nc :N N a ] = Ãh + ν [Nc:N N a ] = Ãh + Qη [Nc L q :N N a +L q ], (2.5) 8
19 where Ã = T { [a Nc+N a,, a N ] T, [a Nc+N a,, a ] } (2.6) a Nc +N a a Nc +N a a a = Nc +N a + a Nc +N a a....., (2.7). a N a N 2 a N Na N c where Ã is (N N a N c ) (N a + N c + ) Toeplitz convolution matrix with first column [a Nc +N a,, a N ] T and first row [a Nc +N a,, a ], and ν [Nc :N N a ] = Qη [Nc L q:n N a+l q] (2.8) is the colored noise vector at the receiver matched filter output, with Q = q T q T q T (N N a N c ) (N N a N c +N q ) (2.9) and q is the vector containing timereversed samples of the receiver matched filter sampled at the symbol rate and is q = [q[+l q ],, q[],, q[ L q ]] T. (2.2) Note that q has N q + = 2L q + samples. Similarly the pulse matched filter output which includes all the contributions from the known training symbols (which includes the adjacent random data as well) can be written as y [ Na :N+N c ] = (A + D) h + ν [ Na:N+N c ] (2.2) = Ah + Dh + Qη [ Na L q :N+N c +L q ], (2.22) 9
20 where A = T [a,, a N,,, } {{ } ] T, [a,,, ] } {{ } N a+n c N a+n c (2.23) is a Toeplitz matrix of dimension (N +N a +N c ) (N a +N c +) with first column [a, a,, a N,,, ] T, and first row [a,,, ], and D = T [, } {{,, d } N,, d Nc +N a +N ] T, [, d,, d Nc N a ], (2.24) N is a Toeplitz matrix which includes the adjacent unknown symbols only, prior to and after the training sequence. The data sequence [d,, d Nc N a ] is the unknown information symbols transmitted at the end of the frame prior to the current frame being transmitted. Q is of dimension (N + N a + N c ) (N + N a + N c + N q ) and has the same convolution matrix structure with Q as displayed in Equation (2.9), and is given by. Q = q T q T q T (N+N a+n c) (N+N a+n c+n q) (2.25) and q = [q[+l q ],, q[],, q[ L q ]] T. Equation (2.22) which includes all the contributions from the known training symbols (which includes the adjacent random data as well) can be written explicitly as y[ N y[ N a ] a ].. y[n c ] y[n c ] y[n c ] y [ Na :N+N c ] =.. = y [Nc :N N a ] = Qη [ Na L q :N+N c +L q ] y[n N a ] y[n N a ] y[n N a ].. y[n + N c ] y[n + N c ]
21 a d d 2 d Na N c a a d d Na N c a Nc+N a a Nc+N a 2 a d a Nc +N a a Nc +N a a a Nc +N a + a Nc +N a a h (2.26).... a N a N 2 a N Na N c a N a N 2 a N 2 Na N c d N a N a N 2 Na N c d N+ d N a N d Na +N c +N d N } {{ } } {{ } A D where the entries of the vector y [ Na:N+Nc ] between the dotted lines denote the matched filter output corresponding only to the known training symbols which is provided in Equation (2.5). Note that the corresponding entries of the matrix A between the dotted lines are exactly the same as the entries of the matrix Ã which is provided in Equation (2.7), and the corresponding entries of the matrix D between the dotted lines are all zeros. We now write the contributions of the unknown symbols Dh in Equation (2.22) in a different format which will prove to be more useful in the subsequent derivations. We first define d = S d, or equivalently d = S T d, where d = [d Nc N a,, d, N, d N,, d N+Nc+N a ] T (2.27) d = [d N Na,, d, d N,, d N+Nc+Na ] T (2.28) S = I Na +N c (Na +N c ) N (Na +N c ) (N c +N a ) (2.29) (Na +N c ) (N a +N c ) (Na +N c ) N I Na+Nc (2(N c +N a )) (N+2(N a +N c )) where S is a selection matrix which retains the random data, eliminates the N zeros in the middle of the vector d. We also introduce
22 h T h T H = ht (N+N c+n a) (N+2(N a+n c)) (2.3) h = [h[n c ],, h[], h[], h[ ],, h[ N a ]] T = Jh (2.3) J = (2.32)... (N a +N c +) (N a +N c +) H = HS T (2.33) where h is the time reversed version of h (reordering is accomplished by the permutation matrix J), and H is of dimension (N + N a + N c ) (2(N c +N a )) with a hole inside which is created by the selection matrix S as defined in Equation (2.29). Then it is trivial to show that Dh = H d = HS T d = Hd. (2.34) Based on the Equations ( ) we can rewrite Equation (2.22) as y [ Na :N+N c ] = Ah + Dh + Qη [ Na L q :N+N c +L q ] = Ah + Hd + Qη [ Na L q :N+N c +L q ], (2.35) 2
23 CHAPTER 3 GENERALIZED LEAST SQUARES BASED CHANNEL ESTIMATION 3.. Method of Least Squares First we briefly overview the method of least squares in general terms that is very widely used in the statistical inference and estimation theory applications without considering any specific signal processing or communication system framework. Consider the linear model y = Ax + ν (3.) where y is the observation (or response) vector, A is the regression (or design) matrix, x is the vector of unknown parameters to be estimated, and ν is the observation noise (or measurement error) vector, and are given by y = [y,, y n ] T, (3.2) a, a,2 a,p a A = 2, a 2,2 a 2,p...., (3.3).. a n,3 a n,2 a n,p x = [x,, x p ] T, (3.4) ν = [ν,, ν n ] T. (3.5) It is assumed that all the variables in Equation (3.) are generally complex valued, that is y, ν C n, x C p and A C n p. Then the ordinary least squares solution ˆx ols can be obtained by minimizing the objective function 3
24 J OLS (x) = ν H ν = y Ax 2 (3.6) is given by ˆx ols = (A H A) A H y, (3.7) whenever the matrix A has rank p. The estimator of (3.7) is called the best linear unbiased estimate (BLUE) among all linear unbiased estimators if the noise covariance matrix is known to be (Seber 977, Casella and Berger 99) Cov{ν} = K ν 2 E{ννH } = σ 2 νi. (3.8) The estimator of (3.7) is called the minimum variance unbiased estimator (MVUE) among all unbiased estimators (not only linear) if the noise is known to be Gaussian with zero mean and with covariance matrix K ν of (3.8), that is ˆx ols is called MVUE if it is known that ν N (, σνi). 2 However if it is known that the vector ν is correlated, that is K ν σνi, 2 then in order to achieve the BLUE property we must use a modified objective function. Since K ν is positive definite, there exists an n n nonsingular matrix V such that K ν = V V H (Seber 977). Therefore setting z = V y, B = V X, and β = V ν, we have the model z = Bx + β (3.9) where B is n p of rank p, and Cov{β} = K β (generalized) objective function for the model of (3.9) by = I. Then we define the J GLS (x) = β H β = z Bx 2 = ν H V H V ν = ν H K ν ν = (y Ax) H K ν (y Ax). (3.) 4
25 The least squares estimate that minimizes Equation (3.) is ˆx gls = (B H B) B H z = (A H K ν A) A H K ν y, (3.) The estimator of (3.) is called the best linear unbiased estimate (BLUE) among all linear unbiased estimators if the noise covariance matrix is known to be Cov{ν} = K ν 2 E{ννH } = σ 2 νi (Seber 977, Casella and Berger 99). The estimator of (3.) is called the minimum variance unbiased estimator (MVUE) among all unbiased estimators (not only linear) if the noise is known to be Gaussian with zero mean and with covariance matrix K ν, that is ˆx ols is called MVUE if it is known that ν N (, K ν ) Existing Channel Estimation Methods Based on the model of Equation (2.2) we will briefly review the LS based channel estimation and correlation based channel estimation algorithms LeastSquares Channel Estimation In order to fully estimate the channel of Equation (2.6) the LS based channel estimation algorithm assumes that the starting and the ending points of the channel taps are either known or can be bounded. This assumption plays a critical role in the overall quality and robustness of the LS estimation procedure, which will be investigated in the following section. Recall that symbol rate sampled, complex valued, composite CIR h[n] can be written as a finite dimensional vector h = [h[ N a ], h[ N a + ],, h[ ], h[], h[],, h[n c ], h[n c ]] T (3.2) where N a and N c denote the number of anticausal and the causal taps of the channel, respectively, and N a + N c + is the total memory of the channel. Recall also that the pulse matched filter output corresponding only to the known training symbols is given by 5
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model 1 September 004 A. Introduction and assumptions The classical normal linear regression model can be written
More informationLezione 6 Communications Blockset
Corso di Tecniche CAD per le Telecomunicazioni A.A. 20072008 Lezione 6 Communications Blockset Ing. Marco GALEAZZI 1 What Is Communications Blockset? Communications Blockset extends Simulink with a comprehensive
More informationEqualisation Algorithms in Fixed Point Arithmetic by A.T. Markettos (CAI)
Equalisation Algorithms in Fixed Point Arithmetic by A.T. Markettos (CAI) Fourthyear project in Group E, / Cambridge University Engineering Department Abstract The conversion from floating point to fixed
More information5 Signal Design for Bandlimited Channels
225 5 Signal Design for Bandlimited Channels So far, we have not imposed any bandwidth constraints on the transmitted passband signal, or equivalently, on the transmitted baseband signal s b (t) I[k]g
More informationELECE8104 Stochastics models and estimation, Lecture 3b: Linear Estimation in Static Systems
Stochastics models and estimation, Lecture 3b: Linear Estimation in Static Systems Minimum Mean Square Error (MMSE) MMSE estimation of Gaussian random vectors Linear MMSE estimator for arbitrarily distributed
More informationSystem Identification for Acoustic Comms.:
System Identification for Acoustic Comms.: New Insights and Approaches for Tracking Sparse and Rapidly Fluctuating Channels Weichang Li and James Preisig Woods Hole Oceanographic Institution The demodulation
More informationADAPTIVE EQUALIZATION. Prepared by Deepa.T, Asst.Prof. /TCE
ADAPTIVE EQUALIZATION Prepared by Deepa.T, Asst.Prof. /TCE INTRODUCTION TO EQUALIZATION Equalization is a technique used to combat inter symbol interference(isi). An Equalizer within a receiver compensates
More informationISSN: 23195967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 3, Issue 3, May 2014
Nonlinear Adaptive Equalization Based on Least Mean Square (LMS) in Digital Communication 1 Manoj, 2 Mohit Kumar, 3 Kirti Rohilla 1 MTech Scholar, SGT Institute of Engineering and Technology, Gurgaon,
More informationImplementation of Digital Signal Processing: Some Background on GFSK Modulation
Implementation of Digital Signal Processing: Some Background on GFSK Modulation Sabih H. Gerez University of Twente, Department of Electrical Engineering s.h.gerez@utwente.nl Version 4 (February 7, 2013)
More informationWireless Channel Models 81
Wireless Channel Models 81 Why do we need models? Help analyze the performance of large systems Ask fundamental questions about a system E.g. what is the best I can do with a given system? Allows comparison
More informationLecture 8: Signal Detection and Noise Assumption
ECE 83 Fall Statistical Signal Processing instructor: R. Nowak, scribe: Feng Ju Lecture 8: Signal Detection and Noise Assumption Signal Detection : X = W H : X = S + W where W N(, σ I n n and S = [s, s,...,
More informationABHELSINKI UNIVERSITY OF TECHNOLOGY
Fading Models S72.333 Physical Layer Methods in Wireless Communication Systems Fabio Belloni Helsinki University of Technology Signal Processing Laboratory fbelloni@wooster.hut.fi 23 November 2004 Belloni,F.;
More informationExercises with solutions (1)
Exercises with solutions (). Investigate the relationship between independence and correlation. (a) Two random variables X and Y are said to be correlated if and only if their covariance C XY is not equal
More informationTime and Frequency Domain Equalization
Time and Frequency Domain Equalization Presented By: Khaled Shawky Hassan Under Supervision of: Prof. Werner Henkel Introduction to Equalization Nonideal analogmedia such as telephone cables and radio
More informationPHASE ESTIMATION ALGORITHM FOR FREQUENCY HOPPED BINARY PSK AND DPSK WAVEFORMS WITH SMALL NUMBER OF REFERENCE SYMBOLS
PHASE ESTIMATION ALGORITHM FOR FREQUENCY HOPPED BINARY PSK AND DPSK WAVEFORMS WITH SMALL NUM OF REFERENCE SYMBOLS Benjamin R. Wiederholt The MITRE Corporation Bedford, MA and Mario A. Blanco The MITRE
More informationSignal Detection C H A P T E R 14 14.1 SIGNAL DETECTION AS HYPOTHESIS TESTING
C H A P T E R 4 Signal Detection 4. SIGNAL DETECTION AS HYPOTHESIS TESTING In Chapter 3 we considered hypothesis testing in the context of random variables. The detector resulting in the minimum probability
More informationRadar Systems Engineering Lecture 6 Detection of Signals in Noise
Radar Systems Engineering Lecture 6 Detection of Signals in Noise Dr. Robert M. O Donnell Guest Lecturer Radar Systems Course 1 Detection 1/1/010 Block Diagram of Radar System Target Radar Cross Section
More informationErrata Introduction to Wireless Systems P. Mohana Shankar. Page numbers are shown in blue Corrections are shown in red.
Errata Introduction to Wireless Systems P. Mohana Shankar Page numbers are shown in blue Corrections are shown in red February 25 Page 11 below Figure 2.4 The power detected by a typical receiver is shown
More informationSignal Detection. Outline. Detection Theory. Example Applications of Detection Theory
Outline Signal Detection M. Sami Fadali Professor of lectrical ngineering University of Nevada, Reno Hypothesis testing. NeymanPearson (NP) detector for a known signal in white Gaussian noise (WGN). Matched
More informationCommunication on the Grassmann Manifold: A Geometric Approach to the Noncoherent MultipleAntenna Channel
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 2, FEBRUARY 2002 359 Communication on the Grassmann Manifold: A Geometric Approach to the Noncoherent MultipleAntenna Channel Lizhong Zheng, Student
More informationAdvanced 3G and 4G Wireless Communication Prof. Aditya K. Jagannatham Department of Electrical Engineering Indian Institute of Technology, Kanpur
Advanced 3G and 4G Wireless Communication Prof. Aditya K. Jagannatham Department of Electrical Engineering Indian Institute of Technology, Kanpur Lecture  3 Rayleigh Fading and BER of Wired Communication
More informationDecision Feedback Equalization for CDMA Downlink
Decision Feedback Equalization for CDMA Downlink Jürgen F Rößler, Lutz H J Lampe, Wolfgang H Gerstacker, and Johannes B Huber Chair of Information Transmission, University of ErlangenNuremberg, Cauerstrasse
More informationRevision of Lecture Eighteen
Revision of Lecture Eighteen Previous lecture has discussed equalisation using Viterbi algorithm: Note similarity with channel decoding using maximum likelihood sequence estimation principle It also discusses
More informationIN current film media, the increase in areal density has
IEEE TRANSACTIONS ON MAGNETICS, VOL. 44, NO. 1, JANUARY 2008 193 A New Read Channel Model for Patterned Media Storage Seyhan Karakulak, Paul H. Siegel, Fellow, IEEE, Jack K. Wolf, Life Fellow, IEEE, and
More information8 MIMO II: capacity and multiplexing
CHAPTER 8 MIMO II: capacity and multiplexing architectures In this chapter, we will look at the capacity of MIMO fading channels and discuss transceiver architectures that extract the promised multiplexing
More informationTCOM 370 NOTES 994 BANDWIDTH, FREQUENCY RESPONSE, AND CAPACITY OF COMMUNICATION LINKS
TCOM 370 NOTES 994 BANDWIDTH, FREQUENCY RESPONSE, AND CAPACITY OF COMMUNICATION LINKS 1. Bandwidth: The bandwidth of a communication link, or in general any system, was loosely defined as the width of
More informationLecture 8 ELE 301: Signals and Systems
Lecture 8 ELE 3: Signals and Systems Prof. Paul Cuff Princeton University Fall 22 Cuff (Lecture 7) ELE 3: Signals and Systems Fall 22 / 37 Properties of the Fourier Transform Properties of the Fourier
More informationFactorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
More informationAdaptive Equalization of binary encoded signals Using LMS Algorithm
SSRG International Journal of Electronics and Communication Engineering (SSRGIJECE) volume issue7 Sep Adaptive Equalization of binary encoded signals Using LMS Algorithm Dr.K.Nagi Reddy Professor of ECE,NBKR
More informationLinear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
More informationUNIT 2 MATRICES  I 2.0 INTRODUCTION. Structure
UNIT 2 MATRICES  I Matrices  I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress
More informationDigital Modulation. David Tipper. Department of Information Science and Telecommunications University of Pittsburgh. Typical Communication System
Digital Modulation David Tipper Associate Professor Department of Information Science and Telecommunications University of Pittsburgh http://www.tele.pitt.edu/tipper.html Typical Communication System Source
More informationIntroduction to General and Generalized Linear Models
Introduction to General and Generalized Linear Models General Linear Models  part I Henrik Madsen Poul Thyregod Informatics and Mathematical Modelling Technical University of Denmark DK2800 Kgs. Lyngby
More informationNotes for STA 437/1005 Methods for Multivariate Data
Notes for STA 437/1005 Methods for Multivariate Data Radford M. Neal, 26 November 2010 Random Vectors Notation: Let X be a random vector with p elements, so that X = [X 1,..., X p ], where denotes transpose.
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationTHE downlink of multiuser multipleinput multipleoutput
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 55, NO. 7, JULY 2007 3837 Precoding for Multiple Antenna Gaussian Broadcast Channels With Successive ZeroForcing Amir D. Dabbagh and David J. Love, Member,
More informationECEN 5682 Theory and Practice of Error Control Codes
ECEN 5682 Theory and Practice of Error Control Codes Convolutional Codes University of Colorado Spring 2007 Linear (n, k) block codes take k data symbols at a time and encode them into n code symbols.
More informationMultivariate Normal Distribution
Multivariate Normal Distribution Lecture 4 July 21, 2011 Advanced Multivariate Statistical Methods ICPSR Summer Session #2 Lecture #47/21/2011 Slide 1 of 41 Last Time Matrices and vectors Eigenvalues
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationFading multipath radio channels
Fading multipath radio channels Narrowband channel modelling Wideband channel modelling Wideband WSSUS channel (functions, variables & distributions) Lowpass equivalent (LPE) signal ( ) = Re ( ) s t RF
More informationADVANCED LINEAR ALGEBRA FOR ENGINEERS WITH MATLAB. Sohail A. Dianat. Rochester Institute of Technology, New York, U.S.A. Eli S.
ADVANCED LINEAR ALGEBRA FOR ENGINEERS WITH MATLAB Sohail A. Dianat Rochester Institute of Technology, New York, U.S.A. Eli S. Saber Rochester Institute of Technology, New York, U.S.A. (g) CRC Press Taylor
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 WeiTa Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationINTER CARRIER INTERFERENCE CANCELLATION IN HIGH SPEED OFDM SYSTEM Y. Naveena *1, K. Upendra Chowdary 2
ISSN 22772685 IJESR/June 2014/ Vol4/Issue6/333337 Y. Naveena et al./ International Journal of Engineering & Science Research INTER CARRIER INTERFERENCE CANCELLATION IN HIGH SPEED OFDM SYSTEM Y. Naveena
More information(57) (58) (59) (60) (61)
Module 4 : Solving Linear Algebraic Equations Section 5 : Iterative Solution Techniques 5 Iterative Solution Techniques By this approach, we start with some initial guess solution, say for solution and
More informationBlock designs/1. 1 Background
Block designs 1 Background In a typical experiment, we have a set Ω of experimental units or plots, and (after some preparation) we make a measurement on each plot (for example, the yield of the plot).
More informationRegression III: Advanced Methods
Lecture 5: Linear leastsquares Regression III: Advanced Methods William G. Jacoby Department of Political Science Michigan State University http://polisci.msu.edu/jacoby/icpsr/regress3 Simple Linear Regression
More informationCapacity Limits of MIMO Channels
Tutorial and 4G Systems Capacity Limits of MIMO Channels Markku Juntti Contents 1. Introduction. Review of information theory 3. Fixed MIMO channels 4. Fading MIMO channels 5. Summary and Conclusions References
More informationCoding and decoding with convolutional codes. The Viterbi Algor
Coding and decoding with convolutional codes. The Viterbi Algorithm. 8 Block codes: main ideas Principles st point of view: infinite length block code nd point of view: convolutions Some examples Repetition
More informationMODULATION Systems (part 1)
Technologies and Services on Digital Broadcasting (8) MODULATION Systems (part ) "Technologies and Services of Digital Broadcasting" (in Japanese, ISBN4339622) is published by CORONA publishing co.,
More informationLeast Squares Estimation
Least Squares Estimation SARA A VAN DE GEER Volume 2, pp 1041 1045 in Encyclopedia of Statistics in Behavioral Science ISBN13: 9780470860809 ISBN10: 0470860804 Editors Brian S Everitt & David
More informationProbability and Random Variables. Generation of random variables (r.v.)
Probability and Random Variables Method for generating random variables with a specified probability distribution function. Gaussian And Markov Processes Characterization of Stationary Random Process Linearly
More informationLecture 5 Leastsquares
EE263 Autumn 200708 Stephen Boyd Lecture 5 Leastsquares leastsquares (approximate) solution of overdetermined equations projection and orthogonality principle leastsquares estimation BLUE property
More informationUnit 3 Spread Spectrum Modulation
Unit 3 Spread Spectrum Modulation Instructor: SauHsuan Wu Dept. of Electrical and Computer Eng., NCTU 1 What is spread spectrum modulation? A means of transmission in which data sequences occupy a bandwidth
More informationAppendix D Digital Modulation and GMSK
D1 Appendix D Digital Modulation and GMSK A brief introduction to digital modulation schemes is given, showing the logical development of GMSK from simpler schemes. GMSK is of interest since it is used
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in twodimensional space (1) 2x y = 3 describes a line in twodimensional space The coefficients of x and y in the equation
More information3. Recurrence Recursive Definitions. To construct a recursively defined function:
3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a
More informationDirect Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationDepartment of Electrical and Computer Engineering BenGurion University of the Negev. LAB 1  Introduction to USRP
Department of Electrical and Computer Engineering BenGurion University of the Negev LAB 1  Introduction to USRP  11 Introduction In this lab you will use software reconfigurable RF hardware from National
More informationIEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 55, NO. 1, JANUARY 2007 341
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 55, NO. 1, JANUARY 2007 341 Multinode Cooperative Communications in Wireless Networks Ahmed K. Sadek, Student Member, IEEE, Weifeng Su, Member, IEEE, and K.
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationRevision of Lecture 3
Revision of Lecture 3 Modulator/demodulator Basic operations of modulation and demodulation Complex notations for modulation and demodulation Carrier recovery and timing recovery This lecture: bits map
More informationADVANCED APPLICATIONS OF ELECTRICAL ENGINEERING
Development of a Software Tool for Performance Evaluation of MIMO OFDM Alamouti using a didactical Approach as a Educational and Research support in Wireless Communications JOSE CORDOVA, REBECA ESTRADA
More informationNRZ Bandwidth  HF Cutoff vs. SNR
Application Note: HFAN09.0. Rev.2; 04/08 NRZ Bandwidth  HF Cutoff vs. SNR Functional Diagrams Pin Configurations appear at end of data sheet. Functional Diagrams continued at end of data sheet. UCSP
More informationL6: Shorttime Fourier analysis and synthesis
L6: Shorttime Fourier analysis and synthesis Overview Analysis: Fouriertransform view Analysis: filtering view Synthesis: filter bank summation (FBS) method Synthesis: overlapadd (OLA) method STFT magnitude
More informationIntroduction. Antennas and Propagation. Types of Antennas. Radiation Patterns. Antenna Gain. Antenna Gain
Introduction Antennas and Propagation Chapter 5 An antenna is an electrical conductor or system of conductors Transmission  radiates electromagnetic energy into space Reception  collects electromagnetic
More informationSparse Channel Estimation with Zero Tap Detection
Sparse Channel Estimation with Zero Tap Detection C. Carbonelli S. Vedantam, U. Mitra Department of Information Engineering Communications Science Institute University of Pisa University of Southern California
More informationLinear Systems. Singular and Nonsingular Matrices. Find x 1, x 2, x 3 such that the following three equations hold:
Linear Systems Example: Find x, x, x such that the following three equations hold: x + x + x = 4x + x + x = x + x + x = 6 We can write this using matrixvector notation as 4 {{ A x x x {{ x = 6 {{ b General
More informationMIMO CHANNEL CAPACITY
MIMO CHANNEL CAPACITY Ochi Laboratory Nguyen Dang Khoa (D1) 1 Contents Introduction Review of information theory Fixed MIMO channel Fading MIMO channel Summary and Conclusions 2 1. Introduction The use
More informationOrthogonal Projections
Orthogonal Projections and Reflections (with exercises) by D. Klain Version.. Corrections and comments are welcome! Orthogonal Projections Let X,..., X k be a family of linearly independent (column) vectors
More informationSolutions to Exam in Speech Signal Processing EN2300
Solutions to Exam in Speech Signal Processing EN23 Date: Thursday, Dec 2, 8: 3: Place: Allowed: Grades: Language: Solutions: Q34, Q36 Beta Math Handbook (or corresponding), calculator with empty memory.
More informationAN INTRODUCTION TO ERROR CORRECTING CODES Part 1
AN INTRODUCTION TO ERROR CORRECTING CODES Part 1 Jack Keil Wolf ECE 154C Spring 2008 Noisy Communications Noise in a communications channel can cause errors in the transmission of binary digits. Transmit:
More informationLogLikelihood Ratiobased Relay Selection Algorithm in Wireless Network
Recent Advances in Electrical Engineering and Electronic Devices LogLikelihood Ratiobased Relay Selection Algorithm in Wireless Network Ahmed ElMahdy and Ahmed Walid Faculty of Information Engineering
More informationINTRODUCTION TO SIGNAL PROCESSING
INTRODUCTION TO SIGNAL PROCESSING Iasonas Kokkinos Ecole Centrale Paris Lecture 7 Introduction to Random Signals Sources of randomness Inherent in the signal generation Noise due to imaging Prostate MRI
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F) denotes the collection of all m n matrices over F Matrices will usually be denoted
More information(Refer Slide Time: 01:1101:27)
Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture  6 Digital systems (contd.); inverse systems, stability, FIR and IIR,
More informationOriginal Lecture Notes developed by
Introduction to ADSL Modems Original Lecture Notes developed by Prof. Brian L. Evans Dept. of Electrical and Comp. Eng. The University of Texas at Austin http://signal.ece.utexas.edu Outline Broadband
More informationEmail: tjohn@mail.nplindia.ernet.in
USE OF VIRTUAL INSTRUMENTS IN RADIO AND ATMOSPHERIC EXPERIMENTS P.N. VIJAYAKUMAR, THOMAS JOHN AND S.C. GARG RADIO AND ATMOSPHERIC SCIENCE DIVISION, NATIONAL PHYSICAL LABORATORY, NEW DELHI 110012, INDIA
More informationInverses and powers: Rules of Matrix Arithmetic
Contents 1 Inverses and powers: Rules of Matrix Arithmetic 1.1 What about division of matrices? 1.2 Properties of the Inverse of a Matrix 1.2.1 Theorem (Uniqueness of Inverse) 1.2.2 Inverse Test 1.2.3
More informationSTATISTICA Formula Guide: Logistic Regression. Table of Contents
: Table of Contents... 1 Overview of Model... 1 Dispersion... 2 Parameterization... 3 SigmaRestricted Model... 3 Overparameterized Model... 4 Reference Coding... 4 Model Summary (Summary Tab)... 5 Summary
More informationInferential Statistics
Inferential Statistics Sampling and the normal distribution Zscores Confidence levels and intervals Hypothesis testing Commonly used statistical methods Inferential Statistics Descriptive statistics are
More informationNonlinear Iterative Partial Least Squares Method
Numerical Methods for Determining Principal Component Analysis Abstract Factors Béchu, S., RichardPlouet, M., Fernandez, V., Walton, J., and Fairley, N. (2016) Developments in numerical treatments for
More information1 Gaussian Elimination
Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 GaussJordan reduction and the Reduced
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationProbability & Statistics Primer Gregory J. Hakim University of Washington 2 January 2009 v2.0
Probability & Statistics Primer Gregory J. Hakim University of Washington 2 January 2009 v2.0 This primer provides an overview of basic concepts and definitions in probability and statistics. We shall
More informationA SIMULATION STUDY ON SPACETIME EQUALIZATION FOR MOBILE BROADBAND COMMUNICATION IN AN INDUSTRIAL INDOOR ENVIRONMENT
A SIMULATION STUDY ON SPACETIME EQUALIZATION FOR MOBILE BROADBAND COMMUNICATION IN AN INDUSTRIAL INDOOR ENVIRONMENT U. Trautwein, G. Sommerkorn, R. S. Thomä FG EMT, Ilmenau University of Technology P.O.B.
More informationDYNAMIC RANGE IMPROVEMENT THROUGH MULTIPLE EXPOSURES. Mark A. Robertson, Sean Borman, and Robert L. Stevenson
c 1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or
More informationBy W.E. Diewert. July, Linear programming problems are important for a number of reasons:
APPLIED ECONOMICS By W.E. Diewert. July, 3. Chapter : Linear Programming. Introduction The theory of linear programming provides a good introduction to the study of constrained maximization (and minimization)
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More information1 Short Introduction to Time Series
ECONOMICS 7344, Spring 202 Bent E. Sørensen January 24, 202 Short Introduction to Time Series A time series is a collection of stochastic variables x,.., x t,.., x T indexed by an integer value t. The
More informationPATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical
More informationBackground: State Estimation
State Estimation Cyber Security of the Smart Grid Dr. Deepa Kundur Background: State Estimation University of Toronto Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 1 / 81 Dr.
More informationWiMAX Performance Analysis under the Effect of Doppler s Shift
WiMAX Performance Analysis under the Effect of Doppler s Shift Navgeet Singh 1, Amita Soni 2 1, 2 Department of Electronics and Electrical Engineering, PEC University of Technology, Chandigarh, India Abstract:
More informationSYSTEMS OF REGRESSION EQUATIONS
SYSTEMS OF REGRESSION EQUATIONS 1. MULTIPLE EQUATIONS y nt = x nt n + u nt, n = 1,...,N, t = 1,...,T, x nt is 1 k, and n is k 1. This is a version of the standard regression model where the observations
More informationEC327: Advanced Econometrics, Spring 2007
EC327: Advanced Econometrics, Spring 2007 Wooldridge, Introductory Econometrics (3rd ed, 2006) Appendix D: Summary of matrix algebra Basic definitions A matrix is a rectangular array of numbers, with m
More informationBy choosing to view this document, you agree to all provisions of the copyright laws protecting it.
This material is posted here with permission of the IEEE Such permission of the IEEE does not in any way imply IEEE endorsement of any of Helsinki University of Technology's products or services Internal
More informationRoundoff Noise in IIR Digital Filters
Chapter 16 Roundoff Noise in IIR Digital Filters It will not be possible in this brief chapter to discuss all forms of IIR (infinite impulse response) digital filters and how quantization takes place in
More informationWHITEPAPER. Improving recovered signal quality in TETRA Systems
Improving recovered signal quality in TETRA Systems To ensure the reliable recovery of transmitted digital signals, modern communication systems must overcome a number of factors affecting the signal s
More informationSpatial Statistics Chapter 3 Basics of areal data and areal data modeling
Spatial Statistics Chapter 3 Basics of areal data and areal data modeling Recall areal data also known as lattice data are data Y (s), s D where D is a discrete index set. This usually corresponds to data
More informationLINEAR SYSTEMS. Consider the following example of a linear system:
LINEAR SYSTEMS Consider the following example of a linear system: Its unique solution is x +2x 2 +3x 3 = 5 x + x 3 = 3 3x + x 2 +3x 3 = 3 x =, x 2 =0, x 3 = 2 In general we want to solve n equations in
More informationT = 1 f. Phase. Measure of relative position in time within a single period of a signal For a periodic signal f(t), phase is fractional part t p
Data Transmission Concepts and terminology Transmission terminology Transmission from transmitter to receiver goes over some transmission medium using electromagnetic waves Guided media. Waves are guided
More information