English
Related papers

Related papers: Sparse Grassmannian Design for Noncoherent Codes v…

200 papers

We have previously reported a Bayesian algorithm for determining the coordinates of points in three-dimensional space from uncertain constraints. This method is useful in the determination of biological molecular structure. It is limited,…

Artificial Intelligence · Computer Science 2013-02-28 Russ B. Altman , Cheng C. Chen , William B. Poland , Jaswinder Pal Singh

We show how to construct sparse polynomial systems that have non-trivial lower bounds on their numbers of real solutions. These are unmixed systems associated to certain polytopes. For the order polytope of a poset P this lower bound is the…

Algebraic Geometry · Mathematics 2010-03-29 Evgenia Soprunova , Frank Sottile

We consider Gaussian multiple-input multiple-output (MIMO) channels with discrete input alphabets. We propose a non-diagonal precoder based on the X-Codes in \cite{Xcodes_paper} to increase the mutual information. The MIMO channel is…

Information Theory · Computer Science 2016-11-17 Saif Khan Mohammed , Emanuele Viterbo , Yi Hong , Ananthanarayanan Chockalingam

This paper studies the impact of probabilistic shaping on effective signal-to-noise ratios (SNRs) and achievable information rates (AIRs) in a back-to-back configuration and in unrepeated nonlinear fiber transmissions. For back-to-back,…

We present a general method for the error analysis of spatial modulation (SM) systems over correlated and uncorrelated Rayleigh and Rician fading channels. The proposed method, making use of the properties of proper complex random variables…

Information Theory · Computer Science 2011-09-27 Mutlu Koca , Hikmet Sari

We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the…

Numerical Analysis · Mathematics 2015-06-22 Eugene Vecharynski , Chao Yang , John E. Pask

The communication bottleneck has been a critical problem in large-scale distributed deep learning. In this work, we study distributed SGD with random block-wise sparsification as the gradient compressor, which is ring-allreduce compatible…

Machine Learning · Computer Science 2022-06-14 An Xu , Heng Huang

Variable selection for recovering sparsity in nonadditive nonparametric models has been challenging. This problem becomes even more difficult due to complications in modeling unknown interaction terms among high dimensional variables. There…

Methodology · Statistics 2012-06-14 Zaili Fang , Inyoung Kim , Patrick Schaumont

Slow fading broadcast channels can model a wide range of applications in wireless networks. Due to delay requirements and the unavailability of the channel state information at the transmitter (CSIT), these channels for many applications…

Information Theory · Computer Science 2019-07-23 Hossein Khoshnevis , Ian Marsland , Hamid Jafarkhani , Halim Yanikomeroglu

The mutual interference between similar radar systems can result in reduced radar sensitivity and increased false alarm rates. To address the synchronous and asynchronous interference mitigation problems in similar radar systems, we first…

Signal Processing · Electrical Eng. & Systems 2022-08-10 Arindam Bose , Bo Tang , Wenjie Huang , Mojtaba Soltanalian , Jian Li

In this paper, we consider the mixture of sparse linear regressions model. Let ${\beta}^{(1)},\ldots,{\beta}^{(L)}\in\mathbb{C}^n$ be $ L $ unknown sparse parameter vectors with a total of $ K $ non-zero coefficients. Noisy linear…

Information Theory · Computer Science 2018-08-03 Dong Yin , Ramtin Pedarsani , Yudong Chen , Kannan Ramchandran

We develop a framework that we call compressive rate estimation. We assume that the composite channel gain matrix (i.e. the matrix of all channel gains between all network nodes) is compressible which means it can be approximated by a…

Information Theory · Computer Science 2015-04-29 Jan Schreck , Peter Jung , Sławomir Stańczak

Classical model reduction techniques project the governing equations onto a linear subspace of the original state space. More recent data-driven techniques use neural networks to enable nonlinear projections. Whilst those often enable…

Numerical Analysis · Mathematics 2024-06-19 Tjeerd Jan Heeringa , Christoph Brune , Mengwu Guo

We address the problem of recovering a sparse signal observed by a resource constrained wireless sensor network under channel fading. Sparse random matrices are exploited to reduce the communication cost in forwarding information to a…

Information Theory · Computer Science 2015-04-16 Thakshila Wimalajeewa , Pramod K. Varshney

In this paper we consider decoherence-free communication over multiple access and $k$-user quantum channels. First, we concentrate on a hermitian unitary noise model $U$ for a two-access bi-unitary channel and show that in this case a…

Quantum Physics · Physics 2022-01-03 Maciej Demianowicz

Additive nonparametric regression models provide an attractive tool for variable selection in high dimensions when the relationship between the response and predictors is complex. They offer greater flexibility compared to parametric…

Machine Learning · Statistics 2016-07-12 Garret Vo , Debdeep Pati

A numerical approach to design unitary constellation for any dimension and any transmission rate under non-coherent Rayleigh flat fading channel.

Optimization and Control · Mathematics 2025-10-20 Guangyue Han , Joachim Rosenthal

This paper investigates a recursive formulation of auto-regressive multi-fidelity Gaussian process regression in the challenging setting of noisy and non-nested high- and low-fidelity data. We propose a decoupled optimization strategy based…

Applications · Statistics 2026-05-21 Nils Baillie , Baptiste Kerleguer , Cyril Feau , Josselin Garnier

Sparse regression codes (SPARC) connect the sparse signal recovery framework of compressive sensing with error control coding techniques. SPARC encoding produces codewords which are \emph{sparse} linear combinations of columns of a…

Information Theory · Computer Science 2023-03-27 Madhusudan Kumar Sinha , Arun Pachai Kannu

Compressive sampling has been widely used for sparse polynomial chaos (PC) approximation of stochastic functions. The recovery accuracy of compressive sampling highly depends on the incoherence properties of the measurement matrix. In this…

Computation · Statistics 2018-10-17 Negin Alemazkoor , Hadi Meidani