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: In this paper, a finite spectral method for pointwise or cellwise local spectral schemes based on non-periodic Fourier transform and two finite spectral schemes are presented. But this method is not suitable for wave propagation problems.
20 citations
03 Apr 1990
TL;DR: The fast approximated discrete transform is proposed as a method for reducing the time necessary to compute the discrete transform of a finite-length sequence by discarding the computations in bands that have little or no energy contribution.
Abstract: The fast approximated discrete transform is proposed as a method for reducing the time necessary to compute the discrete transform of a finite-length sequence. It is based on a subband decomposition and can be viewed as a link between the fast transform methods (like the fast Fourier transform), which compute all points in the transform domain, and the variety of methods to evaluate the discrete transforms at a given set of points. The method uses knowledge about the input signal to obtain an approximation to its transform by discarding the computations in bands that have little or no energy contribution. In a number of practical cases the proposed fast approximation is reasonably accurate, and in all cases the method can be iterated to yield the exact transform, if necessary. >
20 citations
TL;DR: In this article, an alternative method has been found to display the information contained in the Fourier transform of a helical particle, which allows a strong selection rule to be defined for the transform on the layer lines and consequently the discrimination between signal and noise contributions to the data can be improved.
Abstract: An alternative method has been found to display the information contained in the Fourier transform of a helical particle. This allows a strong selection rule to be defined for the transform on the layer lines and consequently the discrimination between signal and noise contributions to the data can be improved.
20 citations
IBM1
TL;DR: This work shows how to compute the multiplicative complexity of the Discrete Fourier Transform on any set of data points.
20 citations
Patent•
12 Jun 2014TL;DR: In this paper, a two-dimensional discrete Fourier transform based codebook is determined for elevation beamforming, which supports single stream codewords and multistream codeword. And the codebook size may be flexibly designed based on required beam resolution in azimuth and elevation.
Abstract: The present disclosure relates to systems and methods for a two-dimensional discrete Fourier transform based codebook for elevation beamforming. A two-dimensional discrete Fourier transform based codebook is determined for elevation beamforming. The codebook supports single stream codewords and multistream codewords. The two-dimensional discrete Fourier transform based codebook is generated by stacking the columns of the matrix product of two discrete Fourier transform codebook matrices. The codebook size may be flexibly designed based on required beam resolution in azimuth and elevation. A best codebook index is selected from the generated two-dimensional discrete Fourier transform based codebook. The selected codebook index is provided in a channel state information report. The channel state information report is transmitted to a base station.
20 citations