Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/129886
Full metadata record
DC FieldValueLanguage
dc.contributor.authorC. Sidney Burrus
dc.date.accessioned2017-04-30T13:30:33Z-
dc.date.available2017-04-30T13:30:33Z-
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/123456789/129886-
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.
dc.language.isoeng
dc.publisherRice University
dc.relation.urihttp://cnx.org/contents/82e6ba6f-b828-42ef-9db1-8de4b448b869@22.1/Fast_Fourier_Transforms
dc.rights.uriCreative Commons Attribution License (by 3.0)
dc.sourceopenstax cnx
dc.subject.classificationMathematics and StatisticsScience and Technology
dc.subject.otherCooley Tukey FFTFast Fourier TransformFFTPFAPrime Factor AlgorithmWFTAWinograd Fourier Transform Algorithm
dc.titleFast Fourier Transforms
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.