Related papers: Part I: Improving Computational Efficiency of Comm…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…
In this paper, we study power allocation for secure communication in a multiuser multiple-input single-output (MISO) downlink system with simultaneous wireless information and power transfer. The receivers are able to harvest energy from…
LEO satellite communication has drawn particular attention recently due to its high data rate services and low round-trip latency. It is low-cost to launch and can provide global coverage. However, the spectrum scarcity might be one of the…
Powered by renewable energy sources, cellular communication systems usually have different wireless traffic loads and available resources over time. To match their traffics, it is beneficial for two neighboring systems to cooperate in…
Many signal processing problems can be solved by maximizing the fitness of a segmented model over all possible partitions of the data interval. This letter describes a simple but powerful algorithm that searches the exponentially large…
For a wide class of multi-user systems, a subset of capacity region which includes the corner points and the sum-capacity facet has a special structure known as polymatroid. Multiaccess channels with fixed input distributions and…
Massive multiple-input multiple-output (MIMO) technology facilitates huge increases in the capacity of wireless channels, while non-orthogonal multiple access (NOMA) addresses the problem of limited resources in traditional orthogonal…
We propose a downlink beamforming scheme that combines spatial division and orthogonal space-time block coding (OSTBC) in multi-user massive MIMO systems. The beamformer is divided into two parts: a pre-beamforming matrix to separate the…
Sharpness-aware minimization (SAM) has well documented merits in enhancing generalization of deep neural networks, even without sizable data augmentation. Embracing the geometry of the loss function, where neighborhoods of 'flat minima'…
In this paper we propose and prove that cyclic quorum sets can efficiently manage all-pairs computations and data replication. The quorums are O(N/sqrt(P)) in size, up to 50% smaller than the dual N/sqrt(P) array implementations, and…
The goal of this paper is to develop a novel numerical method for efficient multiplicative noise removal. The nonlocal self-similarity of natural images implies that the matrices formed by their nonlocal similar patches are low-rank. By…
The last decade has witnessed an explosion in the development of models, theory and computational algorithms for "big data" analysis. In particular, distributed computing has served as a natural and dominating paradigm for statistical…
In this paper, the sum-rate maximization problem is studied for wireless networks that use downlink rate splitting multiple access (RSMA). In the considered model, each base station (BS) divides the messages that must be transmitted to its…
Stochastic First-Order (SFO) methods have been a cornerstone in addressing a broad spectrum of modern machine learning (ML) challenges. However, their efficacy is increasingly questioned, especially in large-scale applications where…
In the All-Reduce problem, each one of the K nodes holds an input and wishes to compute the sum of all K inputs through a communication network where each pair of nodes is connected by a parallel link with arbitrary bandwidth. The…
Interference Alignment is a new solution to over- come the problem of interference in multiuser wireless com- munication systems. Recently, the Compute-and-Forward (CF) transform has been proposed to approximate the capacity of K- user…
We address the problem of joint sparsity pattern recovery based on low dimensional multiple measurement vectors (MMVs) in resource constrained distributed networks. We assume that distributed nodes observe sparse signals which share the…
This paper considers the joint precoder design problem for multiple-input single-output (MISO) systems with coordinated base stations (BSs). We consider maximization of the total sum rate with per BS antenna power constraint problem. For…
We show that many classical optimization problems --- such as $(1\pm\epsilon)$-approximate maximum flow, shortest path, and transshipment --- can be computed in $\newcommand{\tmix}{{\tau_{\text{mix}}}}\tmix(G)\cdot n^{o(1)}$ rounds of…
This two-part paper explores the use of FP in the design and optimization of communication systems. Part I of this paper focuses on FP theory and on solving continuous problems. The main theoretical contribution is a novel quadratic…