Skip to content.
|
Skip to navigation
Log In
Contact Us
Report a Bug
Search Site
Connexions
Sections
Home
Content
Lenses
About Us
Help
MyCNX
You are here:
Home
»
Content
Content similar to:
Algoritmo de Goertzel
View
Algoritmo de Goertzel
Browse Content
|
Search for Content
(What are
modules
and
collections
?)
Sort by:
Relevance
Popularity
Language
Revision Date
Title
Type
Results per page:
10
25
100
View:
Detail
|
Compact
|
Statistics
N = 25 FFT module
(m17383)
Authors:
Howard Johnson
,
C. Sidney Burrus
Keywords:
DFT
,
FFT
,
PFA
,
Winograd
Summary:
A very efficient length N = 25 FFT module that can be use alone or with the PFA or the WFTA.
Subject:
Mathematics and Statistics
Language:
English
Popularity:
43.82%
Revised:
2009-09-16
Revisions:
5
Popularity is measured as percentile rank of page views/day over all time
My Account
Username
Password
Cookies are not enabled. You must
enable cookies
before you can log in.
Get an account
Forgot your password?
Repository
Total Collections:
1317
Visit a random collection
Total Modules:
21811
Visit a random module