Abstract
A multidimensional fast Fourier transform (FFT) algorithm is presented for signals with arbitrary symmetries and periodic on arbitrary lattices. Applications that can benefit from such an algorithm include Volterra filtering and analysis of x-ray diffraction data. The presented algorithm exploits signal redundancy to achieve a computational complexity of where N is the number of independent samples. To the authors’ knowledge, this is the only FFT that makes the frequency domain computation of Volterra filtering more convenient than the time domain approach.
© 1999 Optical Society of America
Full Article |
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Figures (5)
You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Tables (5)
You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Equations (169)
You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription