Achieving the Gaussian Rate-Distortion Function by Prediction
|
|
- Stuart Blair
- 6 years ago
- Views:
Transcription
1 Achievig the Gaussia Rate-Distortio Fuctio by Predictio Ram Zamir, Yuval Kochma ad Uri Erez Dept. Electrical Egieerig-Systems, Tel Aviv Uiversity Abstract The water-fillig solutio for the quadratic ratedistortio fuctio of a statioary Gaussia source is give i terms of its power spectrum. This formula aturally leds itself to a frequecy domai test-chael realizatio. We provide a alterative time-domai realizatio for the rate-distortio fuctio, based o liear predictio. This solutio has some iterestig implicatios, icludig the optimality at all distortio levels of vector-quatized differetial pulse code modulatio DPCM, ad a duality relatioship with decisio-feedback equalizatio DFE for iter-symbol iterferece ISI chaels. I. INTRODUCTION: RATE-DISTORTION AND PREDICTION The rate-distortio fuctio RDF of a statioary source with memory is give by a time domai formula, that is, as a limit of ormalized mutual iformatios associated with vectors of source samples. For a real valued source..., X, X, X 0, X, X,..., ad mea-squared distortio level D, the RDF ca be writte as, [], RD = lim if IX,..., X ; Y,..., Y where the ifimum is over all chaels X Y such that Y X D. A chael which realizes this ifimum is called a optimum test-chael. Whe the source is Gaussia, the RDF takes a explicit form i the frequecy domai. Assumig auto-correlatio fuctio R[k] = E{X X k }, ad power-spectrum Se jπf = k R[k]e jkπf, f:se jπf >θ π < f < π the RDF is give by the water fillig formula / Se jπf RD = / log De jπf df Se jπf = log df θ where De jπf is the distortio spectrum { De jπf θ, if Se = jπf > θ Se jπf, otherwise, ad θ = θd is the water level chose such that / / Dejπf df = D. For the special case of a memoryless white Gaussia source N0, σ, the power-spectrum is flat Se jπf = σ, ad the RDF is simplified to log σ D. 3 Our mai result is a predictive time-domai realizatio for the quadratic-gaussia RDF. The otio of etropypower ad the Shao lower boud provide a simple relatio betwee ad predictio, which motivates our result. Recall that that the etropy-power is the variace of a white Gaussia process havig the same etropy-rate as the source; for a Gaussia source the etropy-power is give by / P e X = exp log Se jπf df. 4 / The Shao lower boud states that for ay D RD log Pe X D with equality for distortio levels smaller tha or equal to the lowest value of the power spectrum: D mi f Se jπf i which case De jπf = θ = D. See []. I the cotext of Wieer s spectral-factorizatio theory, 4 quatifies the measquared error of the oe-step liear predictor of the source from its ifiite past []; that is, we also have P e X = if {a i} E X 5 a i X i. 6 Now, by the orthogoality priciple see [4], the error process of the optimum ifiite-order predictor sometimes called the iovatio process E = X a i X i has zero mea ad is white. Hece, i view of 3 ad 5, for small distortio levels the RDF of a Gaussia source with memory is equal to the RDF of its memoryless predictio error process at the same distortio level. We shall see later i Sectio II how the observatio above traslates ito a predictive test-chael which ca realize the RDF ot oly for small but for all distortio levels. Before that, we d like to cosider aother feature of the frequecy-domai solutio which motivates the predictive time-domai result of Sectio II. Note that the optimum test-chael that realizes the memoryless RDF 3 takes the form of a memoryless liear-additive oise chael: Y = βαx N with α = β = D/σ ad N N0, D. I the geeral case α ad β take the form of pre- ad post-filters. I view
2 N X Pre filter U Z Zq V Post filter H e jπf H e jπf Y Û Predictor fv L Fig.. Predictive Test Chael of that, oe way to uderstad the form of the geeral RDF i is to look o its discrete approximatio i Se jπf log i De jπfi as ecodig of parallel idepedet Gaussia sources, where source i is a memoryless Gaussia source X fi N0, Se jπfi ecoded at distortio De jπfi ; see [3]. Furthermore, the RDF ca be realized by a vector of parallel chaels of the form Y fi = β i α i X fi N i. This iterpretatio motivates practical, frequecy domai source codig schemes such as Trasform Codig ad Sub-bad Codig [5], which get close to the RDF of a Gaussia source with memory usig scalar quatizatio. Sectio II proposes a alterative formulatio for the RDF that is motivated by the time-domai quatizatio scheme of Differetial Pulse Code Modulatio DPCM. The goal of the ew formulatio is, like i the frequecy domai iterpretatio of 7, to traslate the ecodig of depedet source samples ito a series of ecodigs of idepedet sources. The task of removig the depedece i the time domai approach is achieved by predictio. Kim ad Berger [8] showed that we caot achieve the RDF of a auto-regressive AR Gaussia process by ecodig its iovatio process. Their scheme amouts to ope-loop predictio of the source. I this paper we show that RDF ca be achieved by embeddig the ecoder iside the predictio loop, i.e., by closed-loop predictio. After presetig ad provig our mai result i Sectios II ad III, respectively, we provide reflectios o the result ad its operatioal implicatios. Sectio IV discusses the spectral features of the solutio, Sectio V relates it to compressio of parallel sources, ad Sectio VI discusses implemetatio by Etropy Coded Dithered Quatizatio ECDQ. Fially, i Sectio VII we relate predictio i source codig to predictio i the area of chael equalizatio ad to recet observatios by Forey [4]. Like i [4], our aalysis is doe maily usig the properties of iformatio measures; from Wieer estimatio theory we eed oly two basic results: the orthogoality priciple ad the oe-step predictio error formula 6. 7 II. MAIN RESULT: A PREDICTIVE TEST CHANNEL Cosider the system i Figure, which cosists of three basic blocks: pre-filter H e jπf, a oisy chael embedded i a close loop, ad a post-filter H e jπf. The system parameters are derived from the water-fillig solutio -. The source samples {X } are passed through a pre-filter, whose phase is arbitrary ad its absolute squared frequecy respose is give by H e jπf = Dejπf Se jπf. 8 The pre-filter output, deoted U, is beig fed to the cetral block which geerates a process V accordig to the the followig recursio equatios: Û = fv, V,..., V L 9 Z = U Û 0 Zq = Z N V = Û Zq where N N0, θ is zero-mea additive white Gaussia oise AWGN idepedet of the iput process {U } whose variace is equal to the water level θ, ad f is some predictio fuctio for the iput U give the L past samples of the output process V, V,..., V L. Fially, the post-filter frequecy respose is the complex cojugate of that of the pre-filter, H e jπf = H e jπf. 3 The block from U to V is equivalet to the cofiguratio of differetial pulse code modulatio DPCM, [7], [5], with the DPCM scalar quatizer replaced by the AWGN chael Zq = Z N. I particular, by combiig the recursio equatios 9- it follows that this block satisfies the well kow DPCM error idetity, [7], V = U Zq Z = U N. 4 That is, the output V is a oisy versio of the iput U via the AWGN chael V = U N. I DPCM the predictio fuctio f is liear: L fv,..., V L = a i V i 5
3 N X U V Pre filter Post filter He jπf He jπf Fig.. Equivalet Chael where a,..., a L miimize the mea-squared oise predictio error L E U a i V i. 6 If {U } ad {V } are joitly Gaussia, the the best predictor of ay order is liear, so the miimum of 6 is also the the miimum mea squared error MMSE i estimatig U from the vector V,..., V L. We shall further elaborate o the relatioship with DPCM later. Note that while the cetral block is sequetial ad hece causal, the pre- ad post-filters are o-causal ad therefore their realizatio i practice requires large delay. Our mai result is the followig. Theorem : For ay statioary source with power spectrum Se jπf, the system of Figure satisfies Y EY X = D. 7 Furthermore, if the source X is Gaussia, ad if the fuctio f is the optimum liear predictor of U give the ifiite past V, V,..., i.e., L = i 9-, the for all IZ ; Z N = RD. 8 The proof is give i Sectio III. The mai feature of Theorem is the fact that the left-had side of 8 is a sigle letter mutual iformatio. Thus, i a sese the core of the ecodig process amouts to a memoryless AWGN testchael. Aother iterestig feature of the system is the relatioship betwee the predictio error process Z ad the origial process X. If X is a auto-regressive AR process, the i the limit of small distortio D 0, Z is roughly its iovatio process. Hece, ulike i ope-loop predictio [8], ecodig the iovatios i a closed-loop system is optimal i the limit of high-resolutio ecodig. We shall retur to that, as well as discuss the case of geeral resolutio, i Sectio IV. III. PROOF OF MAIN RESULT Note first that the error idetity 4 implies that the etire system of Figure is equivalet to the system depicted i Figure, cosistig of a pre-filter 8, a AWGN chael with oise variace θ, ad a post-filter 3. This is, i fact, oe of the equivalet forms of the forward chael realizatio of the quadratic-gaussia RDF [, Sectio 4.5], [9]. I particular, simple spectral aalysis shows that the power spectrum of the overall error process Y X is equal to the water fillig distortio spectrum De jπf i ; hece the total distortio i 7 is D as desired. For the secod part, sice the system of Figure coicides with the forward chael realizatio of the quadratic-gaussia RDF, for a Gaussia source we have I{X }; {Y } = I{U }; {V } = RD where I deotes mutual iformatio-rate betwee joitly statioary sources: I{X }; {Y } = lim IX,..., X ; Y,..., Y. 9 Hece, the proof will be completed by showig that I{U }; {V } = IZ ; Z N. 0 To that ed, cosider the coditioal mutual iformatio betwee U,..., U ad V,..., V give V 0 L = V 0, V,..., V L. Usig the chai rule we have IU,..., U ; V,..., V V L 0 = IU,..., U ; V i V i L. By the recursio equatios 9-, the i-th term i the sum ca be writte as IU,..., U ; V i V i L = IU,..., U i, U i Ûi, i U i,..., U ; V i Ûi V L = IU,..., U i, Z i, U i,..., U ; Z i N i V i L. Sice the AWGN N is idepedet of the source U,..., U ad of the past values of V, we have the Markov chai relatio Z i N i Z i, V i L U,..., U i, U i,..., U. Note that future values of the output process V i, V i,.. deped o N i, but this does ot affect the Markov chai above. This relatio implies that the i-th term above simplifies to IZ i ; Z i N i V i L. Util ow we did t eed to use the source Gaussiaity or the optimality of the predictio fuctio f. Takig these ito accout, ad lettig the predictor order L, the orthogoality priciple of MMSE estimatio implies that the estimatio error Z i is statistically idepedet of the measuremets V i, V i,.... Sice N i is idepedet of both Z i ad the past V i s, the i-th term above further simplifies to IZ i ; Z i N i. We obtai IU,..., U ; V,..., V V 0, V,... = IZ i ; Z i N i = IZ ; Z N where the secod equality follows sice the system is timeivariat ad all the processes are statioary. Usig the defiitio of mutual iformatio rate 9, ad otig that it remais uchaged if we coditio o the ifiite past, we arrive at 0 ad the proof is completed.
4 IV. PROPERTIES OF THE PREDICTIVE TEST-CHANNEL The followig observatios shed light o the behavior of the test chael of Figure. Predictio i the high resolutio regime. If the powerspectrum Se jπf is everywhere positive e.g., if {X } ca be represeted as a AR process, the i the limit of small distortio D 0, predictig U from its oisy past {V i = U i N i : i =,,...}, is equivalet to predictig U from its clea past {U, U,...}. Hece, i this limit the predictio error Z is equal to the iovatio process associated with U. Sice for small distortio the pre- ad post-filters 8, 3 are roughly all-pass filters, U has roughly the same power spectrum as X ; hece Z is i fact equivalet to the iovatio process of X. I particular, Z is a i.i.d. process whose variace is P e X = the etropy-power of the source 4. Predictio i the geeral case. Iterestigly, for geeral distortio D > 0, the predictio error Z is ot white, as the oisiess of the past does ot allow the predictor f to remove all the source memory. Nevertheless, the oisy versio of the predictio error Zq = Z N is white for every D > 0, because it amouts to predictig V from its ow ifiite past: sice N is white ad has zero-mea, Û, which is the optimal predictor for U, is also the optimal predictor for V = U N. This whiteess might seem at first a cotradictio, because Zq is the sum of a o-white process Z ad a white process N. However, {Z } ad {N } are ot idepedet processes, because Z depeds o past values of N through the past of V. Hece the chael Zq = Z N is ot quite a additive-oise chael; rather, it is sequetially-additive: the oise is idepedet of past ad preset chael iputs, but is ot idepedet of future iputs. These observatios imply that the chael Zq = Z N satisfies: IZ ; Z N Z N,..., Z N = IZ ; Z N, while i geeral Ī{Z }; {Z N } > IZ ; Z N. The chael whe the Shao lower boud holds. As log as D is smaller tha the lowest poit of the source spectrum i.e., De jπf = θ = D i, the quadratic- Gaussia RDF coicides with the Shao Lower Boud 5. I this case, the followig properties hold for the predictive test chael: The power spectra of U ad Y are the same ad are equal to Se jπf D. The power spectrum of V is equal to the power spectrum of the source Se jπf. Sice the white process Z N is the optimal predictio error of the process V from its ow ifiite past, its variace is P e V = P e X of 4. As a cosequece we have IZ ; Z N = hn0, P e X hn0, D = / logp e X/D X X K K idepedet pre-post filters Y ad predictio loops Fig. 3. Y K Parallel sources. joit quatizatio K-dim VQ which is ideed the Shao lower boud 5. V. VECTOR-QUANTIZED DPCM AND D PCM As metioed, the structure of the loop i the chael of Figure is of a DPCM quatizer, with the scalar quatizer replaced by the additive oise. However, if we wish to implemet the additive oise by a quatizer realizig the full sigle letter mutual iformatio IZ ; Z N, we must use vector quatizatio VQ. It is ot possible to do that alog the time domai, due to the sequetial ature of the system above. Nevertheless, we ca achieve the VQ gai by addig a spatial dimesio, if we joitly ecode a large umber of parallel sources, as happes, e.g., i video codig. See Figure 3. If we have oly oe source with decayig memory, we ca still achieve the rate distortio fuctio at the cost of large delay, by usig iterleavig. If we do ot use ay of the above, but restrict ourselves to scalar quatizatio, we have a pre/post filtered DPCM scheme. It follows from Theorem that i priciple, a pre/post filtered DPCM scheme is optimal up to the loss of the VQ gai at all distortio levels, ad ot oly at high resolutio. It is iterestig to metio that I the quatizatio literature, the ope loop predictio approach ivestigated i [8] is referred to as D PCM [7]. VI. A DUAL RELATIONSHIP WITH DECISION-FEEDBACK EQUALIZATION Cosider the real-valued discrete-time time-ivariat liear Gaussia chael arisig at the output of a sampled matched filter, Y = h k X k Z. k= Here h is the equivalet discrete-time impulse respose resultig from the cascade of the spectral shapig filter, the modulatio pulse, the cotiuous-time chael as well as the matched filter. It follows that He jπf is o-egative ad the autocorrelatio fuctio of Z is R ZZ k = E{Z k Z } = N 0 h k. Let X be a iid Gaussia radom process with power σ x. The the mutual iformatio ormalized per symbol betwee
5 Z Y X Z ˆX X Hz Fig. 4. Az FFE ˆD MMSE-DFE i predictive form. the iput ad output of the chael is I{X }, {Y } = / / log GZ DFE σ xhe jπf N 0 / X D ˆX df. 3 Capacity is achieved by usig a spectral shapig filter satisfyig the water-fillig power allocatio. As reflected i the expressio 3, capacity may be achieved by parallel AWGN codig over arrow frequecy bads as doe i practice i DMT/OFDM systems. A well kow alterative capacityachievig scheme which is based o predictio rather tha the Fourier trasform is offered by the caoical MMSE- DFE equalizatio structure used i sigle-carrier trasmissio. These observatios parallel those made i Sectio I with respect to the RDF. It is well kow that the capacity of liear Gaussia chaels ca be achieved usig MMSE-DFE coupled with AWGN codig. This has bee show usig differet approaches. Oe such approach which is particularly illumiatig i our cotext is based o liear predictio of the error sequece. We ow recout this result which was developed ad refied by umerous authors, see [6], [], [4] ad refereces therei. Our expositio closely follows that of Forey [4]. As a first step, let ˆX be the optimal MMSE estimator of X from the chael output sequece {Y }. Sice {X } ad {Y } are joitly Gaussia ad statioary this estimator is liear ad time ivariat. Deote the estimatio error, which is composed of residual ISI ad Gaussia oise, by D. The X = ˆX D 4 where {D } is idepedet of { ˆX } due to the orthogoality priciple ad Gaussiaity. Assumig correct decodig of past symbols, the decoder kows the past samples D, D,... ad may form a optimal predictor, ˆD, of the estimatio error D. The predictio error E = D ˆD has variace P e D, the etropy power of D. This predictio may the be added to X ˆ to form X. It follows that X = ˆX D = X ˆD D = X E, 5 Here we must actually break with assumptio that X is a Gaussia process. ad We implicitly assume that X are symbols of a capacityachievig AWGN code. The slicer should be viewed as a memoic aid where i practice a optimal decoder should be used. Furthermore, the use of a iterleaver ad log delay is ecessary. See [4] where { X } ad {E } are statistically idepedet. It follows that the residual estimatio error satisfies E{X X } = E{D ˆD } = P e D, 6 The chael 5 is ofte referred to as the backward chael. Furthermore, sice X ad E are i.i.d Gaussia, it is a AWGN chael. We have therefore derived the followig. Theorem : The mutual iformatio of the chael is equal to the scalar mutual iformatio I X ; X E of the memoryless chael 5. Proof: Let X = {X, X,...} ad D = {D, D,...}. Usig the chai rule of mutual iformatio we have I{X }, {Y } = h{x } hx {Y }, X = h{x } hx ˆX {Y }, X = h{x } hd {Y }, X = h{x } hd {Y }, D, X = h{x } hd ˆD {Y }, D = h{x } he {Y }, D = h{x } he 7 = I X ; X E, where 7 follows from successive applicatio of the orthogoality priciple [4]. It follows that / / log σ xhe jπf N 0 / df = log σ x P e D. 8 As a corollary, from 3, Theorem ad 8, we obtai the followig well kow result from Wieer theory, / σx N0 P e D = exp log df. / σxhe jπf N0 REFERENCES [] T. Berger. Rate Distortio Theory: A Mathematical Basis for Data Compressio. Pretice-Hall, Eglewood Cliffs, NJ, 97. [] J.M. Cioffi, G.P. Dudevoir, M.V. Eyuboglu, ad G.D. J. Forey. MMSE Decisio-Feedback Equalizers ad Codig - Part I: Equalizatio Results. IEEE Tras. Commuicatios, COM-43:58 594, Oct [3] T. M. Cover ad J. A. Thomas. Elemets of Iformatio Theory. Wiley, New York, 99. [4] G. D. Forey, Jr. Shao meets Wieer II: O MMSE estimatio i successive decodig schemes. I 4st Aual Allerto Coferece o Commuicatio, Cotrol, ad Computig, Allerto House, Moticello, Illiois, Oct [5] G.D.Gibso, T.Berger, T.Lookabaugh, D.Lidbergh, ad R.L.Baker. Digital Compressio for Multimedia: Priciples ad Stadards. Morga Kaufma Pub., Sa Fasisco, 998. [6] T. Guess ad M. K. Varaasi. A iformatio-theoretic framework for derivig caoical decisio-feedback receivers i gaussia chaels. IEEE Tras. Iformatio Theory, IT-5:73 87, Ja [7] N. S. Jayat ad P. Noll. Digital Codig of Waveforms. Pretice-Hall, Eglewood Cliffs, NJ, 984. [8] K. T. Kim ad T. Berger. Sedig a Lossy Versio of the Iovatios Process is Suboptimal i QG Rate-Distortio. I Proceedigs of ISIT- 005, Adelaide, Australia, pages 09 3, 005. [9] R. Zamir ad M. Feder. Iformatio rates of pre/post filtered dithered quatizers. IEEE Tras. Iformatio Theory, pages , September 996.
Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive
More informationAchieving the Gaussian Rate-Distortion Function by Prediction
Achieving the Gaussian Rate-Distortion Function by Prediction Ram Zamir, Yuval Kochman and Uri Erez Dept. Electrical Engineering-Systems, Tel Aviv University Abstract The water-filling solution for the
More informationFig. 2. Block Diagram of a DCS
Iformatio source Optioal Essetial From other sources Spread code ge. Format A/D Source ecode Ecrypt Auth. Chael ecode Pulse modu. Multiplex Badpass modu. Spread spectrum modu. X M m i Digital iput Digital
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationEECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1
EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum
More informationLecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound
Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee
More informationProblem Set 4 Due Oct, 12
EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios
More informationVector Quantization: a Limiting Case of EM
. Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z
More informationPerformance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM
Performace Aalysis ad Optimal Filter esig for Sigma-elta Modulatio via uality with PCM Or Ordetlich Tel Aviv Uiversity ordet@eg.tau.ac.il Uri Erez Tel Aviv Uiversity uri@eg.tau.ac.il Abstract Samplig above
More informationInformation Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame
Iformatio Theory Tutorial Commuicatio over Chaels with memory Chi Zhag Departmet of Electrical Egieerig Uiversity of Notre Dame Abstract A geeral capacity formula C = sup I(; Y ), which is correct for
More informationLecture 11: Channel Coding Theorem: Converse Part
EE376A/STATS376A Iformatio Theory Lecture - 02/3/208 Lecture : Chael Codig Theorem: Coverse Part Lecturer: Tsachy Weissma Scribe: Erdem Bıyık I this lecture, we will cotiue our discussio o chael codig
More informationAsymptotic Coupling and Its Applications in Information Theory
Asymptotic Couplig ad Its Applicatios i Iformatio Theory Vicet Y. F. Ta Joit Work with Lei Yu Departmet of Electrical ad Computer Egieerig, Departmet of Mathematics, Natioal Uiversity of Sigapore IMS-APRM
More informationFrequency Response of FIR Filters
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state
More informationOn Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback.
O Evaluatig the Rate-Distortio Fuctio of Sources with Feed-Forward ad the Capacity of Chaels with Feedback. Ramji Vekataramaa ad S. Sadeep Pradha Departmet of EECS, Uiversity of Michiga, A Arbor, MI 4805
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More informationInformation Theory and Coding
Sol. Iformatio Theory ad Codig. The capacity of a bad-limited additive white Gaussia (AWGN) chael is give by C = Wlog 2 ( + σ 2 W ) bits per secod(bps), where W is the chael badwidth, is the average power
More informationTHE KALMAN FILTER RAUL ROJAS
THE KALMAN FILTER RAUL ROJAS Abstract. This paper provides a getle itroductio to the Kalma filter, a umerical method that ca be used for sesor fusio or for calculatio of trajectories. First, we cosider
More informationInformation-based Feature Selection
Iformatio-based Feature Selectio Farza Faria, Abbas Kazeroui, Afshi Babveyh Email: {faria,abbask,afshib}@staford.edu 1 Itroductio Feature selectio is a topic of great iterest i applicatios dealig with
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More informationEconomics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator
Ecoomics 24B Relatio to Method of Momets ad Maximum Likelihood OLSE as a Maximum Likelihood Estimator Uder Assumptio 5 we have speci ed the distributio of the error, so we ca estimate the model parameters
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationLecture 7: October 18, 2017
Iformatio ad Codig Theory Autum 207 Lecturer: Madhur Tulsiai Lecture 7: October 8, 207 Biary hypothesis testig I this lecture, we apply the tools developed i the past few lectures to uderstad the problem
More informationUnbiased Estimation. February 7-12, 2008
Ubiased Estimatio February 7-2, 2008 We begi with a sample X = (X,..., X ) of radom variables chose accordig to oe of a family of probabilities P θ where θ is elemet from the parameter space Θ. For radom
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5
CS434a/54a: Patter Recogitio Prof. Olga Veksler Lecture 5 Today Itroductio to parameter estimatio Two methods for parameter estimatio Maimum Likelihood Estimatio Bayesia Estimatio Itroducto Bayesia Decisio
More informationStochastic Simulation
Stochastic Simulatio 1 Itroductio Readig Assigmet: Read Chapter 1 of text. We shall itroduce may of the key issues to be discussed i this course via a couple of model problems. Model Problem 1 (Jackso
More informationADVANCED DIGITAL SIGNAL PROCESSING
ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE
More information1.0 Probability of Error for non-coherent BFSK
Probability of Error, Digital Sigalig o a Fadig Chael Ad Equalizatio Schemes for ISI Wireless Commuicatios echologies Sprig 5 Lectures & R Departmet of Electrical Egieerig, Rutgers Uiversity, Piscataway,
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationOPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE
Joural of ELECTRICAL EGIEERIG, VOL. 56, O. 7-8, 2005, 200 204 OPTIMAL PIECEWISE UIFORM VECTOR QUATIZATIO OF THE MEMORYLESS LAPLACIA SOURCE Zora H. Perić Veljo Lj. Staović Alesadra Z. Jovaović Srdja M.
More informationThe Maximum-Likelihood Decoding Performance of Error-Correcting Codes
The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,
More informationInequalities for Entropies of Sets of Subsets of Random Variables
Iequalities for Etropies of Sets of Subsets of Radom Variables Chao Tia AT&T Labs-Research Florham Par, NJ 0792, USA. tia@research.att.com Abstract Ha s iequality o the etropy rates of subsets of radom
More informationSignal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.
Sigal Processig Lecture 02: Discrete Time Sigals ad Systems Ahmet Taha Koru, Ph. D. Yildiz Techical Uiversity 2017-2018 Fall ATK (YTU) Sigal Processig 2017-2018 Fall 1 / 51 Discrete Time Sigals Discrete
More informationLecture 15: Strong, Conditional, & Joint Typicality
EE376A/STATS376A Iformatio Theory Lecture 15-02/27/2018 Lecture 15: Strog, Coditioal, & Joit Typicality Lecturer: Tsachy Weissma Scribe: Nimit Sohoi, William McCloskey, Halwest Mohammad I this lecture,
More informationLecture 7: Channel coding theorem for discrete-time continuous memoryless channel
Lecture 7: Chael codig theorem for discrete-time cotiuous memoryless chael Lectured by Dr. Saif K. Mohammed Scribed by Mirsad Čirkić Iformatio Theory for Wireless Commuicatio ITWC Sprig 202 Let us first
More informationFilter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and
Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy
More informationEntropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP
Etropy ad Ergodic Theory Lecture 5: Joit typicality ad coditioal AEP 1 Notatio: from RVs back to distributios Let (Ω, F, P) be a probability space, ad let X ad Y be A- ad B-valued discrete RVs, respectively.
More informationA Hybrid Random-Structured Coding Scheme for the Gaussian Two-Terminal Source Coding Problem Under a Covariance Matrix Distortion Constraint
A Hybrid Radom-Structured Codig Scheme for the Gaussia Two-Termial Source Codig Problem Uder a Covariace Matrix Distortio Costrait Yag Yag ad Zixiag Xiog Dept of Electrical ad Computer Egieerig Texas A&M
More informationOn forward improvement iteration for stopping problems
O forward improvemet iteratio for stoppig problems Mathematical Istitute, Uiversity of Kiel, Ludewig-Mey-Str. 4, D-24098 Kiel, Germay irle@math.ui-iel.de Albrecht Irle Abstract. We cosider the optimal
More informationMultiterminal source coding with complementary delivery
Iteratioal Symposium o Iformatio Theory ad its Applicatios, ISITA2006 Seoul, Korea, October 29 November 1, 2006 Multitermial source codig with complemetary delivery Akisato Kimura ad Tomohiko Uyematsu
More informationPerformance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM
Performace Aalysis ad Optimal Filter Desig for Sigma-Delta Modulatio via Duality with Or Ordetlich ad Uri Erez, Member, IEEE Abstract Samplig above the Nyquist rate is at the heart of sigma-delta modulatio,
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationHybrid Coding for Gaussian Broadcast Channels with Gaussian Sources
Hybrid Codig for Gaussia Broadcast Chaels with Gaussia Sources Rajiv Soudararaja Departmet of Electrical & Computer Egieerig Uiversity of Texas at Austi Austi, TX 7871, USA Email: rajivs@mailutexasedu
More informationPrecise Rates in Complete Moment Convergence for Negatively Associated Sequences
Commuicatios of the Korea Statistical Society 29, Vol. 16, No. 5, 841 849 Precise Rates i Complete Momet Covergece for Negatively Associated Sequeces Dae-Hee Ryu 1,a a Departmet of Computer Sciece, ChugWoo
More informationPractical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement
Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),
More informationProbability, Expectation Value and Uncertainty
Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such
More informationVector Permutation Code Design Algorithm. Danilo SILVA and Weiler A. FINAMORE
Iteratioal Symposium o Iformatio Theory ad its Applicatios, ISITA2004 Parma, Italy, October 10 13, 2004 Vector Permutatio Code Desig Algorithm Dailo SILVA ad Weiler A. FINAMORE Cetro de Estudos em Telecomuicações
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationDistribution of Random Samples & Limit theorems
STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to
More informationUC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 17 Lecturer: David Wagner April 3, Notes 17 for CS 170
UC Berkeley CS 170: Efficiet Algorithms ad Itractable Problems Hadout 17 Lecturer: David Wager April 3, 2003 Notes 17 for CS 170 1 The Lempel-Ziv algorithm There is a sese i which the Huffma codig was
More informationLecture 6: Source coding, Typicality, and Noisy channels and capacity
15-859: Iformatio Theory ad Applicatios i TCS CMU: Sprig 2013 Lecture 6: Source codig, Typicality, ad Noisy chaels ad capacity Jauary 31, 2013 Lecturer: Mahdi Cheraghchi Scribe: Togbo Huag 1 Recap Uiversal
More informationRandom Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices
Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More information1.010 Uncertainty in Engineering Fall 2008
MIT OpeCourseWare http://ocw.mit.edu.00 Ucertaity i Egieerig Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu.terms. .00 - Brief Notes # 9 Poit ad Iterval
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationECON 3150/4150, Spring term Lecture 3
Itroductio Fidig the best fit by regressio Residuals ad R-sq Regressio ad causality Summary ad ext step ECON 3150/4150, Sprig term 2014. Lecture 3 Ragar Nymoe Uiversity of Oslo 21 Jauary 2014 1 / 30 Itroductio
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More information6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition
6. Kalma filter implemetatio for liear algebraic equatios. Karhue-Loeve decompositio 6.1. Solvable liear algebraic systems. Probabilistic iterpretatio. Let A be a quadratic matrix (ot obligatory osigular.
More informationStatistical Noise Models and Diagnostics
L. Yaroslavsky: Advaced Image Processig Lab: A Tutorial, EUSIPCO2 LECTURE 2 Statistical oise Models ad Diagostics 2. Statistical models of radom iterfereces: (i) Additive sigal idepedet oise model: r =
More informationChapter 6 Sampling Distributions
Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to
More informationSection 14. Simple linear regression.
Sectio 14 Simple liear regressio. Let us look at the cigarette dataset from [1] (available to dowload from joural s website) ad []. The cigarette dataset cotais measuremets of tar, icotie, weight ad carbo
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationStatistical Inference Based on Extremum Estimators
T. Rotheberg Fall, 2007 Statistical Iferece Based o Extremum Estimators Itroductio Suppose 0, the true value of a p-dimesioal parameter, is kow to lie i some subset S R p : Ofte we choose to estimate 0
More informationEE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course
Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL
More informationECE 564/645 - Digital Communication Systems (Spring 2014) Final Exam Friday, May 2nd, 8:00-10:00am, Marston 220
ECE 564/645 - Digital Commuicatio Systems (Sprig 014) Fial Exam Friday, May d, 8:00-10:00am, Marsto 0 Overview The exam cosists of four (or five) problems for 100 (or 10) poits. The poits for each part
More informationChapter 10 Advanced Topics in Random Processes
ery Stark ad Joh W. Woods, Probability, Statistics, ad Radom Variables for Egieers, 4th ed., Pearso Educatio Ic.,. ISBN 978--3-33-6 Chapter Advaced opics i Radom Processes Sectios. Mea-Square (m.s.) Calculus
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationA statistical method to determine sample size to estimate characteristic value of soil parameters
A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig
More informationIntroduction to Signals and Systems, Part V: Lecture Summary
EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive
More informationOlli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5
Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4
More informationAlgebra of Least Squares
October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationTMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods
TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationLecture 3. Properties of Summary Statistics: Sampling Distribution
Lecture 3 Properties of Summary Statistics: Samplig Distributio Mai Theme How ca we use math to justify that our umerical summaries from the sample are good summaries of the populatio? Lecture Summary
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationEstimation for Complete Data
Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of
More informationL = n i, i=1. dp p n 1
Exchageable sequeces ad probabilities for probabilities 1996; modified 98 5 21 to add material o mutual iformatio; modified 98 7 21 to add Heath-Sudderth proof of de Fietti represetatio; modified 99 11
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 22
CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 6 9/23/203 Browia motio. Itroductio Cotet.. A heuristic costructio of a Browia motio from a radom walk. 2. Defiitio ad basic properties
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationBig Picture. 5. Data, Estimates, and Models: quantifying the accuracy of estimates.
5. Data, Estimates, ad Models: quatifyig the accuracy of estimates. 5. Estimatig a Normal Mea 5.2 The Distributio of the Normal Sample Mea 5.3 Normal data, cofidece iterval for, kow 5.4 Normal data, cofidece
More informationSymmetric Two-User Gaussian Interference Channel with Common Messages
Symmetric Two-User Gaussia Iterferece Chael with Commo Messages Qua Geg CSL ad Dept. of ECE UIUC, IL 680 Email: geg5@illiois.edu Tie Liu Dept. of Electrical ad Computer Egieerig Texas A&M Uiversity, TX
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationIntroduction to Optimization Techniques. How to Solve Equations
Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationLecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise)
Lecture 22: Review for Exam 2 Basic Model Assumptios (without Gaussia Noise) We model oe cotiuous respose variable Y, as a liear fuctio of p umerical predictors, plus oise: Y = β 0 + β X +... β p X p +
More informationProperties and Hypothesis Testing
Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More information2D DSP Basics: 2D Systems
- Digital Image Processig ad Compressio D DSP Basics: D Systems D Systems T[ ] y = T [ ] Liearity Additivity: If T y = T [ ] The + T y = y + y Homogeeity: If The T y = T [ ] a T y = ay = at [ ] Liearity
More informationSlide Set 13 Linear Model with Endogenous Regressors and the GMM estimator
Slide Set 13 Liear Model with Edogeous Regressors ad the GMM estimator Pietro Coretto pcoretto@uisa.it Ecoometrics Master i Ecoomics ad Fiace (MEF) Uiversità degli Studi di Napoli Federico II Versio: Friday
More informationStatistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample.
Statistical Iferece (Chapter 10) Statistical iferece = lear about a populatio based o the iformatio provided by a sample. Populatio: The set of all values of a radom variable X of iterest. Characterized
More informationQuantum Computing Lecture 7. Quantum Factoring
Quatum Computig Lecture 7 Quatum Factorig Maris Ozols Quatum factorig A polyomial time quatum algorithm for factorig umbers was published by Peter Shor i 1994. Polyomial time meas that the umber of gates
More informationOrthogonal Gaussian Filters for Signal Processing
Orthogoal Gaussia Filters for Sigal Processig Mark Mackezie ad Kiet Tieu Mechaical Egieerig Uiversity of Wollogog.S.W. Australia Abstract A Gaussia filter usig the Hermite orthoormal series of fuctios
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.34 Discrete Time Sigal Processig Fall 24 BACKGROUND EXAM September 3, 24. Full Name: Note: This exam is closed
More information1 Introduction to reducing variance in Monte Carlo simulations
Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by
More informationFACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures
FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 STATISTICS II. Mea ad stadard error of sample data. Biomial distributio. Normal distributio 4. Samplig 5. Cofidece itervals
More informationREGRESSION WITH QUADRATIC LOSS
REGRESSION WITH QUADRATIC LOSS MAXIM RAGINSKY Regressio with quadratic loss is aother basic problem studied i statistical learig theory. We have a radom couple Z = X, Y ), where, as before, X is a R d
More information