The Dirty MIMO Multiple-Access Channel

Size: px
Start display at page:

Download "The Dirty MIMO Multiple-Access Channel"

Transcription

1 The Dirty MIMO Multiple-Access Channel Anatoly Khina, Caltech Joint work with: Yuval Kochman, Hebrew University Uri Erez, Tel-Aviv University ISIT 2016 Barcelona, Catalonia, Spain July 12, 2016

2 Motivation: MIMO Dirty-Paper Channel

3 Motivation: MIMO Dirty Multiple-Access Channel

4 Multiple-Access Channel (MAC) Scenarios

5 Model Capacity region Single-Input Single-Output (SISO) MAC w 1 Encoder 1 x 1 z y Decoder ŵ 1,ŵ 2 w 2 Encoder 2 x 2 y = x 1 +x 2 +z x i Scalar input of Encoder i of power P i y Scalar output z White Gaussian noise N(0,1)

6 SISO Multiple-Access Channel Model Capacity region Capacity region [Ahleswede 71][Liao 72] R log(1+p 1) R log(1+p 2) R 1 +R log(1+p 1 +P 2 ) Capacity region at high SNRs R log(p 1) R log(p 2) R 1 +R log(p 1 +P 2 ) Sum-capacity strictly greater than individual capacities

7 The Dirty MAC Model Capacity region

8 SISO Dirty Multiple-Access Channel Model Capacity region s 1 z w 1 x 1 Encoder 1 y ŵ 1,ŵ 2 Decoder w 2 Encoder 2 x 2 s 2 y = x 1 +x 2 +s 1 +s 2 +z x i Scalar input of Encoder i of power P i s i Arbitrary side-information sequence known to Encoder i y Scalar output z White Gaussian noise N(0,1)

9 Model Capacity region SISO Dirty Multiple-Access Channel Random binning schemes are bad

10 SISO Dirty Multiple-Access Channel Model Capacity region Random binning schemes are bad Costa-like auxiliaries U i = X i +αs i achieve zero rate!

11 SISO Dirty Multiple-Access Channel Model Capacity region Random binning schemes are bad Costa-like auxiliaries U i = X i +αs i achieve zero rate! Structure can help!

12 SISO Dirty Multiple-Access Channel Model Capacity region Random binning schemes are bad Costa-like auxiliaries U i = X i +αs i achieve zero rate! Structure can help!

13 SISO Dirty Multiple-Access Channel Model Capacity region Random binning schemes are bad Costa-like auxiliaries U i = X i +αs i achieve zero rate! Structure can help! Achievable rate region using lattices [Philosof et al. IT 11] R 1 +R 2 1 ( ) 1 2 log 2 +min{p 1,P 2 } Outer region [Philosof et al. IT 11] R 1 +R log(1+min{p 1,P 2 }) DMAC capacity region at high SNR R 1 +R log(min{p 1,P 2 }) MAC sum-capacity at high SNR R 1 +R log(p 1 +P 2 )

14 Model Capacity region What about Multiple-Input Multiple-Output (MIMO)?

15 MIMO MAC Model Capacity region w 1 Encoder 1 x 1 H 1 z y Decoder ŵ 1,ŵ 2 w 2 Encoder 2 x 2 H 2 y = H 1 x 1 +H 2 x 2 + z x i N 1 input vector of Encoder i of power P i H i N N unit-determinant channel matrix of Encoder i y N 1 output vector z N 1 white Gaussian noise N(0,I N )

16 MIMO MAC Model Capacity region Capacity region [Yu PhD 02] tr{cx i } P i Cx i 0 (R 1,R 2 ) : R 1 1 I+H 2 log T 1 Cx 1 H T 1 R log I+H T 2 Cx 2 H T 2 R 1 +R log I+H T 1 Cx 1 H T 1 +H T 2 Cx 2 H T 2

17 MIMO MAC Model Capacity region Capacity is achieved using random coding Practical schemes based on matrix decompositions can be used SVD, QR decomposition, GMD,... Reduces MIMO coding task to coding over parallel SISO links Use good SISO codes to approach capacity

18 Dirty MIMO MAC Model Outer bound Direct SVD LQ JET Achievable s 1 z w 1 x 1 Encoder 1 H 1 y ŵ 1,ŵ 2 Decoder w 2 Encoder 2 H x 2 2 s 2 y = H 1 x 1 +H 2 x 2 + s 1 + s 2 + z x i N 1 input vector of Encoder i of power P i H i N N unit-determinant channel matrix of Encoder i s i Arbitrary side-information sequence known to Encoder i y output of length N z white Gaussian noise N(0,I N )

19 Dirty MIMO MAC Model Outer bound Direct SVD LQ JET Achievable Outer bound In SISO case: Sum-capacity { Individual capacities 1 R 1 +R 2 min 2 log(1+p 1), 1 } 2 log(1+p 2) Straightforward adaptation { for the MIMO case: 1 R 1 +R 2 min max Cx 1 :tr(cx 1 ) P 1 2 log I+H1 Cx 1 H T 1, 1 max Cx 1 :tr(cx 1 ) P 1 2 log I+H2 Cx 2 H T 2 High SNR: White inputs become optimal R 1 +R 2 1 { } 2 logmin P 1 N H 1H T 1, P 2 N H 2H T 2 = N ( ) 2 log min{p1,p 2 } N }

20 Dirty MIMO MAC Model Outer bound Direct SVD LQ JET Achievable How to approach the outer bound at high SNRs? Cannot use random coding/binning Achieves zero rate even in SISO case... Need to incorporate structure

21 Dirty MIMO MAC Model Outer bound Direct SVD LQ JET Achievable How to approach the outer bound at high SNRs? Cannot use random coding/binning Achieves zero rate even in SISO case... Need to incorporate structure Idea Use matrix decompositions + SISO lattice-based scheme

