Simplified approach to DFT computation for nonprogrammable scientific calculators
Bibechana, 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
Sensing Fractional Power Spectrum of Nonstationary Signals with Coprime Filter Banks
Complexity, 2020 The coprime discrete Fourier transform (DFT) filter banks provide an effective scheme of spectral sensing for wide-sense stationary (WSS) signals in case that the sampling rate is far lower than the Nyquist sampling rate.
Xiaomin Li +3 more
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 +2 more
core +2 more sources
Quantum Fourier transform revisited [PDF]
, 2020 The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering.
Bullock SS +5 more
core +2 more sources
New single-carrier transceiver scheme based on the discrete sine transform
The 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
Ultrafast Analog Fourier Transform Using 2-D LC Lattice [PDF]
, 2008 We describe how a 2-D rectangular lattice of inductors and capacitors can serve as an analog Fourier transform device, generating an approximate discrete Fourier transform (DFT) of an arbitrary input vector of fixed length.
Afshari, Ehsan +2 more
core +2 more sources
More on algebraic properties of the discrete Fourier transform raising and lowering operators★
4 open, 2019 In the present work, we discuss some additional findings concerning algebraic properties of the N-dimensional discrete Fourier transform (DFT) raising and lowering difference operators, recently introduced in [Atakishiyeva MK, Atakishiyev NM (2015), J ...
Atakishiyeva Mesuma K. +2 more
doaj +1 more source
Exact Relation Between Continuous and Discrete Linear Canonical Transforms [PDF]
, 2009 —Linear canonical transforms (LCTs) are a family of integral transforms with wide application in optical, acoustical, electromagnetic, and other wave propagation problems. The Fourier and fractional Fourier transforms are special cases of LCTs.
Figen S. Oktem, Haldun M. Ozaktas
core +1 more source
Four Particular Cases of the Fourier Transform
Mathematics, 2018 In previous studies we used Laurent Schwartz’ theory of distributions to rigorously introduce discretizations and periodizations on tempered distributions.
Jens V. Fischer
doaj +1 more source
Maximum likelihood based estimation of frequency and phase offset in DCT OFDM systems under non-circular transmissions: algorithms, analysis and comparisons [PDF]
, 2008 Recently, the advantages of the discrete cosine transform (DCT) based orthogonal frequency-division multiplexing (OFDM) have come to the light. We thus consider DCT- OFDM with non-circular transmission (our results cover circular transmission as well ...
Cui, Tao +3 more
core +1 more source