/usr/include/casacore/lattices/LatticeMath/LatticeFFT.h is in casacore-dev 2.2.0-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 | //# LatticeFFT.h: Definitions for Lattice FFT functions
//# Copyright (C) 1996,1997,1998,2003
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This library is free software; you can redistribute it and/or modify it
//# under the terms of the GNU Library General Public License as published by
//# the Free Software Foundation; either version 2 of the License, or (at your
//# option) any later version.
//#
//# This library is distributed in the hope that it will be useful, but WITHOUT
//# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
//# FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
//# License for more details.
//#
//# You should have received a copy of the GNU Library General Public License
//# along with this library; if not, write to the Free Software Foundation,
//# Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA.
//#
//# Correspondence concerning AIPS++ should be addressed as follows:
//# Internet email: aips2-request@nrao.edu.
//# Postal address: AIPS++ Project Office
//# National Radio Astronomy Observatory
//# 520 Edgemont Road
//# Charlottesville, VA 22903-2475 USA
//#
//#
//# $Id$
#ifndef LATTICES_LATTICEFFT_H
#define LATTICES_LATTICEFFT_H
#include <casacore/casa/aips.h>
#include <casacore/casa/BasicSL/Complex.h>
namespace casacore { //# NAMESPACE CASACORE - BEGIN
template <class T> class Vector;
template <class T> class Lattice;
// <summary>Functions for Fourier transforming Lattices</summary>
// <reviewed reviewer="" date="" tests="" demos="">
// </reviewed>
// <prerequisite>
// </prerequisite>
// <etymology>
// </etymology>
// <synopsis>
// </synopsis>
// <example>
// <srcblock>
// </srcblock>
// </example>
// <motivation>
// </motivation>
// <todo asof="">
// </todo>
class LatticeFFT
{
public:
// 2-D in-place complex->complex FFT. Transforms over the first two
// dimensions and iterates over all the others. The Lattice must have two or
// more dimensions otherwise an AipsError is thrown.
static void cfft2d(Lattice<DComplex> & cLattice, const Bool toFrequency=True);
static void cfft2d(Lattice<Complex> & cLattice, const Bool toFrequency=True);
// N-D in-place complex->complex FFT. Only transform over selected
// dimensions. Iterate over the others. whichAxes must be the same length as
// the number of dimensions in the Lattice otherwise an AipsError is thrown.
static void cfft(Lattice<DComplex> & cLattice,
const Vector<Bool> & whichAxes, const Bool toFrequency=True);
static void cfft(Lattice<Complex> & cLattice,
const Vector<Bool> & whichAxes, const Bool toFrequency=True);
// Non-folded version
static void cfft0(Lattice<Complex> & cLattice,
const Vector<Bool> & whichAxes, const Bool toFrequency=True);
// N-D in-place complex->complex FFT. Transform over all axes.
static void cfft(Lattice<DComplex> & cLattice, const Bool toFrequency=True);
static void cfft(Lattice<Complex> & cLattice, const Bool toFrequency=True);
// N-D real->complex FFT. Only one half of the Hermition result is
// returned. Transforms are only done on selected dimensions. The origin of
// the transform is the center of the Lattice ie., [nx/2,ny/2,...] if
// doShift is True. Otherwise it is the first element ie., [0,0,...]
static void rcfft(Lattice<Complex> & out, const Lattice<Float> & in,
const Vector<Bool> & whichAxes, const Bool doShift=True,
Bool doFast=False);
static void myrcfft(Lattice<Complex> & out, const Lattice<Float> & in,
const Vector<Bool> & whichAxes, const Bool doShift=True);
// N-D real->complex FFT. Only one half of the Hermition result is
// returned. Transform over all dimensions. The origin of
// the transform is the center of the Lattice ie., [nx/2,ny/2,...] if
// doShift is True. Otherwise it is the first element ie., [0,0,...]
static void rcfft(Lattice<Complex> & out, const Lattice<Float> & in,
const Bool doShift=True, Bool doFast=False);
static void myrcfft(Lattice<Complex> & out, const Lattice<Float> & in,
const Bool doShift=True);
// N-D complex->real FFT. Only one half of the Hermition input is
// required. If whichAxis is specified Transforms are only done on selected
// dimensions otherwise they are done on all axes. The origin of the
// transform is the center of the Lattice ie., [nx/2,ny/2,...] if doShift is
// True, otherwise it is the first element ie., [0,0,...]
// These functions will <b>scramble the input Lattice</b> unless the versions
// with const inputs are used. The const input versions are less efficient as
// they create a temporary Lattice and copy the input data into it.
// <group>
static void crfft(Lattice<Float> & out, Lattice<Complex> & in,
const Vector<Bool> & whichAxes,
const Bool doShift=True, Bool doFast=False);
static void crfft(Lattice<Float> & out, Lattice<Complex> & in,
const Bool doShift=True, Bool doFast=False);
static void crfft(Lattice<Float> & out, const Lattice<Complex> & in,
const Bool doShift=True, Bool doFast=False);
// </group>
};
} //# NAMESPACE CASACORE - END
#endif
|