File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A sparse data fast Fourier transform (SDFFT) - Algorithm and implementation

TitleA sparse data fast Fourier transform (SDFFT) - Algorithm and implementation
Authors
Issue Date2001
PublisherI E E E. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000033
Citation
Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 2001, v. 4, p. 638-641 How to Cite?
AbstractAn algorithm that efficiently Fourier transforms sparse spatial data to sparse spectral data with controllable error is presented. Unlike the ordinary nonuniform last Fourier transform (NUFFT), which becomes O(N 2) for sparse k-space and sparse k-space data, the sparse data fast Fourier transform (SDFFT) presented herein decreases the cost to O(N log N) while preserving the O(N log N) memory complexity. The algorithm can be readily employed in general signal processing applications where only part of the k-space is to be computed - regardless of whether it is a regular region like an angular section of the Ewald's sphere or it consists completely of arbitrary points. Among its applications in electromagnetics are back-projection tomography, diffraction tomography, synthetic aperture radar imaging, and the computation of far field patterns due to general aperture antennas and antenna arrays.
Persistent Identifierhttp://hdl.handle.net/10722/182937
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorAydmer, AAen_US
dc.contributor.authorWeng Cho Chewen_US
dc.contributor.authorSong, Jen_US
dc.date.accessioned2013-05-02T05:17:46Z-
dc.date.available2013-05-02T05:17:46Z-
dc.date.issued2001en_US
dc.identifier.citationIeee Antennas And Propagation Society, Ap-S International Symposium (Digest), 2001, v. 4, p. 638-641en_US
dc.identifier.issn1522-3965en_US
dc.identifier.urihttp://hdl.handle.net/10722/182937-
dc.description.abstractAn algorithm that efficiently Fourier transforms sparse spatial data to sparse spectral data with controllable error is presented. Unlike the ordinary nonuniform last Fourier transform (NUFFT), which becomes O(N 2) for sparse k-space and sparse k-space data, the sparse data fast Fourier transform (SDFFT) presented herein decreases the cost to O(N log N) while preserving the O(N log N) memory complexity. The algorithm can be readily employed in general signal processing applications where only part of the k-space is to be computed - regardless of whether it is a regular region like an angular section of the Ewald's sphere or it consists completely of arbitrary points. Among its applications in electromagnetics are back-projection tomography, diffraction tomography, synthetic aperture radar imaging, and the computation of far field patterns due to general aperture antennas and antenna arrays.en_US
dc.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000033en_US
dc.relation.ispartofIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)en_US
dc.titleA sparse data fast Fourier transform (SDFFT) - Algorithm and implementationen_US
dc.typeConference_Paperen_US
dc.identifier.emailWeng Cho Chew: wcchew@hku.hken_US
dc.identifier.authorityWeng Cho Chew=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0035150761en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0035150761&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume4en_US
dc.identifier.spage638en_US
dc.identifier.epage641en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridAydmer, AA=6507638687en_US
dc.identifier.scopusauthoridWeng Cho Chew=36014436300en_US
dc.identifier.scopusauthoridSong, J=7404788341en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats