Results 21 to 30 of about 468,310 (277)
Estimation of Coastal Bathymetry Using Wavelets
Journal of Marine Science and Engineering, 2020 When waves propagate in coastal areas at depths lower than one half the wavelength, they exhibit a different signature at the sea surface and the observed wavelength pattern enables inferring bathymetries.
Diogo Santos +3 more
doaj +1 more source
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
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
Coherent optical implementations of the fast Fourier transform and their comparison to the optical implementation of the quantum Fourier transform [PDF]
, 2013 Optical structures to implement the discrete Fourier transform (DFT) and fast Fourier transform (FFT) algorithms for discretely sampled data sets are considered. In particular, the decomposition of the FFT algorithm into the basic Butterfly operations is
Birch, Philip M +2 more
core +2 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
Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II [PDF]
, 2015 We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group.
Maslen, David +2 more
core +3 more sources
Fast Fourier Optimization: Sparsity Matters
, 2012 Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier transform} (fft)
C. Papadimitriou +19 more
core +4 more sources
Fast computation of magnetostatic fields by Non-uniform Fast Fourier Transforms [PDF]
, 2008 The bottleneck of micromagnetic simulations is the computation of the long-ranged magnetostatic fields. This can be tackled on regular N-node grids with Fast Fourier Transforms in time N logN, whereas the geometrically more versatile finite element ...
Braess D. +5 more
core +4 more sources