Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Cooley-Tukey"”.
-
Verifying Correctness of the Number Theoretic Transform and Fast Number Theoretic Transform in F⋆
… We provide an implementation of the Cooley-Tukey fast NTT algorithm and a proof that it matches the original NTT specification. This thesis also presents a representation of polynomials in the F⋆ subset Low*, which extracts to performant C code.
-
Putting Fürer's Algorithm into Practice with the BPAS Library
… Fourier Transform (FFT). Taking advantage of Cooley-Tukey tensor formula and the fact that r is a 2k-th primitive root of unity, we obtain an efficient implementation of FFT over Z/pZ. This implementation outperforms comparable implementations either using other encodings of Z/pZ or other ways …
-
Optimization of FFT communication on 3-D torus and mesh supercomputer networks
… the divide-and-conquer approach of the popular Cooley-Tukey approach, a parallel FFT can use a highly optimized serial algorithm for intra-node calculations, but the communication patterns between nodes reveal a potential for improvement. In this work, the scalability and communication patterns …
-
Design and development of a composite frequency response analyser
… The instrument which makes use of a 256 point Cooley-Tukey Fast Fourier Transform, demonstrates the feasibility of producing an analyser based upon the new waveforms which has a performance equal to, or greater than existing commercial analysers.<br/><br/>The relative performance of the two …
-
Wavelets for approximate Fourier transform and data compression
… discrete Fourier transform (DFT). The classical Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. The main advantage of our algorithm is that the good time and frequency localization of wavelets can be exploited to approximate the …
-
Applications of Deep Learning to Scientific Inverse Problems
… and traditional multi-scale methods such as the Cooley-Tukey FFT algorithm. This allows WideBNet to automatically adapt to the dimension of the data so that the number of trainable parameters scales linearly, up to logarithmic factors, with the inherent complexity of the inverse problem. While …
-
Nopea Fourier-muunnos – Teoria ja toteutus modernilla C++:lla
… niin, että se toimii nopeasti. Erityisesti Cooleyn-Tukeyn menetelmää ja sen eri muotoja tutkitaan sellaisessa tarkkuudessa, että sen toimintaperiaatteen sekä sen syntyyn johtaneen ajatusketjun voi ymmärtää. Lisäksi käsitellään Raderin sekä Bluesteinin FFT-menetelmiä. Teorian käsittelyn …