Finite Rate of Innovation (FRI) sampling techniques provide efficient frameworks for reconstructing signals with inherent sparsity at rates below Nyquist. However, traditional FRI reconstruction methods rely heavily on pre-defined kernels, often limiting hardware implementation and reconstruction accuracy under noisy conditions. In this paper, we propose a robust, flexible, and practically implementable framework for FRI reconstruction by introducing novel learnable kernel strategies. First, we demonstrate effective reconstruction using known, fixed kernels such as truncated Gaussian and Gaussian pair kernels, which mitigate the requirement that the samples should have a sum-of-exponentials (SoE) form. Next, we extend this concept by jointly optimizing both the sampling kernel and reconstruction encoder through a unified learning approach, yielding adaptive kernels that significantly outperform traditional methods in resolution and noise robustness, with reduced sampling rates. Furthermore, we propose a practical hardware realization by representing kernels as sums of two exponential decay signals with jointly optimized poles, facilitating compact, efficient analog implementations. Our approach is validated experimentally through hardware implementations using a unity-gain Sallen-Key analog filter, achieving accurate real-world signal recovery. The developed convolutional neural network-based encoder substantially reduces computational complexity, demonstrating competitive performance with fewer parameters, making our method particularly suitable for resource-constrained, edge-based deployments.
Nitsure et al. (Sun,) studied this question.