Essays about: "Discrete Fourier Transform DFT"
Showing result 1 - 5 of 14 essays containing the words Discrete Fourier Transform DFT.
-
1. Approach for frequency response-calibration for microphone arrays
University essay from KTH/Hälsoinformatik och logistikAbstract : Matched frequency responses are a fundamental starting point for a variety ofimplementations for microphone arrays. In this report, two methods for frequencyresponse-calibration of a pre-assembled microphone array are presented andevaluated. READ MORE
-
2. Deep Learning Based Out-of-focus Detection on Surveillance Footage
University essay from Lunds universitet/Matematik LTHAbstract : Loss of focus in surveillance cameras can occur due to factors such as environmental aspects, sabotage or system errors. The focus loss leads to degraded footage that is of no use for either post-investigation or automatic video analysis. READ MORE
-
3. Automatic classification of cardiovascular age of healthy people by dynamical patterns of the heart rhythm
University essay from Linköpings universitet/Statistik och maskininlärningAbstract : .... READ MORE
-
4. Sparse Approximation of Spatial Channel Model with Dictionary Learning
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In large antenna systems, traditional channel estimation is costly and infeasible in some situations. Compressive sensing was proposed to estimate the channel with fewer measurements. Most of the previous work uses a predefined discrete Fourier transform matrix or overcomplete Fourier transform matrix to approximate the channel. READ MORE
-
5. 64-point FFT Instruction Implementation and Evaluation on a Microcode Programmable Processor
University essay from Linköpings universitet/Institutionen för systemteknik; Linköpings universitet/Tekniska fakultetenAbstract : Fast Fourier Transform is an efficient algorithm for computing the Discrete Fourier Transform (DFT) and one of the most important algorithms used in many digital signal processing applications over decades. This thesis presents an efficient implementation method of a 32-bit complex number 64-point FFT instruction on a micro-programmable processor. READ MORE