Mercurial > octave
view libinterp/corefcn/fft.cc @ 20940:48b2ad5ee801
maint: Rename oct-obj.[cc|h] to ovl.[cc|h] for clarity.
* libinterp/corefcn/oct-obj.h: Replaced. Contains a #warning issued if used in
compilation and includes "ovl.h" instead. Original file renamed to
libinterp/octave-value/ovl.h
* libinterp/corefcn/oct-obj.cc: Renamed to libinterp/octave-value/ovl.cc.
* oct-obj.cc (ovl ()): Added new function to return empty octave_value_list.
* libinterp/corefcn/module.mk: Remove oct-obj.cc from build system.
* libinterp/octave-value/module.mk: Add ovl.h and ovl.cc to build system.
* mk-opts.pl, annotation-dialog.h, Cell.cc, __contourc__.cc, __dsearchn__.cc,
__lin_interpn__.cc, __pchip_deriv__.cc, __qp__.cc, balance.cc, besselj.cc,
betainc.cc, colloc.cc, conv2.cc, daspk.cc, dasrt.cc, dassl.cc, data.cc,
debug.cc, defaults.cc, defun.cc, det.cc, dirfns.cc, dlmread.cc, eig.cc,
error.cc, fft.cc, fft2.cc, fftn.cc, file-io.cc, filter.cc, find.cc,
gammainc.cc, gcd.cc, getgrent.cc, getpwent.cc, getrusage.cc, givens.cc,
graphics.cc, gripes.cc, help.cc, hess.cc, hex2num.cc, hook-fcn.h, input.cc,
input.h, inv.cc, kron.cc, load-save.cc, lookup.cc, ls-hdf5.cc, ls-mat-ascii.cc,
ls-mat4.cc, ls-mat5.cc, ls-oct-binary.cc, ls-oct-text.cc, lsode.cc, lu.cc,
luinc.cc, max.cc, mex.cc, oct-hist.cc, oct-lvalue.cc, oct-lvalue.h, oct-map.h,
oct-stream.cc, oct.h, ordschur.cc, pager.cc, pinv.cc, pr-output.cc, quad.cc,
quadcc.cc, qz.cc, rand.cc, rcond.cc, regexp.cc, schur.cc, sparse-xpow.cc,
strfns.cc, sub2ind.cc, svd.cc, sylvester.cc, symtab.h, syscalls.cc, sysdep.cc,
time.cc, toplev.cc, tril.cc, tsearch.cc, typecast.cc, urlwrite.cc, utils.cc,
variables.cc, xpow.cc, __delaunayn__.cc, __glpk__.cc, __voronoi__.cc,
audiodevinfo.cc, audioread.cc, chol.cc, convhulln.cc, dmperm.cc, qr.cc,
symbfact.cc, mkbuiltins, ov-base-diag.h, ov-base-int.cc, ov-base-mat.cc,
ov-base-mat.h, ov-base-scalar.cc, ov-base-sparse.cc, ov-base-sparse.h,
ov-base.cc, ov-bool-mat.cc, ov-bool.cc, ov-builtin.cc, ov-cell.cc, ov-colon.cc,
ov-complex.cc, ov-cs-list.h, ov-cx-mat.cc, ov-dld-fcn.cc, ov-fcn.cc, ov-fcn.h,
ov-float.cc, ov-flt-complex.cc, ov-flt-cx-mat.cc, ov-flt-re-mat.cc,
ov-int16.cc, ov-int32.cc, ov-int64.cc, ov-int8.cc, ov-java.h, ov-mex-fcn.cc,
ov-perm.h, ov-range.cc, ov-re-mat.cc, ov-scalar.cc, ov-str-mat.cc,
ov-uint16.cc, ov-uint32.cc, ov-uint64.cc, ov-uint8.cc, ov-usr-fcn.cc,
ov-usr-fcn.h, ov.cc, octave.cc, op-b-b.cc, op-b-bm.cc, op-b-sbm.cc, op-bm-b.cc,
op-bm-bm.cc, op-bm-sbm.cc, op-cdm-cdm.cc, op-cell.cc, op-chm.cc, op-class.cc,
op-cm-cm.cc, op-cm-cs.cc, op-cm-m.cc, op-cm-s.cc, op-cm-scm.cc, op-cm-sm.cc,
op-cs-cm.cc, op-cs-cs.cc, op-cs-m.cc, op-cs-s.cc, op-cs-scm.cc, op-cs-sm.cc,
op-dm-dm.cc, op-dm-scm.cc, op-dm-sm.cc, op-double-conv.cc, op-fcdm-fcdm.cc,
op-fcdm-fdm.cc, op-fcm-fcm.cc, op-fcm-fcs.cc, op-fcm-fm.cc, op-fcm-fs.cc,
op-fcn.cc, op-fcs-fcm.cc, op-fcs-fcs.cc, op-fcs-fm.cc, op-fcs-fs.cc,
op-fdm-fdm.cc, op-float-conv.cc, op-fm-fcm.cc, op-fm-fcs.cc, op-fm-fm.cc,
op-fm-fs.cc, op-fs-fcm.cc, op-fs-fcs.cc, op-fs-fm.cc, op-fs-fs.cc,
op-i16-i16.cc, op-i32-i32.cc, op-i64-i64.cc, op-i8-i8.cc, op-int-concat.cc,
op-int-conv.cc, op-m-cm.cc, op-m-cs.cc, op-m-m.cc, op-m-s.cc, op-m-scm.cc,
op-m-sm.cc, op-pm-pm.cc, op-pm-scm.cc, op-pm-sm.cc, op-range.cc, op-s-cm.cc,
op-s-cs.cc, op-s-m.cc, op-s-s.cc, op-s-scm.cc, op-s-sm.cc, op-sbm-b.cc,
op-sbm-bm.cc, op-sbm-sbm.cc, op-scm-cm.cc, op-scm-cs.cc, op-scm-m.cc,
op-scm-s.cc, op-scm-scm.cc, op-scm-sm.cc, op-sm-cm.cc, op-sm-cs.cc, op-sm-m.cc,
op-sm-s.cc, op-sm-scm.cc, op-sm-sm.cc, op-str-m.cc, op-str-s.cc, op-str-str.cc,
op-struct.cc, op-ui16-ui16.cc, op-ui32-ui32.cc, op-ui64-ui64.cc, op-ui8-ui8.cc,
parse.h, pt-arg-list.cc, pt-assign.cc, pt-binop.cc, pt-cbinop.cc, pt-cell.cc,
pt-colon.cc, pt-const.cc, pt-eval.h, pt-fcn-handle.cc, pt-funcall.h, pt-id.cc,
pt-idx.cc, pt-jump.cc, pt-mat.cc, pt-select.cc, pt-unop.cc, token.cc,
Array-sym.cc: replace '#include "oct-obj.h"' with '#include "ovl.h"'.
author | Rik <rik@octave.org> |
---|---|
date | Fri, 18 Dec 2015 16:04:56 -0800 |
parents | 6f0bd96f93c0 |
children | e39e05d90788 |
line wrap: on
line source
/* Copyright (C) 1997-2015 David Bateman Copyright (C) 1996-1997 John W. Eaton This file is part of Octave. Octave is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, see <http://www.gnu.org/licenses/>. */ #ifdef HAVE_CONFIG_H #include <config.h> #endif #include "lo-mappers.h" #include "defun.h" #include "error.h" #include "gripes.h" #include "ovl.h" #include "utils.h" #if defined (HAVE_FFTW) #define FFTSRC "@sc{fftw}" #else #define FFTSRC "@sc{fftpack}" #endif static octave_value do_fft (const octave_value_list &args, const char *fcn, int type) { int nargin = args.length (); if (nargin < 1 || nargin > 3) print_usage (); octave_value retval; octave_value arg = args(0); dim_vector dims = arg.dims (); octave_idx_type n_points = -1; int dim = -1; if (nargin > 1) { if (! args(1).is_empty ()) { double dval = args(1).double_value (); if (xisnan (dval)) error ("%s: number of points (N) cannot be NaN", fcn); n_points = NINTbig (dval); if (n_points < 0) error ("%s: number of points (N) must be greater than zero", fcn); } } if (nargin > 2) { double dval = args(2).double_value (); if (xisnan (dval)) error ("%s: DIM cannot be NaN", fcn); else if (dval < 1 || dval > dims.length ()) error ("%s: DIM must be a valid dimension along which to perform FFT", fcn); else // to be safe, cast it back to int since dim is an int dim = NINT (dval) - 1; } for (octave_idx_type i = 0; i < dims.length (); i++) if (dims(i) < 0) return retval; if (dim < 0) { for (octave_idx_type i = 0; i < dims.length (); i++) if (dims(i) > 1) { dim = i; break; } // And if the first argument is scalar? if (dim < 0) dim = 1; } if (n_points < 0) n_points = dims(dim); else dims(dim) = n_points; if (dims.any_zero () || n_points == 0) { if (arg.is_single_type ()) return octave_value (FloatNDArray (dims)); else return octave_value (NDArray (dims)); } if (arg.is_single_type ()) { if (arg.is_real_type ()) { FloatNDArray nda = arg.float_array_value (); nda.resize (dims, 0.0); retval = (type != 0 ? nda.ifourier (dim) : nda.fourier (dim)); } else { FloatComplexNDArray cnda = arg.float_complex_array_value (); cnda.resize (dims, 0.0); retval = (type != 0 ? cnda.ifourier (dim) : cnda.fourier (dim)); } } else { if (arg.is_real_type ()) { NDArray nda = arg.array_value (); nda.resize (dims, 0.0); retval = (type != 0 ? nda.ifourier (dim) : nda.fourier (dim)); } else if (arg.is_complex_type ()) { ComplexNDArray cnda = arg.complex_array_value (); cnda.resize (dims, 0.0); retval = (type != 0 ? cnda.ifourier (dim) : cnda.fourier (dim)); } else gripe_wrong_type_arg (fcn, arg); } return retval; } /* %!assert (fft ([]), []) %!assert (fft (zeros (10,0)), zeros (10,0)) %!assert (fft (zeros (0,10)), zeros (0,10)) %!assert (fft (0), 0) %!assert (fft (1), 1) %!assert (fft (ones (2,2)), [2,2; 0,0]) %!assert (fft (eye (2,2)), [1,1; 1,-1]) %!assert (fft (single ([])), single ([])) %!assert (fft (zeros (10,0,"single")), zeros (10,0,"single")) %!assert (fft (zeros (0,10,"single")), zeros (0,10,"single")) %!assert (fft (single (0)), single (0)) %!assert (fft (single (1)), single (1)) %!assert (fft (ones (2,2,"single")), single ([2,2; 0,0])) %!assert (fft (eye (2,2,"single")), single ([1,1; 1,-1])) %!error (fft ()) */ DEFUN (fft, args, , "-*- texinfo -*-\n\ @deftypefn {} {} fft (@var{x})\n\ @deftypefnx {} {} fft (@var{x}, @var{n})\n\ @deftypefnx {} {} fft (@var{x}, @var{n}, @var{dim})\n\ Compute the discrete Fourier transform of @var{A} using\n\ a Fast Fourier Transform (FFT) algorithm.\n\ \n\ The FFT is calculated along the first non-singleton dimension of the\n\ array. Thus if @var{x} is a matrix, @code{fft (@var{x})} computes the\n\ FFT for each column of @var{x}.\n\ \n\ If called with two arguments, @var{n} is expected to be an integer\n\ specifying the number of elements of @var{x} to use, or an empty\n\ matrix to specify that its value should be ignored. If @var{n} is\n\ larger than the dimension along which the FFT is calculated, then\n\ @var{x} is resized and padded with zeros. Otherwise, if @var{n} is\n\ smaller than the dimension along which the FFT is calculated, then\n\ @var{x} is truncated.\n\ \n\ If called with three arguments, @var{dim} is an integer specifying the\n\ dimension of the matrix along which the FFT is performed\n\ @seealso{ifft, fft2, fftn, fftw}\n\ @end deftypefn") { return do_fft (args, "fft", 0); } DEFUN (ifft, args, , "-*- texinfo -*-\n\ @deftypefn {} {} ifft (@var{x})\n\ @deftypefnx {} {} ifft (@var{x}, @var{n})\n\ @deftypefnx {} {} ifft (@var{x}, @var{n}, @var{dim})\n\ Compute the inverse discrete Fourier transform of @var{A}\n\ using a Fast Fourier Transform (FFT) algorithm.\n\ \n\ The inverse FFT is calculated along the first non-singleton dimension\n\ of the array. Thus if @var{x} is a matrix, @code{fft (@var{x})} computes\n\ the inverse FFT for each column of @var{x}.\n\ \n\ If called with two arguments, @var{n} is expected to be an integer\n\ specifying the number of elements of @var{x} to use, or an empty\n\ matrix to specify that its value should be ignored. If @var{n} is\n\ larger than the dimension along which the inverse FFT is calculated, then\n\ @var{x} is resized and padded with zeros. Otherwise, if @var{n} is\n\ smaller than the dimension along which the inverse FFT is calculated,\n\ then @var{x} is truncated.\n\ \n\ If called with three arguments, @var{dim} is an integer specifying the\n\ dimension of the matrix along which the inverse FFT is performed\n\ @seealso{fft, ifft2, ifftn, fftw}\n\ @end deftypefn") { return do_fft (args, "ifft", 1); } /* %% Author: David Billinghurst (David.Billinghurst@riotinto.com.au) %% Comalco Research and Technology %% 02 May 2000 %!test %! N = 64; %! n = 4; %! t = 2*pi*(0:1:N-1)/N; %! s = cos (n*t); %! S = fft (s); %! %! answer = zeros (size (t)); %! answer(n+1) = N/2; %! answer(N-n+1) = N/2; %! %! assert (S, answer, 4*N*eps); %% Author: David Billinghurst (David.Billinghurst@riotinto.com.au) %% Comalco Research and Technology %% 02 May 2000 %!test %! N = 64; %! n = 7; %! t = 2*pi*(0:1:N-1)/N; %! s = cos (n*t); %! %! S = zeros (size (t)); %! S(n+1) = N/2; %! S(N-n+1) = N/2; %! %! assert (ifft (S), s, 4*N*eps); %% Author: David Billinghurst (David.Billinghurst@riotinto.com.au) %% Comalco Research and Technology %% 02 May 2000 %!test %! N = 64; %! n = 4; %! t = single (2*pi*(0:1:N-1)/N); %! s = cos (n*t); %! S = fft (s); %! %! answer = zeros (size (t), "single"); %! answer(n+1) = N/2; %! answer(N-n+1) = N/2; %! %! assert (S, answer, 4*N*eps ("single")); %% Author: David Billinghurst (David.Billinghurst@riotinto.com.au) %% Comalco Research and Technology %% 02 May 2000 %!test %! N = 64; %! n = 7; %! t = 2*pi*(0:1:N-1)/N; %! s = cos (n*t); %! %! S = zeros (size (t), "single"); %! S(n+1) = N/2; %! S(N-n+1) = N/2; %! %! assert (ifft (S), s, 4*N*eps ("single")); */