Lecture 7: MIMO Architectures Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
|
|
- Berniece Ramsey
- 5 years ago
- Views:
Transcription
1 : Theoretical Foudatios of Wireless Commuicatios 1 Thursday, May 19, :30-15:30, Coferece Room SIP 1 Textbook: D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatio 1 / 1 Overview Lecture 6: MIMO Chael Modelig Aalysis of LOS chaels w/o reflectios. Stochastic models for MIMO fadig chaels. : 2 / 1
2 V-BLAST Optimal trasmitter for CSI-T 2 Time-ivariat chael model: y[m] = Hx[m] + w[m]. Use SVD decompositio (i.e., H = UΛV ad precode with V. V-BLAST Architecture (D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatios. Geeralized structure with a uitary precodig matrix Q. Multiplexig coordiate system. data streams with capacity-achievig Gaussia codes with rates R k ad powers P k. Total rate R = k=1 R k ad power costrait k=1 P k = P. Joit decodig at the receiver. Examples: Q = V, waterfillig power allocatio; Q = I t, idepedet data streams. 2 CSI-T: chael state iformatio at the trasmitter. 3 / 1 V-BLAST Upper boud ohe highest reliable rate of commuicatio R < log det (I r + 1N0 HK xh bits/s/hz with the covariace matrix K x of the trasmitted sigal x K x = Q diag{p 1,..., P t } Q. Sphere packig A received vector (N time symbols lies with high probability i a ellipsoid of volume proportioal to det (N 0 I r + HK x H N. Noise spheres of radius N 0 ad volume proportioal to N r N 0. Maximum umber of codewords that ca be packed det (N 0 I r + HK x H N N r N. 0 The upper boud is achievable with V-BLAST! Example/special case: MISO system with Q = I t achieves ( t k=1 log 1 + h k 2 P k which is the upper boud from above! N 0 4 / 1
3 3 Capacity with CSI-R Fast fadig MIMO chael model: y[m] = H[m]x[m] + w[m]. Statioary, ergodic radom fadig process {H[m]}, E{ h 2 ij } = 1. Coheret commuicatios; i.e., the receiver tracks the fadig process {H[m]} exactly. Achievable rate i a give chael state H (with V-BLAST log det (I r + 1N0 HK xh. Codig over may coherece-time itervals (i.e., average over chael realizatios E H [log det (I r + 1N0 HK xh. Choose K x as a fuctio of the chael statistics such that [ C = max E log det (I r + 1N0 HK xh. K x :Tr[K x ] P K x depeds ohe statioary distributio of {H[m]}. 3 CSI-R: chael state iformatio at the receiver. 5 / 1 Capacity with CSI-R Special case 1: Oly few domiat paths which are time-ivariat. H ca be viewed as beig determiistic. Multiplex the streams ihe eige-directios of H H ad use waterfillig. Special case 2: May paths of approximately equal eergy. Use the agular represetatio: H a = U r HU t; etries of H a are geerated by differet physical paths (statistically idepedet. Assumptio: o domiat path; i.e., elemets h a ij have zero mea. Due to idepedece, trasmit i directios of Q = U t (i.e., sed iformatio i each trasmit agular widow: K x = U tλu t where Λ is a diagoal matrix with etries correspodig to the power allocatio. 6 / 1
4 Capacity with CSI-R Optimal power allocatio by solvig (with H = U r H a U t log det I r + 1 U r H a ΛH a U r N 0 C = max E Λ:Tr[Λ] P = max Λ:Tr[Λ] P E [ log det (I r + 1N0 H a ΛH a (Follows by usig det(aba 1 = det(a det(b det(a 1 = det(b. Special case: If h a ij CN (0, 1, i.i.d., equal power allocatio is optimal such that K x = (P/I t, ad the capacity is C = E = mi log det E log I r + SNR 1 + SNR λ 2 i HH, (with the radom, ordered sigular values λ 1 λ 2... λ mi. 7 / 1 Performace Gais: High SNR Regime By Jese s iequality we kow that mi mi log ( log 1 + SNR ( 1 + SNR λ 2 i [ ] 1 mi λ 2 i, mi with equality if sigular values are equal. High capacity if H is sufficietly radom ad well coditioed. Capacity at high SNR for i.i.d. Rayleigh chael C mi log SNR mi + E[log λ 2 i ] t (D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatios. Asymptotic slope of a ( system:. Approximately imes the capacity of a (1 1 system. MISO: oly power gai. 8 / 1
5 Performace Gais: Low SNR Regime With the approximatio we get C = (D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatios. log 2 (1 + x x log 2 e, mi mi = SNR = SNR E E log 1 + SNR λ 2 i SNR [ ] E λ 2 i log 2 e t E [Tr[HH ]] log 2 e [ ] h ij 2 log 2 e i,j = r SNR log 2 e bits/s/hz. Oly power gai a power gai of r over a (1 1 system sice, without CSI-T, o trasmit beamformig is possible! 9 / 1 Performace Gais: Large Atea Regime Cosider a ( system; capacity for i.i.d. Rayleigh fadig [ ( ] C (SNR = E log 1 + SNR λ2 i λ i / are the sigular values of H/. Iterestig result: the empirical distributio of the sigular values of H/ coverges to a determiistic distributio for almost all realizatios of H. Distributio of the squared sigular values: { f 1 1 (x = 1, 0 x 4, π x 4 0, else, quarter circle law. 10 / 1
6 Performace Gais: Large Atea Regime Covergece of the empirical distributio of H/ : (D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatios. 11 / 1 Performace Gais: Large Atea Regime It follows that 1 ( 4 log 1 + SNR λ2 i log (1 + SNRx f (xdx 0 }{{} =c (SNR Sigificace of c (SNR C (SNR lim = c (SNR Large- approximatio Example: C (SNR c (SNR. 12 / 1 (D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatios.
7 Performace Gais: Liear Scalig Why does the capacity scale liearly with the umber of ateas? Or what makes the differece? Special case 1: MISO chael with a large trasmit atea. For the ( 1 MISO chael (i.i.d. Rayleigh we get C 1(SNR = E log 1 + SNR h i 2. As, by the law of large umbers, 1 C 1 log(1 + SNR = C AWGN, sice lim h i 2 E[ h i 2 ]. Icreasig the umber of trasmit ateas reduces the fluctuatios ihe istataeous SNR. I cotrast, a (1 1 system suffers from Jese s loss, C 11 (SNR = E [ log ( 1 + SNR h 2 log ( 1 + SNR E[ h 2 ] = C AWGN. 13 / 1 Performace Gais: Liear Scalig Special case 2: SIMO chael with a large trasmit atea. For the (1 SIMO chael we get (with receive beamformig C 1(SNR = E log 1 + SNR h i 2. For large, C 1 log(snr = log( + log(snr. Ihe SIMO case, we have a power gai which icreases liearly with but o degree of freedom gai. (D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatios. 14 / 1
8 Performace Gais: Liear Scalig Special case 3: AWGN chael with ifiite badwidth. With power costrait P ad AWGN with spectral desity N 0/2, we get ( C = lim W log 1 + P = P W N 0W N 0 Capacity is bouded due to a fixed receive power although the umber of degrees of freedom icreases. The MIMO case: capacity of a ( system icreases liearly i sice simultaeously: there is a liear icrease ihe total received power ad there is a liear icrease ihe degrees of freedom (due to the radomess ad well-coditioedess of H. Requiremet: keep the atea spacig fixed at half the wavelegth, ad icrease the aperture! 15 / 1 Full CSI So far: CSI-R full degree of freedom gai. Full CSI: CSI-R plus CSI-T additioal power gai. Trasceiver architecture SVD: H[m] = U[m]Λ[m]V[m]. Preprocessig with V[m]. Postprocessig with U[m]. Power allocatio with waterfillig. AWGN capacity achievig code o each stream. Capacity mi C E log 1 + SNR λ 2 i mi Power gai by the factor / mi due to CSI-T. With CSI-T, the trasmitted eergy is focused ohe o-zero eigemodes of the chael, whereas without CSI-T the eergy is trasmitted across all directios i C t. For large, the distributio of λ i / coverges agai agaist f ; i.e., o power allocatio over time oly over space (chael hardeig. 16 / 1
9 Slow Fadig MIMO Chael Chael model: y[m] = Hx[m] + w[m], with H fixed but radom. Full CSI-R while trasmitter kows oly chael statistics. Reliable commuicatio at rate R is possible as log as log det (I r + 1N0 HK xh > R subject to Tr[K x] P. Iformatioheory guaratees the existece of a chael-state idepedet codig scheme that achieves reliable commuicatios wheever this coditio is met. Uiversal code: works for all chaels that satisfy the above coditio. If the coditio is ot satisfied, we are i outage. Outage probability [ ] pout MIMO (R = mi Pr log det (I r + 1N0 HK xh < R. K x :Tr[K x ] P Choose the trasmit strategy (i.e., K x to miimize the outage probability. Solutio depeds o statistics of H. 17 / 1 Slow Fadig MIMO Chael Slow fadig versus fast fadig Fast fadig: maximize the log-term average rate of iformatio flow (i.e., the ergodic capacity, with C = max E H [f (K x, H, K x f (K x, H = log det (I r + 1N0 HK xh. Maximize expected value of f (K x, H. Slow fadig: miimize (for a sigle realizatio of the chael the probability that the iformatio rate falls below the target rate R, p out(r = mi Pr[f (K x, H < R]. K x Miimize the tail probability that f (K x, H is less thahe target rate. Special case: i.i.d. Rayleigh fadig chael. Optimal covariace matrix for fast fadig: K x = P/I t. Cojecture [119]: it is as well the optimal covariace for the i.i.d. Rayleigh slow fadig at high SNR. 18 / 1
Lecture 8: MIMO Architectures (II) Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
MIMO : MIMO Theoretical Foundations of Wireless Communications 1 Wednesday, May 25, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication 1 / 20 Overview MIMO
More informationThe Fading Number of Multiple-Input Multiple-Output Fading Channels with Memory
The Fadig Number of Multiple-Iput Multiple-Output Fadig Chaels with Memory Stefa M. Moser Departmet of Commuicatio Egieerig Natioal Chiao Tug Uiversity NCTU Hsichu, Taiwa Email: stefa.moser@ieee.org Abstract
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Wednesday, June 1, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More 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 informationOFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI
MIMO-OFDM OFDM Precoder for Miimizig BER Upper Boud of MLD uder Imperfect CSI MCRG Joit Semiar Jue the th 008 Previously preseted at ICC 008 Beijig o May the st 008 Boosar Pitakdumrogkija Kazuhiko Fukawa
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 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 informationDiversity Combining Techniques
Diversity Combiig Techiques Whe the required sigal is a combiatio of several waves (i.e, multipath), the total sigal amplitude may experiece deep fades (i.e, Rayleigh fadig), over time or space. The major
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Friday, May 25, 2018 09:00-11:30, Kansliet 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless
More information17.1 Channel coding with input constraints
7. Chaels with iput costraits. Gaussia chaels. 7. Chael codig with iput costraits Motivatios: Let us look at the additive Gaussia oise. The the Shao capacity is ifiite, sice sup P I(X; X + Z) = achieved
More informationON THE CAPACITY OF THE MIMO CHANNEL - A TUTORIAL INTRODUCTION - Bengt Holter
ON HE CAPACIY OF HE MIMO CHANNEL - A UORIAL INRODUCION - Begt Holter Norwegia Uiversity of Sciece ad echology Departmet of elecommuicatios O.S.Bragstads plass B, N-7491 rodheim, Norway bholter@tele.tu.o
More informationOn the Finite Blocklength Performance of Lossy Multi-Connectivity
O the Fiite Blocklegth Performace of Lossy Multi-Coectivity Li Zhou Departmet of ECE, Natioal Uiversity of Sigapore, Email: lzhou@u.us.edu Albrecht Wolf Vodafoe Chair Mobile Commuicatio Systems, Techical
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 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 informationTransmitter Strategies for Closed-Loop MIMO-OFDM. Joon Hyun Sung
Trasmitter Strategies for Closed-Loop MIMO-OFDM A Thesis Preseted to The Academic Faculty by Joo Hyu Sug I Partial Fulfillmet of the Requiremets for the Degree Doctor of Philosophy School of Electrical
More informationA Study of Capacity and Spectral Efficiency of Fiber Channels
A Study of Capacity ad Spectral Efficiecy of Fiber Chaels Gerhard Kramer (TUM) based o joit work with Masoor Yousefi (TUM) ad Frak Kschischag (Uiv. Toroto) MIO Workshop Muich, Germay December 8, 2015 Istitute
More informationAchieving Stationary Distributions in Markov Chains. Monday, November 17, 2008 Rice University
Istructor: Achievig Statioary Distributios i Markov Chais Moday, November 1, 008 Rice Uiversity Dr. Volka Cevher STAT 1 / ELEC 9: Graphical Models Scribe: Rya E. Guerra, Tahira N. Saleem, Terrace D. Savitsky
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 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 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 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 informationThe Capacity Per Unit Energy of Large Wireless Networks
The Capacity Per Uit Eergy of Large Wireless Networks Sudeep Kamath EECS Departmet, UC Berkeley Berkeley, CA 9470 sudeep@eecs.berkeley.edu Urs Niese Bell Laboratories, Alcatel-Lucet Murray Hill, NJ 07974
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 informationSymmetric Two-User Gaussian Interference Channel with Common Messages
Symmetric Two-User Gaussia Iterferece Chael with Commo Messages Qua Geg CSL ad Dept. of ECE UIUC, IL 680 Email: geg5@illiois.edu Tie Liu Dept. of Electrical ad Computer Egieerig Texas A&M Uiversity, TX
More informationNotes 27 : Brownian motion: path properties
Notes 27 : Browia motio: path properties Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces:[Dur10, Sectio 8.1], [MP10, Sectio 1.1, 1.2, 1.3]. Recall: DEF 27.1 (Covariace) Let X = (X
More informationLinear Algebra Issues in Wireless Communications
Rome-Moscow school of Matrix Methods ad Applied Liear Algebra August 0 September 18, 016 Liear Algebra Issues i Wireless Commuicatios Russia Research Ceter [vladimir.lyashev@huawei.com] About me ead of
More informationCSI is not needed for Optimal Scaling in Multiuser Massive SIMO Systems
CSI is ot eeded for Optimal Scalig i Multiuser Massive SIMO Systems Alexadros Maolakos Email: amaolak@staford.edu Maiak Chowdhury Email: maiakch@staford.edu Adrea J. Goldsmith Email: adreag@staford.edu
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 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 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 informationSolutions to HW Assignment 1
Solutios to HW: 1 Course: Theory of Probability II Page: 1 of 6 Uiversity of Texas at Austi Solutios to HW Assigmet 1 Problem 1.1. Let Ω, F, {F } 0, P) be a filtered probability space ad T a stoppig time.
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 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 informationCapacity Results for MIMO Wireless Optical Communication
Capacity Results for MIMO Wireless Optical Commuicatio Stefa M. Moser, Michail Myloakis, Ligog Wag, ad Michèle Wigger Sigal ad Iformatio Processig Lab, ETH Zürich, Switzerlad Departmet of Electrical ad
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5
CS434a/54a: Patter Recogitio Prof. Olga Veksler Lecture 5 Today Itroductio to parameter estimatio Two methods for parameter estimatio Maimum Likelihood Estimatio Bayesia Estimatio Itroducto Bayesia Decisio
More informationA Weak Law of Large Numbers Under Weak Mixing
A Weak Law of Large Numbers Uder Weak Mixig Bruce E. Hase Uiversity of Wiscosi Jauary 209 Abstract This paper presets a ew weak law of large umbers (WLLN) for heterogeous depedet processes ad arrays. The
More information5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.
40 RODICA D. COSTIN 5. The Rayleigh s priciple ad the i priciple for the eigevalues of a self-adjoit matrix Eigevalues of self-adjoit matrices are easy to calculate. This sectio shows how this is doe usig
More informationScaling Laws for Noncoherent Energy-based Communications in the SIMO MAC
Scalig Laws for Nocoheret Eergy-based Commuicatios i the SIMO MAC Maiak Chowdhury, Alexadros Maolakos ad Adrea Goldsmith Fellow, IEEE Abstract We cosider a oe-shot commuicatio settig i which several sigle
More informationStochastic Simulation
Stochastic Simulatio 1 Itroductio Readig Assigmet: Read Chapter 1 of text. We shall itroduce may of the key issues to be discussed i this course via a couple of model problems. Model Problem 1 (Jackso
More 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 informationLecture 01: the Central Limit Theorem. 1 Central Limit Theorem for i.i.d. random variables
CSCI-B609: A Theorist s Toolkit, Fall 06 Aug 3 Lecture 0: the Cetral Limit Theorem Lecturer: Yua Zhou Scribe: Yua Xie & Yua Zhou Cetral Limit Theorem for iid radom variables Let us say that we wat to aalyze
More informationECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015
ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 6 9/23/203 Browia motio. Itroductio Cotet.. A heuristic costructio of a Browia motio from a radom walk. 2. Defiitio ad basic properties
More 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 informationAn Upper Bound for Limited Rate Feedback MIMO Capacity
1 A Upper Boud for Limited Rate Feedbac MIMO Capacity Göha M Güvese, Studet Member, IEEE, ad A Özgür Yılmaz Abstract We develop a techique to upper boud the poitto-poit MIMO limited rate feedbac LRF capacity
More informationUnifying Performance Analysis of Linear MIMO Receivers in Correlated Rayleigh Fading Environments
Uifyig Performace Aalysis of Liear MIMO Receivers i Correlated Rayleigh Fadig Eviromets Mario Kiesslig,2, Joachim Speidel Istitute of Telecommuicatios, Uiversity of Stuttgart, Germay 2 Siemes AG, Iformatio
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More 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 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 informationA meta-converse for private communication over quantum channels
A meta-coverse for private commuicatio over quatum chaels Mario Berta with Mark M. Wilde ad Marco Tomamichel IEEE Trasactios o Iformatio Theory, 63(3), 1792 1817 (2017) Beyod IID Sigapore - July 17, 2017
More informationLECTURE 11 LINEAR PROCESSES III: ASYMPTOTIC RESULTS
PRIL 7, 9 where LECTURE LINER PROCESSES III: SYMPTOTIC RESULTS (Phillips ad Solo (99) ad Phillips Lecture Notes o Statioary ad Nostatioary Time Series) I this lecture, we discuss the LLN ad CLT for a liear
More informationPerformance Analysis of Adaptive Coded Modulation with Antenna Diversity and Feedback Delay
Performace Aalysis of Adaptive Coded Modulatio with Atea Diversity ad Feedback Delay Kjell J. Hole, Herik Holm, ad Geir E. Øie Abstract A geeral adaptive codig scheme for spectrally efficiet trasmissio
More informationMaximum Likelihood Estimation and Complexity Regularization
ECE90 Sprig 004 Statistical Regularizatio ad Learig Theory Lecture: 4 Maximum Likelihood Estimatio ad Complexity Regularizatio Lecturer: Rob Nowak Scribe: Pam Limpiti Review : Maximum Likelihood Estimatio
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 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 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 informationLong-Term CSI Based Multi-User Scheduling for Collaborative. Spatial Multiplexing in Mobile-WiMAX
Log-Term CSI Based ulti-user Schedulig for Collaborative Spatial ultiplexig i obile-wiax Ji-Woo Lee ad Yog-Hwa Lee School of Electrical Egieerig ad INC Seoul Natioal Uiversity, Seoul, Korea Email: jiu@ttl.su.ac.kr
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 informationQuasi-Static Multiple-Antenna Fading Channels at Finite Blocklength
Quasi-Static Multiple-Atea adig Chaels at iite Blocklegth Wei Yag, Studet Member, IEEE, Giuseppe Durisi, Seior Member, IEEE, Tobias Koch, Member, IEEE, ad Yury Polyaskiy, Member, IEEE Abstract This paper
More informationBER 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 informationIterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b.
Iterative Techiques for Solvig Ax b -(8) Cosider solvig liear systems of them form: Ax b where A a ij, x x i, b b i Assume that the system has a uique solutio Let x be the solutio The x A b Jacobi ad Gauss-Seidel
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 informationTHE SPECTRAL RADII AND NORMS OF LARGE DIMENSIONAL NON-CENTRAL RANDOM MATRICES
COMMUN. STATIST.-STOCHASTIC MODELS, 0(3), 525-532 (994) THE SPECTRAL RADII AND NORMS OF LARGE DIMENSIONAL NON-CENTRAL RANDOM MATRICES Jack W. Silverstei Departmet of Mathematics, Box 8205 North Carolia
More informationECE 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 informationLecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise)
Lecture 22: Review for Exam 2 Basic Model Assumptios (without Gaussia Noise) We model oe cotiuous respose variable Y, as a liear fuctio of p umerical predictors, plus oise: Y = β 0 + β X +... β p X p +
More informationReliability and Queueing
Copyright 999 Uiversity of Califoria Reliability ad Queueig by David G. Messerschmitt Supplemetary sectio for Uderstadig Networked Applicatios: A First Course, Morga Kaufma, 999. Copyright otice: Permissio
More informationLecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Antenna Diversity and Theoretical Foundations of Wireless Communications Wednesday, May 4, 206 9:00-2:00, Conference Room SIP Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More information1 Adiabatic and diabatic representations
1 Adiabatic ad diabatic represetatios 1.1 Bor-Oppeheimer approximatio The time-idepedet Schrödiger equatio for both electroic ad uclear degrees of freedom is Ĥ Ψ(r, R) = E Ψ(r, R), (1) where the full molecular
More information17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15
17. Joit distributios of extreme order statistics Lehma 5.1; Ferguso 15 I Example 10., we derived the asymptotic distributio of the maximum from a radom sample from a uiform distributio. We did this usig
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 informationLast time: Moments of the Poisson distribution from its generating function. Example: Using telescope to measure intensity of an object
6.3 Stochastic Estimatio ad Cotrol, Fall 004 Lecture 7 Last time: Momets of the Poisso distributio from its geeratig fuctio. Gs () e dg µ e ds dg µ ( s) µ ( s) µ ( s) µ e ds dg X µ ds X s dg dg + ds ds
More informationLarge Deviations in Quantum Information Theory
Large Deviatios i Quatum Iformatio Theory R. Ahlswede ad V. Bliovsky Abstract We obtai asymptotic estimates o the probabilities of evets of special types which are usefull i quatum iformatio theory, especially
More informationECE 901 Lecture 13: Maximum Likelihood Estimation
ECE 90 Lecture 3: Maximum Likelihood Estimatio R. Nowak 5/7/009 The focus of this lecture is to cosider aother approach to learig based o maximum likelihood estimatio. Ulike earlier approaches cosidered
More informationEL 675 UHF Propagation for Modern Wireless Systems. Henry L. Bertoni Polytechnic University
EL 675 UHF Propagatio for Moder Wireless Systems Hery L. Bertoi Polytechic Uiversity otext for Discussig Wireless hael haracteristics Frequecies above ~ 300 MHz (λ < m) adio liks i ma-made eviromets At
More informationInformation Theory and Statistics Lecture 4: Lempel-Ziv code
Iformatio Theory ad Statistics Lecture 4: Lempel-Ziv code Łukasz Dębowski ldebowsk@ipipa.waw.pl Ph. D. Programme 203/204 Etropy rate is the limitig compressio rate Theorem For a statioary process (X i)
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 informationMachine 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 informationSieve Estimators: Consistency and Rates of Convergence
EECS 598: Statistical Learig Theory, Witer 2014 Topic 6 Sieve Estimators: Cosistecy ad Rates of Covergece Lecturer: Clayto Scott Scribe: Julia Katz-Samuels, Brado Oselio, Pi-Yu Che Disclaimer: These otes
More informationChapter 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 informationProbability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)].
Probability 2 - Notes 0 Some Useful Iequalities. Lemma. If X is a radom variable ad g(x 0 for all x i the support of f X, the P(g(X E[g(X]. Proof. (cotiuous case P(g(X Corollaries x:g(x f X (xdx x:g(x
More informationLinear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d
Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y
More informationNotes 5 : More on the a.s. convergence of sums
Notes 5 : More o the a.s. covergece of sums Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: Dur0, Sectios.5; Wil9, Sectio 4.7, Shi96, Sectio IV.4, Dur0, Sectio.. Radom series. Three-series
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationDiversity versus Channel Knowledge at Finite Block-Length
Diversity versus Chael Kowledge at Fiite Block-Legth Wei Yag, Giuseppe Durisi, Tobias Koch, ad Yury Polyaskiy Chalmers Uiversity of Techology, 496 Gotheburg, Swede Uiversidad Carlos III de Madrid, 89 Legaés,
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 informationStatistical Inference Based on Extremum Estimators
T. Rotheberg Fall, 2007 Statistical Iferece Based o Extremum Estimators Itroductio Suppose 0, the true value of a p-dimesioal parameter, is kow to lie i some subset S R p : Ofte we choose to estimate 0
More informationhttp://www.xelca.l/articles/ufo_ladigsbaa_houte.aspx imulatio Output aalysis 3/4/06 This lecture Output: A simulatio determies the value of some performace measures, e.g. productio per hour, average queue
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 informationRandom assignment with integer costs
Radom assigmet with iteger costs Robert Parviaie Departmet of Mathematics, Uppsala Uiversity P.O. Box 480, SE-7506 Uppsala, Swede robert.parviaie@math.uu.se Jue 4, 200 Abstract The radom assigmet problem
More information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
More informationThis exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.
Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the
More informationLecture 13: Maximum Likelihood Estimation
ECE90 Sprig 007 Statistical Learig Theory Istructor: R. Nowak Lecture 3: Maximum Likelihood Estimatio Summary of Lecture I the last lecture we derived a risk (MSE) boud for regressio problems; i.e., select
More informationA Hadamard-type lower bound for symmetric diagonally dominant positive matrices
A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of
More informationApproximate Analysis of Power Offset over Spatially Correlated MIMO Channels
Commuicatios ad Network, 9, 5-3 doi:.36/c.9. Published Olie August 9 (http://www.scirp.org/joural/c) Approximate Aalysis of Power Offset over Spatially Correlated MIMO Chaels Guagwei YU, Xuzhe WANG School
More informationLecture 3: August 31
36-705: Itermediate Statistics Fall 018 Lecturer: Siva Balakrisha Lecture 3: August 31 This lecture will be mostly a summary of other useful expoetial tail bouds We will ot prove ay of these i lecture,
More informationThe central limit theorem for Student s distribution. Problem Karim M. Abadir and Jan R. Magnus. Econometric Theory, 19, 1195 (2003)
The cetral limit theorem for Studet s distributio Problem 03.6.1 Karim M. Abadir ad Ja R. Magus Ecoometric Theory, 19, 1195 (003) Z Ecoometric Theory, 19, 003, 1195 1198+ Prited i the Uited States of America+
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 informationMASSACHUSETTS 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