Results 51 to 60 of about 790,476 (361)
Small-Size Algorithms for Quaternion Discrete Fourier Transform
The quaternion discrete Fourier transform (QDFT) is a powerful tool in modern digital signal processing, even though until recently this transformation seemed exotic. In recent years, quite a lot of publications have appeared devoted to effective ways to
Aleksandr Cariow +1 more
doaj +1 more source
VLSI Architecture for Novel Hopping Discrete Fourier Transform Computation
The hopping discrete Fourier transform (HDFT) is a new method applied for time-frequency spectral analysis of time-varying signals. In the implementation of HDFT algorithms, the updating vector transform (UVT) plays a key role, and therefore a novel ...
Wen-Ho Juang +3 more
doaj +1 more source
Comparison of Image Compressions: Analog Transformations
A comparison between the four most used transforms, the discrete Fourier transform (DFT), discrete cosine transform (DCT), the Walsh–Hadamard transform (WHT) and the Haar-wavelet transform (DWT), for the transmission of analog images, varying their ...
Jose Balsa
doaj +1 more source
Fast Fourier Optimization: Sparsity Matters
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
Designing stable Ru nanoparticle catalyst remains a critical challenge in electrochemical applications. Here, a strategy is presented to stabilize Ru catalysts by leveraging Ce‐doped ZrO2 supports (ZrCeO2‐x), which enhance catalyst durability and activity through electronic metal‐support interactions and stabilized oxygen vacancies.
Mansu Kim +9 more
wiley +1 more source
Discrete Two-Dimensional Fourier Transform in Polar Coordinates Part I: Theory and Operational Rules
The theory of the continuous two-dimensional (2D) Fourier transform in polar coordinates has been recently developed but no discrete counterpart exists to date.
Natalie Baddour
doaj +1 more source
Fast Radix-32 Approximate DFTs for 1024-Beam Digital RF Beamforming
The discrete Fourier transform (DFT) is widely employed for multi-beam digital beamforming. The DFT can be efficiently implemented through the use of fast Fourier transform (FFT) algorithms, thus reducing chip area, power consumption, processing time ...
Arjuna Madanayake +8 more
doaj +1 more source
Zinc(II) coordination complexes with tunable aryloxy‐imine ligands exhibit controllable supramolecular self‐assembly into hierarchical fibrous structures. Coordination‐driven stacking, not π–π interactions, enables gelation, dynamic assembly/disassembly, and enhanced nanomechanical properties.
Merlin R. Stühler +10 more
wiley +1 more source
Localization Operators and an Uncertainty Principle for the Discrete Short Time Fourier Transform
Localization operators in the discrete setting are used to obtain information on a signal f from the knowledge on the support of its short time Fourier transform.
Carmen Fernández +2 more
doaj +1 more source
Detection of Hidden Object In Speech Based on Fast Fourier Transform Algorithm [PDF]
In this paper steganalysis technique is proposed on the basis of spectral domain analysis using Discrete Fourier Transform, Fast Fourier Transform Algorithm (DFT_FFTA).
Mahmud k. Kadum
doaj +1 more source

