TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAAAAAA Antonia Tulino Università degli Studi di Napoli Chautauqua.

Slides:



Advertisements
Similar presentations
Random Processes Introduction (2)
Advertisements

Capacity of MIMO Channels: Asymptotic Evaluation Under Correlated Fading Presented by: Zhou Yuan University of Houston 10/22/2009.
C&O 355 Mathematical Programming Fall 2010 Lecture 9
Underwater Acoustic MIMO Channel Capacity
MIMO Communication Systems
1 Multi-user Detection Gwo-Ruey Lee. Wireless Access Tech. Lab. CCU Wireless Access Tech. Lab. 2 Outlines Multiple Access Communication Synchronous CDMA.
Random Matrices, Integrals and Space-time Systems Babak Hassibi California Institute of Technology DIMACS Workshop on Algebraic Coding and Information.
CWIT Robust Entropy Rate for Uncertain Sources: Applications to Communication and Control Systems Charalambos D. Charalambous Dept. of Electrical.
Chapter 6 Information Theory
Capacity of Multi-antenna Guassian Channels Introduction: Single user with multiple antennas at transmitter and receiver. Higher data rate Limited bandwidth.
Three Lessons Learned Never discard information prematurely Compression can be separated from channel transmission with no loss of optimality Gaussian.
Random Matrices Hieu D. Nguyen Rowan University Rowan Math Seminar
Location Estimation in Sensor Networks Moshe Mishali.
Multiple-input multiple-output (MIMO) communication systems
3/23/04 1 Information Rates for Two-Dimensional ISI Channels Jiangxin Chen and Paul H. Siegel Center for Magnetic Recording Research University of California,
5: Capacity of Wireless Channels Fundamentals of Wireless Communication, Tse&Viswanath 1 5. Capacity of Wireless Channels.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
Review of Probability and Random Processes
Linear Codes for Distributed Source Coding: Reconstruction of a Function of the Sources -D. Krithivasan and S. Sandeep Pradhan -University of Michigan,
Capacity of multi-antenna Gaussian Channels, I. E. Telatar By: Imad Jabbour MIT May 11, 2006.
Noise, Information Theory, and Entropy
ECE 480 Wireless Systems Lecture 14 Problem Session 26 Apr 2006.
Review of Probability.
Noise, Information Theory, and Entropy
Noise and SNR. Noise unwanted signals inserted between transmitter and receiver is the major limiting factor in communications system performance 2.
MIMO Multiple Input Multiple Output Communications © Omar Ahmad
INFORMATION THEORY BYK.SWARAJA ASSOCIATE PROFESSOR MREC.
Wireless Communication Elec 534 Set IV October 23, 2007
Resource Allocation for E-healthcare Applications
Principles of Pattern Recognition
ECE 8443 – Pattern Recognition LECTURE 03: GAUSSIAN CLASSIFIERS Objectives: Normal Distributions Whitening Transformations Linear Discriminants Resources.
Week 2ELE Adaptive Signal Processing 1 STOCHASTIC PROCESSES AND MODELS.
Mathematical Preliminaries. 37 Matrix Theory Vectors nth element of vector u : u(n) Matrix mth row and nth column of A : a(m,n) column vector.
Least SquaresELE Adaptive Signal Processing 1 Method of Least Squares.
Method of Least Squares. Least Squares Method of Least Squares:  Deterministic approach The inputs u(1), u(2),..., u(N) are applied to the system The.
Transmit Diversity with Channel Feedback Krishna K. Mukkavilli, Ashutosh Sabharwal, Michael Orchard and Behnaam Aazhang Department of Electrical and Computer.
Channel Capacity.
Extremal Problems of Information Combining Alexei Ashikhmin  Information Combining: formulation of the problem  Mutual Information Function for the Single.
C&O 355 Mathematical Programming Fall 2010 Lecture 18 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
JWITC 2013Jan. 19, On the Capacity of Distributed Antenna Systems Lin Dai City University of Hong Kong.
EE 6332, Spring, 2014 Wireless Communication Zhu Han Department of Electrical and Computer Engineering Class 11 Feb. 19 th, 2014.
Wireless Communication Elec 534 Set I September 9, 2007 Behnaam Aazhang.
Weikang Qian. Outline Intersection Pattern and the Problem Motivation Solution 2.
The process has correlation sequence Correlation and Spectral Measure where, the adjoint of is defined by The process has spectral measure where.
CHAPTER 5 SIGNAL SPACE ANALYSIS
University of Houston Cullen College of Engineering Electrical & Computer Engineering Capacity Scaling in MIMO Wireless System Under Correlated Fading.
Part 3: Channel Capacity
MULTICELL UPLINK SPECTRAL EFFICIENCY OF CODED DS- CDMA WITH RANDOM SIGNATURES By: Benjamin M. Zaidel, Shlomo Shamai, Sergio Verdu Presented By: Ukash Nakarmi.
Linear Subspace Transforms PCA, Karhunen- Loeve, Hotelling C306, 2000.
Limits On Wireless Communication In Fading Environment Using Multiple Antennas Presented By Fabian Rozario ECE Department Paper By G.J. Foschini and M.J.
Dept. of EE, NDHU 1 Chapter One Signals and Spectra.
Spectral Efficiency of MC-CDMA: Linear and Non-Linear Receivers Aditya Gupta 11/05/2209.
ECE 4710: Lecture #31 1 System Performance  Chapter 7: Performance of Communication Systems Corrupted by Noise  Important Practical Considerations: 
Spectrum Sensing In Cognitive Radio Networks
Baseband Receiver Receiver Design: Demodulation Matched Filter Correlator Receiver Detection Max. Likelihood Detector Probability of Error.
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
1 Review of Probability and Random Processes. 2 Importance of Random Processes Random variables and processes talk about quantities and signals which.
Performance of Digital Communications System
- A Maximum Likelihood Approach Vinod Kumar Ramachandran ID:
Chapter 6 Random Processes
Linear Equations in Linear Algebra
Matrices and vector spaces
Advanced Wireless Networks
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband.
Lecture 1.30 Structure of the optimal receiver deterministic signals.
Design of Multiple Antenna Coding Schemes with Channel Feedback
DSSS Multiple Access Channel (Cont.)
Linear Equations in Linear Algebra
Whitening-Rotation Based MIMO Channel Estimation
16. Mean Square Estimation
Presentation transcript:

TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAAAAAA Antonia Tulino Università degli Studi di Napoli Chautauqua Park, Boulder, Colorado, July 17, 2008 Workshop on Random Matrix Theory and Wireless Communications Bridging the Gaps: Free Probability and Channel Capacity

Linear Vector Channel N -dimensional output noise=AWGN+interference K -dimensional input (N  K) channel matrix Variety of communication problems by simply reinterpreting K, N, and H  Fading  Wideband  Multiuser  Multiantenna

Role of the Singular Values Mutual Information: Ergodic case: Non-Ergodic case:

Role of the Singular Values Minumum Mean-Square Error (MMSE) :

H-Model  Independent and Identically distributed entries  Separable Correlation Model  UIU-Model with independent arbitrary distrbuted entries  with which is uniformly distributed over the manifold of complex matrices such that

ISI Channels with Fading Fading channel Motivation:  fading and/or jamming (wireless)  cellular system with unreliable wired infrastructure  impulse noise (power lines and DSL)  faulty transducers (sensor networks)  Randomly spread multicarrier CDMA channel with fading

ISI Channels with Fading Fading channel

Flat Fading & Deterministic ISI: Gaussian Erasure Channels Random erasure mechanisms:  link congestion/failure (networks)  cellular system with unreliable wired infrastructure  impulse noise (DSL)  faulty transducers (sensor networks)

d-Fold Vandermonde Matrix i.i.d. with uniform distribution in [0, 1] d distribution in [0, 1] d,  Sensor networks  Multiantenna multiuser communications  Detection of distributed Targets

Flat Fading & Deterministic ISI: an i.i.d sequence

