Fast Fourier transform of sparse spatial data to sparse Fourier data

W. C. Chew, J. M. Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An O(NlogN) algorithm to Fourier transform sparse spatial data to sparse Fourier data is presented. It is assumed that the data is dense in one-dimensional (1D) both in spatial and Fourier space, but live in a 2D space. The algorithm can be easily generalized to higher dimensions.

Original languageEnglish (US)
Title of host publicationIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
Pages2324-2327
Number of pages4
StatePublished - 2000

Publication series

NameIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
Volume4
ISSN (Print)0272-4693

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Fast Fourier transform of sparse spatial data to sparse Fourier data'. Together they form a unique fingerprint.

Cite this