File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TAP.2003.818792
- Scopus: eid_2-s2.0-0242527336
- WOS: WOS:000186435300016
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A Sparse Data Fast Fourier Transform (SDFFT)
Title | A Sparse Data Fast Fourier Transform (SDFFT) |
---|---|
Authors | |
Keywords | Far-Field Computation Multilevel Algorithm Nonuniform Fast Fourier Transform (Nufft) Parabolic Reflector Physical Optics Synthetic Aperture Radar Imaging Tomography |
Issue Date | 2003 |
Citation | Ieee Transactions On Antennas And Propagation, 2003, v. 51 n. 11, p. 3161-3170 How to Cite? |
Abstract | A multilevel algorithm that efficiently Fourier transforms sparse spatial data to sparse spectral data with controllable error is presented. The algorithm termed "sparse data fast fourier transform" (SDFFT) is particularly useful for 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 sphere or it consists of completely arbitrary points scattered in the k-space. In addition, like the various nonuniform fast Fourier transforms, the O(N log N) algorithm can deal with a sparse, nonuniform spatial domain. In this paper, the parabolic reflector antenna problem is studied as an example to demonstrate its use in the computation of far-field patterns due to arbitrary aperture antennas and antenna arrays. The algorithm is also promising for various applications such as back-projection tomography, diffraction tomography, and synthetic aperture radar imaging. |
Persistent Identifier | http://hdl.handle.net/10722/182690 |
ISSN | 2023 Impact Factor: 4.6 2023 SCImago Journal Rankings: 1.794 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Aydiner, AA | en_US |
dc.contributor.author | Chew, WC | en_US |
dc.contributor.author | Cui, TJ | en_US |
dc.contributor.author | Song, J | en_US |
dc.date.accessioned | 2013-05-02T05:16:27Z | - |
dc.date.available | 2013-05-02T05:16:27Z | - |
dc.date.issued | 2003 | en_US |
dc.identifier.citation | Ieee Transactions On Antennas And Propagation, 2003, v. 51 n. 11, p. 3161-3170 | en_US |
dc.identifier.issn | 0018-926X | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/182690 | - |
dc.description.abstract | A multilevel algorithm that efficiently Fourier transforms sparse spatial data to sparse spectral data with controllable error is presented. The algorithm termed "sparse data fast fourier transform" (SDFFT) is particularly useful for 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 sphere or it consists of completely arbitrary points scattered in the k-space. In addition, like the various nonuniform fast Fourier transforms, the O(N log N) algorithm can deal with a sparse, nonuniform spatial domain. In this paper, the parabolic reflector antenna problem is studied as an example to demonstrate its use in the computation of far-field patterns due to arbitrary aperture antennas and antenna arrays. The algorithm is also promising for various applications such as back-projection tomography, diffraction tomography, and synthetic aperture radar imaging. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | IEEE Transactions on Antennas and Propagation | en_US |
dc.subject | Far-Field Computation | en_US |
dc.subject | Multilevel Algorithm | en_US |
dc.subject | Nonuniform Fast Fourier Transform (Nufft) | en_US |
dc.subject | Parabolic Reflector | en_US |
dc.subject | Physical Optics | en_US |
dc.subject | Synthetic Aperture Radar Imaging | en_US |
dc.subject | Tomography | en_US |
dc.title | A Sparse Data Fast Fourier Transform (SDFFT) | en_US |
dc.type | Article | en_US |
dc.identifier.email | Chew, WC: wcchew@hku.hk | en_US |
dc.identifier.authority | Chew, WC=rp00656 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1109/TAP.2003.818792 | en_US |
dc.identifier.scopus | eid_2-s2.0-0242527336 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0242527336&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 51 | en_US |
dc.identifier.issue | 11 | en_US |
dc.identifier.spage | 3161 | en_US |
dc.identifier.epage | 3170 | en_US |
dc.identifier.isi | WOS:000186435300016 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Aydiner, AA=7004153439 | en_US |
dc.identifier.scopusauthorid | Chew, WC=36014436300 | en_US |
dc.identifier.scopusauthorid | Cui, TJ=7103095470 | en_US |
dc.identifier.scopusauthorid | Song, J=7404788341 | en_US |
dc.identifier.issnl | 0018-926X | - |