> >> Is there any way to check for cycles in this situation? > > > Fast fourier transform (fft)? > > +1 For using a discrete Fourier transform, as implemented by numpy.fft.fft. > You mentioned that you sample at points which do not correspond with the > period of the signal; this introduces a slight complexity in how the > Fourier transform reflects information about the original signal. I attach > two documents to this email with details about those (and other) > complexities. There is also much information on this topic online and in > signal processing books.
Dear Elliot, Daniel, Thanks a lot for that. Off to read! M _______________________________________________ NumPy-Discussion mailing list NumPy-Discussion@scipy.org https://mail.scipy.org/mailman/listinfo/numpy-discussion
