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
Browse by Author:
Markus Pueschel
View author profile
Return to Browsing Content
|
Search for Content
Content by Markus Pueschel
Other authors' collections containing modules by Markus Pueschel
(What are
modules
and
collections
?)
Sort by:
Popularity
Language
Revision Date
Title
Type
Results per page:
10
25
100
View:
Detail
|
Compact
|
Statistics
Fast Fourier Transforms
(col10550)
Author:
C. Sidney Burrus
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.
[Expand 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, and computer programs are provided.
[Collapse Summary]
Subject:
Mathematics and Statistics,
Science and Technology
Language:
English
Popularity:
97.09%
Revised:
2012-11-18
Revisions:
22
Fast Fourier Transforms (6x9 Version)
(col10683)
Author:
C. Sidney Burrus
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.
[Expand 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, and computer programs are provided. This version is to printed in a 6"x9" size.
[Collapse Summary]
Subject:
Mathematics and Statistics,
Science and Technology
Language:
English
Popularity:
68.44%
Revised:
2009-08-24
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:
21756
Visit a random module