English
Related papers

Related papers: Orthogonal AMP for Problems with Multiple Measurem…

200 papers

In this work we aim to solve the compressed sensing problem for the case of a complex unknown vector by utilizing the Bayesian-optimal structured signal approximate message passing (BOSSAMP) algorithm on the jointly sparse real and…

Information Theory · Computer Science 2015-11-30 Gabor Hannak , Martin Mayer , Gerald Matz , Norbert Goertz

This paper proposes Bayes-optimal convolutional approximate message-passing (CAMP) for signal recovery in compressed sensing. CAMP uses the same low-complexity matched filter (MF) for interference suppression as approximate message-passing…

Information Theory · Computer Science 2021-04-05 Keigo Takeuchi

Orbital Angular Momentum (OAM)-based communication systems offer high-capacity multiplexing in line-of-sight (LOS) scenarios; yet, their performance is sensitive to nodal misalignment, which disrupts modal orthogonality, hindering the data…

Signal Processing · Electrical Eng. & Systems 2026-01-27 Poorya Mollahosseini , Yasaman Ghasempour

The emerging orthogonal time frequency space (OTFS) modulation technique has shown its superiority to the current orthogonal frequency division multiplexing (OFDM) scheme, in terms of its capabilities of exploiting full time-frequency…

Signal Processing · Electrical Eng. & Systems 2019-12-02 Weijie Yuan , Zhiqiang Wei , Jinhong Yuan , Derrick Wing Kwan Ng

A common goal in many research areas is to reconstruct an unknown signal x from noisy linear measurements. Approximate message passing (AMP) is a class of low-complexity algorithms that can be used for efficiently solving such…

Signal Processing · Electrical Eng. & Systems 2020-03-27 Hangjin Liu , Cynthia Rush , Dror Baron

The problem of estimating a random vector x from noisy linear measurements y = A x + w with unknown parameters on the distributions of x and w, which must also be learned, arises in a wide range of statistical learning and linear inverse…

Information Theory · Computer Science 2017-06-20 Alyson K. Fletcher , Mojtaba Sahraee-Ardakan , Philip Schniter , Sundeep Rangan

Approximate message passing (AMP) methods and their variants have attracted considerable recent attention for the problem of estimating a random vector $\mathbf{x}$ observed through a linear transform $\mathbf{A}$. In the case of large…

Information Theory · Computer Science 2018-03-05 Sundeep Rangan , Philip Schniter , Alyson K. Fletcher , Subrata Sarkar

Deep generative priors are a powerful tool for reconstruction problems with complex data such as images and text. Inverse problems using such models require solving an inference problem of estimating the input and hidden units of the…

Information Theory · Computer Science 2019-03-05 Parthe Pandit , Mojtaba Sahraee , Sundeep Rangan , Alyson K. Fletcher

The denoising-based approximate message passing (D-AMP) methodology, recently proposed by Metzler, Maleki, and Baraniuk, allows one to plug in sophisticated denoisers like BM3D into the AMP algorithm to achieve state-of-the-art compressive…

Information Theory · Computer Science 2016-11-07 Philip Schniter , Sundeep Rangan , Alyson Fletcher

Approximate Message Passing (AMP) is a class of iterative algorithms that have found applications in many problems in high-dimensional statistics and machine learning. In its general form, AMP can be formulated as an iterative procedure…

Probability · Mathematics 2023-05-02 Rishabh Dudeja , Yue M. Lu , Subhabrata Sen

We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the…

Machine Learning · Statistics 2021-02-18 Marco Mondelli , Ramji Venkataramanan

Direction of Arrival (DOA) estimation of multiple narrow-band coherent or partially coherent sources is a major challenge in array signal processing. Though many subspace- based algorithms are available in literature, none of them tackle…

Information Theory · Computer Science 2018-01-26 Abhishek Aich , P. Palanisamy

Feature selection for predictive analytics is the problem of identifying a minimal-size subset of features that is maximally predictive of an outcome of interest. To apply to molecular data, feature selection algorithms need to be scalable…

Machine Learning · Statistics 2020-04-02 Michail Tsagris , Zacharias Papadovasilakis , Kleanthi Lakiotaki , Ioannis Tsamardinos

Orthogonal matching pursuit (OMP) is a greedy algorithm popularly being used for the recovery of sparse signals. In this paper, we study the performance of OMP for support recovery of sparse signal under noise. Our analysis shows that under…

Information Theory · Computer Science 2020-12-14 Hengkuan Lu , Jian Wang

Orthogonal matching pursuit~(OMP) is a commonly used greedy algorithm for recovering sparse signals from compressed measurements. In this paper, we introduce a variant of the OMP algorithm to reduce the complexity of reconstructing a class…

Signal Processing · Electrical Eng. & Systems 2025-11-25 Xinwei Zhao , Jinming Wen , Hongqi Yang , Xiao Ma

The Orthogonal Matching Pursuit (OMP) for compressed sensing iterates over a scheme of support augmentation and signal estimation. We present two novel matching pursuit algorithms with intrinsic regularization of the signal estimation step…

Information Theory · Computer Science 2019-02-22 Robert Seidel

Phase retrieval refers to the problem of recovering a high-dimensional vector $\boldsymbol{x} \in \mathbb{C}^N$ from the magnitude of its linear transform $\boldsymbol{z} = A \boldsymbol{x}$, observed through a noisy channel. To improve the…

Computation · Statistics 2024-10-10 Hajime Ueda , Shun Katakami , Masato Okada

As wireless communication applications evolve from traditional multipath environments to high-mobility scenarios like unmanned aerial vehicles, multiplexing techniques have advanced accordingly. Traditional single-carrier frequency-domain…

Information Theory · Computer Science 2026-01-15 Lei Liu , Yuhao Chi , Shunqi Huang , Zhaoyang Zhang

Generalized approximate message passing (GAMP) is a computationally efficient algorithm for estimating an unknown signal $w_0\in\mathbb{R}^N$ from a random linear measurement $y= Xw_0 + \epsilon\in\mathbb{R}^M$, where…

Information Theory · Computer Science 2025-08-06 Takashi Takahashi

Orthogonal frequency division multiplexing (OFDM), usually with sufficient cyclic prefix (CP), has been widely applied in various communication systems. The CP in OFDM consumes additional resource and reduces spectrum and energy efficiency.…

Information Theory · Computer Science 2019-05-07 Jing Zhang , Chao-Kai Wen , Shi Jin , Geoffrey Ye Li