tomoCAM: fast model-based iterative reconstruction via GPU acceleration and non-uniform fast Fourier transforms [PDF]
Journal of Synchrotron RadiationX-ray-based computed tomography is a well established technique for determining the three-dimensional structure of an object from its two-dimensional projections.
Dinesh Kumar +2 more
doaj +2 more sources
On the restriction of the Fourier transform to polynomial curves [PDF]
, 2007 We prove a Fourier restriction theorem on curves parametrised by the mapping P(t) = (P1(t),..., Pn(t)), where each of the P1,..., Pn is a real-valued polynomial and t belongs to an interval on which each of the P1,..., Pn "resembles" a ...
Dendrinos, S.
core +8 more sources
Fast-responding measurements of power system harmonics using discrete and fast fourier transforms with low spectral leakage [PDF]
, 2011 Conventional wisdom dictates that a Fast Fourier Transform (FFT) will be a more computationally effective method for measuring multiple harmonics than a Discrete Fourier Transform (DFT) approach.
Burt, Graeme M. +3 more
core +4 more sources
Nonlinearizad of Fast Fourier Transform
Цифровые модели и решения, 2023 A unified mathematical form of reversible nonlinear transformations based on a nonlinear tensor product is presented in the form of fast algorithms.
Valeriy Labunets +2 more
doaj +1 more source
New many-parameter Fourier–Clifford transforms
Цифровые модели и решения, 2023 The article shows how ordinary complex-valued Fourier transforms are extended to Cliffordean-valued many-parameter Fourier transforms (MPFCTs). Each MPFCT depends on finite set of independent parameters (angles), which could be changed independently one ...
V. G. Labunets +2 more
doaj +1 more source
The Discrete Fourier Transform Over the Binary Finite Field
IEEE Access, 2023 The novel methods for binary discrete Fourier transform (DFT) computation over the finite field have been proposed. The methods are based on a binary trace calculation over the finite field and use the cyclotomic DFT.
Sergei Valentinovich Fedorenko
doaj +1 more source
Efficient Algorithm for Finding Roots of Error-Locator Polynomials
IEEE Access, 2021 A novel method for finding roots of polynomials over finite fields has been proposed. This method is based on the cyclotomic discrete Fourier transform algorithm. The improvement is achieved by using the normalized cyclic convolutions, which have a small
Sergei Valentinovich Fedorenko
doaj +1 more source
A Spectral Algorithm for Decoding Systematic BCH Codes
IEEE Access, 2022 A novel method of spectral decoding for systematic BCH codes has been proposed. This method has a simple description and a small computational complexity.
Sergei Valentinovich Fedorenko
doaj +1 more source
Comparisons of the execution times and memory requirements for high-speed discrete fourier transforms and fast fourier transforms, for the measurement of AC power harmonics [PDF]
, 2011 Conventional wisdom dictates that a Fast Fourier Transform (FFT) will be a more computationally effective method for measuring multiple harmonics than a Discrete Fourier Transform (DFT) approach.
Burt, G. M., Roscoe, A. J.
core +4 more sources
Algorithms, 2022 We consider the numerical solution of the discrete multi-marginal optimal transport (MOT) by means of the Sinkhorn algorithm. In general, the Sinkhorn algorithm suffers from the curse of dimensionality with respect to the number of marginals.
Fatima Antarou Ba, Michael Quellmalz
doaj +1 more source