Foldings of Periodic Nonuniform Samplings

Abstract

Periodic Nonuniform Samplings of order N (PNSN) are interleavings of periodic samplings. For a base period T, simple algorithms can be used to reconstruct functions of spectrum included in an union of N intervals δk of length 1/T. In this paper we study the behavior of these algorithms when applied to any function. We prove that they result in N (or less) foldings on , each of δk holding at most one folding.