Zobrazeno 1 - 10
of 758
pro vyhledávání: '"Cyclotomic fast Fourier transform"'
Publikováno v:
Engineering Applications of Noncommutative Harmonic Analysis ISBN: 9780429289385
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2aee04c3464e164d17278d98a50a8460
https://doi.org/10.1201/9780429289385-11
https://doi.org/10.1201/9780429289385-11
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030711863
ISDA
ISDA
The Fourier transform is a standard system analysis tool for viewing the frequency content of a signal. The Fourier transform of a sequence, commonly referred to as the discrete time Fourier transform. Discrete Fourier Transforms are implemented thro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cebb81feb304fb8623e313ce37185bf
https://doi.org/10.1007/978-3-030-71187-0_77
https://doi.org/10.1007/978-3-030-71187-0_77
In this paper the Delay Computation method for Common Sub expression Elimination algorithm is being implemented on Cyclotomic Fast Fourier Transform. The Common Sub Expression Elimination algorithm is combined with the delay computing method and is k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89f7a395b805db0c51cbb6b46b537870
Autor:
Diego Ruiz-Antolin, Alex Townsend
Publikováno v:
SIAM Journal on Scientific Computing Volume 40, Issue 1, pp. A1-C155
UCrea Repositorio Abierto de la Universidad de Cantabria
Universidad de Cantabria (UC)
UCrea Repositorio Abierto de la Universidad de Cantabria
Universidad de Cantabria (UC)
By viewing the nonuniform discrete Fourier transform (NUDFT) as a perturbed version of a uniform discrete Fourier transform, we propose a fast, stable, and simple algorithm for computing the NUDFT that costs $\mathcal{O}(N\log N\log(1/\epsilon)/\log\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a7a67aff8d85b6e99f9724c99f314a4
https://doi.org/10.1137/17m1134822
https://doi.org/10.1137/17m1134822
Publikováno v:
Journal of Computational and Applied Mathematics. 324:204-215
Adaptive Fourier decomposition (AFD) has been found to be among the most effective greedy algorithms. AFD shows an outstanding performance in signal analysis and system identification. As compensation of effectiveness, the computation complexity is g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6bcc5fc5fa91f228b2e2aae79fc044bc
https://doi.org/10.1016/j.cam.2017.04.029
https://doi.org/10.1016/j.cam.2017.04.029
Autor:
Chun-Su Park
Publikováno v:
IEEE Transactions on Signal Processing. 65:5281-5288
The discrete Fourier transform (DFT) is the most widely used technique for determining the frequency spectra of digital signals. However, in the sliding transform scenario where the transform window is shifted one sample at a time and the transform p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c363b19b8f433129bc3b1955c58ab96
https://doi.org/10.1109/tsp.2017.2726988
https://doi.org/10.1109/tsp.2017.2726988
Publikováno v:
Frontiers of Information Technology & Electronic Engineering. 18:1131-1141
The Clifford Fourier transform (CFT) can be applied to both vector and scalar fields. However, due to problems with big data, CFT is not efficient, because the algorithm is calculated in each semaphore. The sparse fast Fourier transform (sFFT) theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::928586dca51bd871ec69fc9d29b66dfc
https://doi.org/10.1631/fitee.1500452
https://doi.org/10.1631/fitee.1500452
Publikováno v:
Signal Processing: Image Communication. 54:130-139
In this paper, we introduce a fast algorithm for computing cosine transforms over fields of characteristic 2 (FFCT). Such transforms, which were recently proposed in the literature, are analogous to real-valued discrete cosine transforms in the same
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7343d388ffba8d9000be8c9ee4ccdccd
https://doi.org/10.1016/j.image.2017.03.007
https://doi.org/10.1016/j.image.2017.03.007
Publikováno v:
Cluster Computing. 20:1483-1492
Discrete Fourier transform (DFT) is the basic means of spectrum analysis in the field of digital signal processing, and the fast Fourier transform (FFT) has become the most popular algorithm which decreases the computational complexity from quadratic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e09107edeb4feb6e2ec56be86dc1f5f
https://doi.org/10.1007/s10586-017-0866-8
https://doi.org/10.1007/s10586-017-0866-8
Publikováno v:
Problems of Information Transmission. 53:155-163
For the discrete Fourier transform with respect to the system of characters of a local field with positive characteristic, we propose a fast algorithm. We find the complexity of the algorithm.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c78ed8b8d5db50de4fcc0b208bb9749b
https://doi.org/10.1134/s0032946017020041
https://doi.org/10.1134/s0032946017020041