Formulation = asymptotically circulant matrix (stationary input (with PSD ) = asymptotically circulant matrix (stationary input (with PSD ) = asymptotically circulant matrix Grenander -Szego theorem Eigenvalues of 

Formulation = asymptotically circulant matrix (stationary input (with PSD ) = asymptotically circulant matrix (stationary input (with PSD ) = asymptotically circulant matrix Grenander -Szego theorem Eigenvalues of 

& |A i | =1 Deterministic ISI & |A i | =1 where is the waterfilling input power spectral density given by: the water level is chosen so that: the water level is chosen so that: Key Tool : Grenander-Szego theorem on the distribution of the eigenvalues of Key Tool : Grenander-Szego theorem on the distribution of the eigenvalues of large Toeplitz matrices large Toeplitz matrices

  = asymptotically circulant matrix  A = random diagonal fading matrix Key Question : The distribution of the eigenvalues of a large-dimensional random matrix: & Flat Fading Deterministic ISI & Flat Fading

A i =e i ={0,1} Key Question : The distribution of the eigenvalues of a large-dimensional random matrix:   = asymptotically circulant matrix  E = random diagonal matrix

RANDOM MATRIX THEORY :  - & Shannon-Transform The  - and Shannon-transform of an nonnegative definite random matrix, with asymptotic ESD with X a nonnegative random variable whose distribution is while  is a nonnegative real number. with X a nonnegative random variable whose distribution is while  is a nonnegative real number. A. M. Tulino and S. Verdú “Random Matrices and Wireless Communications,” Foundations and Trends in Communications and Information Theory, vol. 1, no. 1, June 2004.

RANDOM MATRIX THEORY : Shannon-Transform  A be a nonnegative definite random matrix. Theorem: The Shannon transform and  -transforms are related through: where is defined by the fixed- point equation

Property of  is monotonically increasing with    which is the solution to the equation  is monotonically decreasing with y

Theorem:  -Transform Theorem: The  -transform of is where is the solution to:

Theorem: Shannon-Transform Theorem: The Shannon-transform of is where  and are the solutions to:

Flat Fading & Deterministic ISI: Theorem: The mutual information is: Stationary Gaussian inputs with power spectral with

Flat Fading & Deterministic ISI: Theorem: The mutual information is: Stationary Gaussian inputs with power spectral with

Flat Fading & Deterministic ISI: Theorem: The mutual information is: Stationary Gaussian inputs with power spectral with

Special Case: No Fading  

Special Case: Memoryless Channels  

Special case: Gaussian Erasure Channels Theorem: The mutual information is: Stationary Gaussian inputs with power spectral with

Let Flat Fading & Deterministic ISI: Theorem: The mutual information is: with : Stationary Gaussian inputs with power spectral

Example n=200 n = 200 ─

Example n=1000 n = 1000 ─

RANDOM MATRIX THEORY : asymptotic ESD The empirical spectral distribution (ESD)of an Hermitian random matrix The empirical spectral distribution (ESD) of an Hermitian random matrix If converges almost surely as n  ,then the corresponding limit (asymptotic ESD) is denoted by

Key Ingredients: Theorem: Let: Let:  be a nonnegative random variable.  be uniformly distributed between [0,1] where is the solution to

Application to ISI Channel Let  be a nonnegative random variable  be uniformly distributed between [0,1]

RANDOM MATRIX THEORY : Shannon-Transform  A be a nonnegative definite random matrix. Theorem: The Shannon transform and  -transforms are related through: where is defined by the fixed- point equation

Property of  is monotonically increasing with    which is the solution to the equation  is monotonically decreasing with y

A. M. Tulino, A. Lozano and S. Verdú “Capacity-Achieving Input Covariance for Single-user Multi-Antenna Channels”, IEEE Trans. on Wireless Communications 2006 Theorem:  be an random matrix  such that Input Optimization with so that: i-th column of

Input Optimization Theorem: The capacity-achieving input power spectral density is: where and is chosen so that

Corollary: Effect of fading on the capacity-achieving input power spectral density = SNR penalty Input Optimization with regulates amount of water admitted  < 1 regulates amount of water admitted on each frequency tailoring the waterfilling for no-fading to fading channels for no-fading to fading channels. the fading-free water level for  the fading-free water level for  the waterfilling solution for  the waterfilling solution for 

Proof: Input Optimization:

Observations     !  0 with and denote the set of frequencies such that such that

Theorem:  -Transform Theorem: The  -transform of is where is the solution to:

Proof: Key Ingredient  We can replace  by it circulant asymptotic equivalent counterpart,  = F  F †  Let Q = EF, denote by q i the ith column of Q, and let

Proof: Matrix inversion lemma:

Proof:

Lemma:

Theorem: Shannon-Transform Theorem: The Shannon-transform of is where  and are the solutions to:

Asymptotics   Low-power (  )   High-power (  )

Asymptotics: Low-SNR At low SNR we can closely approximate it linearly  need and S 0 1 st order approx. to C(E b /N 0 ) captures 2 nd order behavior of C(SNR) notes :

Asymptotics: Low-SNR The minimum energy per bit and wideband slope of the spectral efficiency of a channel with Fading & deterministic ISI are equal to: The minimum energy per bit and wideband slope S 0 of the spectral efficiency of a channel with Fading & deterministic ISI are equal to: where Theorem:

Asymptotics: High-SNR At large SNR we can closely approximate it linearly  need and S 0where High-SNR slope High-SNR dB offset

Let, and the generalized bandwidth, and the generalized bandwidth, Asymptotics: High-SNR Theorem:

Asymptotics   Sporadic Erasure ( e ! 0 )   Sporadic Non-Erasure ( e ! 1 )

Theorem: For sporadic erasures: For sporadic erasures: Asymptotics: Sporadic Erasures ( e  0 ) For any output power spectral density and Theorem: where is the water level of the PSD that achieves Memoryless noisy erasure channel High SNR Low SNR

Asymptotics: Sporadic Non-Erasures ( e  1 ) Theorem:Theorem: Optimizingover with Optimizing over with with the maximum channel gain

Theorem: The mutual information rate is lower bounded by: Bounds: Equality S(f) =1

Theorem: The mutual information rate is upper bounded by: Bounds:

d-Fold Vandermonde Matrix Diagonal matrix (either random or deterministic) with supported compact measure Diagonal matrix (either random or deterministic) with supported compact measure

Theorem: The  -transform of is The Shannon-Transformr is d-Fold Vandermonde Matrix

Theorem: The p-moment of is: d-Fold Vandermonde Matrix

Summary Summary  Asymptotic distribution of A S A ---new result at the intersection of the asymptotic eigenvalue distribution of Toeplitz matrices and of random matrices ---  The mutual information of a Channel with ISI and Fading.  Optimality of waterfilling in the presence of fading known at the receiver.  Easily computable asymptotic expressions in various regimes (low and high SNR)  New result for d-fold Vandermond matrices and on their product with diagonal matrices