English
Related papers

Related papers: Sparse Grassmannian Design for Noncoherent Codes v…

200 papers

This paper studies network information theory problems where the external noise is Gaussian distributed. In particular, the Gaussian broadcast channel with coherent fading and the Gaussian interference channel are investigated. It is shown…

Information Theory · Computer Science 2010-02-12 Emmanuel Abbe , Lizhong Zheng

For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. These codes are based on the statistical high-dimensional regression framework. The paper [IEEE Trans. Inform.…

Information Theory · Computer Science 2012-07-11 Antony Joseph , Andrew Barron

Inspired by compressive sensing principles, we propose novel error control coding techniques for communication systems. The information bits are encoded in the support and the non-zero entries of a sparse signal. By selecting a dictionary…

Information Theory · Computer Science 2021-02-09 Madhusudan Kumar Sinha , Arun Pachai Kannu

We study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subsets of columns of a…

Information Theory · Computer Science 2015-12-21 Ramji Venkataramanan , Antony Joseph , Sekhar Tatikonda

Multimode precoding, where the number of independent data-streams is adapted optimally, can be used to maximize the achievable throughput in multi-antenna communication systems. Motivated by standardization efforts embraced by the industry,…

Information Theory · Computer Science 2015-10-28 Vasanthan Raghavan , Venu Veeravalli , Akbar Sayeed

Motivated by the question of optimal functional approximation via compressed sensing, we propose generalizations of the Iterative Hard Thresholding and the Compressive Sampling Matching Pursuit algorithms able to promote sparse in levels…

Information Theory · Computer Science 2021-11-01 Ben Adcock , Simone Brugiapaglia , Matthew King-Roskamp

Multivariate global polynomial approximations - such as polynomial chaos or stochastic collocation methods - are now in widespread use for sensitivity analysis and uncertainty quantification. The pseudospectral variety of these methods uses…

Numerical Analysis · Mathematics 2013-04-09 Paul G. Constantine , Michael S. Eldred , Eric T. Phipps

In this paper, we devise a sparse array design algorithm for adaptive beamforming. Our strategy is based on finding a sparse beamformer weight to maximize the output signal-to-interference-plus-noise ratio (SINR). The proposed method…

Signal Processing · Electrical Eng. & Systems 2023-10-17 Huiping Huang , Hing Cheung So , Abdelhak M. Zoubir

Spatial frequency estimation from a mixture of noisy sinusoids finds applications in various fields. While subspace-based methods offer cost-effective super-resolution parameter estimation, they demand precise array calibration, posing…

Signal Processing · Electrical Eng. & Systems 2024-10-23 Tianyi Liu , Sai Pavan Deram , Khaled Ardah , Martin Haardt , Marc E. Pfetsch , Marius Pesavento

The paper considers sparse array design for receive beamforming achieving maximum signal-to-interference plus noise ratio (MaxSINR) for both single point source and multiple point sources, operating in an interference active environment.…

Signal Processing · Electrical Eng. & Systems 2020-01-08 Syed A. Hamza , Moeness G. Amin

The \emph{deterministic} sparse grid method, also known as Smolyak's method, is a well-established and widely used tool to tackle multivariate approximation problems, and there is a vast literature on it. Much less is known about…

Numerical Analysis · Mathematics 2022-02-11 Marcin Wnuk , Michael Gnewuch

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

Sparse coding refers to the pursuit of the sparsest representation of a signal in a typically overcomplete dictionary. From a Bayesian perspective, sparse coding provides a Maximum a Posteriori (MAP) estimate of the unknown vector under a…

Signal Processing · Electrical Eng. & Systems 2019-09-04 Dror Simon , Jeremias Sulam , Yaniv Romano , Yue M. Lu , Michael Elad

In this paper, we propose a sparsity-promoting feedback control design for stochastic linear systems with multiplicative noise. The objective is to identify a sparse control architecture that optimizes the closed-loop performance while…

Optimization and Control · Mathematics 2022-08-22 Yi Guo , Ognjen Stanojev , Gabriela Hug , Tyler Summers

Sparse superposition codes, or sparse regression codes (SPARCs), are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a…

Information Theory · Computer Science 2019-04-24 Cynthia Rush , Ramji Venkataramanan

We study sparse regression codes (SPARC) for multiple access channels with multiple receive antennas, in non-coherent flat fading channels. We propose a novel practical decoder, referred to as maximum likelihood matching pursuit (MLMP),…

Signal Processing · Electrical Eng. & Systems 2025-07-16 V S V Sandeep , Sai Dinesh Kancharana , Arun Pachai Kannu

Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient communication over the AWGN channel. With an appropriate power allocation, these codes have been shown to be asymptotically…

Information Theory · Computer Science 2018-03-19 Adam Greig , Ramji Venkataramanan

The maximum absolute correlation between regressors, which is called mutual coherence, plays an essential role in sparse estimation. A regressor matrix whose columns are highly correlated may result from optimal input design, since there is…

Systems and Control · Electrical Eng. & Systems 2024-10-11 Javad Parsa , Cristian R. Rojas , Håkan Hjalmarsson

Sparse Regression Codes (SPARCs) are capacity-achieving codes introduced for communication over the Additive White Gaussian Noise (AWGN) channels and were later extended to general memoryless channels. In particular it was shown via…

Information Theory · Computer Science 2024-09-10 Yuhao Liu , Yizhou Xu , Tianqi Hou

We consider the design and analysis of spatially coupled sparse regression codes (SC-SPARCs), which were recently introduced by Barbier et al. for efficient communication over the additive white Gaussian noise channel. SC-SPARCs can be…

Information Theory · Computer Science 2018-04-27 Kuan Hsieh , Cynthia Rush , Ramji Venkataramanan