Two dimensional properties of discrete fourier transform
Copyright policy )Two dimensional properties of discrete fourier transform
Two significant two-dimensional decomposition rules for the Discret Fourier Transform of a set of N data (N=2p) are considered. It is shown that the two-dimensional processing performed according to such rules involves exactly the same operations on the same data as the one-dimensional processing. This means that, if the same rulw is iteratively applied with arbitrary dimensions, always the same fast algorithm is obtained.
Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type, Discret Fourier Transform, Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces
Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type, Discret Fourier Transform, Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!