Główne pojęcia
A novel time-domain sparse recovery method that avoids the limitations of transform domain approaches, along with Cramér-Rao Bounds for the sparse parameter estimation problem in the fractional Fourier domain.
Streszczenie
This paper introduces a new time-domain method for recovery of sparse signals from low-pass filtered measurements in the Fractional Fourier Transform (FrFT) domain. The key advantages of this method are:
- It does not require any Discrete Fractional Fourier Transform (DFrFT) operations, thereby eliminating the issues of spectral leakage that plague transform domain approaches.
- The time-domain recovery approach is backed by a sampling theorem, providing theoretical guarantees on the required number of samples for exact recovery.
Additionally, the paper derives Cramér-Rao Bounds (CRB) for the sparse parameter estimation problem in the FrFT domain, which was previously missing in the literature. This serves as a performance guarantee for the recovery problem in the presence of noise.
The key steps are:
- The authors present a novel time-domain sparse recovery method that avoids the typical bottlenecks of transform domain methods, such as spectral leakage. This method is backed by a sparse sampling theorem applicable to arbitrary FrFT-bandlimited kernels.
- The authors derive Cramér-Rao Bounds for the sparse sampling problem, addressing a gap in existing literature.
- The authors validate the empirical robustness of their algorithm through a hardware experiment, demonstrating accurate recovery of the sparse signal despite the presence of noise and quantization effects.
Statystyki
The sparse signal parameters are:
c0 = 0.748
c1 = 0.891
t0 = 0.500 s
t1 = 0.830 s
The recovered sparse signal parameters are:
c̃0 = 0.733
c̃1 = 0.843
t̃0 = 0.501 s
t̃1 = 0.834 s