MIMO Systems and Channel Capacity
|
|
- Katherine Cross
- 5 years ago
- Views:
Transcription
1 MIMO Systems and Channel Capacty Consder a MIMO system wth m Tx and n Rx antennas. x y = Hx ξ Tx H Rx The power constrant: the total Tx power s x = P t. Component-wse representaton of the system model, y m = g x ξ y = Gx ξ (13.1) j j j= 1 Lecture Oct-15 1(31)
2 Theorem (Foschn, Telatar): Under sotropc sgnalng R = xx = ( P / n) I (e.g. no CSI at the Tx), the capacty of the channel n (13.1) s where H γ = r = P r t r x γ C = log det Im HH [ bt/s/hz] (13.) m P P G s the normalzed channel matrx, t 0 σ s the aggregate SNR at the Rx end. ( ) / P = P tr GG m s the total receved power, so that relable transmsson s possble at any rate R < C. t Proof: When x s a complex Gaussan vector, CN( 0, K x), ts entropy s where H K x s the correlaton matrx, ( ) = log ( πe) x m det x K (13.3) Lecture Oct-15 (31)
3 Smlarly for the nose and the output vector: where Kξ = ξξ, K y = yy ELG513 Smart Antennas S.Loyka [ ] x = x = x j x j K xx K (13.4) n ( ) = ( π ) ( ) = ( π ) n H ξ log e det K ξ, H y log e det K y (13.5) Note: ths follows from the pdf of a complex Gaussan vector, and we have assumed that. 1 1 ρ ( x) = exp m x K x x π K x R R I I R I I R R I (13.6) x x = x x, x x = x x, x = x jx (13.7) where x R and x I are real and magnary parts of x. The mutual nformaton s Lecture Oct-15 3(31)
4 ( y x) ( x) ( y) ( x y) I, = H H H, = log K x K K xy y (13.8) where The capacty s x K K K xy = x y = y K yx K x xy ( ) y (13.9) C = max I, p( ) y x (13.10) x under the assumptons that the channel s fxed (statc). We further assume that the CSI s avalable at the Rx only (but not at the Tx). For Gaussan nose, the maxmum s acheved when x s zero-mean Gaussan. Under certan crcumstances (e.g. no Tx CSI), the covarance s a scaled dentty, subject to the power constrant trk x Pt. Hence, Pt K x = I m (13.11) m Lecture Oct-15 4(31)
5 Here, we also assume that the nose s uncorrelated from one Rx antenna to another, and that the sgnal and nose are uncorrelated as well: K ξ = σ 0 I n, (13.1) * j x ξ = 0 (13.13) Lecture Oct-15 5(31)
6 Under these assumptons, Usng the followng dentty, Pt K y = yy = GG σ0i n Pt Pt K xy = G, K yx = G m m n (13.14) A B 1 = A D - CA B C D (13.15) we fnd Fnally, 1 n xy = x y xy x yx = σ0 x K K K K K K K (13.16) C K x K y Pt = log = log det Im GG K xy σ0m (13.17) Lecture Oct-15 6(31)
7 Let us normalze G as follows, where P r s the total receved power. Then, H = P P G (13.18) t r C γ = log det In HH [ bt/s/hz] (13.19) m where γ = P r σ 0 s the average SNR at the Rx. Ths gves the MIMO channel capacty n bt/s/hz. Ths s the celebrated Foschn-Telatar formula. Q.E.D. Lecture Oct-15 7(31)
8 Important specal cases n parallel ndependent sub-channels, The capacty s H = I ( n = m) (13.0) C = mlog 1 γ m (13.1) Interpretaton: the ncomng bt stream s splt nto m ndependent sub-streams and transmtted ndependently over m channels. Snce the total Tx power s fxed to P t, perchannel SNR s γ m. Asymptotcally, Note that capacty growth lnearly wth γ much faster! γ m C (13.) ln Lecture Oct-15 8(31)
9 Whle C(m) s monotoncally ncreasng wth m, the ncrease slows down for large n. Snce ncrease n n s related to huge ncrease n system complexty, there s some maxmum m, whch s approxmately m γ. In practce, one would keep m mmax. max Compare wth the case when all the bts are transmtted over one sub-channel only, Clearly, Another approach to ths problem s based on the cost model, C 1 = log( 1 γ ) (13.3) C C 1 for γ 1 (13.4) S = α m (13.5) where S = cost, α = cost/stream. Hence, the capacty/cost rato (capacty per unt cost) s C S 1 γ = log 1 α m (13.6) Ths s capacty per unt cost and t s always decreasng functon of n. However, the decrease s slow for moderate values of m, and t becomes large only when m ~ γ. Lecture Oct-15 9(31)
10 Next consder dversty combnng, (one Tx and n Rx s). The capacty s [ ] T H = h1 h hn, m = 1 (13.7) C = log det I HH = log 1 γ (13.8) n γ h m = 1 Clearly, ths s the MRC. It proves once agan that the MRC s optmum (ths tme, from capacty (nformaton theoretc) vewpont). Selecton combnng can be represented as, ( ) { ( )} { } C = max log 1 γ h = log 1 γ max h (13.9) Hence, capacty-wse selecton combnng s the same as power-wse one. Tx dversty combnng, for fxed P t, s not the same as Rx combnng. Q: prove t! However, when per-branch Tx power s fxed, t s the same as Rx combnng. Q: prove t! Lecture Oct-15 10(31)
11 SVD Decomposton and Channel Capacty Introduce a (nstantaneous) channel covarance matrx: Egenvalue decomposton of W s W = H H (13.30) W = QΛ Q (13.31) where Q s a mxm untary matrx of egenvectors, and dagonal matrx of egenvalues. Consder the SVD of H: [ ] Λ = dag λ λ λ 1 m H = UΣV (13.3) where U and V are untary matrces (of left and rght sngular vectors of H ), and Σ s dagonal (mxn) matrx of (non-negatve) sngular values. Note that W = H H = VΣ ΣV (13.33) Lecture Oct-15 11(31)
12 Hence, Q = V, Λ = Σ Σ (13.33).e, egenvalues of W are squared sngular values of H, λ ( W) = σ ( H ). Usng the equatons above, the capacty can be presented as C m γ = log 1 λ m (13.34) = 1 Hence, W = σ λ = λ ( ) ( H ) are the channel egenmode power gans. Q: prove t! Ths s alternatve representaton of the Foschn-Telatar formula. Lecture Oct-15 1(31)
13 channel Note: capacty doesn t change under transformaton Q: prove t! H H Lecture Oct-15 13(31)
14 Example 1 Consder the all-1 channel H = 1, fnd ts capacty. Soluton: where Hence, j T H = UΣV U = [ ], = mn, = [ 1 1 1] n 1 1 Σ V (13.35) m λ = mn, λ,, λ = 0 (13.36) ( n) m C = log 1 γ (13.37).e, t ncreases only logarthmcally wth n > ths s an example of a correlated (rankdefcent) channel. P Note : the effect of m s hdden n γ snce γ = r, where P σ r s the total Rx power, 0 P = mp. r r1 Lecture Oct-15 14(31)
15 Example Consder a multpath channel of the form M 1 H = wv g (13.38) mn where v = Tx array manfold vector, w = Rx array manfold vector, and g - channel gans, all for th multpath component. Assume that = 1 j j j j (orthonormal). By nspecton, we conclude that w w = nδ, v v = mδ (13.39) M γ = 1 m λ = g, C= log 1 λ, f M < mn m, n ( ) (13.40) Hence the number of multpath components lmts MIMO capacty! Lecture Oct-15 15(31)
16 In general case, the number of non-zero egenvalues s mn ( m, n, M ) γ M 0 = mn ( m, n, M ) C= log 1 λ m (13.41) Assumng that all the egenvalues are equal, = 1 γ C= mn ( m, n, M ) log 1 λ m Number of degrees of freedom: a factor n front of log s called a number of degrees of freedom, or capacty slope. Q.: What s the meanng of t? (13.4) Lecture Oct-15 16(31)
17 Example 3 MISO channel (Tx dversty), n = 1, H = [ ] : The capacty s γ C = log 1 m = log 1 γ m ( ) (13.43). e., the same, as SISO wth the same total Tx power (the effect of coherent combnng s already ncluded n ρ, whch s the rato of total Rx power, n one Rx from all Tx s, to the nose power). Compare t wth SIMO (Rx dversty), m = 1, H = [ 1 1 1] T, Q.: explan the dfference! ( n) ( ) C = log 1 γ log 1 γ f n 1 (13.44) Lecture Oct-15 17(31)
18 Capacty of an Ergodc Raylegh-fadng Channel We assume that Rx knows the channel (H), but Tx doesn t. Start wth the general MIMO capacty expresson for a gven (fxed) H : γ C = log det I HH (13.45) m Snce H s random for a fadng channel, C s random as well. For any gven realzaton of H, C can be evaluated, but t vares from realzaton to realzaton,.e. random varable. Defne the mean (ergodc) capacty, γ C = C = log det I HH (13.46) H m Telatar gves a detaled formulaton, based on the mutual nformaton,(, ) proves that the maxmum s acheved when x are..d. Gaussan. H ( ) I x y H, and Note that the mean capacty makes practcal sense for ergodc channels only,.e., when the expectaton over realzatons s the same as expectatons over tme. Lecture Oct-15 18(31)
19 Interpretaton of ergodc capacty: t can be proved (based on nformaton theory) that there exsts a sngle code that acheves the capacty n (13.46). Alternatvely, an adaptve system can be bult that acheves the nstantaneous capacty n (13.45) and ts average capacty s as n (13.46). For a Raylegh channel, h j are..d. complex Gaussans wth unt varance, CN 0,1. Telatar descrbes n detals the evaluaton of capacty n ths case hj ( ) (analytcal approach). Consder some specal cases. Lecture Oct-15 19(31)
20 Example 1 n s fxed, and m. In ths case, 1 1 m * = hj hkj n m m j= 1 HH I (13.47) n probablty due to the central lmt theorem. Hence, the capacty s C = nlog ( 1 γ ) (13.48).e., the same as the capacty of n parallel ndependent channels, AWGN, no fadng. Ths s the effect of Tx dversty. Consder n = 1, m then, C = log( 1 γ ) (13.49).e, an nfnte-order dversty transforms the Raylegh-fadng channel nto a fxed (nonfadng) AWGN channel. Example : m s fxed and n. Homework. References: [1-3, 5, 6]. Lecture Oct-15 0(31)
21 Summary MIMO capacty. Basc concepts (entropy, mutual nformaton) for random vectors. Canoncal form of the MIMO capacty. Large n lmt. Comparson to conventonal systems. Capacty of dversty combnng systems. The mpact of multpath, Tx and Rx antenna number. MIMO capacty of a Raylegh channel. The mpact of fadng. Lecture Oct-15 1(31)
22 References 1. J.R. Barry, E.A. Lee, D.G. Messerschmtt, Dgtal Communcaton, 003 (Thrd Edton). Ch. 10, 11.. D. Tse, P. Vswanath, Fundamentals of Wreless Communcatons, Cambrdge, P.P. Vadyanathan et al, Sgnal Processng and Optmzaton for Transcever Systems, Cambrdge Unversty Press, 010; Ch. 6,, App. B, C. 4. D.W. Blss, S. Govndasamy, Adaptve Wreless Communcatons: MIMO Channels and Networks, Cambrdge Unversty Press, A. Paulraj, R. Nabar, D. Gore, Introducton to Space-Tme Wreless Communcatons, Cambrdge Unversty Press; E.G. Larson, P. Stoca, Space-Tme Block Codng for Wreless Communcatons, Cambrdge Unversty Press, I.E. Telatar, "Capacty of Mult-Antenna Gaussan Channels," AT&T Bell Lab. Internal Tech. Memo., June 1995 (European Trans. Telecom., v.10, N.6, Dec.1999). 8. Foschn, G.J., Gans M.J.: On Lmts of Wreless Communcatons n a Fadng Envronment when Usng Multple Antennas, Wreless Personal Communcatons, vol. 6, No. 3, pp , March Raylegh, G.G., Goff, J.M.: "Spato-Temporal Codng for Wreless Communcatons," IEEE Trans. Commun., v.46, N.3, pp , Lecture Oct-15 (31)
23 Appendx 1: SVD and optmzaton of MIMO Channel Capacty When the x T sgnal correlaton matrx { } P = E xx I, the MIMO capacty s 1 C = log 1 HPH (1) σ If CSI (channel state nformaton) s avalable at the T x, P can be chosen to maxmze C, subject to the total T x power constran: where P s the -th T x power. Consder the m n MIMO channel, Usng the SVD of H, m = 1 where U,V are n n and m m untary matrces, 0 P = tr( P ) PT () y = Hx ξ (3) H = UΣV (4) U U = V V = I, and Lecture Oct-15 3(31)
24 and dag[ ] Σ1 0 Σ = 0 0 (5) Σ 1 = σ1, σ,.. σ k are non-zero sngular values of H. Usng (4) and (3), y = UΣV x ξ, yɶ = Σxɶ ξ ɶ (6) y = σ x ξ, = 1,.. k (7) where ɶ, ɶ y = U y x = V x, ξ ɶ = U ξ. Note that multplcaton by a untary matrx does not change statstcs of a random vector and, hence, does not affect the mutual nformaton and the capacty. Hence, the channel n (7) has the same capacty as the orgnal channel (3). But the channel n (7) s as of k ndependent sub-channels, wth per-sub-channel SNR: and ɶ P (8) γ = λ σ 0 λ = σ are the egenvalues of HH, and P = P. Its capacty s k p C = log 1 λ (9) = 1 σ0 Lecture Oct-15 4(31)
25 Optmum P can be found usng water-fllng (WF) technque as follows: where [ x] σ 0 P = µ, = 1,,.. k λ 1 (10) k1 P = PT (11) = 1 = x f x>0 and 0 otherwse; k 1 s the number of actve egenmodes (.e. wth non-zero P ), and constant µ s found from (10). Note that (10) and (11) also gve (mplctly) k 1. Lecture Oct-15 5(31)
26 Water-fllng technque can be formulated as teratve algorthm as follows [1]: 1) order egenvalues, set teraton ndex p=0 ) fnd µ as follows 1 k p 1 µ = pt σ 0 k p = 1 λ (1) 3) set P usng (10) wth k 1 = k p 4) f there s zero P, set p = p 1, elmnate λ and go to step 5) fnsh when all P (=1,,..k-p) are non-zero. Ths algorthm gves all non-zero P. All the other P are zeros (.e., those egenmodes are not used). Proof of the water-fllng technque : usng Lagrange multplers wth the followng goal functon, Lecture Oct-15 6(31)
27 λp F = log(1 ) α P PT σ0 df dp (13) df = 0, = 0 (14) dα where α s a Lagrange multpler. From (14), one obtans (10) and (11). Fnally, optmum P s found usng (4) where,,.., D = dag p1 p p k 1 P = VDV (15) Lecture Oct-15 7(31)
28 Effect of T x CSI on the Capacty [] Compare the MIMO channel capacty n cases: 1) no T x CSI (unnformed T x -UT) ) full T x CSI (nformed T x -IT) PT In case 1, the capacty s gven by (9) wth P = m k PT = 1 mσ0 C = log(1 λ ) (15) UT In case, the capacty s gven by (9) wth P gven by (10) C IT k1 λp = 1 0 = log(1 ) (18) σ σ P = µ λ 0 (18a) Lecture Oct-15 8(31)
29 Consder the rato when PT 0 / σ.e. hgh SNR mode. k1 P = PT (18b) = 1 C IT β = (19) CUT Assumng that P T =const and σ0, t s clear from (18a) and (18b) that P =P T /m (assumng k=m,.e. full-rank channel), and CIT P 1 as C σ UT T 0 (0) Hence, optmum power allocaton does not provde advantage n hgh SNR mode parallel transmsson (spatal multplexng) wth equal powers s optmum. Lecture Oct-15 9(31)
30 Consder the case of low SNR, one fnds that ndex. Hence, Smlarly, Hence, P max T 0 P / σ 0. Assume that T = P and all the other 0 C IT P σ0, then from (18)-(18b) =, where max s the largest egenmode λ P λ = log 1 C C IT C UT UT = 1 max T max σ0 σ0 m PT m σ0 = 1 λ log e P T log e mλmax mλmax ( HH ) = m tr( HH ) λ (1) () Important concluson: n low SNR case, the best strategy s to use the largest egenmode only ths s beamformng! Lecture Oct-15 30(31)
31 In hgh SNR mode, the best strategy s to use spatal multplexng (parallel transmsson on all egenmodes). References: 1. A. Paulraj, R. Nabar, D. Gore, Introducton to Space-Tme Wreless Communcatons, Cambrdge Unversty Press, G. Larsson, P. Stoca, Space-Tme Block Codng for Wreless Communcatons, Cambrdge Unversty Press, 003. Lecture Oct-15 31(31)
ECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationThe Concept of Beamforming
ELG513 Smart Antennas S.Loyka he Concept of Beamformng Generc representaton of the array output sgnal, 1 where w y N 1 * = 1 = w x = w x (4.1) complex weghts, control the array pattern; y and x - narrowband
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationChapter 7 Channel Capacity and Coding
Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform
More informationI + HH H N 0 M T H = UΣV H = [U 1 U 2 ] 0 0 E S. X if X 0 0 if X < 0 (X) + = = M T 1 + N 0. r p + 1
Homework 4 Problem Capacty wth CSI only at Recever: C = log det I + E )) s HH H N M T R SS = I) SVD of the Channel Matrx: H = UΣV H = [U 1 U ] [ Σr ] [V 1 V ] H Capacty wth CSI at both transmtter and
More informationThe Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor
Prncpal Component Transform Multvarate Random Sgnals A real tme sgnal x(t can be consdered as a random process and ts samples x m (m =0; ;N, 1 a random vector: The mean vector of X s X =[x0; ;x N,1] T
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationx = x 1 + :::+ x K and the nput covarance matrces are of the form ± = E[x x y ]. 3.2 Dualty Next, we ntroduce the concept of dualty wth the followng t
Sum Power Iteratve Water-fllng for Mult-Antenna Gaussan Broadcast Channels N. Jndal, S. Jafar, S. Vshwanath and A. Goldsmth Dept. of Electrcal Engg. Stanford Unversty, CA, 94305 emal: njndal,syed,srram,andrea@wsl.stanford.edu
More informationSum Capacity of Multiuser MIMO Broadcast Channels with Block Diagonalization
Sum Capacty of Multuser MIMO Broadcast Channels wth Block Dagonalzaton Zukang Shen, Runhua Chen, Jeffrey G. Andrews, Robert W. Heath, Jr., and Bran L. Evans The Unversty of Texas at Austn, Austn, Texas
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationRethinking MIMO for Wireless Networks: Linear Throughput Increases with Multiple Receive Antennas
Retnng MIMO for Wreless etwors: Lnear Trougput Increases wt Multple Receve Antennas ar Jndal Unversty of Mnnesota Unverstat Pompeu Fabra Jont wor wt Jeff Andrews & Steven Weber MIMO n Pont-to-Pont Cannels
More informationMultipath richness a measure of MIMO capacity in an environment
EUROEA COOERATIO I THE FIELD OF SCIETIFIC AD TECHICAL RESEARCH EURO-COST SOURCE: Aalborg Unversty, Denmark COST 73 TD 04) 57 Dusburg, Germany 004/Sep/0- ultpath rchness a measure of IO capacty n an envronment
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
More informationPower Allocation/Beamforming for DF MIMO Two-Way Relaying: Relay and Network Optimization
Power Allocaton/Beamformng for DF MIMO Two-Way Relayng: Relay and Network Optmzaton Je Gao, Janshu Zhang, Sergy A. Vorobyov, Ha Jang, and Martn Haardt Dept. of Electrcal & Computer Engneerng, Unversty
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationPower Allocation for Distributed BLUE Estimation with Full and Limited Feedback of CSI
Power Allocaton for Dstrbuted BLUE Estmaton wth Full and Lmted Feedback of CSI Mohammad Fanae, Matthew C. Valent, and Natala A. Schmd Lane Department of Computer Scence and Electrcal Engneerng West Vrgna
More information763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.
7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
More informationMulti-beam multiplexing using multiuser diversity and random beams in wireless systems
Mult-eam multplexng usng multuser dversty and random eams n reless systems Sung-Soo ang Telecommuncaton R&D center Samsung electroncs co.ltd. Suon-cty Korea sungsoo.hang@samsung.com Yong-an Lee School
More informationCLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS
CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS Yawgeng A. Cha and Karl Yng-Ta Hang Department of Commncaton Engneerng,
More informationSecret Communication using Artificial Noise
Secret Communcaton usng Artfcal Nose Roht Neg, Satashu Goel C Department, Carnege Mellon Unversty, PA 151, USA {neg,satashug}@ece.cmu.edu Abstract The problem of secret communcaton between two nodes over
More informationAntenna Combining for the MIMO Downlink Channel
Antenna Combnng for the IO Downlnk Channel arxv:0704.308v [cs.it] 0 Apr 2007 Nhar Jndal Department of Electrcal and Computer Engneerng Unversty of nnesota nneapols, N 55455, USA Emal: nhar@umn.edu Abstract
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationError Probability for M Signals
Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal
More informationLecture 3: Shannon s Theorem
CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationEGR 544 Communication Theory
EGR 544 Communcaton Theory. Informaton Sources Z. Alyazcoglu Electrcal and Computer Engneerng Department Cal Poly Pomona Introducton Informaton Source x n Informaton sources Analog sources Dscrete sources
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationCognitive Access Algorithms For Multiple Access Channels
203 IEEE 4th Workshop on Sgnal Processng Advances n Wreless Communcatons SPAWC) Cogntve Access Algorthms For Multple Access Channels Ychuan Hu and Alejandro Rbero, Department of Electrcal and Systems Engneerng,
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationIntroduction to Antennas & Arrays
Introducton to Antennas & Arrays Antenna transton regon (structure) between guded eaves (.e. coaxal cable) and free space waves. On transmsson, antenna accepts energy from TL and radates t nto space. J.D.
More informationCorrelation Analysis of Instantaneous Mutual Information in 2 2 MIMO Systems
Correlaton Analyss of Instantaneous Mutual Informaton n MIMO Systems Shuangquan Wang, Al Abd Center for Wreless Communcatons Sgnal Processng Research Department of Electrcal Computer Engneerng New Jersey
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationLow Complexity Soft-Input Soft-Output Hamming Decoder
Low Complexty Soft-Input Soft-Output Hammng Der Benjamn Müller, Martn Holters, Udo Zölzer Helmut Schmdt Unversty Unversty of the Federal Armed Forces Department of Sgnal Processng and Communcatons Holstenhofweg
More informationOPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau
OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION Chrstophe De Lug and Erc Moreau Unversty of Toulon LSEET UMR CNRS 607 av. G. Pompdou BP56 F-8362 La Valette du Var Cedex
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationOptimal Spatial Correlations for the Noncoherent MIMO Rayleigh Fading Channel
1 Optmal Spatal Correlatons for the Noncoherent MIMO Raylegh Fadng Channel Shvratna Gr Srnvasan and Mahesh K. Varanas e-mal: {srnvsg, varanas}@colorado.edu Electrcal & Computer Engneerng Department Unversty
More informationPredictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore
Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.
More informationTHE optimal detection of a coded signal in a complicated
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 6, NO., NOVEMBER 24 773 Achevable Rates of MIMO Systems Wth Lnear Precodng and Iteratve LMMSE Detecton Xaojun Yuan, Member, IEEE, L Png, Fellow, IEEE, Chongbn
More informationTHE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.
THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY Wllam A. Pearlman 2002 References: S. Armoto - IEEE Trans. Inform. Thy., Jan. 1972 R. Blahut - IEEE Trans. Inform. Thy., July 1972 Recall
More informationLinköping University Post Print. Combining Long-Term and Low-Rate Short- Term Channel State Information over Correlated MIMO Channels
Lnköpng Unversty Post Prnt Combnng Long-Term and Low-Rate Short- Term Channel State Informaton over Correlated MIMO Channels Tùng T. Km, Mats Bengtsson, Erk G. Larsson and Mkael Skoglund N.B.: When ctng
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More information1 (1 + ( )) = 1 8 ( ) = (c) Carrying out the Taylor expansion, in this case, the series truncates at second order:
68A Solutons to Exercses March 05 (a) Usng a Taylor expanson, and notng that n 0 for all n >, ( + ) ( + ( ) + ) We can t nvert / because there s no Taylor expanson around 0 Lets try to calculate the nverse
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)
ECE 534: Elements of Informaton Theory Solutons to Mdterm Eam (Sprng 6) Problem [ pts.] A dscrete memoryless source has an alphabet of three letters,, =,, 3, wth probabltes.4,.4, and., respectvely. (a)
More informationEURASIP Journal on Wireless Communications and Networking
EURASIP Journal on Wreless Communcatons and Networkng Ths Provsonal PDF corresponds to the artcle as t appeared upon acceptance. Fully formatted PDF and full text (TM) versons wll be made avalable soon.
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationNoncooperative Eigencoding for MIMO Ad hoc Networks
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 2, FEBRUARY 2008 865 Noncooperatve Egencodng for IO Ad hoc Networks Duong Hoang, Student ember, IEEE, and Ronald A. Ilts, Senor ember, IEEE Abstract
More informationA Feedback Reduction Technique for MIMO Broadcast Channels
A Feedback Reducton Technque for MIMO Broadcast Channels Nhar Jndal Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455, USA Emal: nhar@umn.edu Abstract A multple antenna
More informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationDistributed Transmit Diversity in Relay Networks
Dstrbuted Transmt Dversty n Relay etworks Cemal Akçaba, Patrck Kuppnger and Helmut Bölcske Communcaton Technology Laboratory ETH Zurch, Swtzerland Emal: {cakcaba patrcku boelcske}@nareeethzch Abstract
More informationQuantum Mechanics I - Session 4
Quantum Mechancs I - Sesson 4 Aprl 3, 05 Contents Operators Change of Bass 4 3 Egenvectors and Egenvalues 5 3. Denton....................................... 5 3. Rotaton n D....................................
More informationEigenvalues of Random Graphs
Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the
More informationCS4495/6495 Introduction to Computer Vision. 3C-L3 Calibrating cameras
CS4495/6495 Introducton to Computer Vson 3C-L3 Calbratng cameras Fnally (last tme): Camera parameters Projecton equaton the cumulatve effect of all parameters: M (3x4) f s x ' 1 0 0 0 c R 0 I T 3 3 3 x1
More informationEnergy Efficient Resource Allocation for Quantity of Information Delivery in Parallel Channels
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES Trans. Emergng Tel. Tech. 0000; 00: 6 RESEARCH ARTICLE Energy Effcent Resource Allocaton for Quantty of Informaton Delvery n Parallel Channels Jean-Yves
More informationStatistics for Business and Economics
Statstcs for Busness and Economcs Chapter 11 Smple Regresson Copyrght 010 Pearson Educaton, Inc. Publshng as Prentce Hall Ch. 11-1 11.1 Overvew of Lnear Models n An equaton can be ft to show the best lnear
More informationCHANNEL state information (CSI) has a significant impact
Ffty-second Annual Allerton Conference Allerton House, UIUC, Illnos, USA October 1-3, 2014 Ergodc Capacty Under Channel Dstrbuton Uncertanty Sergey Loyka, Charalambos D. Charalambous and Ioanna Ioannou
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationChat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980
MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and
More informationCOGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK
COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK Ayman MASSAOUDI, Noura SELLAMI 2, Mohamed SIALA MEDIATRON Lab., Sup Com Unversty of Carthage 283 El Ghazala Arana, Tunsa
More informationMultigradient for Neural Networks for Equalizers 1
Multgradent for Neural Netorks for Equalzers 1 Chulhee ee, Jnook Go and Heeyoung Km Department of Electrcal and Electronc Engneerng Yonse Unversty 134 Shnchon-Dong, Seodaemun-Ku, Seoul 1-749, Korea ABSTRACT
More informationSTAT 511 FINAL EXAM NAME Spring 2001
STAT 5 FINAL EXAM NAME Sprng Instructons: Ths s a closed book exam. No notes or books are allowed. ou may use a calculator but you are not allowed to store notes or formulas n the calculator. Please wrte
More informationMulti-Sector Beamforming with MMSE Receiver for Spatially Correlated Channel
Mult-Sector Beamformng th Recever for Spatally Correlated Channel Jae-Heung Yeom and Yong-Han Lee School of lectrcal ngneerng and NMC Seoul Natonal Unversty Seoul, Korea e-mal: jhyeom@ttl.snu.ac.r, ylee@snu.ac.r
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationTransform Coding. Transform Coding Principle
Transform Codng Prncple of block-wse transform codng Propertes of orthonormal transforms Dscrete cosne transform (DCT) Bt allocaton for transform coeffcents Entropy codng of transform coeffcents Typcal
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationNon-linear Canonical Correlation Analysis Using a RBF Network
ESANN' proceedngs - European Smposum on Artfcal Neural Networks Bruges (Belgum), 4-6 Aprl, d-sde publ., ISBN -97--, pp. 57-5 Non-lnear Canoncal Correlaton Analss Usng a RBF Network Sukhbnder Kumar, Elane
More informationA Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
A ower Bound on SIR Threshold for Call Admsson Control n Multple-Class CDMA Systems w Imperfect ower-control Mohamed H. Ahmed Faculty of Engneerng and Appled Scence Memoral Unversty of ewfoundland St.
More informationOn the achievable rates of multiple antenna broadcast channels with feedback-link capacity constraint
Chen et al. EURASI Journal on Wreless Communcatons and Networkng 2, 2:2 http://jwcn.euraspjournals.com/content/2//2 RESEARCH Open Access On the achevable rates of multple antenna broadcast channels wth
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More informationStatistics for Economics & Business
Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable
More informationMultiple-Input Multiple-Output Systems
Multiple-Input Multiple-Output Systems What is the best way to use antenna arrays? MIMO! This is a totally new approach ( paradigm ) to wireless communications, which has been discovered in 95-96. Performance
More informationResearch Article Robustness Maximization of Parallel Multichannel Systems
Journal of Electrcal and Computer Engneerng Volume 2012, Artcle ID 840513, 16 pages do:10.1155/2012/840513 Research Artcle Robustness Maxmzaton of Parallel Multchannel Systems Jean-Yves Baudas, 1 Fahad
More informationExplicit constructions of all separable two-qubits density matrices and related problems for three-qubits systems
Explct constructons of all separable two-qubts densty matrces and related problems for three-qubts systems Y. en-ryeh and. Mann Physcs Department, Technon-Israel Insttute of Technology, Hafa 2000, Israel
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationEfficient Algorithm for Detecting Layered Space-Time Codes
4TH INTERNATIONAL ITG CONFERENCE ON SOURCE AND CHANNEL CODING, BERLIN, JANUARY 2002 1 Effcent Algorthm for Detectng Layered Space-Tme Codes D. Wübben, J. Rnas, R. Böhnke, V. Kühn and K.D. Kammeyer Department
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationOutage and Diversity of Linear Receivers in Flat-Fading MIMO Channels
Outage and Dversty of Lnear Recevers n Flat-Fadng IO Channels Ahmadreza Hedayat ember, IEEE, and Ara Nosratna Senor ember, IEEE Abstract Ths correspondence studes lnear recevers for IO channels under frequency-nonselectve
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationAssignment 2. Tyler Shendruk February 19, 2010
Assgnment yler Shendruk February 9, 00 Kadar Ch. Problem 8 We have an N N symmetrc matrx, M. he symmetry means M M and we ll say the elements of the matrx are m j. he elements are pulled from a probablty
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationGeorgia Tech PHYS 6124 Mathematical Methods of Physics I
Georga Tech PHYS 624 Mathematcal Methods of Physcs I Instructor: Predrag Cvtanovć Fall semester 202 Homework Set #7 due October 30 202 == show all your work for maxmum credt == put labels ttle legends
More informationDifferentiating Gaussian Processes
Dfferentatng Gaussan Processes Andrew McHutchon Aprl 17, 013 1 Frst Order Dervatve of the Posteror Mean The posteror mean of a GP s gven by, f = x, X KX, X 1 y x, X α 1 Only the x, X term depends on the
More informationCommunication with AWGN Interference
Communcaton wth AWG Interference m {m } {p(m } Modulator s {s } r=s+n Recever ˆm AWG n m s a dscrete random varable(rv whch takes m wth probablty p(m. Modulator maps each m nto a waveform sgnal s m=m
More informationPerformance of Concatenated Channel Codes
1 Performance of Concatenated Channel Codes and Orthogonal Space-Tme Block Codes Harsh Shah, Ahmadreza Hedayat, and Ara Nosratna Department of Electrcal Engneerng, Unversty of Texas at Dallas, Rchardson,
More informationOn balancing multiple video streams with distributed QoS control in mobile communications
On balancng multple vdeo streams wth dstrbuted QoS control n moble communcatons Arjen van der Schaaf, José Angel Lso Arellano, and R. (Inald) L. Lagendjk TU Delft, Mekelweg 4, 68 CD Delft, The Netherlands
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationψ = i c i u i c i a i b i u i = i b 0 0 b 0 0
Quantum Mechancs, Advanced Course FMFN/FYSN7 Solutons Sheet Soluton. Lets denote the two operators by  and ˆB, the set of egenstates by { u }, and the egenvalues as  u = a u and ˆB u = b u. Snce the
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationLecture 7: Boltzmann distribution & Thermodynamics of mixing
Prof. Tbbtt Lecture 7 etworks & Gels Lecture 7: Boltzmann dstrbuton & Thermodynamcs of mxng 1 Suggested readng Prof. Mark W. Tbbtt ETH Zürch 13 März 018 Molecular Drvng Forces Dll and Bromberg: Chapters
More information