Hybrid Coding for Gaussian Broadcast Channels with Gaussian Sources
|
|
- Terence Burke
- 5 years ago
- Views:
Transcription
1 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 Sriram Vishwaath Departmet of Electrical & Computer Egieerig Uiversity of Texas at Austi Austi, TX 7871, USA arxiv: v1 [csit] 15 Ju 009 Abstract This paper cosiders a degraded Gaussia broadcast chael over which Gaussia sources are to be commuicated Whe the sources are idepedet, this paper shows that hybrid codig achieves the optimal distortio regio, the same as that of separate source ad chael codig It also shows that ucoded trasmissio is ot optimal for this settig For correlated sources, the paper shows that a hybrid codig strategy has a better distortio regio tha separate source-chael codig below a certai sigal to oise ratio threshold Thus, hybrid codig is a good choice for Gaussia broadcast chaels with correlated Gaussia sources 1 I INTRODUCTION The trasmissio of sources over a Gaussia broadcast chael [1] is a fudametal problem i iformatio theory ad arguably oe of the better uderstood questios I the case of idepedet sources over this degraded chael, the capacity regio is characterized i [], [3] The achievable strategy for this chael i [] is superpositio codig, but dirty paper codig [4] ca also be used to the same effect I cotrast, the existig body of work o correlated sources over a broadcast chael is somewhat limited [5] As sourcechael separatio does ot hold, it is difficult to costruct codig strategies ad establish their optimality Recetly i [6], ucoded trasmissio of correlated Gaussias over a Gaussia broadcast chael was show to be optimal below a sigal to oise ratio (SNR) threshold I related work, the trasmissio of a commo source over a Gaussia broadcast chael with receiver side iformatio was studied i [7] I this work, we cosider hybrid codig as a strategy for the Gaussia broadcast chael with or without correlated sources By hybrid codig, we mea strategies that superimpose ucoded ad coded trasmissio i commuicatig the sources to the destiatios Our hybrid codig strategy bears close resemblace to the dirty-paper-codig strategy usig lattices, as developed i [8] We show that this hybrid strategy is optimal for the Gaussia broadcast chael with idepedet Gaussia sources Extedig it to the correlated case, we fid that the strategy performs better (i terms of the distortio regio achieved) tha separate source ad chael codig for SNRs below a certai threshold 1 This work is supported by a grat from AT&T Labs Austi, a grat from the Army Research Office ad a grat from the Air Force Office of Sposored Research I the ext sectio, we preset the system model I Sectio III, we preset a outer boud o the distortio regio for this chael We preset the achievable scheme ad the resultig distortio regio for this chael i Sectio IV ad coclude with Sectio V (S 1,S ) ENCODER X II SYSTEM MODEL Fig 1 Z 1 Z System Model Y 1 Y DECODER 1 DECODER The system model is depicted i Fig 1 Cosider a sequece of idepedet ad idetically distributed (iid) pair of correlated Gaussias (S 1 (i),s (i)) i=1 with mea zero ad covariace matrix, [ ] σ ρσ Σ(i) = ρ The goal is to trasmit the pair over a degraded Gaussia broadcast chael to Receivers 1 ad respectively at the smallest possible distortio We assume, with loss of geerality, that ρ > 0 ad that the variaces of S 1 (i) ad S (i) are equal The trasmitter applies a ecodig fuctio o the observed source sequece ad trasmits it over the chael Mathematically, X = f(s 1,S ) where S1 ad S deote -legth vectors The trasmitter is limited by a average secod momet costrait o the chael iput give by 1 E[(X(i)) ] P i=1 Ŝ 1 Ŝ
2 The chael outputs at the two receivers are give by Y 1 (i) = X(i)Z 1 (i) Y (i) = X(i)Z (i) for i = 1,,, where Z 1 (i) ad Z (i) form a iid sequece, idepedet of each other ad are Gaussia distributed with mea zero ad variace ad N Further, we assume that the broadcast chael is physically degraded with N > The receivers obtai estimates of the sources by applyig a fuctio o the received outputs This is represeted mathematically as Ŝk = φ k (Yk ) for k = 1, The goal is to obtai estimates Ŝ 1 ad Ŝ withi the miimum possible mea squared error Therefore, we wish to obtai the smallest possible D 1 ad D where D k = 1 E[(S k (i) Ŝk(i)) ] i=1 for k = 1, The distortio regio D(,ρ,P,,N ) is defied as the set of all pairs (D 1,D ) such that there exist ecodig ad decodig fuctios f, φ 1 ad φ resultig i distortios D 1 ad D at Receivers 1 ad respectively Note that all logarithms are with respect to base throughout the paper ad E deotes the expected value of a radom variable III OUTER BOUND ON DISTORTION REGION We ow preset a outer boud o the coditioal distortio regio for the trasmissio of correlated Gaussia sources over a degraded broadcast chael Let φ 1 be the decodig fuctio give the kowledge of both Y1 ad S at Receiver 1 The coditioal distortio regio D c (,ρ,p,,n ), is defied as the set of all pairs (D 1,D ) such that there exist ecodig fuctio f ad decodig fuctios φ 1 ad φ resultig i distortios D 1 ad D at Receivers 1 ad respectively The regio described by Theorem 1 below is a alterative way of describig the outer boud regio for the same chael preseted i [6] Theorem 1: The coditioal distortio regio for trasmissio of correlated Gaussia sources over a degraded broadcast chael, D c (,ρ,p,,n ), cosists of all pairs (D 1,D ) such that D 1 σ (1 ρ ) ad D where α 1 [0,1] Proof: We first obtai a boud o the distortio D 1 By the data processig iequality (DPI), we have I(S 1;Ŝ 1 S ) I(S 1;Y 1 S ) (1) The distortio i S1 at Receiver 1 give that it kows S ad Y1 is D 1 ad the variace of S1 give S is σ (1 ρ ) Sice S is kow at both the trasmitter ad Receiver 1, I(S 1;Ŝ 1 S ) log σ (1 ρ ) D 1 () by defiitio of the rate distortio fuctio for Gaussia sources [9] Now, I(S 1;Y 1 S ) = h(y 1 S ) h(y 1 S 1,S ) = logπe( ) h(z 1) (3) = logπe( ) logπe = ( logπe 1 α ) 1P (4) The equality i (3) results from the followig argumet Sice logπe h(y1 S ) logπe(p ), there exists a α 1 [0,1] such that h(y 1 S ) = logπe( ) (5) Therefore, from () ad (4), we get D 1 σ (1 ρ ) For source S, usig DPI we observe that The rate distortio fuctio for S Also, I(S ;Y ) = h(y ) h(y S ) I(S ;Ŝ ) I(S ;Y ) (6) implies that σ log I(S D ;Ŝ ) (7) logπe(p N ) h(y S ) (8) logπe(p N ) logπe( N ) (9) = ( log 1 (1 α ) 1)P, (10) α 1 P N sice i (8), a Gaussia radom variable maximizes etropy for a give variace ad (9) is true due to the followig discussio Note that due to the physically degraded ature of the broadcast chael, Y may be writte as Y = Y 1 W where W has variace N Thus usig (5) ad etropy power iequality, we get h(y S ) = h(y 1 W S ) logπe( N ) = logπe( N ) Combiig (6), (7) ad (10), we obtai D
3 Note that the outer boud o the coditioal distortio regio is obtaied as a fuctio ofα 1 We ow state a corollary for the case of idepedet sources Corollary 1: The distortio regio for trasmissio of idepedet Gaussia sources over a degraded broadcast chael, D(,0,P,,N ), cosists of all pairs (D 1,D ) such that ad D where α 1 [0,1] Proof: We oly preset the proof for D 1 sice the result for D is the same as i the theorem above Note that I(S 1;Ŝ 1 S ) = h(s 1 S ) h(s 1 S,Ŝ 1) = h(s 1 ) h(s 1 S,Ŝ 1 ) (11) h(s 1) h(s 1 Ŝ 1) (1) logπeσ (13) D 1 where (11) uses the idepedece of S1 ad S, (1) is true because coditioig reduces etropy ad (13) follows from the rate distortio fuctio for Gaussia sources Now combiig the above with (1) ad (4), we get IV ACHIEVABLE DISTORTION REGION I this sectio, we preset achievable distortio regios for trasmittig idepedet ad correlated Gaussia sources We briefly discuss aspects of the codig scheme that are commo for both the idepedet ad correlated cases The hybrid schemes proposed i the followig subsectios are based o lattices Let Λ be a lattice of dimesio Let the quatized value ofx R,Q(x) = argmi r Λ x r The fudametal Vorooi regio of Λ is defied as V 0 = x R : Q(x) = 0 Also, we deote xmodλ = x Q(x) We choose Λ to be a good lattice for both source ad chael codig [10] ad R require it to have a secod momet costrait (Λ) = x dx V 0 = P dx RV where P will be specified later Note that the 0 trasmitter has a average power costrait P A Idepedet Gaussia Sources We ow compare a hybrid codig strategy with ucoded trasmissio for commuicatig idepedet Gaussia sources A hybrid codig scheme is basically a superpositio of coded ad ucoded trasmissio Let the distortio regio achieved by the hybrid scheme be D h (,0,P,,N ) = (D 1,D ) : D 1 ad D are achieved by the hybrid scheme Theorem : D h (,0,P,,N ) = D(,0,P,,N ) Proof: Cosider a hybrid codig scheme i which the coded portio is give by X 1 = [S 1 βs U ]modλ, where β ad are costats which will be specified later ad U is the dither which is kow apriori to both the trasmitter ad receivers ad is uiformly distributed i V 0 We sed S ucoded after scalig it appropriately to meet the power costrait I the followig, α 1 represets the power allocatio i the outer boud discussio The chael iput is a superpositio of coded ad ucoded trasmissio ad is expressed as X = αx 1 S, where α satisfies α P = α 1 P (14) ad (1 α1 )P = (15) Note thatx1 ads are idepedet of each other o accout of additio of the uiform dither before the modulo operatio We also observe that the scheme is similar to the dirty paper codig strategy i [8] where S resembles the iterferece kow at the trasmitter The output at the receivers is give by Yk = X Zk (16) for k = 1, At Receiver 1, we perform the followig series of operatios: R 1 =[δy 1 U ]modλ (17) =[(δα 1)X 1 S 1 (β δ)s δz 1 ]modλ (18) =[S 1 (δ β)s (δα 1)X 1 δz 1]modΛ (19) =[S1 W 1 ]modλ (0) where W1 = (δβ)s (δα 1)X 1 δz 1 is the effective oise term idepedet of S1 Choosig β = δ ad δ = αp α P, we reduce the variace of the effective oise to P α P Sice Λ is a good chael lattice, we require P to satisfy P α P P, (1) for correct decodig with high probability as [11][1] This leads to R 1 = [S 1 W 1 ]modλ = S 1 W 1 Allowig P to satisfy (1) with equality ad usig (14), we obtai P = α1 P ad α = α 1 P P Thus W 1 has variace P α P = σ Ŝ1 = R1, achieves a distortio i S 1 of D 1 = σ 4 = The estimator
4 O the other had, Receiver observes Y = αx 1 S Z = S W, wherew = αx1 Z is treated as the effective oise which is idepedet of S We ow costruct the liear estimator Ŝ = σ P N Y Usig (15), this estimator results i a distortio D = Thus the superpositio scheme described above achieves the optimal distortios for sources S 1 ad S We ow show that ucoded trasmissio is sub-optimal for idepedet sources through the followig theorem Let the distortio regio achieved by ucoded trasmissio be D u (,0,P,,N ) Theorem 3: D u is equal to the set of all distortio pairs (D 1,D ) such that 1 where α 1 [0,1] Further, ad D (1 α 1)P D u (,0,P,,N ) D(,0,P,,N ) Proof: The ucoded trasmissio strategy is to sed a liear combiatio of S1 ad S The power allocated for sedig S1 ad S are ad (1 α 1 )P respectively Therefore we trasmit, X α1 P = S 1 (1 α1 )P S Receiver 1 obtais a miimum mea squared error (MMSE) estimate of S1 give Y1 as Ŝ 1 = P Y1 This leads to a distortio i S 1, D 1 = 1 (1 α 1)P The estimate ofs is give byŝ = (1 α1)p PN Y resultig i D = We observe that while ucoded trasmissio scheme achieves the optimal distortio i S, the distortio i S 1 is higher tha the optimal distortio Thus D u (,0,P,,N ) D(,0,P,,N ) B Correlated Gaussia Sources Next, we exted our hybrid codig scheme to the problem of correlated sources, with the goal of achievig a better distortio regio tha source chael separatio We cosider two source chael separatio schemes i this sectio, Scheme A ad Scheme B Scheme A treats the messages obtaied by compressig S 1 ad S as idepedet ad commuicates them reliably over the broadcast chael Scheme B explores the idea of usig Wyer Ziv codig for commuicatig S 1 Let the distortio regio achieved by the hybrid scheme be D h (,ρ,p,,n ) ad the distortio regio achieved by Scheme A ad Scheme B be D A (,ρ,p,,n ) ad D B (,ρ,p,,n ) Theorem 4: If α 1 < 1 ad P < 1 α1, the α 1 D A (,ρ,p,,n ) D h (,ρ,p,,n ) For ay P > 0 ad 0 α 1 1, D B (,ρ,p,,n ) D h (,ρ,p,,n ) Proof: We begi by otig that S1 may be represeted as S1 = ρs V with V idepedet of S ad Gaussia distributed with mea zero ad variace (1 ρ ) The mai idea of the hybrid codig scheme is to use the scheme proposed i the previous subsectio to sedv ads, which are idepedet Thus, the trasmitter forms the coded portio of the chael iput similar to the idepedet case usig the lattice Λ as X 1 = [V βs U ]modλ As before, S is set ucoded ad superposed o the coded portio after a appropriate scalig to satisfy the power costrait Thus the chael iput is give by X = αx 1 S, where α ad satisfy (14) ad (15) respectively The chael output at Receiver 1 is expressed as Y 1 = αx 1 S Z 1 () The receiver ca ow perform the same sequece of operatios as i Equatios (17)-(0) to obtai R 11 = [V W 11]modΛ where W11 = (δ β)s (δα 1)X 1 δz 1 represets the effective oise idepedet of V By choosig P = (1 ρ ) α1pn1 α, α = 1P P, δ = αp ad β = δ, we get R11 = V W11, (3) where the variace of W 11 is give by σ (1 ρ) Observe that we ca rewrite () as a oisy observatio of S i the form R1 = S W 1 (4)
5 where W1 = (αx 1 Z 1 ) variace (α1pn1)σ (1 α 1)P is idepedet of S ad has Now, usig the oisy observatios of V ad S i (3) ad (4) respectively, we costruct a liear estimator of S1 give R 11 ad R 1 Before fidig the estimator, we observe that W11 ad W1 are ucorrelated for the choice of costats α ad δ stated above For each time istat i, E[W 11i W 1i ] = E[((δα 1)X 1i δz 1i ) (αx 1i Z 1i ) ] = 1 ) ((δα 1)αP δ = 0 sice δ = αp α P Therefore R 11 ad R 1 are ucorrelated as well ad the liear estimator of S 1 is give by Ŝ1 = 1 R 1 N1 11 ρ N1 (1 α 1)P R 1 The distortio resultig i S 1 is calculated to be D 1 = σ (1 ρ ) ρ Receiver obtais the estimate of S i the same fashio as the idepedet case by treatig the coded portio of the received sigal as oise to obtai a distortio Thus D h = D = (D 1,D ) : σ (1 ρ ) D ρ We ow compare the distortio regio achieved by the hybrid codig scheme with two possible source chael separatio schemes, Scheme A ad Scheme B I Scheme A, S1 ad S are compressed to obtai messages that ca be reliably trasmitted over the broadcast chael The distortio regio achieved by this scheme is give by the set D A = (D 1,D ) :,D The distortio i S 1 icurred by the hybrid scheme is smaller tha the distortio that is achieved by the above source chael separatio scheme if (1 ρ ) P < 1 α 1 α 1 ρ < Thus D A D h for α 1 < 1 ad P < 1 α1 α 1 I Scheme B, we use the represetatio S1 = ρs V, stated earlier i this sectio The trasmitter compresses V ad S to obtai messages that ca be reliably commuicated to Receivers 1 ad respectively Due to the degraded ature of the broadcast chael, Receiver 1 ca mimic Receiver to obtai a estimate of S Now Receiver 1, combies the estimates of S ad V to costruct a estimate of S1 The distortio regio thus achieved is give by D B = (D 1,D ) : σ (1 ρ ) D ρ, Hece, D B D h for P N > 0 ad 0 α 1 1 V CONCLUSIONS We preset a hybrid codig scheme for source chael commuicatio of correlated Gaussia sources over broadcast chaels, that resembles dirty paper codig We show that the scheme is optimal i terms of achievig the smallest distortio for commuicatig idepedet sources Further, we prove that for a o-trivial set of SNR, the scheme achieves a lower distortio tha source chael separatio As a ext step, we pla to compare ucoded, hybrid coded ad separately coded trasmissio schemes to determie regimes where each outperforms the others REFERENCES [1] T M Cover, Broadcast chaels, IEEE Tras Iform Theory, vol 18, o 1, pp 14, Ja 197 [] P Bergmas, A simple coverse for broadcast chaels with additive white gaussia oise, IEEE Tras Iform Theory, vol 0, o, pp 79 80, March 1974 [3] R G Gallager, Iformatio Theory ad Reliable Commuicatio Wiley, 1968 [4] K Marto, A codig theorem for the discrete memoryless broadcast chael, IEEE Tras Iform Theory, vol 5, o 3, pp , May 1979 [5] T S Ha ad M H M Costa, Broadcast chaels with arbitrarily correlated sources, IEEE Tras Iform Theory, vol 33, o 5, pp , Sep 1987 [6] S Bross, A Lapidoth, ad S Tiguely, Broadcastig Correlated Gaussias, i Proc IEEE It Symp Ifo Theory, Toroto, Caada 008 [7] D Guduz, J Nayak, ad E Tucel, Wyer-ziv codig over broadcast chaels usig hybrid digital/aalog trasmissio, i Proc IEEE It Symp Ifo Theory, Toroto, Caada 008 [8] U Erez, S S (Shitz), ad R Zamir, Capacity ad lattice strategies for cacellig kow iterferece, i Proceedigs of It Symp Iform Theory ad its Applicatios, Nov 000, pp [9] T M Cover ad J A Thomas, Elemets of Iformatio Theory Wiley, 1991 [10] U Erez, S Litsy, ad R Zamir, Lattices which are good for (almost) everythig, IEEE Tras If Theory, vol 51, pp , Oct 005 [11] U Erez ad R Zamir, Achievig 1 log(1 SNR) o the AWGN chael with lattice ecodig ad decodig, IEEE Tras Iform Theory, vol 50, pp , Oct 004 [1] Y Kochma ad R Zamir, Joit Wyer-Ziv/Dirty-Paper Codig by Modulo-Lattice Modulatio, IEEE Tras If Theory, 008, submitted for publicatio Preprit available at zamir/publicatioshtml
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 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 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 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 informationarxiv: v1 [cs.it] 13 Jul 2012
O the Sum Capacity of the Discrete Memoryless Iterferece Chael with Oe-Sided Weak Iterferece ad Mixed Iterferece Fagfag Zhu ad Biao Che Syracuse Uiversity Departmet of EECS Syracuse, NY 3244 Email: fazhu{biche}@syr.edu
More informationA Partial Decode-Forward Scheme For A Network with N relays
A Partial Decode-Forward Scheme For A etwork with relays Yao Tag ECE Departmet, McGill Uiversity Motreal, QC, Caada Email: yaotag2@mailmcgillca Mai Vu ECE Departmet, Tufts Uiversity Medford, MA, USA Email:
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 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 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 informationCooperative 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 informationOn Multipath Fading Channels at High SNR
O Multipath Fadig Chaels at High SNR Tobias Koch Amos Lapidoth ETH Zurich, Switzerlad Email: toch, lapidoth}@isi.ee.ethz.ch ISIT 008, Toroto, Caada, July 6 -, 008 Abstract This paper studies the capacity
More informationConsider 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 informationOn the Capacity of Symmetric Gaussian Interference Channels with Feedback
O the Capacity of Symmetric Gaussia Iterferece Chaels with Feedback La V Truog Iformatio Techology Specializatio Departmet ITS FPT Uiversity, Haoi, Vietam E-mail: latv@fpteduv Hirosuke Yamamoto Dept of
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 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 informationNon-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit
No-Asymptotic Achievable Rates for Gaussia Eergy-Harvestig Chaels: Best-Effort ad Save-ad-Trasmit Silas L. Fog, Jig Yag, ad Ayli Yeer arxiv:805.089v [cs.it] 30 May 08 Abstract A additive white Gaussia
More informationNon-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit
08 IEEE Iteratioal Symposium o Iformatio Theory ISIT No-Asymptotic Achievable Rates for Gaussia Eergy-Harvestig Chaels: Best-Effort ad Save-ad-Trasmit Silas L Fog Departmet of Electrical ad Computer Egieerig
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 informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 64, NO. 3, MARCH
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 64, NO. 3, MARCH 08 48 Lattice Codes Achieve the Capacity of Commo Message Gaussia Broadcast Chaels With Coded Side Iformatio Lakshmi Nataraja, Yi Hog, Seior
More informationEntropies & Information Theory
Etropies & Iformatio Theory LECTURE I Nilajaa Datta Uiversity of Cambridge,U.K. For more details: see lecture otes (Lecture 1- Lecture 5) o http://www.qi.damtp.cam.ac.uk/ode/223 Quatum Iformatio Theory
More informationTHE interference channel problem describes a setup where multiple pairs of transmitters and receivers share a communication
Trade-off betwee Commuicatio ad Cooperatio i the Iterferece Chael Farhad Shirai EECS Departmet Uiversity of Michiga A Arbor,USA Email: fshirai@umich.edu S. Sadeep Pradha EECS Departmet Uiversity of Michiga
More informationDistortion Bounds for Source Broadcast. Problem
Distortio Bouds for Source Broadcast 1 Problem Lei Yu, Houqiag Li, Seior Member, IEEE, ad Weipig Li, Fellow, IEEE Abstract This paper ivestigates the joit source-chael codig problem of sedig a memoryless
More informationSUCCESSIVE INTERFERENCE CANCELLATION DECODING FOR THE K -USER CYCLIC INTERFERENCE CHANNEL
Joural of Theoretical ad Applied Iformatio Techology 31 st December 212 Vol 46 No2 25-212 JATIT & LLS All rights reserved ISSN: 1992-8645 wwwatitorg E-ISSN: 1817-3195 SCCESSIVE INTERFERENCE CANCELLATION
More informationMultiterminal Source Coding with an Entropy-Based Distortion Measure
20 IEEE Iteratioal Symposium o Iformatio Theory Proceedigs Multitermial Source Codig with a Etropy-Based Distortio Measure Thomas A. Courtade ad Richard D. Wesel Departmet of Electrical Egieerig Uiversity
More informationA Non-Asymptotic Achievable Rate for the AWGN Energy-Harvesting Channel using Save-and-Transmit
016 IEEE Iteratioal Symposium o Iformatio Theory A No-Asymptotic Achievable Rate for the AWGN Eergy-Harvestig Chael usig Save-ad-Trasmit Silas L. Fog, Vicet Y. F. Ta, ad Jig Yag Departmet of Electrical
More informationLossy Coding of Correlated Sources Over a Multiple Access Channel: Necessary Conditions and Separation Results
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 64, NO. 9, SETEMBER 08 608 Lossy Codig of Correlated Sources Over a Multiple Access Chael: Necessary Coditios ad Separatio Results Başak Güler, Member, IEEE,
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 informationLecture 14: Graph Entropy
15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number
More informationThe Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints
IIT 6, eattle, UA, July 9-4, 6 The Gaussia Multiple Access Wire-Tap Chael with Collective ecrecy Costraits Eder Tei tei@psu.edu Ayli Yeer yeer@ee.psu.edu Wireless Commuicatios ad Networig Laboratory Electrical
More informationThe Gaussian Channel with Noisy Feedback
The Gaussia Chael with Noisy Feedback Youg-Ha Kim Departmet of ECE Uiversity of Califoria, Sa Diego La Jolla, CA 9093, USA yhk@ucsd.edu Amos Lapidoth Sigal ad Iformatio Processig Lab. ETH Zurich 809 Zurich,
More informationOverview of Gaussian MIMO (Vector) BC
Overview of Gaussia MIMO (Vector) BC Gwamo Ku Adaptive Sigal Processig ad Iformatio Theory Research Group Nov. 30, 2012 Outlie / Capacity Regio of Gaussia MIMO BC System Structure Kow Capacity Regios -
More informationOn the Performance of Hybrid Digital-Analog Coding for Broadcasting Correlated Gaussian Sources
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL 59, NO, DECEMBER 0 3335 O the Performace of Hybrid Digital-Aalog Codig for Broadcastig Correlated Gaussia Sources Hamid Behroozi, Member, IEEE, Fady Alajaji, Seior
More informationAre Slepian-Wolf Rates Necessary for Distributed Parameter Estimation?
Are Slepia-Wolf Rates Necessary for Distributed Parameter Estimatio? Mostafa El Gamal ad Lifeg Lai Departmet of Electrical ad Computer Egieerig Worcester Polytechic Istitute {melgamal, llai}@wpi.edu arxiv:1508.02765v2
More informationChannel coding, linear block codes, Hamming and cyclic codes Lecture - 8
Digital Commuicatio Chael codig, liear block codes, Hammig ad cyclic codes Lecture - 8 Ir. Muhamad Asial, MSc., PhD Ceter for Iformatio ad Commuicatio Egieerig Research (CICER) Electrical Egieerig Departmet
More informationThe Capacity Region of the Degraded Finite-State Broadcast Channel
The Capacity Regio of the Degraded Fiite-State Broadcast Chael Ro Dabora ad Adrea Goldsmith Dept. of Electrical Egieerig, Staford Uiversity, Staford, CA Abstract We cosider the discrete, time-varyig broadcast
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 informationIET Commun., 2009, Vol. 3, Iss. 1, pp doi: /iet-com: & The Institution of Engineering and Technology 2009
Published i IET Commuicatios Received o 4th Jue 28 Revised o 3th July 28 doi: 1.149/iet-com:28373 ISSN 1751-8628 Symmetric relayig based o partial decodig ad the capacity of a class of relay etworks L.
More information1 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 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 informationCapacity-distortion trade-off in channels with state
Forty-Eighth Aual Allerto Coferece Allerto House, UIUC, Illiois, USA September 29 - October, 200 Capacity-distortio trade-off i chaels with state Chirajib Choudhuri, Youg-Ha Kim ad Urbashi Mitra Abstract
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 informationInseparability of the Multiple Access Wiretap Channel
Iseparability of the Multiple Access Wiretap Chael Jiawei Xie Seur Ulukus Departmet of Electrical ad Computer Egieerig Uiversity of Marylad, College Park, MD 074 xiejw@umd.edu ulukus@umd.edu Abstract We
More informationRelaying via Hybrid Coding
011 IEEE Iteratioal Symposium o Iformatio Theory Proceedigs Relayig via Hybrid Codig Youg-Ha Kim Departmet of ECE UCSD La Jolla CA 9093 USA yhk@ucsd.edu Sug Hoo Lim Departmet of EE KAIST Daejeo Korea sughlim@kaist.ac.kr
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 informationUniversal source coding for complementary delivery
SITA2006 i Hakodate 2005.2. p. Uiversal source codig for complemetary delivery Akisato Kimura, 2, Tomohiko Uyematsu 2, Shigeaki Kuzuoka 2 Media Iformatio Laboratory, NTT Commuicatio Sciece Laboratories,
More informationChannel Capacity and State Estimation for State-Dependent Gaussian Channels
486 IEEE TRASACTIOS O IFORMATIO THEORY, VOL. 5, O. 4, APRIL 005 [5] S.. Batalama, M. J. Medley, ad I.. Psaromiligkos, Adaptive robust spread-spectrumreceivers, IEEE Tras. Commu., vol. 47, o. 6, pp. 905
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 Likelihood Encoder with Applications to Lossy Compression and Secrecy
The Likelihood Ecoder with Applicatios to Lossy Compressio ad Secrecy Eva C. Sog Paul Cuff H. Vicet Poor Dept. of Electrical Eg., Priceto Uiversity, NJ 8544 {csog, cuff, poor}@priceto.edu Abstract A likelihood
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 informationRun-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 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 informationCommunicating under Temperature and Energy Harvesting Constraints
Commuicatig uder Temperature ad Eergy Harvestig Costraits Omur Ozel, Seur Ulukus 2, ad Pulkit Grover Departmet of Electrical ad Computer Egieerig, Caregie Mello Uiversity, Pittsburgh, PA 2 Departmet of
More informationIncreasing 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 informationA New Achievability Scheme for the Relay Channel
A New Achievability Scheme for the Relay Chael Wei Kag Seur Ulukus Departmet of Electrical ad Computer Egieerig Uiversity of Marylad, College Park, MD 20742 wkag@umd.edu ulukus@umd.edu October 4, 2007
More informationbounds and in which F (n k) n q s.t. HG T = 0.
6. Liear codes. Chael capacity Recall that last time we showed the followig achievability bouds: Shao s: P e P [i(x; Y ) log M + τ] + exp{ τ} M DT: P e E [ exp { (i( X; Y ) log ) + }] Feistei s: P e,max
More informationCapacity of Compound State-Dependent Channels with States Known at the Transmitter
Capacity of Compoud State-Depedet Chaels with States Kow at the Trasmitter Pablo Piataida Departmet of Telecommuicatios SUPELEC Plateau de Moulo, 992 Gif-sur-Yvette, Frace Email: pablo.piataida@supelec.fr
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 informationPosterior Matching Scheme for Gaussian Multiple Access Channel with Feedback
1 Posterior Matchig Scheme for Gaussia Multiple Access Chael with Feedback La V. Truog, Member, IEEE, Iformatio Techology Specializatio Departmet ITS, FPT Uiversity, Haoi, Vietam E-mail: latv@fpt.edu.v
More informationRegression with an Evaporating Logarithmic Trend
Regressio with a Evaporatig Logarithmic Tred Peter C. B. Phillips Cowles Foudatio, Yale Uiversity, Uiversity of Aucklad & Uiversity of York ad Yixiao Su Departmet of Ecoomics Yale Uiversity October 5,
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationCapacity Theorems for the Finite-State Broadcast Channel with Feedback
Capacity Theorems for the Fiite-State Broadcast Chael with Feedback Ro abora ad Adrea Goldsmith ept of Electrical Egieerig, Staford Uiversity Abstract We cosider the discrete, time-varyig broadcast chael
More informationSignals and Systems. Problem Set: From Continuous-Time to Discrete-Time
Sigals ad Systems Problem Set: From Cotiuous-Time to Discrete-Time Updated: October 5, 2017 Problem Set Problem 1 - Liearity ad Time-Ivariace Cosider the followig systems ad determie whether liearity ad
More informationShannon s noiseless coding theorem
18.310 lecture otes May 4, 2015 Shao s oiseless codig theorem Lecturer: Michel Goemas I these otes we discuss Shao s oiseless codig theorem, which is oe of the foudig results of the field of iformatio
More informationAdvanced 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 informationOn Successive Refinement for the Wyner-Ziv Problem with Partially Cooperating Decoders
ISIT 2008, Toroto, Caada, July 6-11, 2008 O Successive Refiemet for the Wyer-Ziv Problem with Partially Cooperatig Decoders Shraga I. Bross ad Tsachy Weissma, School of Egieerig, Bar-Ila Uiversity, Ramat-Ga
More informationOn Routing-Optimal Network for Multiple Unicasts
O Routig-Optimal Network for Multiple Uicasts Chu Meg, Athia Markopoulou Abstract I this paper, we cosider etworks with multiple uicast sessios. Geerally, o-liear etwork codig is eeded to achieve the whole
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 informationECE 308 Discrete-Time Signals and Systems
ECE 38-5 ECE 38 Discrete-Time Sigals ad Systems Z. Aliyazicioglu Electrical ad Computer Egieerig Departmet Cal Poly Pomoa ECE 38-5 1 Additio, Multiplicatio, ad Scalig of Sequeces Amplitude Scalig: (A Costat
More informationTopic 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 informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationOn Rate Requirements for Achieving the Centralized Performance in Distributed Estimation
O Rate Requiremets for Achievig the Cetralized Performace i Distributed Estimatio Mostafa El Gamal ad Lifeg Lai Abstract We cosider a distributed parameter estimatio problem, i which multiple termials
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 informationNew Results in Coding and Communication Theory. Communication Systems Laboratory. Rick Wesel
New Results i Codig ad Commuicatio Theory http://www.ee.ucla.edu/~csl/ Rick Wesel At the Aerospace Corporatio August, 008 Miguel Griot Bike ie Yua-Mao Chag Tom Courtade Jiadog Wag Recet Results A more
More informationFinite Block-Length Gains in Distributed Source Coding
Decoder Fiite Block-Legth Gais i Distributed Source Codig Farhad Shirai EECS Departmet Uiversity of Michiga A Arbor,USA Email: fshirai@umichedu S Sadeep Pradha EECS Departmet Uiversity of Michiga A Arbor,USA
More informationAchieving 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 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 informationTopic 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 informationMath 113 Exam 4 Practice
Math Exam 4 Practice Exam 4 will cover.-.. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for
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 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 informationA COMBINED STOCHASTIC/DECISION-AIDED SNR ESTIMATOR. Witthaya Panyaworayan and Rolf Matzner
A COMBINED STOCHASTIC/DECISION-AIDED SNR ESTIMATOR Witthaya Payaworaya ad Rolf Matzer Istitute for Commuicatios Egieerig Federal Armed Forces Uiversity Muich, Germay tpaya@daisy.et.uibw-mueche.de, rolf@ieee.org
More informationLecture 12: September 27
36-705: Itermediate Statistics Fall 207 Lecturer: Siva Balakrisha Lecture 2: September 27 Today we will discuss sufficiecy i more detail ad the begi to discuss some geeral strategies for costructig estimators.
More informationLecture 7: MIMO Architectures Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Theoretical Foudatios of Wireless Commuicatios 1 Thursday, May 19, 2016 12:30-15:30, Coferece Room SIP 1 Textbook: D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatio 1 / 1 Overview Lecture 6:
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 informationProbability of error for LDPC OC with one co-channel Interferer over i.i.d Rayleigh Fading
IOSR Joural of Electroics ad Commuicatio Egieerig (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 4, Ver. III (Jul - Aug. 24), PP 59-63 Probability of error for LDPC OC with oe co-chael
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 information4.1 Data processing inequality
ECE598: Iformatio-theoretic methods i high-dimesioal statistics Sprig 206 Lecture 4: Total variatio/iequalities betwee f-divergeces Lecturer: Yihog Wu Scribe: Matthew Tsao, Feb 8, 206 [Ed. Mar 22] Recall
More informationOn the Dispersions of the Gel fand-pinsker Channel and Dirty Paper Coding
O the Dispersios of the Gel fad-isker Chael ad Dirty aper Codig Joatha Scarlett Abstract This paper studies secod-order codig rates for memoryless chaels with a state sequece kow o-causally at the ecoder.
More informationMASSACHUSETTS 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 informationCovert Communication with Noncausal Channel-State Information at the Transmitter
Covert Commuicatio with Nocausal Chael-State Iformatio at the Trasmitter Si-Hyeo Lee, Ligog Wag, Ashish Khisti, ad Gregory W. Worell POSTECH, Pohag, South Korea (e-mail:sihyeo@postech.ac.kr ETIS Uiversité
More informationResilient Source Coding
Resiliet Source Codig Maël Le Treust Laboratoire des Sigaux et Systèmes CNRS - Supélec - Uiv. Paris Sud 11 91191, Gif-sur-Yvette, Frace Email: mael.letreust@lss.supelec.fr Samso Lasaulce Laboratoire des
More informationLecture 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 informationECE 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 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 informationSession 5. (1) Principal component analysis and Karhunen-Loève transformation
200 Autum semester Patter Iformatio Processig Topic 2 Image compressio by orthogoal trasformatio Sessio 5 () Pricipal compoet aalysis ad Karhue-Loève trasformatio Topic 2 of this course explais the image
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems
Departmet of Electrical Egieerig Uiversity of Arasas ELEG 4603/5173L Digital Sigal Processig Ch. 1 Discrete-Time Sigals ad Systems Dr. Jigxia Wu wuj@uar.edu OUTLINE 2 Classificatios of discrete-time sigals
More information