Multi-Source Approximate Message Passing with Random Semi-Unitary Dictionaries

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Çakmak, Burak, Caire, Giuseppe
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866912195975053312
author Çakmak, Burak
Caire, Giuseppe
author_facet Çakmak, Burak
Caire, Giuseppe
contents Motivated by the recent interest in approximate message passing (AMP) for matrix-valued linear observations with superposition of \emph{multiple statistically asymmetric signal sources}, we introduce a multi-source AMP framework in which the dictionary matrices associated with each signal source are drawn from a \emph{random semi-unitary ensemble} (rather than the standard Gaussian matrix ensemble.) While a similar model has been explored by Vehkaper{ä}, Kabashima, and Chatterjee (2016) using the replica method, here we present an AMP algorithm and provide a high-dimensional yet \emph{finite-sample} analysis. As a proof of concept, we show the effectiveness of the proposed approach on the problem of \emph{message detection and channel estimation} in an unsourced random access scenario in wireless communication.
format Preprint
id arxiv_https___arxiv_org_abs_2410_13021
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Multi-Source Approximate Message Passing with Random Semi-Unitary Dictionaries
Çakmak, Burak
Caire, Giuseppe
Information Theory
Motivated by the recent interest in approximate message passing (AMP) for matrix-valued linear observations with superposition of \emph{multiple statistically asymmetric signal sources}, we introduce a multi-source AMP framework in which the dictionary matrices associated with each signal source are drawn from a \emph{random semi-unitary ensemble} (rather than the standard Gaussian matrix ensemble.) While a similar model has been explored by Vehkaper{ä}, Kabashima, and Chatterjee (2016) using the replica method, here we present an AMP algorithm and provide a high-dimensional yet \emph{finite-sample} analysis. As a proof of concept, we show the effectiveness of the proposed approach on the problem of \emph{message detection and channel estimation} in an unsourced random access scenario in wireless communication.
title Multi-Source Approximate Message Passing with Random Semi-Unitary Dictionaries
topic Information Theory
url https://arxiv.org/abs/2410.13021