///
/// This file is part of ILNumerics Community Edition.
///
/// ILNumerics Community Edition - high performance computing for applications.
/// Copyright (C) 2006 - 2012 Haymo Kutschbach, http://ilnumerics.net
///
/// ILNumerics Community Edition is free software: you can redistribute it and/or modify
/// it under the terms of the GNU General Public License version 3 as published by
/// the Free Software Foundation.
///
/// ILNumerics Community Edition 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 General Public License for more details.
///
/// You should have received a copy of the GNU General Public License
/// along with ILNumerics Community Edition. See the file License.txt in the root
/// of your distribution package. If not, see .
///
/// In addition this software uses the following components and/or licenses:
///
/// =================================================================================
/// The Open Toolkit Library License
///
/// Copyright (c) 2006 - 2009 the Open Toolkit library.
///
/// Permission is hereby granted, free of charge, to any person obtaining a copy
/// of this software and associated documentation files (the "Software"), to deal
/// in the Software without restriction, including without limitation the rights to
/// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
/// the Software, and to permit persons to whom the Software is furnished to do
/// so, subject to the following conditions:
///
/// The above copyright notice and this permission notice shall be included in all
/// copies or substantial portions of the Software.
///
/// =================================================================================
///
using System;
using ILNumerics;
namespace ILNumerics.Native {
///
/// Interface for all FFT methods supported
///
public interface IILFFT {
///
/// performs backward n-dimensional fft
///
/// input array
/// number of dimensions of fft
/// result, same size as A
ILRetArray FFTBackward(ILInArray A, int nDims);
///
/// performs backward n-dimensional fft
///
/// input array
/// number of dimensions of fft
/// result, same size as A
ILRetArray FFTBackward(ILInArray A, int nDims);
///
/// performs backward 1-dimensional fft
///
/// input array
/// dimension to perform fft along
/// result, same size as A
ILRetArray FFTBackward1D(ILInArray A, int dim);
///
/// performs backward 1-dimensional fft
///
/// input array
/// dimension to perform fft along
/// result, same size as A
ILRetArray FFTBackward1D(ILInArray A, int dim);
///
/// performs backward n-dimensional fft on hermitian sequence
///
/// input array
/// number of dimensions of fft
/// result, same size as A
/// This function brings increased performance if the implementation supports it.
/// If not, the method will be implemented by repeated calls of (inplace) 1D fft.
ILRetArray FFTBackwSym(ILInArray A, int nDims);
///
/// performs backward n-dimensional fft on hermitian sequence
///
/// input array
/// number of dimensions of fft
/// result, same size as A
/// This function brings increased performance if the implementation supports it.
/// If not, the method will be implemented by repeated calls of (inplace) 1D fft.
ILRetArray FFTBackwSym(ILInArray A, int nDims);
///
/// performs backward 1-dimensional fft on hermitian sequence
///
/// input array
/// dimension to perform fft along
/// result, same size as A
/// This function brings increased performance if the implementation supports it.
/// If not, the method will be implemented by repeated calls of (inplace) 1D fft.
ILRetArray FFTBackwSym1D(ILInArray A, int dim);
///
/// performs backward 1-dimensional fft on hermitian sequence
///
/// input array
/// dimension to perform fft along
/// result, same size as A
/// This function brings increased performance if the implementation supports it.
/// If not, the method will be implemented by repeated calls of (inplace) 1D fft.
ILRetArray FFTBackwSym1D(ILInArray A, int dim);
///
/// performs n-dimensional fft
///
/// input array
/// number of dimension of fft
/// result, same size as A
ILRetArray FFTForward(ILInArray A, int nDims);
///
/// performs n-dimensional fft
///
/// input array
/// number of dimension of fft
/// result, same size as A
ILRetArray FFTForward(ILInArray A, int nDims);
///
/// performs n-dimensional fft
///
/// input array
/// number of dimension of fft
/// result, same size as A
ILRetArray FFTForward(ILInArray A, int nDims);
///
/// performs n-dimensional fft
///
/// input array
/// number of dimension of fft
/// result, same size as A
ILRetArray FFTForward(ILInArray A, int nDims);
///
/// performs 1-dimensional fft
///
/// input array
/// dimension to perform fft along
/// result, same size as A
ILRetArray FFTForward1D(ILInArray A, int dim);
///
/// performs 1-dimensional fft
///
/// input array
/// dimension to perform fft along
/// result, same size as A
ILRetArray FFTForward1D(ILInArray A, int dim);
///
/// performs 1-dimensional fft
///
/// input array
/// dimension to perform fft along
/// result, same size as A
ILRetArray FFTForward1D(ILInArray A, int dim);
///
/// performs 1-dimensional fft
///
/// input array
/// dimension to perform fft along
/// result, same size as A
ILRetArray FFTForward1D(ILInArray A, int dim);
///
/// true, if the implementation caches plans between subsequent calls
///
bool CachePlans { get; }
///
/// Clear all currently cached plans
///
void FreePlans();
///
/// true, if the implementation efficiently transforms from/to hermitian sequences (hermitian symmetry).
///
/// If this property returns 'true', the implementation brings increased performance.
/// If not, the symmetry methods will bring no performance advantage over the 1D transforms.
bool SpeedyHermitian { get; }
}
}