{
"item_title" : "Fast Fourier Transforms",
"item_author" : [" C. Sidney Burrus "],
"item_description" : "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.",
"item_img_path" : "https://covers4.booksamillion.com/covers/bam/1/30/046/164/1300461640_b.jpg",
"price_data" : {
"retail_price" : "26.95", "online_price" : "26.95", "our_price" : "26.95", "club_price" : "26.95", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Fast Fourier Transforms
Other Available Formats
Overview
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 item is Non-Returnable
Customers Also Bought
- 1
Details
- ISBN-13: 9781300461647
- ISBN-10: 1300461640
- Publisher: Lulu.com
- Publish Date: November 2012
- Dimensions: 11 x 8.5 x 0.54 inches
- Shipping Weight: 1.32 pounds
- Page Count: 256
Related Categories
You May Also Like...
- 1
