On the accuracy and resolution of powersum-based sampling methods

Abstract

Recently, several sampling methods suitable for signals that are sums of Diracs have been proposed. Though they are implemented through different acquisition architectures, these methods all rely on estimating the parameters of a powersum series. We derive Cramer-Rao lower bounds (CRBs) for estimation of the powersum poles, which translate to the Dirac positions. We then demonstrate the efficacy of simple algorithms due to Prony and Cornell for low-order powersums and low oversampling relative to the rate of innovation. The simulated performance illustrates the possibility of superresolution reconstruction and robustness to correlation in the powersum sample noise.