Finite alphabet phase retrieval
From MaRDI portal
Abstract: We consider the finite alphabet phase retrieval problem: recovering a signal whose entries lie in a small alphabet of possible values from its Fourier magnitudes. This problem arises in the celebrated technology of X-ray crystallography to determine the atomic structure of biological molecules. Our main result states that for generic values of the alphabet, two signals have the same Fourier magnitudes if and only if several partitions have the same difference sets. Thus, the finite alphabet phase retrieval problem reduces to the combinatorial problem of determining a signal from those difference sets. Notably, this result holds true when one of the letters of the alphabet is zero, namely, for sparse signals with finite alphabet, which is the situation in X-ray crystallography.
Cites work
- Algebraic Theory of Phase Retrieval
- Benchmark problems for phase retrieval
- Compressed sensing for finite-valued signals
- scientific article; zbMATH DE number 3017718 (Why is no real title available?)
- On Patterson's cyclotomic sets and how to count them
- Phase retrieval
- Phase retrieval: uniqueness and stability
- Super Resolution Phase Retrieval for Sparse Signals
- The Complexity of Bit Retrieval
- The Structure of Homometric Sets
- Toward a mathematical theory of the crystallographic phase retrieval problem
Cited in
(4)
This page was built for publication: Finite alphabet phase retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6172171)