Related papers: Bayesian Greedy Receiver for Pulse Position Modula…

As a lossy compression framework, compressed sensing has drawn much attention in wireless telemonitoring of biosignals due to its ability to reduce energy consumption and make possible the design of low-power devices. However, the…

Much stringent reliability and processing latency requirements in ultra-reliable-low-latency-communication (URLLC) traffic make the design of linear massive multiple-input-multiple-output (M-MIMO) receivers becomes very challenging.…

Channel Estimation is a major problem encountered by receiver designers for wireless communications systems. The fading channels encountered by the system are usually time variant for a mobile receiver. Besides, the frequency response of…

Electromagnetic remote sensing technologies such as radar can be mislead by targets that generate spoof pulses. Typically, a would-be spoofer must make measurements to characterize a received pulse in order to design a convincing spoof…

We investigate the performance of the standard Greedy algorithm for cardinality constrained maximization of non-submodular nondecreasing set functions. While there are strong theoretical guarantees on the performance of Greedy for…

We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though…

In the area of magnetic resonance imaging (MRI), an extensive range of non-linear reconstruction algorithms have been proposed that can be used with general Fourier subsampling patterns. However, the design of these subsampling patterns has…

In this paper, we revisit a recently proposed receiver design, named the splitting receiver, which jointly uses coherent and non-coherent processing for signal detection. By considering an improved signal model for the splitting receiver as…

We construct new classical Goppa codes and corresponding quantum stabilizer codes from plane curves defined by separated polynomials. In particular, over $\mathbb{F}_3$ with the Hermitian curve $y^3 + y = x^4$, we obtain a ternary code of…

The present era of quantum processors with hundreds to thousands of noisy qubits has sparked interest in understanding the computational power of these devices and how to leverage it to solve practically relevant problems. For applications…

Distributed optimization is pivotal for large-scale signal processing and machine learning, yet communication overhead remains a major bottleneck. Low-rank gradient compression, in which the transmitted gradients are approximated by…

In this paper we consider the task of estimating the non-zero pattern of the sparse inverse covariance matrix of a zero-mean Gaussian random vector from a set of iid samples. Note that this is also equivalent to recovering the underlying…

We address the long-standing problem of how to learn effective pixel-based image diffusion models at scale, introducing a remarkably simple greedy growing method for stable training of large-scale, high-resolution models. without the needs…

This paper proposes a new algorithm for multiple sparse regression in high dimensions, where the task is to estimate the support and values of several (typically related) sparse vectors from a few noisy linear measurements. Our algorithm is…

We consider distributed estimation of a Gaussian source in a heterogenous bandwidth constrained sensor network, where the source is corrupted by independent multiplicative and additive observation noises, with incomplete statistical…

Bayesian persuasion studies how an informed sender should partially disclose information to influence the behavior of a self-interested receiver. Classical models make the stringent assumption that the sender knows the receiver's utility.…

We study a linear quadratic regulation problem with a constraint where the control input can be nonzero only at a limited number of times. Given that this constraint leads to a combinational optimization problem, we adopt a greedy method to…

A grouping-circular-based (GCB) greedy algorithm is proposed to promote the efficiency of mesh deformation. By incorporating the multigrid concept that the computational errors on the fine mesh can be approximated with those on the coarse…

With a Bayesian Gaussian regression approach, a systematic method for analyzing a storage ring's beam position monitor (BPM) system requirements has been developed. The ultimate performance of a ring-based accelerator, based on brightness…

Spectator qubits (SQs) for random-telegraph noise mitigation have been proposed by Song et al., Phys. Rev. A, 107, L030601 (2023), where an SQ operates as a noise probe to estimate optimal noise-correction control on the hard-to-access data…