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 20 of 1185 for “"Fft"”.

  1. VLSI design for pipelined FFT processors

    … analyser or other applications involving the FFT. The cells are structured in such a manner as to permit a designer to tailor the bit-length of the operations and the number of pipline stages used. Both fixed and floating operations are supported by the system. The size and performance …

    nps Repository record for VLSI design for pipelined FFT processors (opens in a new tab)

  2. Vectorizing FFT for faster AI Convolutions

    The Fast Fourier Transform (FFT) is a widely used algorithm in signal processing, communications and image processing. In this thesis we implemented and investigated FFT convolutions that leverage vector length agnostic programming for convolutional neural networks with the ARM Scalable Vector …

    chalmers Repository record for Vectorizing FFT for faster AI Convolutions (opens in a new tab)

  3. Conception d'un module reconfigurable de FFT

    … synthétisable de transformée rapide de Fourier (FFT/IFFT) qui répond aux besoin de reconfigurabilité et de réutilisation tout en traitant efficacement un flot sériel de données complexes. La taille ainsi que les largeurs binaires des interfaces et des bus à l'interne sont paramétrées. Les choix …

    ets-quebec Download PDF for Conception d'un module reconfigurable de FFT (opens in a new tab)

  4. Multivariate Chebyshev polynomials and FFT-like algorithms

    … signal processing theory for the development of FFT-like algorithms for discrete cosine transforms on weight lattices of compact Lie groups. After an introduction of the algebraic signal processing theory, a multivariate Gauss-Jacobi procedure for the development of orthogonal transforms is …

    wurz-thes Repository record for Multivariate Chebyshev polynomials and FFT-like algorithms (opens in a new tab)

  5. AN FFT SPECTRAL ANALYSIS FOR SYSTEM IDENTIFICATION

    With the advent of, larger am more complex systems being used in industry the requirement for more accurate estimates of the system operating parameters becomes greater. One method of obtaining these operating parameters is by the use of the information contained in the spectral density functions …

    sask Repository record for AN FFT SPECTRAL ANALYSIS FOR SYSTEM IDENTIFICATION (opens in a new tab)

  6. Design and Comparison of Asynchronous FFT Implementations

    Fast Fourier Transform (FFT) is a widely used digital signal processing technology in a large variety of applications. For battery-powered embedded systems incorporating FFT, its physical implementation is constrained by strict power consumption, especially during idle periods. Compared to the …

    arkansas Repository record for Design and Comparison of Asynchronous FFT Implementations (opens in a new tab)

  7. A faster FFT in the Mid-West

    FFT implementations today generally fall into two categories: Library generators (such as FFTW and Spiral) and specialized FFTs (such as prime95). Specialized FFTs have the obvious limitation of being specialized. However they are hand-tuned and generally offer superior performance. Library …

    uiuc Repository record for A faster FFT in the Mid-West (opens in a new tab)

  8. A node-based approach to charm-FFT

    … to obtain the optimal performance with a FFT grid in a given environment. In this thesis, an alternative method to an existing Parallel 3D FFT library was explored. The FFT library, Charm-FFT empowered by Charm++, was redesigned to utilize larger number of nodes while aiming to reduce the …

    uiuc Repository record for A node-based approach to charm-FFT (opens in a new tab)

  9. ΒΕΛΤΙΣΤΟΠΟΙΗΣΗ ΜΟΝΑΔΑΣ ΥΠΟΛΟΓΙΣΜΟΥ BUTTERFLY ΓΙΑ ΤΟΝ ΑΛΓΟΡΙΘΜΟ FFT

    … την υλοποίηση μονάδων Fast Fourier Transform (FFT) για αποδεκατισμό στο πεδίο του χρόνου, η οποία χρησιμοποιείται ευρέως σε εφαρμογές Ψηφιακής Επεξεργασίας Σημάτων όπως η Ανάλυση Φάσματος σημάτων, η Συμπίεση Δεδομένων, η σχεδίαση φίλτρων, η λύση Μερικών Διαφορικών Εξισώσεων, ο Πολλαπλασιασμός …

    athens Repository record for ΒΕΛΤΙΣΤΟΠΟΙΗΣΗ ΜΟΝΑΔΑΣ ΥΠΟΛΟΓΙΣΜΟΥ BUTTERFLY ΓΙΑ ΤΟΝ ΑΛΓΟΡΙΘΜΟ FFT (opens in a new tab)

  10. Implementace výpočtu FFT v obvodech FPGA a ASIC

    Cílem diplomové práce je navrhnout implementaci algoritmu rychlé Fourierovi transformace, kterou lze použít v obvodech FPGA nebo ASIC. Implementace bude modelována v prostředí Matlab a následně bude použit tento návrh jako referenční model pro popis implementace algoritmu rychlé Fourierovy …

    brno-tech Repository record for Implementace výpočtu FFT v obvodech FPGA a ASIC (opens in a new tab)

  11. Nízkofrekvenční zesilovač s audio procesorem a FFT analýzou

    … vzorkov do frekvenčnej oblasti je pomocou FFT s Cooley-Tukey algoritmom. Výsledok FFT je zobrazený na grafickom LCD displeji. Celý zosilňovač ako aj ďalšie jeho parametre ako hlasitosť, výšky, vstupný kanál atď. sú nastavované jediným ovládacím prvkom, a síce rotačným enkóderom.

    brno-tech Repository record for Nízkofrekvenční zesilovač s audio procesorem a FFT analýzou (opens in a new tab)

  12. Giant FFT pro konverzi vzorkovacího kmitočtu audio signálu

    … filtry typu FIR a relativně nová metoda Giant FFT. V praktické části je popsána implementace jednotlivých metod. Na závěr jsou provedeny testy, porovnání a vyhodnocení, do kterých je zahrnut i software Reaper.

    brno-tech Repository record for Giant FFT pro konverzi vzorkovacího kmitočtu audio signálu (opens in a new tab)

  13. On the Use of Hybrid Full-Wave CG-FFT and Spectrally Preconditioned CG-FFT Methods for Analyzing Large Microstrip Antenna Arrays

    … Conjugate Gradient - Fast Fourier Transform (CG-FFT) methods for analyzing microstrip arrays. In particular, we investigate spectral preconditioning with the CG-FFT methods.</p> <p>First, a general scheme is introduced for implementing CG-FFT using the spatial discretization. In comparison with …

    mcmaster Repository record for On the Use of Hybrid Full-Wave CG-FFT and Spectrally Preconditioned CG-FFT Methods for Analyzing Large Microstrip Antenna Arrays (opens in a new tab)

  14. Low power FFT processor design considerations for OFDM communications

    … addresses the power-efficient design of an FFT processor as it relates to OFDM communications such as cognitive radio. The Fast Fourier Transform (FFT) processor is what enables the efficient modulation in OFDM. As the FFT processor is the most computationally intensive component in OFDM …

    unlv Repository record for Low power FFT processor design considerations for OFDM communications (opens in a new tab) Download PDF for Low power FFT processor design considerations for OFDM communications (opens in a new tab)

  15. A prime factor FFT algorithm using high speed convolution

    … and additions. Timing for a prime factor FFT algorithm using high speed convolution, which was programmed for an IBM 37 and an 88 microprocessor, is presented.

    rice Repository record for A prime factor FFT algorithm using high speed convolution (opens in a new tab)

  16. FFT-based spectrum analysis using a Digital Signal Processor

    … analyzer based on Fast Fourier Transform (FFT) techniques was implemented using the TMS320C6201 Digital Signal Processor device manufactured by Texas Instruments. Portable C programs demonstrated optimization of the FFT algorithm for maximum speed. Previously published algorithms were …

    nps Repository record for FFT-based spectrum analysis using a Digital Signal Processor (opens in a new tab)

  17. Time/frequency relationships for an FFT-based acoustic modem

    This thesis proposes a scheme for short-range (<500m) underwater acoustic communications in shallow water. The proposed scheme is a variation on an existing commercial modem reliably used for medium-range (<5km) communications in the 9-14 kHz band. The proposed scheme exploits a higher carrier …

    nps Repository record for Time/frequency relationships for an FFT-based acoustic modem (opens in a new tab)

  18. Desenvolvimento de uma FFT utilizando ponto flutuante para FPGA

    … o algoritmo da transformada rápida de Fourier (FFT) em hardware, para FPGAs. Este software Ip-core, bastante utilizado em aplicação científicas, particularmente em processamento digital de sinais, foi desenvolvido utilizando operações aritméticas números de ponto flutuante, padrão IEEE 754, com …

    brazil-ufpe Repository record for Desenvolvimento de uma FFT utilizando ponto flutuante para FPGA (opens in a new tab)

Page 1 of 60