Nonlinear and Nonideal Sampling Revisited

We revisit the problem of recovering a continuous-time signal lying within a known shift-invariant subspace from nonlinear and nonideal samples. Recently, an iterative algorithm for perfect recovery of such signals was proposed. This method requires operations which are not linear time-invariant (LTI), rendering it impractical due to its polynomial dependency on the data length. We describe an alternative iterative algorithm for recovering the signal, which involves only LTI operations. In the revised method, each iteration is much faster and implementation is simpler. Furthermore, the overall running time of our approach depends linearly on the number of samples.