Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, Gui-Linen_US
dc.contributor.authorTsai, Shang-Hoen_US
dc.contributor.authorYang, Kai-Jiunen_US
dc.date.accessioned2018-08-21T05:54:29Z-
dc.date.available2018-08-21T05:54:29Z-
dc.date.issued2017-11-01en_US
dc.identifier.issn1053-587Xen_US
dc.identifier.urihttp://dx.doi.org/10.1109/TSP.2017.2740198en_US
dc.identifier.urihttp://hdl.handle.net/11536/146010-
dc.description.abstractSparse fast Fourier transform (FFT) is a promising technique that can significantly reduce computational complexity. However, only a handful of research has been conducted on precisely analyzing the performance of this new scheme. Accurate theoretical results are important for new techniques to avoid numerous simulations when applying them in various applications. In this study, we analyze several performance metrics and derive the corresponding closed-form expressions for the sparse FFT including 1) inter sparse interference due to nonideal windowing effects, 2) the probability of sparse elements overlapping, and 3) the recovering rate performance. From the analytical results, we gain insights and propose a novel mode-mean estimation algorithm for improving the performance. Simulation results are provided to show the accuracy of the derived results as well as the performance enhancement. We also show how to determine parameters to achieve the lowest computational complexity using these theoretical results.en_US
dc.language.isoen_USen_US
dc.subjectSparse fast Fourier transformen_US
dc.subjectsparse signalsen_US
dc.subjectrecovering rateen_US
dc.subjectmode-mean estimatoren_US
dc.titleOn Performance of Sparse Fast Fourier Transform and Enhancement Algorithmen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/TSP.2017.2740198en_US
dc.identifier.journalIEEE TRANSACTIONS ON SIGNAL PROCESSINGen_US
dc.citation.volume65en_US
dc.citation.spage5716en_US
dc.citation.epage5729en_US
dc.contributor.department電機工程學系zh_TW
dc.contributor.departmentDepartment of Electrical and Computer Engineeringen_US
dc.identifier.wosnumberWOS:000409067700013en_US
Appears in Collections:Articles