Results 21 to 30 of about 1,921,662 (293)
Simplification of DFT and IDFT in PRACH
The respective simplifications of prime‐point discrete Fourier transform (DFT) and ultra‐long‐point inverse discrete Fourier transform (IDFT) in physical random access channel (PRACH) are proposed. The former is an equivalent substitution of DFT function
Yufeng Jiang, Shouxin Kang
doaj +1 more source
DFT-Based Frequency Estimation of Multiple Sinusoids
An accurate frequency estimation method of multi-component sinusoidal signal in additive white Gaussian noise (AWGN) is proposed. The algorithm is implemented in the frequency domain and based on discrete Fourier transform (DFT). The maximum DFT spectral
Nian Liu +5 more
doaj +1 more source
New Algorithm for Real-Valued Fourier Transform
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
Comparison of discrete transforms for deep‐neural‐networks‐based speech enhancement
In recent studies of speech enhancement, a deep‐learning model is trained to predict clean speech spectra from the known noisy spectra of speech. Rather than using the traditional discrete Fourier transform (DFT), this paper considers other well‐known ...
Wissam A. Jassim, Naomi Harte
doaj +1 more source
Eigenvectors of the Discrete Fourier Transform Based on the Bilinear Transform
Determining orthonormal eigenvectors of the DFT matrix, which is closer to the samples of Hermite-Gaussian functions, is crucial in the definition of the discrete fractional Fourier transform.
Ahmet Serbes, Lutfiye Durak-Ata
doaj +2 more sources
Multiple-input Multiple-Output (MIMO) systems require orthogonal frequency division multiplexing to operate efficiently in multipath communication (OFDM).
Dhanasekaran Selvaraj +5 more
semanticscholar +1 more source
A New Pseudo-Spectral Method Using the Discrete Cosine Transform
The pseudo-spectral (PS) method on the basis of the Fourier transform is a numerical method for estimating derivatives. Generally, the discrete Fourier transform (DFT) is used when implementing the PS method. However, when the values on both sides of the
Izumi Ito
doaj +1 more source
Large-Scale Discrete Fourier Transform on TPUs [PDF]
In this work, we present two parallel algorithms for the large-scale discrete Fourier transform (DFT) on Tensor Processing Unit (TPU) clusters. The two parallel algorithms are associated with two DFT formulations: one formulation, denoted as KDFT, is ...
Tianjian Lu +4 more
semanticscholar +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
Joint Channel Estimation Algorithm Based on DFT and DWT
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

