Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPhaseless Reconstruction from Space-Time Samples
127
0
0.0
(
0
)
Added by
Sui Tang
Publication date
2017
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Phaseless reconstruction from space-time samples is a nonlinear problem of recovering a function $x$ in a Hilbert space $mathcal{H}$ from the modulus of linear measurements ${lvert langle x, phi_irangle rvert$, $ ldots$, $lvert langle A^{L_i}x, phi_i rangle rvert : i inmathscr I}$, where ${phi_i; i inmathscr I}subset mathcal{H}$ is a set of functionals on $mathcal{H}$, and $A$ is a bounded operator on $mathcal{H}$ that acts as an evolution operator. In this paper, we provide various sufficient or necessary conditions for solving this problem, which has connections to $X$-ray crystallography, the scattering transform, and deep learning.
rate research
Read More
For a wide family of even kernels ${varphi_u, uin I}$, we describe discrete sets $Lambda$ such that every bandlimited signal $f$ can be reconstructed from the space-time samples ${(fastvarphi_u)(lambda), lambdainLambda, uin I}$.
The multipath radio channel is considered to have a non-bandlimited channel impulse response. Therefore, it is challenging to achieve high resolution time-delay (TD) estimation of multipath components (MPCs) from bandlimited observations of communication signals. It this paper, we consider the problem of multiband channel sampling and TD estimation of MPCs. We assume that the nonideal multibranch receiver is used for multiband sampling, where the noise is nonuniform across the receiver branches. The resulting data model of Hankel matrices formed from acquired samples has multiple shift-invariance structures, and we propose an algorithm for TD estimation using weighted subspace fitting. The subspace fitting is formulated as a separable nonlinear least squares (NLS) problem, and it is solved using a variable projection method. The proposed algorithm supports high resolution TD estimation from an arbitrary number of bands, and it allows for nonuniform noise across the bands. Numerical simulations show that the algorithm almost attains the Cramer Rao Lower Bound, and it outperforms previously proposed methods such as multiresolution TOA, MI-MUSIC, and ESPRIT.
A notion of band limited functions is considered in the case of the hyperbolic plane in its Poincare upper half-plane $mathbb{H}$ realization. The concept of band-limitedness is based on the existence of the Helgason-Fourier transform on $mathbb{H}$. An iterative algorithm is presented, which allows to reconstruct band-limited functions from some countable sets of their values. It is shown that for sufficiently dense metric lattices a geometric rate of convergence can be guaranteed as long as the sampling density is high enough compared to the band-width of the sampled function.
We study neutrino-nucleus charged-current reactions on finite nuclei for the situation in which an outgoing muon and a proton are detected in coincidence, i.e., we focus on semi-inclusive cross sections. We limit our attention to one-body current interactions (quasielastic scattering) and assess the impact of different nuclear effects in the determination of the neutrino energy. We identify the regions in phase space where the neutrino energy can be reconstructed relatively well, and study whether the cross section in those regions is significant. Our results indicate that it is possible to filter more than 50% of all events according to the muon and proton kinematics, so that for the DUNE and T2K fluxes the neutrino energy can be determined with an uncertainty of less than 1% and 3%, respectively. Furthermore, we find that the reconstructed neutrino energy does not depend strongly on how one treats the final-state interactions and is not much affected by the description of the initial state. On the other hand, the estimations of the uncertainty on the neutrino energy show important sensitivity to the modeling of the initial state.
One-time memories (OTMs) are simple tamper-resistant cryptographic devices, which can be used to implement one-time programs, a very general form of software protection and program obfuscation. Here we investigate the possibility of building OTMs using quantum mechanical devices. It is known that OTMs cannot exist in a fully-quantum world or in a fully-classical world. Instead, we propose a new model based on isolated qubits -- qubits that can only be accessed using local operations and classical communication (LOCC). This model combines a quantum resource (single-qubit measurements) with a classical restriction (on communication between qubits), and can be implemented using current technologies, such as nitrogen vacancy centers in diamond. In this model, we construct OTMs that are information-theoretically secure against one-pass LOCC adversaries that use 2-outcome measurements. Our construction resembles Wiesners old idea of quantum conjugate coding, implemented using random error-correcting codes; our proof of security uses entropy chaining to bound the supremum of a suitable empirical process. In addition, we conjecture that our random codes can be replaced by some class of efficiently-decodable codes, to get computationally-efficient OTMs that are secure against computationally-bounded LOCC adversaries. In addition, we construct data-hiding states, which allow an LOCC sender to encode an (n-O(1))-bit messsage into n qubits, such that at most half of the message can be extracted by a one-pass LOCC receiver, but the whole message can be extracted by a general quantum receiver.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
