Analysis of an Ada based version of Glassman's general N point fast Fourier transform
نویسندگان
چکیده
منابع مشابه
Wavelet transform based fast approximate Fourier transform
We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coe cients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational comple...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملan infinite planar array of rectangular microstrip patch antenna analysis
the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...
15 صفحه اولPipelined 64-point Fast Fourier Transform for Programmable Logic Devices
This paper describes the design and implementation of a fully pipelined 64-point Fast Fourier Transform (FFT) in programmable logic. The FFT takes 20-bit fixed point complex numbers as input and after a known pipeline latency produces 20-bit complex values representing the FFT of the input. It is designed to allow continuous input of samples and is therefore suitable for use in real-time system...
متن کاملAn Equivariant Fast Fourier Transform Algorithm
This paper presents a generalization of the Cooley-Tukey fast Fourier transform algorithm that respects group symmetries. The algorithm, when applied to a function invariant under a group of symmetries, fully exploits these symmetries to reduce both the number of arithmetic operations and the amount of memory used. The symmetries accommodated by the algorithm include all of the crystallographic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1993
ISSN: 0898-1221
DOI: 10.1016/0898-1221(93)90322-m