English
Related papers

Related papers: Efficient Massive Machine Type Communication (mMTC…

200 papers

In a recent paper, the authors proposed a new class of low-complexity iterative thresholding algorithms for reconstructing sparse signals from a small set of linear measurements \cite{DMM}. The new algorithms are broadly referred to as AMP,…

Information Theory · Computer Science 2009-11-24 David L. Donoho , Arian Maleki , Andrea Montanari

High-dimensional signal recovery of standard linear regression is a key challenge in many engineering fields, such as, communications, compressed sensing, and image processing. The approximate message passing (AMP) algorithm proposed by…

Information Theory · Computer Science 2022-03-02 Qiuyun Zou , Hongwen Yang

We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability.…

Information Theory · Computer Science 2025-04-28 Matthias Frey , Igor Bjelaković , Michael C. Gastpar , Jingge Zhu

This paper tackles the problem of millimeter-Wave (mmWave) channel estimation in massive MIMO communication systems. A new Bayes-optimal channel estimator is derived using recent advances in the approximate belief propagation (BP) Bayesian…

Information Theory · Computer Science 2019-03-07 Faouzi Bellili , Foad Sohrabi , Wei Yu

We propose a tensor generalized approximate message passing (TeG-AMP) algorithm for low-rank tensor inference, which can be used to solve tensor completion and decomposition problems. We derive TeG-AMP algorithm as an approximation of the…

Machine Learning · Computer Science 2025-04-02 Yinchuan Li , Guangchen Lan , Xiaodong Wang

Often, large, high dimensional datasets collected across multiple modalities can be organized as a higher order tensor. Low-rank tensor decomposition then arises as a powerful and widely used tool to discover simple low dimensional…

Machine Learning · Statistics 2020-01-29 Jonathan Kadmon , Surya Ganguli

Lattice codes used under the Compute-and-Forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): The receiver successively decodes integer linear combinations of the messages until it can…

Information Theory · Computer Science 2016-11-17 Jingge Zhu , Michael Gastpar

This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base station (BS) with imperfect synchronization. The goal is to design…

Information Theory · Computer Science 2021-01-05 Weifeng Zhu , Meixia Tao , Xiaojun Yuan , Yunfeng Guan

Efficient signal detectors are rather important yet challenging to achieve satisfactory performance for large-scale communication systems. This paper considers a non-orthogonal sparse code multiple access (SCMA) configuration for…

Signal Processing · Electrical Eng. & Systems 2023-03-16 Yao Ge , Lei Liu , Shunqi Huang , David González G. , Yong Liang Guan , Zhi Ding

Designing efficient sparse recovery algorithms that could handle noisy quantized measurements is important in a variety of applications -- from radar to source localization, spectrum sensing and wireless networking. We take advantage of the…

Signal Processing · Electrical Eng. & Systems 2022-05-24 Shuai Huang , Deqiang Qiu , Trac D. Tran

Sparse superposition (SS) codes were originally proposed as a capacity-achieving communication scheme over the additive white Gaussian noise channel (AWGNC) [1]. Very recently, it was discovered that these codes are universal, in the sense…

Information Theory · Computer Science 2020-06-05 Erdem Biyik , Jean Barbier , Mohamad Dia

Approximate message passing (AMP) methods have gained recent traction in sparse signal recovery. Additional information about the signal, or \emph{side information} (SI), is commonly available and can aid in efficient signal recovery. This…

Information Theory · Computer Science 2019-05-06 Anna Ma , You , Zhou , Cynthia Rush , Dror Baron , Deanna Needell

We give a fast, spectral procedure for implementing approximate-message passing (AMP) algorithms robustly. For any quadratic optimization problem over symmetric matrices $X$ with independent subgaussian entries, and any separable AMP…

Data Structures and Algorithms · Computer Science 2024-11-06 Misha Ivkov , Tselil Schramm

We establish a multi-user extrinsic information transfer (EXIT) chart area theorem for the interleave-division multiple-access (IDMA) scheme, a special form of superposition coding, in multiple access channels (MACs). A low-cost multi-user…

Information Theory · Computer Science 2019-07-24 Xiaojie Wang , Chulong Liang , Li Ping , Stephan ten Brink

The Recently proposed Vector Approximate Message Passing (VAMP) algorithm demonstrates a great reconstruction potential at solving compressed sensing related linear inverse problems. VAMP provides high per-iteration improvement, can utilize…

Information Theory · Computer Science 2024-10-30 Nikolajs Skuratovs , Michael Davies

Approximate Message Passing (AMP) type algorithms are widely used for signal recovery in high-dimensional noisy linear systems. Recently, a principle called Memory AMP (MAMP) was proposed. Leveraging this principle, the gradient descent…

Information Theory · Computer Science 2026-01-01 Shunqi Huang , Lei Liu , Brian M. Kurkoski

We establish a multiuser extrinsic information transfer (EXIT) chart area theorem for the interleave-division multiple access (IDMA) scheme, a special form of superposition coding, in multiple access channels (MACs). A low-cost multi-user…

Information Theory · Computer Science 2019-07-29 Xiaojie Wang , Chulong Liang , Li Ping , Stephan ten Brink

Approximate message passing (AMP) algorithms are devised under the Gaussianity assumption of the measurement noise vector. In this work, we relax this assumption within the vector AMP (VAMP) framework to arbitrary independent and…

Information Theory · Computer Science 2024-02-07 Mohamed Akrout , Tiancheng Gao , Faouzi Bellili , Amine Mezghani

In this paper we consider the generalized approximate message passing (GAMP) algorithm for recovering a sparse signal from modulo samples of randomized projections of the unknown signal. The modulo samples are obtained by a self-reset (SR)…

Signal Processing · Electrical Eng. & Systems 2018-07-10 Osman Musa , Peter Jung , Norbert Goertz

In order to reduce hardware complexity and power consumption, massive multiple-input multiple-output (MIMO) systems employ low-resolution analog-to-digital converters (ADCs) to acquire quantized measurements $\boldsymbol y$. This poses new…

Information Theory · Computer Science 2021-02-12 Shuai Huang , Deqiang Qiu , Trac D. Tran