Zobrazeno 1 - 10
of 778
pro vyhledávání: '"Cyclotomic fast Fourier transform"'
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
Publikováno v:
Proceedings of the International Conference on Data Engineering and Communication Technology ISBN: 9789811016745
The frequency transformation methods like fast fourier transform algorithms can be competently used in realization of discrete fourier transforms over Galois field, which have broad applications in network security and digital communication in error
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d62a0ba605005747fa66ec9b1184537
https://doi.org/10.1007/978-981-10-1675-2_55
https://doi.org/10.1007/978-981-10-1675-2_55
Publikováno v:
2015 International Conference on Industrial Instrumentation and Control (ICIC).
The Fast Fourier Transform can be determined in Complex field and Galois field. The paper suggests the architecture for finding Fast Fourier Transform over a Galois field. This method uses the advantage of Cyclotomic decomposition. Basically decompos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3791ba3bae2fefc837798fef4abf8be
https://doi.org/10.1109/iic.2015.7150814
https://doi.org/10.1109/iic.2015.7150814
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Proceedings of the International Conference on Data Engineering & Communication Technology; 2017, p559-567, 9p
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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
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