English
Related papers

Related papers: Precoding via Approximate Message Passing with Ins…

200 papers

We propose a novel algorithm for compressive imaging that exploits both the sparsity and persistence across scales found in the 2D wavelet transform coefficients of natural images. Like other recent works, we model wavelet structure using a…

Computer Vision and Pattern Recognition · Computer Science 2015-05-30 Subhojit Som , Philip Schniter

We consider compressive imaging problems, where images are reconstructed from a reduced number of linear measurements. Our objective is to improve over existing compressive imaging algorithms in terms of both reconstruction error and…

Information Theory · Computer Science 2015-06-19 Jin Tan , Yanting Ma , Dror Baron

This paper addresses joint transceiver and relay design for a wireless multiple-input-multiple-output (MIMO) switching scheme that enables data exchange among multiple users. Here, a multi-antenna relay linearly precodes the received…

Information Theory · Computer Science 2016-11-18 Fanggang Wang , Xiaojun Yuan , Soung Chang Liew , Dongning Guo

In this paper, we present an algorithm for the sparse signal recovery problem that incorporates damped Gaussian generalized approximate message passing (GGAMP) into Expectation-Maximization (EM)-based sparse Bayesian learning (SBL). In…

Machine Learning · Computer Science 2018-02-14 Maher Al-Shoukairi , Philip Schniter , Bhaskar D. Rao

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

In this work, we propose iterative access point (AP) selection (APS), linear minimum mean-square error (MMSE) precoding and power allocation techniques for Cell-Free Massive multiple-input multiple-output (MIMO) systems. We consider the…

Information Theory · Computer Science 2021-04-13 V. Palhares , A. R. Flores , R. C. de Lamare

When recovering a sparse signal from noisy compressive linear measurements, the distribution of the signal's non-zero coefficients can have a profound effect on recovery mean-squared error (MSE). If this distribution was apriori known, then…

Information Theory · Computer Science 2015-06-05 Jeremy P. Vila , Philip Schniter

Modern mobile terminals often produce a large number of small data packets. For these packets, it is inefficient to follow the conventional medium access control protocols because of poor utilization of service resources. We propose a novel…

Information Theory · Computer Science 2014-09-05 Ronggui Xie , Huarui Yin , Xiaohui Chen , Zhengdao Wang

Least mean square (LMS) type adaptive algorithms have attracted much attention due to their low computational complexity. In the scenarios of sparse channel estimation, zero-attracting LMS (ZA-LMS), reweighted ZA-LMS (RZA-LMS) and…

Systems and Control · Computer Science 2015-04-14 Beiyi Liu , Guan Gui , Li Xu

We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and…

Information Theory · Computer Science 2015-03-19 David L. Donoho , Adel Javanmard , Andrea Montanari

In this work, a Bayesian approximate message passing algorithm is proposed for solving the multiple measurement vector (MMV) problem in compressive sensing, in which a collection of sparse signal vectors that share a common support are…

Information Theory · Computer Science 2013-01-29 Justin Ziniel , Philip Schniter

Least squares (LS) fitting is one of the most fundamental techniques in science and engineering. It is used to estimate parameters from multiple noisy observations. In many problems the parameters are known a-priori to be bounded integer…

Information Theory · Computer Science 2009-01-05 Amir Leshem , Jacob Goldberger

In this paper, we investigate the optimal precoding scheme for relay networks with finite-alphabet constraints. We show that the previous work utilizing various design criteria to maximize either the diversity order or the transmission rate…

Information Theory · Computer Science 2016-11-17 Weiliang Zeng , Chengshan Xiao , Mingxi Wang , Jianhua Lu

Approximate message passing (AMP) is an algorithmic framework for solving linear inverse problems from noisy measurements, with exciting applications such as reconstructing images, audio, hyper spectral images, and various other signals,…

Information Theory · Computer Science 2017-02-13 Junan Zhu , Ryan Pilgrim , Dror Baron

Properly designed precoders can significantly improve the spectral efficiency of multiple-input multiple-output (MIMO) relay systems. In this paper, we investigate joint source and relay precoding design based on the mean-square-error (MSE)…

Information Theory · Computer Science 2015-06-03 Rui Wang , Meixia Tao

In this letter, we present a widely-linear minimum mean square error (WL-MMSE) precoding scheme employing real-valued transmit symbols for downlink large-scale multi-user multiple-input single-output (MU-MISO) systems. In contrast to the…

Information Theory · Computer Science 2015-02-09 Shahram Zarei , Wolfgang Gerstacker , Robert Schober

In this paper, we consider a simple coding scheme for spatial modulation (SM), where the same set of active transmit antennas is repeatedly used over consecutive multiple transmissions. Based on a Gaussian approximation, an approximate…

Information Theory · Computer Science 2019-01-01 Jinho Choi

In this paper, we propose a low complexity graph-based linear minimum mean square error (LMMSE) equalizer in order to remove inter-symbol and inter-stream interference in multiple input multiple output (MIMO) communication. The proposed…

Information Theory · Computer Science 2017-01-04 Pinar Sen , Ali Ozgur Yilmaz

We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics…

Information Theory · Computer Science 2014-10-22 Yanting Ma , Junan Zhu , Dror Baron

Reconstruction of images from noisy linear measurements is a core problem in image processing, for which convex optimization methods based on total variation (TV) minimization have been the long-standing state-of-the-art. We present an…

Information Theory · Computer Science 2016-08-31 Jean Barbier , Eric W. Tramel , Florent Krzakala