Massive MIMO: Signal Structure, Efficient Processing, and Open Problems II
|
|
- Deirdre Glenn
- 6 years ago
- Views:
Transcription
1 Massive MIMO: Signal Structure, Efficient Processing, and Open Problems II Mahdi Barzegar Communications and Information Theory Group (CommIT) Technische Universität Berlin Heisenberg Communications and Information Theory Group Freie Universität Berlin CoSIP Retreat Berlin, December 2016 M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
2 Outline 1 Overview 2 One-Shot Channel Vector Estimation 3 Subspace Estimation: Exploiting Spatial Sparsity 4 Exploiting Spatio-Temporal Sparsity 5 Instances of Other Interesting Problems M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
3 Outline 1 Overview 2 One-Shot Channel Vector Estimation 3 Subspace Estimation: Exploiting Spatial Sparsity 4 Exploiting Spatio-Temporal Sparsity 5 Instances of Other Interesting Problems M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
4 Overview The starting point h s (f N ) h s (f 1 ) f = 1 T s... Bandwidth W Focusing on the channel vector in each time-frequency resource block T s M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
5 Massive MIMO Regime Isotropic channel model for low-resolution antennas, or rich scattering channel 1, 2 h CN (0, σ 2 I M M ) 1 Emre Telatar. Capacity of Multi-antenna Gaussian Channels. In: European transactions on telecommunications 10.6 (1999), pp Lizhong Zheng and David NC Tse. Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel. In: Information Theory, IEEE Transactions on 48.2 (2002), pp M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
6 Massive MIMO Regime Isotropic channel model for low-resolution antennas, or rich scattering channel 1, 2 h CN (0, σ 2 I M M ) In massive-mimo the base-station sees through the environment p scatterers, p M (M 1)d 4d 3d 2d d 0 θ i. User 1 Emre Telatar. Capacity of Multi-antenna Gaussian Channels. In: European transactions on telecommunications 10.6 (1999), pp Lizhong Zheng and David NC Tse. Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel. In: Information Theory, IEEE Transactions on 48.2 (2002), pp M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
7 Massive MIMO Regime Isotropic channel model for low-resolution antennas, or rich scattering channel 1, 2 h CN (0, σ 2 I M M ) In massive-mimo the base-station sees through the environment This implies h CN (0, C), with rank (C) p M p scatterers, p M (M 1)d 4d 3d 2d d 0 θ i. User 1 Emre Telatar. Capacity of Multi-antenna Gaussian Channels. In: European transactions on telecommunications 10.6 (1999), pp Lizhong Zheng and David NC Tse. Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel. In: Information Theory, IEEE Transactions on 48.2 (2002), pp M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
8 Outline 1 Overview 2 One-Shot Channel Vector Estimation 3 Subspace Estimation: Exploiting Spatial Sparsity 4 Exploiting Spatio-Temporal Sparsity 5 Instances of Other Interesting Problems M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
9 Sparse Channel Model for Massive MIMO Instantaneous sparse channel vector h = p i=1 w ia(θ i ), where a(θ) C M is the array response with [a(θ)] k = e jkπ sin(θ) sin(θmax) p scatterers, p M (M 1)d 4d 3d 2d d 0 θ i. User M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
10 Sparse Channel Model for Massive MIMO Instantaneous sparse channel vector h = p i=1 w ia(θ i ), where a(θ) C M is the array response with [a(θ)] k = e jkπ sin(θ) sin(θmax) Compressed sensing methods are used for channel estimation M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
11 Sparse Channel Model for Massive MIMO Instantaneous sparse channel vector h = p i=1 w ia(θ i ), where a(θ) C M is the array response with [a(θ)] k = e jkπ sin(θ) sin(θmax) Compressed sensing methods are used for channel estimation Selection of only a few array elements is sufficient to recover h 4d 3d 2d d 0 Antenna Selection 4d 3d 2d d 0 M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
12 High-dimensional Estimation with Sparsity Constraints High-dim Data Low-dim Structure Low-dim Sketches (Antenna Selection) Sparse Channel Vector h = p i=1 w ia(θ i ) Efficient Implementation (less RF-chains, less power consumption,...) Compressed Sensing Techniques Beamformer Design M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
13 Outline 1 Overview 2 One-Shot Channel Vector Estimation 3 Subspace Estimation: Exploiting Spatial Sparsity 4 Exploiting Spatio-Temporal Sparsity 5 Instances of Other Interesting Problems M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
14 Subspace Estimation One can go beyond one-shot CS and think of subspace estimation. Observe the channel over time M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
15 Subspace Estimation One can go beyond one-shot CS and think of subspace estimation. Observe the channel over time Questions Q1: How to estimate the underlying subspace? What are the constraints? M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
16 Subspace Estimation One can go beyond one-shot CS and think of subspace estimation. Observe the channel over time Questions Q1: How to estimate the underlying subspace? What are the constraints? Q2: Is subspace information particularly useful? M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
17 Q1: How to estimate the subspace? Some Observations: The local geometry given by {(σi 2, θ i)} p i=1 is quasi-stationary with sharp transitions M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
18 Q1: How to estimate the subspace? Some Observations: The local geometry given by {(σi 2, θ i)} p i=1 is quasi-stationary with sharp transitions In the traditional periodic training scheme, we have t training samples: y i = s i h i + n i x i = By i, i [t] s 0 s 1 s t 1 s t τ τ T M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
19 Q1: How to estimate the subspace? Some Observations: There is an intermediate regime τ T T containing 1 ν training samples, in which the subspace information can be exploited s 0 s 1 s t 1 s t τ τ T s 0 s 1 s ν 1 s ν τ τ T T M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
20 Q1: How to estimate the subspace? Some Observations: There is an intermediate regime τ T T containing 1 ν training samples, in which the subspace information can be exploited s 0 s 1 s ν 1 s ν τ τ T T M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
21 Q1: How to estimate the subspace? Some Observations: There is an intermediate regime τ T T containing 1 ν training samples, in which the subspace information can be exploited s 0 s 1 s ν 1 s ν τ τ T T Typical Window Size Subspace Estimation should be done with around ν samples! M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
22 Q2: How to exploit the subspace information? Example 1 If signal subspace U M q is known, then h span(u) approximately: this can be used to improve estimation of h h M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
23 Q2: How to exploit the subspace information? Example 1 If signal subspace U M q is known, then h span(u) approximately: this can be used to improve estimation of h h This can be seen as a support estimate for the sparse recovery problem M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
24 Q2: How to exploit the subspace information? Example 2 This solves the aging problem in mm-wave channels s i s i+1 τ r h (δ) 1 τ δ M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
25 Q2: How to exploit the subspace information? Example 2 This solves the aging problem in mm-wave channels Reject the interference by zero-forcing to signal subspace rather than zero-forcing to instantaneous channel vector s i s i+1 τ h i 2 h i r h (δ) 1 h i 1 τ δ M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
26 How to exploit the subspace information? Example 3 This can be used to cluster the user based on their signal subspace, and is suitable for HDA implementations 3 (M 1)d 4d Digital Base-band Processing ADC (uplink) DAC (downlink) M M Analog RF-Chain 3d 2d d 0 3 Ansuman Adhikary et al. Joint spatial division and multiplexing for mm-wave channels. In: IEEE J. on Sel. Areas on Commun. (JSAC) 32.6 (2014), pp M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
27 How to exploit the subspace information? Example 3 This can be used to cluster the user based on their signal subspace, and is suitable for HDA implementations 3 (M 1)d 4d Digital Base-band Processing ADC (uplink) DAC (downlink) M M Analog RF-Chain 3d 2d d 0 Analog Beamforming Subspace Information Digital Beamforming Instantaneous Channel Information 3 Ansuman Adhikary et al. Joint spatial division and multiplexing for mm-wave channels. In: IEEE J. on Sel. Areas on Commun. (JSAC) 32.6 (2014), pp M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
28 Algorithm Design Signal Model Process {h i } ν i=1 with a local geometry given by C h = p i=1 σ2 i a(θ i)a(θ i ) H, and unknown time-variation M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
29 Algorithm Design Signal Model Process {h i } ν i=1 with a local geometry given by C h = p i=1 σ2 i a(θ i)a(θ i ) H, and unknown time-variation Noisy observations y i = h i + n i M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
30 Algorithm Design Signal Model Process {h i } ν i=1 with a local geometry given by C h = p i=1 σ2 i a(θ i)a(θ i ) H, and unknown time-variation Noisy observations y i = h i + n i Available data size ν M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
31 Algorithm Design Signal Model Process {h i } ν i=1 with a local geometry given by C h = p i=1 σ2 i a(θ i)a(θ i ) H, and unknown time-variation Noisy observations y i = h i + n i Available data size ν Input Data Low-dim sketches x i = By i with B m M typically antenna selection M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
32 Algorithm Design Signal Model Process {h i } ν i=1 with a local geometry given by C h = p i=1 σ2 i a(θ i)a(θ i ) H, and unknown time-variation Noisy observations y i = h i + n i Available data size ν Input Data Low-dim sketches x i = By i with B m M typically antenna selection Objective Design a robust algorithm for estimating the signal subspace with ν noisy sketches, and by exploiting spatial sparsity ɛ-efficiency criterion ν i=1 P U(h i ) 2 (1 ɛ) ν i=1 h i 2 for the q-dim signal subspace given by U M q such that U H U = I q q M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
33 Multiple Measurement Vector (MMV) Observations H = [h 1, h 2,..., h ν] = [a(θ 1), a(θ 2)... a(θ G )]... := A M G Γ G ν M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
34 Multiple Measurement Vector (MMV) Observations H = [h 1, h 2,..., h ν] = [a(θ 1), a(θ 2)... a(θ G )]... := A M G Γ G ν (M 1)d 4d 3d 2d d 0 θ i. User Only p out of G grid elements are active M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
35 Atomic-norm Denoising for MMV 4, 5, 6 Atomic-norm can be used to estimate the channel vectors Atomic-norm Regularizer for MMV Underlying dictionary D = {a(θ)γ H : θ [ θ max, θ max ], γ C ν } 4 Venkat Chandrasekaran et al. The convex geometry of linear inverse problems. In: Foundations of Computational mathematics 12.6 (2012), pp Badri Narayan Bhaskar, Gongguo Tang, and Benjamin Recht. Atomic norm denoising with applications to line spectral estimation. In: Signal Processing, IEEE Transactions on (2013), pp Yuanxin Li and Yuejie Chi. Off-the-Grid Line Spectrum Denoising and Estimation with Multiple Measurement Vectors. In: arxiv preprint arxiv: (2014). M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
36 Atomic-norm Denoising for MMV 4, 5, 6 Atomic-norm can be used to estimate the channel vectors Atomic-norm Regularizer for MMV Underlying dictionary D = {a(θ)γ H : θ [ θ max, θ max ], γ C ν } Spatial-sparsity promoting, channel-variation ignoring regularizer for the channel vectors H M ν : { } H D = inf λi : λ i > 0, θ i, γ i s.t. λi a(θ i )γ H i = H 4 Venkat Chandrasekaran et al. The convex geometry of linear inverse problems. In: Foundations of Computational mathematics 12.6 (2012), pp Badri Narayan Bhaskar, Gongguo Tang, and Benjamin Recht. Atomic norm denoising with applications to line spectral estimation. In: Signal Processing, IEEE Transactions on (2013), pp Yuanxin Li and Yuejie Chi. Off-the-Grid Line Spectrum Denoising and Estimation with Multiple Measurement Vectors. In: arxiv preprint arxiv: (2014). M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
37 Atomic-norm Denoising for MMV Atomic-norm can be used to estimate the channel vectors Atomic-norm Regularizer for MMV Underlying dictionary D = {a(θ)γ H : θ [ θ max, θ max ], γ C ν } Spatial-sparsity promoting, channel-variation ignoring regularizer for the channel vectors H M ν : { } H D = inf λi : λ i > 0, θ i, γ i s.t. λi a(θ i )γ H i = H Atomic-norm Denoising for MMV We have the matrix of sketches X = [x 1, x 2,..., x ν ], where x i = B(h i + n i ) M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
38 Atomic-norm Denoising for MMV Atomic-norm can be used to estimate the channel vectors Atomic-norm Regularizer for MMV Underlying dictionary D = {a(θ)γ H : θ [ θ max, θ max ], γ C ν } Spatial-sparsity promoting, channel-variation ignoring regularizer for the channel vectors H M ν : { } H D = inf λi : λ i > 0, θ i, γ i s.t. λi a(θ i )γ H i = H Atomic-norm Denoising for MMV We have the matrix of sketches X = [x 1, x 2,..., x ν ], where x i = B(h i + n i ) The channel vectors are estimated via Ĥ = arg min H D s.t. X BH δ H M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
39 Outline 1 Overview 2 One-Shot Channel Vector Estimation 3 Subspace Estimation: Exploiting Spatial Sparsity 4 Exploiting Spatio-Temporal Sparsity 5 Instances of Other Interesting Problems M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
40 Spatio-Temporal Correlations and Sparse Scattering First Extreme: Fast-varying Channel Vectors Although channel vector is randomly varying with time its underlying subspace remains invariant h 1 M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
41 Spatio-Temporal Correlations and Sparse Scattering First Extreme: Fast-varying Channel Vectors Although channel vector is randomly varying with time its underlying subspace remains invariant h 2 h 1 M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
42 Spatio-Temporal Correlations and Sparse Scattering First Extreme: Fast-varying Channel Vectors Although channel vector is randomly varying with time its underlying subspace remains invariant h 2 h 1 h 3 M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
43 Spatio-Temporal Correlations and Sparse Scattering First Extreme: Fast-varying Channel Vectors Although channel vector is randomly varying with time its underlying subspace remains invariant This subspace information depends on C h = p i=1 σ2 i a(θ i)a(θ i ) H, which encodes the local geometry of the user given by {(σi 2, θ i)} p i=1 h 2 h 1 h 3 M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
44 Spatio-Temporal Correlations and Sparse Scattering Second Extreme: Slowly-varying Channel Vectors Now consider C h = p i=1 σ2 i a(θ i)a(θ i ) H, and suppose h i is slowly varying M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
45 Spatio-Temporal Correlations and Sparse Scattering Second Extreme: Slowly-varying Channel Vectors Now consider C h = p i=1 σ2 i a(θ i)a(θ i ) H, and suppose h i is slowly varying In the extreme case, we have h i = h M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
46 Spatio-Temporal Correlations and Sparse Scattering Second Extreme: Slowly-varying Channel Vectors Now consider C h = p i=1 σ2 i a(θ i)a(θ i ) H, and suppose h i is slowly varying In the extreme case, we have h i = h h 1 M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
47 Spatio-Temporal Correlations and Sparse Scattering Second Extreme: Slowly-varying Channel Vectors Now consider C h = p i=1 σ2 i a(θ i)a(θ i ) H, and suppose h i is slowly varying In the extreme case, we have h i = h h 2 h 1 M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
48 Spatio-Temporal Correlations and Sparse Scattering Second Extreme: Slowly-varying Channel Vectors Now consider C h = p i=1 σ2 i a(θ i)a(θ i ) H, and suppose h i is slowly varying In the extreme case, we have h i = h h 2 h 1 h 3 M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
49 Spatio-Temporal Correlations and Sparse Scattering Observations For the process {h i } t i=1 with covariance matrix C h = p i=1 σ2 i a(θ i)a(θ i ) H, as far as the local geometry remains invariant: M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
50 Spatio-Temporal Correlations and Sparse Scattering Observations For the process {h i } t i=1 with covariance matrix C h = p i=1 σ2 i a(θ i)a(θ i ) H, as far as the local geometry remains invariant: In the fast-varying regime: the process lies on a p-dim subspace M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
51 Spatio-Temporal Correlations and Sparse Scattering Observations For the process {h i } t i=1 with covariance matrix C h = p i=1 σ2 i a(θ i)a(θ i ) H, as far as the local geometry remains invariant: In the fast-varying regime: the process lies on a p-dim subspace In the slowly-varying regime: the process lies on a 1-dim subspace M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
52 Spatio-Temporal Correlations and Sparse Scattering Observations For the process {h i } t i=1 with covariance matrix C h = p i=1 σ2 i a(θ i)a(θ i ) H, as far as the local geometry remains invariant: In the fast-varying regime: the process lies on a p-dim subspace In the slowly-varying regime: the process lies on a 1-dim subspace Depending on the channel dynamics, the effective dimension q is between 1 and p M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
53 Spatio-Temporal Correlations and Sparse Scattering Observations For the process {h i } t i=1 with covariance matrix C h = p i=1 σ2 i a(θ i)a(θ i ) H, as far as the local geometry remains invariant: In the fast-varying regime: the process lies on a p-dim subspace In the slowly-varying regime: the process lies on a 1-dim subspace Depending on the channel dynamics, the effective dimension q is between 1 and p There is a nice sparse subspace structure that can be exploited! M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
54 Spatio-Temporal Correlations and Sparse Scattering Observations Fast-varying Channel Γ G ν = Slowly-varying Channel Γ G ν = M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
55 Spatio-Temporal Correlations and Sparse Scattering Observations Fast-varying Channel Γ G ν = Slowly-varying Channel Γ G ν = Open Problem I What is a good MMV algorithm, which is indifferent towards the temporal behavior? M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
56 Notes We identified an underlying signal subspace sparsity that can be exploited on top of one-shot sparsity to boost the system performance M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
57 Notes We identified an underlying signal subspace sparsity that can be exploited on top of one-shot sparsity to boost the system performance Subspace estimation can be done with ν 50 number of samples for snr 0 10 db M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
58 Notes We identified an underlying signal subspace sparsity that can be exploited on top of one-shot sparsity to boost the system performance Subspace estimation can be done with ν 50 number of samples for snr 0 10 db Low-complexity algorithms exist that can exploit the spatial sparsity, are robust to channel dynamics, and extract the signal subspace quite efficiently M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
59 Outline 1 Overview 2 One-Shot Channel Vector Estimation 3 Subspace Estimation: Exploiting Spatial Sparsity 4 Exploiting Spatio-Temporal Sparsity 5 Instances of Other Interesting Problems M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
60 Antenna Configuration in Massive MIMO Figure: Some possible configurations of a Massive MIMO BS 7 7 Erik G Larsson et al. Massive MIMO for next generation wireless systems. In: IIEEE Communications Magazine 52.2 (2014), pp M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
61 Antenna Configuration in Massive MIMO Question Q1: What is a suitable antenna arrangement? M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
62 Antenna Configuration in Massive MIMO Two Examples A Linear Array: A Toeplitz covariance matrix = [a( κ)] n = e jκy dy (n 1) = C aa H : M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
63 Antenna Configuration in Massive MIMO Two Examples A Rectangular Array: A Block-Toeplitz covariance matrix = [a( κ)] m,n j(κy dy (n 1)+κx dx (m 1)) = e = C aa H : M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
64 Bias-Variance Trade-off More Structure Efficient channel estimation algorithms Less variance! More bias! Less Structure More DoF Less bias! More variance! M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
65 Bias-Variance Trade-off More Structure Efficient channel estimation algorithms Less variance! More bias! Less Structure More DoF Less bias! More variance! Open Problem II What is the the best configuration? M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
66 FDD Channel Feedback Problem The user feeds back the downlink channel to BS (M 1)d 4d 3d 2d d User M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
67 FDD Channel Feedback Problem M 1 feedback is too time-consuming Question Is there a way to estimate the downlink channel from the uplink channel? M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
68 FDD Channel Feedback Problem M 1 feedback is too time-consuming Question Is there a way to estimate the downlink channel from the uplink channel? General channel model (uplink) a f1 (θ) = h up = 1 p i=1 e j 2π c f1d sin(θ). e j 2π c (M 1)f1d sin(θ) w i a f1 (θ i ) + ρ(dθ)a f1 (θ) + n, w i CN (0, σi 2 ), n CN (0, σni 2 M ) M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
69 FDD Channel Feedback Problem M 1 feedback is too time-consuming Question Is there a way to estimate the downlink channel from the uplink channel? General channel model (uplink) a f1 (θ) = h up = 1 p i=1 e j 2π c f1d sin(θ). e j 2π c (M 1)f1d sin(θ) w i a f1 (θ i ) + h : a parametric stochastic process over frequency Parameters: {w i, θ i } p i=1 Good news: M p ρ(dθ)a f1 (θ) + n, w i CN (0, σi 2 ), n CN (0, σni 2 M ) M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
70 A Possible Approach: Wold s Decomposition Theorem Wold s Decomposition Theorem Any zero-mean WSS process {x f ; f Z} can be uniquely decomposed as x f = b i ε f i + d f i=0 where b 0 = 1 and i=1 b i 2 < ε f is a white noise process. {d f ; f Z} is a deterministic process. E{d f ε f } = 0 f, f Definition A stationary process {d f : f Z} is called deterministic if its current value (d f ) can be predicted using the entire past (d f 1, d f 2,...). M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
71 FDD Channel Feedback Problem h up = p w i a f1 (θ i ) i=1 }{{} deterministic process + ρ(dθ) a f1 (θ) + n }{{} innovation process M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
72 FDD Channel Feedback Problem h up = p w i a f1 (θ i ) i=1 }{{} deterministic process + ρ(dθ) a f1 (θ) + n }{{} innovation process The deterministic process may contain a substantial amount of the energy. M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
73 FDD Channel Feedback Problem h up = p w i a f1 (θ i ) i=1 }{{} deterministic process + ρ(dθ) a f1 (θ) + n }{{} innovation process The deterministic process may contain a substantial amount of the energy. Open Problem III Is there a way to extract the deterministic component? M. Barzegar (TU-Berlin) Massive MIMO II CoSIP / 36
74 Questions?
Going off the grid. Benjamin Recht Department of Computer Sciences University of Wisconsin-Madison
Going off the grid Benjamin Recht Department of Computer Sciences University of Wisconsin-Madison Joint work with Badri Bhaskar Parikshit Shah Gonnguo Tang We live in a continuous world... But we work
More informationLow Resolution Adaptive Compressed Sensing for mmwave MIMO receivers
Low Resolution Adaptive Compressed Sensing for mmwave MIMO receivers Cristian Rusu, Nuria González-Prelcic and Robert W. Heath Motivation 2 Power consumption at mmwave in a MIMO receiver Power at 60 GHz
More informationROBUST BLIND SPIKES DECONVOLUTION. Yuejie Chi. Department of ECE and Department of BMI The Ohio State University, Columbus, Ohio 43210
ROBUST BLIND SPIKES DECONVOLUTION Yuejie Chi Department of ECE and Department of BMI The Ohio State University, Columbus, Ohio 4 ABSTRACT Blind spikes deconvolution, or blind super-resolution, deals with
More informationPerformance Analysis for Strong Interference Remove of Fast Moving Target in Linear Array Antenna
Performance Analysis for Strong Interference Remove of Fast Moving Target in Linear Array Antenna Kwan Hyeong Lee Dept. Electriacal Electronic & Communicaton, Daejin University, 1007 Ho Guk ro, Pochen,Gyeonggi,
More informationFDD Massive MIMO via UL/DL Channel Covariance Extrapolation and Active Channel Sparsification
FDD Massive MIMO via UL/DL Channel Covariance Extrapolation and Active Channel Sparsification arxiv:1803.05754v2 [cs.it] 24 Aug 2018 Mahdi Barzegar Khalilsarai, Saeid Haghighatshoar, Xinping Yi, and Giuseppe
More informationMultiuser Capacity in Block Fading Channel
Multiuser Capacity in Block Fading Channel April 2003 1 Introduction and Model We use a block-fading model, with coherence interval T where M independent users simultaneously transmit to a single receiver
More informationSparse Parameter Estimation: Compressed Sensing meets Matrix Pencil
Sparse Parameter Estimation: Compressed Sensing meets Matrix Pencil Yuejie Chi Departments of ECE and BMI The Ohio State University Colorado School of Mines December 9, 24 Page Acknowledgement Joint work
More informationCombining Sparsity with Physically-Meaningful Constraints in Sparse Parameter Estimation
UIUC CSL Mar. 24 Combining Sparsity with Physically-Meaningful Constraints in Sparse Parameter Estimation Yuejie Chi Department of ECE and BMI Ohio State University Joint work with Yuxin Chen (Stanford).
More informationTHE estimation of covariance matrices is a crucial component
1 A Subspace Method for Array Covariance Matrix Estimation Mostafa Rahmani and George K. Atia, Member, IEEE, arxiv:1411.0622v1 [cs.na] 20 Oct 2014 Abstract This paper introduces a subspace method for the
More informationSelf-Calibration and Biconvex Compressive Sensing
Self-Calibration and Biconvex Compressive Sensing Shuyang Ling Department of Mathematics, UC Davis July 12, 2017 Shuyang Ling (UC Davis) SIAM Annual Meeting, 2017, Pittsburgh July 12, 2017 1 / 22 Acknowledgements
More informationOptimal Data and Training Symbol Ratio for Communication over Uncertain Channels
Optimal Data and Training Symbol Ratio for Communication over Uncertain Channels Ather Gattami Ericsson Research Stockholm, Sweden Email: athergattami@ericssoncom arxiv:50502997v [csit] 2 May 205 Abstract
More informationHow Much Training and Feedback are Needed in MIMO Broadcast Channels?
How uch raining and Feedback are Needed in IO Broadcast Channels? ari Kobayashi, SUPELEC Gif-sur-Yvette, France Giuseppe Caire, University of Southern California Los Angeles CA, 989 USA Nihar Jindal University
More informationParameter Estimation for Mixture Models via Convex Optimization
Parameter Estimation for Mixture Models via Convex Optimization Yuanxin Li Department of Electrical and Computer Engineering The Ohio State University Columbus Ohio 432 Email: li.3822@osu.edu Yuejie Chi
More informationThe Optimality of Beamforming: A Unified View
The Optimality of Beamforming: A Unified View Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 92697-2625 Email: sudhirs@uciedu,
More informationMultiple Antennas in Wireless Communications
Multiple Antennas in Wireless Communications Luca Sanguinetti Department of Information Engineering Pisa University luca.sanguinetti@iet.unipi.it April, 2009 Luca Sanguinetti (IET) MIMO April, 2009 1 /
More informationSingle-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 informationResearch Overview. Kristjan Greenewald. February 2, University of Michigan - Ann Arbor
Research Overview Kristjan Greenewald University of Michigan - Ann Arbor February 2, 2016 2/17 Background and Motivation Want efficient statistical modeling of high-dimensional spatio-temporal data with
More informationLecture 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 informationHybrid Pilot/Quantization based Feedback in Multi-Antenna TDD Systems
Hybrid Pilot/Quantization based Feedback in Multi-Antenna TDD Systems Umer Salim, David Gesbert, Dirk Slock and Zafer Beyaztas Mobile Communications Department Eurecom, France Email: {salim, gesbert, slock}@eurecom.fr
More informationRiemannian Coding for Covariance Interpolation in Massive MIMO Frequency Division Duplex Systems
Riemannian Coding for Covariance Interpolation in Massive MIMO requency Division Duplex Systems Alexis Decurninge, Maxime Guillaud Huawei Technologies, Co. Ltd. rance Research Center Mathematical and Algorithmic
More informationA Signal-Space Analysis of Spatial Self-Interference Isolation for Full-Duplex Wireless
A Signal-Space Analysis of Spatial Self-Interference Isolation for Full-Duplex Wireless Evan Everett Rice University Ashutosh Sabharwal Rice University Abstract The challenge to in-band full-duplex wireless
More informationHybrid Pilot/Quantization based Feedback in Multi-Antenna TDD Systems
Hybrid Pilot/Quantization based Feedback in Multi-Antenna TDD Systems Umer Salim, David Gesbert, Dirk Slock, Zafer Beyaztas Mobile Communications Department Eurecom, France Abstract The communication between
More informationRandom Matrices and Wireless Communications
Random Matrices and Wireless Communications Jamie Evans Centre for Ultra-Broadband Information Networks (CUBIN) Department of Electrical and Electronic Engineering University of Melbourne 3.5 1 3 0.8 2.5
More informationCSI Overhead Reduction with Stochastic Beamforming for Cloud Radio Access Networks
1 CSI Overhead Reduction with Stochastic Beamforming for Cloud Radio Access Networks Yuanming Shi, Jun Zhang, and Khaled B. Letaief, Fellow, IEEE Dept. of ECE, The Hong Kong University of Science and Technology
More informationPERFORMANCE COMPARISON OF DATA-SHARING AND COMPRESSION STRATEGIES FOR CLOUD RADIO ACCESS NETWORKS. Pratik Patil, Binbin Dai, and Wei Yu
PERFORMANCE COMPARISON OF DATA-SHARING AND COMPRESSION STRATEGIES FOR CLOUD RADIO ACCESS NETWORKS Pratik Patil, Binbin Dai, and Wei Yu Department of Electrical and Computer Engineering University of Toronto,
More informationJoint Spatial Division and Multiplexing
Joint Spatial Division and Multiplexing Ansuman Adhikary, Junyoung Nam, Jae-Young Ahn, and Giuseppe Caire Abstract arxiv:209.402v2 [cs.it] 28 Jan 203 We propose Joint Spatial Division and Multiplexing
More informationAchievable Outage Rate Regions for the MISO Interference Channel
Achievable Outage Rate Regions for the MISO Interference Channel Johannes Lindblom, Eleftherios Karipidis and Erik G. Larsson Linköping University Post Print N.B.: When citing this work, cite the original
More informationLecture 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 informationChannel Estimation with Low-Precision Analog-to-Digital Conversion
Channel Estimation with Low-Precision Analog-to-Digital Conversion Onkar Dabeer School of Technology and Computer Science Tata Institute of Fundamental Research Mumbai India Email: onkar@tcs.tifr.res.in
More informationLecture 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 informationNash Bargaining in Beamforming Games with Quantized CSI in Two-user Interference Channels
Nash Bargaining in Beamforming Games with Quantized CSI in Two-user Interference Channels Jung Hoon Lee and Huaiyu Dai Department of Electrical and Computer Engineering, North Carolina State University,
More informationOn the Throughput of Proportional Fair Scheduling with Opportunistic Beamforming for Continuous Fading States
On the hroughput of Proportional Fair Scheduling with Opportunistic Beamforming for Continuous Fading States Andreas Senst, Peter Schulz-Rittich, Gerd Ascheid, and Heinrich Meyr Institute for Integrated
More informationMultiple Antennas. Mats Bengtsson, Björn Ottersten. Channel characterization and modeling 1 September 8, Signal KTH Research Focus
Multiple Antennas Channel Characterization and Modeling Mats Bengtsson, Björn Ottersten Channel characterization and modeling 1 September 8, 2005 Signal Processing @ KTH Research Focus Channel modeling
More informationarxiv: v1 [cs.it] 21 Feb 2013
q-ary Compressive Sensing arxiv:30.568v [cs.it] Feb 03 Youssef Mroueh,, Lorenzo Rosasco, CBCL, CSAIL, Massachusetts Institute of Technology LCSL, Istituto Italiano di Tecnologia and IIT@MIT lab, Istituto
More informationImproved channel estimation for massive MIMO systems using hybrid pilots with pilot anchoring
Improved channel estimation for massive MIMO systems using hybrid pilots with pilot anchoring Karthik Upadhya, Sergiy A. Vorobyov, Mikko Vehkapera Department of Signal Processing and Acoustics Aalto University,
More informationMassive MIMO As Enabler for Communications with Drone Swarms
Massive MIMO As Enabler for Communications with Drone Swarms Prabhu Chandhar, Danyo Danev, and Erik G. Larsson Division of Communication Systems Dept. of Electrical Engineering Linköping University, Sweden
More informationADAPTIVE ANTENNAS. SPATIAL BF
ADAPTIVE ANTENNAS SPATIAL BF 1 1-Spatial reference BF -Spatial reference beamforming may not use of embedded training sequences. Instead, the directions of arrival (DoA) of the impinging waves are used
More informationReal-Valued Khatri-Rao Subspace Approaches on the ULA and a New Nested Array
Real-Valued Khatri-Rao Subspace Approaches on the ULA and a New Nested Array Huiping Duan, Tiantian Tuo, Jun Fang and Bing Zeng arxiv:1511.06828v1 [cs.it] 21 Nov 2015 Abstract In underdetermined direction-of-arrival
More informationHybrid Analog-Digital Channel Estimation and. Beamforming: Training-Throughput Tradeoff. (Draft with more Results and Details)
Hybrid Analog-Digital Channel Estimation and 1 Beamforming: Training-Throughput Tradeoff (Draft with more Results and Details) arxiv:1509.05091v2 [cs.it] 9 Oct 2015 Tadilo Endeshaw Bogale, Member, IEEE,
More informationExploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless
Exploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless SPAWC 2003 Rome, Italy June 18, 2003 E. Yoon, M. Vu and Arogyaswami Paulraj Stanford University Page 1 Outline Introduction
More informationCovariance Matrix Estimation in Massive MIMO
Covariance Matrix Estimation in Massive MIMO David Neumann, Michael Joham, and Wolfgang Utschick Methods of Signal Processing, Technische Universität München, 80290 Munich, Germany {d.neumann,joham,utschick}@tum.de
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 informationGauge optimization and duality
1 / 54 Gauge optimization and duality Junfeng Yang Department of Mathematics Nanjing University Joint with Shiqian Ma, CUHK September, 2015 2 / 54 Outline Introduction Duality Lagrange duality Fenchel
More informationCHANNEL 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 informationELG7177: MIMO Comunications. Lecture 8
ELG7177: MIMO Comunications Lecture 8 Dr. Sergey Loyka EECS, University of Ottawa S. Loyka Lecture 8, ELG7177: MIMO Comunications 1 / 32 Multi-User Systems Can multiple antennas offer advantages for multi-user
More informationJoint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation
Joint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation Chongbin Xu, Peng Wang, Zhonghao Zhang, and Li Ping City University of Hong Kong 1 Outline Background Mutual Information
More informationDegrees-of-Freedom Robust Transmission for the K-user Distributed Broadcast Channel
/33 Degrees-of-Freedom Robust Transmission for the K-user Distributed Broadcast Channel Presented by Paul de Kerret Joint work with Antonio Bazco, Nicolas Gresset, and David Gesbert ESIT 2017 in Madrid,
More informationSPARSE signal representations have gained popularity in recent
6958 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 10, OCTOBER 2011 Blind Compressed Sensing Sivan Gleichman and Yonina C. Eldar, Senior Member, IEEE Abstract The fundamental principle underlying
More informationMassive MU-MIMO Downlink TDD Systems with Linear Precoding and Downlink Pilots
Massive MU-MIMO Downlink TDD Systems with Linear Precoding and Downlink Pilots Hien Quoc Ngo, Erik G. Larsson, and Thomas L. Marzetta Department of Electrical Engineering (ISY) Linköping University, 58
More informationLecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Antenna Diversity and Theoretical Foundations of Wireless Communications Wednesday, May 4, 206 9:00-2:00, Conference Room SIP Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationI. Introduction. Index Terms Multiuser MIMO, feedback, precoding, beamforming, codebook, quantization, OFDM, OFDMA.
Zero-Forcing Beamforming Codebook Design for MU- MIMO OFDM Systems Erdem Bala, Member, IEEE, yle Jung-Lin Pan, Member, IEEE, Robert Olesen, Member, IEEE, Donald Grieco, Senior Member, IEEE InterDigital
More informationOn the Capacity of MIMO Rician Broadcast Channels
On the Capacity of IO Rician Broadcast Channels Alireza Bayesteh Email: alireza@shannon2.uwaterloo.ca Kamyar oshksar Email: kmoshksa@shannon2.uwaterloo.ca Amir K. Khani Email: khani@shannon2.uwaterloo.ca
More informationSupport recovery in compressive sensing for estimation of Direction-Of-Arrival
Support recovery in compressive sensing for estimation of Direction-Of-Arrival Zhiyuan Weng and Xin Wang Department of Electrical and Computer Engineering Stony Brook University Abstract In the estimation
More informationMassive MIMO for Maximum Spectral Efficiency Mérouane Debbah
Security Level: Massive MIMO for Maximum Spectral Efficiency Mérouane Debbah www.huawei.com Mathematical and Algorithmic Sciences Lab HUAWEI TECHNOLOGIES CO., LTD. Before 2010 Random Matrices and MIMO
More informationErgodic and Outage Capacity of Narrowband MIMO Gaussian Channels
Ergodic and Outage Capacity of Narrowband MIMO Gaussian Channels Yang Wen Liang Department of Electrical and Computer Engineering The University of British Columbia April 19th, 005 Outline of Presentation
More informationPerformance Analysis for Sparse Support Recovery
Performance Analysis for Sparse Support Recovery Gongguo Tang and Arye Nehorai ESE, Washington University April 21st 2009 Gongguo Tang and Arye Nehorai (Institute) Performance Analysis for Sparse Support
More informationMinimum Mean Squared Error Interference Alignment
Minimum Mean Squared Error Interference Alignment David A. Schmidt, Changxin Shi, Randall A. Berry, Michael L. Honig and Wolfgang Utschick Associate Institute for Signal Processing Technische Universität
More informationDirty 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 informationGoing off the grid. Benjamin Recht University of California, Berkeley. Joint work with Badri Bhaskar Parikshit Shah Gonnguo Tang
Going off the grid Benjamin Recht University of California, Berkeley Joint work with Badri Bhaskar Parikshit Shah Gonnguo Tang imaging astronomy seismology spectroscopy x(t) = kx j= c j e i2 f jt DOA Estimation
More informationTransmitter-Receiver Cooperative Sensing in MIMO Cognitive Network with Limited Feedback
IEEE INFOCOM Workshop On Cognitive & Cooperative Networks Transmitter-Receiver Cooperative Sensing in MIMO Cognitive Network with Limited Feedback Chao Wang, Zhaoyang Zhang, Xiaoming Chen, Yuen Chau. Dept.of
More informationUsing Noncoherent Modulation for Training
EE8510 Project Using Noncoherent Modulation for Training Yingqun Yu May 5, 2005 0-0 Noncoherent Channel Model X = ρt M ΦH + W Rayleigh flat block-fading, T: channel coherence interval Marzetta & Hochwald
More informationsparse and low-rank tensor recovery Cubic-Sketching
Sparse and Low-Ran Tensor Recovery via Cubic-Setching Guang Cheng Department of Statistics Purdue University www.science.purdue.edu/bigdata CCAM@Purdue Math Oct. 27, 2017 Joint wor with Botao Hao and Anru
More informationSecure 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 informationRandom Access Protocols for Massive MIMO
Random Access Protocols for Massive MIMO Elisabeth de Carvalho Jesper H. Sørensen Petar Popovski Aalborg University Denmark Emil Björnson Erik G. Larsson Linköping University Sweden 2016 Tyrrhenian International
More informationTHE IC-BASED DETECTION ALGORITHM IN THE UPLINK LARGE-SCALE MIMO SYSTEM. Received November 2016; revised March 2017
International Journal of Innovative Computing, Information and Control ICIC International c 017 ISSN 1349-4198 Volume 13, Number 4, August 017 pp. 1399 1406 THE IC-BASED DETECTION ALGORITHM IN THE UPLINK
More informationNOMA: Principles and Recent Results
NOMA: Principles and Recent Results Jinho Choi School of EECS GIST September 2017 (VTC-Fall 2017) 1 / 46 Abstract: Non-orthogonal multiple access (NOMA) becomes a key technology in 5G as it can improve
More informationCodebook Design for Channel Feedback in Lens-Based Millimeter-Wave Massive MIMO Systems
1 Codebook Design for Channel Feedback in Lens-Based Millimeter-Wave Massive MIMO Systems Wenqian Shen, Student Member, IEEE, Linglong Dai, Senior Member, IEEE, Yang Yang, Member, IEEE, Yue Li, Member,
More informationRECURSIVE TRAINING WITH UNITARY MODULATION FOR CORRELATED BLOCK-FADING MIMO CHANNELS
RECURSIVE TRAINING WITH UNITARY MODULATION FOR CORRELATED BLOCK-FADING MIMO CHANNELS Wenyi Zhang, Student Member, IEEE, and J Nicholas Laneman, Member, IEEE Department of Electrical Engineering University
More information926 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 53, NO. 3, MARCH Monica Nicoli, Member, IEEE, and Umberto Spagnolini, Senior Member, IEEE (1)
926 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 53, NO. 3, MARCH 2005 Reduced-Rank Channel Estimation for Time-Slotted Mobile Communication Systems Monica Nicoli, Member, IEEE, and Umberto Spagnolini,
More informationELEC 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 informationLimited Feedback Hybrid Precoding for. Multi-User Millimeter Wave Systems
Limited Feedback Hybrid Precoding for 1 Multi-ser Millimeter Wave Systems Ahmed Alkhateeb, Geert Leus, and Robert W. Heath Jr. arxiv:1409.5162v2 [cs.it] 5 Mar 2015 Abstract Antenna arrays will be an important
More informationPeak Detection for Images
Peak Detection for Images Armin Schwartzman Division of Biostatistics, UC San Diego June 016 Overview How can we improve detection power? Use a less conservative error criterion Take advantage of prior
More informationLecture Notes 1: Vector spaces
Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector
More informationEE 5407 Part II: Spatial Based Wireless Communications
EE 5407 Part II: Spatial Based Wireless Communications Instructor: Prof. Rui Zhang E-mail: rzhang@i2r.a-star.edu.sg Website: http://www.ece.nus.edu.sg/stfpage/elezhang/ Lecture II: Receive Beamforming
More informationLattices and Lattice Codes
Lattices and Lattice Codes Trivandrum School on Communication, Coding & Networking January 27 30, 2017 Lakshmi Prasad Natarajan Dept. of Electrical Engineering Indian Institute of Technology Hyderabad
More informationEUSIPCO
EUSIPCO 013 1569746769 SUBSET PURSUIT FOR ANALYSIS DICTIONARY LEARNING Ye Zhang 1,, Haolong Wang 1, Tenglong Yu 1, Wenwu Wang 1 Department of Electronic and Information Engineering, Nanchang University,
More informationIEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 2, FEBRUARY
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 2, EBRUARY 2016 601 Structured Compressive Sensing-Based Spatio-Temporal Joint Channel Estimation for DD Massive MIMO Zhen Gao, Student Member, IEEE, Linglong
More informationLecture 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 informationVector Channel Capacity with Quantized Feedback
Vector Channel Capacity with Quantized Feedback Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 9697-65 Email: syed@ece.uci.edu,
More informationUpper 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 informationSparse regression. Optimization-Based Data Analysis. Carlos Fernandez-Granda
Sparse regression Optimization-Based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_spring16 Carlos Fernandez-Granda 3/28/2016 Regression Least-squares regression Example: Global warming Logistic
More informationTwo-Stage Channel Feedback for Beamforming and Scheduling in Network MIMO Systems
Two-Stage Channel Feedback for Beamforming and Scheduling in Network MIMO Systems Behrouz Khoshnevis and Wei Yu Department of Electrical and Computer Engineering University of Toronto, Toronto, Ontario,
More informationBlind 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 informationCapacity of Block Rayleigh Fading Channels Without CSI
Capacity of Block Rayleigh Fading Channels Without CSI Mainak Chowdhury and Andrea Goldsmith, Fellow, IEEE Department of Electrical Engineering, Stanford University, USA Email: mainakch@stanford.edu, andrea@wsl.stanford.edu
More informationRobust multichannel sparse recovery
Robust multichannel sparse recovery Esa Ollila Department of Signal Processing and Acoustics Aalto University, Finland SUPELEC, Feb 4th, 2015 1 Introduction 2 Nonparametric sparse recovery 3 Simulation
More informationarxiv: v2 [cs.it] 24 Feb 2017
ADC BIT ALLOCATION UNDER A POWER CONSTRAINT FOR MMWAVE MASSIVE MIMO COMMUNICATION RECEIVERS Jinseok Choi and Brian L. Evans Wireless Networking and Communications Group The University of Texas at Austin,
More informationOn the Capacity of Distributed Antenna Systems Lin Dai
On the apacity of Distributed Antenna Systems Lin Dai ity University of Hong Kong JWIT 03 ellular Networs () Base Station (BS) Growing demand for high data rate Multiple antennas at the BS side JWIT 03
More informationOn the Required Accuracy of Transmitter Channel State Information in Multiple Antenna Broadcast Channels
On the Required Accuracy of Transmitter Channel State Information in Multiple Antenna Broadcast Channels Giuseppe Caire University of Southern California Los Angeles, CA, USA Email: caire@usc.edu Nihar
More informationEstimation of Performance Loss Due to Delay in Channel Feedback in MIMO Systems
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Estimation of Performance Loss Due to Delay in Channel Feedback in MIMO Systems Jianxuan Du Ye Li Daqing Gu Andreas F. Molisch Jinyun Zhang
More informationSparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach
Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach Athina P. Petropulu Department of Electrical and Computer Engineering Rutgers, the State University of New Jersey Acknowledgments Shunqiao
More informationStopping Condition for Greedy Block Sparse Signal Recovery
Stopping Condition for Greedy Block Sparse Signal Recovery Yu Luo, Ronggui Xie, Huarui Yin, and Weidong Wang Department of Electronics Engineering and Information Science, University of Science and Technology
More informationUSING multiple antennas has been shown to increase the
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 1, JANUARY 2007 11 A Comparison of Time-Sharing, DPC, and Beamforming for MIMO Broadcast Channels With Many Users Masoud Sharif, Member, IEEE, and Babak
More informationCommunications over the Best Singular Mode of a Reciprocal MIMO Channel
Communications over the Best Singular Mode of a Reciprocal MIMO Channel Saeed Gazor and Khalid AlSuhaili Abstract We consider two nodes equipped with multiple antennas that intend to communicate i.e. both
More informationCompressive Sensing under Matrix Uncertainties: An Approximate Message Passing Approach
Compressive Sensing under Matrix Uncertainties: An Approximate Message Passing Approach Asilomar 2011 Jason T. Parker (AFRL/RYAP) Philip Schniter (OSU) Volkan Cevher (EPFL) Problem Statement Traditional
More informationExact Joint Sparse Frequency Recovery via Optimization Methods
IEEE TRANSACTIONS ON SIGNAL PROCESSING Exact Joint Sparse Frequency Recovery via Optimization Methods Zai Yang, Member, IEEE, and Lihua Xie, Fellow, IEEE arxiv:45.6585v [cs.it] 3 May 6 Abstract Frequency
More informationHarnessing 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 informationCSC 576: Variants of Sparse Learning
CSC 576: Variants of Sparse Learning Ji Liu Department of Computer Science, University of Rochester October 27, 205 Introduction Our previous note basically suggests using l norm to enforce sparsity in
More informationLimited Feedback in Wireless Communication Systems
Limited Feedback in Wireless Communication Systems - Summary of An Overview of Limited Feedback in Wireless Communication Systems Gwanmo Ku May 14, 17, and 21, 2013 Outline Transmitter Ant. 1 Channel N
More informationOptimal Transmit Strategies in MIMO Ricean Channels with MMSE Receiver
Optimal Transmit Strategies in MIMO Ricean Channels with MMSE Receiver E. A. Jorswieck 1, A. Sezgin 1, H. Boche 1 and E. Costa 2 1 Fraunhofer Institute for Telecommunications, Heinrich-Hertz-Institut 2
More informationMotivation Sparse Signal Recovery is an interesting area with many potential applications. Methods developed for solving sparse signal recovery proble
Bayesian Methods for Sparse Signal Recovery Bhaskar D Rao 1 University of California, San Diego 1 Thanks to David Wipf, Zhilin Zhang and Ritwik Giri Motivation Sparse Signal Recovery is an interesting
More information