Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/129494
Full metadata record
DC FieldValueLanguage
dc.contributor.authorC. Sidney Burrus
dc.date.accessioned2017-04-30T13:30:12Z-
dc.date.available2017-04-30T13:30:12Z-
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/123456789/129494-
dc.description.abstractThis 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 version is to printed in a 6"x9" size.
dc.language.isoeng
dc.publisherRice University
dc.relation.urihttp://cnx.org/contents/16e8e5e8-4f22-4b53-9cd6-a15b14f01ce4@5.8/Fast_Fourier_Transforms_(6x9_V
dc.rights.uriCreative Commons Attribution License ( 3.0)
dc.sourceopenstax cnx
dc.subject.classificationMathematics and Statistics
dc.subject.classificationScience and Technology
dc.subject.otherCooley Tukey FFT
dc.subject.otherFast Fourier Transform
dc.subject.otherFFT
dc.subject.otherPFA
dc.subject.otherPrime Factor Algorithm
dc.subject.otherWFTA
dc.subject.otherWinograd Fourier Transform Algorithm
dc.titleFast Fourier Transforms (6x9 Version)
dc.type電子教課書
dc.classification自然科學類
Theme:教科書-自然科學類

Files in This Item:
There are no files associated with this item.
Show simple item record


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