Topic
Non-uniform discrete Fourier transform
About: Non-uniform discrete Fourier transform is a research topic. Over the lifetime, 4067 publications have been published within this topic receiving 123952 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: This chapter presents the development and applications of non-uniform Fourier transform, which provides the possibility to acquire NMR spectra of ultra-high dimensionality and/or resolution which allow easy resonance assignment and precise determination of spectral parameters.
Abstract: Fourier transform can be effectively used for processing of sparsely sampled multidimensional data sets. It provides the possibility to acquire NMR spectra of ultra-high dimensionality and/or resolution which allow easy resonance assignment and precise determination of spectral parameters, e.g., coupling constants. In this chapter, the development and applications of non-uniform Fourier transform is presented.
31 citations
TL;DR: A new algorithm for the fast computation of the discrete Fourier transform (DFT) is introduced, called the conjugate pair FFT (CPFFT), which is used to compute a length-2m DFT.
Abstract: A new algorithm for the fast computation of the discrete Fourier transform is introduced. The algorithm, called the conjugate pair FFT (CPFFT), is used to compute a length-2m DFT. The number of multiplications and additions required by the CPFFT is less than that required by the SRFFT algorithm.
31 citations
31 citations
TL;DR: This method is based on the cosine Fourier transform between the angle and order domains of the Chebyshev operator and is applicable to matrices of any functions of the Hamiltonian operator.
31 citations
Patent•
23 Sep 1986
TL;DR: In this article, a non-recursive and sliding discrete Fourier transform for processing a pulse compression radar signal has been proposed, where each stage comprises two complex rotation operators, two adder-subtracters and two delay circuits and delivers a signal X k m+1 obtained from the following equations.
Abstract: A device for computing a nonrecursive and sliding discrete Fourier transform as applicable in particular to processing of a pulse compression radar signal has N identical and parallel stages (E k ) for receiving in each case samples of the input signal (e m+N ). Each stage comprises two complex rotation operators, two adder-subtracters and two delay circuits and delivers a signal X k m+1 obtained from the following equations: ##EQU1##
31 citations