22 Model Outer bound Direct SVD LQ JET Achievable Singular Value Decomposition (SVD) Based Scheme? H 1 = Q 1 D 1 V T 1 H 2 = Q 2 D 2 V T 2 Q i,v i Orthogonal matrices D i Diagonal matrices Problem 1: Common left operation at decoder Decoder matrix Q i depends on channel matrix H i But Q is shared by both users: Q T y = Q T H 1 V 1 x 1 +Q H 2 V 2 x 2 +Qs 1 +Qs 2 +Qz? =D 1? =D 2 Problem 2: Rate/SNR bottleneck problem Even if H i are diagonal Rate limited by minimal diagonal value

23 Bottleneck Problem: Example P 1 = 60, H 1 = ( ) /2 Dirty MIMO point-to-point setting R log (30 1/2 2) 1.45 R log (30 2 2) 3.45 R tot = R 1 +R Model Outer bound Direct SVD LQ JET Achievable P 2 = 60, H 2 = ( ) 1/ Dirty MIMO point-to-point setting R log (30 2 2) 3.45 R log (30 1/2 2) 1.45 R tot = R 1 +R Dirty MIMO MAC setting R 1 1 { (min 2 log ,30 1/2 2}) 1.45 R 2 1 { (min 2 log 30 1/2 2,30 2 2}) 1.45 R tot = R 1 +R = 2.90 < 4.90

24 Bottleneck Problem: Example P 1 = 60, H 1 = ( ) /2 Dirty MIMO point-to-point setting R log (30 1/2 2) 1.45 R log (30 2 2) 3.45 R tot = R 1 +R Model Outer bound Direct SVD LQ JET Achievable P 2 = 60, H 2 = ( ) 1/ Dirty MIMO point-to-point setting R log (30 2 2) 3.45 R log (30 1/2 2) 1.45 R tot = R 1 +R Dirty MIMO MAC setting R 1 1 { (min 2 log , /2 2}) 1.91 R 2 1 { (min 2 log /2 2, }) 1.91 R tot = R 1 +R = 3.82 < 4.90

25 Model Outer bound Direct SVD LQ JET Achievable Resolving Problem 1 (Common Left Operation) X Joint diagonalization is not possible in general... LQ decomposition (QR decomposition transposed) H 1 = T 1 V T 1 H 2 = T 2 V T 2 T i Triangular matrices V i Orthogonal matrices Off-diagonal values treated as part of the side information Always possible No left matrix is needed Problem 1 solved! X But... diag(t 1 ) diag(t 2 ) Bottleneck problem! Can we make the diagonals equal?

26 Model Outer bound Direct SVD LQ JET Achievable Resolving Problem 1 (Common Left Operation) X Joint diagonalization is not possible in general... LQ decomposition (QR decomposition transposed) H 1 = I N T 1 V T 1 H 2 = I N T 2 V T 2 T i Triangular matrices V i Orthogonal matrices Off-diagonal values treated as part of the side information Always possible No left matrix is needed Problem 1 solved! X But... diag(t 1 ) diag(t 2 ) Bottleneck problem! Can we make the diagonals equal?

27 Resolving the Bottleneck Problem Model Outer bound Direct SVD LQ JET Achievable LQ decomposition did not use any left orthogonal matrix Use left orthogonal matrix to make diagonals equal! Joint Equi-diagonal Triangularization (JET) [Kh.-Kochman-Erez SP 12] H 1 = H 2 H 1 = QT 1 V1 T H 2 = QT 2 V2 T Q,V 1,V 2 Orthogonal matrices T 1,T 2 Triangular matrices diag(t 1 ) = diag(t 2 )

28 Resolving the Bottleneck Problem: Example Model Outer bound Direct SVD LQ JET Achievable H 1 = H 2 = ( ) 2 0 = 0 1/2 Q T 1 { (}} ){{ ( }} ) {{( }} ){ Q ( ) { (}} ){ ( {}} ) {{( }} ){ 1/ = T 2 V T 2 V T 1

29 Achievable Region Model Outer bound Direct SVD LQ JET Achievable Apply the JET to the channel matrices: (t 1,...,t N ) diag(t 1) = diag(t 2) Achievable rate region All (R 1,R 2 ) satisfying: R 1 +R 2 N 2 log ( min{p1,p 2 } N ) Proof R 1 +R 2 = N (r 1;j +r 2;j ) j=1 N j=1 ( { 1 min P1 2 log tj 2,P 2tj 2 N = N 2 log ( min{p1,p 2 } N ) +log }) N j=1 t j = H i =1

30 Achievable Region Model Outer bound Direct SVD LQ JET Achievable Apply the JET to the channel matrices: (t 1,...,t N ) diag(t 1) = diag(t 2) Achievable rate region All (R 1,R 2 ) satisfying: R 1 +R 2 N 2 log ( min{p1,p 2 } N Outer bound at high SNRs Capacity region at high SNRs R 1 +R 2 N 2 log ( min{p1,p 2 } N All (R 1,R 2 ) satisfying: R 1 +R 2 N 2 log ( min{p1,p 2 } N ) ) )

31 K-user Dirty MAC K-User General matrices SISO capacity at high SNRs [Philosof et al. IT 11] K R i 1 ( ) 2 log min P i i=1,...,k i=1 MIMO outer bound at high SNRs Again, sum-capacity individual capacities K R i N min 2 log N i=1 i=1,...,k P i Achievable rate region Problem: JET not possible for K > 2 matrices, in general

32 K-User General matrices K-user JET via Space Time Coding [Kh.-Livni-Hitron-Erez IT 15] H i = QT i V i Bunch two channel uses together: H {}} i Q T ( ) {{( }} ){{}} i {{ ( )( }} ) { Hi 0 Q 0 Ti 0 V = i 0 0 H i 0 Q 0 T i 0 V i H i have a block-diagonal structure Use general Q, V i (not block-diagonal): H i ( {}} ) { Hi 0 0 H i = ( Q ) ( Ti ) ( Vi ) Exploiting off-diagonal 0s enables JET of more users! X Edge effect: Fixed number of unbalanced parallel channels Negligible by processing together large number of channel uses X V i X

33 K-user Dirty MIMO MAC K-User General matrices Achievable rate region All (R 1,...,R K ) satisfying: K R i N 2 log i=1 min i=1,...,k P i N

34 K-user Dirty MIMO MAC K-User General matrices Achievable rate region All (R 1,...,R K ) satisfying: K R i N 2 log i=1 min i=1,...,k P i N Outer bound at high SNRs K R i N 2 log i=1 min Capacity region at high SNRs K All (R 1,R 2 ) satisfying: R i N 2 log i=1 i=1,...,k P i N min i=1,...,k P i N

35 General Matrices K-User General matrices Thus far, we considered N N full-rank matrices What about the more general case? Case 1: Interference and signal live in same subspace y = H 1 (x 1 + s 1 )+H 2 (x 2 + s 2 )+z The case of the two base-station motivating example Simple extension of the discussed solution Case 2: Signal limited to subspace; interference is not y = H 1 x 1 +H 2 x 2 + s 1 + s 2 + z Constructing a tight outer bound is more challenging Sum-rate bounding by the individual capacities seems loose

36 General Matrices K-User General matrices Example [ ] [ ] H 1 =, P = 100, H 2 =, P = 50 2 C ( ) log = log(50) C log(502 ) C 1 Current outer bound: R 1 +R 2 min{c 1,C 2 } log(50) Clearly not achievable... Proposed inner bound 1 Project onto common subspace 2 Apply previous result In example: Projection y 1 +y 2 achieves R 1 +R log(2 50)

Physical-Layer MIMO Relaying

Physical-Layer MIMO Relaying Model Gaussian SISO MIMO Gauss.-BC General. Physical-Layer MIMO Relaying Anatoly Khina, Tel Aviv University Joint work with: Yuval Kochman, MIT Uri Erez, Tel Aviv University August 5, 2011 Model Gaussian

More information

Anatoly Khina. Joint work with: Uri Erez, Ayal Hitron, Idan Livni TAU Yuval Kochman HUJI Gregory W. Wornell MIT

Anatoly Khina. Joint work with: Uri Erez, Ayal Hitron, Idan Livni TAU Yuval Kochman HUJI Gregory W. Wornell MIT Network Modulation: Transmission Technique for MIMO Networks Anatoly Khina Joint work with: Uri Erez, Ayal Hitron, Idan Livni TAU Yuval Kochman HUJI Gregory W. Wornell MIT ACC Workshop, Feder Family Award

More information

Incremental Coding over MIMO Channels

Incremental Coding over MIMO Channels Model Rateless SISO MIMO Applications Summary Incremental Coding over MIMO Channels Anatoly Khina, Tel Aviv University Joint work with: Yuval Kochman, MIT Uri Erez, Tel Aviv University Gregory W. Wornell,

More information

Simultaneous SDR Optimality via a Joint Matrix Decomp.

Simultaneous SDR Optimality via a Joint Matrix Decomp. Simultaneous SDR Optimality via a Joint Matrix Decomposition Joint work with: Yuval Kochman, MIT Uri Erez, Tel Aviv Uni. May 26, 2011 Model: Source Multicasting over MIMO Channels z 1 H 1 y 1 Rx1 ŝ 1 s

More information

Decomposing the MIMO Wiretap Channel

Decomposing the MIMO Wiretap Channel Decomposing the MIMO Wiretap Channel Anatoly Khina, Tel Aviv University Joint work with: Yuval Kochman, Hebrew University Ashish Khisti, University of Toronto ISIT 2014 Honolulu, Hawai i, USA June 30,

More information

Rematch and Forward: Joint Source-Channel Coding for Communications

Rematch and Forward: Joint Source-Channel Coding for Communications Background ρ = 1 Colored Problem Extensions Rematch and Forward: Joint Source-Channel Coding for Communications Anatoly Khina Joint work with: Yuval Kochman, Uri Erez, Ram Zamir Dept. EE - Systems, Tel

More information

Improved Rates and Coding for the MIMO Two-Way Relay Channel

Improved Rates and Coding for the MIMO Two-Way Relay Channel Improved Rates and Coding for the MIMO Two-Way Relay Channel Anatoly Khina Dept. of EE Systems, TAU Tel Aviv, Israel Email: anatolyk@eng.tau.ac.il Yuval Kochman School of CSE, HUJI Jerusalem, Israel Email:

More information

The Dirty MIMO Multiple-Access Channel

The Dirty MIMO Multiple-Access Channel The Dirty MIMO Multiple-Access Channel Anatoly Khina, Yuval Kochman, and Uri Erez Abstract In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals

More information

Improved Rates and Coding for the MIMO Two-Way Relay Channel

Improved Rates and Coding for the MIMO Two-Way Relay Channel Improved Rates and Coding for the MIMO Two-Way Relay Channel Anatoly Khina Dept. of EE Systems, TAU Tel Aviv, Israel Email: anatolyk@eng.tau.ac.il Yuval Kochman School of CSE, HUJI Jerusalem, Israel Email:

More information

Interference Alignment at Finite SNR for TI channels

Interference Alignment at Finite SNR for TI channels Interference Alignment at Finite SNR for Time-Invariant channels Or Ordentlich Joint work with Uri Erez EE-Systems, Tel Aviv University ITW 20, Paraty Background and previous work The 2-user Gaussian interference

More information

Incremental Coding over MIMO Channels

Incremental Coding over MIMO Channels Incremental Coding over MIMO Channels Anatoly Khina EE-Systems Dept, TAU Tel Aviv, Israel Email: anatolyk@engtauacil Yuval Kochman EECS Dept, MIT Cambridge, MA 02139, USA Email: yuvalko@mitedu Uri Erez

More information

The Robustness of Dirty Paper Coding and The Binary Dirty Multiple Access Channel with Common Interference

The Robustness of Dirty Paper Coding and The Binary Dirty Multiple Access Channel with Common Interference The and The Binary Dirty Multiple Access Channel with Common Interference Dept. EE - Systems, Tel Aviv University, Tel Aviv, Israel April 25th, 2010 M.Sc. Presentation The B/G Model Compound CSI Smart

More information

Sparse Regression Codes for Multi-terminal Source and Channel Coding

Sparse Regression Codes for Multi-terminal Source and Channel Coding Sparse Regression Codes for Multi-terminal Source and Channel Coding Ramji Venkataramanan Yale University Sekhar Tatikonda Allerton 2012 1 / 20 Compression with Side-Information X Encoder Rate R Decoder

More information

Linear Algebra (Review) Volker Tresp 2018

Linear Algebra (Review) Volker Tresp 2018 Linear Algebra (Review) Volker Tresp 2018 1 Vectors k, M, N are scalars A one-dimensional array c is a column vector. Thus in two dimensions, ( ) c1 c = c 2 c i is the i-th component of c c T = (c 1, c

More information

Joint Unitary Triangularization for MIMO Networks

Joint Unitary Triangularization for MIMO Networks 1 Joint Unitary Triangularization for MIMO Networks Anatoly Khina, Student Member, IEEE, Yuval Kochman, Member, IEEE, and Uri Erez, Member, IEEE Abstract This work considers communication networks where

More information

ACOMMUNICATION situation where a single transmitter

ACOMMUNICATION situation where a single transmitter IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 9, SEPTEMBER 2004 1875 Sum Capacity of Gaussian Vector Broadcast Channels Wei Yu, Member, IEEE, and John M. Cioffi, Fellow, IEEE Abstract This paper

More information

ELEC E7210: Communication Theory. Lecture 10: MIMO systems

ELEC E7210: Communication Theory. Lecture 10: MIMO systems ELEC E7210: Communication Theory Lecture 10: MIMO systems Matrix Definitions, Operations, and Properties (1) NxM matrix a rectangular array of elements a A. an 11 1....... a a 1M. NM B D C E ermitian transpose

More information

Binary Dirty MAC with Common State Information

Binary Dirty MAC with Common State Information Binary Dirty MAC with Common State Information Anatoly Khina Email: anatolyk@eng.tau.ac.il Tal Philosof Email: talp@eng.tau.ac.il Ram Zamir Email: zamir@eng.tau.ac.il Uri Erez Email: uri@eng.tau.ac.il

More information

Information Theory for Wireless Communications, Part II:

Information Theory for Wireless Communications, Part II: Information Theory for Wireless Communications, Part II: Lecture 5: Multiuser Gaussian MIMO Multiple-Access Channel Instructor: Dr Saif K Mohammed Scribe: Johannes Lindblom In this lecture, we give the

More information

Lecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH

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

Duality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels

Duality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels 2658 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 49, NO 10, OCTOBER 2003 Duality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels Sriram Vishwanath, Student Member, IEEE, Nihar

More information

Linear Algebra (Review) Volker Tresp 2017

Linear Algebra (Review) Volker Tresp 2017 Linear Algebra (Review) Volker Tresp 2017 1 Vectors k is a scalar (a number) c is a column vector. Thus in two dimensions, c = ( c1 c 2 ) (Advanced: More precisely, a vector is defined in a vector space.

More information

12.4 Known Channel (Water-Filling Solution)

12.4 Known Channel (Water-Filling Solution) ECEn 665: Antennas and Propagation for Wireless Communications 54 2.4 Known Channel (Water-Filling Solution) The channel scenarios we have looed at above represent special cases for which the capacity

More information

Sum Capacity of Gaussian Vector Broadcast Channels

Sum Capacity of Gaussian Vector Broadcast Channels Sum Capacity of Gaussian Vector Broadcast Channels Wei Yu, Member IEEE and John M. Cioffi, Fellow IEEE Abstract This paper characterizes the sum capacity of a class of potentially non-degraded Gaussian

More information

Degrees of Freedom Region of the Gaussian MIMO Broadcast Channel with Common and Private Messages

Degrees of Freedom Region of the Gaussian MIMO Broadcast Channel with Common and Private Messages Degrees of Freedom Region of the Gaussian MIMO Broadcast hannel with ommon and Private Messages Ersen Ekrem Sennur Ulukus Department of Electrical and omputer Engineering University of Maryland, ollege

More information

Shannon meets Wiener II: On MMSE estimation in successive decoding schemes

Shannon meets Wiener II: On MMSE estimation in successive decoding schemes Shannon meets Wiener II: On MMSE estimation in successive decoding schemes G. David Forney, Jr. MIT Cambridge, MA 0239 USA forneyd@comcast.net Abstract We continue to discuss why MMSE estimation arises

More information

Decode-and-Forward Relaying via Standard AWGN Coding and Decoding

Decode-and-Forward Relaying via Standard AWGN Coding and Decoding 1 Decode-and-Forward Relaying via tandard AWGN Coding and Decoding Anatoly Khina, tudent Member, IEEE, Yuval Kochman, Member, IEEE, Uri Erez, Member, IEEE, and Gregory W. Wornell, Fellow, IEEE Abstract

More information

Single-User MIMO systems: Introduction, capacity results, and MIMO beamforming

Single-User MIMO systems: Introduction, capacity results, and MIMO beamforming Single-User MIMO systems: Introduction, capacity results, and MIMO beamforming Master Universitario en Ingeniería de Telecomunicación I. Santamaría Universidad de Cantabria Contents Introduction Multiplexing,

More information

Lecture 8: MIMO Architectures (II) Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH

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 information

K User Interference Channel with Backhaul

K User Interference Channel with Backhaul 1 K User Interference Channel with Backhaul Cooperation: DoF vs. Backhaul Load Trade Off Borna Kananian,, Mohammad A. Maddah-Ali,, Babak H. Khalaj, Department of Electrical Engineering, Sharif University

More information

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column

More information

Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel

Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu

More information

Harnessing Interaction in Bursty Interference Networks

Harnessing Interaction in Bursty Interference Networks 215 IEEE Hong Kong-Taiwan Joint Workshop on Information Theory and Communications Harnessing Interaction in Bursty Interference Networks I-Hsiang Wang NIC Lab, NTU GICE 1/19, 215 Modern Wireless: Grand

More information

Lecture 7 MIMO Communica2ons

Lecture 7 MIMO Communica2ons Wireless Communications Lecture 7 MIMO Communica2ons Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Fall 2014 1 Outline MIMO Communications (Chapter 10

More information

Lecture 6: Modeling of MIMO Channels Theoretical Foundations of Wireless Communications 1

Lecture 6: Modeling of MIMO Channels Theoretical Foundations of Wireless Communications 1 Fading : Theoretical Foundations of Wireless Communications 1 Thursday, May 3, 2018 9:30-12:00, Conference Room SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication 1 / 23 Overview

More information

Approximately achieving the feedback interference channel capacity with point-to-point codes

Approximately achieving the feedback interference channel capacity with point-to-point codes Approximately achieving the feedback interference channel capacity with point-to-point codes Joyson Sebastian*, Can Karakus*, Suhas Diggavi* Abstract Superposition codes with rate-splitting have been used

More information

Linear Algebra Review. Vectors

Linear Algebra Review. Vectors Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors

More information

Lecture 6: Modeling of MIMO Channels Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH

Lecture 6: Modeling of MIMO Channels Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH : Theoretical Foundations of Wireless Communications 1 Wednesday, May 11, 2016 9:00-12:00, Conference Room SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication 1 / 1 Overview

More information

On Gaussian MIMO Broadcast Channels with Common and Private Messages

On Gaussian MIMO Broadcast Channels with Common and Private Messages On Gaussian MIMO Broadcast Channels with Common and Private Messages Ersen Ekrem Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 20742 ersen@umd.edu

More information

Applied Linear Algebra in Geoscience Using MATLAB

Applied Linear Algebra in Geoscience Using MATLAB Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in

More information

Error Exponent Region for Gaussian Broadcast Channels

Error Exponent Region for Gaussian Broadcast Channels Error Exponent Region for Gaussian Broadcast Channels Lihua Weng, S. Sandeep Pradhan, and Achilleas Anastasopoulos Electrical Engineering and Computer Science Dept. University of Michigan, Ann Arbor, MI

More information

Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function

Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function Dinesh Krithivasan and S. Sandeep Pradhan Department of Electrical Engineering and Computer Science,

More information

Applied Mathematics 205. Unit II: Numerical Linear Algebra. Lecturer: Dr. David Knezevic

Applied Mathematics 205. Unit II: Numerical Linear Algebra. Lecturer: Dr. David Knezevic Applied Mathematics 205 Unit II: Numerical Linear Algebra Lecturer: Dr. David Knezevic Unit II: Numerical Linear Algebra Chapter II.3: QR Factorization, SVD 2 / 66 QR Factorization 3 / 66 QR Factorization

More information

On the Duality between Multiple-Access Codes and Computation Codes

On the Duality between Multiple-Access Codes and Computation Codes On the Duality between Multiple-Access Codes and Computation Codes Jingge Zhu University of California, Berkeley jingge.zhu@berkeley.edu Sung Hoon Lim KIOST shlim@kiost.ac.kr Michael Gastpar EPFL michael.gastpar@epfl.ch

More information

Blind MIMO communication based on Subspace Estimation

Blind MIMO communication based on Subspace Estimation Blind MIMO communication based on Subspace Estimation T. Dahl, S. Silva, N. Christophersen, D. Gesbert T. Dahl, S. Silva, and N. Christophersen are at the Department of Informatics, University of Oslo,

More information

Applications of Lattices in Telecommunications

Applications of Lattices in Telecommunications Applications of Lattices in Telecommunications Dept of Electrical and Computer Systems Engineering Monash University amin.sakzad@monash.edu Oct. 2013 1 Sphere Decoder Algorithm Rotated Signal Constellations

More information

HetNets: what tools for analysis?

HetNets: what tools for analysis? HetNets: what tools for analysis? Daniela Tuninetti (Ph.D.) Email: danielat@uic.edu Motivation Seven Ways that HetNets are a Cellular Paradigm Shift, by J. Andrews, IEEE Communications Magazine, March

More information

The Capacity Region of the Gaussian Cognitive Radio Channels at High SNR

The Capacity Region of the Gaussian Cognitive Radio Channels at High SNR The Capacity Region of the Gaussian Cognitive Radio Channels at High SNR 1 Stefano Rini, Daniela Tuninetti and Natasha Devroye srini2, danielat, devroye @ece.uic.edu University of Illinois at Chicago Abstract

More information

CHANNEL FEEDBACK QUANTIZATION METHODS FOR MISO AND MIMO SYSTEMS

CHANNEL FEEDBACK QUANTIZATION METHODS FOR MISO AND MIMO SYSTEMS CHANNEL FEEDBACK QUANTIZATION METHODS FOR MISO AND MIMO SYSTEMS June Chul Roh and Bhaskar D Rao Department of Electrical and Computer Engineering University of California, San Diego La Jolla, CA 9293 47,

More information

On the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation

On the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation On the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation Mehdi Ashraphijuo, Vaneet Aggarwal and Xiaodong Wang 1 arxiv:1308.3310v1 [cs.it] 15 Aug 2013

More information

Transmitter optimization for distributed Gaussian MIMO channels

Transmitter optimization for distributed Gaussian MIMO channels Transmitter optimization for distributed Gaussian MIMO channels Hon-Fah Chong Electrical & Computer Eng Dept National University of Singapore Email: chonghonfah@ieeeorg Mehul Motani Electrical & Computer

More information

Generalized Writing on Dirty Paper

Generalized Writing on Dirty Paper Generalized Writing on Dirty Paper Aaron S. Cohen acohen@mit.edu MIT, 36-689 77 Massachusetts Ave. Cambridge, MA 02139-4307 Amos Lapidoth lapidoth@isi.ee.ethz.ch ETF E107 ETH-Zentrum CH-8092 Zürich, Switzerland

More information

Cognitive Multiple Access Networks

Cognitive Multiple Access Networks Cognitive Multiple Access Networks Natasha Devroye Email: ndevroye@deas.harvard.edu Patrick Mitran Email: mitran@deas.harvard.edu Vahid Tarokh Email: vahid@deas.harvard.edu Abstract A cognitive radio can

More information

Upper Bounds on MIMO Channel Capacity with Channel Frobenius Norm Constraints

Upper Bounds on MIMO Channel Capacity with Channel Frobenius Norm Constraints Upper Bounds on IO Channel Capacity with Channel Frobenius Norm Constraints Zukang Shen, Jeffrey G. Andrews, Brian L. Evans Wireless Networking Communications Group Department of Electrical Computer Engineering

More information

Multi-User Communication: Capacity, Duality, and Cooperation. Nihar Jindal Stanford University Dept. of Electrical Engineering

Multi-User Communication: Capacity, Duality, and Cooperation. Nihar Jindal Stanford University Dept. of Electrical Engineering Multi-User Communication: Capacity, Duality, and Cooperation Niar Jindal Stanford University Dept. of Electrical Engineering February 3, 004 Wireless Communication Vision Cellular Networks Wireless LAN

More information

Orthonormal Bases; Gram-Schmidt Process; QR-Decomposition

Orthonormal Bases; Gram-Schmidt Process; QR-Decomposition Orthonormal Bases; Gram-Schmidt Process; QR-Decomposition MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 205 Motivation When working with an inner product space, the most

More information

Interference Channel aided by an Infrastructure Relay

Interference Channel aided by an Infrastructure Relay Interference Channel aided by an Infrastructure Relay Onur Sahin, Osvaldo Simeone, and Elza Erkip *Department of Electrical and Computer Engineering, Polytechnic Institute of New York University, Department

More information

EE731 Lecture Notes: Matrix Computations for Signal Processing

EE731 Lecture Notes: Matrix Computations for Signal Processing EE731 Lecture Notes: Matrix Computations for Signal Processing James P. Reilly c Department of Electrical and Computer Engineering McMaster University September 22, 2005 0 Preface This collection of ten

More information

Matrix decompositions

Matrix decompositions Matrix decompositions Zdeněk Dvořák May 19, 2015 Lemma 1 (Schur decomposition). If A is a symmetric real matrix, then there exists an orthogonal matrix Q and a diagonal matrix D such that A = QDQ T. The

More information

Dirty Paper Coding vs. TDMA for MIMO Broadcast Channels

Dirty Paper Coding vs. TDMA for MIMO Broadcast Channels TO APPEAR IEEE INTERNATIONAL CONFERENCE ON COUNICATIONS, JUNE 004 1 Dirty Paper Coding vs. TDA for IO Broadcast Channels Nihar Jindal & Andrea Goldsmith Dept. of Electrical Engineering, Stanford University

More information

When does vectored Multiple Access Channels (MAC) optimal power allocation converge to an FDMA solution?

When does vectored Multiple Access Channels (MAC) optimal power allocation converge to an FDMA solution? When does vectored Multiple Access Channels MAC optimal power allocation converge to an FDMA solution? Vincent Le Nir, Marc Moonen, Jan Verlinden, Mamoun Guenach Abstract Vectored Multiple Access Channels

More information

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 2, FEBRUARY Uplink Downlink Duality Via Minimax Duality. Wei Yu, Member, IEEE (1) (2)

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 2, FEBRUARY Uplink Downlink Duality Via Minimax Duality. Wei Yu, Member, IEEE (1) (2) IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 2, FEBRUARY 2006 361 Uplink Downlink Duality Via Minimax Duality Wei Yu, Member, IEEE Abstract The sum capacity of a Gaussian vector broadcast channel

More information

FINITE-DIMENSIONAL LINEAR ALGEBRA

FINITE-DIMENSIONAL LINEAR ALGEBRA DISCRETE MATHEMATICS AND ITS APPLICATIONS Series Editor KENNETH H ROSEN FINITE-DIMENSIONAL LINEAR ALGEBRA Mark S Gockenbach Michigan Technological University Houghton, USA CRC Press Taylor & Francis Croup

More information

Lecture 6. Numerical methods. Approximation of functions

Lecture 6. Numerical methods. Approximation of functions Lecture 6 Numerical methods Approximation of functions Lecture 6 OUTLINE 1. Approximation and interpolation 2. Least-square method basis functions design matrix residual weighted least squares normal equation

More information

Input Optimization for Multi-Antenna Broadcast Channels with Per-Antenna Power Constraints

Input Optimization for Multi-Antenna Broadcast Channels with Per-Antenna Power Constraints Input Optimization for Multi-Antenna Broadcast Channels with Per-Antenna Power Constraints Tian Lan and Wei Yu Electrical and Computer Engineering Department University of Toronto, Toronto, Ontario M5S

More information

MMSE estimation and lattice encoding/decoding for linear Gaussian channels. Todd P. Coleman /22/02

MMSE estimation and lattice encoding/decoding for linear Gaussian channels. Todd P. Coleman /22/02 MMSE estimation and lattice encoding/decoding for linear Gaussian channels Todd P. Coleman 6.454 9/22/02 Background: the AWGN Channel Y = X + N where N N ( 0, σ 2 N ), 1 n ni=1 X 2 i P X. Shannon: capacity

More information

Under sum power constraint, the capacity of MIMO channels

Under sum power constraint, the capacity of MIMO channels IEEE TRANSACTIONS ON COMMUNICATIONS, VOL 6, NO 9, SEPTEMBER 22 242 Iterative Mode-Dropping for the Sum Capacity of MIMO-MAC with Per-Antenna Power Constraint Yang Zhu and Mai Vu Abstract We propose an

More information

Index. book 2009/5/27 page 121. (Page numbers set in bold type indicate the definition of an entry.)

Index. book 2009/5/27 page 121. (Page numbers set in bold type indicate the definition of an entry.) page 121 Index (Page numbers set in bold type indicate the definition of an entry.) A absolute error...26 componentwise...31 in subtraction...27 normwise...31 angle in least squares problem...98,99 approximation

More information

Broadcasting over Fading Channelswith Mixed Delay Constraints

Broadcasting over Fading Channelswith Mixed Delay Constraints Broadcasting over Fading Channels with Mixed Delay Constraints Shlomo Shamai (Shitz) Department of Electrical Engineering, Technion - Israel Institute of Technology Joint work with Kfir M. Cohen and Avi

More information

Trust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems

Trust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems Introduction Main Results Simulation Conclusions Trust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems Mojtaba Vaezi joint work with H. Inaltekin, W. Shin, H. V. Poor, and

More information

MATH 581D FINAL EXAM Autumn December 12, 2016

MATH 581D FINAL EXAM Autumn December 12, 2016 MATH 58D FINAL EXAM Autumn 206 December 2, 206 NAME: SIGNATURE: Instructions: there are 6 problems on the final. Aim for solving 4 problems, but do as much as you can. Partial credit will be given on all

More information

820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 2, FEBRUARY Stefano Rini, Daniela Tuninetti, and Natasha Devroye

820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 2, FEBRUARY Stefano Rini, Daniela Tuninetti, and Natasha Devroye 820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 2, FEBRUARY 2012 Inner and Outer Bounds for the Gaussian Cognitive Interference Channel and New Capacity Results Stefano Rini, Daniela Tuninetti,

More information

Samah A. M. Ghanem, Member, IEEE, Abstract

Samah A. M. Ghanem, Member, IEEE, Abstract Multiple Access Gaussian Channels with Arbitrary Inputs: Optimal Precoding and Power Allocation Samah A. M. Ghanem, Member, IEEE, arxiv:4.0446v2 cs.it] 6 Nov 204 Abstract In this paper, we derive new closed-form

More information

Efficient Inverse Cholesky Factorization for Alamouti Matrices in G-STBC and Alamouti-like Matrices in OMP

Efficient Inverse Cholesky Factorization for Alamouti Matrices in G-STBC and Alamouti-like Matrices in OMP Efficient Inverse Cholesky Factorization for Alamouti Matrices in G-STBC and Alamouti-like Matrices in OMP Hufei Zhu, Ganghua Yang Communications Technology Laboratory Huawei Technologies Co Ltd, P R China

More information

Properties of Matrices and Operations on Matrices

Properties of Matrices and Operations on Matrices Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,

More information

Lattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm

Lattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm Lattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm HongSun An Student Member IEEE he Graduate School of I & Incheon Korea ahs3179@gmail.com Manar Mohaisen Student Member IEEE

More information

VECTOR QUANTIZATION TECHNIQUES FOR MULTIPLE-ANTENNA CHANNEL INFORMATION FEEDBACK

VECTOR QUANTIZATION TECHNIQUES FOR MULTIPLE-ANTENNA CHANNEL INFORMATION FEEDBACK VECTOR QUANTIZATION TECHNIQUES FOR MULTIPLE-ANTENNA CHANNEL INFORMATION FEEDBACK June Chul Roh and Bhaskar D. Rao Department of Electrical and Computer Engineering University of California, San Diego La

More information

Interactive Interference Alignment

Interactive Interference Alignment Interactive Interference Alignment Quan Geng, Sreeram annan, and Pramod Viswanath Coordinated Science Laboratory and Dept. of ECE University of Illinois, Urbana-Champaign, IL 61801 Email: {geng5, kannan1,

More information

Multiuser MISO Transmitter Optimization for Inter-Cell Interference Mitigation

Multiuser MISO Transmitter Optimization for Inter-Cell Interference Mitigation Multiuser MISO Transmitter Optimization for Inter-Cell Interference Mitigation Hoon Huh, Student Member, IEEE, Haralabos C. Papadopoulos, Member, IEEE, and Giuseppe Caire, Fellow, IEEE Abstract The transmitter

More information

An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel

An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 4, APRIL 2012 2427 An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel Ersen Ekrem, Student Member, IEEE,

More information

The University of Texas at Austin Department of Electrical and Computer Engineering. EE381V: Large Scale Learning Spring 2013.

The University of Texas at Austin Department of Electrical and Computer Engineering. EE381V: Large Scale Learning Spring 2013. The University of Texas at Austin Department of Electrical and Computer Engineering EE381V: Large Scale Learning Spring 2013 Assignment Two Caramanis/Sanghavi Due: Tuesday, Feb. 19, 2013. Computational

More information

Degrees of Freedom of Rank-Deficient MIMO Interference Channels

Degrees of Freedom of Rank-Deficient MIMO Interference Channels IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 6, NO, JANUARY 05 34 Degrees of Freedom of Rank-Deficient MIMO Interference Channels Sundar R Krishnamurthy, Student Member, IEEE, AbineshRamakrishnan,Student

More information

Half-Duplex Gaussian Relay Networks with Interference Processing Relays

Half-Duplex Gaussian Relay Networks with Interference Processing Relays Half-Duplex Gaussian Relay Networks with Interference Processing Relays Bama Muthuramalingam Srikrishna Bhashyam Andrew Thangaraj Department of Electrical Engineering Indian Institute of Technology Madras

More information

DS-GA 1002 Lecture notes 10 November 23, Linear models

DS-GA 1002 Lecture notes 10 November 23, Linear models DS-GA 2 Lecture notes November 23, 2 Linear functions Linear models A linear model encodes the assumption that two quantities are linearly related. Mathematically, this is characterized using linear functions.

More information

Multi-User Gain Maximum Eigenmode Beamforming, and IDMA. Peng Wang and Li Ping City University of Hong Kong

Multi-User Gain Maximum Eigenmode Beamforming, and IDMA. Peng Wang and Li Ping City University of Hong Kong Multi-User Gain Maximum Eigenmode Beamforming, and IDMA Peng Wang and Li Ping City University of Hong Kong 1 Contents Introduction Multi-user gain (MUG) Maximum eigenmode beamforming (MEB) MEB performance

More information

Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems

Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User

More information

arxiv: v1 [cs.it] 4 Jun 2018

arxiv: v1 [cs.it] 4 Jun 2018 State-Dependent Interference Channel with Correlated States 1 Yunhao Sun, 2 Ruchen Duan, 3 Yingbin Liang, 4 Shlomo Shamai (Shitz) 5 Abstract arxiv:180600937v1 [csit] 4 Jun 2018 This paper investigates

More information

Competition and Cooperation in Multiuser Communication Environments

Competition and Cooperation in Multiuser Communication Environments Competition and Cooperation in Multiuser Communication Environments Wei Yu Electrical Engineering Department Stanford University April, 2002 Wei Yu, Stanford University Introduction A multiuser communication

More information

Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets

Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets Shivaprasad Kotagiri and J. Nicholas Laneman Department of Electrical Engineering University of Notre Dame Notre Dame,

More information

Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems

Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User

More information

Augmented Lattice Reduction for MIMO decoding

Augmented Lattice Reduction for MIMO decoding Augmented Lattice Reduction for MIMO decoding LAURA LUZZI joint work with G. Rekaya-Ben Othman and J.-C. Belfiore at Télécom-ParisTech NANYANG TECHNOLOGICAL UNIVERSITY SEPTEMBER 15, 2010 Laura Luzzi Augmented

More information

Capacity Region of the Two-Way Multi-Antenna Relay Channel with Analog Tx-Rx Beamforming

Capacity Region of the Two-Way Multi-Antenna Relay Channel with Analog Tx-Rx Beamforming Capacity Region of the Two-Way Multi-Antenna Relay Channel with Analog Tx-Rx Beamforming Authors: Christian Lameiro, Alfredo Nazábal, Fouad Gholam, Javier Vía and Ignacio Santamaría University of Cantabria,

More information

Degrees-of-Freedom for the 4-User SISO Interference Channel with Improper Signaling

Degrees-of-Freedom for the 4-User SISO Interference Channel with Improper Signaling Degrees-of-Freedom for the -User SISO Interference Channel with Improper Signaling C Lameiro and I Santamaría Dept of Communications Engineering University of Cantabria 9005 Santander Cantabria Spain Email:

More information

CS168: The Modern Algorithmic Toolbox Lecture #7: Understanding Principal Component Analysis (PCA)

CS168: The Modern Algorithmic Toolbox Lecture #7: Understanding Principal Component Analysis (PCA) CS68: The Modern Algorithmic Toolbox Lecture #7: Understanding Principal Component Analysis (PCA) Tim Roughgarden & Gregory Valiant April 0, 05 Introduction. Lecture Goal Principal components analysis

More information

ECE Information theory Final (Fall 2008)

ECE Information theory Final (Fall 2008) ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1

More information

Information Dimension

Information Dimension Information Dimension Mina Karzand Massachusetts Institute of Technology November 16, 2011 1 / 26 2 / 26 Let X would be a real-valued random variable. For m N, the m point uniform quantized version of

More information

THE practical bottleneck of today s communication networks

THE practical bottleneck of today s communication networks 1 Interference Channel with Generalized Feedback (a.k.a. with source cooperation: Part I: Achievable Region Shuang (Echo Yang and Daniela Tuninetti Abstract An Interference Channel with Generalized Feedback

More information

On the K-user Cognitive Interference Channel with Cumulative Message Sharing Sum-Capacity

On the K-user Cognitive Interference Channel with Cumulative Message Sharing Sum-Capacity 03 EEE nternational Symposium on nformation Theory On the K-user Cognitive nterference Channel with Cumulative Message Sharing Sum-Capacity Diana Maamari, Daniela Tuninetti and Natasha Devroye Department

More information

IV. Matrix Approximation using Least-Squares

IV. Matrix Approximation using Least-Squares IV. Matrix Approximation using Least-Squares The SVD and Matrix Approximation We begin with the following fundamental question. Let A be an M N matrix with rank R. What is the closest matrix to A that

More information

Problem 1. CS205 Homework #2 Solutions. Solution

Problem 1. CS205 Homework #2 Solutions. Solution CS205 Homework #2 s Problem 1 [Heath 3.29, page 152] Let v be a nonzero n-vector. The hyperplane normal to v is the (n-1)-dimensional subspace of all vectors z such that v T z = 0. A reflector is a linear

More information