BN.com Gift Guide

Inside the FFT Black Box: Serial and Parallel Fast Fourier Transform Algorithms / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$136.08
Used and New from Other Sellers
Used and New from Other Sellers
from $34.93
Usually ships in 1-2 business days
(Save 78%)
Other sellers (Hardcover)
  • All (9) from $34.93   
  • New (6) from $60.00   
  • Used (3) from $34.93   

Overview

Are some areas of fast Fourier transforms still unclear to you? Do the notation and vocabulary seem inconsistent? Does your knowledge of their algorithmic aspects feel incomplete? The fast Fourier transform represents one of the most important advancements in scientific and engineering computing. Until now, however, treatments have been either brief, cryptic, intimidating, or not published in the open literature. Inside the FFT Black Box brings the numerous and varied ideas together in a common notational framework, clarifying vague FFT concepts.
Examples and diagrams explain algorithms completely, with consistent notation. This approach connects the algorithms explicitly to the underlying mathematics. Reviews and explanations of FFT ideas taken from engineering, mathematics, and computer science journals teach the computational techniques relevant to FFT. Two appendices familiarize readers with the design and analysis of computer algorithms, as well.
This volume employs a unified and systematic approach to FFT. It closes the gap between brief textbook introductions and intimidating treatments in the FFT literature. Inside the FFT Black Box provides an up-to-date, self-contained guide for learning the FFT and the multitude of ideas and computing techniques it employs.

"...employs a unified & systematic approach, bringing the numerous & varied ideas together in a common notational framework while spanning the gap between textbook & literature."

Read More Show Less

Editorial Reviews

Booknews
A self-study guide or a supplementary text for graduate or advanced undergraduate courses in any of the many fields for which the Fast Fourier Transform has become one of the most important techniques in scientific and engineering computing. Chu (U. of Guelph, Canada) and George (U. of Waterloo, Canada) make the link between the transform and its underlying mathematics, primarily by translating the numerous and varied ideas and computing methods used by it into a common notational framework, a pseudo-code. That framework also facilitates developing the new parallel algorithms that they describe. For readers without it, two appendices provide the necessary background in designing and analyzing computer algorithms. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9780849302701
  • Publisher: CRC Press
  • Publication date: 11/11/1999
  • Series: Computational Mathematics Series
  • Edition number: 1
  • Pages: 336
  • Product dimensions: 7.00 (w) x 10.00 (h) x 0.81 (d)

Table of Contents

PRELIMINARIES
An Elementary Introduction to the Discrete Fourier Transform
Some Mathematical and Computational Preliminaries
SEQUENTIAL FFT ALGORITHMS
The Divide-and-Conquer Paradigm and Two Basic FFT Algorithms
Deciphering the Scrambled Output from In-Place FFT Computation
Bit-Reversed Input to the Radix-2 DIF FFT
Performing Bit-Reversal by Repeated Permutation of Intermediate Results
An In-Place Radix-2 DIT FFT for Input in Natural Order
An In-Place Radix-2 DIT FFT for Input in Bit-Reversed Order
An Ordered Radix-2 DIT FFT
Ordering Algorithms and Computer Implementation of Radix-2 FFTs
The Radix-4 and the Class of Radix-2s FFTs
The Mixed-Radix and Split-Radix FFTs
FFTs for Arbitrary N
FFTs for Real Input
FFTs for Composite N
Selected FFT Applications
PARALLEL FFT ALGORITHMS
Parallelizing the FFTs: Preliminaries on Data Mapping
Computing and Communications on Distributed-Memory Multiprocessors
Parallel FFTs without Inter-Processor Permutations
Parallel FFTs with Inter-Processor Permutations
A Potpourri of Variations on Parallel FFTs
Further Improvement and a Generalization of Parallel FFTs
Parallelizing Two-Dimensional FFTs
Computing and Distributing Twiddle Factors in the Parallel FFTs
APPENDICES
Fundamental Concepts of Efficient Scientific Computation
Solving Recurrence Equations by Substitution
Bibliography

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)