Skip to content Skip to navigation

Connexions

Sections
You are here: Home » Content » Fast Fourier Transforms

Navigation

Content Actions
  • Download PDF/ZIP ...
    Download PDF/ZIP:
    • The PDF of the collection
    • A ZIP file containing all the multimedia files in the collection
    • PDF
    • Multimedia ZIP (?)

      The multimedia ZIP file provides offline access to all the multimedia files that are not available in the printed version (PDF) of this collection.

      To access the files:

      1. download the ZIP
      2. extract all of its files to a location on your hard drive
      3. open the README file for instructions or go directly to mediafiles.html file in your Web browser
  • Add to ...
    Add the collection to:
    • My Favorites
    • A lens
    • An external social bookmarking service
    • My Favorites (What is 'My Favorites'?)
      'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.
    • A lens (What is a lens?)

      Definition of a lens

      Lenses

      A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

      What is in a lens?

      Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

      Who can create a lens?

      Any individual Connexions member, a community, or a respected organization.

    • External bookmarks
  • E-mail the author

Table of Contents

Recently Viewed

Fast Fourier Transforms

Collection type: Book

Book by: C. Sidney Burrus

Start »

Collection Properties

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.

Institution: Rice University

This collection contains: Modules by: C. Sidney Burrus, Ivan Selesnick, Markus Pueschel, Matteo Frigo, Steven G. Johnson

Comments, questions, feedback, criticisms?

Send feedback