Exploiting General Multi-Dimensional Priors in Compressed-Sensing Reconstruction

Konferenz: SCC 2019 - 12th International ITG Conference on Systems, Communications and Coding
11.02.2019 - 14.02.2019 in Rostock, Germany

doi:10.30420/454862020

Tagungsband: SCC 2019

Seiten: 6Sprache: EnglischTyp: PDF

Persönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt

Autoren:
Birgmeier, Stefan C.; Goertz, Norbert (TU Wien, Institute of Telecommunications, Austria)

Inhalt:
Message passing based algorithms have been shown to perform well in terms of minimum mean-squared error for high-dimensional signals composed of independent and identically distributed one-dimensional and sparse components. These conditions limit the applicability and performance of these algorithms since dependencies among components are not used during recovery. A detailed derivation is given that, as a novelty, extends the known derivation of the conventional Bayesian Approximate Message Passing scheme (BAMP) to general multi-dimensional priors. The proposed algorithms significantly reduce the number of samples required for reconstruction compared to methods which do not exploit dependencies. Applications include multiple-measurement vector (MMV) problems, group sparsity as well as symbol recovery in MIMO systems and reconstruction in the case of general, non-sparse dependencies between components.