To see the other types of publications on this topic, follow the link: Fast Fourier Transform(FFT).
Dissertations / Theses on the topic 'Fast Fourier Transform(FFT)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Fast Fourier Transform(FFT).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Mirza, Ameen Baig. "Parallel Computation of the Interleaved Fast Fourier Transform with MPI." University of Akron / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=akron1226941684.
Full text
2
Palmer, Joseph M. "The Hybrid Architecture Parallel Fast Fourier Transform (HAPFFT)." BYU ScholarsArchive, 2005. https://scholarsarchive.byu.edu/etd/555.
Full textAbstract:
The FFT is an efficient algorithm for computing the DFT. It drastically reduces the cost of implementing the DFT on digital computing systems. Nevertheless, the FFT is still computationally intensive, and continued technological advances of computers demand larger and faster implementations of this algorithm. Past attempts at producing high-performance, and small FFT implementations, have focused on custom hardware (ASICs and FPGAs). Ultimately, the most efficient have been single-chipped, streaming I/O, pipelined FFT architectures. These architectures increase computational concurrency through the use of hardware pipelining. Streaming I/O, pipelined FFT architectures are capable of accepting a single data sample every clock cycle. In principle, the maximum clock frequency of such a circuit is limited only by its critical delay path. The delay of the critical path may be decreased by the addition of pipeline registers. Nevertheless this solution gives diminishing returns. Thus, the streaming I/O, pipelined FFT is ultimately limited in the maximum performance it can provide. Attempts have been made to map the Parallel FFT algorithm to custom hardware. Yet, the Parallel FFT was formulated and optimized to execute on a machine with multiple, identical, processing elements. When executed on such a machine, the FFT requires a large expense on communications. Therefore, a direct mapping of the Parallel FFT to custom hardware results in a circuit with complex control and global data movement. This thesis proposes the Hybrid Architecture Parallel FFT (HAPFFT) as an alternative. The HAPFFT is an improved formulation for building Parallel FFT custom hardware modules. It provides improved performance, efficient resource utilization, and reduced design time. The HAPFFT is modular in nature. It includes a custom front-end parallel processing unit which produces intermediate results. The intermediate results are sent to multiple, independent FFT modules. These independent modules form the back-end of the HAPFFT, and are generic, meaning that any prexisting FFT architecture may be used. With P back-end modules a speedup of P will be achieved, in comparison to an FFT module composed solely of a single module. Furthermore, the HAPFFT defines the front-end processing unit as a function of P. It hides the high communication costs typically seen in Parallel FFTs. Reductions in control complexity, memory demands, and logical resources, are achieved. An extraordinary result of the HAPFFT formulation is a sublinear area-time growth. This phenomenon is often also called superlinear speedup. Sublinear area-time growth and superlinear speedup are equivalent terms. This thesis will subsequently use the term superlinear speedup to refer to the HAPFFT's outstanding speedup behavior. A further benefit resulting from the HAPFFT formulation is reduced design time. Because the HAPFFT defines only the front-end module, and because the back-end parallel modules may be composed of any preexisting FFT modules, total design time for a HAPFFT is greatly reduced
3
Beyene, Joseph. "Uses of the fast Fourier transform (FFT) in exact statistical inference." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/NQ63594.pdf.
Full text
4
Khan, Aman Ullah. "Parallel computation of fast Fourier transforms." Thesis, Cardiff University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340239.
Full text
5
Volkmer, Toni. "Taylor and rank-1 lattice based nonequispaced fast Fourier transform." Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-106489.
Full textAbstract:
The nonequispaced fast Fourier transform (NFFT) allows the fast approximate evaluation of trigonometric polynomials with frequencies supported on full box-shaped grids at arbitrary sampling nodes. Due to the curse of dimensionality, the total number of frequencies and thus, the total arithmetic complexity can already be very large for small refinements at medium dimensions. In this paper, we present an approach for the fast approximate evaluation of trigonometric polynomials with frequencies supported on an arbitrary subset of the full grid at arbitrary sampling nodes, which is based on Taylor expansion and rank-1 lattice methods. For the special case of symmetric hyperbolic cross index sets in frequency domain, we present error estimates and numerical results.
6
Lo, Buglio Dario. "La trasformata veloce di Fourier (FFT): analisi e implementazione in C++." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8866/.
Full textAbstract:
La trasformata di Fourier (FT) è uno strumento molto potente implementato, oggi, in un enorme numero di tecnologie. Il suo primo esempio di applicazione fu proprio
il campionamento e la digitalizzazione di segnali analogici. Nel tempo l'utilizzo della FT è stato ampliato a più orizzonti in ambito digitale, basti pensare che il formato di compressione '.jpg' utilizza una FT bidimensionale, mentre uno degli ultimi esempi di applicazione si ha nell'imaging digitale in ambito medico (risonanza magnetica nucleare, tomografia assiale computerizzata TAC ecc...). Nonostante gli utilizzi della
FT siano molto diversificati il suo basilare funzionamento non è mai cambiato: essa non fa altro che modificare il dominio di una funzione del tempo (un segnale) in un
dominio delle frequenze, permettendo così lo studio della composizione in termini di frequenza, ampiezza e fase del segnale stesso. Parallelamente all'evoluzione in termini di applicazioni si è sviluppato uno studio volto a migliorare e ottimizzare la computazione della stessa, data l'esponenziale crescita del suo utilizzo. In questa trattazione si vuole analizzare uno degli algoritmi di ottimizzazione più celebri e utilizzati in tal senso: la trasformata veloce di Fourier (Fast Fourier Transformation
o FFT). Si delineeranno quindi le caratteristiche salienti della FT, e verrà introdotto l'algoritmo di computazione tramite linguaggio C++ dedicando particolare attenzione
ai limiti di applicazione di tale algoritmo e a come poter modificare opportunamente la nostra funzione in modo da ricondurci entro i limiti di validità.
7
Sajabi, Cyprian D. "FPGA FREQUENCY DOMAIN BASED GPS COARSE ACQUISITION PROCESSOR USING FFT." Wright State University / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=wright1150916512.
Full text
8
Rosenthal, Glenn, and Thomas Salley. "USING THE FFT FOR DSP SPECTRUM ANALYSIS: A TELEMETRY ENGINEERING APPROACH." International Foundation for Telemetering, 1990. http://hdl.handle.net/10150/613797.
Full textAbstract:
International Telemetering Conference Proceedings / October 29-November 02, 1990 / Riviera Hotel and Convention Center, Las Vegas, NevadaThe Fast Fourier Transform (FFT) converts digitally sampled time domain data into the frequency domain. This paper will provide an advanced introduction for the telemetry engineer to basic FFT theory and then present and explain the different user preprocessing options that are available when using the FFT. These options include: using windowing functions, “zero filling” for frequency data interpolation, and setting the frequency resolution of the FFT resultant spectrum,
9
Wilson, Huon. "Computing fast and accurate convolutions." Thesis, The University of Sydney, 2016. http://hdl.handle.net/2123/15169.
Full textAbstract:
The analysis of data often models random components as a sum of in- dependent random variables (RVs). These RVs are often assumed to be lattice-valued, either implied by the problem or for computational efficiency. Thus, such analysis typically requires computing, or, more commonly, ap- proximating a portion of the distribution of that sum. Computing the underlying distribution without approximations falls un- der the area of exact tests. These are becoming more popular with continuing increases in both computing power and the size of data sets. For the RVs above, exactly computing the underlying distribution is done via a convolu- tion of their probability mass functions, which reduces to convolving pairs of non-negative vectors. This is conceptually simple, but practical implementations must care- fully consider both speed and accuracy. Such implementations fall prey to the round-off error inherent to floating point arithmetic, risking large rela- tive errors in computed results. There are two main existing algorithms for computing convolutions of vectors: naive convolution (NC) has small bounds on the relative error of each element of the result but has quadratic runtime; while Fast Fourier Transform-based convolution (FFT-C) has almost linear runtime but does not control the relative error of each element, due to the accumulation of round-off error. This essay introduces two novel algorithms for these problems: aFFT-C for computing convolution of two non-negative vectors, and sisFFT for com- puting p-values of sums of independent and identically-distributed lattice- valued RVs. Through a rigorous analysis of round-off error and its accumula- tion, both aFFT-C and sisFFT provide control of the relative error similar to NC, but are typically closer in speed to FFT-C by careful use of FFT-based convolutions and by aggressively discarding irrelevant values. Both accuracy and performance are demonstrated empirically with a variety of examples.
10
Sandström, Tobias. "Condition Monitoring of Ceramic Ball Bearings in an Engine Testing Dynamometer." Thesis, KTH, Maskinkonstruktion (Inst.), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-183126.
Full textAbstract:
The choice of the topic addressed in this thesis aims to improve the service and maintenance on ceramic ball bearings in a specific test dynamometer and through an engineering approach develop tools for condition monitoring. The company connected to this thesis, AVL, is the world's largest privately owned company for development, simulation and testing technology of powertrains for passenger cars, trucks and large engines. Engine testing is a critical part of the business at AVL Sweden and unexpected bearing failure can result in long repair times and great economic losses due to loss of the testing time. In short terms, the methodological approach followed the following steps; first a thorough information retrieval regarding bearings and analysis was conducted. The search was deepened around areas such as hybrid ball bearings, bearing failure mechanisms, bearing defect frequencies, signal analysis and condition monitoring. After this a table for bearing damage detection was developed and a “step by step” guidance for condition monitoring. The tools where afterwards verified by simple testing to detect complications within the chosen system. The existing condition monitoring system that is used today revealed weaknesses as it lacked the feature of taking preventive measures. The system that is based on temperature measurements isn’t satisfactory enough, especially when it’s missing visual clarity. Service and maintenance according to specifications from the manufacturer should be scheduled to ensure operational and guarantees. Currently mounted accelerometers on the housing of the Dynas3 engine should be connected for collecting data and the total sum of energy should be calculated for simple monitoring of historical progression. This should be done by following the guidance in order to ensure proper data acquisition. The best way to implement condition monitoring showed to be by performing multi-parameter monitoring. The design of the condition monitoring system is highly connected to what to monitor and at what stage. One main consideration to keep in mind is that it’s very rare that manufacturing defects are the reason for bearing failure. Instead it derives from improper storage, transport, handling or dimensional errors and even in some cases by improperly implemented force analysis prior to bearing selection.Huvudämnet som behandlas i detta examensarbete syftar till att förbättra service och underhåll på keramiska kullager i en viss testdynamometer och genom ett ingenjörsmässigt tillvägagångsätt utveckla verktyg för tillståndsövervakning. Företaget som är ansluten till detta examensarbete är AVL som är världens största privatägda företag för utveckling, simulering och testteknik för drivlinor för personbilar, lastbilar och stora motorer. Motorprovning är en viktig del av verksamheten vid AVL Sverige, och ett oväntat lagerhaveri kan leda till långa reparationstider och stora ekonomiska förluster på grund av utebliven test tid. I korta termer följde den metod som använts följande steg, först genomfördes en grundlig informationssökning om lager och tillhörande analyser. Efter det fördjupades sökande kring områden som hybrida kullager, lagerskademekanismer, frekvenser kopplade till lagerskador, signalanalys och tillståndsövervakning. Efter detta framställdes en tabell för detektering av lagerskador, samt en ”steg för steg” guide för tillståndsövervakning. Verktygen för tillståndsövervakning kontrolleras efteråt, genom att enkla tester genomfördes för att upptäcka komplikationer inom det valda systemet. Det övervakningssystem som används idag avslöjade svagheter genom att sakna funktionen att vidta förebyggande åtgärder. System som är baserat på temperaturmätningar är inte tillräckligt tillfredsställande, speciellt när det saknar en visuell tydlighet. Den service och underhåll som enligt tillverkarens föreskrifter påvisas bör planeras för att säkerställa drift och garantier. Nuvarande monterade accelerometrar fästa vid motorhöljet bör anslutas för att insamla data, och den totala summan av energin bör beräknas för en enkel övervakning av det historiska utvecklingsförloppet. Detta bör göras genom att följa de riktlinjer som framställts för att säkerställa korrekt datainsamling. Det bäst passande sättet att genomföra tillståndsövervakning på i detta fall visade sig vara att utföra multiparameterövervakning. Framställningen av tillståndsövervakningssystemet är starkt förknippat med vad som skall övervakas och i vilket skede. En huvudsaklig bidragande faktor att komma ihåg är att det är mycket ovanligt att fabrikationsfel är orsaken till lagerhaveri. Istället härstammar haveriet från felaktig förvaring, transportering, hantering eller dimensioneringsfel och i vissa fall av felaktigt genomförd kraftanalys inför lagerval.
11
Nestler, Franziska. "Automated Parameter Tuning based on RMS Errors for nonequispaced FFTs." Universitätsbibliothek Chemnitz, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-160989.
Full textAbstract:
In this paper we study the error behavior of the well known fast Fourier transform for nonequispaced data (NFFT) with respect to the L2-norm. We compare the arising errors for different window functions and show that the accuracy of the algorithm can be significantly improved by modifying the shape of the window function. Based on the considered error estimates for different window functions we are able to state an easy and efficient method to tune the involved parameters automatically. The numerical examples show that the optimal parameters depend on the given Fourier coefficients, which are assumed not to be of a random structure or roughly of the same magnitude but rather subject to a certain decrease.
12
Pippig, Michael, and Daniel Potts. "Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation." Universitätsbibliothek Chemnitz, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-94926.
Full textAbstract:
In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms on massively parallel distributed memory architectures. These algorithms are implemented in an open source software library called PNFFT. Furthermore, we derive a parallel fast algorithm for the computation of the Coulomb potentials and forces in a charged particle system, which is based on the parallel nonequispaced fast Fourier transform. To prove the high scalability of our algorithms we provide performance results on a BlueGene/P system using up to 65536 cores.
13
Svensson, Markus, and Thomas Österholm. "Optimization and Verification of an Integrated DSP." Thesis, Linköping University, Department of Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15679.
Full textAbstract:
There is a lot of applications for DSPs (Digital Signal Processor) in the most rapidly growing areas in the industry right now as wireless communication along with audio and video products are getting more and more popular. In this report, a DSP, developed at the division of Computer Engineering at the University of Linköping, is optimized and verified.
Register Forwarding was implemented on a general architecture level to avoiddata hazards that may arise when implementing instruction pipelining in a processor.
The very common FFT algorithm is also optimized but on instruction setlevel. That means the algorithm is carefully analyzed to find operations that mayexecute in parallel and then create new instructions for these parallel operations.The optimization is concentrated on the butterfly operation as it is such a majorpart of the FFT computation. Comparing the accelerated butterfly with the unaccelerated gives an improvement of 30% in terms of clock cycles needed for thecomputation.
In the report there are also some discussions about the benefits and drawbacksof changing from a hardware to a software stack, mostly in terms of interrupts andthe return instruction.
Another important property of the processor is scalability. That is, it is possibleto attach extra peripherals to the core, which accelerates certain tasks. Aninterface towards these peripherals is developed along with two template designsthat may be used to develop other peripherals.
After all these modifications, a new test bench is developed to verify the functionality.
14
Nicklous, Francis Edward. "The Design, Simulation and Synthesis of Pipelined Floating-Point Radix-4 Fast Fourier Transform Data Path in VHDL." Master's thesis, Temple University Libraries, 2010. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/96963.
Full textAbstract:
Electrical EngineeringM.S.E.
The Fast Fourier Transform (FFT) converts time or spatial information into the frequency domain. The FFT is one of the most widely used digital signal processing (DSP) algorithms. DSPs are used in a number of applications from communication and controls to speech and image processing. DSPs have also found their way into toys, music synthesizers and in most digital instruments. Many applications have relied on Digital Signal Processors and Application Specific Integrated Circuits (ASIC) for most of the signal processing needs. DSPs provide an adequate means of performance and efficiency for many applications as well as robust tools to ease the development process. However, the requirements of important emerging DSP applications have begun to exceed the capabilities of DSPs. With this in mind, system developers have begun to consider alternatives such as ASICs and Field Programmable Gate Arrays (FPGA). Although ASICs can provide excellent performance and efficiency, the time, cost and risk associated with the design of ASICs is leading developers towards FPGAs. A number of significant advances in FPGA technology have improved the suitability of FPGAs for DSP applications. These advances include increased device capacity and speed, DSP-oriented architectural enhancements, better DSP-oriented tools, and increasing availability of DSP-oriented IP libraries. The thesis research focuses on the design of a single precision floating-point radix-4 FFT FPGA using VHDL for real time DSP applications. The paper will go into further detail pertaining to the FFT algorithm used, the description of the design steps taken as well as the results from both simulation and synthesis.
Temple University--Theses
15
Pippig, Michael. "Massively Parallel, Fast Fourier Transforms and Particle-Mesh Methods." Doctoral thesis, Universitätsbibliothek Chemnitz, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-197359.
Full textAbstract:
The present thesis provides a modularized view on the structure of fast numerical methods for computing Coulomb interactions between charged particles in three-dimensional space. Thereby, the common structure is given in terms of three self-contained algorithmic frameworks that are built on top of each other, namely fast Fourier transform (FFT), nonequispaced fast Fourier transform (NFFT) and NFFT based particle-mesh methods (P²NFFT). For each of these frameworks algorithmic enhancement and parallel implementations are presented with special emphasis on scalability up to hundreds of thousands of parallel processes. In the context of FFT massively parallel algorithms are composed from hardware adaptive low level modules provided by the FFTW software library. The new algorithmic NFFT concepts include pruned NFFT, interlacing, analytic differentiation, and optimized deconvolution in Fourier space with respect to a mean square aliasing error. Enabled by these generalized concepts it is shown that NFFT provides a unified access to particle-mesh methods. Especially, mixed-periodic boundary conditions are handled in a consistent way and interlacing can be incorporated more efficiently. Heuristic approaches for parameter tuning are presented on the basis of thorough error estimatesDie vorliegende Dissertation beschreibt einen modularisierten Blick auf die Struktur schneller numerischer Methoden für die Berechnung der Coulomb-Wechselwirkungen zwischen Ladungen im dreidimensionalen Raum. Die gemeinsame Struktur ist geprägt durch drei selbstständige und auf einander aufbauenden Algorithmen, nämlich der schnellen Fourier-Transformation (FFT), der nicht äquidistanten schnellen Fourier-Transformation (NFFT) und der NFFT-basierten Teilchen-Gitter-Methode (P²NFFT). Für jeden dieser Algorithmen werden Verbesserungen und parallele Implementierungen vorgestellt mit besonderem Augenmerk auf massiv paralleler Skalierbarkeit. Im Kontext der FFT werden parallele Algorithmen aus den Hardware adaptiven Modulen der FFTW Softwarebibliothek zusammengesetzt. Die neuen NFFT-Konzepte beinhalten abgeschnittene NFFT, Versatz, analytische Differentiation und optimierte Entfaltung im Fourier-Raum bezüglich des mittleren quadratischen Aliasfehlers. Mit Hilfe dieser Verallgemeinerungen bietet die NFFT einen vereinheitlichten Zugang zu Teilchen-Gitter-Methoden. Insbesondere gemischt periodische Randbedingungen werden einheitlich behandelt und Versatz wird effizienter umgesetzt. Heuristiken für die Parameterwahl werden auf Basis sorgfältiger Fehlerabschätzungen angegeben
16
Volkmer, Toni. "OpenMP parallelization in the NFFT software library." Universitätsbibliothek Chemnitz, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-94837.
Full textAbstract:
We describe an implementation of a multi-threaded NFFT (nonequispaced fast Fourier transform) software library and present the used parallelization approaches. Besides the NFFT kernel, the NFFT on the two-sphere and the fast summation based on NFFT are also parallelized. Thereby, the parallelization is based on OpenMP and the multi-threaded FFTW library. Furthermore, benchmarks for various cases are performed. The results show that an efficiency higher than 0.50 and up to 0.79 can still be achieved at 12 threads.
17
Qureshi, Fahad. "Optimization of Rotations in FFTs." Doctoral thesis, Linköpings universitet, Elektroniksystem, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-74702.
Full textAbstract:
The aims of this thesis are to reduce the complexity and increasethe accuracy of rotations carried out inthe fast Fourier transform (FFT) at algorithmic and arithmetic level.In FFT algorithms, rotations appear after every hardware stage, which are alsoreferred to as twiddle factor multiplications. At algorithmic level, the focus is on the development and analysisof FFT algorithms. With this goal, a new approach based on binary tree decompositionis proposed. It uses the Cooley Tukey algorithm to generate a large number ofFFT algorithms. These FFT algorithms have identical butterfly operations and data flow but differ inthe value of the rotations. Along with this, a technique for computing the indices of the twiddle factors based on the binary tree representation has been proposed. We have analyzed thealgorithms in terms of switching activity, coefficient memory size, number of non-trivial multiplicationsand round-off noise. These parameters have impact on the power consumption, area, and accuracy of the architecture.Furthermore, we have analyzed some specific cases in more detail for subsets of the generated algorithms. At arithmetic level, the focus is on the hardware implementation of the rotations.These can be implemented using a complex multiplier,the CORDIC algorithm, and constant multiplications. Architectures based on the CORDIC and constant multiplication use shift and add operations, whereas the complex multiplication generally uses four real multiplications and two adders.The sine and cosine coefficients of the rotation angles fora complex multiplier are normally stored in a memory.The implementation of the coefficient memory is analyzed and the best possible approaches are analyzed.Furthermore, a number of twiddle factor multiplication architectures based on constant multiplications is investigated and proposed. In the first approach, the number of twiddle factor coefficients is reduced by trigonometric identities. By considering the addition aware quantization method, the accuracy and adder count of the coefficients are improved. A second architecture based on scaling the rotations such that they no longer have unity gain is proposed. This results in twiddle factor multipliers with even lower complexity and/or higher accuracy compared to the first proposed architecture.
18
Bowlyn, Kevin Nathaniel. "IMPLEMENTATION OF A NOVEL INTEGRATED DISTRIBUTED ARITHMETIC AND COMPLEX BINARY NUMBER SYSTEM IN FAST FOURIER TRANSFORM ALGORITHM." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/dissertations/1470.
Full textAbstract:
This research focuses on a novel integrated approach for computing and representing complex numbers as a single entity without the use of any dedicated multiplier for calculating the fast Fourier transform algorithm (FFT), using the Distributed Arithmetic (DA) technique and Complex Binary Number Systems (CBNS). The FFT algorithm is one of the most used and implemented technique employed in many Digital Signal Processing (DSP) applications in the field of science, engineering, and mathematics. The DA approach is a technique that is used to compute the inner dot product between two vectors without the use of any dedicated multipliers. These dedicated multipliers are fast but they consume a large amount of hardware and are quite costly. The DA multiplier process is accomplished by shifting and adding only without the need of any dedicated multiplier. In today's technology, complex numbers are computed using the divide and conquer approach in which complex numbers are divided into two parts: the real and imaginary. The CBNS technique however, allows for each complex addition and multiplication to be computed in one single step instead of two. With the combined DA-CBNS approach for computing the FFT algorithm, those dedicated multipliers are being replaced with a DA system that utilize a Rom-based memory for storing the twiddle factor 'wn' value and the complex arithmetic operations being represented as a single entity, not two, with the CBNS approach. This architectural design was implemented by coding in a very high speed integrated circuit (VHSIC) hardware description language (VHDL) using Xilinx ISE design suite software program version 14.2. This computer aided tool allows for the design to be synthesized to a logic gate level in order to be further implemented onto a Field Programmable Gate Array (FPGA) device. The VHDL code used to build this architecture was downloaded on a Nexys 4 DDR Artix-7 FPGA board for further testing and analysis. This novel technique resulted in the use of no dedicated multipliers and required half the amount of complex arithmetic computations needed for calculating an FFT structure compared with its current traditional approach. Finally, the results showed that for the proposed architecture design, for a 32 bit, 8-point DA-CBNS FFT structure, the results showed a 32% area reduction, 41% power reduction, 59% reduction in run-time, 42% reduction in logic gate cost, and 66% increase in speed. For a 28 bit, 16-point DA-CBNS FFT structure, its area size, power consumption, run-time, and logic gate, were also found to be reduced at approximately 30%, 37%, 60%, and 39%, respectively, with an increase of speed of approximately 67% when compared to the traditional approach that employs dedicated multipliers and computes its complex arithmetic as two separate entities: the real and imaginary.
19
Chen, Long. "Optimizing the Fast Fourier Transform on a many-core architecture." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 66 p, 2008. http://proquest.umi.com/pqdweb?did=1459924761&sid=28&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text
20
Kolb, John. "SIGNAL PROCESSING ABOUT A DISTRIBUTED DATA ACQUISITION SYSTEM." International Foundation for Telemetering, 2002. http://hdl.handle.net/10150/605610.
Full textAbstract:
International Telemetering Conference Proceedings / October 21, 2002 / Town & Country Hotel and Conference Center, San Diego, CaliforniaBecause modern data acquisition systems use digital backplanes, it is logical for more and more data processing to be done in each Data Acquisition Unit (DAU) or even in each module. The processing related to an analog acquisition module typically takes the form of digital signal conditioning for range adjust, linearization and filtering. Some of the advantages of this are discussed in this paper. The next stage is powerful processing boards within DAUs for data reduction and third-party algorithm development. Once data is being written to and from powerful processing modules an obvious next step is networking and decom-less access to data. This paper discusses some of the issues related to these types of processing.
21
Ganesh, Murthy C. N. S. "A Study On Bandpassed Speech From The Point Of Intelligibility." Thesis, Indian Institute of Science, 1989. https://etd.iisc.ac.in/handle/2005/93.
Full textAbstract:
Speech has been the subject of interest for a very long time. Even with so much advancement in the processing techniques and in the understanding of the source of speech, it is, even today, rather difficult to generate speech in the laboratory in all its aspects. A simple aspect like how the speech can retain its intelligibility even if it is distorted or band passed is not really understood. This thesis deals
with one small feature of speech viz., the intelligibility of speech is retained even when it is bandpassed with a minimum bandwidth of around 1 KHz located any where on the speech
spectrum of 0-4 KHz.
Several experiments have been conducted by the earlier workers by passing speech through various distortors like differentiators, integrators and infinite peak clippers and it is found that the intelligibility is retained to a very large extent in the distorted speech. The integrator and the differentiator remove essentially a certain portion of the spectrum. Therefore, it is thought that the intelligibility of the speech is spread over the entire speech spectrum and that, the intelligibility of speech may not be impaired even when it is bandpassed with a minimum bandwidth and the band may be located any where in the speech spectrum. To test this idea and establish this feature if it exists, preliminary
experiments have been conducted by passing the speech through different filters and it is found that the conjecture seems to be on the right line.
To carry out systematic experiments on this an
experimental set up has been designed and fabricated which consists of a microprocessor controlled speech recording, storing and speech playback system. Also, a personal computer
is coupled to the microprocessor system to enable the storage and processing of the data. Thirty persons drawn from different walks of life like teachers, mechanics and students have been involved for collecting the samples and for
recognition of the information of the processed speech. Even though the sentences like 'This is devices lab' are used to ascertain the effect of bandwidth on the intelligibility, for the purpose of analysis, vowels are used as the speech samples.
The experiments essentially consist of recording words and sentences spoken by the 30 participants and these recorded speech samples are passed through different filters with different bandwidths and central frequencies. The filtered output is played back to the various listeners and
observations regarding the intelligibility of the speech are noted. The listeners do not have any prior information about the content of the speech. It has been found that in almost
all (95%) cases, the messages or words are intelligible for most of the listeners when the band width of the filter is about 1 KHz and this is independent of the location of the pass band in the spectrum of 0-4 KHz. To understand how this feature of speech arises, spectrums of vowels spoken by 30 people have using FFT algorithms on the digitized samples of the speech.
It is felt that there is a cyclic behavior of the spectrum in all the samples. To make sure that the periodicity is present and also to arrive at the periodicity, a moving average procedure is employed to smoothen the spectrum. The smoothened spectrums of all the vowels indeed show a periodicity of about 1 KHz. When the periodicities are analysed the average value of the periodicities has been found to be 1038 Hz with a standard deviation of 19 Hz. In view of this it is thought that the acoustic source
responsible for speech must have generated this periodic spectrum, which might have been modified periodically to imprint the intelligibility. If this is true, one can perhaps easily understand this feature of the speech viz., the intelligibility is retained in a bandpassed speech of bandwidth 1 K H z . the pass band located any where in the speech spectrum of 0-4 KHz. This thesis describing the experiments and the analysis of the speech has been presented in 5 chapters. Chapter 1 deals with the basics of speech and the processing tools used to analyse the speech signal. Chapter 2 presents the literature survey from where the present problem is tracked down. Chapter 3 describes the details of the structure and the fabrication of the experimental setup that has been used. In chapter 4, the detailed account of the way in which the
experiments are conducted and the way in which the speech is analysed is given. In conclusion in chapter 5, the work is summarised and the future work needed to establish the mechanism of speech responsible for the feature of speech described in this thesis is suggested.
22
Ganesh, Murthy C. N. S. "A Study On Bandpassed Speech From The Point Of Intelligibility." Thesis, Indian Institute of Science, 1989. http://hdl.handle.net/2005/93.
Full textAbstract:
Speech has been the subject of interest for a very long time. Even with so much advancement in the processing techniques and in the understanding of the source of speech, it is, even today, rather difficult to generate speech in the laboratory in all its aspects. A simple aspect like how the speech can retain its intelligibility even if it is distorted or band passed is not really understood. This thesis deals
with one small feature of speech viz., the intelligibility of speech is retained even when it is bandpassed with a minimum bandwidth of around 1 KHz located any where on the speech
spectrum of 0-4 KHz.
Several experiments have been conducted by the earlier workers by passing speech through various distortors like differentiators, integrators and infinite peak clippers and it is found that the intelligibility is retained to a very large extent in the distorted speech. The integrator and the differentiator remove essentially a certain portion of the spectrum. Therefore, it is thought that the intelligibility of the speech is spread over the entire speech spectrum and that, the intelligibility of speech may not be impaired even when it is bandpassed with a minimum bandwidth and the band may be located any where in the speech spectrum. To test this idea and establish this feature if it exists, preliminary
experiments have been conducted by passing the speech through different filters and it is found that the conjecture seems to be on the right line.
To carry out systematic experiments on this an
experimental set up has been designed and fabricated which consists of a microprocessor controlled speech recording, storing and speech playback system. Also, a personal computer
is coupled to the microprocessor system to enable the storage and processing of the data. Thirty persons drawn from different walks of life like teachers, mechanics and students have been involved for collecting the samples and for
recognition of the information of the processed speech. Even though the sentences like 'This is devices lab' are used to ascertain the effect of bandwidth on the intelligibility, for the purpose of analysis, vowels are used as the speech samples.
The experiments essentially consist of recording words and sentences spoken by the 30 participants and these recorded speech samples are passed through different filters with different bandwidths and central frequencies. The filtered output is played back to the various listeners and
observations regarding the intelligibility of the speech are noted. The listeners do not have any prior information about the content of the speech. It has been found that in almost
all (95%) cases, the messages or words are intelligible for most of the listeners when the band width of the filter is about 1 KHz and this is independent of the location of the pass band in the spectrum of 0-4 KHz. To understand how this feature of speech arises, spectrums of vowels spoken by 30 people have using FFT algorithms on the digitized samples of the speech.
It is felt that there is a cyclic behavior of the spectrum in all the samples. To make sure that the periodicity is present and also to arrive at the periodicity, a moving average procedure is employed to smoothen the spectrum. The smoothened spectrums of all the vowels indeed show a periodicity of about 1 KHz. When the periodicities are analysed the average value of the periodicities has been found to be 1038 Hz with a standard deviation of 19 Hz. In view of this it is thought that the acoustic source
responsible for speech must have generated this periodic spectrum, which might have been modified periodically to imprint the intelligibility. If this is true, one can perhaps easily understand this feature of the speech viz., the intelligibility is retained in a bandpassed speech of bandwidth 1 K H z . the pass band located any where in the speech spectrum of 0-4 KHz. This thesis describing the experiments and the analysis of the speech has been presented in 5 chapters. Chapter 1 deals with the basics of speech and the processing tools used to analyse the speech signal. Chapter 2 presents the literature survey from where the present problem is tracked down. Chapter 3 describes the details of the structure and the fabrication of the experimental setup that has been used. In chapter 4, the detailed account of the way in which the
experiments are conducted and the way in which the speech is analysed is given. In conclusion in chapter 5, the work is summarised and the future work needed to establish the mechanism of speech responsible for the feature of speech described in this thesis is suggested.
23
Henriksson, Jonas. "Implementation of a real-time Fast Fourier Transform on a Graphics Processing Unit with data streamed from a high-performance digitizer." Thesis, Linköpings universitet, Programvara och system, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-113389.
Full textAbstract:
In this thesis we evaluate the prospects of performing real-time digital signal processing on a graphics processing unit (GPU) when linked together with a high-performance digitizer. A graphics card is acquired and an implementation developed that address issues such as transportation of data and capability of coping with the throughput of the data stream. Furthermore, it consists of an algorithm for executing consecutive fast Fourier transforms on the digitized signal together with averaging and visualization of the output spectrum. An empirical approach has been used when researching different available options for streaming data. For better performance, an analysis of the introduced noise of using single-precision over double-precision has been performed to decide on the required precision in the context of this thesis. The choice of graphics card is based on an empirical investigation coupled with a measurement-based approach. An implementation in single-precision with streaming from the digitizer, by means of double buffering in CPU RAM, capable of speeds up to 3.0 GB/s is presented. Measurements indicate that even higher bandwidths are possible without overflowing the GPU. Tests show that the implementation is capable of computing the spectrum for transform sizes of
24
Bertaccini, Luca. "Design of a Cluster-Coupled Hardware Accelerator for FFT Computation." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/19806/.
Full textAbstract:
This thesis is related to the design of a hardware accelerator computing the Fast Fourier Transform (FFT) to be integrated into a PULP cluster. The project has been realized partly at the University of Bologna and partly at ETH Zurich.
PULP (Parallel Ultra Low Power) platform is a joint project between the Energy-efficient Embedded Systems (EEES) group of UNIBO and the Integrated Systems Laboratory (IIS) of ETH Zurich that started in 2013.
The FFT not only is used in data analytics but also represents a front-end for machine learning and neural networks application. The goal of this accelerator is to speed up these kinds of algorithms and to compute them in an ultra-low-power manner.
For the project described in this thesis, the radix-2 DIT (Decimation-in-Time) FFT has been implemented and the whole design has been realized in synthesizable SystemVerilog. Fixed-point arithmetic has been used within the computational part of the accelerator and the correct behavior of this unit has been evaluated making use of some MATLAB scripts. Since the accelerator has been conceived to be integrated into the PULP platform, it has been designed in compliance with the communication protocols implemented on such a board. The performance of the hardware accelerator has then been estimated in terms of area, timing, flexibility, and execution time. It has resulted to be seven times faster than a highly optimized software running FFT on 8 cores. In 22 nm technology, it occupies around 115000 µm² and it is characterized by a maximum clock frequency of 690MHz.
To avoid frequent conflicts accessing the external memory, a buffer has been internalized into the accelerator. Such a choice has led to shorter execution times but has increased considerably the overall area.
Finally, a way to remove the internal buffer has been studied and the features of this new possible design have been compared to the results obtained for the implemented version of the FFT hardware accelerator.
25
Xue, Liping. "Efficient mapping of fast Fourier transform on the Cyclops-64 multithreaded architecture." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 88 p, 2007. http://proquest.umi.com/pqdweb?did=1397913041&sid=16&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text
26
Shockey, Bruce. "FFT Bit Templating – A Technique for Making Amplitude and Frequency Measurements of a BPSK Modulated Signal." International Foundation for Telemetering, 2003. http://hdl.handle.net/10150/605361.
Full textAbstract:
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, NevadaIn many spacecraft receiver applications, the Fast Fourier Transform (FFT) provides a powerful tool for measuring the amplitude and frequency of an unmodulated RF signal. By increasing the FFT acquisition time, tiny signals can be coaxed from the noise and their frequency measured by determining which frequency bin the signal energy appears. The greater the acquisition time, the narrower the bin bandwidth and the more accurate the frequency measurement. In modern satellite operations it is often desirable for the receiver to measure the frequency of a carrier which is modulated with BPSK data. The presence of the BPSK data limits the FFT acquisition time since the signal may switch polarities a number of times while the FFT samples are being acquired. This polarity switching spreads the signal energy into multiple frequency bins making frequency measurement difficult or impossible. The Bit Templating Technique, used for the first time in the CMC Electronics Cincinnati TDRSS / BPSK Spacecraft Receiver, collects the modulated waveform energy back into a signal bin so that accurate amplitude and frequency information can be calculated.
27
Pippig, Michael. "Massively Parallel, Fast Fourier Transforms and Particle-Mesh Methods: Massiv parallele schnelle Fourier-Transformationen und Teilchen-Gitter-Methoden." Doctoral thesis, Universitätsverlag der Technischen Universität Chemnitz, 2015. https://monarch.qucosa.de/id/qucosa%3A20398.
Full textAbstract:
The present thesis provides a modularized view on the structure of fast numerical methods for computing Coulomb interactions between charged particles in three-dimensional space. Thereby, the common structure is given in terms of three self-contained algorithmic frameworks that are built on top of each other, namely fast Fourier transform (FFT), nonequispaced fast Fourier transform (NFFT) and NFFT based particle-mesh methods (P²NFFT). For each of these frameworks algorithmic enhancement and parallel implementations are presented with special emphasis on scalability up to hundreds of thousands of parallel processes.
In the context of FFT massively parallel algorithms are composed from hardware adaptive low level modules provided by the FFTW software library. The new algorithmic NFFT concepts include pruned NFFT, interlacing, analytic differentiation, and optimized deconvolution in Fourier space with respect to a mean square aliasing error. Enabled by these generalized concepts it is shown that NFFT provides a unified access to particle-mesh methods. Especially, mixed-periodic boundary conditions are handled in a consistent way and interlacing can be incorporated more efficiently. Heuristic approaches for parameter tuning are presented on the basis of thorough error estimates.Die vorliegende Dissertation beschreibt einen modularisierten Blick auf die Struktur schneller numerischer Methoden für die Berechnung der Coulomb-Wechselwirkungen zwischen Ladungen im dreidimensionalen Raum. Die gemeinsame Struktur ist geprägt durch drei selbstständige und auf einander aufbauenden Algorithmen, nämlich der schnellen Fourier-Transformation (FFT), der nicht äquidistanten schnellen Fourier-Transformation (NFFT) und der NFFT-basierten Teilchen-Gitter-Methode (P²NFFT). Für jeden dieser Algorithmen werden Verbesserungen und parallele Implementierungen vorgestellt mit besonderem Augenmerk auf massiv paralleler Skalierbarkeit. Im Kontext der FFT werden parallele Algorithmen aus den Hardware adaptiven Modulen der FFTW Softwarebibliothek zusammengesetzt. Die neuen NFFT-Konzepte beinhalten abgeschnittene NFFT, Versatz, analytische Differentiation und optimierte Entfaltung im Fourier-Raum bezüglich des mittleren quadratischen Aliasfehlers. Mit Hilfe dieser Verallgemeinerungen bietet die NFFT einen vereinheitlichten Zugang zu Teilchen-Gitter-Methoden. Insbesondere gemischt periodische Randbedingungen werden einheitlich behandelt und Versatz wird effizienter umgesetzt. Heuristiken für die Parameterwahl werden auf Basis sorgfältiger Fehlerabschätzungen angegeben.
28
Heiskanen, Andreas, and Erik Johansson. "Analysing Memory Performance when computing DFTs using FFTW." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-230225.
Full textAbstract:
Discrete Fourier Transforms (DFTs) are used in a wide variety of dif-ferent scientific areas. In addition, there is an ever increasing demand on fast and effective ways of computing DFT problems with large data sets. The FFTW library is one of the most common used libraries when computing DFTs. It adapts to the system architecture and predicts the most effective way of solving the input problem. Previous studies have proved the FFTW library to be superior to other DFT solving libraries. However, not many have specifically examined the cache memory performance, which is a key factor for overall performance. In this study, we examined the cache memory utilization when computing 1-D complex DFTs using the FFTW library. Testing was done using bench FFT, Linux Perf and testing scripts. The results from this study show that cache miss ratio increases with problem size when the input size is smaller than the theoretical input size matching the cache capacity. This is also verified by the results from the L2 prefetcher miss ratio. However, the study show that cache miss ratio stabilizes when exceeding the cache capacity. In conclusion, it is possible to use bench FFT and Linux Perf to measure cache memory utilization. Also, the analysis shows that cache memory performance is good when computing 1-D complex DFTS using the FFTW library, since the miss ratios stabilizes at low values. However, we suggest further examination ofthe memory behaviour for DFT computations using FFTW with larger input sizes and a more in-depth testing method.Diskret Fouriertransform (DFT) används inom många olika vetenskapliga områden. Det finns en ökande efterfrågan på snabba och effektiva sätt att beräkna DFT-problem med stora mängder data. FFTW-biblioteket är ett av de mest använda biblioteken vid beräkning av DFT-problem. FFTW-biblioteket anpassar sig till systemarkitekturen och försöker generera det mest effektiva sättet att lösa ett givet DFT-problem. Tidigare studier har visat att FFTW-biblioteket är effektivare än andra bibliotek som kan användas för att lösa DFT-problem. Däremot har studierna inte fokuserat på minneshanteringen, vilket är en nyckelfaktor för den generella prestandan. I den här studien undersökte vi FFTW-bibliotekets cache-minneshanteringen vid beräkning av 1-D komplexa DFT-problem. Tester utfördes med hjälp av bench FFT, Linux Perf och testskript. Resultaten från denna studie visar att cache-missförhållandet ökar med problemstorleken när problemstorleken ärmindre än den teoretiska problemstorleken som matchar cachekapaciteten. Detta bekräftas av resultat från L2-prefetcher-missförhållandet. Studien visar samtidigt att cache-missförhållandet stabiliseras när problemstorleken överskrider cachekapaciteten. Sammanfattningsvis går det att argumentera för att det är möjligt att använda bench FFT och Linux Perf för att mäta cache-minneshanteringen. Analysen visar också att cache-minneshanteringen är bra vid beräkning av 1-D komplexa DFTs med hjälp av FFTW-biblioteket eftersom missförhållandena stabiliseras vid låga värden. Vi föreslår dock ytterligare undersökning av minnesbeteendet för DFT-beräkningar med hjälp av FFTW där problemstorlekarna är större och en mer genomgående testmetod används.
29
Eloh, Komlavi Sényo. "FFT-based modelling of X-Ray Diffraction peaks : application to dislocation loops." Electronic Thesis or Diss., Université de Lorraine, 2020. http://www.theses.fr/2020LORR0097.
Full textAbstract:
Dans ce travail, nous proposons et testons une méthode numérique originale de simulation de diagrammes de diffraction des Rayons X par des monocristaux. Cette méthode repose sur l'utilisation d'algorithmes numériques de type Transformée de Fourier rapide (fast Fourier transform (FFT) en anglais) pour le calcul des champs mécaniques provenant de chargement extérieurs et/ou des défauts linéaires comme des boucles de dislocations. Ces défauts sont modélisés par des champs de déformation libres de contraintes (eigenstrains) dans une microstructure périodique soumise à des chargements thermomécaniques. Dans la première partie, nous présentons une approche améliorée du calcul des champs mécaniques par les algorithmes de types FFT qui permet d'obtenir les champs mécaniques locaux de manière précise et sans oscillation numérique aux discontinuités. Cette amélioration est due à l'utilisation d'un opérateur de Green discret consistent et périodique. Celui-ci est obtenu en résolvant l'équation de Lippmann-Schwinger dans l'espace de Fourier et en faisant une discrétisation spatiale appropriée. L'opérateur de Green modifié de degré quatre permet de calculer pour tous les voxels les valeurs du champ de déformations et de contraintes. Nous proposons aussi un opérateur de Green périodique d'ordre trois qui permet de calculer le champ de déplacement. Le champ de déplacement calculé est ensuite corrigé par une méthode de sous voxélisation qui supprime les artefacts apparaissant dans le cas des boucles de dislocations inclinées vis-à-vis de la grille de référence. Des exemples numériques sur des cas de références montrent l'effet des opérateurs de Green pour le calcul des champs mécaniques locaux sans oscillation et l'efficacité de la méthode de sous voxélisation. Le champ de déplacements final obtenu est la donnée d'entrée de la simulation de diagrammes de diffraction aux rayons X. La méthode de simulation des diagrammes de diffraction des Rayons X de monocristaux CFC est ensuite présentée. Le matériau diffractant est modélisé par un volume représentatif contenant des boucles de dislocations qui glissent dans des plans de types (111). Nous calculons l'amplitude puis l'intensité du faisceau diffracté au voisinage d'un nœud du réseau réciproque. La distribution 3D de l'intensité diffractée est ensuite traitée pour obtenir des diagrammes 2D et 1D qui seront analysés. Les premières simulations démontrent tout d'abord la suppression des artefacts sur les diagrammes de diffraction qui sont dus aux oscillations des champs mécaniques non corrigés. Les pics de diffraction sont analysés par différentes méthodes statistiques (transformée de Fourier de l'intensité, méthode des moments statistiques d'ordres supérieurs) qui permettent d'évaluer les paramètres de la distribution des dislocations (densité, facteur de polarisation, etc.) et de les comparer avec les valeurs théoriquesIn this work, we propose and test an original numerical method of simulation of X-ray diffraction peaks by single crystals. This method is based on the use of Fast Fourier Transform (FFT) algorithms for the calculation of mechanical fields resulting from external loading and / or linear defects such as dislocation loops. These defects are modeled by stress-free strain fields (eigenstrains) in a periodic microstructure subjected to thermomechanical loadings. In the first part, we present an improved approach by FFT-type algorithms which allows to accurately obtain the local mechanical fields without numerical oscillation at material's discontinuities. This improvement is due to the use of a discrete and periodic Green operator. This is obtained by solving the Lippmann-Schwinger equation in the Fourier space and using an appropriate spatial discretization. The fourth order modified Green operator allows to calculate the values of the strain and stress fields at all voxels. We also propose a third order periodic green operator to compute the displacement field. The computed displacement field is then corrected by a sub-voxelization method which removes the artifacts appearing in the case of dislocation loops inclined with respect to the reference grid. Numerical examples on reference cases show the effect of the Green operators for the calculation of local mechanical fields without oscillation and the efficiency of the sub-voxellization method. The final displacement field obtained is the input data of the simulation of X-ray diffraction patterns. The method of simulation of X-ray diffraction peaks of FCC (Face-Centered Cubic) single crystals is then presented. The diffracting material is modelled by a representative volume containing dislocation loops in (111) slip planes. We calculate the amplitude then the intensity of the diffracted beam near a node of the reciprocal lattice. This 3D distribution of the diffracted intensity is processed to obtain 1D diagrams that will be analyzed. The simulations demonstrate foremost the elimination of the artifacts on the diffraction diagrams which are due to the oscillations of the uncorrected mechanical fields. The diffraction peaks are analyzed by different statistical methods (Fourier transform of intensity, method of moments, etc.) which allow to evaluate the distribution parameters of dislocations (density, polarization factor, etc.) and compare them with their theoretical values
30
Dvořák, Vojtěch. "Implementace výpočtu FFT v obvodech FPGA a ASIC." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2013. http://www.nusl.cz/ntk/nusl-220087.
Full textAbstract:
The aim of this thesis is to design the implementation of fast Fourier transform algorithm, which can be used in FPGA or ASIC circuits. Implementation will be done in Matlab and then this form of implementation will be used as a reference model for implementation of fast Fourier transform algorithm in VHDL. To verify the correctness ofdesign verification enviroment will be created and verification process wil be done. Program that will generate source code for various parameters of the module performing a fast Fourier transform will be created in the last part of this thesis.
31
Gavrilovic, Nenad. "VIBRATION-BASED HEALTH MONITORING OF ROTATING SYSTEMS WITH GYROSCOPIC EFFECT." DigitalCommons@CalPoly, 2015. https://digitalcommons.calpoly.edu/theses/1358.
Full textAbstract:
This thesis focuses on the simulation of the gyroscopic effect using the software MSC Adams. A simple shaft-disk system was created and parameter of the sys-tem were changed in order to study the influence of the gyroscopic effect. It was shown that an increasing bearing stiffness reduces the precession motion. Fur-thermore, it was shown that the gyroscopic effect vanishes if the disk of system is placed symmetrically on the shaft, which reduces the system to a Jeffcott-Ro-tor. The second objective of this study was to analyze different defects in a simple fixed axis gear set. In particular, a cracked shaft, a cracked pinion and a chipped pinion as well as a healthy gear system were created and tested in Adams. The contact force between the two gears was monitored and the 2D and 3D frequency spectrum, as well as the Wavelet Transform, were plotted in order to compare the individual defects. It was shown that the Wavelet Transform is a powerful tool, capable of identifying a cracked gear with a non-constant speed. The last part of this study included fault detection with statistical methods as well as with the Sideband Energy Ratio (SER). The time domain signal of the individual faults were used to compare the mean, the standard deviation and the root mean square. Furthermore, the noise profile in the frequency spectrum was tracked with statistical methods using the mean and the standard deviation. It was demonstrated that it is possible to identify a cracked gear, as well as a chipped gear, with statistical methods. However, a cracked shaft could not be identified. The results also show that SER was only capable to identify major defects in a gear system such as a chipped tooth.
32
Sarathy, Vivek. "High Spurious-Free Dynamic Range Digital Wideband Receiver for Multiple Signal Detection and Tracking." Wright State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=wright1197910677.
Full text
33
Nepovím, Pavel. "Problematika zpracování signálů v reálném čase." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-218985.
Full textAbstract:
The aim of the master’s thesis is to acquaint the reader with Discrete Fourier Transform DFT and its introduction to spectral analysis descrete time signals. Furthermore it describes efficient computation of the DFT using the algorithm Fast Fourier Transform FFT and effects that appear in the DFT spectral analysis, the effect of the length of the DFT, the effect of the length of the segment of the analysed signal and the leakage. Next is explained the issue of the complex representation of real bandpass signals in the baseband, called the complex envelope of signals. This represenation uses the Hilbert Transform and the analytic signal. The thesis also describes the application library Real Time Toolbox of the software Matlab/Simulink, that uses the data acquition card AD622 allows to connect and process real signals in real time. In Matlab/Simulink with use this facilities is create the laboratory lesson, that simulating the complex represenation of real bandpass signals in real time.
34
Movin, Andreas, and Jonathan Jilg. "Kan datorer höra fåglar?" Thesis, KTH, Skolan för teknikvetenskap (SCI), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254800.
Full textAbstract:
Ljudigenkänning möjliggörs genom spektralanalys, som beräknas av den snabba fouriertransformen (FFT), och har under senare år nått stora genombrott i samband med ökningen av datorprestanda och artificiell intelligens. Tekniken är nu allmänt förekommande, i synnerhet inom bioakustik för identifiering av djurarter, en viktig del av miljöövervakning. Det är fortfarande ett växande vetenskapsområde och särskilt igenkänning av fågelsång som återstår som en svårlöst utmaning. Även de främsta algoritmer i området är långt ifrån felfria. I detta kandidatexamensarbete implementerades och utvärderades enkla algoritmer för att para ihop ljud med en ljuddatabas. En filtreringsmetod utvecklades för att urskilja de karaktäristiska frekvenserna vid fem tidsramar som utgjorde basen för jämförelsen och proceduren för ihopparning. Ljuden som användes var förinspelad fågelsång (koltrast, näktergal, kråka och fiskmås) så väl som egeninspelad mänsklig röst (4 unga svenska män). Våra resultat visar att framgångsgraden normalt är 50–70%, den lägsta var fiskmåsen med 30% för en liten databas och den högsta var koltrasten med 90% för en stor databas. Rösterna var svårare för algoritmen att särskilja, men de hade överlag framgångsgrader mellan 50% och 80%. Dock gav en ökning av databasstorleken generellt inte en ökning av framgångsgraden. Sammanfattningsvis visar detta kandidatexamensarbete konceptbeviset bakom fågelsångigenkänning och illustrerar såväl styrkorna som bristerna av dessa enkla algoritmer som har utvecklats. Algoritmerna gav högre framgångsgrad än slumpen (25%) men det finns ändå utrymme för förbättring eftersom algoritmen vilseleddes av ljud av samma frekvenser. Ytterligare studier behövs för att bedöma den utvecklade algoritmens förmåga att identifiera ännu fler fåglar och röster.Sound recognition is made possible through spectral analysis, computed by the fast Fourier transform (FFT), and has in recent years made major breakthroughs along with the rise of computational power and artificial intelligence. The technology is now used ubiquitously and in particular in the field of bioacoustics for identification of animal species, an important task for wildlife monitoring. It is still a growing field of science and especially the recognition of bird song which remains a hard-solved challenge. Even state-of-the-art algorithms are far from error-free. In this thesis, simple algorithms to match sounds to a sound database were implemented and assessed. A filtering method was developed to pick out characteristic frequencies at five time frames which were the basis for comparison and the matching procedure. The sounds used were pre-recorded bird songs (blackbird, nightingale, crow and seagull) as well as human voices (4 young Swedish males) that we recorded. Our findings show success rates typically at 50–70%, the lowest being the seagull of 30% for a small database and the highest being the blackbird at 90% for a large database. The voices were more difficult for the algorithms to distinguish, but they still had an overall success rate between 50% and 80%. Furthermore, increasing the database size did not improve success rates in general. In conclusion, this thesis shows the proof of concept and illustrates both the strengths as well as short-comings of the simple algorithms developed. The algorithms gave better success rates than pure chance of 25% but there is room for improvement since the algorithms were easily misled by sounds of the same frequencies. Further research will be needed to assess the devised algorithms' ability to identify even more birds and voices.
35
Fadel, Sayed M. "Pricing Basket of Credit Default Swaps and Collateralised Debt Obligation by Lévy Linearly Correlated, Stochastically Correlated, and Randomly Loaded Factor Copula Models and Evaluated by the Fast and Very Fast Fourier Transform." Thesis, University of Bradford, 2010. http://hdl.handle.net/10454/4902.
Full textAbstract:
In the last decade, a considerable growth has been added to the volume of the credit risk
derivatives market. This growth has been followed by the current financial market
turbulence. These two periods have outlined how significant and important are the
credit derivatives market and its products. Modelling-wise, this growth has parallelised
by more complicated and assembled credit derivatives products such as mth to default
Credit Default Swaps (CDS), m out of n (CDS) and collateralised debt obligation
(CDO).
In this thesis, the Lévy process has been proposed to generalise and overcome the Credit
Risk derivatives standard pricing model's limitations, i.e. Gaussian Factor Copula
Model. One of the most important drawbacks is that it has a lack of tail dependence or,
in other words, it needs more skewed correlation. However, by the Lévy Factor Copula
Model, the microscopic approach of exploring this factor copula models has been
developed and standardised to incorporate an endless number of distribution alternatives
those admits the Lévy process. Since the Lévy process could include a variety of
processes structural assumptions from pure jumps to continuous stochastic, then those
distributions who admit this process could represent asymmetry and fat tails as they
could characterise symmetry and normal tails. As a consequence they could capture
both high and low events¿ probabilities.
Subsequently, other techniques those could enhance the skewness of its correlation and
be incorporated within the Lévy Factor Copula Model has been proposed, i.e. the
'Stochastic Correlated Lévy Factor Copula Model' and 'Lévy Random Factor Loading
Copula Model'. Then the Lévy process has been applied through a number of proposed
Pricing Basket CDS&CDO by Lévy Factor Copula and its skewed versions and evaluated by V-FFT limiting and mixture cases of the Lévy Skew Alpha-Stable distribution and Generalized
Hyperbolic distribution.
Numerically, the characteristic functions of the mth to default CDS's and
(n/m) th to
default CDS's number of defaults, the CDO's cumulative loss, and loss given default
are evaluated by semi-explicit techniques, i.e. via the DFT's Fast form (FFT) and the
proposed Very Fast form (VFFT). This technique through its fast and very fast forms
reduce the computational complexity from O(N2) to, respectively, O(N log2 N ) and
O(N ).
36
Paditz, Ludwig. "Using ClassPad-technology in the education of students of electrical engineering (Fourier- and Laplace-Transformation)." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-80814.
Full textAbstract:
By the help of several examples the interactive work with the ClassPad330 is considered. The student can solve difficult exercises of practical applications step by step using the symbolic calculation and the graphic possibilities of the calculator. Sometimes several fields
of mathematics are combined to solve a problem. Let us consider the ClassPad330 (with the actual operating system OS 03.03) and discuss on some new exercises in analysis, e.g. solving a linear differential equation by the help of the Laplace transformation and using the inverse Laplace transformation or considering the Fourier transformation in discrete time (the Fast Fourier Transformation FFT and the inverse FFT). We use the FFT- and IFFT-function to study periodic signals, if we only have a sequence generated by sampling the time signal. We know several ways to get a solution. The techniques for studying practical applications fall into the following three categories: analytic, graphic and numeric. We can use the
Classpad software in the handheld or in the PC (ClassPad emulator version of the handheld).
37
Wu, Liming, and Kai Li. "Water Simulating in Computer Graphics." Thesis, Växjö University, School of Mathematics and Systems Engineering, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-1581.
Full textAbstract:
Fluid simulating is one of the most difficult problems in computer graphics. On the other hand, water appears in our life very frequently. This thesis focuses on water simulating. We have two main methods to do this in the thesis: the first is wave based water simulating; Sine wave summing based and Fast Fourier Transform based methods are all belong to this part. The other one is physics based water simulating. We make it based on Navier-Stokes Equation and it is the most realistic animation of water. It can deal with the boundary and spray which other method cannot express. Then we put our emphasis on implement by the physics method using Navier-Stokes Equation.
38
Paditz, Ludwig. "Using ClassPad-technology in the education of students of electricalengineering (Fourier- and Laplace-Transformation)." Proceedings of the tenth International Conference Models in Developing Mathematics Education. - Dresden : Hochschule für Technik und Wirtschaft, 2009. - S. 469 - 474, 2012. https://slub.qucosa.de/id/qucosa%3A1799.
Full textAbstract:
By the help of several examples the interactive work with the ClassPad330 is considered. The student can solve difficult exercises of practical applications step by step using the symbolic calculation and the graphic possibilities of the calculator. Sometimes several fields
of mathematics are combined to solve a problem. Let us consider the ClassPad330 (with the actual operating system OS 03.03) and discuss on some new exercises in analysis, e.g. solving a linear differential equation by the help of the Laplace transformation and using the inverse Laplace transformation or considering the Fourier transformation in discrete time (the Fast Fourier Transformation FFT and the inverse FFT). We use the FFT- and IFFT-function to study periodic signals, if we only have a sequence generated by sampling the time signal. We know several ways to get a solution. The techniques for studying practical applications fall into the following three categories: analytic, graphic and numeric. We can use the
Classpad software in the handheld or in the PC (ClassPad emulator version of the handheld).
39
Fadel, Sayed Mohammed. "Pricing basket of credit default swaps and collateralised debt obligation by Lévy linearly correlated, stochastically correlated, and randomly loaded factor copula models and evaluated by the fast and very fast Fourier transform." Thesis, University of Bradford, 2010. http://hdl.handle.net/10454/4902.
Full textAbstract:
In the last decade, a considerable growth has been added to the volume of the credit risk derivatives market. This growth has been followed by the current financial market turbulence. These two periods have outlined how significant and important are the credit derivatives market and its products. Modelling-wise, this growth has parallelised by more complicated and assembled credit derivatives products such as mth to default Credit Default Swaps (CDS), m out of n (CDS) and collateralised debt obligation (CDO). In this thesis, the Lévy process has been proposed to generalise and overcome the Credit Risk derivatives standard pricing model's limitations, i.e. Gaussian Factor Copula Model. One of the most important drawbacks is that it has a lack of tail dependence or, in other words, it needs more skewed correlation. However, by the Lévy Factor Copula Model, the microscopic approach of exploring this factor copula models has been developed and standardised to incorporate an endless number of distribution alternatives those admits the Lévy process. Since the Lévy process could include a variety of processes structural assumptions from pure jumps to continuous stochastic, then those distributions who admit this process could represent asymmetry and fat tails as they could characterise symmetry and normal tails. As a consequence they could capture both high and low events' probabilities. Subsequently, other techniques those could enhance the skewness of its correlation and be incorporated within the Lévy Factor Copula Model has been proposed, i.e. the 'Stochastic Correlated Lévy Factor Copula Model' and 'Lévy Random Factor Loading Copula Model'. Then the Lévy process has been applied through a number of proposed Pricing Basket CDS&CDO by Lévy Factor Copula and its skewed versions and evaluated by V-FFT limiting and mixture cases of the Lévy Skew Alpha-Stable distribution and Generalized Hyperbolic distribution. Numerically, the characteristic functions of the mth to default CDS's and (n/m) th to default CDS's number of defaults, the CDO's cumulative loss, and loss given default are evaluated by semi-explicit techniques, i.e. via the DFT's Fast form (FFT) and the proposed Very Fast form (VFFT). This technique through its fast and very fast forms reduce the computational complexity from O(N2) to, respectively, O(N log2 N ) and O(N ).
40
Broman, Simon, and André Franzén. "Analys av accelerometerdata för identifiering av träffpunkt och mätning av resulterande vibrationer i padelrack." Thesis, KTH, Hälsoinformatik och logistik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-296609.
Full textAbstract:
Syftet med att mäta vibrationer och rekyler i ett padelrack i detta arbete är att utveckla en prototyp som kan användas som träningsredskap för att minska risken för skador. En vanlig skada som drabbar padelspelare är tennisarmbåge, som enligt studier tros uppkomma genom upprepad exponering av mikrotrauman som vibrationer och rekyler. Genom att utföra en litteraturstudie i ämnet har systemkrav för ett sensorbaserat system definierats. Systemet som mäter vibrationer och rekyler har monterats i handtaget på padelracket. Två olika testmiljöer har utvecklats för att möjliggöra kontrollerade tester. För att identifiera och analysera slag använder systemet frekvensanalyser, korrelationstester och positionsförändring. Vid utveckling av metoden för identifiering av träffpunkt delades racket upp i fem olika zoner. Resultatet indikerar att träffar i två av zonerna ger upphov till mindre mängd vibrationer jämfört med de övriga zonerna. Resultatet för identifiering av träffzon varierar mellan testmiljöerna och enbart identifiering av en zon kan anses vara fungerande i båda fallen. Systemet identifierade träffzonen korrekt i 18 av 25 slag i den ena testmiljön och 9 av 25 i den andra. För att förbättra identifieringen av träffzon behövs flera analyser och korrelationtester utformas. En slutsats för det här examensarbetet är att det här arbetet kan användas som grund för vidare utveckling av ett sensorbaserat system för att identifiera träffzonen och kvantifiera vibrationer i ett padelrack.The purpose of measuring vibrations and recoils in a padel racket in this thesis is to develop a prototype that can be used as a training equipment to reduce the risk of injury. A common injury for padel players is tennis elbow, studies show that the cause of this injury are microtraumas from vibrations and recoils. Through a literature study in the subject, system demands for a sensor-based system have been defined. The system that has been used to measure vibrations and recoils have been attached to the bottom of the handle on the padel racket. To achieve controlled tests two different test environments have been developed. To identify and analyze impacts the system utilizes frequency analysis, correlation tests and displacement tracking. For identification of the impact area the racket was divided into five zones. The result indicates, that two of the impact zones generate less vibrations than the others. The result also shows that identification of impact zone varies between the test environments and that only the sweet spot can be identified in both cases. The system identified the impact zone correctly in 18 out of 25 strokes in one test environment and 9 out of 25 in the other. To further improve the methods for identification of the impact zone more analyses and correlations tests are required. One conclusion for this thesis is that it can be used as a platform for further development of a sensor-based system that can correctly identify impacts in all zones and quantify the resulting vibrations.
41
Barnhart, Samuel. "Design and Development of a Coherent Detection Rayleigh Doppler Lidar System for Use as an Alternative Velocimetry Technique in Wind Tunnels." University of Dayton / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1595276402371536.
Full text
42
Djaka, Komlan Sénam. "Développement et applications d’une technique de modélisation micromécanique de type "FFT" couplée à la mécanique des champs de dislocations." Thesis, Université de Lorraine, 2016. http://www.theses.fr/2016LORR0250/document.
Full textAbstract:
Dans ce mémoire, des méthodes spectrales basées sur la transformée de Fourier rapide ("fast Fourier transform" en anglais notée "FFT") sont développées pour résoudre les équations de champs et d’évolution des densités de dislocations polarisées ou géométriquement nécessaires dans la théorie de la mécanique des champs de dislocations ("Field Dislocations Mechanics" en anglais et notée "FDM") et de son extension phénoménologique et mésoscopique ("Phenomenological Mesoscopic Field Dislocations Mechanics" en anglais et notée "PMFDM"). Dans un premier temps, une approche spectrale a été développée pour résoudre les équations élasto-statiques de la FDM pour la détermination des champs mécaniques locaux provenant des densités de dislocations polarisées et des hétérogénéités élastiques présentes dans les matériaux de microstructure supposée périodique et au comportement élastique linéaire. Les champs élastiques sont calculés de façon précise et sans oscillation numérique même lorsque les densités de dislocations sont concentrées sur un seul pixel (pour les problèmes à deux dimensions) ou sur un seul voxel (pour les problèmes à trois dimensions). Ces résultats sont obtenus grâce à l’application de formules de différenciation spatiale pour les dérivées premières et secondes dans l’espace de Fourier basées sur des schémas à différences finies combinées à la transformée de Fourier discrète. Les résultats obtenus portent sur la détermination précise des champs élastiques des dislocations individuelles de types vis et coin, et des champs élastiques d’interaction entre des inclusions de géométries variées et différentes distributions de densités de dislocations telles que les dipôles ou les boucles de dislocations dans un matériau composite biphasé et des microstructures tridimensionnelles. Dans un second temps, une approche spectrale a été développée pour résoudre de façon rapide et stable l’équation d’évolution spatio-temporelle des densités de dislocations dans la théorie FDM. Cette équation aux dérivées partielles, de nature hyperbolique, requiert une méthode spectrale avec des filtres passe-bas afin de contrôler à la fois les fortes oscillations inhérentes aux approches FFT et les instabilités numériques liées à la nature hyperbolique de l’équation de transport. La validation de cette approche a été effectuée par des comparaisons avec les solutions exactes et les méthodes éléments finis dans le cadre de la simulation des phénomènes physiques d’annihilation ou d’extension/annihilation de boucles de dislocations. En dernier lieu, une technique numérique pour la résolution des équations de la PMFDM est développée dans le cadre d’une formulation FFT pour un comportement élasto-visco-plastique avec la prise en compte de la contribution des dislocations géométriquement nécessaires et statistiquement stockées ainsi que des conditions de saut de la distorsion plastique aux interfaces de type joint de grains ou joint de phases. Cette technique est par la suite appliquée à la simulation de la déformation plastique de structures modèles telles que des microstructures périodiques à canaux et des polycristaux métalliquesFast Fourier transform (FFT)-based methods are developed to solve both the elasto-static equations of the Field Dislocation Mechanics (FDM) theory and the dislocation density transport equation of polarized or geometrically necessary dislocation (GND) densities for FDM and its mesoscopic extension, i.e. the Phenomenological Mesoscopic Field Dislocations Mechanics (PMFDM). First, a numerical spectral approach is developed to solve the elasto-static FDM equations in periodic media for the determination of local mechanical fields arising from the presence of both polarized dislocation densities and elastic heterogeneities for linear elastic materials. The elastic fields are calculated in an accurate fashion and without numerical oscillation, even when the dislocation density is restricted to a single pixel (for two-dimensional problems) or a single voxel (for three-dimensional problems). These results are obtained by applying the differentiation rules for first and second derivatives based on finite difference schemes together with the discrete Fourier transform. The results show that the calculated elastic fields with the present spectral method are accurate for different cases considering individual screw and edge dislocations, the interactions between inhomogeneities of various geometries/elastic properties and different distributions of dislocation densities (dislocation dipoles, polygonal loops in two-phase composite materials). Second, a numerical spectral approach is developed to solve in a fast, stable and accurate fashion, the hyperbolic-type dislocation density transport equation governing the spatial-temporal evolution of dislocations in the FDM theory. Low-pass spectral filters are employed to control both the high frequency oscillations inherent to the Fourier method and the fast-growing numerical instabilities resulting from the hyperbolic nature of the equation. The method is assessed with numerical comparisons with exact solutions and finite element simulations in the case of the simulation of annihilation of dislocation dipoles and the expansion/annihilation of dislocation loops. Finally, a numerical technique for solving the PMFDM equations in a crystal plasticity elasto-viscoplastic FFT formulation is proposed by taking into account both the time evolutions of GND and SSD (statistically stored dislocations) densities as well as the jump condition for plastic distortion at material discontinuity interfaces such as grain or phase boundaries. Then, this numerical technique is applied to the simulation of the plastic deformation of model microstructures like channel-type two-phase composite materials and of polycrystalline metals
43
Homeili, Saeid. "Metrological characterisation of Low Power Voltage Transformers by using impulse response analysis." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20998/.
Full textAbstract:
this thesis presents a new approach in dealing with characterize LPVT and proposes determining the impulse response of LPVT, purposing to find transfer function (h(t)) which contains most electrical characteristics of LPVTs as a dynamic system.
44
Souza, José Isaac Menezes de. "Sistemas de transmissão multiportadoras baseados na transformada wavelet discreta." Universidade Federal do Amazonas, 2013. http://tede.ufam.edu.br/handle/tede/3293.
Full textAbstract:
Made available in DSpace on 2015-04-22T22:00:47Z (GMT). No. of bitstreams: 1
jose.pdf: 2255469 bytes, checksum: cebe37770c4719e5ebf2b60e4ae0d2a6 (MD5)
Previous issue date: 2013-06-07CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Currently, the majority of multicarrier transmission systems are based on the Fourier transform, which is used as frequency multiplexing technique. The main advantages of this approach include multipath immunity and low computational complexity, due to the use of a family of fast algorithms, known as Fast Fourier Transform (FFT). However, when used to provide a robust transmission, this technique presents some disadvantages, like the need for a cyclic prefix, which demands part of the useful datarate. In this work, a study for verifying the possibility of replacing the FFT, by the wavelet transform, was carried out, which has the potential to raise some advantages, such as the removal of the cyclic prefix and a simpler synchronization procedure. A computational model for the transmission layer of the Integrated Services Digital Broadcasting Terrestrial, Brazilian version (ISDB-Tb) was created, aiming to provide a direct comparison between two versions: the traditional one, which is based on FFT, and a new proposal, which is based on wavelets. Such an evaluation was performed through the relation between error bit rate and signal-to-noise ratio, in additive white gaussian noise, Rayleigh and Rician fading and also in frequency-selective Rayleigh fading channels. Similar comparisons were also performed for the ETSI TS 101 475 (HIPERLAN-2) and Digital Video Broadcasting Terrestrial (DVB-T) systems. The simulation results show that the wavelet-based systems present a similar performance, when compared with the FFT-based ones, for the chosen channel models, and without employing a cyclic prefix, which allows a more efficiente spectrum use.
Atualmente, uma grande parte dos sistemas de transmissão multiportadoras é baseada na transformada de Fourier, como técnica de multiplexação em frequência. Dentre as suas principais vantagens, encontram-se a imunidade a multipercursos e a baixa complexidade computacional, através de algoritmos rápidos conhecidos como Fast Fourier Transform (FFT). Esta técnica, entretanto, para proporcionar uma transmissão robusta, apresenta a desvantagem de exigir prefixo cíclico, o que resulta no consumo de uma fatia do espectro útil. Neste trabalho, um estudo para se verificar a viabilidade de substituição da FFT pela transformada wavelet foi realizado, o que promete trazer algumas vantagens, tais como a não exigência de prefixo cíclico e uma sincronização mais simples. Um modelo computacional para a camada de transmissão do Integrated Services Digital Broadcasting - Terrestrial, Brazilian version (ISDB-Tb) foi criado, com o objetivo de proporcionar uma comparação entre duas versões: a atual, baseada em FFT, e uma nova proposta, baseada em wavelets. Tal avaliação foi realizada em termos das curvas de taxa de erro de bit versus relação sinal ruído, em canais com adição de ruído gaussiano branco, com desvanecimento plano de Rayleigh e Rice e também com desvanecimento seletivo em frequência de Rayleigh. Comparações similares também foram realizadas para os sistemas ETSI TS 101 475 (HIPERLAN-2) e Digital Video Broadcasting Terrestrial (DVB-T). Os resultados obtidos mostram que os sistemas baseados em wavelets apresentam desempenhos similares aos dos baseados em FFT, para os modelos de canal simulados, com a vantagem adicional de não utilizarem prefixo cíclico, o que promove um uso mais eficiente do espectro.
45
Hrozek, Jan. "Elektroencefalografie a audiovizuální stimulace." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217214.
Full textAbstract:
This thesis deals with questions of scanning electric activity of brain,¬ so-called electroencephalograph (undermentioned EEG), methods of audiovisual stimulation (undermentioned AVS) and a data-measurement processing. Theoretical part of the thesis is engaged in a theory of EEG signal creation, history and even in current methods of purchasing and processing of the EEG signal, theory of AVS and a theory of biofeedback. For measuring EEG signal with or without an application of AVS methods has been used EEG diagnostic device by Alien company. Its attributes are described in the thesis as well. For elaboration and analysis has been created a programme aplication EEG_xhroze00.fig which realizes frequency spectrum analysis using Fast Fourier Transform algorithm (FFT) and another programme aplication brain_mapping.fig for mapping activity of brain using designed algorithm.
46
Li, Yu Miao. "Étude de la compensation du faux-rond dans un laminoir à froid." Nantes, 1987. http://www.theses.fr/1987NANT2002.
Full text
47
Nikl, Vojtěch. "Paralelizace ultrazvukových simulací pomocí 2D dekompozice." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-413351.
Full textAbstract:
This thesis is a part of the k-Wave project, which is a toolbox for the simulation and reconstruction of acoustic wave felds and one of its main contributions is the planning of focused ultrasound surgeries (HIFU). One simulation can take tens of hours and about 60% of the simulation time is taken by the calculation of the 3D Fast Fourier transforms. Up until now the 3D FFT has been calculated purely by the FFTW library and its 1D decomposition, whose major limitation is the maximum number of employable cores. Therefore we introduce a new approach, called the 2D hybrid decomposition of the 3D FFT (HybridFFT), where we combine both MPI processes and OpenMP threads to reach as best performance as possible. On a low number of cores, on the order of a few hundreds, we are about as fast or slightly faster than FFTW and pure MPI 2D decomposition libraries (PFFT and P3DFFT). One of the best results was achieved on a 512^3FFT using 512 cores, where our hybrid version run 31ms, FFTW run 39ms and PFFT run 44ms. The most significant performance advantage should be seen when employing around 8-16 thousand cores, however we haven't had an access to a machine with such resources. Almost a linear scalability has been proven for up to 2048 employed cores.
48
Madishetty, Suresh. "Design of Multi-Beam Hybrid Digital Beamforming Receivers." University of Akron / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=akron1545178805415923.
Full text
49
Volkmer, Toni. "Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling." Doctoral thesis, Universitätsbibliothek Chemnitz, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-222820.
Full textAbstract:
In this work, the fast evaluation and reconstruction of multivariate trigonometric polynomials with frequencies supported on arbitrary index sets of finite cardinality is considered, where rank-1 lattices are used as spatial discretizations. The approximation of multivariate smooth periodic functions by trigonometric polynomials is studied, based on a one-dimensional FFT applied to function samples. The smoothness of the functions is characterized via the decay of their Fourier coefficients, and various estimates for sampling errors are shown, complemented by numerical tests for up to 25 dimensions. In addition, the special case of perturbed rank-1 lattice nodes is considered, and a fast Taylor expansion based approximation method is developed. One main contribution is the transfer of the methods to the non-periodic case. Multivariate algebraic polynomials in Chebyshev form are used as ansatz functions and rank-1 Chebyshev lattices as spatial discretizations. This strategy allows for using fast algorithms based on a one-dimensional DCT. The smoothness of a function can be characterized via the decay of its Chebyshev coefficients. From this point of view, estimates for sampling errors are shown as well as numerical tests for up to 25 dimensions. A further main contribution is the development of a high-dimensional sparse FFT method based on rank-1 lattice sampling, which allows for determining unknown frequency locations belonging to the approximately largest Fourier or Chebyshev coefficients of a functionIn dieser Arbeit wird die schnelle Auswertung und Rekonstruktion multivariater trigonometrischer Polynome mit Frequenzen aus beliebigen Indexmengen endlicher Kardinalität betrachtet, wobei Rang-1-Gitter (rank-1 lattices) als Diskretisierung im Ortsbereich verwendet werden. Die Approximation multivariater glatter periodischer Funktionen durch trigonometrische Polynome wird untersucht, wobei Approximanten mittels einer eindimensionalen FFT (schnellen Fourier-Transformation) angewandt auf Funktionswerte ermittelt werden. Die Glattheit von Funktionen wird durch den Abfall ihrer Fourier-Koeffizienten charakterisiert und mehrere Abschätzungen für den Abtastfehler werden gezeigt, ergänzt durch numerische Tests für bis zu 25 Raumdimensionen. Zusätzlich wird der Spezialfall gestörter Rang-1-Gitter-Knoten betrachtet, und es wird eine schnelle Approximationsmethode basierend auf Taylorentwicklung vorgestellt. Ein wichtiger Beitrag dieser Arbeit ist die Übertragung der Methoden vom periodischen auf den nicht-periodischen Fall. Multivariate algebraische Polynome in Chebyshev-Form werden als Ansatzfunktionen verwendet und sogenannte Rang-1-Chebyshev-Gitter als Diskretisierungen im Ortsbereich. Diese Strategie ermöglicht die Verwendung schneller Algorithmen basierend auf einer eindimensionalen DCT (diskreten Kosinustransformation). Die Glattheit von Funktionen kann durch den Abfall ihrer Chebyshev-Koeffizienten charakterisiert werden. Unter diesem Gesichtspunkt werden Abschätzungen für Abtastfehler gezeigt sowie numerische Tests für bis zu 25 Raumdimensionen. Ein weiterer wichtiger Beitrag ist die Entwicklung einer Methode zur Berechnung einer hochdimensionalen dünnbesetzten FFT basierend auf Abtastwerten an Rang-1-Gittern, wobei diese Methode die Bestimmung unbekannter Frequenzen ermöglicht, welche zu den näherungsweise größten Fourier- oder Chebyshev-Koeffizienten einer Funktion gehören
50
Přívara, Jan. "Radarový signálový procesor v FPGA." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363780.
Full textAbstract:
This work describes design and implementation of radar processor in FPGA. The theoretical part is focused on Doppler radar, principles of radar signal processing methods and target platform Xilinx Zynq. The next part describes design of radar processor including its individual components and the solution is implemented. FPGA components are written in VHDL language. In the end, the implementation is evaluated and possible continuation of this work is stated.