In the last few decades, a series of increasingly sophisticated satellite missions has brought us gravity and magnetometry data of ever improving quality. To make optimal use of this rich source of information on the structure of the Earth and other celestial bodies, our computational algorithms should be well matched to the specific properties of the data. In particular, inversion methods requ...

This paper attempts to examine the optimality of LDPC codes for compression of nonuniform source with Slepian-Wolf coding using density evolution technique. The primary goal is to evaluate the performance of LDPC codes with reference to turbo codes (in SF-ISF setup). The appreciable difference between LDPC and turbo codes is also discussed in this paper. The threshold values obtained from the d...

Building upon Slepian-Wolf coding, sparse-graph codes, belief propagation, and closed-loop iterative doping, we propose new schemes for interactive data exchange between two agents who want to communicate losslessly their respective information via several rounds of communication.

ABSTRACT In a recent paper, Slepian and Philcox derive an explicit solution of the homologous collapse from rest uniform density sphere under its self-gravity as function time. Their is given in terms two curvilinear integrals along suitable Jordan contour; practice, it must be approximated by quadrature rule. The aim this paper to examine how choice contour rule affects accuracy efficiency int...

We present a fast two-phase algorithm for super-resolution with strong theoretical guaran-tees. Given the low-frequency part of the spectrum of a sequence of impulses, Phase I consistsof a greedy algorithm that roughly estimates the impulse positions. These estimates are thenrefined by local optimization in Phase II.In contrast to the convex relaxation proposed by Candès et ...

ABSTRACT We review the construction of three different Slepian bases on the sphere, and illustrate their theoretical behavior and practical use for solving ill-posed satellite inverse problems. The first basis is scalar, the second vectorial, and the third suitable for the vector representation of the harmonic potential fields on which we focus our analysis. When data are noisy and incompletely...

In this work we consider a quantum generalization of the task considered by Slepian andWolf [1] regarding distributed source compression. In our task Alice, Bob, Charlie and Reference share a joint pure state. Alice and Bob wish to send a part of their respective systems to Charlie without collaborating with each other. We give achievability bounds for this task in the one-shot setting and prov...