Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM

Size: px
Start display at page:

Download "Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM"

Transcription

1 Performace Aalysis ad Optimal Filter esig for Sigma-elta Modulatio via uality with PCM Or Ordetlich Tel Aviv Uiversity Uri Erez Tel Aviv Uiversity Abstract Samplig above the Nyquist-rate is at the heart of sigma-delta modulatio, where the icrease i samplig rate is traslated to a reductio i the overall miimum mea-squarederror recostructio distortio. This is attaied by usig a feedback filter at the ecoder, i cojuctio with a low-pass filter at the decoder. The goal of this work is to characterize the optimal trade-off betwee the per-sample quatizatio rate ad the resultig mea-squared-error distortio, uder various restrictios o the feedback filter. To this ed, we establish a duality relatio betwee the performace of sigma-delta modulatio, ad that of differetial pulse-code modulatio whe applied to discrete-time bad-limited iputs. As the optimal trade-off for the latter scheme is fully uderstood, the full characterizatio for sigma-delta modulatio, as well as the optimal feedback filters, immediately follow. I. INTROUCTION Aalog-to-digital A/ ad digital-to-aalog /A covertors are a itegral part of almost all electric devices i use. Ofte, the same A/ or /A compoet is applied to a variety of sigals with distict characterizatios. For this reaso, it is desirable to desig the data-coverter to be robust to the characteristics of its iput sigal. Oe assumptio that caot be avoided is kowledge of the badwidth of the sigal to be coverted or at least a upper boud o the badwidth, which dictates the miimal samplig rate, accordig to Nyquist s Theorem. Beyod the badwidth, however, oe would like to assume as little as possible about the iput sigal. A reasoable model for the iput sigal is therefore a stochastic oe, where the iput sigal is assumed to be a statioary Gaussia process with a give variace ad a arbitrary ukow power spectral desity PS withi the assumed badwidth, ad zero otherwise. I this paper, we adopt this compoud model which is rich eough to iclude a wide variety of processes. The robustess requiremet from the A/ or /A covertor traslates to requirig that it iduces a small average distortio simultaeously for all processes withi our compoud model. Sigma-delta modulatio is a widely used techique for A/ as well as /A coversio. The mai advatage offered by this type of modulatio is the ability to trade-off the samplig rate ad the umber of bits per sample required The work of O. Ordetlich was supported by the Adams Fellowship Program of the Israel Academy of Scieces ad Humaities, a fellowship from The Yitzhak ad Chaya Weistei Research Istitute for Sigal Processig at Tel Aviv Uiversity ad the Feder Family Award. The work of U. Erez was supported by by the ISF uder Grat 557/3. for achievig a target mea-squared error MSE distortio. The iput to the sigma-delta modulator is a sigal sampled at times the Nyquist rate >. This over-sampled sigal is the quatized usig a R-bit quatizer, where the task of exploitig the beefits of oversamplig is performed by a feedback filter whose role is to push the quatizatio oise ito high frequecies which are evetually filtered out at the receiver, see Figure. Aother techique for compressig sources with memory is differetial pulse-code modulatio PCM. I PCM, a predictio filter is applied to the quatized sigal. The output of this filter is the subtracted from the source ad the result is fed to the quatizer, see Figure 2. At the decoder, the quatized sigal is simply passed through the iverse of the predictio filter. The coectio betwee PCM ad sigma-delta modulatio, as two istaces of predictive codig, was kow from the outset. I fact, both paradigms emerged from two Bell- abs patets authored by C. C. Cutler i 952 ad 954. Nevertheless, the techiques used for the performace aalysis of PCM ad sigma-delta modulatio are quite differet. Oe explaatio for the divergece i the aalysis methods is that PCM was developed as a predictio scheme for a stochastic sigal, whereas sigma-delta modulatio was origially iveted as a oise-shapig techique aimed at achievig a more desirable oise spectrum, rather tha reducig compressio rate. However, through the years the most promiet use of sigma-delta modulatio has become reducig compressio rate at the expese of icreasig samplig rate, as discussed above. Clearly, oe ca pursue the same goal by applyig the PCM scheme to a over-sampled sigal. The performace of PCM uder the assumptio of highresolutio quatizatio is well uderstood sice as early as the mid 60 s. Uder this assumptio, the predictio filter should be chose as the optimal liear miimum mea-squarederror MMSE predictio filter of the source process from its past [], ad the effect of the filtered quatizatio oise ca be eglected i the predictio process. While i most cases where PCM is traditioally used, the high resolutio assumptio is well justified, it totally breaks dow for the class of badlimited processes, which icludes the iput sigals to sigmadelta modulators. Fortuately, the high-resolutio assumptio i PCM aalysis has bee overcome i [2], where it was show that

