Results 11 to 20 of about 2,822,554 (294)
Radar matched filtering using the fractional fourier transform [PDF]
, 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 +4 more sources
Error Estimates on Approximating the Finite Fourier Transform of Complex-Valued Functions via a Pre-Grüss Inequality [PDF]
, 2004 Some estimates for the error in approximating the Finite Fourier Transform in terms of exponential means via a pre-Grüss inequality for complex-valued functions are ...
Hanna, George T +2 more
core +6 more sources
Alternatives to the discrete fourier transform [PDF]
2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008 It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform (DTFT) of the same signal at equidistant points on the unit circle. Hence, as the signal length goes to infinity, the DFT approaches the DTFT.
Doru-Cristian Balcan +3 more
openaire +1 more source
Dispersive Fourier Transformation for Versatile Microwave Photonics Applications [PDF]
, 2014 : Dispersive Fourier transformation (DFT) maps the broadband spectrum of an ultrashort optical pulse into a time stretched waveform with its intensity profile mirroring the spectrum using chromatic dispersion.
Wang, Chao, Chao Wang
core +1 more source
IEEE Access, 2020 In this paper, we present a modified modulated wideband converter (MWC)-based digital receiver for fractional bandlimited signals, and further propose an intra-pulse modulation recognition method in discrete time fractional Fourier domain (DTFrFD) for ...
Xiaomin Li, Huali Wang, Haichao Luo
doaj +1 more source
On computing the Discrete Fourier Transform [PDF]
Proceedings of the National Academy of Sciences, 1976 New algorithms for computing the Discrete Fourier Transform of n points are described. For n in the range of a few tens to a few thousands these algorithms use substantially fewer multiplications than the best algorithm previously known, and about the ...
openaire +3 more sources
Steerable Discrete Fourier Transform [PDF]
IEEE Signal Processing Letters, 2017 Directional transforms have recently raised a lot of interest thanks to their numerous applications in signal compression and analysis. In this letter, we introduce a generalization of the discrete Fourier transform, called steerable DFT (SDFT). Since the DFT is used in numerous fields, it may be of interest in a wide range of applications.
FRACASTORO, GIULIA, MAGLI, ENRICO
openaire +5 more sources
Construction of Fair Dice Pairs
Mathematics, 2019 An interesting and challenging problem in mathematics is how to construct fair dice pairs. In this paper, by means of decomposing polynomials in a residue class ring and applying the Discrete Fourier Transformation, we present all the 2000 fair dice ...
Yong Huang +5 more
doaj +1 more source
Integrated representation for discrete Fourier and wavelet transforms using vector notation
Mehran University Research Journal of Engineering and Technology, 2022 Many mathematical operations are implemented easily through transform domain operations. Multiple transform domain operations are used independently in large and complex applications.
Tariq Javid +3 more
doaj +1 more source
Comparison of discrete transforms for deep‐neural‐networks‐based speech enhancement
IET Signal Processing, 2022 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