To see the other types of publications on this topic, follow the link: Discrete Fourier transform (DFT).
Dissertations / Theses on the topic 'Discrete Fourier transform (DFT)'
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 'Discrete Fourier transform (DFT).'
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
Sayyah, Jahromi Mohammad Reza Information Technology & Electrical Engineering Australian Defence Force Academy UNSW. "Efficient broadband antenna array processing using the discrete fourier form transform." Awarded by:University of New South Wales - Australian Defence Force Academy. School of Information Technology and Electrical Engineering, 2005. http://handle.unsw.edu.au/1959.4/38690.
Full textAbstract:
Processing of broadband signals induced on an antenna array using a tapped delay line filter and a set of steering delays has two problems. Firstly one needs to manipulate large matrices to estimate the filter coefficients. Secondly the use of steering delays is not only cumbersome but implementation errors cause loss of system performance. This thesis looks at both of these problems and presents elegant solutions by developing and studying a design method referred to as the DFT method, which does not require steering delays and is computationally less demanding compared to existing methods. Specifically the thesis studies and compares the performance of a time domain element space beamformer using the proposed method and that using an existing method, and develops the DFT method when the processor is implemented in partitioned form. The study presented in the thesis shows that the processors using the DFT method are robust to look direction errors and require less computation than that using the existing method for comparable performance. The thesis further introduces a broadband beamformer design which does not require any steering delays between the sensors and the tapped delay line section as is presently the case. It has the capability of steering the array in an arbitrary direction with a specified frequency response in the look direction while canceling unwanted uncorrelated interferences. The thesis presents and compares the performance of a number of techniques to synthesize an antenna pattern of a broadband array. These techniques are designed to produce isolated point nulls as well as broad sector nulls and to eliminate the need for the steering delays. Two of the pattern synthesis techniques presented in the thesis allow optimization against unwanted interferences in unknown directions. The techniques allow formulation of a beamforming problem such that the processor is not only able to place nulls in specified directions but also able to cancel directional interferences in unknown directions along with a specified frequency response in the look direction over a band of interest. The thesis also presents a set of directional constraints such that one does not need steering delays and an array can be constrained in an arbitrary direction with a specified frequency response. The constraints presented in the thesis are simple to implement. Based on these constraints a pattern synthesis technique for broadband antenna array is also presented.
2
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.
3
Miar, Yasin. "Improved Wideband Spectrum Sensing Methods for Cognitive Radio." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/23333.
Full textAbstract:
Abstract Cognitive Radio (CR) improves the efficiency of spectrum utilization by allowing non- licensed users to utilize bands when not occupied by licensed users. In this thesis, we address several challenges currently limiting the wide use of cognitive radios. These challenges include identification of unoccupied bands, energy consumption and other technical challenges. Improved accuracy edge detection techniques are developed for CR to mitigate both noise and estimation error variance effects. Next, a reduced complexity Simplified DFT (SDFT) is proposed for use in CR. Then, a sub-Nyquist rate A to D converter is introduced to reduce energy consumption. Finally, a novel multi-resolution PSD estimation based on expectation-maximization algorithm is introduced that can obtain a more accurate PSD within a specified sensing time.
4
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.
5
baktir, selcuk. "Frequency Domain Finite Field Arithmetic for Elliptic Curve Cryptography." Digital WPI, 2008. https://digitalcommons.wpi.edu/etd-dissertations/272.
Full textAbstract:
Efficient implementation of the number theoretic transform(NTT), also known as the discrete Fourier transform(DFT) over a finite field, has been studied actively for decades and found many applications in digital signal processing. In 1971 Schonhage and Strassen proposed an NTT based asymptotically fast multiplication method with the asymptotic complexity O(m log m log log m) for multiplication of $m$-bit integers or (m-1)st degree polynomials. Schonhage and Strassen's algorithm was known to be the asymptotically fastest multiplication algorithm until Furer improved upon it in 2007. However, unfortunately, both algorithms bear significant overhead due to the conversions between the time and frequency domains which makes them impractical for small operands, e.g. less than 1000 bits in length as used in many applications. With this work we investigate for the first time the practical application of the NTT, which found applications in digital signal processing, to finite field multiplication with an emphasis on elliptic curve cryptography(ECC). We present efficient parameters for practical application of NTT based finite field multiplication to ECC which requires key and operand sizes as short as 160 bits in length. With this work, for the first time, the use of NTT based finite field arithmetic is proposed for ECC and shown to be efficient. We introduce an efficient algorithm, named DFT modular multiplication, for computing Montgomery products of polynomials in the frequency domain which facilitates efficient multiplication in GF(p^m). Our algorithm performs the entire modular multiplication, including modular reduction, in the frequency domain, and thus eliminates costly back and forth conversions between the frequency and time domains. We show that, especially in computationally constrained platforms, multiplication of finite field elements may be achieved more efficiently in the frequency domain than in the time domain for operand sizes relevant to ECC. This work presents the first hardware implementation of a frequency domain multiplier suitable for ECC and the first hardware implementation of ECC in the frequency domain. We introduce a novel area/time efficient ECC processor architecture which performs all finite field arithmetic operations in the frequency domain utilizing DFT modular multiplication over a class of Optimal Extension Fields(OEF). The proposed architecture achieves extension field modular multiplication in the frequency domain with only a linear number of base field GF(p) multiplications in addition to a quadratic number of simpler operations such as addition and bitwise rotation. With its low area and high speed, the proposed architecture is well suited for ECC in small device environments such as smart cards and wireless sensor networks nodes. Finally, we propose an adaptation of the Itoh-Tsujii algorithm to the frequency domain which can achieve efficient inversion in a class of OEFs relevant to ECC. This is the first time a frequency domain finite field inversion algorithm is proposed for ECC and we believe our algorithm will be well suited for efficient constrained hardware implementations of ECC in affine coordinates.
6
Martins, Carlos Henrique Nascimento. "Estudo e implementação de um analisador de harmônicos variantes no tempo." Universidade Federal de Juiz de Fora (UFJF), 2015. https://repositorio.ufjf.br/jspui/handle/ufjf/4176.
Full textAbstract:
Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-04-25T17:30:25Z
No. of bitstreams: 1
carloshenriquenascimentomartins.pdf: 10221613 bytes, checksum: 0d6eef0f715fc0f9f68bf12a390dcd55 (MD5)Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-04-26T12:22:24Z (GMT) No. of bitstreams: 1 carloshenriquenascimentomartins.pdf: 10221613 bytes, checksum: 0d6eef0f715fc0f9f68bf12a390dcd55 (MD5)
Made available in DSpace on 2017-04-26T12:22:24Z (GMT). No. of bitstreams: 1 carloshenriquenascimentomartins.pdf: 10221613 bytes, checksum: 0d6eef0f715fc0f9f68bf12a390dcd55 (MD5) Previous issue date: 2015-03-26
CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Esta tese apresenta as etapas de desenvolvimento de um sistema de monitoramento de parâmentos de qualidade de energia dedicado a análise de harmônicos variantes no tempo através do equipamento denominado AHVT (Analisador de Harmônicos Variantes no Tempo). O desenvolvimento do trabalho é composto por: (i) estudo e implementação MATLAB de algoritmos para processamento em tempo real, com capacidade de sintonização dos componentes harmônicos; (ii) análise e desenvolvimento de estratégias para detecção e validação da presença de interharmônicos próximos à frequência fundamental e suas consequência na estimação de parâmetros como fase, amplitude e frequência para o componente fundamental, (iii) proposta de implementação do dispositivo, sistema de aquisição/ condicionamento de sinais/ filtragem, sistema de conversão analógico digital e plataforma de processamentoDSP/FPGA, sistema de transmissão de dados e plataformas de análise online/offline dos eventos de harmônicos variantes no tempo; (iv) plataforma de simulação do Analisador de Harmônicos Variantes no Tempo (AHVT) para estudo dos métodos de trigger para detecção e captura dos eventos.
In this work is presented the steps of development and implementation of a Power Quality paramaters monitoring system with main goal events denomined ”time arying harmonics”named of Time Varying Harmonic Analyzer. The development is comprises:(i) research and implementation of real time algorithms with capable to tuning harmonic waves,(ii) Analyze and research/development of strategies for detect and validation of interharmonics with frequencies near of fundamental, and conseguencies and challenges to phase, magnitude and frequency estimation with presence interharmonic waveform (iii) The proposal of a hardware design including analog to digital conversion and digital signal processing plataform, broadcast data link and IHM(Interface Human Machine) for online and offline analyzes to time varying harmonic analyzer;(iiii)off-line simulation plataform of Analisador de Harmônicos Variantes no Tempo Time Varying Harmonic Analyzer (TVHA) to trigger detect methods to detection and capture of waveforms.
7
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
8
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
9
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.
10
Yu, Sungwook. "VLSI implementation of multidimensional discrete Fourier transform and discrete cosine transform /." Digital version accessible at:, 2000. http://wwwlib.umi.com/cr/utexas/main.
Full text
11
Goodall, A. J. "Graph polynomials and the discrete Fourier transform." Thesis, University of Oxford, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.401064.
Full text
12
Yao, Xueyang. "The Discrete 2D Fourier Transform In Polar Coordinates." Thesis, Université d'Ottawa / University of Ottawa, 2018. http://hdl.handle.net/10393/37656.
Full textAbstract:
The discrete Fourier transform in Cartesian coordinates has proved to be invaluable in many disciplines. However, less theory has been developed for functions that are best described in polar coordinates. In this thesis, a new discrete 2D-Fourier transform in polar coordinates is proposed and tested by numerical simulations. Guidelines for choosing sample size are developed. Furthermore, to be as useful as its Cartesian counterpart, improvements are made to reduce the computing time.
13
Tussing, Timothy Mark. "Analysis of Effects on Sound Using the Discrete Fourier Transform." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1338371732.
Full text
14
Dodd, Matthew Warren. "Application of the discrete Fourier transform in information theory and cryptology." Thesis, Royal Holloway, University of London, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.406757.
Full text
15
Tavakkolnia, Iman. "Advanced optical fibre communication via nonlinear Fourier transform." Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/29606.
Full textAbstract:
Optical fibre communication using the Nonlinear Fourier transform (NFT) is one of the potential solutions to tackle the so-called capacity crunch problem in long-haul optical fibre networks. The NFT transforms the nonlinear propagation of temporal signal, governed by the nonlinear Schr ̈odinger equation (NLSE), into simple linear evolutions of continuous and discrete spectra in the so-called nonlinear spectral domain. These spectra and the corresponding nonlinear spectral domain, defined by the NFT, are the generalized counterparts of the linear spectrum and frequency domain defined by the ordinary Fourier transform. Using the NFT, the optical fibre channel is effectively linearised, and the basic idea is to utilize degrees of freedom in the nonlinear spectral domain for data transmission. However, many aspects of this concept require rigorous investigation due to complexity and infancy of the approach. In this thesis, the aim is to provide a comprehensive investigation of data transmission over mainly the continues spectrum (CS) and partly over of the discrete spectrum (DS) of nonlinear optical fibres. First, an optical fibre communication system is defined, in which solely the CS carries the information. A noise model in the nonlinear spectral domain is derived for such a system by asymptotic analysis as well as extensive simulations for different scenarios of practical interest. It is demonstrated that the noise added to the signal in CS is severely signal-dependent such that the effective signalling space is limited. The variance normalizing transform (VNT) is used to mathematically verify the limits of signalling spaces and also estimate the channel capacity. The numerical results predict a remarkable capacity for signalling only on the CS (e.g., 6 bits/symbol for a 2000-km link), yet it is demonstrated that the capacity saturates at high power. Next, the broadening effect of chromatic dispersion is analysed, and it is confirmed that some system parameters, such as symbol rate in the nonlinear spectral domain, can be optimized so that the required temporal guard interval between the subsequently transmitted data packets is minimized, and thus the effective data rate is significantly enhanced. Furthermore, three modified signalling techniques are proposed and analysed based on the particular statistics of the noise added to the CS. All proposed methods display improved performance in terms of error rate and reach distance. For instance, using one of the proposed techniques and optimized parameters, a 7100-km distance can be reached by signalling on the CS at a rate of 9.6 Gbps. Furthermore, the impact of polarization mode dispersion (PMD) is examined for the first time, as an inevitable impairment in long-haul optical fibre links. By semi-analytical and numerical investigation, it is demonstrated that the PMD affects the CS by causing signal-dependent phase shift and noise-like errors. It is also verified that the noise is still the dominant cause of performance degradation, yet the effect of PMD should not be neglected in the analysis of NFT-based systems. Finally, the capacity of soliton communication with amplitude modulation (part of the degrees of freedom of DS) is also estimated using VNT. For the first time, the practical constraints, such as the restricted signalling space due to limited bandwidth, are included in this capacity analysis. Furthermore, the achievable data rates are estimated by considering an appropriately defined guard time between soliton pulses. Moreover, the possibility of transmitting data on DS accompanied by an independent CS signalling is also validated, which confirms the potentials of the NFT approach for combating the capacity crunch.
16
Beraldin, Jean-Angelo. "VLSI systolic array architecture for the computation of the discrete fourier transform." Thesis, University of Ottawa (Canada), 1986. http://hdl.handle.net/10393/5042.
Full text
17
Suh, Sangwook. "Low-power discrete Fourier transform and soft-decision Viterbi decoder for OFDM receivers." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42716.
Full textAbstract:
The purpose of this research is to present a low-power wireless communication receiver with an enhanced performance by relieving the system complexity and performance degradation imposed by a quantization process. With an overwhelming demand for more reliable communication systems, the complexity required for modern communication systems has been increased accordingly. A byproduct of this increase in complexity is a commensurate increase in power consumption of the systems. Since the Shannon's era, the main stream of the methodologies for promising the high reliability of communication systems has been based on the principle that the information signals flowing through the system are represented in digits. Consequently, the system itself has been heavily driven to be implemented with digital circuits, which is generally beneficial over analog implementations when digitally stored information is locally accessible, such as in memory systems. However, in communication systems, a receiver does not have a direct access to the originally transmitted information. Since the received signals from a noisy channel are already continuous values with continuous probability distributions, we suggest a mixed-signal system in which the received continuous signals are directly fed into the analog demodulator and the subsequent soft-decision Viterbi decoder without any quantization involved. In this way, we claim that redundant system complexity caused by the quantization process is eliminated, thus gives better power efficiency in wireless communication systems, especially for battery-powered mobile devices. This is also beneficial from a performance perspective, as it takes full advantage of the soft information flowing through the system.
18
Khurram, Alia. "Reconstruction Of A Univariate Discrete Function From The Magnitude Of Its Fourier Transform." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1879010741&sid=3&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Full textAbstract:
Thesis (Ph. D.)--Southern Illinois University Carbondale, 2009."Department of Mathematics." Keywords: Univariate discrete function, Fourier transforms, Convergence rate. Includes bibliographical references (p. 45). Also available online.
19
Gu, Siying. "VLSI systolic array architectures for the one-dimensional and two-dimensional discrete Fourier transform." Thesis, University of Ottawa (Canada), 1993. http://hdl.handle.net/10393/6711.
Full textAbstract:
In this thesis, we propose efficient systolic array architectures for the 1-D and the 2-D discrete Fourier transforms (DFT) using the second-order Goertzel algorithm. For the 1-D DFT, two 1-D and one 2D systolic arrays are proposed. The two 1-D structures, a semi-systolic array and a pure-systolic array, are characterized by regular, modular cell interconnections, thus making the arrays compatible with VLSI design principles. These arrays perform at an effective throughput rate of one DFT sample per clock cycle. The proposed 2-D array structure obtains a higher throughput rate of one DFT transform per clock cycle. As for the 2-D DFT, a 2-D systolic array architecture is developed which does not require a row-column transposition while some delay units are needed between the two stages. All the above proposed systolic arrays can process continuous flow of input data and perform at 100% efficiency. These structures are compared to other DFT systolic arrays regarding complexity and real-time implementation. (Abstract shortened by UMI.)
20
Janpugdee, Panuwat. "An Efficient Discrete Fourier Transform Based Ray Analysis of Large Finite Planar Phased Arrays." The Ohio State University, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=osu1392817276.
Full text
21
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.
22
Thomson, Darren, Gilles Hennenfent, Henryk Modzelewski, and Felix J. Herrmann. "A parallel windowed fast discrete curvelet transform applied to seismic processing." Society of Exploration Geophysicists, 2006. http://hdl.handle.net/2429/544.
Full textAbstract:
We propose using overlapping, tapered windows to process seismic data in parallel. This method consists of numerically tight linear operators and adjoints that are suitable for use in iterative algorithms. This method is also highly scalable and makes parallel processing of large seismic data sets feasible. We use this scheme to define the Parallel Windowed Fast Discrete Curvelet Transform (PWFDCT), which we apply to a seismic data interpolation algorithm. The successful performance of our parallel processing scheme and algorithm on a two-dimensional synthetic data is shown.
23
Kornfeil, Vojtěch. "Soubor úloh pro kurs Sběr, analýza a zpracování dat." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217707.
Full textAbstract:
This thesis proposes tasks of exercises for mentioned course and design and creation of automated evaluation system for these exercises. This thesis focuses on discussion and exemplary solutions of possible tasks of each exercise and description of created automated evaluation system. For evaluation program are made tests with chosen special data sets, which will prove it’s functionality in general data sets.
24
Lund, Darren Scott. "Fourier Decompositions of Graphs with Symmetries and Equitable Partitions." BYU ScholarsArchive, 2021. https://scholarsarchive.byu.edu/etd/8925.
Full textAbstract:
We show that equitable partitions, which are generalizations of graph symmetries, and Fourier transforms are fundamentally related. For a partition of a graph's vertices we define a Fourier similarity transform of the graph's adjacency matrix built from the matrices used to carryout discrete Fourier transformations. We show that the matrix (graph) decomposes into a number of smaller matrices (graphs) under this transformation if and only if the partition is an equitable partition. To extend this result to directed graphs we define two new types of equitable partitions, equitable receiving and equitable transmitting partitions, and show that if a partition of a directed graph is both, then the graph's adjacency matrix will similarly decomposes under this transformation. Since the transformation we use is a similarity transform the collective eigenvalues of the resulting matrices (graphs) is the same as the eigenvalues of the original untransformed matrix (graph).
25
Young, David J. "The generation of correlated Rayleigh random variates by discrete Fourier transform and quality measures for random variate generation." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq22432.pdf.
Full text
26
Bleiler, Sarah K. "Orthogonal filters and the implications of wrapping on discrete wavelet transforms." [Tampa, Fla] : University of South Florida, 2008. http://purl.fcla.edu/usf/dc/et/SFE0002676.
Full text
27
Čišecký, Roman. "Metody pro odstranění šumu z digitálních obrazů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219769.
Full textAbstract:
The master's thesis is concerned with digital image denoising methods. The theoretical part explains some elementary terms related to image processing, image noise, categorization of noise and quality determining criteria of denoising process. There are also particular denoising methods described, mentioning their advantages and disadvantages in this paper. The practical part deals with an implementation of the selected denoising methods in a Java, in the environment of application RapidMiner. In conclusion, the results obtained by different methods are compared.
28
Akhtar, Mahmood Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "Genomic sequence processing: gene finding in eukaryotes." Publisher:University of New South Wales. Electrical Engineering & Telecommunications, 2008. http://handle.unsw.edu.au/1959.4/40912.
Full textAbstract:
Of the many existing eukaryotic gene finding software programs, none are able to guarantee accurate identification of genomic protein coding regions and other biological signals central to pathway from DNA to the protein. Eukaryotic gene finding is difficult mainly due to noncontiguous and non-continuous nature of genes. Existing approaches are heavily dependent on the compositional statistics of the sequences they learn from and are not equally suitable for all types of sequences. This thesis firstly develops efficient digital signal processing-based methods for the identification of genomic protein coding regions, and then combines the optimum signal processing-based non-data-driven technique with an existing data-driven statistical method in a novel system demonstrating improved identification of acceptor splice sites. Most existing well-known DNA symbolic-to-numeric representations map the DNA information into three or four numerical sequences, potentially increasing the computational requirement of the sequence analyzer. Proposed mapping schemes, to be used for signal processing-based gene and exon prediction, incorporate DNA structural properties in the representation, in addition to reducing complexity in subsequent processing. A detailed comparison of all DNA representations, in terms of computational complexity and relative accuracy for the gene and exon prediction problem, reveals the newly proposed ?paired numeric? to be the best DNA representation. Existing signal processing-based techniques rely mostly on the period-3 behaviour of exons to obtain one dimensional gene and exon prediction features, and are not well equipped to capture the complementary properties of exonic / intronic regions and deal with the background noise in detection of exons at their nucleotide levels. These issues have been addressed in this thesis, by proposing six one-dimensional and three multi-dimensional signal processing-based gene and exon prediction features. All one-dimensional and multi-dimensional features have been evaluated using standard datasets such as Burset/Guigo1996, HMR195, and the GENSCAN test set. This is the first time that different gene and exon prediction features have been compared using substantial databases and using nucleotide-level metrics. Furthermore, the first investigation of the suitability of different window sizes for period-3 exon detection is performed. Finally, the optimum signal processing-based gene and exon prediction scheme from our evaluations is combined with a data-driven statistical technique for the recognition of acceptor splice sites. The proposed DSP-statistical hybrid is shown to achieve 43% reduction in false positives over WWAM, as used in GENSCAN.
29
Kämmerer, Lutz. "High Dimensional Fast Fourier Transform Based on Rank-1 Lattice Sampling." Doctoral thesis, Universitätsbibliothek Chemnitz, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-157673.
Full textAbstract:
We consider multivariate trigonometric polynomials with frequencies supported on a fixed but arbitrary frequency index set I, which is a finite set of integer vectors of length d. Naturally, one is interested in spatial
discretizations in the d-dimensional torus such that
- the sampling values of the trigonometric polynomial at the nodes of this spatial discretization uniquely determines the trigonometric polynomial,
- the corresponding discrete Fourier transform is fast realizable, and
- the corresponding fast Fourier transform is stable.
An algorithm that computes the discrete Fourier transform and that needs a computational complexity that is bounded from above by terms that are linear in the maximum of the number of input and output data up to some logarithmic factors is called fast Fourier transform. We call the fast Fourier transform stable if the Fourier matrix of the discrete Fourier transform has a condition number near one and the fast algorithm does not corrupt this theoretical stability.
We suggest to use rank-1 lattices and a generalization as spatial discretizations in order to sample multivariate trigonometric polynomials and we develop construction methods in order to determine reconstructing sampling sets, i.e., sets of sampling nodes that allow for the unique, fast, and stable reconstruction of trigonometric polynomials. The methods for determining reconstructing rank-1 lattices are component{by{component constructions, similar to the seminal methods that are developed in the field of numerical integration. During this thesis we identify a component{by{component construction of reconstructing rank-1 lattices that allows for an estimate of the number of sampling nodes M
|I|\le M\le \max\left(\frac{2}{3}|I|^2,\max\{3\|\mathbf{k}\|_\infty\colon\mathbf{k}\in I\}\right)
that is sufficient in order to uniquely reconstruct each multivariate trigonometric polynomial with frequencies supported on the frequency index set I. We observe that the bounds on the number M only depends on the number of frequency indices contained in I and the expansion of I, but not on the spatial dimension d. Hence, rank-1 lattices are suitable spatial discretizations in arbitrarily high dimensional problems.
Furthermore, we consider a generalization of the concept of rank-1 lattices, which we call generated sets. We use a quite different approach in order to determine suitable reconstructing generated sets. The corresponding construction method is based on a continuous optimization method.
Besides the theoretical considerations, we focus on the practicability of the presented algorithms and illustrate the theoretical findings by means of several examples.
In addition, we investigate the approximation properties of the considered sampling schemes. We apply the results to the most important structures of frequency indices in higher dimensions, so-called hyperbolic crosses and demonstrate the approximation properties by the means of several examples that include the solution of Poisson's equation as one representative of partial differential equations.
30
Kämmerer, Lutz. "High Dimensional Fast Fourier Transform Based on Rank-1 Lattice Sampling." Doctoral thesis, Universitätsverlag der Technischen Universität Chemnitz, 2014. https://monarch.qucosa.de/id/qucosa%3A20167.
Full textAbstract:
We consider multivariate trigonometric polynomials with frequencies supported on a fixed but arbitrary frequency index set I, which is a finite set of integer vectors of length d. Naturally, one is interested in spatial
discretizations in the d-dimensional torus such that
- the sampling values of the trigonometric polynomial at the nodes of this spatial discretization uniquely determines the trigonometric polynomial,
- the corresponding discrete Fourier transform is fast realizable, and
- the corresponding fast Fourier transform is stable.
An algorithm that computes the discrete Fourier transform and that needs a computational complexity that is bounded from above by terms that are linear in the maximum of the number of input and output data up to some logarithmic factors is called fast Fourier transform. We call the fast Fourier transform stable if the Fourier matrix of the discrete Fourier transform has a condition number near one and the fast algorithm does not corrupt this theoretical stability.
We suggest to use rank-1 lattices and a generalization as spatial discretizations in order to sample multivariate trigonometric polynomials and we develop construction methods in order to determine reconstructing sampling sets, i.e., sets of sampling nodes that allow for the unique, fast, and stable reconstruction of trigonometric polynomials. The methods for determining reconstructing rank-1 lattices are component{by{component constructions, similar to the seminal methods that are developed in the field of numerical integration. During this thesis we identify a component{by{component construction of reconstructing rank-1 lattices that allows for an estimate of the number of sampling nodes M
|I|\le M\le \max\left(\frac{2}{3}|I|^2,\max\{3\|\mathbf{k}\|_\infty\colon\mathbf{k}\in I\}\right)
that is sufficient in order to uniquely reconstruct each multivariate trigonometric polynomial with frequencies supported on the frequency index set I. We observe that the bounds on the number M only depends on the number of frequency indices contained in I and the expansion of I, but not on the spatial dimension d. Hence, rank-1 lattices are suitable spatial discretizations in arbitrarily high dimensional problems.
Furthermore, we consider a generalization of the concept of rank-1 lattices, which we call generated sets. We use a quite different approach in order to determine suitable reconstructing generated sets. The corresponding construction method is based on a continuous optimization method.
Besides the theoretical considerations, we focus on the practicability of the presented algorithms and illustrate the theoretical findings by means of several examples.
In addition, we investigate the approximation properties of the considered sampling schemes. We apply the results to the most important structures of frequency indices in higher dimensions, so-called hyperbolic crosses and demonstrate the approximation properties by the means of several examples that include the solution of Poisson's equation as one representative of partial differential equations.
31
Wu, Ji-Dein. "Orthogonally multiplexed communication using CCSK and wavelet bases." Ohio : Ohio University, 1995. http://www.ohiolink.edu/etd/view.cgi?ohiou1178818993.
Full text
32
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.
33
Helienek, Matúš. "Simulační a experimentální analýza řezání kotoučovou pilou." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2018. http://www.nusl.cz/ntk/nusl-412924.
Full textAbstract:
This thesis deals with analysis of dynamic forces and vibrations created during cutting with saw. The analysis is done on both simulation and experimental level. Acquired signals are evaluated with signal tools as STFT, CWT and DWT.
34
Algarhi, Amr Saber Ibrahim. "Essays on long memory time series and fractional cointegration." Thesis, University of Exeter, 2013. http://hdl.handle.net/10871/13791.
Full textAbstract:
The dissertation considers an indirect approach for the estimation of the cointegrating parameters, in the sense that the estimators are jointly constructed along with estimating other nuisance parameters. This approach was proposed by Robinson (2008) where a bivariate local Whittle estimator was developed to jointly estimate a cointegrating parameter along with the memory parameters and the phase parameters (discussed in chapter 2). The main contributions of this dissertation is to establish, similar to Robinson (2008), a joint estimation of the memory, cointegrating and phase parameters in stationary and nonstationary fractionally cointegrated models in a multivariate framework. In order to accomplish such task, a general shape of the spectral density matrix, first noted in Davidson and Hashimzade (2008), is utilised to cover multivariate jointly dependent stationary long memory time series allowing more than one cointegrating relation (discussed in chapter 3). Consequently, the notion of the extended discrete Fourier transform is adopted based on the work of Phillips (1999) to allow for the multivariate estimation to cover the non stationary region (explained in chapter 4). Overall, the estimation methods adopted in this dissertation follows the semiparametric approach, in that the spectral density is only specified in a neighbourhood of zero frequency. The dissertation is organised in four self-contained chapters that are connected to each other, in additional to this introductory chapter: • Chapter 1 discusses the univariate long memory time series analysis covering different definitions, models and estimation methods. Consequently, parametric and semiparametric estimation methods were applied to a univariate series of the daily Egyptian stock returns to examine the presence of long memory properties. The results show strong and significant evidence of long memory in the Egyptian stock market which refutes the hypothesis of market efficiency. • Chapter 2 expands the analysis in the first chapter using a bivariate framework first introduced by Robinson (2008) for long memory time series in stationary system. The bivariate model presents four unknown parameters, including two memory parameters, a phase parameter and a cointegration parameter, which are jointly estimated. The estimation analysis is applied to a bivariate framework includes the US and Canada inflation rates where a linear combination between the US and Canada inflation rates that has a long memory less than the two individual series has been detected. • Chapter 3 introduces a semiparametric local Whittle (LW) estimator for a general multivariate stationary fractional cointegration using a general shape of the spectral density matrix first introduced by Davidson and Hashimzade (2008). The proposed estimator is used to jointly estimate the memory parameters along with the cointegrating and phase parameters. The consistency and asymptotic normality of the proposed estimator is proved. In addition, a Monte Carlo study is conducted to examine the performance of the new proposed estimator for different sample sizes. The multivariate local whittle estimation analysis is applied to three different relevant examples to examine the presence of fractional cointegration relationships. • In the first three chapters, the estimation procedures focused on the stationary case where the memory parameter is between zero and half. On the other hand, the analysis in chapter 4, which is a natural progress to that in chapter 3, adjusts the estimation procedures in order to cover the non-stationary values of the memory parameters. Chapter 4 expands the analysis in chapter 3 using the extended discrete Fourier transform and periodogram to extend the local Whittle estimation to non stationary multivariate systems. As a result, the new extended local Whittle (XLW) estimator can be applied throughout the stationary and non stationary zones. The XLW estimator is identical to the LW estimator in the stationary region, introduced in chapter 3. Application to a trivariate series of US money aggregates is employed.
35
Zhong, Shiyin. "Electricity Load Modeling in Frequency Domain." Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/75109.
Full textAbstract:
In today's highly competitive and deregulated electricity market, companies in the generation, transmission and distribution sectors can all benefit from collecting, analyzing and deep-understanding their customers' load profiles. This strategic information is vital in load forecasting, demand-side management planning and long-term resource and capital planning.
With the proliferation of Advanced Metering Infrastructure (AMI) in recent years, the amount of load profile data collected by utilities has grown exponentially. Such high-resolution datasets are difficult to model and analyze due to the large size, diverse usage patterns, and the embedded noisy or erroneous data points. In order to overcome these challenges and to make the load data useful in system analysis, this dissertation introduces a frequency domain load profile modeling framework. This framework can be used a complementary technology alongside of the conventional time domain load profile modeling techniques.
There are three main components in this framework: 1) the frequency domain load profile descriptor, which is a compact, modular and extendable representation of the original load profile. A methodology was introduced to demonstrate the construction of the frequency domain load profile descriptor. 2) The load profile Characteristic Attributes in the Frequency Domain (CAFD). Which is developed for load profile characterization and classification. 3) The frequency domain load profile statistics and forecasting models. Two different models were introduced in this dissertation: the first one is the wavelet load forecast model and the other one is a stochastic model that incorporates local weather condition and frequency domain load profile statistics to perform medium term load profile forecast.
7 different utilities load profile data were used in this research to demonstrate the viability of modeling load in the frequency domain. The data comes from various customer classes and geographical regions. The results have shown that the proposed framework is capable to model the load efficiently and accurately.Ph. D.
36
Das, Nivedita. "Modeling three-dimensional shape of sand grains using Discrete Element Method." [Tampa, Fla.] : University of South Florida, 2007. http://purl.fcla.edu/usf/dc/et/SFE0002072.
Full text
37
Farias, Filho Antonio Pereira de. "A Transformada Discreta de Fourier no círculo finito ℤ/nℤ." Universidade Federal da Paraíba, 2016. http://tede.biblioteca.ufpb.br:8080/handle/tede/9429.
Full textAbstract:
Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-09-05T12:56:54Z
No. of bitstreams: 1
arquivototal.pdf: 2044930 bytes, checksum: 05bad0799c40d5bf256cf504f0a8b5ab (MD5)Approved for entry into archive by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-09-05T15:29:04Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 2044930 bytes, checksum: 05bad0799c40d5bf256cf504f0a8b5ab (MD5)
Made available in DSpace on 2017-09-05T15:29:04Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 2044930 bytes, checksum: 05bad0799c40d5bf256cf504f0a8b5ab (MD5) Previous issue date: 2016-08-26
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
We will do here a theoretical study of the Discrete Fourier Transform on the finite circle ℤ/nℤ. Our main objective is to see if we can get properties analogous to those found in the Fourier transform for the continuous case. In this work we show that ℤ/nℤ has a ring structure, providing conditions for the development of extensively discussed topics in arithmetic, for example, The Chinese Remainder Theorem, Euler’s Phi Function and primitive roots, themes these to be dealt with in first chapter. The main subject of this study is developed in the second chapter, which define the space L2(ℤ/nℤ) and prove that this is a finite-dimensional inner product vector space, with an orthonormal basis. This fact is of utmost importance when we are determining the matrix and demonstrating the properties of the discrete Fourier transform. We will also make geometric interpretations of the Chinese Remainder Theorem and the finite circle ℤ/nℤ as well as give a graphical representation of the DFT of some functions that calculate. During the development of this study we will make recurrent use of definitions and results treated in Arithmetic, Algebra and Linear Algebra.
Faremos, aqui, um estudo teórico sobre a Transformada Discreta de Fourier no círculo finito ℤ/nℤ. Nosso principal objetivo é verificar se podemos obter propriedades análogas às encontradas nas transformadas de Fourier para o caso contínuo. Nesse trabalho mostraremos que ℤ/nℤ tem uma estrutura de anel, dando condições para o desenvolvimento de temas bastante discutidos na Aritmética como, por exemplo, o Teorema Chinês do Resto, função Phi de Euler e raízes primitivas, temas estes que serão tratados no primeiro capítulo. O assunto principal desse estudo é desenvolvido no segundo capítulo, onde definiremos o espaço L2(ℤ/nℤ) e provaremos que este é um espaço vetorial com produto interno, dimensão finita e uma base ortonormal. Tal fato será de extrema importância quando estivermos determinando a matriz e demonstrando as propriedades da transformada discreta de Fourier. Também faremos interpretações geométricas do Teorema Chinês do Resto e do círculo finito ℤ/nℤ assim como daremos a representação gráfica da DFT de algumas funções que calcularemos. Durante o desenvolvimento desse estudo faremos uso recorrente de definições e resultados tratados na Aritmética, Álgebra e Álgebra Linear.
38
Rodesten, Stephan. "Program för frekvensanalys." Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-58157.
Full textAbstract:
Denna rapport täcker arbetsprocessen bakom att skapa en spektrumanalysator. Läsaren kommer att få läsa om den valda metoden men även alternativa metoder. Utöver detta kommer även de teoretiska delarna bakom varje moment att undersökas samt jämföras med potentiella alternativa lösningar. Projektet har utförts på uppdrag av KA Automation. Syftet med projektet var att skapa en basplattform för analys av ljudfrekvenser. Målet med detta var att kunna identifiera ljudegenskaper i form av frekvenserna hos exempelvis servomotorer i vattenpumpar. Tanken var att i ett senare utvecklingsskede kunna identifiera om och när nya frekvenser dykt upp i ljudprofilen vilket i sådana fall kan resultera i att motorn är i behov av service. Basplattformen är uppbyggd med hjälp av C# och ljudbehandlingsbiblioteket NAudio. Från resultatet kan slutsatsen dras att detta program kan analysera ljud och visa de olika frekvensernas styrka och därmed är en lämplig basplattform för vidareutveckling.This report will cover the work process behind creating a spectrum analyzer. The reader will be able to read about the chosen method but also the alternative methods. Apart from this the theoretical parts behind every moment will also be covered and compared to potential alternative solutions. The project has been carried out on behalf of KA Automation. The purpose of the project was to create a base for analyzing sound frequencies. The goal was to be able to identify sound properties in the form of frequencies in servo motors in for example water pumps. The idea was to be able to in a later development stage be able to identify when new frequencies have entered the audio profile which might result in the motor to be in need of service. The base is created with the help of C# and the sound library NAudio. From the result one can conclude that this program can analyze sound and display the magnitude of its frequency components and is therefore a suitable base for future development.
39
Zhang, Yingchen. "New Methods for Synchrophasor Measurement." Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/77297.
Full textAbstract:
Recent developments in smart grid technology have spawned interest in the use of phasor measurement units to help create a reliable power system transmission and distribution infrastructure. Wide-area monitoring systems (WAMSs) utilizing synchrophasor measurements can help with understanding, forecasting, or even controlling the status of power grid stability in real-time. A power system Frequency Monitoring Network (FNET) was first proposed in 2001 and was established in 2004. As a pioneering WAMS, it serves the entire North American power grid through advanced situational awareness techniques, such as real-time event alerts, accurate event location estimation, animated event visualization, and post event analysis.
Traditionally, Phasor Measurement Units (PMUs) have utilized signals obtained from current transformers (CTs) to compute current phasors. Unfortunately, this requires that CTs must be directly connected with buses, transformers or power lines. Chapters 2, 3 will introduce an innovative phasor measurement instrument, the Non-contact Frequency Disturbance Recorder (NFDR), which uses the magnetic and electric fields generated by power transmission lines to obtain current phasor measurements.
The NFDR is developed on the same hardware platform as the Frequency Disturbance Recorder (FDR), which is actually a single phase PMU. Prototype testing of the NFDR in both the laboratory and the field environments were performed. Testing results show that measurement accuracy of the NFDR satisfies the requirements for power system dynamics observation.
Researchers have been developing various techniques in power system phasor measurement and frequency estimation, due to their importance in reflecting system health. Each method has its own pros and cons regarding accuracy and speed. The DFT (Discrete Fourier Transform) based algorithm that is adopted by the FDR device is particularly suitable for tracking system dynamic changes and is immune to harmonic distortions, but it has not proven to be very robust when the input signal is polluted by random noise. Chapter 4 will discuss the Least Mean Squares-based methods for power system frequency tracking, compared with a DFT-based algorithm.
Wide-area monitoring systems based on real time PMU measurements can provide great visibility to the angle instability conditions. Chapter 5 focuses on developing an early warning algorithm on the FNET platform.Ph. D.
40
Lopez, Paola Johana Saboya. "Uma contribuição ao problema de detecção de ruídos impulsivos para power line communication." Universidade Federal de Juiz de Fora (UFJF), 2013. https://repositorio.ufjf.br/jspui/handle/ufjf/4155.
Full textAbstract:
Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-04-24T15:28:35Z
No. of bitstreams: 1
paolajohanasaboyalopez.pdf: 1042873 bytes, checksum: a46dd95de00e062cba39ef4b9b642462 (MD5)Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-04-24T17:09:24Z (GMT) No. of bitstreams: 1 paolajohanasaboyalopez.pdf: 1042873 bytes, checksum: a46dd95de00e062cba39ef4b9b642462 (MD5)
Made available in DSpace on 2017-04-24T17:09:24Z (GMT). No. of bitstreams: 1 paolajohanasaboyalopez.pdf: 1042873 bytes, checksum: a46dd95de00e062cba39ef4b9b642462 (MD5) Previous issue date: 2013-06-03
A presente dissertação tem por objetivo propor e avaliar cinco técnicas de detecção de ruídos impulsivos para a melhoria da transmissão digital de dados via redes de energia elétrica (do inglês, Power Line Communications) (PLC). As técnicas propostas contemplam a detecção de ruídos impulsivos no domínio do tempo discreto, no domínio da transformada wavelet discreta (do inglês, Discrete Wavelet Transform) (DWT) e no domínio da transformada discreta de Fourier (do inglês, Discrete Fourier Transform) (DFT). Tais técnicas fazem uso de métodos de extração e seleção de características, assim como métodos de detecção de sinais baseados na teoria de Bayes e redes neurais. Análises comparativas explicitam as vantagens e desvantagens de cada uma das técnicas propostas para o problema em questão, e ainda indicam que estas são bastante adequadas para a solução do mesmo.
This dissertation aims to propose and evaluate five techniques for impulsive noise detection in order to improve digital communications through power line channels. The imput signals for the proposed detection techniques are impulsive noise signals on discrete-time domain, on the Discrete Wavelet Transform domain and on the Discrete Fourier Transform domain and it makes use of feature extraction and selection techniques, as well as detection techniques supported on Bayes Theory and Multi-layer Perceptron Neural Networks. Comparative analysis show some advantages and disadvantages of each proposed technique and the relevance of them to solve the impulsive noise detection problem.
41
Hanna, Gautier. "Blocs des chiffres des nombres premiers." Thesis, Université de Lorraine, 2016. http://www.theses.fr/2016LORR0162/document.
Full textAbstract:
Au cours de cette thèse nous nous intéressons à des orthogonalités asymptotiques (au sens ou le produit scalaire dans le tore discret de taille N tend vers 0 lorsque N tend vers l’infini) entre certaines fonctions liées aux blocs des chiffres des entiers et la fonction de Möbius (ainsi qu’avec la fonction de von Mangoldt). Ces travaux prolongent ceux de Mauduit et Rivat et répondent partiellement à une question de Kalai posée en 2012. Au cours du Chapitre 1 nous établissons ces estimations asymptotiques dans le cas où la fonction étudiée est une fonction exponentielle d’une fonction qui compte les blocs de chiffres consécutifs ou espacés de taille k fixé dans l’écriture de n en base q. Nous donnons aussi une grande classe de polynômes agissant sur les blocs de chiffres qui nous fournissent un théorème des nombres premiers et une orthogonalité asymptotique avec la fonction de Möbius. Dans le Chapitre 2, nous obtenons un principe d’aléa de Möbius avec dans le cas où notre fonction est une fonction exponentielle d’une fonction qui compte les blocs de ‘1’ consécutifs dans l’écriture de n en base 2, où la taille du bloc est une application croissante tendant vers l’infini, mais avec une certaine restriction de croissance. Dans le cas extrémal, que nous ne pouvons pas traiter, ce problème est lié à l’estimation du nombre de nombres premiers dans la suite des nombres de Mersenne. Dans le Chapitre 3, nous donnons des estimations dans le cas où la fonction est l’exponentielle d’une fonction qui compte les blocs de k ‘1’ dans l’écriture de n en base 2 où k est grand par rapport à log N. Une conséquence du Chapitre 3 est que les résultats du Chapitre 1 sont quasi optimauxThroughout this thesis, we are interested in asymptotic orthogonality (in the sense that the scale product of the discrete torus of length N tends to zero as N tend to infinity) between some functions related to the blocks of digits of integers and the Möbius function (and also the von Mangoldt function). Our work extends previous results of Mauduit and Rivat, and gives a partial answer to a question posed by Kalai in 2012. Chapter 1 provides estimates in the case of the function is the exponential of a function taking values on the blocks (with and without wildcards) of length k (k fixed) in the digital expansion of n in base q. We also give a large class of polynomials acting on the digital blocks that allow to get a prime number theorem and asymptotic orthogonality with the Möbius function. In Chapter 2, we get an asymptotic formula in the case of our function is the exponential of the function which counts blocks of consecutive ‘1’s in the expansion of n in base 2, where the length of the block is an increasing function that tends (slowly) to infinity. In the extremal case, which we cannot handle, this problem is connected to estimating the number of primes in the sequences of Mersenne numbers. In Chapter 3, we provides estimates on the case of the function is the exponential of a function which count the blocks of k ‘1’s in the expansion of n in base 2 where k is large with respect to log N. A consequence of Chapter 3 is that the results of Chapter 1 are quasi-optimal
42
Matos, Élito dos Reis [UNESP]. "Um método para detecção e classificação de curtos-circuitos em redes de distribuição de energia elétrica baseado na transformada de Fourier e em redes neurais artificiais." Universidade Estadual Paulista (UNESP), 2009. http://hdl.handle.net/11449/87050.
Full textAbstract:
Made available in DSpace on 2014-06-11T19:22:31Z (GMT). No. of bitstreams: 0
Previous issue date: 2009-08-28Bitstream added on 2014-06-13T18:08:26Z : No. of bitstreams: 1
matos_er_me_ilha.pdf: 2466056 bytes, checksum: fd089ec7147abd26c94fadfe5e17bb85 (MD5)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Neste trabalho apresenta-se uma Metodologia para Detecção e Classificação de Curtos-Circuitos em alimentadores de Sistemas de Distribuição de Energia Elétrica fundamentada na análise de registros oscilográficos através da DFT (Discrete Fourier Transform) e de RNAs (Redes Neurais Artificiais). Sua aplicação pressupõe a disponibilidade de registros de oscilografia digital das correntes nas três fases do alimentador, monitoradas apenas na saída da subestação. A caracterização de cada tipo de curto-circuito é obtida mediante a análise do comportamento dinâmico das correntes de fase durante o período transitório das faltas e a detecção e classificação dos curtos-circuitos são efetuadas por meio de um banco de RNAs acíclicas, do tipo perceptrons, de múltiplas camadas. Um modelo de um alimentador real de Sistema de Distribuição de grande porte, composto por 836 barras, foi utilizado na obtenção dos dados referentes aos curtos-circuitos, com simulações via software ATP-EMTP (Alternative Transients Program - Electromagnetic Transients Program). O método foi implementado e testado utilizando-se o software MATLAB®. Como resultado tem-se uma metodologia de formulação simples que apresenta bom desempenho, é de fácil implementação, apresenta baixa carga computacional e gera resultados altamente satisfatórios
This work proposes a methodology for Detection and Classification of Short-Circuits in Distribution Electric Power feeders, based on the analysis of oscillograph records through the application of DFT (Discrete Fourier Transform) and ANNs (Artificial Neural Networks). Its application requires the availability of digital oscillograph records of the currents in the three phases of the feeder, only monitored at the output of the substation. The characterization of each type of short-circuit is obtained by means of analysis of the dynamic behavior of the phase currents during the transitory period. The detection and classification of short-circuits is performed by a bank of acyclic ANNs, of type multilayers perceptrons. A real feeder model of a large distribution power system, composed of 836 buses, was used to obtain data relating to short-circuits, simulated via ATP-EMTP (Alternative Transients Program - Electromagnetic Transients Program) software. The method was implemented and tested using MATLAB®. As a conclusion, the proposed method is simple to be implemented, presents low computational load and generates good results
43
Weatherwax, Scott Eric. "Use of the continuous wavelet tranform to enhance early diagnosis of incipient faults in rotating element bearings." [College Station, Tex. : Texas A&M University, 2008. http://hdl.handle.net/1969.1/ETD-TAMU-3013.
Full text
44
Surma, Dariusz. "Rekurencyjne metody ślizgającej analizy Wienera-Chinczyna." Rozprawa doktorska, [Nakł.aut.], 2013. http://dlibra.utp.edu.pl/Content/602.
Full textAbstract:
Rozprawa poświęcona jest rozwojowi algorytmów analizy korelacyjnej, które wykorzystuje się w ślizgającej analizie Wienera-Chinczyna. Opracowano rekurencyjne algorytmy, które pozwalają na redukcję operacji matematycznych podczas obliczania estymat funkcji korelacji.
45
Parapayalage, Chandana Dinesh Kumara. "BUILDING EXTRACTION IN HAZARDOUS AREAS USING EXTENDED MORPHOLOGICAL OPERATORS WITH HIGH RESOLUTION OPTICAL IMAGERY." 京都大学 (Kyoto University), 2014. http://hdl.handle.net/2433/193579.
Full text
46
Ruivo, Eurico Luiz Prospero. "Análise espectral dos autômatos celulares elementares." Universidade Presbiteriana Mackenzie, 2012. http://tede.mackenzie.br/jspui/handle/tede/1422.
Full textAbstract:
Made available in DSpace on 2016-03-15T19:37:42Z (GMT). No. of bitstreams: 1
Eurico Luiz Prospero Ruivo.pdf: 15234351 bytes, checksum: 5a581041d50f5cbd30ccc684b8112487 (MD5)
Previous issue date: 2012-12-11Universidade Presbiteriana Mackenzie
The Fourier spectra of cellular automata rules give a characterisation of the limit configurations generated by them at the end of their time evolution. In the present work, the Fourier spectra of each rule of the elementary cellular automata rule space are computed, under periodic and non-periodic boundary conditions, and the space is then partitioned according to the similarity among these computed spectra, what gives the notion of spectral classes in such space. For the partition obtained under periodic boundary condition, each spectral class is analysed in terms of the behaviour of each of its rules and how this behaviour affects the correspondent spectrum. Finally, the spectral classes are related in terms of the similarity among them, for both boundary conditions, what results in graphs depicting the proximity among the spectral classes.
Os espectros de Fourier de regras de autômatos celulares fornecem uma caracterização da configuração limite gerada por elas ao fim de suas evoluções temporais. Neste trabalho, são calculados os espectros de Fourier de todas as regras do espaço dos autômatos celulares elementares, sob condições de contorno periódica e não-periódicas, e o espaço é então particionado de acordo com a similaridade entre os espectros calculados, dando origem à noção de classes espectrais no espaço em questão. Para a participação gerada sob condição de contorno periódica, cada classe espectral é analisada de acordo com o comportamento de cada regra e a implicação deste no espectro obtido. A seguir é analisada a relação de similaridade entre as classes espectrais geradas em cada tipo de condição de contorno, o que d´a origem a grafos representando a proximidade entre as classes espectrais.
47
Chung, Ming-Shen, and 鐘明聲. "FPGA Implementation of the Discrete Fourier Transform (DFT) and the Discrete Cosine Transform (DCT)." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/01456280849939764692.
Full textAbstract:
碩士國立高雄第一科技大學
電腦與通訊工程所
90
The Discrete Fourier Transform（DFT）has been widely applied in communcation, speech processing, image processing, radar and sonar systems, etc. The architecture of DFT implement can be classified into two fields：（1）one is a pipelined systolic architecture,（2）the other is a memory-based architecture. Discrete Cosine Transform（DCT）has been commonly adopted in the various atandardsfor image compression while FPGA has become a new trend of ASIC design, so we will apply FPGA techinque to implement the DFT and the DCT. This thesis deals with how to use FPGA techinque to implement： （1）the pipelined systolic array architecture that requires log2N complex multipliers, 2log2N complex adders, 2log2N multiplexers, N delay elements and is able to provide a throughput of one transform sample per clock cycle; （2）the memory-based architecture that consists of three two-port RAM’s, one ROM, one complex multiplier, two complex adders, one multiplexer, and has capability of computing one transform sample every log2N+1 clock cycles on average; （3）Improved architecture in（2）under increasing little hardware that spends half of run time, i.e.N(log2N)/2; （4）2D-DFT that use architecture in（2）of 1D-DFT; （5）DCT operation and 2D-DCT operation.
48
Zaeim, Ramin. "Direction of arrival estimation technique for narrow-band signals based on spatial Discrete Fourier Transform." Thesis, 2018. https://dspace.library.uvic.ca//handle/1828/9948.
Full textAbstract:
This work deals with the further development of a method for Direction of Arrival (DOA) estimation based on the Discrete Fourier Transform (DFT) of the sensor array output. In the existing DFT-based algorithm, relatively high SNR is considered, and it is assumed that a large number of sensors are available.
In this study an overview of some of the most commonly used DOA estimation techniques will be presented. Then the performance of the DFT method will be analyzed and compared with the performance of existing techniques. Two main objectives will be studied, firstly the reduction of the number of sensors and secondly the performance of the DFT based technique in the presence of noise.
Experimental simulations will be presented to illustrate that in absence of noise, the proposed method is very fast and using just one snapshot is sufficient to accurately estimate DOAs. Also, in presence of noise, the method is still relatively fast and using a small number of snapshots, it can accurately estimate DOAs.
The above mentioned properties are the result of taking an average of the peaks of the DFTs, X_n (k), obtained from a sequence of N_s snapshots. With N_s sufficiently large, the average over N_s snapshots approaches expected value. Also, the conditions that should be satisfied to avoid overlapping of main-lobes, and thus loosing the DOA of some signals, in the DFT spectrum are examined.
This study further analyzes the performance of the proposed method as well as two other commonly used algorithms, MUSIC and conventional beamformer. An extensive simulation was conducted and different features of the spatial DFT technique, such as accuracy, resolution, sensitivity to noise, effect of multiple snapshots and the number of sensors were evaluated and compared with those of existing techniques. The simulations indicate that in most aspects the proposed spatial DFT algorithm outperforms the other techniques.Graduate
49
Suresh, K. "MDCT Domain Enhancements For Audio Processing." Thesis, 2010. http://etd.iisc.ernet.in/handle/2005/1184.
Full textAbstract:
Modified discrete cosine transform (MDCT) derived from DCT IV has emerged as the most suitable choice for transform domain audio coding applications due to its time domain alias cancellation property and de-correlation capability. In the present research work, we focus on MDCT domain analysis of audio signals for compression and other applications. We have derived algorithms for linear filtering in DCT IV and DST IV domains for symmetric and non-symmetric filter impulse responses. These results are also extended to MDCT and MDST domains which have the special property of time domain alias cancellation. We also derive filtering algorithms for the DCT II and DCT III domains. Comparison with other methods in the literature shows that, the new algorithm developed is computationally MAC efficient. These results are useful for MDCT domain audio processing such as reverb synthesis, without having to reconstruct the time domain signal and then perform the necessary filtering operations.
In audio coding, the psychoacoustic model plays a crucial role and is used to estimate the masking thresholds for adaptive bit-allocation. Transparent quality audio coding is possible if the quantization noise is kept below the masking threshold for each frame. In the existing methods, the masking threshold is calculated using the DFT of the signal frame separately for MDCT domain adaptive quantization. We have extended the spectral integration based psychoacoustic model proposed for sinusoidal modeling of audio signals to the MDCT domain. This has been possible because of the detailed analysis of the relation between DFT and MDCT; we interpret the MDCT coefficients as co-sinusoids and then apply the sinusoidal masking model. The validity of the masking threshold so derived is verified through listening tests as well as objective measures.
Parametric coding techniques are used for low bit rate encoding of multi-channel audio such as 5.1 format surround audio. In these techniques, the surround channels are synthesized at the receiver using the analysis parameters of the parametric model. We develop algorithms for MDCT domain analysis and synthesis of reverberation. Integrating these ideas, a parametric audio coder is developed in the MDCT domain. For the parameter estimation, we use a novel analysis by synthesis scheme in the MDCT domain which results in better modeling of the spatial audio. The resulting parametric stereo coder is able to synthesize acceptable quality stereo audio from the mono audio channel and a side information of approximately 11 kbps. Further, an experimental audio coder is developed in the MDCT domain incorporating the new psychoacoustic model and the parametric model.
50
Bittens, Sina Vanessa. "Sparse Fast Trigonometric Transforms." Doctoral thesis, 2019. http://hdl.handle.net/21.11130/00-1735-0000-0003-C16D-9.
Full text