You are here: Home » Content

Browse by Title: "F"

Sort by: Results per page:
View: Detail | Compact | Statistics
« Previous 10 1 ... 13 14 15 [16] 17 18 19 ... 96 Next 10 »
Fast Convolution Using the FFT (m10963)
Author: Robert Nowak
Keywords: circular convolution, convolution, digital filters, FFT, filtering, LTI systems
Summary: This module describes FFT, convolution, filtering, LTI systems, digital filters and circular convolution.
Subject: Science and Technology
Language: English
Popularity: 93.82%
Revised: 2005-11-02
Revisions: 7
Fast Fourier Transform (FFT) (m10250)
Author: Don Johnson
Keywords: butterfly, computational complexity, Cooley-Tukey algorithm, DFT, discrete Fourier transform, fast Fourier transform, FFT
Summary: The DFT can be reduced from exponential time with the Fast Fourier Transform algorithm.
Subject: Science and Technology
Language: English
Popularity: 98.50%
Revised: 2012-07-09
Revisions: 22
Fast fourier transform (FFT) (m12107)
Subject: Science and Technology
Language: English
Popularity: 69.96%
Revised: 2004-07-06
Revisions: New
The Fast Fourier Transform (FFT) (m10783)
Keywords: dft, Fast Fourier Transform, fft, fourier, Fourier Transform
Summary: This module describes the fast Fourier Transform (FFT).
Subject: Science and Technology
Language: English
Popularity: 91.19%
Revised: 2010-07-29
Revisions: 8
Fast Fourier Transforms (col10550)
Institution: Rice University
Keywords: Cooley Tukey FFT, Fast Fourier Transform, FFT, PFA, Prime Factor Algorithm, WFTA, Winograd Fourier Transform Algorithm
Summary: This book uses an index map, a polynomial decomposition, an operator factorization, and a conversion to a filter to develop a very general and efficient description of fast algorithms to calculate the discrete Fourier transform (DFT). The work of Winograd is outlined, chapters by Selesnick, Pueschel, and Johnson are included ... are provided.
Subject: Mathematics and Statistics, Science and Technology
Language: English
Popularity: 97.05%
Revised: 2012-11-18
Revisions: 22
Fast Fourier Transforms (6x9 Version) (col10683)
Institution: Rice University
Keywords: Cooley Tukey FFT, Fast Fourier Transform, FFT, PFA, Prime Factor Algorithm, WFTA, Winograd Fourier Transform Algorithm
Summary: This book uses an index map, a polynomial decomposition, an operator factorization, and a conversion to a filter to develop a very general and efficient description of fast algorithms to calculate the discrete Fourier transform (DFT). The work of Winograd is outlined, chapters by Selesnick, Pueschel, and Johnson are included ... 6"x9" size.
Subject: Mathematics and Statistics, Science and Technology
Language: English
Popularity: 68.47%
Revised: 2009-08-24
Revisions: 5
Fast unto death (m37439)
Keywords: Corruption, Cricket, India, Politics
Summary: This is a chronicle of developing story of India woven around daily events involving politics, corruption and cricket.
Subject: Social Sciences
Language: English
Popularity: 32.09%
Revised: 2011-04-29
Revisions: 7
Fast wavelet transform (m17391)
Language: English
Popularity: 47.81%
Revised: 2009-09-22
Revisions: 3
A fax from Supertoy (m26456)
Subject: Science and Technology
Language: English
Popularity: 6.55%
Revised: 2009-07-01
Revisions: New
Fear of Failure, Fear of Success (m19592)
Author: Rice ADVANCE
Keywords: Academia, Balance, Diversity, Fears, Success, Women
Summary: This presentation is authored by Mikki Hebl, Rice University.
Subject: Business
Language: English
Popularity: 77.04%
Revised: 2010-02-24
Revisions: 2
« Previous 10 1 ... 13 14 15 [16] 17 18 19 ... 96 Next 10 »
Popularity is measured as percentile rank of page views/day over all time
My Account
Repository
Total Collections: 1317
Total Modules: 21936