Rogue Wave banner
Previous fileTop of DocumentContentsIndexNext file

DComplexFFT2DServer



Data Type and Member Function Indexes
(exclusive of constructors and destructors)

Synopsis

#include <rw/cfft2d.h>
DComplexFFT2DServer dcfft2s;

Description

Class DComplexFFT2DServer performs two-dimensional (2-D) double precision complex fast Fourier transforms (FFTs) of an RWGenMat<DComplex> matrix. The transform of a complex matrix is a complex matrix; therefore, the server returns a complex matrix for either a forward or backward transform.

At any given moment, the server is configured to transform a matrix with specified dimensions. These dimensions can be set one of three ways:

The last method means that if the matrix size changes, the server automatically reconfigures to the new size. Since this is an expensive calculation, it is most efficient to call the server repeatedly for matrices of the same size. Different FFT servers may be constructed to handle different sizes.

The forward transform calculated is:

The inverse Fourier transform (IDFT) calculated is:

As with the 1-D FFT, a call to fourier() followed by a call to ifourier() results in the original matrix multiplied by the total number of elements, that is, the number of rows times the number of columns.

Public Constructors

DComplexFFT2DServer();
DComplexFFT2DServer(unsigned nrows, unsigned ncols);
DComplexFFT2DServer(unsigned n);
DComplexFFT2DServer(const DComplexFFT2DServer&);

Public Member Functions

unsigned
cols() const;
RWGenMat<DComplex> 
fourier(const RWGenMat<DComplex>&);
RWGenMat<DComplex> 
ifourier(const RWGenMat<DComplex>&);
unsigned
rows() const;
void
setCols(unsigned N);
void
setRows(unsigned N);

Public Member Operator

void    operator=(const DComplexFFT2DServer& v);


Previous fileTop of DocumentContentsIndexNext file

©Copyright 1999, Rogue Wave Software, Inc.
Send mail to report errors or comment on the documentation.