Notes on Linear Minimum Mean Square Error Estimators
|
|
- Loren Estella Gilmore
- 6 years ago
- Views:
Transcription
1 Notes on Linear Minimum Mean Square Error Estimators Ça gatay Candan January, 0 Abstract Some connections between linear minimum mean square error estimators, maximum output SNR filters and the least square solutions are presented. The notes hae been prepared to be distributed with EE 503 (METU, Electrical Engin.) lecture notes. Linear Minimum Mean Square Error Estimators The following signal model is assumed: r = Hs + () Here r is a N column ector denoting the obserations. In this model, s is the desired signal ector, is the interference ector on the obserations. We assume that s and are uncorrelated as in all stochastic filtering applications. It can be noted that the obserations are linear combinations of desired quantities and interference. Here the matrix H is an N M matrix (N can be less than or greater than M, hence the system can be under or oer determined). H can be considered as the channel or the obseration system or a linear combiner for the modes where the modes are the columns of H. The column ector s contains M entries each of which is to be estimated. In class, we hae deried the optimal linear minimum mean square error estimator as the solution of the following system of equations: R r W = R rs () Here R r = E{rr H } is the auto-correlation matrix of the obserations and R rs = E{rs H } is the cross-correlation matrix of obserations and the desired ariables. The minimum mean square error estimate for s is gien as follows: ŝ = W H r (3) The error coariance matrix for the minimum error estimator is as shown below: R e = E{(s ŝ) (s ŝ) H )} = E{e(s H r H W)} e e H (a) = E{es H } E{er H } W 0 = E{(s W H r)s H } = R s W H R rs (4) The zero matrix on the right hand side of equation shown with (a) is due to the orthogonality condition of the optimal estimator. Next, we explicitly calculate the estimator in terms of H, R s and R matrices. The following can be easily erified: R r = HR s H H + R R rs = HR s (5)
2 Then the optimal filter is gien as follows: The estimator and its error coariance matrix is then W = (HR s H H + R ) HR s (6) Linear Min. MMSE Estimator (Form ) ŝ = W H r = R s H H (HR s H H + R ) r (7) R e = R s R s H H (HR s H H + R ) HR s This concludes the deriation of the estimator. In the following section, we present an alternatie form which is mathematically identical but has some implementation adantages if H matrix is tall and long (N > M or the number of obserations > the number of unknowns) which is the case of interest for most of the time.. An Alternatie Form for Linear MMSE Estimator We follow the deriation gien by Luenberger in [, p.90]. The matrix identity RW H (WRW H + Q) = (W H Q W + R ) W H Q (8) can be proen easily by pre and post multiplying both sides of the relation by W H Q W + R and WRW H + Q respectiely. Using this identity we can write the following: R s H H (HR s H H + R ) = (H H R Replacing the related terms in (7), we get the second form of the estimator: ŝ = W H r = (H H R R e = R s (H H R = (H H R = (H H R s ) H H R (9) Linear Min. MMSE Estimator (Form ) s ) H H R r s ) H H R HR s s ) ( (H H R s )R s H H R ) HR s ) s In many applications the number of obserations is significantly larger than the number of ariables to estimate. As an example, if 0 obserations are collected to estimate ariables; the first form requires 0 0 matrix inersion, the second form requires matrix inersion which makes a lot of difference in the implementation. Maximum SNR Filters In many applications, SNR determines the performance of a system. Therefore its improement is a major goal in signal processing. We assume that N obserations of a WSS random process s[n] are made under additie noise process [n] which is also WSS and uncorrelated with s[n]. The SNR of the obserations is defined as the input SNR. (0) r[n] = s[n] + [n] () (SNR) in = E{s [n]} E{ [n]} = σ s σ () (It should be noted that both s[n] and [n] are assumed to be zero-mean processes as we hae assumed during the lectures.)
3 As we know, the output of a LTI filter with the input r[n] is known to be WSS stationary and its ariance can be calculated as follows. y[n] = N k=0 h k r[n k] = hh r[n] (3) Here we assume that the LTI filter is FIR and with the impulse response of h n. The ectors h and r[n] appearing on the right most side of (3) are column ectors which are defined as h T = [h 0... h N ] T and r[n] T = [r[n] r[n ]... r[n (N )] ] T. The signal and noise term at the filter output can then be expressed as y[n] = h H s[n] + h H [n] signal noise (4) The output SNR becomes as follows: (SNR) out = E{ hh s[n] } E{ h H [n] } = hh R s h h H R h (5) The filter maximizing the output SNR can be found as the solution of the following optimization problem: h = arg max h h H R s h h H R h The filter maximizing this ratio is called as the maximum SNR filter h and it can be shown that it is the eigenector of R R s with the maximum eigenalue. h eigenector of (R R s ) with the maximum eigenalue (7) It should be noted that h is uniquely determined apart from a constant scaling. It is clear that by scaling h with an arbitrary complex constant, we can achiee the same output SNR. More information on the discussed optimization problem can be found in the linear algebra books under the topic of Rayleigh quotient. It should also be noted that h is also called the generalized eigenector of R and R s with the maximum eigenalue. (Matlab s eig.m function has an option of calculating the generalized eigenectors.) This concludes the discussion of maximum-snr filters. Below we examine a special case which naturally emerges in many applications. In many applications, the auto-correlation matrix of s[n] is rank-, that is (6) R s = σ spp H (8) For this special case, the maximum SNR filter and the maximum SNR alue can be written as follows: h R p max(snr) out = p H R p (9) It should be noted that the maximum-snr filter is well known whitened matched filter for this case. It is the matched filter for the white noise case. 3 Connection Between Max-SNR and Min-MMSE Filters for Processes with Rank- Spectral Expansion It is intuitiely clear that filtering the obserations to remoe the noise is helpful to improe the SNR. In this section, we show that the min-mmse filters and Max-SNR filters are (apart from a constant complex scaling) identical for rank- R s matrices. Hence min-mmse filter is equialent to Max-SNR filter in the sense of optimizing the SNR for this type of processes. 3
4 Let s[n] be a rank- process obsered under additie white noise, r = ps + (0) Here r, p and are length N column ectors; s is a zero-mean scalar with ariance σ s and is a complex alued process with zero-mean and coariance matrix R. By substituting H p, R s σ s in (0), we get ŝ = w H MMSE r = p H R p + σ s p H R r. () wmax SNR H This equation shows that the min-mmse filter is the scaled ersion of the max-snr filter. Hence they yield the same output SNR. The minimum error of MMSE filter can also be written from (0): σ e = = (p H R p + ) Max(SNR) out + () Here we hae identified p H R pσ s as the maximum SNR for rank- stochastic signals, see (9). The last equation can be written in the following simple form Max(SNR) out = norm-min-mmse (3) where norm-min-mmse is σ e which is the normalized minimum mean square estimation error. The generalized ersion of similar results are aailable in [, around eq.5]. 4 Connection Between MMSE and Weighted Least Square Filters The minimum mean square error filter always produces an output een when the number of obserations is less than the number of unknowns (undertermined case). This is due to a-priori moment information about the obserations and desired process. As the a-priori information gets looser, that is less informing, the minimum mean square error filter approaches weighted least square (LS) filter. The weighted LS filter is known to be optimal for the estimation of non-random parameters which are obsered with linear models under correlated noise, [3]. The conergence of (MMSE) (weighted LS) can be noted from (0) by substituting R s I: ŝ = WMMSEr H = (H H R H) H H R r (4) weighted LS The last equation is the weighted least square solution of r = Hs equation system with the weight matrix R. The mean square error coariance matrix becomes R e = (H H R H) (5) When R is taken as unit ariance white noise, the classical least square solution emerges. In communications, the LS solution is also known as the zero-forcing solution. References [] D. G. Luenberger, Optimization by ector space methods. Wiley,
5 [] H. Sampath, P. Stoica, and A. Paulraj, Generalized linear precoder and decoder design for MIMO channels using the weighted MMSE criterion, IEEE Transactions on Communications, ol. 49, no., pp , 00. [3] S. M. Kay, Fundamentals of Statistical Signal Processing, Volume : Estimation Theory. Prentice Hall,
Assignment 4 (Solutions) NPTEL MOOC (Bayesian/ MMSE Estimation for MIMO/OFDM Wireless Communications)
Assignment 4 Solutions NPTEL MOOC Bayesian/ MMSE Estimation for MIMO/OFDM Wireless Communications The system model can be written as, y hx + The MSE of the MMSE estimate ĥ of the aboe mentioned system
More informationAstrometric Errors Correlated Strongly Across Multiple SIRTF Images
Astrometric Errors Correlated Strongly Across Multiple SIRTF Images John Fowler 28 March 23 The possibility exists that after pointing transfer has been performed for each BCD (i.e. a calibrated image
More informationEvolution Analysis of Iterative LMMSE-APP Detection for Coded Linear System with Cyclic Prefixes
Eolution Analysis of Iteratie LMMSE-APP Detection for Coded Linear System with Cyclic Prefixes Xiaoun Yuan Qinghua Guo and Li Ping Member IEEE Department of Electronic Engineering City Uniersity of Hong
More informationEconometrics II - EXAM Outline Solutions All questions have 25pts Answer each question in separate sheets
Econometrics II - EXAM Outline Solutions All questions hae 5pts Answer each question in separate sheets. Consider the two linear simultaneous equations G with two exogeneous ariables K, y γ + y γ + x δ
More informationNoise constrained least mean absolute third algorithm
Noise constrained least mean absolute third algorithm Sihai GUAN 1 Zhi LI 1 Abstract: he learning speed of an adaptie algorithm can be improed by properly constraining the cost function of the adaptie
More information2. Wireless Fading Channels
Fundamentals of Wireless Comm. Andreas Biri, D-ITET.07.7. Introduction Modulation (frequency shift to carrier frequency): - enables multiple (slightly shifted) simultaneous channels - better channel characteristics
More informationA Geometric Review of Linear Algebra
A Geometric Reiew of Linear Algebra The following is a compact reiew of the primary concepts of linear algebra. I assume the reader is familiar with basic (i.e., high school) algebra and trigonometry.
More informationA Geometric Review of Linear Algebra
A Geometric Reiew of Linear Algebra The following is a compact reiew of the primary concepts of linear algebra. The order of presentation is unconentional, with emphasis on geometric intuition rather than
More informationEIGENVALUES AND EIGENVECTORS
CHAPTER 6 EIGENVALUES AND EIGENVECTORS SECTION 6. INTRODUCTION TO EIGENVALUES In each of Problems we first list the characteristic polynomial p( λ) A λi of the gien matrix A and then the roots of p( λ
More informationDifferential Geometry of Surfaces
Differential Geometry of urfaces Jordan mith and Carlo équin C Diision, UC Berkeley Introduction These are notes on differential geometry of surfaces ased on reading Greiner et al. n. d.. Differential
More informationTrajectory Estimation for Tactical Ballistic Missiles in Terminal Phase Using On-line Input Estimator
Proc. Natl. Sci. Counc. ROC(A) Vol. 23, No. 5, 1999. pp. 644-653 Trajectory Estimation for Tactical Ballistic Missiles in Terminal Phase Using On-line Input Estimator SOU-CHEN LEE, YU-CHAO HUANG, AND CHENG-YU
More information1 :: Mathematical notation
1 :: Mathematical notation x A means x is a member of the set A. A B means the set A is contained in the set B. {a 1,..., a n } means the set hose elements are a 1,..., a n. {x A : P } means the set of
More informationOptimized Concatenated LDPC Codes for Joint Source-Channel Coding
Optimized Concatenated LDPC Codes for Joint Source-Channel Coding Maria Fresia, Fernando Pérez-Cruz, H. Vincent Poor Department of Electrical Engineering, Princeton Uniersity, Princeton, New Jersey 08544
More informationAn Optimal Split-Plot Design for Performing a Mixture-Process Experiment
Science Journal of Applied Mathematics and Statistics 217; 5(1): 15-23 http://www.sciencepublishinggroup.com/j/sjams doi: 1.11648/j.sjams.21751.13 ISSN: 2376-9491 (Print); ISSN: 2376-9513 (Online) An Optimal
More informationNOTES ON THE REGULAR E-OPTIMAL SPRING BALANCE WEIGHING DESIGNS WITH CORRE- LATED ERRORS
REVSTAT Statistical Journal Volume 3, Number 2, June 205, 9 29 NOTES ON THE REGULAR E-OPTIMAL SPRING BALANCE WEIGHING DESIGNS WITH CORRE- LATED ERRORS Authors: Bronis law Ceranka Department of Mathematical
More informationOptimal Joint Detection and Estimation in Linear Models
Optimal Joint Detection and Estimation in Linear Models Jianshu Chen, Yue Zhao, Andrea Goldsmith, and H. Vincent Poor Abstract The problem of optimal joint detection and estimation in linear models with
More informationReview of Matrices and Vectors 1/45
Reiew of Matrices and Vectors /45 /45 Definition of Vector: A collection of comple or real numbers, generally put in a column [ ] T "! Transpose + + + b a b a b b a a " " " b a b a Definition of Vector
More informationMassachusetts Institute of Technology
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.011: Introduction to Communication, Control and Signal Processing QUIZ, April 1, 010 QUESTION BOOKLET Your
More informationZero-Delay Source-Channel Coding with a One-Bit ADC Front End and Correlated Side Information at the Receiver
Zero-Delay Source-Channel Coding with a One-Bit ADC Front End and Correlated Side Information at the Receier arxi:1703.0109 [cs.it] 6 Mar 017 Morteza Varasteh, Borzoo Rassouli, Osaldo Simeone and Deniz
More informationANGLE OF OF ARRIVAL ESTIMATION WITH A POLARIZATION DIVERSE ARRAY
ANGLE OF OF ARRIVAL ESTIMATION WIT A POLARIZATION DIVERSE ARRAY DR. DR. WILLIAM ILLIAM P. P. BALLANCE ** RALP ALP A. A. COAN COAN MARC 999 999 * No it Te Boeing Company WPB- Problem formulation OUTLINE
More informationThe goal of the Wiener filter is to filter out noise that has corrupted a signal. It is based on a statistical approach.
Wiener filter From Wikipedia, the free encyclopedia In signal processing, the Wiener filter is a filter proposed by Norbert Wiener during the 1940s and published in 1949. [1] Its purpose is to reduce the
More informationStatistical and Adaptive Signal Processing
r Statistical and Adaptive Signal Processing Spectral Estimation, Signal Modeling, Adaptive Filtering and Array Processing Dimitris G. Manolakis Massachusetts Institute of Technology Lincoln Laboratory
More informationES.1803 Topic 16 Notes Jeremy Orloff
ES803 Topic 6 Notes Jerem Orloff 6 Eigenalues, diagonalization, decoupling This note coers topics that will take us seeral classes to get through We will look almost eclusiel at 2 2 matrices These hae
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 11, November-2016 ISSN Nullity of Expanded Smith graphs
85 Nullity of Expanded Smith graphs Usha Sharma and Renu Naresh Department of Mathematics and Statistics, Banasthali Uniersity, Banasthali Rajasthan : usha.sharma94@yahoo.com, : renunaresh@gmail.com Abstract
More informationOBSERVATIONS ON BAGGING
OBSERVATIONS ON BAGGING Andreas Buja and Werner Stuetzle Uniersity of Pennsylania and Uniersity of Washington Abstract: Bagging is a deice intended for reducing the prediction error of learning algorithms.
More informationNON-PARAMETRIC METHODS IN ANALYSIS OF EXPERIMENTAL DATA
NON-PARAMETRIC METHODS IN ANALYSIS OF EXPERIMENTAL DATA Rajender Parsad I.A.S.R.I., Library Aenue, New Delhi 0 0. Introduction In conentional setup the analysis of experimental data is based on the assumptions
More informationComputing Laboratory A GAME-BASED ABSTRACTION-REFINEMENT FRAMEWORK FOR MARKOV DECISION PROCESSES
Computing Laboratory A GAME-BASED ABSTRACTION-REFINEMENT FRAMEWORK FOR MARKOV DECISION PROCESSES Mark Kattenbelt Marta Kwiatkowska Gethin Norman Daid Parker CL-RR-08-06 Oxford Uniersity Computing Laboratory
More informationMean-variance receding horizon control for discrete time linear stochastic systems
Proceedings o the 17th World Congress The International Federation o Automatic Control Seoul, Korea, July 6 11, 008 Mean-ariance receding horizon control or discrete time linear stochastic systems Mar
More informationVariance Reduction for Stochastic Gradient Optimization
Variance Reduction for Stochastic Gradient Optimization Chong Wang Xi Chen Alex Smola Eric P. Xing Carnegie Mellon Uniersity, Uniersity of California, Berkeley {chongw,xichen,epxing}@cs.cmu.edu alex@smola.org
More informationA simple one sweep algorithm for optimal APP symbol decoding of linear block codes
A simple one sweep algorithm for optimal APP symbol decoding of linear block codes Johansson, Thomas; Zigangiro, Kamil Published in: IEEE Transactions on Information Theory DOI: 10.1109/18.737541 Published:
More informationAlgorithms and Data Structures 2014 Exercises and Solutions Week 14
lgorithms and ata tructures 0 xercises and s Week Linear programming. onsider the following linear program. maximize x y 0 x + y 7 x x 0 y 0 x + 3y Plot the feasible region and identify the optimal solution.
More informationTarget Trajectory Estimation within a Sensor Network
Target Trajectory Estimation within a Sensor Network Adrien Ickowicz IRISA/CNRS, 354, Rennes, J-Pierre Le Cadre, IRISA/CNRS,354, Rennes,France Abstract This paper deals with the estimation of the trajectory
More informationv v Downloaded 01/11/16 to Redistribution subject to SEG license or copyright; see Terms of Use at
The pseudo-analytical method: application of pseudo-laplacians to acoustic and acoustic anisotropic wae propagation John T. Etgen* and Serre Brandsberg-Dahl Summary We generalize the pseudo-spectral method
More informationarxiv: v1 [stat.ml] 15 Feb 2018
1 : A New Algorithm for Streaming PCA arxi:1802.054471 [stat.ml] 15 Feb 2018 Puyudi Yang, Cho-Jui Hsieh, Jane-Ling Wang Uniersity of California, Dais pydyang, chohsieh, janelwang@ucdais.edu Abstract In
More informationModeling Highway Traffic Volumes
Modeling Highway Traffic Volumes Tomáš Šingliar1 and Miloš Hauskrecht 1 Computer Science Dept, Uniersity of Pittsburgh, Pittsburgh, PA 15260 {tomas, milos}@cs.pitt.edu Abstract. Most traffic management
More informationMath 425 Lecture 1: Vectors in R 3, R n
Math 425 Lecture 1: Vectors in R 3, R n Motiating Questions, Problems 1. Find the coordinates of a regular tetrahedron with center at the origin and sides of length 1. 2. What is the angle between the
More informationMathisson s New Mechanics : Its Aims and Realisation. W G Dixon, Churchill College, Cambridge, England
Lecture : ims Mathisson s New Mechanics : Its ims Realisation W G Dixon, Churchill College, Cambridge, Engl It gies me great pleasure to be inited to speak at this meeting on the life work of Myron Mathisson
More informationarxiv: v1 [physics.comp-ph] 17 Jan 2014
An efficient method for soling a correlated multi-item inentory system Chang-Yong Lee and Dongu Lee The Department of Industrial & Systems Engineering, Kongu National Uniersity, Kongu 34-70 South Korea
More information4. A Physical Model for an Electron with Angular Momentum. An Electron in a Bohr Orbit. The Quantum Magnet Resulting from Orbital Motion.
4. A Physical Model for an Electron with Angular Momentum. An Electron in a Bohr Orbit. The Quantum Magnet Resulting from Orbital Motion. We now hae deeloped a ector model that allows the ready isualization
More informationNon-Surjective Finite Alphabet Iterative Decoders
IEEE ICC 2016 - Communications Theory Non-Surjectie Finite Alphabet Iteratie Decoders Thien Truong Nguyen-Ly, Khoa Le,V.Sain, D. Declercq, F. Ghaffari and O. Boncalo CEA-LETI, MINATEC Campus, Grenoble,
More informationarxiv: v1 [math.ds] 19 Jul 2016
Mutually Quadratically Inariant Information Structures in Two-Team Stochastic Dynamic Games Marcello Colombino Roy S Smith and Tyler H Summers arxi:160705461 mathds 19 Jul 016 Abstract We formulate a two-team
More informationInelastic Collapse in One Dimensional Systems with Ordered Collisions
Lake Forest College Lake Forest College Publications Senior Theses Student Publications 4-4-05 Inelastic Collapse in One Dimensional Systems with Ordered Collisions Brandon R. Bauerly Lake Forest College,
More informationEstimation of Efficiency with the Stochastic Frontier Cost. Function and Heteroscedasticity: A Monte Carlo Study
Estimation of Efficiency ith the Stochastic Frontier Cost Function and Heteroscedasticity: A Monte Carlo Study By Taeyoon Kim Graduate Student Oklahoma State Uniersity Department of Agricultural Economics
More informationA matrix Method for Interval Hermite Curve Segmentation O. Ismail, Senior Member, IEEE
International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:15 No:03 7 A matrix Method for Interal Hermite Cure Segmentation O. Ismail, Senior Member, IEEE Abstract Since the use
More informationWeiss-Weinstein Bounds for Various Priors
Weiss-Weinstein Bounds for Various Priors Florian Xaer, Christoph F. Mecklenbräuker, Peter Gerstoft, and Gerald Matz Abstract We address analytic solutions of the Weiss-Weinstein bound (WWB), which lower
More informationAnalytical solutions for compartmental models of contaminant transport in enclosed. spaces
ESGI8 Analytical solutions for compartmental models of contaminant transport in enclosed Problem presented by Simon Parker DSTL Executie Summary Understanding the transport of hazardous airborne materials
More informationOnline Companion to Pricing Services Subject to Congestion: Charge Per-Use Fees or Sell Subscriptions?
Online Companion to Pricing Serices Subject to Congestion: Charge Per-Use Fees or Sell Subscriptions? Gérard P. Cachon Pnina Feldman Operations and Information Management, The Wharton School, Uniersity
More informationA Regularization Framework for Learning from Graph Data
A Regularization Framework for Learning from Graph Data Dengyong Zhou Max Planck Institute for Biological Cybernetics Spemannstr. 38, 7076 Tuebingen, Germany Bernhard Schölkopf Max Planck Institute for
More informationTowards Green Distributed Storage Systems
Towards Green Distributed Storage Systems Abdelrahman M. Ibrahim, Ahmed A. Zewail, and Aylin Yener Wireless Communications and Networking Laboratory (WCAN) Electrical Engineering Department The Pennsylania
More informationGeneralized Sidelobe Canceller and MVDR Power Spectrum Estimation. Bhaskar D Rao University of California, San Diego
Generalized Sidelobe Canceller and MVDR Power Spectrum Estimation Bhaskar D Rao University of California, San Diego Email: brao@ucsd.edu Reference Books 1. Optimum Array Processing, H. L. Van Trees 2.
More informationCOMPLEX CONSTRAINED CRB AND ITS APPLICATION TO SEMI-BLIND MIMO AND OFDM CHANNEL ESTIMATION. Aditya K. Jagannatham and Bhaskar D.
COMPLEX CONSTRAINED CRB AND ITS APPLICATION TO SEMI-BLIND MIMO AND OFDM CHANNEL ESTIMATION Aditya K Jagannatham and Bhaskar D Rao University of California, SanDiego 9500 Gilman Drive, La Jolla, CA 92093-0407
More informationPartial Update LMS Algorithms
JOURNAL OF L A TEX CLASS FILES, VOL. 1, NO. 11, NOVEMBER 00 1 Partial Update LMS Algorithms Mahesh Godaarti, Member, IEEE, and Alfred Hero, Fellow, IEEE Abstract Partial updating of LMS filter coefficients
More informationExploiting Source Redundancy to Improve the Rate of Polar Codes
Exploiting Source Redundancy to Improe the Rate of Polar Codes Ying Wang ECE Department Texas A&M Uniersity yingang@tamu.edu Krishna R. Narayanan ECE Department Texas A&M Uniersity krn@tamu.edu Aiao (Andre)
More informationEstimation, Detection, and Identification CMU 18752
Estimation, Detection, and Identification CMU 18752 Graduate Course on the CMU/Portugal ECE PhD Program Spring 2008/2009 Instructor: Prof. Paulo Jorge Oliveira pjcro @ isr.ist.utl.pt Phone: +351 21 8418053
More informationChapter 8: MULTIPLE CONTINUOUS RANDOM VARIABLES
Charles Boncelet Probabilit Statistics and Random Signals" Oord Uniersit Press 06. ISBN: 978-0-9-0005-0 Chapter 8: MULTIPLE CONTINUOUS RANDOM VARIABLES Sections 8. Joint Densities and Distribution unctions
More informationScalar multiplication and algebraic direction of a vector
Roberto s Notes on Linear Algebra Chapter 1: Geometric ectors Section 5 Scalar multiplication and algebraic direction of a ector What you need to know already: of a geometric ectors. Length and geometric
More informationThe Riemann-Roch Theorem: a Proof, an Extension, and an Application MATH 780, Spring 2019
The Riemann-Roch Theorem: a Proof, an Extension, and an Application MATH 780, Spring 2019 This handout continues the notational conentions of the preious one on the Riemann-Roch Theorem, with one slight
More informationON THE CONSTRUCTION OF REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS
Colloquium Biometricum 43 3, 3 9 ON THE CONSTRUCTION OF REGUAR A-OPTIMA SPRING BAANCE WEIGHING DESIGNS Bronisław Ceranka, Małgorzata Graczyk Department of Matematical and Statistical Metods Poznań Uniersity
More informationDETECTION theory deals primarily with techniques for
ADVANCED SIGNAL PROCESSING SE Optimum Detection of Deterministic and Random Signals Stefan Tertinek Graz University of Technology turtle@sbox.tugraz.at Abstract This paper introduces various methods for
More information2) If a=<2,-1> and b=<3,2>, what is a b and what is the angle between the vectors?
CMCS427 Dot product reiew Computing the dot product The dot product can be computed ia a) Cosine rule a b = a b cos q b) Coordinate-wise a b = ax * bx + ay * by 1) If a b, a and b all equal 1, what s the
More informationUnit 11: Vectors in the Plane
135 Unit 11: Vectors in the Plane Vectors in the Plane The term ector is used to indicate a quantity (such as force or elocity) that has both length and direction. For instance, suppose a particle moes
More informationLINEAR ALGEBRA. and VECTOR GEOMETRY Volume 2 of 2 September 2014 edition
LINEAR ALGEBRA and VECTOR GEOMETRY Volume 2 of 2 September 2014 edition Because the book is so large, the entire Linear Algebra course has been split into two olumes. Grant Skene for Grant s Tutoring (www.grantstutoring.com)
More informationIsoperimetric problems
CHAPTER 2 Isoperimetric problems 2.1. History One of the earliest problems in geometry was the isoperimetric problem, which was considered by the ancient Greeks. The problem is to find, among all closed
More informationLECTURE 2: CROSS PRODUCTS, MULTILINEARITY, AND AREAS OF PARALLELOGRAMS
LECTURE : CROSS PRODUCTS, MULTILINEARITY, AND AREAS OF PARALLELOGRAMS MA1111: LINEAR ALGEBRA I, MICHAELMAS 016 1. Finishing up dot products Last time we stated the following theorem, for which I owe you
More informationUNIVERSITY OF TRENTO ITERATIVE MULTI SCALING-ENHANCED INEXACT NEWTON- METHOD FOR MICROWAVE IMAGING. G. Oliveri, G. Bozza, A. Massa, and M.
UNIVERSITY OF TRENTO DIPARTIMENTO DI INGEGNERIA E SCIENZA DELL INFORMAZIONE 3823 Poo Trento (Italy), Via Sommarie 4 http://www.disi.unitn.it ITERATIVE MULTI SCALING-ENHANCED INEXACT NEWTON- METHOD FOR
More informationMon Apr dot product, length, orthogonality, projection onto the span of a single vector. Announcements: Warm-up Exercise:
Math 2270-004 Week 2 notes We will not necessarily finish the material from a gien day's notes on that day. We may also add or subtract some material as the week progresses, but these notes represent an
More informationImproved Hidden Clique Detection by Optimal Linear Fusion of Multiple Adjacency Matrices
Iproed Hidden Clique Detection by Optial Linear Fusion of Multiple Adjacency Matrices Hianshu Nayar, Benjain A. Miller, Kelly Geyer, Rajonda S. Caceres, Steen T. Sith, and Raj Rao Nadakuditi Departent
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Wednesday, June 1, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationVectors in R n. P. Danziger
1 Vectors in R n P. Danziger 1 Vectors The standard geometric definition of ector is as something which has direction and magnitude but not position. Since ectors hae no position we may place them whereer
More informationIII.C - Linear Transformations: Optimal Filtering
1 III.C - Linear Transformations: Optimal Filtering FIR Wiener Filter [p. 3] Mean square signal estimation principles [p. 4] Orthogonality principle [p. 7] FIR Wiener filtering concepts [p. 8] Filter coefficients
More informationConvex Subspace Representation Learning from Multi-View Data
Proceedings of the Twenty-Seenth AAAI Conference on Artificial Intelligence Conex Subspace Representation Learning from Multi-View Data Yuhong Guo Department of Computer and Information Sciences Temple
More informationMinimum Mean Squared Error Interference Alignment
Minimum Mean Squared Error Interference Alignment David A. Schmidt, Changxin Shi, Randall A. Berry, Michael L. Honig and Wolfgang Utschick Associate Institute for Signal Processing Technische Universität
More informationRelativity in Classical Mechanics: Momentum, Energy and the Third Law
Relatiity in Classical Mechanics: Momentum, Energy and the Third Law Roberto Assumpção, PUC-Minas, Poços de Caldas- MG 37701-355, Brasil assumpcao@pucpcaldas.br Abstract Most of the logical objections
More informationarxiv: v10 [cs.lg] 21 Aug 2016
Fast Collaboratie Filtering from Implicit Feedback with Proable Guarantees Sayantan Dasgupta arxi:5.79 [cs.lg] Aug 6 ABSTRACT Building recommendation algorithms is one of the most challenging tasks in
More informationBER Performance for Downlink MC-CDMA Systems over Rician Fading Channels
EURASIP Journal on Applied Signal Processing 2005:5, 709 717 c 2005 Hindawi Publishing Corporation BER Performance for Downlink MC-CDMA Systems oer Rician Fading Channels Zhihua Hou Positioning & Wireless
More informationExploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless
Exploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless SPAWC 2003 Rome, Italy June 18, 2003 E. Yoon, M. Vu and Arogyaswami Paulraj Stanford University Page 1 Outline Introduction
More informationJournal of Computational and Applied Mathematics. New matrix iterative methods for constraint solutions of the matrix
Journal of Computational and Applied Mathematics 35 (010 76 735 Contents lists aailable at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elseier.com/locate/cam New
More informationIEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 63, NO. 9, SEPTEMBER Qiwei Wang, Guangliang Ren, Member, IEEE, andjueyingwu
IEEE TRASACTIOS O COUICATIOS, VOL. 63, O. 9, SEPTEBER 2015 3299 A ultiuser Detection Algorithm for Random Access Procedure With the Presence of Carrier Frequency Offsets in LTE Systems Qiwei Wang, Guangliang
More information3. ESTIMATION OF SIGNALS USING A LEAST SQUARES TECHNIQUE
3. ESTIMATION OF SIGNALS USING A LEAST SQUARES TECHNIQUE 3.0 INTRODUCTION The purpose of this chapter is to introduce estimators shortly. More elaborated courses on System Identification, which are given
More informationAdaptive Filters. un [ ] yn [ ] w. yn n wun k. - Adaptive filter (FIR): yn n n w nun k. (1) Identification. Unknown System + (2) Inverse modeling
Adaptive Filters - Statistical digital signal processing: in many problems of interest, the signals exhibit some inherent variability plus additive noise we use probabilistic laws to model the statistical
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 11 Adaptive Filtering 14/03/04 http://www.ee.unlv.edu/~b1morris/ee482/
More informationClassical Mechanics NEWTONIAN SYSTEM OF PARTICLES MISN NEWTONIAN SYSTEM OF PARTICLES by C. P. Frahm
MISN-0-494 NEWTONIAN SYSTEM OF PARTICLES Classical Mechanics NEWTONIAN SYSTEM OF PARTICLES by C. P. Frahm 1. Introduction.............................................. 1 2. Procedures................................................
More informationAccuracy Bounds for Belief Propagation
Appeared at Uncertainty in Artificial Intelligence, July 2007. Some typos corrected. Accuracy Bounds for Belief Propagation Alexander T. Ihler Toyota Technological Institute, Chicago 427 East 60 th St.,
More informationDetecting Parametric Signals in Noise Having Exactly Known Pdf/Pmf
Detecting Parametric Signals in Noise Having Exactly Known Pdf/Pmf Reading: Ch. 5 in Kay-II. (Part of) Ch. III.B in Poor. EE 527, Detection and Estimation Theory, # 5c Detecting Parametric Signals in Noise
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Friday, May 25, 2018 09:00-11:30, Kansliet 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless
More informationCHAPTER 3 : VECTORS. Definition 3.1 A vector is a quantity that has both magnitude and direction.
EQT 101-Engineering Mathematics I Teaching Module CHAPTER 3 : VECTORS 3.1 Introduction Definition 3.1 A ector is a quantity that has both magnitude and direction. A ector is often represented by an arrow
More informationP(c y) = W n (y c)p(c)
ENEE 739C: Adanced Topics in Signal Processing: Coding Theory Instructor: Alexander Barg Lecture 9 (draft; /7/3). Codes defined on graphs. The problem of attaining capacity. Iteratie decoding. http://www.enee.umd.edu/
More informationA Closed-Form Characterization of Buyer Signaling Schemes in Monopoly Pricing
A Closed-Form Characterization of Buyer Signaling Schemes in Monopoly Pricing Weiran Shen IIIS, Tsinghua Uniersity Beijing, China emersonswr@gmail.com ABSTACT We consider a setting where a reenue maximizing
More informationVelocity, Acceleration and Equations of Motion in the Elliptical Coordinate System
Aailable online at www.scholarsresearchlibrary.com Archies of Physics Research, 018, 9 (): 10-16 (http://scholarsresearchlibrary.com/archie.html) ISSN 0976-0970 CODEN (USA): APRRC7 Velocity, Acceleration
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analysis of Variance and Design of Experiments-I MODULE IV LECTURE - 3 EXPERIMENTAL DESIGNS AND THEIR ANALYSIS Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
More informationBlind Channel Identification in (2 1) Alamouti Coded Systems Based on Maximizing the Eigenvalue Spread of Cumulant Matrices
Blind Channel Identification in (2 1) Alamouti Coded Systems Based on Maximizing the Eigenvalue Spread of Cumulant Matrices Héctor J. Pérez-Iglesias 1, Daniel Iglesia 1, Adriana Dapena 1, and Vicente Zarzoso
More informationLecture 8: MIMO Architectures (II) Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
MIMO : MIMO Theoretical Foundations of Wireless Communications 1 Wednesday, May 25, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication 1 / 20 Overview MIMO
More informationELEG-636: Statistical Signal Processing
ELEG-636: Statistical Signal Processing Gonzalo R. Arce Department of Electrical and Computer Engineering University of Delaware Spring 2010 Gonzalo R. Arce (ECE, Univ. of Delaware) ELEG-636: Statistical
More informationSingle-User MIMO systems: Introduction, capacity results, and MIMO beamforming
Single-User MIMO systems: Introduction, capacity results, and MIMO beamforming Master Universitario en Ingeniería de Telecomunicación I. Santamaría Universidad de Cantabria Contents Introduction Multiplexing,
More informationdifferent formulas, depending on whether or not the vector is in two dimensions or three dimensions.
ectors The word ector comes from the Latin word ectus which means carried. It is best to think of a ector as the displacement from an initial point P to a terminal point Q. Such a ector is expressed as
More informationSquare Estimation by Matrix Inverse Lemma 1
Proof of Two Conclusions Associated Linear Minimum Mean Square Estimation b Matri Inverse Lemma 1 Jianping Zheng State e Lab of IS, Xidian Universit, Xi an, 7171, P. R. China jpzheng@idian.edu.cn Ma 6,
More informationSteady-state DKF. M. Sami Fadali Professor EE UNR
Steady-state DKF M. Sami Fadali Professor EE UNR 1 Outline Stability of linear estimators. Lyapunov equation. Uniform exponential stability. Steady-state behavior of Lyapunov equation. Riccati equation.
More informationZ - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.
Z - Transform The z-transform is a very important tool in describing and analyzing digital systems. It offers the techniques for digital filter design and frequency analysis of digital signals. Definition
More informationSOS-BASED BLIND CHANNEL ESTIMATION IN MULTIUSER SPACE-TIME BLOCK CODED SYSTEMS
SOS-BASED BLIND CHANNEL ESTIMATION IN MULTIUSER SPACE-TIME BLOCK CODED SYSTEMS Javier Vía, Ignacio Santamaría Dept. of Communications Engineering University of Cantabria, Spain e-mail:jvia,nacho}@gtas.dicom.unican.es
More informationProbabilistic Engineering Design
Probabilistic Engineering Design Chapter One Introduction 1 Introduction This chapter discusses the basics of probabilistic engineering design. Its tutorial-style is designed to allow the reader to quickly
More information