| 000 | 01354nam a2200217 i 4500 | ||
|---|---|---|---|
| 001 | UUN-OA-261 | ||
| 005 | 20260922220305.0 | ||
| 100 | 1 | _aC. Sidney Burrus | |
| 245 | 1 | 0 | _aFast Fourier Transforms |
| 264 | 1 |
_bOpenStax CNX _c2012 |
|
| 300 | _a1 online resource | ||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 520 | _aThis book focuses on the discrete Fourier transform (DFT), discrete convolution, and, particularly, the fast algorithms to calculate them. These topics have been at the center of digital signal processing since its beginning, and new results in hardware, theory and applications continue to keep them important and exciting. 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. | ||
| 650 | 4 | _aComputer Science | |
| 650 | 4 |
_aB. Sc. Artificial Intelligence _2local |
|
| 540 | _aAttribution | ||
| 856 | 4 | 0 |
_uhttps://openstax.org _yRead online |
| 856 | 4 | 2 |
_uhttps://open.umn.edu/opentextbooks/textbooks/fast-fourier-transforms _yOpen Textbook Library record |
| 999 |
_c109 _d109 |
||