Answers are grounded in this paper and cite their sources.
The discrete Fourier transform of a sequence, which can be computed using the fast Fourier transform algorithm, represents samples of the z transform equally spaced around the unit circle. In this letter, a technique is discussed and illustrated for transforming a sequence to a new sequence whose discrete Fourier transform is equal to samples of the z transform of the original sequence at unequally spaced angles around the unit circle.
No takes yet. Share an insight, caveat, or question.
Oppenheim et al. (1971) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: