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 102 for “"Fast Fourier Transform (FFT)"”.
-
Automatic Optimization of DSP Algorithms
… C/FORTRAN code. Timings are compared, using fast Fourier transform (FFT), Walsh-Hadama transform (WHT), discrete cosine transform (DCT) and discrete sine transform (DST) as the benchmarks, to those obtained by highly optimized implementations including FFTW and the WHT package. The results of …
-
Analysis and Optimization of Reflector Antenna Systems (Pattern Calculation, Optimum Directivity, Sidelobe Reduction)
… physical optics (PO) and the application of the Fast Fourier Transform (FFT) to the aperture fields obtained using geometrical optics (GO), geometrical theory of diffraction (GTD) and a brute-force FFT. Key features of the present work are (i) the reflector surface is completely arbitrary, (ii) …
-
Implementation of a 2-D fast Fourier transform on an FPGA-based computing platform
The two dimensional fast Fourier transform (FFT) is a useful operation in many digital signal processing applications, but it is often avoided due to its large computational requirements. This thesis presents the implementation and performance figures for the fast Fourier transform on an FPGA-based …
-
Analysis of digital communication signals and extraction of parameters
… compared include broadband energy detection, FFT- based narrowband energy detection, and two correlation methods which employ the Fast Fourier Transform (FFT). The correlation methods utilize modified time- frequency distributions, where one of these is based on the Wigner-Ville Distribution …
-
Electromagnetic simulations in frequency and time domain using adaptive integral method
… (MFIE) testing scheme for AIM, the interlaced fast Fourier transform (FFT) method for solving general scattering problems, a parallelized fast partial matrix solver for the simulation of very large scale microstrip circuits and the improved block aggregate matrix vector multiply for time domain …
-
A design of floating point FFT using Genesil Silicon Compiler.
… and subtraction operation necessary in the Fast Fourier Transform (FFT). In this thesis, the IEEE floating-point standard is adopted and scaled down to 16 bits, but the exponent is an excess-8 number represented using radix-2. A 16 bit reduced word size floating-point arithematic unit for …
-
Designing a Multichannel Sense-and-Avoid Radar for Small UASs
… determined by employing a two-dimensional (2-D) Fast Fourier Transform (FFT) on the received signal which maps the target to a specific range-Doppler bin. An array of receiving antennas is used to determine a target's elevation and azimuth angles by exploiting the received signal's phase …
-
Analysis of parametric model signal processing techniques for signature analysis
… identified to be possible alternatives to the Fast Fourier Transform (FFT) for signature analyses involving short data records. The developments in signal processing that have lead to these techniques are reviewed. Mathematical definitions for parametric models are provided in terms of …
-
The parametrically excited pendulum and the criteria for predicting the onset of chaos
… by simulation. The Lyapunov exponent and the fast Fourier transform ( FFT ) are used as the criteria to determine if the system is chaotic. Two predictive theoretical criteria, the Melnikov criterion and a period-doubling criterion, are then applied to the system. The results obtained by …
-
Ανάπτυξη ανεμογενών κυματισμών. Επεξεργασία μετρήσεων και μαθηματικά μοντέλα πρόγνωσης
… THE ANALYSIS OF THE WAVE DATA IS MADE WITH THE FAST FOURIER TRANSFORM (FFT). THE MATHEMATICAL SIMULATION OF THE PHENOMENON CONSISTSOF SOLVING NUMERICALLY THE DIFFERENTIAL EQUATION OF WAVE ENERGY BALANCE. THE FORMATION OF A SECOND GENERATION WAVE FORECASTING MODEL GIVES THE ABILITY TO ESTIMATE …
-
Performance evaluation of nonlinear satellite link by computer simulation
… the simulation procedure are real-valued and are transformed back and forth between time and frequency domains depending on the necessity by the Fast Fourier Transform (FFT) or Inverse Discrete Fourier Transform (IDFT). The simulation result represented as average Bit Error Rate (BER) gives the …
-
Universal Atrial Coordinate (UAC) for Wall Motion Deep Learning
… Signed Distance Fields (SDF) and decomposed via fast Fourier transform (FFT), showed coordinated low-frequency contraction in SR and reduced amplitude with higher-frequency content in AF. The framework enables anatomy-independent motion comparison and has the potential to predict AF signatures …
-
Improving Mobile SOC's Performance as an Energy Efficient DSP Platform with Heterogeneous Computing
… several implementations of both the discrete Fourier transform (DFT) and the fast Fourier transform (FFT) are tested across devices. The results show both improvement in performance and energy efficiency on many devices compared to traditional Java implementations and indicate that the mobile …
-
EEG signal classification for wheelchair control application
… were analyzed to find out the features by using Fast Fourier Transform (FFT). This project used alpha and beta band to collect the data. The analysis have made based on the peak and average value which then be compared to define the most significant differentiation between signals. From the …
-
Low-energy radix-2 serial and parallel FFT designs
… and low energy hardware implementations of the Fast Fourier Transform (FFT). This work presents several new hardware implementations of the radix-2 FFT algorithms that take advantage of intermittent data and parallelism to reduce the energy per FFT. In the modified serial design, by using a …
-
Determination of the Mechanical Properties of Electrospun Gelatin Based on Polymer Concentration and Fiber Alignment
… perpendicular to the axis of mandrel rotation. Fast Fourier Transform (FFT) analysis was performed on these samples, to determine how fiber alignment is affected by starting polymer concentration and the rotational speed of the target mandrel. Mechanical tests were aiso performed on these …
-
Implementation of Orthogonal Frequency Division Multiplexing with FPGA
… system include a modulator, an N-input inverse Fast Fourier Transform (IFFT), two root raised cosine filters (RRC filter), an N-input Fast Fourier Transform (FFT), and a demodulator. These components are designed by using very-high-speed integrated circuits (VHSIC) hardware description language …
-
Utilizing GPU tensor cores for algorithmic acceleration
… Tensor Core based reduction, power iteration and Fast Fourier Transform (FFT) and show that effectively utilizing GPU compute resources would result in substantial gains in performance. Our reduction gave a 1.5 times speedup against CUB API; power iteration gave on average 2 times the speedup …
-
Numerical Analysis of Jump-Diffusion Models for Option Pricing
… the here considered models of Merton and Kou. We transform the PIDE to eliminate the convection term, discretize it implicitly using finite differences and the second order backward difference formula (BDF2) on a uniform grid. The arising dense linear system is solved by an iterative method, …
-
Putting Fürer's Algorithm into Practice with the BPAS Library
Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as other disciplines. In 1971, Schönhage and Strassen designed an algorithm that improved the multiplication time for two integers of at most n bits to O(log n log log n). In 2007, …
Page 1 of 6