Title

Algorithm to retrieve real coefficients of a two-dimensional Fourier series using complex one-dimensional FFTs

Keywords

fast Fourier transforms; two-dimensional Fourier series

Abstract

Complex notation is used almost exclusively when dealing with two-dimensional Fourier series. Fast Fourier transform algorithms efficiently compute the complex Fourier coefficients of these complex series. There are instances, however, where the real form of the series may be preferred or required. The coefficients of the real series are related in an implicit manner to the complex coefficients of the complex series. In this paper, an algorithm is developed to efficiently and accurately extract the Fourier coefficients of a real two-dimensional discrete Fourier series by utilizing the complex based one-dimensional fast Fourier transform. An illustrative example is presented for validation of the algorithm, and a FORTRAN program listing is provided. © 1994.

Publication Date

1-1-1994

Publication Title

Advances in Engineering Software

Volume

19

Issue

1

Number of Pages

41-44

Document Type

Article

Identifier

scopus

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/0965-9978(94)90045-0

Socpus ID

0028741476 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0028741476

This document is currently not available here.

Share

COinS