2 for ay distortio level ad ay statioary Gaussia source, the PCM architecture iduces a rate-distortio optimal test chael, provided that the predictio filter is chose as the optimal filter for predictig the source from its quatized past, ad i additio water-fillig pre- ad post-filters are applied. The aalysis of [2], which takes ito accout the effect of the quatizatio oise, ca therefore be used to obtai the optimal feedback filter ad its correspodig performace for a PCM system applied to a over-sampled statioary Gaussia source. Our mai result, derived i Sectio II, is that for oversampled bad-limited statioary Gaussia processes, the test chael iduced by the sigma-delta modulator Figure achieves precisely the same rate-distortio fuctio as that of the PCM test chael Figure 2 with a Gaussia statioary iput with the same variace, whose spectrum is flat withi the same frequecy bad. More specifically, for such processes, for ay choice of σpcm 2 ad predictio filter CZ i the test chael of Figure 2, the same choice of CZ together with the choice σ 2 = σ 2 PCM / / C 2 d i Figure, yields the same compressio rate ad the same distortio. While this result is simple to derive, it has a very pleasig cosequece: the problem of optimizig the filter CZ i sigma-delta modulatio, uder ay set of costraits, ca be cast as a equivalet problem of optimizig the PCM predictio filter uder the same set of costraits. Usig results from liear time-ivariat predictio theory, we ca the easily fid the optimal filter for sigma-delta modulatio uder costraits for which a explicit solutio was lackig i the literature, or was cumbersome to derive. Fially, i Sectio III we show that the rate-distortio tradeoff derived for sigma-delta modulatio i Sectio II, which is based o aalyzig the test-chael from Figure, remais valid for a sigma-delta modulator with a scalar uiform quatizer of fiite support. Applyig such a scalar quatizer icurs a costat additive rate pealty, whose purpose is to esure that a overload evet, which jeopardizes the stability of the system, occurs with low probability. Our treatmet tackles the issue of stability, which is treated rather heuristically i much of the sigma-delta literature, i a systematic ad rigourous maer, ad the trade-off betwee the rate pealty ad the overload probability is aalytically determied. II. MAIN RESUT For a discrete sigal {c }, the Z-trasform CZ ad the discrete-time Fourier trasform C are defied i the usual maer. For a discrete statioary process {X } with zeromea ad autocorrelatio fuctio R X [k] EX +k X we defie the power-spectral desity PS as the Fourier trasform of the autocorrelatio fuctio S X R X [k]e jk. k= The PS of a cotiuous statioary process is defied i a aalogous maer. Assume X t is a cotiuous statioary bad-limited Gaussia process with zero mea ad variace σx 2, whose PS is zero for all frequecies f > f max, but is otherwise ukow. The Nyquist samplig rate for this process is 2f max samples per secod. Sice our focus here is o quatizatio of over-sampled sigals, we assume that X t is sampled uiformly with rate of 2f max samples per secod for some >. The obtaied sampled process {X } is therefore a discrete statioary Gaussia process with zero mea ad variace σx 2 whose PS is zero for all / [/,/], but is otherwise ukow. Our goal is to characterize the rate-distortio trade-off obtaied by a sigma-delta modulator, modeled as the test chael from Figure, whose iput is {X }. To that ed, we establish a equivalece betwee the performace obtaied by this test chael for ay statioary bad-limited Gaussia process with variace σx 2 ad the performace obtaied by the test chael from Figure 2, which models a PCM compressio system, for a statioary flat bad-limited Gaussia process with variace σx 2. The performace of the latter is ow well uderstood [2], ad, as we shall show, ca be traslated to a simple characterizatio of the sigma-delta modulatio performace. The test chaels i Figure ad Figure 2 model a sigmadelta modulator ad a PCM system, respectively, where i both systems the filter CZ is assumed strictly causal ad the quatizer was replaced by a AWGN chael. We aalyze the distortios attaied by the test chaels ad the scalar mutual iformatio IU ;U + N betwee the iput ad output of the additive white Gaussia oise AWGN chaels embedded withi the two test chaels. The test chaels i Figure ad Figure 2 do ot immediately iduce a output distributio from which a radom quatizatio codebook with rate IU ;U + N ad MSE distortio ca be draw. The reaso for this is the sequetial ature of the compressio, which seems to coflict with the eed of usig highdimesioal quatizers, as required for attaiig a quatizatio error distributed asn with compressio rate IU ;U +N. Fortuately, this difficulty, which is also preset i decisio feedback equalizatio for itersymbol iterferece chaels, ca be overcome with the help of a iterleaver [2] [4] see discussio i [5, Sectio II.B]. Thus, the scalar mutual iformatio IU ;U +N ca ideed be iterpreted as the compressio rate eeded to achieve the distortio attaied by the test chaels i Figure ad Figure 2. Moreover, i Sectio III we show that IU ;U +N is closely related to the required quatizatio rate i a sigma-delta modulator that applies a uiform scalar quatizer of fiite support. The proofs of the followig two propositios are straightforward ad ca be foud i [5]. Propositio : For a Gaussia statioary process {X } with variaceσx 2 whose PS is zero for all / [/,/],

