Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 320 for “"Discrete Fourier Transform"”.
-
An Introduction to the Winograd Discrete Fourier Transform
… illustrates Winograd's approach to computing the Discrete Fourier Transform (DFT). This new approach changes the DFT into a cyclic convolution of 2 sequences, and illustrates shortcuts for computing this cyclic convolution. This method is known to reduce the number of multiplies required to about …
-
PAPR reduction in OFDM communications with generalized discrete Fourier transform
The main advantage of Generalized Discrete Fourier Transform (GDFT) is its ability to design a wide selection of constant modulus orthogonal code sets, based on the desired performance metrics mimicking the engineering specs of interest. One of the main drawbacks of Orthogonal Frequency Division …
-
Digital Image Processing by the Two-Dimensional Discrete Fourier Transform Method
Master of Science (M.S.)
-
Generalized discrete Fourier transform with non-linear phase : theory and design
Constant modulus transforms like discrete Fourier transform (DFT), Walsh transform, and Gold codes have been successfully used over several decades in various engineering applications, including discrete multi-tone (DMT), orthogonal frequency division multiplexing (OFDM) and code division multiple …
-
Discrete Fourier Transform Techniques to Improve Diagnosis Accuracy in Biomedical Applications
Transforming acquired data in time or space is necessary for many applications, due to practical constraints on time-domain sampling at high data rates or the requirement for algorithms to process frequency-domain data during the image reconstruction procedure. Therefore, the discrete Fourier …
-
Low-power discrete Fourier transform and soft-decision Viterbi decoder for OFDM receivers
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 …
-
VLSI systolic array architectures for the one-dimensional and two-dimensional discrete Fourier transform.
… 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, …
-
Direction of arrival estimation technique for narrow-band signals based on spatial Discrete Fourier Transform
… 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 …
-
A Test for Stationarity Using a Local Average of the Autocovariance of the Discrete Fourier Transform
The discrete Fourier transform of a second-order stationary process has been found to be asymptotically uncorrelated, a property which can be leveraged to create a test statistic for stationary. Building off this, we propose a version of the test where the test statistic is created by taking the …
-
Applications of Multiplicative Complexity Theory to Convolution and the Discrete Fourier Transform (Fast, Computational, Digital Filtering, Signal Processing, Algorithms)
… cyclic convolution, the one-dimensional discrete Fourier transform (DFT), and convolutions and DFTs with input constraints or output restrictions. The multiplicative complexity of multidimensional cyclic convolution is determined for any possible combination of lengths in any number of …
-
Aplicação do Date Compensate Discrete Fourier Transform e do Minimum String Length na determinação de períodos orbitais de binárias eclipsantes com Anãs M
… In this work, codes based on the Date Compensate Discrete Fourier Transform (DCDFT) and Minimum String Lenght (MSL) techniques were developed, together with an automation routine. Aiming the direct determination of the orbital periods of 12 eclipsing binaries composed of M dwarfs, without the need …
-
Advanced Orthogonal Frequency-Division Multiplexing Systems with Cyclic Prefix-Less Multiple-Input and Multiple-Output Discrete Fourier Transform Spreading and Unmanned Aerial Vehicles-Assisted Cyclic Postfixed Windowed Schemes
… MIMO OFDM System. It is based on incorporating Discrete Fourier transform (DFT) spreading, signal discrimination with Walsh-Hadamard coding, and PAPR reduction with Tukey (tapered cosine) time-domain windowing techniques. This combination of mechanisms provides an effective combination of …
-
TESTING OF RECURSIVE AND NON-RECURSIVE ALGORITHMS FOR REAL-TIME PHASOR AND FREQUENCY ESTIMATIONS IN POWER SYSTEMS
… the power grid signals have been estimated using Discrete Fourier Transform (non-recursive), Discrete Fourier Transform (recursive), Least Square, and Wavelet Transform Algorithms. Frequency estimation is performed using Discrete Fourier Transform, Weighted Least Square, and Zero Crossing methods. …
-
Spectral Decomposition Techniques as Hydrocarbon Indicators. A Case Study of West Waha and Worsham Bayer Field, West Texas.
… Least Square Spectral Analysis (CLSSA), Discrete Fourier Transform (DFT) and Continuous Wavelet transform (CWT) were applied on the field data and they all illuminate the reservoirs and also identify shadows beneath the reservoirs at low frequency. This validates that the recently …
-
Band selectable fourier analysis
<p>A computer implementation of Band Selectable Fourier Analysis based on existing instruments is described. An exposition of Sampling Theory is given and the relations between the continuous Fourier Transform and the Discrete Fourier Transform are derived. The design of the computed simulation is …
-
High speed 128-point Fast Fourier Transform circuit design for OFDM
The Fast Fourier Transform (FFT) Algorithm is an efficient way to calculate the Discrete Fourier Transform, which is widely used in digital signal processing. Due to the increasing demand for Orthogonal Frequency Division Multiplexing (OFDM) wireless communication systems, it becomes even more …
Page 1 of 16