๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Recursive generation of the DIF-FFT algorithm for 1-D DFT

โœ Scribed by Rath, O.; Rao, K.R.; Yeung, K.

Book ID
117865589
Publisher
IEEE
Year
1988
Weight
298 KB
Volume
36
Category
Article
ISSN
0096-3518

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A parallel 1-D FFT algorithm for the Hit
A parallel 1-D FFT algorithm for the Hitachi SR8000
โœ Daisuke Takahashi ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 123 KB

In this paper, we propose a high-performance parallel one-dimensional fast Fourier transform (FFT) algorithm on clusters of vector symmetric multiprocessor (SMP) nodes. The fourstep FFT algorithm can be altered into a five-step FFT algorithm to expand the innermost loop length. We use the five-step

A generalized algorithm for the recursiv
A generalized algorithm for the recursive implementation of polynomial filters
โœ P. Agathoklis; H. Xu ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 644 KB

Polynomial jilters have many applications in real time control, estimation and identification, particularly when information about the system dynamics and noise statistics are not precisely known. In this paper, a generalized recursive algorithm for nth order polynomial jilters is developed. The par