Fast Fourier Transforms

dc.contributor.author	Burrus, C. Sidney	en_US
dc.date.accessioned	2016-06-25T01:55:37Z
dc.date.available	2016-06-25T01:55:37Z
dc.date.issued	2012	en_US
dc.identifier.other	HPU3160338	en_US
dc.identifier.uri	https://lib.hpu.edu.vn/handle/123456789/21646
dc.description.abstract	1 Preface: Fast Fourier Transforms. 2 Introduction: Fast Fourier Transforms. 3 Multidimensional Index Mapping. 4 Polynomial Description of Signals. 5 The DFT as Convolution or Filtering. 6 Factoring the Signal Processing Operators. 7 Winograd's Short DFT Algorithms. 8 DFT and FFT: An Algebraic View. 9 The Cooley-Tukey Fast Fourier Transform Algorithm. 10 The Prime Factor and Winograd Fourier Transform Algorithms. 11 Implementing FFTs in Practice. 12 Algorithms for Data with Restrictions. 13 Convolution Algorithms. 14 Comments: Fast Fourier Transforms. 15 Conclusions: Fast Fourier Transforms. 16 Appendix 1: FFT Flowgraphs. 17 Appendix 2: Operation Counts for General Length FFT. 18 Appendix 3: FFT Computer Programs. 19 Appendix 4: Programs for Short FFTs. Bibliography.	en_US
dc.format.extent	254 p.	en_US
dc.format.mimetype	application/pdf
dc.language.iso	en	en_US
dc.publisher	Connexions	en_US
dc.subject	Natural Sciences	en_US
dc.subject	Physical Sciences	en_US
dc.subject	Transforms	en_US
dc.title	Fast Fourier Transforms	en_US
dc.type	Book	en_US
dc.size	1,462KB	en_US
dc.department	Education	en_US