52,10 €
57,89 €
-10% with code: EXTRA
Fast Fourier Transforms
Fast Fourier Transforms
52,10
57,89 €
  • We will send in 10–14 business days.
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.
  • Publisher:
  • ISBN-10: 1300461640
  • ISBN-13: 9781300461647
  • Format: 21.6 x 27.9 x 1.4 cm, minkšti viršeliai
  • Language: English
  • SAVE -10% with code: EXTRA

Fast Fourier Transforms (e-book) (used book) | bookbook.eu

Reviews

(2.50 Goodreads rating)

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.

EXTRA 10 % discount with code: EXTRA

52,10
57,89 €
We will send in 10–14 business days.

The promotion ends in 21d.02:38:16

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 0,58 Book Euros!?
  • Author: C Sidney Burrus
  • Publisher:
  • ISBN-10: 1300461640
  • ISBN-13: 9781300461647
  • Format: 21.6 x 27.9 x 1.4 cm, minkšti viršeliai
  • Language: English English

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.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)