Results 21 to 30 of about 470,971 (281)
IET Radar, Sonar & Navigation, 2021 In ISAR imaging, echo signals of complex manoeuvring targets have to be modelled as multi‐component cubic phase signals (m‐CPS). In this condition, the Doppler diffusion will seriously affect the quality of ISAR imaging.
Fengkai Liu +3 more
doaj +1 more source
Reconfigurable Hyper-Parallel Fast Fourier Transform Processor Based on Bit-Serial Computing
IEEE Access, 2023 The upcoming 5G communication is committed to providing ultra-high throughput and ultra-low delay service. However, digital signal processing technologies will be a critical challenge with the increasing bandwidth and transmitting streams.
Tingyong Wu, Yuxin Wang, Fuqiang Li
doaj +1 more source
, 2019 This chapter introduces the definition of the DFT and the basic idea of the FFT. Then, the Cooley–Tukey FFT algorithm, bit-reversal permutation, and Stockham FFT algorithm are explained. Finally, FFT algorithm for real data is described.
+4 more sources
Exact quantum Fourier transforms and discrete logarithm algorithms [PDF]
, 2003 We show how the quantum fast Fourier transform (QFFT) can be made exact for arbitrary orders (first for large primes). For most quantum algorithms only the quantum Fourier transform of order $2^n$ is needed, and this can be done exactly.
Mosca, Michele, Zalka, Christof
core +4 more sources
REVISED FAST FOURIER TRANSFORM
Radio Electronics, Computer Science, Control, 2014 The problem of realisation of the Discrete Fourier Transform in on-line is analysed because of non-efficient consuming a time for a new recalculation of spectrum samples if one discrete-time signal sample or even some small portion of samples in period are replaced by new sample or by new samples, respectively.
openaire +4 more sources
Two-band fast Hartley transform [PDF]
, 2015 This article has been made available through the Brunel Open Access Publishing Fund.Efficient algorithms have been developed over the past 30 years for computing the forward and inverse discrete Hartley transforms (DHTs).
A.K. Nandi +10 more
core +2 more sources
An ultra-precise Fast Fourier Transform
Measurement: SensorsThe Fast Fourier Transform (FFT) is a cornerstone of digital signal processing, generating a computationally efficient estimate of the frequency content of a time series.
Manus Henry
doaj +1 more source
An investigation of pulsar searching techniques with the Fast Folding Algorithm
, 2017 Here we present an in-depth study of the behaviour of the Fast Folding Algorithm, an alternative pulsar searching technique to the Fast Fourier Transform.
Barr, E. D. +4 more
core +1 more source
Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We present a general diagrammatic approach to the construction of efficient algorithms for computingthe Fourier transform of a function on a finite group.
David Maslan +2 more
doaj +1 more source
Higher Order Convergent Fast Nonlinear Fourier Transform
, 2017 It is demonstrated is this letter that linear multistep methods for integrating ordinary differential equations can be used to develop a family of fast forward scattering algorithms with higher orders of convergence.
Vaibhav, Vishal
core +1 more source