Results 1 to 10 of about 17,052 (308)

tomoCAM: fast model-based iterative reconstruction via GPU acceleration and non-uniform fast Fourier transforms [PDF]

open access: yesJournal of Synchrotron Radiation
X-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

Nonlinearizad of Fast Fourier Transform

open access: yesЦифровые модели и решения, 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

open access: yesЦифровые модели и решения, 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

open access: yesIEEE 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

open access: yesIEEE 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

open access: yesIEEE 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

Accelerating the Sinkhorn Algorithm for Sparse Multi-Marginal Optimal Transport via Fast Fourier Transforms

open access: yesAlgorithms, 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

New Algorithm for Real-Valued Fourier Transform

open access: yesTikrit Journal of Engineering Sciences, 2023
This paper presents a direct algorithm for fast real discrete Fourier transform (RDFT) computing, using the discrete Fourier transform (DFT) conjugate symmetric property to reduce redundancies.
Sukaina K. Salih, Mounir T. Hamood
doaj   +1 more source

Single Image Raindrop Removal Using a Non-Local Operator and Feature Maps in the Frequency Domain

open access: yesIEEE Access, 2022
Taking a photo on a rainy day may result in a photo with raindrops. Images containing raindrops have a significant impact on the visual impression and accuracy when applied to image recognition systems.
Shinya Ezumi, Masaaki Ikehara
doaj   +1 more source

Low‐power fast Fourier transform hardware architecture combining a split‐radix butterfly and efficient adder compressors

open access: yesIET Computers & Digital Techniques, 2021
Fast Fourier transform (FFT) is the most common low‐complexity implementation of the discrete Fourier transform, intensively employed to process real‐world signals in smart sensors for the internet of things.
Guilherme Ferreira   +6 more
doaj   +1 more source

Home - About - Disclaimer - Privacy