dc.contributor.advisor |
Galbraith, S |
en |
dc.contributor.author |
Laity, Joel |
en |
dc.date.accessioned |
2016-06-20T22:29:22Z |
en |
dc.date.issued |
2016 |
en |
dc.date.submitted |
2016 |
en |
dc.identifier.citation |
2016 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/29137 |
en |
dc.description.abstract |
Some functions can be well approximated by taking their Fourier transforms and discarding the terms that have small Fourier coefficients. The sparse Fourier transform is an algorithm that computes such an approximation more efficiently than computing the entire Fourier transform. The sparse Fourier transform has many applications to problems in mathematics and engineering. For example, in mathematics the sparse Fourier transform can be used to solve the chosen multiplier hidden number problem. In engineering, the sparse Fourier transform can be used to compress audio or video data. In Chapter 3 we present an algorithm that computes the sparse Fourier transform. This algorithm generalises and unifies the sparse fast Fourier transforms in [19] and [21]. These algorithms are of particular importance as they are the earliest algorithms for computing the sparse Fourier transform. The final chapter develops a method for reducing the problem of calculating the sparse Fourier transform over Zn to calculating it over Z₂k where k is the smallest integer such that n<= ₂k, provided the function has certain special properties. This method is based on ideas from Shor's algorithm for factoring integers. |
en |
dc.publisher |
ResearchSpace@Auckland |
en |
dc.relation.ispartof |
Masters Thesis - University of Auckland |
en |
dc.relation.isreferencedby |
UoA99264865511002091 |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.rights.uri |
http://creativecommons.org/licenses/by-nc-sa/3.0/nz/ |
en |
dc.title |
The Sparse Fourier Transform |
en |
dc.type |
Thesis |
en |
thesis.degree.discipline |
Mathematics |
en |
thesis.degree.grantor |
The University of Auckland |
en |
thesis.degree.level |
Masters |
en |
dc.rights.holder |
Copyright: The Author |
en |
pubs.elements-id |
531083 |
en |
pubs.record-created-at-source-date |
2016-06-21 |
en |
dc.identifier.wikidata |
Q112925756 |
|