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 14 of 14 for “"Fast Fourier transform algorithms"”.
-
Fast Fourier Transform Algorithms with Applications
This manuscript describes a number of algorithms that can be used to quickly evaluate a polynomial over a collection of points and interpolate these evaluations back into a polynomial. Engineers define the 'Fast Fourier Transform' as a method of solving the interpolation problem where the …
-
Performance prediction of fast Fourier transform algorithms on loosely coupled multiprocessors
… the Radix 2, the Radix 4 and the Prime Factor Fast Fourier Transform algorithms on two instances of message-based multiprocessor architectures. The machines we use are a 16 node Intel iPSC Hypercube, running the Intel operating system version 3.1 and the Crystalline operating system version …
-
Comparison of Radix-w and Radix-3 Fast Fourier Transform Algorithms
… is also included. Comparisons of the two FFT algorithms are given in terms of the number of computations required and in terms of the accuracy obtained using fixed-point arithmetic operations. The results of these comparisons provide detailed descriptions of the efficiency and accuracy of the …
-
Computer Generated Holograms
… have been made practical by the introduction of fast Fourier transform algorithms. The following discussion will brief the reader on the theory and concepts of optical holograms, the computer hologram, and the analogies of the computer hologram to its optical counterpart. Some of the programming …
-
Lygiagretizuota greitoji Furje transformacija naudojant CUDA /
Algorithms that allow calculating discrete Fourier transform faster, also known as Fast Fourier transform algorithms, are explorer. Mathematical properties selected radix-2 Cooley-Tukey and radix-2, radix-4, radix-8, radix-16 Stockham algorithms are described. This is accompanied by examination of …
-
Modeling and verification of DSP designs in HOL
… case studies such as digital filters and FFT (Fast Fourier Transform) algorithms.
-
Efficient finite field arithmetic with cryptographic applications
… hardware, which makes it pertinent to develop a fast and efficient implementation. We propose four improved FPGA multiplication implementations using the Karatsuba and Fast Fourier Transform algorithms over GF (2n). We also implement the hyperelliptic curve coprocessor and compare the results of …
-
On-board three-dimensional object tracking: Software and hardware solutions
… In the thesis a comparative study of different algorithms and performance evaluation is carried out based on time and accuracy constraints. For background subtraction task we evaluate frame differencing, approximate median filter, mixture of Gaussians and propose classification based on neural …
-
Interaction between a transient plane wave and a conductive half-space.
… waves are first represented as inverse Laplace transforms. The transient fields are then shown to consist of two canonical integrals, f(β) and e(β)The canonical integrals, in turn, are solved analytically, thereby yielding closed-form solutions involving incomplete Lipschitz-Hankel integrals …
-
Digital signal processing implementing the C language with graphics spectrum analysis display
… discussed in this thesis is concerned with the transformation of signals or complex wave forms From time domain to frequency domain and vise-versa, implemented on microcomputer systems. The primary principles are: speed of transformation, ease of usage as an application program, capabilities of …
-
Parallel implementation of image segmentation algorithms on a network of transputers
… of several classes of image segmentation algorithms on parallel architectures. The Transputer is used as the basic building block of hardware architectures and Occam is used as the programming language. The segmentation methods chosen for implementation are convolution, for edge-based …
-
Satellite borne radar altimetry : empirical orbit refinement and ocean signal recovery techniques
… This study was then developed into Optimal Fourier Transform Interpolation, a technique capable of analysing complete altimeter datasets for the determination of consistent global high resolution geoid maps. This method exploits the regular nature of ascending and descending data subsets …
-
Towards energy-performance trade-off analysis of parallel applications
… help in the design of more energy efficient algorithms. Towards this goal, we introduce four energy-performance trade-off metrics namely: (a) energy consumption under fixed performance for energy conservation in time constrained applications, (b) energy bounded performance for improving …
-
Low-Cost Electronic Structure Methods for Computational Materials Science
… to electronic structure codes without efficient fast fourier transform algorithms by employing cost-efficient atom-pairwise and many-body dispersion corrections. The results indicate that atom-pairwise methods, such as the Tkatchenko-Scheffler (TS) van der Waals correction and, particularly, the …