2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2011
DOI: 10.1109/icassp.2011.5946268
|View full text |Cite
|
Sign up to set email alerts
|

Estimating Sparse MIMO channels having Common Support

Abstract: We propose an algorithm (SCS-FRI) to estimate multipath channels with Sparse Common Support (SCS) based on Finite Rate of Innovation (FRI) sampling. In this setup, theoretical lower-bounds are derived, and simulation in a Rayleigh fading environment shows that SCS-FRI gets very close to these bounds. We show how to apply SCS-FRI to OFDM and CDMA downlinks. Recovery of a sparse common support is, among other, especially relevant for channel estimation in a multiple output system or beam-forming from multiple in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 19 publications
(22 reference statements)
0
7
0
Order By: Relevance
“…We call the corresponding algorithm "Block-Prony TLS", listed under Algorithm 1. It solves the annihilating filter equation (8) in the total least-square (TLS) sense. The crucial step is the identification of what shall be the unidimensional null space of H (K+1) in a noiseless case.…”
Section: Proposition 2 For a Set Of Exact Scs Channels With K Distinmentioning
confidence: 99%
“…We call the corresponding algorithm "Block-Prony TLS", listed under Algorithm 1. It solves the annihilating filter equation (8) in the total least-square (TLS) sense. The crucial step is the identification of what shall be the unidimensional null space of H (K+1) in a noiseless case.…”
Section: Proposition 2 For a Set Of Exact Scs Channels With K Distinmentioning
confidence: 99%
“…Out of the many available sparse PDPs, Brazil‐A PDP [19] is chosen in this study. Furthermore, the sparse MIMO channels pertaining to each user are considered with an approximate sparse common support [20], while MIMO channels corresponding to different users have been considered with different Nt values. For the kth user, the number of non‐zero taps is Nnormaltk.…”
Section: Multi‐user Mimo–ofdm System Modelmentioning
confidence: 99%
“…3(b). Consider the central antenna r C =1, its |N |=2 direct neighbors with (shared) partial estimates given in (24). The partial correlation and error covariance matrices associated with those estimates (shown underlined) along with that of central element are given in (29) and (30) respectively.…”
Section: Updatementioning
confidence: 99%
“…In particular, they suffer from huge complexity due to matrix inversion of very large dimensionality, making it impractical. Some methods to reduce the complexity of MMSE estimator in massive MIMO have also been proposed e.g., [19]- [24]. It is important to note that most of the existing methods make assumptions that are not always true.…”
Section: Introductionmentioning
confidence: 99%