Mercurial > octave
view libinterp/corefcn/filter.cc @ 20791:f7084eae3318
maint: Use Octave coding conventions for #if statements.
* mk-opts.pl, dialog.h, find-files-dialog.h, find-files-model.h,
file-editor-tab.h, octave-qscintilla.h, octave-txt-lexer.h, main-window.h,
octave-cmd.h, octave-dock-widget.h, octave-gui.h, thread-manager.h,
workspace-model.h, workspace-view.h, builtins.h, Cell.h, bitfcns.cc,
c-file-ptr-stream.h, cdisplay.h, comment-list.h, cutils.h, data.h, debug.h,
defaults.in.h, defun-dld.h, defun-int.h, defun.h, dirfns.h, display.h,
dynamic-ld.h, error.h, event-queue.h, file-io.h, filter.cc, getrusage.cc,
gl-render.h, gl2ps-renderer.h, graphics.in.h, gripes.h, help.h, hook-fcn.h,
input.h, jit-ir.h, jit-typeinfo.h, jit-util.h, load-path.h, load-save.h,
ls-ascii-helper.h, ls-hdf5.h, ls-mat-ascii.h, ls-mat4.h, ls-mat5.h,
ls-oct-binary.h, ls-oct-text.h, ls-utils.h, oct-errno.h, oct-fstrm.h,
oct-handle.h, oct-hdf5-types.h, oct-hdf5.h, oct-hist.h, oct-iostrm.h,
oct-lvalue.h, oct-map.h, oct-obj.h, oct-prcstrm.h, oct-procbuf.h,
oct-stdstrm.h, oct-stream.h, oct-strstrm.h, oct.h, octave-link.h, pager.h,
pr-output.h, procstream.h, profiler.h, pt-jit.h, sighandlers.cc, sighandlers.h,
siglist.h, sparse-xdiv.h, sparse-xpow.h, symtab.h, syscalls.cc, sysdep.h,
toplev.cc, toplev.h, utils.h, variables.h, workspace-element.h, xdiv.h,
xnorm.h, xpow.h, dmperm.cc, oct-qhull.h, mkbuiltins, oct-conf.in.h,
ov-base-diag.h, ov-base-int.h, ov-base-mat.h, ov-base-scalar.h,
ov-base-sparse.h, ov-base.h, ov-bool-mat.h, ov-bool-sparse.h, ov-bool.h,
ov-builtin.h, ov-cell.h, ov-ch-mat.h, ov-class.h, ov-classdef.h, ov-colon.h,
ov-complex.h, ov-cs-list.h, ov-cx-diag.h, ov-cx-mat.h, ov-cx-sparse.h,
ov-dld-fcn.h, ov-fcn-handle.h, ov-fcn-inline.h, ov-fcn.h, ov-float.h,
ov-flt-complex.h, ov-flt-cx-diag.h, ov-flt-cx-mat.h, ov-flt-re-diag.h,
ov-flt-re-mat.h, ov-int-traits.h, ov-int16.h, ov-int32.h, ov-int64.h,
ov-int8.h, ov-java.h, ov-lazy-idx.h, ov-mex-fcn.h, ov-null-mat.h, ov-perm.h,
ov-range.h, ov-re-diag.h, ov-re-mat.h, ov-re-sparse.h, ov-scalar.h,
ov-str-mat.h, ov-struct.h, ov-type-conv.h, ov-typeinfo.h, ov-uint16.h,
ov-uint32.h, ov-uint64.h, ov-uint8.h, ov-usr-fcn.h, ov.h, octave.h, ops.h,
options-usage.h, lex.h, parse.h, pt-all.h, pt-arg-list.h, pt-array-list.h,
pt-assign.h, pt-binop.h, pt-bp.h, pt-cbinop.h, pt-cell.h, pt-check.h,
pt-classdef.h, pt-cmd.h, pt-colon.h, pt-const.h, pt-decl.h, pt-eval.h,
pt-except.h, pt-exp.h, pt-fcn-handle.h, pt-funcall.h, pt-id.h, pt-idx.h,
pt-jump.h, pt-loop.h, pt-mat.h, pt-misc.h, pt-pr-code.h, pt-select.h,
pt-stmt.h, pt-unop.h, pt-walk.h, pt.h, token.h, version.in.h, Array-util.h,
Array.h, CColVector.h, CDiagMatrix.h, CMatrix.h, CNDArray.h, CRowVector.h,
CSparse.h, DiagArray2.h, MArray-decl.h, MArray-defs.h, MArray.h, MDiagArray2.h,
MSparse.h, Matrix.h, MatrixType.h, PermMatrix.h, Range.h, Sparse.h,
boolMatrix.h, boolNDArray.h, boolSparse.h, chMatrix.h, chNDArray.h,
dColVector.h, dDiagMatrix.h, dMatrix.h, dNDArray.h, dRowVector.h, dSparse.h,
dim-vector.h, fCColVector.h, fCDiagMatrix.h, fCMatrix.h, fCNDArray.h,
fCRowVector.h, fColVector.h, fDiagMatrix.h, fMatrix.h, fNDArray.h,
fRowVector.h, idx-vector.h, int16NDArray.h, int32NDArray.h, int64NDArray.h,
int8NDArray.h, intNDArray.h, uint16NDArray.h, uint32NDArray.h, uint64NDArray.h,
uint8NDArray.h, f77-fcn.h, lo-error.h, quit.h, CmplxAEPBAL.h, CmplxCHOL.h,
CmplxGEPBAL.h, CmplxHESS.h, CmplxLU.h, CmplxQR.h, CmplxQRP.h, CmplxSCHUR.h,
CmplxSVD.h, CollocWt.h, DAE.h, DAEFunc.h, DAERT.h, DAERTFunc.h, DASPK.h,
DASRT.h, DASSL.h, DET.h, EIG.h, LSODE.h, ODE.h, ODEFunc.h, ODES.h, ODESFunc.h,
Quad.h, SparseCmplxCHOL.h, SparseCmplxLU.h, SparseCmplxQR.cc, SparseCmplxQR.h,
SparseQR.h, SparsedbleCHOL.h, SparsedbleLU.h, base-aepbal.h, base-dae.h,
base-de.h, base-lu.h, base-min.h, base-qr.h, bsxfun-decl.h, bsxfun-defs.cc,
bsxfun.h, dbleAEPBAL.h, dbleCHOL.h, dbleGEPBAL.h, dbleHESS.h, dbleLU.h,
dbleQR.h, dbleQRP.h, dbleSCHUR.h, dbleSVD.h, eigs-base.cc, fCmplxAEPBAL.h,
fCmplxCHOL.h, fCmplxGEPBAL.h, fCmplxHESS.h, fCmplxLU.h, fCmplxQR.h,
fCmplxQRP.h, fCmplxSCHUR.h, fCmplxSVD.h, fEIG.h, floatAEPBAL.h, floatCHOL.h,
floatGEPBAL.h, floatHESS.h, floatLU.h, floatQR.h, floatQRP.h, floatSCHUR.h,
floatSVD.h, lo-mappers.cc, lo-mappers.h, lo-specfun.cc, lo-specfun.h,
oct-convn.h, oct-fftw.h, oct-norm.h, oct-rand.h, oct-spparms.h, randmtzig.c,
sparse-base-chol.h, sparse-base-lu.h, sparse-dmsolve.cc, Sparse-diag-op-defs.h,
Sparse-op-decls.h, Sparse-op-defs.h, Sparse-perm-op-defs.h, mk-ops.awk,
mx-base.h, mx-defs.h, mx-ext.h, mx-inlines.cc, mx-op-decl.h, mx-op-defs.h,
sparse-mk-ops.awk, dir-ops.h, file-ops.h, file-stat.h, lo-sysdep.h,
mach-info.h, oct-env.h, oct-group.h, oct-openmp.h, oct-passwd.h,
oct-syscalls.h, oct-time.cc, oct-time.h, oct-uname.h, pathlen.h, sysdir.h,
syswait.h, action-container.h, base-list.h, byte-swap.h, caseless-str.h,
cmd-edit.h, cmd-hist.h, data-conv.h, functor.h, glob-match.h, kpse.cc,
lo-array-gripes.h, lo-cutils.h, lo-ieee.h, lo-macros.h, lo-math.h, lo-regexp.h,
lo-traits.h, lo-utils.h, oct-alloc.h, oct-base64.h, oct-binmap.h, oct-cmplx.h,
oct-glob.h, oct-inttypes.h, oct-locbuf.h, oct-mutex.h, oct-refcount.h,
oct-rl-edit.h, oct-rl-hist.h, oct-shlib.h, oct-sort.h, oct-sparse.h,
pathsearch.h, singleton-cleanup.h, sparse-sort.h, sparse-util.h, statdefs.h,
str-vec.h, sun-utils.h, unwind-prot.h, url-transfer.h:
Use Octave coding conventions for #if statements.
author | Rik <rik@octave.org> |
---|---|
date | Thu, 03 Dec 2015 10:23:38 -0800 |
parents | 571508c1ed06 |
children | 8bb38ba1bad6 |
line wrap: on
line source
/* Copyright (C) 1996-2015 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/>. */ // Based on Tony Richardson's filter.m. // // Originally translated to C++ by KH (Kurt.Hornik@wu-wien.ac.at) // with help from Fritz Leisch and Andreas Weingessel on Oct 20, 1994. // // Rewritten to use templates to handle both real and complex cases by // jwe, Wed Nov 1 19:15:29 1995. #ifdef HAVE_CONFIG_H #include <config.h> #endif #include "quit.h" #include "defun.h" #include "error.h" #include "oct-obj.h" #if ! defined (CXX_NEW_FRIEND_TEMPLATE_DECL) extern MArray<double> filter (MArray<double>&, MArray<double>&, MArray<double>&, int dim); extern MArray<Complex> filter (MArray<Complex>&, MArray<Complex>&, MArray<Complex>&, int dim); extern MArray<float> filter (MArray<float>&, MArray<float>&, MArray<float>&, int dim); extern MArray<FloatComplex> filter (MArray<FloatComplex>&, MArray<FloatComplex>&, MArray<FloatComplex>&, int dim); #endif template <class T> MArray<T> filter (MArray<T>& b, MArray<T>& a, MArray<T>& x, MArray<T>& si, int dim = 0) { MArray<T> y; octave_idx_type a_len = a.numel (); octave_idx_type b_len = b.numel (); octave_idx_type ab_len = a_len > b_len ? a_len : b_len; // FIXME: The two lines below should be unecessary because // this template is called with a and b as column vectors // already. However the a.resize line is currently (2011/04/26) // necessary to stop bug #33164. b.resize (dim_vector (ab_len, 1), 0.0); if (a_len > 1) a.resize (dim_vector (ab_len, 1), 0.0); T norm = a (0); if (norm == static_cast<T> (0.0)) { error ("filter: the first element of A must be nonzero"); return y; } dim_vector x_dims = x.dims (); if (dim < 0 || dim > x_dims.length ()) { error ("filter: DIM must be a valid dimension"); return y; } octave_idx_type x_len = x_dims(dim); dim_vector si_dims = si.dims (); octave_idx_type si_len = si_dims(0); if (si_len != ab_len - 1) { error ("filter: first dimension of SI must be of length max (length (a), length (b)) - 1"); return y; } if (si_dims.length () != x_dims.length ()) { error ("filter: dimensionality of SI and X must agree"); return y; } for (octave_idx_type i = 1; i < dim; i++) { if (si_dims(i) != x_dims(i-1)) { error ("filter: dimensionality of SI and X must agree"); return y; } } for (octave_idx_type i = dim+1; i < x_dims.length (); i++) { if (si_dims(i) != x_dims(i)) { error ("filter: dimensionality of SI and X must agree"); return y; } } if (x_len == 0) return x; if (norm != static_cast<T> (1.0)) { a /= norm; b /= norm; } if (a_len <= 1 && si_len <= 0) return b(0) * x; y.resize (x_dims, 0.0); int x_stride = 1; for (int i = 0; i < dim; i++) x_stride *= x_dims(i); octave_idx_type x_num = x_dims.numel () / x_len; for (octave_idx_type num = 0; num < x_num; num++) { octave_idx_type x_offset; if (x_stride == 1) x_offset = num * x_len; else { octave_idx_type x_offset2 = 0; x_offset = num; while (x_offset >= x_stride) { x_offset -= x_stride; x_offset2++; } x_offset += x_offset2 * x_stride * x_len; } octave_idx_type si_offset = num * si_len; if (a_len > 1) { T *py = y.fortran_vec (); T *psi = si.fortran_vec (); const T *pa = a.data (); const T *pb = b.data (); const T *px = x.data (); psi += si_offset; for (octave_idx_type i = 0, idx = x_offset; i < x_len; i++, idx += x_stride) { py[idx] = psi[0] + pb[0] * px[idx]; if (si_len > 0) { for (octave_idx_type j = 0; j < si_len - 1; j++) { OCTAVE_QUIT; psi[j] = psi[j+1] - pa[j+1] * py[idx] + pb[j+1] * px[idx]; } psi[si_len-1] = pb[si_len] * px[idx] - pa[si_len] * py[idx]; } else { OCTAVE_QUIT; psi[0] = pb[si_len] * px[idx] - pa[si_len] * py[idx]; } } } else if (si_len > 0) { T *py = y.fortran_vec (); T *psi = si.fortran_vec (); const T *pb = b.data (); const T *px = x.data (); psi += si_offset; for (octave_idx_type i = 0, idx = x_offset; i < x_len; i++, idx += x_stride) { py[idx] = psi[0] + pb[0] * px[idx]; if (si_len > 1) { for (octave_idx_type j = 0; j < si_len - 1; j++) { OCTAVE_QUIT; psi[j] = psi[j+1] + pb[j+1] * px[idx]; } psi[si_len-1] = pb[si_len] * px[idx]; } else { OCTAVE_QUIT; psi[0] = pb[1] * px[idx]; } } } } return y; } #if ! defined (CXX_NEW_FRIEND_TEMPLATE_DECL) extern MArray<double> filter (MArray<double>&, MArray<double>&, MArray<double>&, MArray<double>&, int dim); extern MArray<Complex> filter (MArray<Complex>&, MArray<Complex>&, MArray<Complex>&, MArray<Complex>&, int dim); extern MArray<float> filter (MArray<float>&, MArray<float>&, MArray<float>&, MArray<float>&, int dim); extern MArray<FloatComplex> filter (MArray<FloatComplex>&, MArray<FloatComplex>&, MArray<FloatComplex>&, MArray<FloatComplex>&, int dim); #endif template <class T> MArray<T> filter (MArray<T>& b, MArray<T>& a, MArray<T>& x, int dim = -1) { dim_vector x_dims = x.dims (); if (dim < 0) { // Find first non-singleton dimension while (dim < x_dims.length () && x_dims(dim) <= 1) dim++; // All dimensions singleton, pick first dimension if (dim == x_dims.length ()) dim = 0; } else if (dim < 0 || dim > x_dims.length ()) { error ("filter: DIM must be a valid dimension"); return MArray<T> (); } octave_idx_type a_len = a.numel (); octave_idx_type b_len = b.numel (); octave_idx_type si_len = (a_len > b_len ? a_len : b_len) - 1; dim_vector si_dims = x.dims (); for (int i = dim; i > 0; i--) si_dims(i) = si_dims(i-1); si_dims(0) = si_len; MArray<T> si (si_dims, T (0.0)); return filter (b, a, x, si, dim); } DEFUN (filter, args, nargout, "-*- texinfo -*-\n\ @deftypefn {Built-in Function} {@var{y} =} filter (@var{b}, @var{a}, @var{x})\n\ @deftypefnx {Built-in Function} {[@var{y}, @var{sf}] =} filter (@var{b}, @var{a}, @var{x}, @var{si})\n\ @deftypefnx {Built-in Function} {[@var{y}, @var{sf}] =} filter (@var{b}, @var{a}, @var{x}, [], @var{dim})\n\ @deftypefnx {Built-in Function} {[@var{y}, @var{sf}] =} filter (@var{b}, @var{a}, @var{x}, @var{si}, @var{dim})\n\ Apply a 1-D digital filter to the data @var{x}.\n\ \n\ @code{filter} returns the solution to the following linear, time-invariant\n\ difference equation:\n\ @tex\n\ $$\n\ \\sum_{k=0}^N a_{k+1} y_{n-k} = \\sum_{k=0}^M b_{k+1} x_{n-k}, \\qquad\n\ 1 \\le n \\le P\n\ $$\n\ @end tex\n\ @ifnottex\n\ @c Set example in small font to prevent overfull line\n\ \n\ @smallexample\n\ @group\n\ N M\n\ SUM a(k+1) y(n-k) = SUM b(k+1) x(n-k) for 1<=n<=length(x)\n\ k=0 k=0\n\ @end group\n\ @end smallexample\n\ \n\ @end ifnottex\n\ \n\ @noindent\n\ where\n\ @ifnottex\n\ N=length(a)-1 and M=length(b)-1.\n\ @end ifnottex\n\ @tex\n\ $a \\in \\Re^{N-1}$, $b \\in \\Re^{M-1}$, and $x \\in \\Re^P$.\n\ @end tex\n\ The result is calculated over the first non-singleton dimension of @var{x}\n\ or over @var{dim} if supplied.\n\ \n\ An equivalent form of the equation is:\n\ @tex\n\ $$\n\ y_n = -\\sum_{k=1}^N c_{k+1} y_{n-k} + \\sum_{k=0}^M d_{k+1} x_{n-k}, \\qquad\n\ 1 \\le n \\le P\n\ $$\n\ @end tex\n\ @ifnottex\n\ @c Set example in small font to prevent overfull line\n\ \n\ @smallexample\n\ @group\n\ N M\n\ y(n) = - SUM c(k+1) y(n-k) + SUM d(k+1) x(n-k) for 1<=n<=length(x)\n\ k=1 k=0\n\ @end group\n\ @end smallexample\n\ \n\ @end ifnottex\n\ \n\ @noindent\n\ where\n\ @ifnottex\n\ c = a/a(1) and d = b/a(1).\n\ @end ifnottex\n\ @tex\n\ $c = a/a_1$ and $d = b/a_1$.\n\ @end tex\n\ \n\ If the fourth argument @var{si} is provided, it is taken as the\n\ initial state of the system and the final state is returned as\n\ @var{sf}. The state vector is a column vector whose length is\n\ equal to the length of the longest coefficient vector minus one.\n\ If @var{si} is not supplied, the initial state vector is set to all\n\ zeros.\n\ \n\ In terms of the Z Transform, @var{y} is the result of passing the\n\ discrete-time signal @var{x} through a system characterized by the following\n\ rational system function:\n\ @tex\n\ $$\n\ H(z) = {\\displaystyle\\sum_{k=0}^M d_{k+1} z^{-k}\n\ \\over 1 + \\displaystyle\\sum_{k+1}^N c_{k+1} z^{-k}}\n\ $$\n\ @end tex\n\ @ifnottex\n\ \n\ @example\n\ @group\n\ M\n\ SUM d(k+1) z^(-k)\n\ k=0\n\ H(z) = ---------------------\n\ N\n\ 1 + SUM c(k+1) z^(-k)\n\ k=1\n\ @end group\n\ @end example\n\ \n\ @end ifnottex\n\ @seealso{filter2, fftfilt, freqz}\n\ @end deftypefn") { octave_value_list retval; int nargin = args.length (); if (nargin < 3 || nargin > 5) { print_usage (); return retval; } const char *a_b_errmsg = "filter: A and B must be vectors"; const char *x_si_errmsg = "filter: X and SI must be arrays"; int dim; dim_vector x_dims = args(2).dims (); if (nargin == 5) { dim = args(4).nint_value () - 1; if (dim < 0 || dim >= x_dims.length ()) { error ("filter: DIM must be a valid dimension"); return retval; } } else { // Find first non-singleton dimension dim = 0; while (dim < x_dims.length () && x_dims(dim) <= 1) dim++; // All dimensions singleton, pick first dimension if (dim == x_dims.length ()) dim = 0; } bool isfloat = (args(0).is_single_type () || args(1).is_single_type () || args(2).is_single_type () || (nargin >= 4 && args(3).is_single_type ())); if (args(0).is_complex_type () || args(1).is_complex_type () || args(2).is_complex_type () || (nargin >= 4 && args(3).is_complex_type ())) { if (isfloat) { FloatComplexColumnVector b = args(0).xfloat_complex_vector_value (a_b_errmsg); FloatComplexColumnVector a = args(1).xfloat_complex_vector_value (a_b_errmsg); FloatComplexNDArray x = args(2).xfloat_complex_array_value (x_si_errmsg); FloatComplexNDArray si; if (nargin == 3 || args(3).is_empty ()) { octave_idx_type a_len = a.numel (); octave_idx_type b_len = b.numel (); octave_idx_type si_len = (a_len > b_len ? a_len : b_len) - 1; dim_vector si_dims = x.dims (); for (int i = dim; i > 0; i--) si_dims(i) = si_dims(i-1); si_dims(0) = si_len; si.resize (si_dims, 0.0); } else { si = args(3).xfloat_complex_array_value (x_si_errmsg); if (si.is_vector () && x.is_vector ()) si = si.reshape (dim_vector (si.numel (), 1)); } FloatComplexNDArray y (filter (b, a, x, si, dim)); if (nargout == 2) retval(1) = si; retval(0) = y; } else { ComplexColumnVector b = args(0).xcomplex_vector_value (a_b_errmsg); ComplexColumnVector a = args(1).xcomplex_vector_value (a_b_errmsg); ComplexNDArray x = args(2).xcomplex_array_value (x_si_errmsg); ComplexNDArray si; if (nargin == 3 || args(3).is_empty ()) { octave_idx_type a_len = a.numel (); octave_idx_type b_len = b.numel (); octave_idx_type si_len = (a_len > b_len ? a_len : b_len) - 1; dim_vector si_dims = x.dims (); for (int i = dim; i > 0; i--) si_dims(i) = si_dims(i-1); si_dims(0) = si_len; si.resize (si_dims, 0.0); } else { si = args(3).xcomplex_array_value (x_si_errmsg); if (si.is_vector () && x.is_vector ()) si = si.reshape (dim_vector (si.numel (), 1)); } ComplexNDArray y (filter (b, a, x, si, dim)); if (nargout == 2) retval(1) = si; retval(0) = y; } } else { if (isfloat) { FloatColumnVector b = args(0).xfloat_vector_value (a_b_errmsg); FloatColumnVector a = args(1).xfloat_vector_value (a_b_errmsg); FloatNDArray x = args(2).xfloat_array_value (x_si_errmsg); FloatNDArray si; if (nargin == 3 || args(3).is_empty ()) { octave_idx_type a_len = a.numel (); octave_idx_type b_len = b.numel (); octave_idx_type si_len = (a_len > b_len ? a_len : b_len) - 1; dim_vector si_dims = x.dims (); for (int i = dim; i > 0; i--) si_dims(i) = si_dims(i-1); si_dims(0) = si_len; si.resize (si_dims, 0.0); } else { si = args(3).xfloat_array_value (x_si_errmsg); if (si.is_vector () && x.is_vector ()) si = si.reshape (dim_vector (si.numel (), 1)); } FloatNDArray y (filter (b, a, x, si, dim)); if (nargout == 2) retval(1) = si; retval(0) = y; } else { ColumnVector b = args(0).xvector_value (a_b_errmsg); ColumnVector a = args(1).xvector_value (a_b_errmsg); NDArray x = args(2).xarray_value (x_si_errmsg); NDArray si; if (nargin == 3 || args(3).is_empty ()) { octave_idx_type a_len = a.numel (); octave_idx_type b_len = b.numel (); octave_idx_type si_len = (a_len > b_len ? a_len : b_len) - 1; dim_vector si_dims = x.dims (); for (int i = dim; i > 0; i--) si_dims(i) = si_dims(i-1); si_dims(0) = si_len; si.resize (si_dims, 0.0); } else { si = args(3).xarray_value (x_si_errmsg); if (si.is_vector () && x.is_vector ()) si = si.reshape (dim_vector (si.numel (), 1)); } NDArray y (filter (b, a, x, si, dim)); if (nargout == 2) retval(1) = si; retval(0) = y; } } return retval; } template MArray<double> filter (MArray<double>&, MArray<double>&, MArray<double>&, MArray<double>&, int dim); template MArray<double> filter (MArray<double>&, MArray<double>&, MArray<double>&, int dim); template MArray<Complex> filter (MArray<Complex>&, MArray<Complex>&, MArray<Complex>&, MArray<Complex>&, int dim); template MArray<Complex> filter (MArray<Complex>&, MArray<Complex>&, MArray<Complex>&, int dim); template MArray<float> filter (MArray<float>&, MArray<float>&, MArray<float>&, MArray<float>&, int dim); template MArray<float> filter (MArray<float>&, MArray<float>&, MArray<float>&, int dim); template MArray<FloatComplex> filter (MArray<FloatComplex>&, MArray<FloatComplex>&, MArray<FloatComplex>&, MArray<FloatComplex>&, int dim); template MArray<FloatComplex> filter (MArray<FloatComplex>&, MArray<FloatComplex>&, MArray<FloatComplex>&, int dim); /* %!shared a, b, x, r %!test %! a = [1 1]; %! b = [1 1]; %! x = zeros (1,10); x(1) = 1; %! assert (filter (b, [1], x ), [1 1 0 0 0 0 0 0 0 0]); %! assert (filter (b, [1], x.'), [1 1 0 0 0 0 0 0 0 0].'); %! assert (filter (b.', [1], x ), [1 1 0 0 0 0 0 0 0 0] ); %! assert (filter (b.', [1], x.'), [1 1 0 0 0 0 0 0 0 0].'); %! assert (filter ([1], a, x ), [+1 -1 +1 -1 +1 -1 +1 -1 +1 -1] ); %! assert (filter ([1], a, x.'), [+1 -1 +1 -1 +1 -1 +1 -1 +1 -1].'); %! assert (filter ([1], a.', x ), [+1 -1 +1 -1 +1 -1 +1 -1 +1 -1] ); %! assert (filter ([1], a.', x.'), [+1 -1 +1 -1 +1 -1 +1 -1 +1 -1].'); %! assert (filter (b, a, x ), [1 0 0 0 0 0 0 0 0 0] ); %! assert (filter (b.', a, x ), [1 0 0 0 0 0 0 0 0 0] ); %! assert (filter (b, a.', x ), [1 0 0 0 0 0 0 0 0 0] ); %! assert (filter (b.', a, x ), [1 0 0 0 0 0 0 0 0 0] ); %! assert (filter (b, a, x.'), [1 0 0 0 0 0 0 0 0 0].'); %! assert (filter (b.', a, x.'), [1 0 0 0 0 0 0 0 0 0].'); %! assert (filter (b, a.', x.'), [1 0 0 0 0 0 0 0 0 0].'); %! assert (filter (b.', a, x.'), [1 0 0 0 0 0 0 0 0 0].'); %!test %! r = sqrt (1/2) * (1+i); %! a = a*r; %! b = b*r; %! assert (filter (b, [1], x ), r*[1 1 0 0 0 0 0 0 0 0] ); %! assert (filter (b, [1], r*x ), r*r*[1 1 0 0 0 0 0 0 0 0] ); %! assert (filter (b, [1], x.' ), r*[1 1 0 0 0 0 0 0 0 0].' ); %! assert (filter (b, a, x ), [1 0 0 0 0 0 0 0 0 0] ); %! assert (filter (b, a, r*x ), r*[1 0 0 0 0 0 0 0 0 0] ); %!shared a, b, x, y, so %!test %! a = [1,1]; %! b = [1,1]; %! x = zeros (1,10); x(1) = 1; %! [y, so] = filter (b, [1], x, [-1]); %! assert (y, [0 1 0 0 0 0 0 0 0 0]); %! assert (so, 0); %!test %! x = zeros (10,3); x(1,1) = -1; x(1,2) = 1; %! y0 = zeros (10,3); y0(1:2,1) = -1; y0(1:2,2) = 1; %! y = filter (b, [1], x); %! assert (y, y0); %!test %! a = [1,1]; %! b=[1,1]; %! x = zeros (4,4,2); x(1,1:4,1) = +1; x(1,1:4,2) = -1; %! y0 = zeros (4,4,2); y0(1:2,1:4,1) = +1; y0(1:2,1:4,2) = -1; %! y = filter (b, [1], x); %! assert (y, y0); %!assert (filter (1, ones (10,1) / 10, []), []) %!assert (filter (1, ones (10,1) / 10, zeros (0,10)), zeros (0,10)) %!assert (filter (1, ones (10,1) / 10, single (1:5)), repmat (single (10), 1, 5)) %% Test using initial conditions %!assert (filter ([1, 1, 1], [1, 1], [1 2], [1, 1]), [2 2]) %!assert (filter ([1, 1, 1], [1, 1], [1 2], [1, 1]'), [2 2]) %!assert (filter ([1, 3], [1], [1 2; 3 4; 5 6], [4, 5]), [5 7; 6 10; 14 18]) %!error (filter ([1, 3], [1], [1 2; 3 4; 5 6], [4, 5]')) %!assert (filter ([1, 3, 2], [1], [1 2; 3 4; 5 6], [1 0 0; 1 0 0], 2), [2 6; 3 13; 5 21]) ## Test of DIM parameter %!test %! x = ones (2, 1, 3, 4); %! x(1,1,:,:) = [1 2 3 4; 5 6 7 8; 9 10 11 12]; %! y0 = [1 1 6 2 15 3 2 1 8 2 18 3 3 1 10 2 21 3 4 1 12 2 24 3]; %! y0 = reshape (y0, size (x)); %! y = filter ([1 1 1], 1, x, [], 3); %! assert (y, y0); */