3 X U N N 0,σ 2 U +N CZ N Fig.. The test chael correspodig to the sigma-delta modulatio architecture, with the sigma-delta quatizer replaced by a AWGN chael. X PCM N PCM U PCM N 0,σPCM 2 U PCM +N PCM + CZ V PCM H H Fig. 2. The test chael correspodig to the PCM architecture, with the PCM quatizer replaced by a AWGN chael. ˆX ˆX PCM the test chael from Figure achieves MSE distortio = σ 2 / / C 2 d, ad its scalar mutual iformatio satisfies IU ;U +N = 2 log + C 2 d + σ2 X σ 2. Propositio 2: For a Gaussia statioary process {X PCM } with variace σx 2 ad PS { SX PCM σx 2 for / = 0 for / < <, 2 the test chael from Figure 2 achieves MSE distortio = σ2 PCM ad its scalar mutual iformatio satisfies IU PCM ;U PCM +N PCM = 2 log + C 2 d + σ2 X / σpcm 2 C 2 d. / Remark : I Propositios ad 2 we derived the scalar mutual iformatio betwee the iput ad output of the AWGN test chaels embedded i Figures ad 2, respectively. As will become clear i Sectio III, the scalar mutual iformatio is closely related to the required quatizatio rate whe a scalar memoryless quatizer is used withi the sigmadelta or PCM modulator. I [2], [4], the directed iformatio was show to be related to the required quatizatio rate whe the quatizer is followed by a etropy coder. Here, we do ot cosider applyig etropy codig to the quatizer s output as we require that the desiged modulator be robust to the statistics of the iput process, whereas etropy codig heavily relies o the statistics of the process. Furthermore, etropy codig is udesirable i A/ coverters. All logarithms i this paper are take with base 2. Our mai result ow follows immediately from Propositios ad 2. Theorem : et {X } be a Gaussia statioary process with variaceσx 2 whose PS is zero for all / [/,/], let {X PCM } be a Gaussia statioary process with PS as i 2, ad let CZ be a strictly causal filter. The test chael from Figure with σ 2 = / / C 2 d, ad the test chael from Figure 2 with σpcm 2 = both achieve MSE distortio ad their scalar mutual iformatio satisfy IU ;U +N = 2 log + + σ2 X = IU PCM / ;U PCM C 2 d / +N PCM C 2 d. This theorem idicates that for ay statioary bad-limited Gaussia process with variace σx 2, the sigma-delta test chael from Figure achieves precisely the same ratedistortio trade-off as that of the PCM test chael from Figure 2 with a statioary flat bad-limited Gaussia iput with the same variace, provided that the AWGN variaces are scaled accordig to. Thus, Theorem provides a uified framework for aalyzig the performace of sigmadelta modulatio ad PCM. A great advatage afforded by such a uified framework, is that ay result kow for PCM ca be traslated to a correspodig result for sigma-delta modulatio, ad vice versa. Theorems 2 ad 3 below costitute two importat examples of such results. Theorem 2: et {X } be a Gaussia statioary process with variace σx 2 whose PS is zero for all / [/,/] ad let C be a family of strictly causal filters. efie the virtual process {S } as a Gaussia statioary process with PS as i 2, ad the virtual process {W } as a Gaussia i.i.d. radom process statistically idepedet of {S } with

4 variace, > 0. et C σ 2 = mi CZ C ES c S +W 2 Z = argmies c S +W 2. CZ C If the filter CZ i the sigma-delta test chael from Figure belogs to C ad the MSE distortio attaied by this test chael is, the IU ;U +N 2 log + σ 2, 3 with equality if CZ = C Z. Theorem 2 states that for a target distortio, the sigmadelta filter which miimizes the required compressio rate is the optimal liear time-ivariat MMSE estimator, withi the class of costraits C, for S from the past of the oisy process {S +W }. For example, if C cosists of all strictly causal fiite-impulse respose FIR filters of legth p, the optimal filter CZ is the optimal predictor of S from the samples {S + W,...,S p + W p }, which ca be easily calculated i closed-form. The optimal sigma-delta filter desig problem was studied by several authors, uder various assumptios [6] [9]. However, to the best of our kowledge, the simple expressio from Theorem 2 for the optimal filter as the optimal predictor of S from the past of {S +W } is ovel. Proof of Theorem 2. By Propositio, if the test chael from Figure achieves MSE distortio, we must have σ 2 = / / C 2 d. By Theorem, the correspodig mutual iformatio IU ;U + N is equal to the mutual iformatio IU PCM ;U PCM +N PCM i the PCM test chael from Figure 2 with X PCM = S ad N PCM = W. It is show i [2], [5] that IU PCM ;U PCM +N PCM = PCM 2 log EU 2 + ad that U PCM Therefore, we have = X PCM c X PCM σ 2 PCM +N PCM. IU ;U +N = 2 log + ES c S +W 2. 4 It follows that amog all filters i C, the filter that miimizes 4 is C Z, ad that it attais 3 with equality. It is iterestig to ote [2] that sice {W } is a i.i.d. process with variace ad CZ is strictly causal, the mutual iformatio 4 ca also be writte as IU ;U +N = 2 log ES +W c S +W 2. 5 Thus, the optimal predictor of S from the past of {S +W } is idetical to the optimal predictor of S +W from its past samples. Whe CZ is take as the uique ifiite order optimal oe-step predictio filter of S + W from its past samples, the predictio error variace is the etropy power of the process {S +W } [0], which equals 2 / log +SSd = + σ2 X. 6 Moreover, the ifiite order predictio error E pred S +W c S +W is i this case a white process. This, together with 6 implies that for the optimal ucostraied sigma-delta filter CZ we must have S E pred C 2 +S S / = + σ2 X, [, 7 Combiig 5, 6, ad 7 yields the followig theorem. Theorem 3: et {X } be a Gaussia statioary process with variaceσx 2 whose PS is zero for all / [/,/]. If the test chael from Figure attais MSE distortio, the IU ;U +N 2 log + σ2 X. 8 with equality if ad oly if CZ is a strictly causal filter satisfyig 2 / + σ2 X C 2 [ =, ] / 9 + σ2 X / [, ], ad σ 2 = / / C 2 d = /. + σ2 X Remark 2: The output of the test chael from Figure as well as that from Figure 2 is of the form ˆX = X + E, where E has zero mea ad variace, ad is statistically idepedet of X. This estimate ca be further improved by applyig scalar MMSE estimatio for X from ˆX. I this case the mutual iformatio from 8 is further reduced to 2 log σ 2 X which is the optimal ratedistortio fuctio for a statioary Gaussia source {X } with PS as i 2. It follows that the sigma-delta test chael from Figure with CZ ad σ 2 as specified i Theorem 3 is miimax optimal for the class of all statioary Gaussia sources with variace σx 2 ad PS that equals zero for all / [/,/], i.e., o other system ca achieve MSE distortio with a smaller compressio rate, uiversally for all sources i this class. 2 The existece of a strictly causal filter CZ which satisfies 9 is guarateed by Wieer s spectral-factorizatio theorem.

5 X CZ N U Z + Q R,σ 2 U +N H ˆX Fig. 3. A sigma-delta modulator with a dithered scalar uiform quatizer. III. SIGMA-ETA MOUATION WITH A SCAAR UNIFORM QUANTIZER The sigma-delta modulatio architecture is maily used for A/ ad /A coversio. I such applicatios, vector quatizatio is typically out of the questio ad simple scalar quatizers of fiite support are used istead. For such quatizers, the quatizatio error is composed of two mai factors []: graular errors that correspods to the quatizatio error i the case where the iput sigal falls withi the quatizer s support, ad overload errors that correspod to the case where the iput sigal falls outside the quatizer s support. ue to the feedback loop, iheret to the sigma-delta modulator, errors of the latter kid, whose magitude is ot bouded, may have a disastrous effect as they jeopardize the system s stability. I order to avoid such errors, the support of the quatizer has to be large eough, which traslates to a costrait o the quatizer rate. We shall show that, give that overload errors did ot occur, the quatizatio oise ca be modeled as a additive oise. Thus, the test chael from Figure accurately predicts the total distortio icurred by a sigma-delta A/ or /A i this case. Further, the overload probability ca be cotrolled by takig the quatizatio rate greater thaiu ;U +N. et Q R,σ 2 be a uiform mid-riser quatizer [] with quatizatio step 2σ 2 ad 2 R quatizatio levels, such that the quatizer support is [Γ/2,Γ/2, where Γ 2 R 2σ 2. Our goal is to aalyze the distortio ad overload probability P ol attaied by a sigma-delta modulator that uses a Q R,σ 2 quatizer, as a fuctio of R ad σ 2. Clearly, if we employ the scalar sigma-delta modulator o a log eough iput sequece, a overload evet will evetually occur. As discussed above, the effects of overload errors ca be amplified due to the feedback loop, ad i this case the average MSE may sigificatly grow. We therefore split the iput sequece ito fiite blocks of legthn, ad iitialize the memory of the filter CZ with zeros before the begiig of each ew block. This makes sure that the effect of a overload error i the origial system is restricted to the block where it occurs. The aalysis is made much simpler by itroducig a subtractive dither []. Namely, let {Z } be a sequece of i.i.d. radom variables uiformly distributed over the iterval [ 2σ 2 /2, 2σ 2 /2. I order to quatize a real umber U, we add Z to it before applyig the quatizer, ad subtract Z afterwards, such that the obtaied result is Q R,σ 2 U +Z Z. The followig theorem, whose proof ca be foud i [5], characterizes the trade-off betwee the distortio, quatizatio rate ad overload probability achieved by the scalar sigmadelta modulator depicted i Figure 3 i terms of the scalar mutual iformatio betwee the iput ad output of the AWGN chael from Figure. Theorem 4: et be the MSE distortio attaied by the test chael i Figure with a filter CZ of fiite legth, ad IU ;U +N the scalar mutual iformatio betwee the iput ad output of the AWGN chael i the same figure. For ay 0 < P ol < the scalar sigma-delta modulator from Figure 3 applied o a sequece of N cosecutive source samples with quatizatio rater = IU ;U +N +δp ol attais MSE distortio smaller tha +o N, P ol with probability greater tha P ol, where o N 0 as N icreases, ad δp ol 2 log 2 3 l P ol. 2N REFERENCES [] N. S. Jayat ad P. Noll, igital codig of waveforms: priciples ad applicatios to speech ad video. Pretice-Hall, 984. [2] R. Zamir, Y. Kochma, ad U. Erez, Achievig the Gaussia ratedistortio fuctio by predictio, IEEE Tras. If. Theory, vol. 54, o. 7, pp , July [3] T. Guess ad M. K. Varaasi, A iformatio-theoretic framework for derivig caoical decisio-feedback receivers i Gaussia chaels, IEEE Tras. If. Theory, vol. IT-5, pp , Ja [4] J. Østergaard ad R. Zamir, Multiple-descriptio codig by dithered delta-sigma quatizatio, IEEE Tras. If. Theory, vol. 55, o. 0, pp , Oct [5] O. Ordetlich ad U. Erez, Performace aalysis ad optimal filter desig for sigma-delta modulatio via duality with PCM, 205. [Olie]. Available: [6] H. Spag III ad P. Schultheiss, Reductio of quatizig oise by use of feedback, IRE Tra. Comm. Systems, vol. 0, o. 4, pp , ec 962. [7] P. Noll, O predictive quatizig schemes, The Bell System Techical Joural, vol. 57, o. 5, pp , May 978. [8] M. erpich, E. Silva,. Quevedo, ad G. Goodwi, O optimal perfect recostructio feedback quatizers, IEEE Tras. Sigal Processig, vol. 56, o. 8, pp , Aug [9] M. erpich ad J. Østergaard, Improved upper bouds to the causal quadratic rate-distortio fuctio for Gaussia statioary sources, IEEE Tras. If. Theory, vol. 58, o. 5, pp , May 202. [0] T. Berger, Rate distortio theory: A mathematical basis for data compressio. Pretice-Hall, 97. [] R. Zamir, attice Codig for Sigals ad Networks. Cambridge Uiversity Press, 204.

Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM

Performance 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 information

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

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

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

MASSACHUSETTS 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 information

Achieving the Gaussian Rate-Distortion Function by Prediction

Achieving the Gaussian Rate-Distortion Function by Prediction 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

More information

Fig. 2. Block Diagram of a DCS

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

More information

Problem Set 4 Due Oct, 12

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

More information

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE

OPTIMAL 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 information

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

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

More information

2(25) Mean / average / expected value of a stochastic variable X: Variance of a stochastic variable X: 1(25)

2(25) Mean / average / expected value of a stochastic variable X: Variance of a stochastic variable X: 1(25) Lecture 5: Codig of Aalog Sources Samplig ad Quatizatio Images ad souds are ot origially digital! The are cotiuous sigals i space/time as well as amplitude Typical model of a aalog source: A statioary

More information

Introduction to Signals and Systems, Part V: Lecture Summary

Introduction 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 information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (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 information

Information-based Feature Selection

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

More information

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

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

More information

Vector Quantization: a Limiting Case of EM

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

More information

ECE 564/645 - Digital Communication Systems (Spring 2014) Final Exam Friday, May 2nd, 8:00-10:00am, Marston 220

ECE 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 information

Inequalities for Entropies of Sets of Subsets of Random Variables

Inequalities 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 information

Time-Domain Representations of LTI Systems

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

More information

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

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

More information

Random Signals and Noise Winter Semester 2017 Problem Set 12 Wiener Filter Continuation

Random Signals and Noise Winter Semester 2017 Problem Set 12 Wiener Filter Continuation Radom Sigals ad Noise Witer Semester 7 Problem Set Wieer Filter Cotiuatio Problem (Sprig, Exam A) Give is the sigal W t, which is a Gaussia white oise with expectatio zero ad power spectral desity fuctio

More information

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

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

More information

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame

Information 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 information

Chapter 2 Systems and Signals

Chapter 2 Systems and Signals Chapter 2 Systems ad Sigals 1 Itroductio Discrete-Time Sigals: Sequeces Discrete-Time Systems Properties of Liear Time-Ivariat Systems Liear Costat-Coefficiet Differece Equatios Frequecy-Domai Represetatio

More information

Vector Permutation Code Design Algorithm. Danilo SILVA and Weiler A. FINAMORE

Vector 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 information

Regression with quadratic loss

Regression with quadratic loss Regressio with quadratic loss Maxim Ragisky October 13, 2015 Regressio with quadratic loss is aother basic problem studied i statistical learig theory. We have a radom couple Z = X,Y, where, as before,

More information

The Maximum-Likelihood Decoding Performance of Error-Correcting Codes

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

More information

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals Itroductio to Digital Sigal Processig Chapter : Itroductio Aalog ad Digital Sigals aalog = cotiuous-time cotiuous amplitude digital = discrete-time discrete amplitude cotiuous amplitude discrete amplitude

More information

2D DSP Basics: 2D Systems

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

More information

An Introduction to Randomized Algorithms

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

More information

Approximations and more PMFs and PDFs

Approximations and more PMFs and PDFs Approximatios ad more PMFs ad PDFs Saad Meimeh 1 Approximatio of biomial with Poisso Cosider the biomial distributio ( b(k,,p = p k (1 p k, k λ: k Assume that is large, ad p is small, but p λ at the limit.

More information

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 3 9//203 Large deviatios Theory. Cramér s Theorem Cotet.. Cramér s Theorem. 2. Rate fuctio ad properties. 3. Chage of measure techique.

More information

Orthogonal Gaussian Filters for Signal Processing

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

More information

MASSACHUSETTS 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

MASSACHUSETTS 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 information

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

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

More information

Lecture 7: October 18, 2017

Lecture 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 information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece

More information

Frequency Response of FIR Filters

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

More information

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

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

More information

Estimation for Complete Data

Estimation 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 information

Sensitivity Analysis of Daubechies 4 Wavelet Coefficients for Reduction of Reconstructed Image Error

Sensitivity Analysis of Daubechies 4 Wavelet Coefficients for Reduction of Reconstructed Image Error Proceedigs of the 6th WSEAS Iteratioal Coferece o SIGNAL PROCESSING, Dallas, Texas, USA, March -4, 7 67 Sesitivity Aalysis of Daubechies 4 Wavelet Coefficiets for Reductio of Recostructed Image Error DEVINDER

More information

Advanced Stochastic Processes.

Advanced Stochastic Processes. Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.

More information

REGRESSION WITH QUADRATIC LOSS

REGRESSION 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

Ω ). Then the following inequality takes place:

Ω ). Then the following inequality takes place: Lecture 8 Lemma 5. Let f : R R be a cotiuously differetiable covex fuctio. Choose a costat δ > ad cosider the subset Ωδ = { R f δ } R. Let Ωδ ad assume that f < δ, i.e., is ot o the boudary of f = δ, i.e.,

More information

Warped, Chirp Z-Transform: Radar Signal Processing

Warped, Chirp Z-Transform: Radar Signal Processing arped, Chirp Z-Trasform: Radar Sigal Processig by Garimella Ramamurthy Report o: IIIT/TR// Cetre for Commuicatios Iteratioal Istitute of Iformatio Techology Hyderabad - 5 3, IDIA Jauary ARPED, CHIRP Z

More information

CS284A: Representations and Algorithms in Molecular Biology

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

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

6.867 Machine learning

6.867 Machine learning 6.867 Machie learig Mid-term exam October, ( poits) Your ame ad MIT ID: Problem We are iterested here i a particular -dimesioal liear regressio problem. The dataset correspodig to this problem has examples

More information

Increasing timing capacity using packet coloring

Increasing timing capacity using packet coloring 003 Coferece o Iformatio Scieces ad Systems, The Johs Hopkis Uiversity, March 4, 003 Icreasig timig capacity usig packet colorig Xi Liu ad R Srikat[] Coordiated Sciece Laboratory Uiversity of Illiois e-mail:

More information

Voltage controlled oscillator (VCO)

Voltage controlled oscillator (VCO) Voltage cotrolled oscillator (VO) Oscillatio frequecy jl Z L(V) jl[ L(V)] [L L (V)] L L (V) T VO gai / Logf Log 4 L (V) f f 4 L(V) Logf / L(V) f 4 L (V) f (V) 3 Lf 3 VO gai / (V) j V / V Bi (V) / V Bi

More information

Lecture 11: Channel Coding Theorem: Converse Part

Lecture 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 information

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

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

More information

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

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

More information

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE-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 information

1 Introduction to reducing variance in Monte Carlo simulations

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

More information

The Poisson Process *

The Poisson Process * OpeStax-CNX module: m11255 1 The Poisso Process * Do Johso This work is produced by OpeStax-CNX ad licesed uder the Creative Commos Attributio Licese 1.0 Some sigals have o waveform. Cosider the measuremet

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

DS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10

DS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10 DS 00: Priciples ad Techiques of Data Sciece Date: April 3, 208 Name: Hypothesis Testig Discussio #0. Defie these terms below as they relate to hypothesis testig. a) Data Geeratio Model: Solutio: A set

More information

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

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

More information

DETERMINATION OF MECHANICAL PROPERTIES OF A NON- UNIFORM BEAM USING THE MEASUREMENT OF THE EXCITED LONGITUDINAL ELASTIC VIBRATIONS.

DETERMINATION OF MECHANICAL PROPERTIES OF A NON- UNIFORM BEAM USING THE MEASUREMENT OF THE EXCITED LONGITUDINAL ELASTIC VIBRATIONS. ICSV4 Cairs Australia 9- July 7 DTRMINATION OF MCHANICAL PROPRTIS OF A NON- UNIFORM BAM USING TH MASURMNT OF TH XCITD LONGITUDINAL LASTIC VIBRATIONS Pavel Aokhi ad Vladimir Gordo Departmet of the mathematics

More information

Random Variables, Sampling and Estimation

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

More information

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Practical 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 information

First Year Quantitative Comp Exam Spring, Part I - 203A. f X (x) = 0 otherwise

First Year Quantitative Comp Exam Spring, Part I - 203A. f X (x) = 0 otherwise First Year Quatitative Comp Exam Sprig, 2012 Istructio: There are three parts. Aswer every questio i every part. Questio I-1 Part I - 203A A radom variable X is distributed with the margial desity: >

More information

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

EE / 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 information

1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable

More information

Lecture 10 October Minimaxity and least favorable prior sequences

Lecture 10 October Minimaxity and least favorable prior sequences STATS 300A: Theory of Statistics Fall 205 Lecture 0 October 22 Lecturer: Lester Mackey Scribe: Brya He, Rahul Makhijai Warig: These otes may cotai factual ad/or typographic errors. 0. Miimaxity ad least

More information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

Statistical Analysis on Uncertainty for Autocorrelated Measurements and its Applications to Key Comparisons

Statistical Analysis on Uncertainty for Autocorrelated Measurements and its Applications to Key Comparisons Statistical Aalysis o Ucertaity for Autocorrelated Measuremets ad its Applicatios to Key Comparisos Nie Fa Zhag Natioal Istitute of Stadards ad Techology Gaithersburg, MD 0899, USA Outlies. Itroductio.

More information

Hybrid Coding for Gaussian Broadcast Channels with Gaussian Sources

Hybrid 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 information

ECE 901 Lecture 14: Maximum Likelihood Estimation and Complexity Regularization

ECE 901 Lecture 14: Maximum Likelihood Estimation and Complexity Regularization ECE 90 Lecture 4: Maximum Likelihood Estimatio ad Complexity Regularizatio R Nowak 5/7/009 Review : Maximum Likelihood Estimatio We have iid observatios draw from a ukow distributio Y i iid p θ, i,, where

More information

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4 MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.

More information

Lecture 10: Universal coding and prediction

Lecture 10: Universal coding and prediction 0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved

More information

Substantiation of the Water Filling Theorem Using Lagrange Multipliers

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

More information

Element sampling: Part 2

Element sampling: Part 2 Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig

More information

Information Theory and Coding

Information 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 information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet

More information

Consider the n-dimensional additive white Gaussian noise (AWGN) channel

Consider the n-dimensional additive white Gaussian noise (AWGN) channel 8. Lattice codes (by O. Ordetlich) Cosider the -dimesioal additive white Gaussia oise (AWGN) chael Y = X + Z where Z N (0, I ) is statistically idepedet of the iput X. Our goal is to commuicate reliably

More information

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

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

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

Statistical Noise Models and Diagnostics

Statistical 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 information

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

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

More information

Infinite Sequences and Series

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

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients. Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

THE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS

THE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS R775 Philips Res. Repts 26,414-423, 1971' THE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS by H. W. HANNEMAN Abstract Usig the law of propagatio of errors, approximated

More information

Cooperative Communication Fundamentals & Coding Techniques

Cooperative Communication Fundamentals & Coding Techniques 3 th ICACT Tutorial Cooperative commuicatio fudametals & codig techiques Cooperative Commuicatio Fudametals & Codig Techiques 0..4 Electroics ad Telecommuicatio Research Istitute Kiug Jug 3 th ICACT Tutorial

More information

Math 2784 (or 2794W) University of Connecticut

Math 2784 (or 2794W) University of Connecticut ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really

More information

On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback.

On 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 information

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at

More information

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

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

More information

Basics of Probability Theory (for Theory of Computation courses)

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

More information

Linear time invariant systems

Linear time invariant systems Liear time ivariat systems Alejadro Ribeiro Dept. of Electrical ad Systems Egieerig Uiversity of Pesylvaia aribeiro@seas.upe.edu http://www.seas.upe.edu/users/~aribeiro/ February 25, 2016 Sigal ad Iformatio

More information

7.1 Convergence of sequences of random variables

7.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 information

FIR Filter Design: Part I

FIR Filter Design: Part I EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I. Itroductio FIR Filter Desig: Part I I this set o otes, we cotiue our exploratio o the requecy respose o FIR ilters. First, we cosider some

More information

1 Hash tables. 1.1 Implementation

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

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Monte Carlo Integration

Monte Carlo Integration Mote Carlo Itegratio I these otes we first review basic umerical itegratio methods (usig Riema approximatio ad the trapezoidal rule) ad their limitatios for evaluatig multidimesioal itegrals. Next we itroduce

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

Symmetric Two-User Gaussian Interference Channel with Common Messages

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

More information

1 Inferential Methods for Correlation and Regression Analysis

1 Inferential Methods for Correlation and Regression Analysis 1 Iferetial Methods for Correlatio ad Regressio Aalysis I the chapter o Correlatio ad Regressio Aalysis tools for describig bivariate cotiuous data were itroduced. The sample Pearso Correlatio Coefficiet

More information