Results 11 to 20 of about 138,884 (189)

Accurate Frequency Estimator of Sinusoid Based on Interpolation of FFT and DTFT

IEEE Access, 2020
An accurate frequency estimator of complex sinusoid in additive white noise is proposed. It is based on interpolation of Fast Fourier Transform (FFT) and Discrete-Time Fourier Transform (DTFT).
Lei Fan, Guoqing Qi, Jun Xing, Jiyu Jin, Jinyu Liu, Zhisen Wang   +5 more
doaj   +1 more source

Reconfigurable VLSI design of a changeable hybrid-radix FFT hardware architecture with 2D-FIFO storing structure for 3GPP LTE systems

ICT Express, 2018
This paper presents a reconfigurable Fast Fourier Transform (FFT) hardware architecture for 3GPP LTE systems. In the main FFT computing process, a novel processing kernel engine is proposed to support four configuration types of changeable hybrid-radix ...
Xin-Yu Shih, Hong-Ru Chou
doaj   +1 more source

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, Chatwin, Chris R, Young, Rupert C D   +2 more
core   +2 more sources

Experimental Research on Adaptive 128/64QAM DFT-Spread IFFT/FFT Size Efficient OFDM With a High SE in VLLC System

IEEE Photonics Journal, 2017
In this paper, an adaptive inverse fast Fourier transform and fast Fourier transform (IFFT/FFT) size efficient orthogonal frequency division multiplexing (OFDM) modulation scheme with 128/64-quadrature amplitude modulation (QAM) and ...
Qinghui Chen, Jing He, Rui Deng, Ming Chen, Fangliu Zhang, Min Dai, Fengting Long, Lin Chen   +7 more
doaj   +1 more source

Efficiency Comparison of DFT/IDFT Algorithms by Evaluating Diverse Hardware Implementations, Parallelization Prospects and Possible Improvements

Proceedings of the International Conference on Applied Innovations in IT, 2014
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inverse Fast Fourier Transformation (IFFT), and proper techniques for maximizing the FFT/IFFT execution speed, such as pipelining or parallel processing, and
Danijela Efnusheva, Natasha Tagasovska, Aristotel Tentov, Marija Kalendar   +3 more
doaj   +1 more source

Algoritme Fast Fourier Transform (FFT) dan Implementasinya pada Parallel Virtual Machine (PVM)

Teknologi dan Kejuruan, 2009
Algoritme Fast Fourier Transform (FFT) merupakan algoritme yang efisien untuk menghitung Discrete Fourier Transform (DFT), tetapi untuk data yang besar masih diperlukan waktu eksekusi yang cukup besar.
Wahyu Sakti G.I.
doaj   +1 more source

Static Quantised Radix2 Fast Fourier Transform Fft Inverse Fft Processor For Constraints Analysis [PDF]

International Journal of Electronics, 2013
International Journal of Electronics Taylor and Francis. Pp: 1-10.
Rozita Teymourzadeh, Memtode Jim Abigo, Mok Vee Hoong   +2 more
openaire   +2 more sources

Application of parallel version two-dimensional fast Fourier transform algorithm, analog of the Cooley-Tukey algorithm, for digital image processing of satellite data

E3S Web of Conferences, 2019
In modern systems of remote sensing two-dimensional fast Fourier transform (FFT) has been widely used for digital processing of satellite images and subsequent image filtering.
Noskov Mikhail, Tutatchikov Valeriy, Lapchik Mikhail, Ragulina Marina, Yamskikh Tatiana   +4 more
doaj   +1 more source

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, A.N. Skodras, Bouguezel S., Chiper D.F., Chiper D.F., Hamood M.T., M.F. Aburdene, Oliveira R.C., Shah G.A., Sorensen H.V., Yu P.   +10 more
core   +2 more sources

A RADIX-4/8/SPLIT RADIX FFT WITH REDUCED ARITHMETIC COMPLEXITY ALGORITHM [PDF]

ICTACT Journal on Communication Technology, 2012
In this paper we present alternate form of Radix-4/8 and split radix FFT’s based on DIF (decimation in frequency) version and discuss their implementation issues that further reduces the arithmetic complexity of power-of-two discrete Fourier Transform ...
Shaik Qadeer, Mohammed Zafar Ali Khan, Syed Abdul Sattar   +2 more
doaj