Results 11 to 20 of about 1,950,575 (284)

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]

open access: yes, 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   +3 more sources

Comparison of Image Compressions: Analog Transformations

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

A Compact and Fast Single‐Spike TTFS Encoder With Ultralow Operating Voltage for Efficient Neuromorphic Fourier Transform [PDF]

open access: yesAdvanced science
A Pt/TaOx/V single‐spike TTFS encoder achieves ultralow‐voltage (∼0.35 V), high‐speed (∼100 ns) operation with simplified circuitry. Integrating bipolar nonuniform temporal encoding with a spiking‐DFT neuron model enables a neuromorphic FFT framework. Device‐calibrated simulations demonstrate high spectral fidelity across multitone, speech, and chirp ...
Wu Y   +10 more
europepmc   +2 more sources

Joint Channel Estimation Algorithm Based on DFT and DWT

open access: yesApplied Sciences, 2022
Channel estimation is an important component of orthogonal frequency division multiplexing (OFDM) systems. The existence of virtual subcarriers leads to energy spreading in the time-domain when using Inverse Fast Fourier Transform (IFFT), resulting in ...
Zhe Zhang, Xin Bian, Mingqi Li
doaj   +1 more source

Design And Implementation Of Radix-4 Fast Fourier Transform In Asia Chip With 0.18 M Standard CMOS Technology [TK5102.9. S624 2008 f rb]. [PDF]

open access: yes, 2008
Jelmaan Fourier pantas (FFT) merupakan blok yang penting dan digunakan secara meluas dalam algoritma pemprosesan isyarat digital. The Fast Fourier Transform (FFT) is a critical block and widely used in digital signal processing ...
Palaniappan, Siva Kumar
core   +1 more source

Radar matched filtering using the fractional fourier transform [PDF]

open access: yes, 2010
-A matched filter is the optimal linear filter for maximizing the signal to noise ratio (SNR) in the presence of additive noise. Matched filters are commonly used in radar systems where the transmitted signal is known and may be used as a replica to be ...
Clemente, Carmine   +2 more
core   +3 more sources

Extended Smoothing Methods for Sparse Test Data Based on Zero-Padding

open access: yesApplied Sciences, 2023
Aiming at the problem of sparse measurement points due to test conditions in engineering, a smoothing method based on zero-padding in the wavenumber domain is proposed to increase data density.
Pan Zhou   +5 more
doaj   +1 more source

The discrete fractional Fourier transform [PDF]

open access: yes, 1999
Date of Conference: 15-19 March 1999Conference Name: 24th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1999We propose and consolidate a definition of the discrete fractional Fourier transform which generalizes the ...
Özaktaş, Haldun M.   +5 more
core   +1 more source

New single-carrier transceiver scheme based on the discrete sine transform

open access: yesThe Journal of Engineering, 2014
A discrete sine transform (DST)-based single-carrier transceiver scheme for broadband wireless communications is proposed and investigated. The proposed scheme uses a DST rather than the conventional discrete Fourier transform (DFT) as a basis function ...
Faisal Al-kamali
doaj   +1 more source

Simplified approach to DFT computation for nonprogrammable scientific calculators

open access: yesBibechana, 2014
Fourier analysis is an important tool used as it is or it’s different variants in many fields of sciences and engineering. It’s importance is due to it’s simplicity with which it expands a given function in terms of circular or complex exponents ...
Mohd Yusuf Yasin
doaj   +3 more sources

Home - About - Disclaimer - Privacy