5. Data Compression. Review of Last Lecture. Outline of the Lecture. Course Overview. Basics of Information Theory: Markku Juntti
|
|
- Aldous McDaniel
- 5 years ago
- Views:
Transcription
1 : Markku Jutt Overvew The deas of lossless data copresso ad source codg are troduced ad copresso lts are derved. Source The ateral s aly based o Sectos of the course book []. Teleco. Laboratory Course Overvew Basc cocepts ad tools Itroducto Etropy, relatve etropy ad utual forato Asyptotc equpartto property 4 Etropy rates of a stochastc process Source codg or data copresso 5 ata copresso Chael capacty 8 Chael capacty 9 fferetal etropy The Gaussa chael Other applcatos Mau etropy ad spectral estato Rate dstorto theory 4 Network forato theory Teleco. Laboratory Outle of the Lecture Revew of the last lecture Itroducto efto of a source code Kraft equalty Optal codes Bouds o optal codelegth Kraft equalty for uquely decodable codes Suary Revew of Last Lecture Two tools ad cocepts were troduced. The asyptotc equpartto property (AEP) s the aalog of the law of large ubers forato theory. If rado varables for a statoary stochastc process, ts etropy rate s the eteso of the AEP. Teleco. Laboratory Teleco. Laboratory 4
2 Asyptotc Equpartto operty Loosely Speakg AEP: Iplcatos to ata Copresso ( X, X, X ) H probablty. log p X Most of the probablty s cotaed the typcal set A () ε { } ( ) H ( X ) Aε =,, X : p,, so that ( ). (,, ) A ε logp (,, ) H. X. ( A ε ), for large eough.. ( ) H ( X ) Aε. Ay hgh probablty set B δ () wth (B δ () ) has sgfcat tersecto wth A ε (). Teleco. Laboratory 5 Coplete observato set X wth X eleets. Atypcal set. escrpto wth code words of log X + bts. Typcal set A ε () wth (H+ε) eleets. escrpto wth code words of (H+ε) + bts. Teleco. Laboratory 6 H Etropy Rate Etropy rate of a statoary stochastc process: ( X) = H ( X, X, X ) = H ' ( X) = l H ( X X, X, X ). l It ca be show by AEP for ay statoary ergodc stochastc process that ( X, X, X ) H probablty. logp X The AEP equvalet for stochastc processes. Etropy rate for statoary Markov processes: = µ P logp. H X, j j j Itroducto The fudaetal questos behd forato theory: What s the ultate data copresso rate? Aswer: etropy. What s the ultate data trassso rate? Aswer: chael capacty. ata copresso bulds flesh aroud the skeleto provded by etropy ad other tools. Etropy proves out to be the data copresso lt codes achevg etropy are optal several eags the uber of bts eeded rado uber geerato. Teleco. Laboratory 7 Teleco. Laboratory 8
3 ata source Source Codg oble screte valued rado varable X Realzato oble: esg a lossless source code to ze the average codeword legth. Lossless copresso: o forato lost. Itutve soluto proposal: Allocate the shortest code words to the ost probable outcoes of RV X, ad the evtably loger oes to less lkely outcoes of RV X. Well kow eaple: Morse code. efto of a Source Code Source code C: C : X : C ( ), where s the set of fte legth strgs of sybols fro a -ary alphabet. The legth of codeword C() s l(). Wthout loss of geeralty: = {,,,, -}. Eaple: X = {red, blue}, = {, }, C(red) =, C(blue) =. The epected legth of a source code: L = X Eaple above: L(C) =. ( C ) p ( ) l ( ). Teleco. Laboratory 9 Teleco. Laboratory Eaple #: Source Code wth H(X) = L(C) ( X = ) =, C = L( C ) = ( X = ) =, 4 C ( ) = ( X = ) =, 8 C ( ) = ( X = 4 ) =, C ( 4 ) = = = 8 H(X) =.75 H(X) = L(C). Code s uquely decodable. = 7 4 =.75 bts. Eaple..: bts. 8 Eaple #: Source Code wth H(X) L(C) ( X = ) =, C = 5 L C = + = =.67 bts. ( X = ) =, C ( ) = H ( X ) = log ( X = ) =, C ( ) = = log( ) =.58 bts. H(X) < L(C). Code s aga uquely decodable. Teleco. Laboratory Teleco. Laboratory
4 No-sgular code: eftos (). j C C j Uabguous for sgle sybol, for a strea eeds coas. A eaple of o-sgular codes: For bary-valued RV X, C( ) =, C( ) =. A eaple of sgular codes: For bary-valued RV X, C( ) =, C( ) =. Eteso of a code: X ( L ) = C ( ) C ( ) LC ( ). : C Eaple: C( ) =, C( ) =, C( ) =. eftos () A uquely decodable code: eteso s osgular oly oe possble source strg. A eaple of a uquely decodable code: C( ) =, C( ) =. A eaple of a ot uquely decodable code: C( ) =, C( ) =, C( ) =. C( ) = = C( ). A pref-free code = stataeous code: o codeword s a pref of ay other codeword ca be decoded wthout referece to the future desrable, desg goal. Teleco. Laboratory Teleco. Laboratory 4 Classes of Codes All codes No-sgular codes Uquely decodable codes Istataeous codes Eaple #: Classes of Codes X Sgular No-sgular Uq. dec. ef ot uquely dec. ot pref 4 The shortest codewords caot be assged for all sybols a pref code. Teleco. Laboratory 5 Teleco. Laboratory 6
5 Kraft Iequalty For ay stataeous code (pref code) the codeword legths l, l,, l satsfy the Kraft equalty: =. where s the uber of codewords. Coverse: for codeword legths satsfyg above, there ests a stataeous code. Eteded Kraft equalty for ay coutably fte set of codewords: Coverse also holds. = l l. oof of Kraft Iequalty Cosder a -ary tree, each ode wth chldre. The braches of the tree represet the sybols of the codeword. A codeword s represeted by a leaf of the tree. A path through a tree traces out the sybols of the codeword. ef codto o codeword s a acestor of ay other codeword o the tree. Let a l be the legth of the logest codeword. At level a l, soe of the odes are codewords descedats of codewords, or oe of the above. Teleco. Laboratory 7 Teleco. Laboratory 8 Root oof of Kraft Iequalty: A Eaple Code Tree wth =, l a = A codeword at level l has ^(l a l) descedats at level a l. The descedat sets ust be dsjot. = = a a a l l l l : l. Coverse by tree costructo. Optal Codes Kraft equalty code optzato: L = subject to,, pl l, l K l over tegers l, l,, l. Soluto over real l, l,, l : zg codelegths l u average p =, l = log ( p ) code legth L = pl = p log ( p ) = H ( X ). For tegers: L = H L H ( X ), l ( X ) = p. l -adc dstrbuto Teleco. Laboratory 9 Teleco. Laboratory
6 Bouds o Optal Codelegth Optzato l L = p l l subject to l, l, l real valued solutos: l = log p Straghtforward teger approato: Shao code. Sce. log ( ) log ( ) p l = = p =. Teleco. Laboratory log. p Kraft equalty satsfed a stataeous code ests. log ( ) log ( l < ) + p p p H X L < H X + p. Codewords over Multple Sybols Cocateate sybols to for a codeword wth legth l(,,, ) ad epected legth L [ l ( X, X, X )] = p (,, ) l (,, = E By prevous result: H X, X, X E l X, X, X [ ] < H ( X, X, X ) H X, X, X H X, X, X L < For a statoary process: L H ( X). For II RV s: H + ( X ) L < H ( X ) Teleco. Laboratory strbuto Msatch Mu codelegth wth erroeous PMF assupto: true PMF: p() PMF assued by source ecoder: q() Shao code: l ( ) = log. q( ) E H oof: p ( p ) + ( p q ) E [ l ( X )] < H ( p ) + ( p q ) +. [ l ( X )] = log p q ( ) = p = p < [ log( p ) + ] q p [ log( p ) + ] = log( ) + log( p p ) q p q p ( ) ( p q ) + H ( p ) +. Teleco. Laboratory + Kraft Iequalty for Uquely ecodable Codes Istataeous codes uquely decodable codes. Surprsgly: The Kraft equalty ad the coverse stll hold for all uquely decodable codes. Corollary for fte source alphabets holds as well. Bouds hold also for uquely decodable codes. Uquely decodable codes provde o advatage over stataeous codes codeword legth. Istataeous codes are spler to decode cosder those the sequel. Teleco. Laboratory 4
7 Suary Source codes C : X : C ( ), o-sgular uquely decodable stataeous. Kraft equalty for l. stataeous codes = uquely decodable codes. Cocetrate o stataeous codes. Etropy bouds the epected codelegth: H ( X ) L < H( X ) +. Teleco. Laboratory 5
3. Basic Concepts: Consequences and Properties
: 3. Basc Cocepts: Cosequeces ad Propertes Markku Jutt Overvew More advaced cosequeces ad propertes of the basc cocepts troduced the prevous lecture are derved. Source The materal s maly based o Sectos.6.8
More information12. Maximum Entropy and Spectrum Estimation
: Maxu Etropy ad pectru Estato Maru Jutt Overvew Maxu etropy dstrbutos are studed The proble of spectru estato s troduced ad axu etropy based solutos for t are llustrated ource The ateral s aly based o
More informationSome Different Perspectives on Linear Least Squares
Soe Dfferet Perspectves o Lear Least Squares A stadard proble statstcs s to easure a respose or depedet varable, y, at fed values of oe or ore depedet varables. Soetes there ests a deterstc odel y f (,,
More informationBasics of Information Theory: Markku Juntti. Basic concepts and tools 1 Introduction 2 Entropy, relative entropy and mutual information
: Maru Jutt Overvew he propertes of adlmted Gaussa chaels are further studed, parallel Gaussa chaels ad Gaussa chaels wth feedac are solved. Source he materal s maly ased o Sectos.4.6 of the course oo
More informationBasics of Information Theory: Markku Juntti. Basic concepts and tools 1 Introduction 2 Entropy, relative entropy and mutual information
: Markku Jutt Overvew Te basc cocepts o ormato teory lke etropy mutual ormato ad EP are eeralzed or cotuous-valued radom varables by troduc deretal etropy ource Te materal s maly based o Capter 9 o te
More informationA New Method for Solving Fuzzy Linear. Programming by Solving Linear Programming
ppled Matheatcal Sceces Vol 008 o 50 7-80 New Method for Solvg Fuzzy Lear Prograg by Solvg Lear Prograg S H Nasser a Departet of Matheatcs Faculty of Basc Sceces Mazadara Uversty Babolsar Ira b The Research
More informationAlgorithms behind the Correlation Setting Window
Algorths behd the Correlato Settg Wdow Itroducto I ths report detaled forato about the correlato settg pop up wdow s gve. See Fgure. Ths wdow s obtaed b clckg o the rado butto labelled Kow dep the a scree
More informationDiscrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b
CS 70 Dscrete Mathematcs ad Probablty Theory Fall 206 Sesha ad Walrad DIS 0b. Wll I Get My Package? Seaky delvery guy of some compay s out delverg packages to customers. Not oly does he had a radom package
More informationChapter 5 Properties of a Random Sample
Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample
More informationESE 523 Information Theory
ESE 53 Iformato Theory Joseph A. O Sullva Samuel C. Sachs Professor Electrcal ad Systems Egeerg Washgto Uversty Urbauer Hall 0E Gree Hall 34-935-473 jao@wustl.edu 09// J. A. O'Sullva, ESE 53, Lecture -6
More informationOn Probability of Undetected Error for Hamming Codes over Q-ary Symmetric Channel
Joural of Coucato ad Coputer 8 (2 259-263 O Probablty of Udetected Error for Hag Codes over Q-ary Syetrc Chael Mash Gupta, Jaskar Sgh Bhullar 2 ad O Parkash Vocha 3. D.A.V. College, Bathda 5, Ida 2. Malout
More information2/20/2013. Topics. Power Flow Part 1 Text: Power Transmission. Power Transmission. Power Transmission. Power Transmission
/0/0 Topcs Power Flow Part Text: 0-0. Power Trassso Revsted Power Flow Equatos Power Flow Proble Stateet ECEGR 45 Power Systes Power Trassso Power Trassso Recall that for a short trassso le, the power
More informationLecture 4 Sep 9, 2015
CS 388R: Radomzed Algorthms Fall 205 Prof. Erc Prce Lecture 4 Sep 9, 205 Scrbe: Xagru Huag & Chad Voegele Overvew I prevous lectures, we troduced some basc probablty, the Cheroff boud, the coupo collector
More information7.0 Equality Contraints: Lagrange Multipliers
Systes Optzato 7.0 Equalty Cotrats: Lagrage Multplers Cosder the zato of a o-lear fucto subject to equalty costrats: g f() R ( ) 0 ( ) (7.) where the g ( ) are possbly also olear fuctos, ad < otherwse
More informationLecture 02: Bounding tail distributions of a random variable
CSCI-B609: A Theorst s Toolkt, Fall 206 Aug 25 Lecture 02: Boudg tal dstrbutos of a radom varable Lecturer: Yua Zhou Scrbe: Yua Xe & Yua Zhou Let us cosder the ubased co flps aga. I.e. let the outcome
More informationX ε ) = 0, or equivalently, lim
Revew for the prevous lecture Cocepts: order statstcs Theorems: Dstrbutos of order statstcs Examples: How to get the dstrbuto of order statstcs Chapter 5 Propertes of a Radom Sample Secto 55 Covergece
More informationPRACTICAL CONSIDERATIONS IN HUMAN-INDUCED VIBRATION
PRACTICAL CONSIDERATIONS IN HUMAN-INDUCED VIBRATION Bars Erkus, 4 March 007 Itroducto Ths docuet provdes a revew of fudaetal cocepts structural dyacs ad soe applcatos hua-duced vbrato aalyss ad tgato of
More informationLecture 3 Probability review (cont d)
STATS 00: Itroducto to Statstcal Iferece Autum 06 Lecture 3 Probablty revew (cot d) 3. Jot dstrbutos If radom varables X,..., X k are depedet, the ther dstrbuto may be specfed by specfyg the dvdual dstrbuto
More informationConstruction of Composite Indices in Presence of Outliers
Costructo of Coposte dces Presece of Outlers SK Mshra Dept. of Ecoocs North-Easter Hll Uversty Shllog (da). troducto: Oftetes we requre costructg coposte dces by a lear cobato of a uber of dcator varables.
More informationOn generalized fuzzy mean code word lengths. Department of Mathematics, Jaypee University of Engineering and Technology, Guna, Madhya Pradesh, India
merca Joural of ppled Mathematcs 04; (4): 7-34 Publshed ole ugust 30, 04 (http://www.scecepublshggroup.com//aam) do: 0.648/.aam.04004.3 ISSN: 330-0043 (Prt); ISSN: 330-006X (Ole) O geeralzed fuzzy mea
More informationNP!= P. By Liu Ran. Table of Contents. The P versus NP problem is a major unsolved problem in computer
NP!= P By Lu Ra Table of Cotets. Itroduce 2. Prelmary theorem 3. Proof 4. Expla 5. Cocluso. Itroduce The P versus NP problem s a major usolved problem computer scece. Iformally, t asks whether a computer
More informationChain Rules for Entropy
Cha Rules for Etroy The etroy of a collecto of radom varables s the sum of codtoal etroes. Theorem: Let be radom varables havg the mass robablty x x.x. The...... The roof s obtaed by reeatg the alcato
More informationBlock-Based Compact Thermal Modeling of Semiconductor Integrated Circuits
Block-Based Compact hermal Modelg of Semcoductor Itegrated Crcuts Master s hess Defese Caddate: Jg Ba Commttee Members: Dr. Mg-Cheg Cheg Dr. Daqg Hou Dr. Robert Schllg July 27, 2009 Outle Itroducto Backgroud
More informationCoherent Potential Approximation
Coheret Potetal Approxato Noveber 29, 2009 Gree-fucto atrces the TB forals I the tght bdg TB pcture the atrx of a Haltoa H s the for H = { H j}, where H j = δ j ε + γ j. 2 Sgle ad double uderles deote
More informationA New Measure of Probabilistic Entropy. and its Properties
Appled Mathematcal Sceces, Vol. 4, 200, o. 28, 387-394 A New Measure of Probablstc Etropy ad ts Propertes Rajeesh Kumar Departmet of Mathematcs Kurukshetra Uversty Kurukshetra, Ida rajeesh_kuk@redffmal.com
More informationOn the Capacity of Bounded Rank Modulation for Flash Memories
O the Capacty of Bouded Rak Modulato for Flash Meores Zhyg Wag Electrcal Egeerg Departet Calfora Isttute of Techology Pasadea, CA 95, USA Eal: zhyg@paradsecaltechedu Axao (Adrew) Jag Coputer Scece Departet
More informationSome results and conjectures about recurrence relations for certain sequences of binomial sums.
Soe results ad coectures about recurrece relatos for certa sequeces of boal sus Joha Cgler Faultät für Matheat Uverstät We A-9 We Nordbergstraße 5 Joha Cgler@uveacat Abstract I a prevous paper [] I have
More informationIntroduction to local (nonparametric) density estimation. methods
Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest
More informationχ be any function of X and Y then
We have show that whe we ae gve Y g(), the [ ] [ g() ] g() f () Y o all g ()() f d fo dscete case Ths ca be eteded to clude fuctos of ay ube of ado vaables. Fo eaple, suppose ad Y ae.v. wth jot desty fucto,
More informationNP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer
NP!= P By Lu Ra Table of Cotets. Itroduce 2. Strategy 3. Prelmary theorem 4. Proof 5. Expla 6. Cocluso. Itroduce The P vs. NP problem s a major usolved problem computer scece. Iformally, t asks whether
More informationOptimum Probability Distribution for Minimum Redundancy of Source Coding
Aled Mathematcs, 04, 5, 96-05 Publshed Ole Jauary 04 (htt://www.scr.org/oural/am) htt://dx.do.org/0.436/am.04.50 Otmum Probablty strbuto for Mmum Redudacy of Source Codg Om Parkash, Pryaka Kakkar eartmet
More information18.413: Error Correcting Codes Lab March 2, Lecture 8
18.413: Error Correctg Codes Lab March 2, 2004 Lecturer: Dael A. Spelma Lecture 8 8.1 Vector Spaces A set C {0, 1} s a vector space f for x all C ad y C, x + y C, where we take addto to be compoet wse
More informationA tighter lower bound on the circuit size of the hardest Boolean functions
Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the
More informationIntroduction to Probability
Itroducto to Probablty Nader H Bshouty Departmet of Computer Scece Techo 32000 Israel e-mal: bshouty@cstechoacl 1 Combatorcs 11 Smple Rules I Combatorcs The rule of sum says that the umber of ways to choose
More informationParameter, Statistic and Random Samples
Parameter, Statstc ad Radom Samples A parameter s a umber that descrbes the populato. It s a fxed umber, but practce we do ot kow ts value. A statstc s a fucto of the sample data,.e., t s a quatty whose
More informationStandard Deviation for PDG Mass Data
4 Dec 06 Stadard Devato for PDG Mass Data M. J. Gerusa Retred, 47 Clfde Road, Worghall, HP8 9JR, UK. gerusa@aol.co, phoe: +(44) 844 339754 Abstract Ths paper aalyses the data for the asses of eleetary
More informationChapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements
Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall
More informationStrong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity
BULLETIN of the MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Bull. Malays. Math. Sc. Soc. () 7 (004), 5 35 Strog Covergece of Weghted Averaged Appromats of Asymptotcally Noepasve Mappgs Baach Spaces wthout
More information{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:
Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed
More informationDimensionality Reduction and Learning
CMSC 35900 (Sprg 009) Large Scale Learg Lecture: 3 Dmesoalty Reducto ad Learg Istructors: Sham Kakade ad Greg Shakharovch L Supervsed Methods ad Dmesoalty Reducto The theme of these two lectures s that
More informationA Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming
Aerca Joural of Operatos Research, 4, 4, 33-339 Publshed Ole Noveber 4 ScRes http://wwwscrporg/oural/aor http://ddoorg/436/aor4463 A Pealty Fucto Algorth wth Obectve Paraeters ad Costrat Pealty Paraeter
More informationWeb Caching and Content Distribution: A View From the Interior
Web achg ad otet Dstrbuto: A Vew From the Iteror Syam Gadde Jeff hase Duke Uversty Mchael AT&T Labs - Research Overvew Aalytcal tools have evolved to predct behavor of large-scale Web caches. Are results
More informationHard Core Predicates: How to encrypt? Recap
Hard Core Predcates: How to ecrypt? Debdeep Mukhopadhyay IIT Kharagpur Recap A ecrypto scheme s secured f for every probablstc adversary A carryg out some specfed kd of attack ad for every polyomal p(.),
More informationCIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights
CIS 800/002 The Algorthmc Foudatos of Data Prvacy October 13, 2011 Lecturer: Aaro Roth Lecture 9 Scrbe: Aaro Roth Database Update Algorthms: Multplcatve Weghts We ll recall aga) some deftos from last tme:
More informationPr[X (p + t)n] e D KL(p+t p)n.
Cheroff Bouds Wolfgag Mulzer 1 The Geeral Boud Let P 1,..., m ) ad Q q 1,..., q m ) be two dstrbutos o m elemets,.e.,, q 0, for 1,..., m, ad m 1 m 1 q 1. The Kullback-Lebler dvergece or relatve etroy of
More informationCHAPTER VI Statistical Analysis of Experimental Data
Chapter VI Statstcal Aalyss of Expermetal Data CHAPTER VI Statstcal Aalyss of Expermetal Data Measuremets do ot lead to a uque value. Ths s a result of the multtude of errors (maly radom errors) that ca
More informationRandom Variables. ECE 313 Probability with Engineering Applications Lecture 8 Professor Ravi K. Iyer University of Illinois
Radom Varables ECE 313 Probablty wth Egeerg Alcatos Lecture 8 Professor Rav K. Iyer Uversty of Illos Iyer - Lecture 8 ECE 313 Fall 013 Today s Tocs Revew o Radom Varables Cumulatve Dstrbuto Fucto (CDF
More information1 Lyapunov Stability Theory
Lyapuov Stablty heory I ths secto we cosder proofs of stablty of equlbra of autoomous systems. hs s stadard theory for olear systems, ad oe of the most mportat tools the aalyss of olear systems. It may
More informationCS 2750 Machine Learning. Lecture 7. Linear regression. CS 2750 Machine Learning. Linear regression. is a linear combination of input components x
CS 75 Mache Learg Lecture 7 Lear regresso Mlos Hauskrecht los@cs.ptt.edu 59 Seott Square CS 75 Mache Learg Lear regresso Fucto f : X Y s a lear cobato of put copoets f + + + K d d K k - paraeters eghts
More informationVARIABLE-RATE VQ (AKA VQ WITH ENTROPY CODING)
VARIABLE-RATE VQ (AKA VQ WITH ENTROPY CODING) Varable-Rate VQ = Quatzato + Lossless Varable-Legth Bary Codg A rage of optos -- from smple to complex a. Uform scalar quatzato wth varable-legth codg, oe
More informationECE 559: Wireless Communication Project Report Diversity Multiplexing Tradeoff in MIMO Channels with partial CSIT. Hoa Pham
ECE 559: Wreless Commucato Project Report Dversty Multplexg Tradeoff MIMO Chaels wth partal CSIT Hoa Pham. Summary I ths project, I have studed the performace ga of MIMO systems. There are two types of
More information18.657: Mathematics of Machine Learning
8.657: Mathematcs of Mache Learg Lecturer: Phlppe Rgollet Lecture 3 Scrbe: James Hrst Sep. 6, 205.5 Learg wth a fte dctoary Recall from the ed of last lecture our setup: We are workg wth a fte dctoary
More informationIS 709/809: Computational Methods in IS Research. Simple Markovian Queueing Model
IS 79/89: Comutatoal Methods IS Research Smle Marova Queueg Model Nrmalya Roy Deartmet of Iformato Systems Uversty of Marylad Baltmore Couty www.umbc.edu Queueg Theory Software QtsPlus software The software
More informationGlobal Optimization for Solving Linear Non-Quadratic Optimal Control Problems
Joural of Appled Matheatcs ad Physcs 06 4 859-869 http://wwwscrporg/joural/jap ISSN Ole: 37-4379 ISSN Prt: 37-435 Global Optzato for Solvg Lear No-Quadratc Optal Cotrol Probles Jghao Zhu Departet of Appled
More informationCS 2750 Machine Learning Lecture 8. Linear regression. Supervised learning. a set of n examples
CS 75 Mache Learg Lecture 8 Lear regresso Mlos Hauskrecht los@cs.tt.eu 59 Seott Square Suervse learg Data: D { D D.. D} a set of eales D s a ut vector of sze s the esre outut gve b a teacher Obectve: lear
More informationRelations to Other Statistical Methods Statistical Data Analysis with Positive Definite Kernels
Relatos to Other Statstcal Methods Statstcal Data Aalyss wth Postve Defte Kerels Kej Fukuzu Isttute of Statstcal Matheatcs, ROIS Departet of Statstcal Scece, Graduate Uversty for Advaced Studes October
More informationFunctions of Random Variables
Fuctos of Radom Varables Chapter Fve Fuctos of Radom Varables 5. Itroducto A geeral egeerg aalyss model s show Fg. 5.. The model output (respose) cotas the performaces of a system or product, such as weght,
More informationCHAPTER 4 RADICAL EXPRESSIONS
6 CHAPTER RADICAL EXPRESSIONS. The th Root of a Real Number A real umber a s called the th root of a real umber b f Thus, for example: s a square root of sce. s also a square root of sce ( ). s a cube
More informationD. VQ WITH 1ST-ORDER LOSSLESS CODING
VARIABLE-RATE VQ (AKA VQ WITH ENTROPY CODING) Varable-Rate VQ = Quatzato + Lossless Varable-Legth Bary Codg A rage of optos -- from smple to complex A. Uform scalar quatzato wth varable-legth codg, oe
More information3.1 Introduction to Multinomial Logit and Probit
ES3008 Ecooetrcs Lecture 3 robt ad Logt - Multoal 3. Itroducto to Multoal Logt ad robt 3. Estato of β 3. Itroducto to Multoal Logt ad robt The ultoal Logt odel s used whe there are several optos (ad therefore
More informationStatistics Descriptive and Inferential Statistics. Instructor: Daisuke Nagakura
Statstcs Descrptve ad Iferetal Statstcs Istructor: Dasuke Nagakura (agakura@z7.keo.jp) 1 Today s topc Today, I talk about two categores of statstcal aalyses, descrptve statstcs ad feretal statstcs, ad
More informationDebabrata Dey and Atanu Lahiri
RESEARCH ARTICLE QUALITY COMPETITION AND MARKET SEGMENTATION IN THE SECURITY SOFTWARE MARKET Debabrata Dey ad Atau Lahr Mchael G. Foster School of Busess, Uersty of Washgto, Seattle, Seattle, WA 9895 U.S.A.
More informationTHE ROYAL STATISTICAL SOCIETY HIGHER CERTIFICATE
THE ROYAL STATISTICAL SOCIETY 00 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER I STATISTICAL THEORY The Socety provdes these solutos to assst caddates preparg for the examatos future years ad for the
More informationComputational Geometry
Problem efto omputatoal eometry hapter 6 Pot Locato Preprocess a plaar map S. ve a query pot p, report the face of S cotag p. oal: O()-sze data structure that eables O(log ) query tme. pplcato: Whch state
More informationDATA DOMAIN DATA DOMAIN
3//6 Coprght otce: Most ages these sldes are Gozalez ad oods Pretce-Hall Note: ages are [spatall] ostatoar sgals. e eed tools to aalze the locall at dfferet resolutos e ca do ths the data doa or sutable
More informationINTEGRATION THEORY AND FUNCTIONAL ANALYSIS MM-501
INTEGRATION THEORY AND FUNCTIONAL ANALYSIS M.A./M.Sc. Mathematcs (Fal) MM-50 Drectorate of Dstace Educato Maharsh Dayaad Uversty ROHTAK 4 00 Copyrght 004, Maharsh Dayaad Uversty, ROHTAK All Rghts Reserved.
More informationUnique Common Fixed Point of Sequences of Mappings in G-Metric Space M. Akram *, Nosheen
Vol No : Joural of Facult of Egeerg & echolog JFE Pages 9- Uque Coo Fed Pot of Sequeces of Mags -Metrc Sace M. Ara * Noshee * Deartet of Matheatcs C Uverst Lahore Pasta. Eal: ara7@ahoo.co Deartet of Matheatcs
More informationExtend the Borel-Cantelli Lemma to Sequences of. Non-Independent Random Variables
ppled Mathematcal Sceces, Vol 4, 00, o 3, 637-64 xted the Borel-Catell Lemma to Sequeces of No-Idepedet Radom Varables olah Der Departmet of Statstc, Scece ad Research Campus zad Uversty of Tehra-Ira der53@gmalcom
More informationA Conventional Approach for the Solution of the Fifth Order Boundary Value Problems Using Sixth Degree Spline Functions
Appled Matheatcs, 1, 4, 8-88 http://d.do.org/1.4/a.1.448 Publshed Ole Aprl 1 (http://www.scrp.org/joural/a) A Covetoal Approach for the Soluto of the Ffth Order Boudary Value Probles Usg Sth Degree Sple
More informationSolutions to problem set ); (, ) (
Solutos to proble set.. L = ( yp p ); L = ( p p ); y y L, L = yp p, p p = yp p, + p [, p ] y y y = yp + p = L y Here we use for eaple that yp, p = yp p p yp = yp, p = yp : factors that coute ca be treated
More informationPPCP: The Proofs. 1 Notations and Assumptions. Maxim Likhachev Computer and Information Science University of Pennsylvania Philadelphia, PA 19104
PPCP: The Proofs Maxm Lkhachev Computer ad Iformato Scece Uversty of Pesylvaa Phladelpha, PA 19104 maxml@seas.upe.edu Athoy Stetz The Robotcs Isttute Carege Mello Uversty Pttsburgh, PA 15213 axs@rec.r.cmu.edu
More informationC-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory
ROAD MAP... AE301 Aerodyamcs I UNIT C: 2-D Arfols C-1: Aerodyamcs of Arfols 1 C-2: Aerodyamcs of Arfols 2 C-3: Pael Methods C-4: Th Arfol Theory AE301 Aerodyamcs I Ut C-3: Lst of Subects Problem Solutos?
More informationLecture 3. Sampling, sampling distributions, and parameter estimation
Lecture 3 Samplg, samplg dstrbutos, ad parameter estmato Samplg Defto Populato s defed as the collecto of all the possble observatos of terest. The collecto of observatos we take from the populato s called
More informationAn Introduction to. Support Vector Machine
A Itroducto to Support Vector Mache Support Vector Mache (SVM) A classfer derved from statstcal learg theory by Vapk, et al. 99 SVM became famous whe, usg mages as put, t gave accuracy comparable to eural-etwork
More information( x) min. Nonlinear optimization problem without constraints NPP: then. Global minimum of the function f(x)
Objectve fucto f() : he optzato proble cossts of fg a vector of ecso varables belogg to the feasble set of solutos R such that It s eote as: Nolear optzato proble wthout costrats NPP: R f ( ) : R R f f
More informationare positive, and the pair A, B is controllable. The uncertainty in is introduced to model control failures.
Lectue 4 8. MRAC Desg fo Affe--Cotol MIMO Systes I ths secto, we cosde MRAC desg fo a class of ult-ut-ult-outut (MIMO) olea systes, whose lat dyacs ae lealy aaetezed, the ucetates satsfy the so-called
More informationA Study on Generalized Generalized Quasi hyperbolic Kac Moody algebra QHGGH of rank 10
Global Joural of Mathematcal Sceces: Theory ad Practcal. ISSN 974-3 Volume 9, Number 3 (7), pp. 43-4 Iteratoal Research Publcato House http://www.rphouse.com A Study o Geeralzed Geeralzed Quas (9) hyperbolc
More informationMaps on Triangular Matrix Algebras
Maps o ragular Matrx lgebras HMED RMZI SOUROUR Departmet of Mathematcs ad Statstcs Uversty of Vctora Vctora, BC V8W 3P4 CND sourour@mathuvcca bstract We surveys results about somorphsms, Jorda somorphsms,
More informationSpecial Instructions / Useful Data
JAM 6 Set of all real umbers P A..d. B, p Posso Specal Istructos / Useful Data x,, :,,, x x Probablty of a evet A Idepedetly ad detcally dstrbuted Bomal dstrbuto wth parameters ad p Posso dstrbuto wth
More informationCS286.2 Lecture 4: Dinur s Proof of the PCP Theorem
CS86. Lecture 4: Dur s Proof of the PCP Theorem Scrbe: Thom Bohdaowcz Prevously, we have prove a weak verso of the PCP theorem: NP PCP 1,1/ (r = poly, q = O(1)). Wth ths result we have the desred costat
More informationAnalytical Study of Fractal Dimension Types in the Context of SPC Technical Paper. Noa Ruschin Rimini, Irad Ben-Gal and Oded Maimon
Aalytcal Study of Fractal Deso Types the Cotext of SPC Techcal Paper oa Rusch R, Irad Be-Gal ad Oded Mao Departet of Idustral Egeerg, Tel-Avv Uversty, Tel-Avv, Israel Ths paper provdes a aalytcal study
More informationWireless Link Properties
Opportustc Ecrypto for Robust Wreless Securty R. Chadramoul ( Moul ) moul@steves.edu Multmeda System, Networkg, ad Commucatos (MSyNC) Laboratory, Departmet of Electrcal ad Computer Egeerg, Steves Isttute
More informationUniform DFT Filter Banks 1/27
.. Ufor FT Flter Baks /27 Ufor FT Flter Baks We ll look at 5 versos of FT-based flter baks all but the last two have serous ltatos ad are t practcal. But they gve a ce trasto to the last two versos whch
More informationLecture 8 IEEE DCF Performance
Lecture 8 IEEE82. DCF Perforace IEEE82. DCF Basc Access Mechas A stato wth a ew packet to trast otors the chael actvty. If the chael s dle for a perod of te equal to a dstrbuted terfrae space (DIFS), the
More information1 Mixed Quantum State. 2 Density Matrix. CS Density Matrices, von Neumann Entropy 3/7/07 Spring 2007 Lecture 13. ψ = α x x. ρ = p i ψ i ψ i.
CS 94- Desty Matrces, vo Neuma Etropy 3/7/07 Sprg 007 Lecture 3 I ths lecture, we wll dscuss the bascs of quatum formato theory I partcular, we wll dscuss mxed quatum states, desty matrces, vo Neuma etropy
More informationThis lecture and the next. Why Sorting? Sorting Algorithms so far. Why Sorting? (2) Selection Sort. Heap Sort. Heapsort
Ths lecture ad the ext Heapsort Heap data structure ad prorty queue ADT Qucksort a popular algorthm, very fast o average Why Sortg? Whe doubt, sort oe of the prcples of algorthm desg. Sortg used as a subroute
More informationLINEARLY CONSTRAINED MINIMIZATION BY USING NEWTON S METHOD
Jural Karya Asl Loreka Ahl Matematk Vol 8 o 205 Page 084-088 Jural Karya Asl Loreka Ahl Matematk LIEARLY COSTRAIED MIIMIZATIO BY USIG EWTO S METHOD Yosza B Dasrl, a Ismal B Moh 2 Faculty Electrocs a Computer
More informationECON 5360 Class Notes GMM
ECON 560 Class Notes GMM Geeralzed Method of Momets (GMM) I beg by outlg the classcal method of momets techque (Fsher, 95) ad the proceed to geeralzed method of momets (Hase, 98).. radtoal Method of Momets
More informationA Geometric Perspective on Guesswork
A Geometrc Perspectve o Guesswork Ahmad Beram Robert Calderbak Mark Chrstase Ke Duffy Al Makhdoum Murel Médard Departmet of Electrcal ad Computer Egeerg Duke Uversty USA Research Laboratory of Electrocs
More informationChapter 5. Presentation. Entropy STATISTICAL CODING
Chapter 5 STATISTICAL CODING Presetato Etropy Iformato data codg Iformato data codg coded represetato of formato Ijectve correspodece Message {b } Multples roles of codg Preparg the trasformato message
More information( ) = ( ) ( ) Chapter 13 Asymptotic Theory and Stochastic Regressors. Stochastic regressors model
Chapter 3 Asmptotc Theor ad Stochastc Regressors The ature of eplaator varable s assumed to be o-stochastc or fed repeated samples a regresso aalss Such a assumpto s approprate for those epermets whch
More information10-704: Information Processing and Learning Spring Lecture 10: Feb 12
10-704: Iformatio Processig ad Learig Sprig 2015 Lecture 10: Feb 12 Lecturer: Akshay Krishamurthy Scribe: Dea Asta, Kirthevasa Kadasamy Disclaimer: These otes have ot bee subjected to the usual scrutiy
More informationThe Mathematical Appendix
The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.
More informationThe Occupancy and Coupon Collector problems
Chapter 4 The Occupacy ad Coupo Collector problems By Sarel Har-Peled, Jauary 9, 08 4 Prelmares [ Defto 4 Varace ad Stadard Devato For a radom varable X, let V E [ X [ µ X deote the varace of X, where
More information,m = 1,...,n; 2 ; p m (1 p) n m,m = 0,...,n; E[X] = np; n! e λ,n 0; E[X] = λ.
CS70: Lecture 21. Revew: Dstrbutos Revew: Idepedece Varace; Iequaltes; WLLN 1. Revew: Dstrbutos 2. Revew: Idepedece 3. Varace 4. Iequaltes Markov Chebyshev 5. Weak Law of Large Numbers U[1,...,] : Pr[X
More informationPolar Coding for Noisy Write-Once Memories
204 IEEE Iteratoal Symposum o Iformato Theory Polar Codg for Nosy Wrte-Oce Memores Eyal E Gad, Yue L,4, Joerg Klewer 2, Mchael Lagberg 3, Axao (Adrew) Jag 4 ad Jehoshua Bruck Calfora Isttute of Techology,
More information(b) By independence, the probability that the string 1011 is received correctly is
Soluto to Problem 1.31. (a) Let A be the evet that a 0 s trasmtted. Usg the total probablty theorem, the desred probablty s P(A)(1 ɛ ( 0)+ 1 P(A) ) (1 ɛ 1)=p(1 ɛ 0)+(1 p)(1 ɛ 1). (b) By depedece, the probablty
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 17
CS434a/54a: Patter Recogto Prof. Olga Vesler Lecture 7 Today Paraetrc Usupervsed Learg Expectato Maxato (EM) oe of the ost useful statstcal ethods oldest verso 958 (Hartley) seal paper 977 (Depster et
More informationArithmetic Mean and Geometric Mean
Acta Mathematca Ntresa Vol, No, p 43 48 ISSN 453-6083 Arthmetc Mea ad Geometrc Mea Mare Varga a * Peter Mchalča b a Departmet of Mathematcs, Faculty of Natural Sceces, Costate the Phlosopher Uversty Ntra,
More informationPROJECTION PROBLEM FOR REGULAR POLYGONS
Joural of Mathematcal Sceces: Advaces ad Applcatos Volume, Number, 008, Pages 95-50 PROJECTION PROBLEM FOR REGULAR POLYGONS College of Scece Bejg Forestry Uversty Bejg 0008 P. R. Cha e-mal: sl@bjfu.edu.c
More information