Please use this identifier to cite or link to this item: http://lib.hpu.edu.vn/handle/123456789/21646
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBurrus, C. Sidneyen_US
dc.date.accessioned2016-06-25T01:55:37Z
dc.date.available2016-06-25T01:55:37Z
dc.date.issued2012en_US
dc.identifier.otherHPU3160338en_US
dc.identifier.urihttps://lib.hpu.edu.vn/handle/123456789/21646-
dc.description.abstract1 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.extent254 p.en_US
dc.format.mimetypeapplication/pdf-
dc.language.isoenen_US
dc.publisherConnexionsen_US
dc.subjectNatural Sciencesen_US
dc.subjectPhysical Sciencesen_US
dc.subjectTransformsen_US
dc.titleFast Fourier Transformsen_US
dc.typeBooken_US
dc.size1,462KBen_US
dc.departmentEducationen_US
Appears in Collections:Education

Files in This Item:
File Description SizeFormat 
88_fastfouriertransforms.pdf
  Restricted Access
1.46 MBAdobe PDFThumbnail
View/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.