Algorithm To Retrieve Real Coefficients Of A 2-Dimensional Fourier-Series Using Complex One-Dimensional Ffts

    Authors

    A. J. Kassab;R. S. Nordlund

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Adv. Eng. Softw.

    Keywords

    2-DIMENSIONAL FOURIER SERIES; FAST FOURIER TRANSFORMS; Computer Science, Interdisciplinary Applications; Computer Science, ; Software Engineering

    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 transform. An illustrative example is presented for validation of the algorithm, and a FORTRAN program listing is provided.

    Journal Title

    Advances in Engineering Software

    Volume

    19

    Issue/Number

    1

    Publication Date

    1-1-1994

    Document Type

    Article

    Language

    English

    First Page

    41

    Last Page

    44

    WOS Identifier

    WOS:A1994PH41600004

    ISSN

    0965-9978

    Share

    COinS