Referenced Items are not available for this document.
This article describes a computational method, called the Fourier sampling algorithm. The algorithm takes a small number of (correlated) random samples from a signal and processes them efficiently to produce an approximation of the DFT of the signal. The algorithm offers provable guarantees on the number of samples, the running time, and the amount of storage. As we will see, these requirements are exponentially better than the FFT for some cases of interest.
Published in:
Signal Processing Magazine, IEEE
(Volume:25
,
Issue:
2
)
Date of Publication: March 2008
- Page(s):
- 57 - 66
- ISSN :
- 1053-5888
- INSPEC Accession Number:
- 9903094
- Digital Object Identifier :
- 10.1109/MSP.2007.915000
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 21 March 2008
- Issue Date :
- March 2008
- Sponsored by :
- IEEE Signal Processing Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
