Mercurial > octave
view libinterp/corefcn/filter.cc @ 21301:40de9f8f23a6
Use '#include "config.h"' rather than <config.h>.
* mk-octave-config-h.sh, mk-opts.pl, Backend.cc, BaseControl.cc,
ButtonControl.cc, Canvas.cc, CheckBoxControl.cc, Container.cc, ContextMenu.cc,
EditControl.cc, Figure.cc, FigureWindow.cc, GLCanvas.cc, KeyMap.cc,
ListBoxControl.cc, Logger.cc, Menu.cc, MouseModeActionGroup.cc, Object.cc,
ObjectFactory.cc, ObjectProxy.cc, Panel.cc, PopupMenuControl.cc,
PushButtonControl.cc, PushTool.cc, QtHandlesUtils.cc, RadioButtonControl.cc,
SliderControl.cc, TextControl.cc, TextEdit.cc, ToggleButtonControl.cc,
ToggleTool.cc, ToolBar.cc, ToolBarButton.cc, __init_qt__.cc,
annotation-dialog.cc, gl-select.cc, module.mk, kpty.cpp, color-picker.cc,
dialog.cc, documentation-dock-widget.cc, files-dock-widget.cc,
find-files-dialog.cc, find-files-model.cc, history-dock-widget.cc,
file-editor-tab.cc, file-editor-tab.h, file-editor.cc, find-dialog.cc,
marker.cc, octave-qscintilla.cc, octave-txt-lexer.cc, main-window.cc,
octave-cmd.cc, octave-dock-widget.cc, octave-gui.cc, octave-interpreter.cc,
octave-qt-link.cc, parser.cc, webinfo.cc, resource-manager.cc,
settings-dialog.cc, shortcut-manager.cc, terminal-dock-widget.cc,
thread-manager.cc, welcome-wizard.cc, workspace-model.cc, workspace-view.cc,
build-env-features.sh, build-env.in.cc, Cell.cc, __contourc__.cc,
__dispatch__.cc, __dsearchn__.cc, __ichol__.cc, __ilu__.cc, __lin_interpn__.cc,
__pchip_deriv__.cc, __qp__.cc, balance.cc, besselj.cc, betainc.cc, bitfcns.cc,
bsxfun.cc, c-file-ptr-stream.cc, cdisplay.c, cellfun.cc, coct-hdf5-types.c,
colloc.cc, comment-list.cc, conv2.cc, daspk.cc, dasrt.cc, dassl.cc, data.cc,
debug.cc, defaults.cc, defun.cc, det.cc, dirfns.cc, display.cc, dlmread.cc,
dot.cc, dynamic-ld.cc, eig.cc, ellipj.cc, error.cc, errwarn.cc, event-queue.cc,
fft.cc, fft2.cc, fftn.cc, file-io.cc, filter.cc, find.cc, ft-text-renderer.cc,
gammainc.cc, gcd.cc, getgrent.cc, getpwent.cc, getrusage.cc, givens.cc,
gl-render.cc, gl2ps-print.cc, graphics.cc, gripes.cc, hash.cc, help.cc,
hess.cc, hex2num.cc, hook-fcn.cc, input.cc, inv.cc, jit-ir.cc, jit-typeinfo.cc,
jit-util.cc, kron.cc, load-path.cc, load-save.cc, lookup.cc,
ls-ascii-helper.cc, ls-hdf5.cc, ls-mat-ascii.cc, ls-mat4.cc, ls-mat5.cc,
ls-oct-binary.cc, ls-oct-text.cc, ls-utils.cc, lsode.cc, lu.cc, luinc.cc,
mappers.cc, matrix_type.cc, max.cc, mex.cc, mgorth.cc, nproc.cc,
oct-errno.in.cc, oct-fstrm.cc, oct-hdf5-types.cc, oct-hist.cc, oct-iostrm.cc,
oct-lvalue.cc, oct-map.cc, oct-prcstrm.cc, oct-procbuf.cc, oct-stream.cc,
oct-strstrm.cc, oct-tex-lexer.in.ll, oct-tex-parser.in.yy, octave-link.cc,
ordschur.cc, pager.cc, pinv.cc, pr-output.cc, procstream.cc, profiler.cc,
psi.cc, pt-jit.cc, quad.cc, quadcc.cc, qz.cc, rand.cc, rcond.cc, regexp.cc,
schur.cc, sighandlers.cc, siglist.c, sparse-xdiv.cc, sparse-xpow.cc, sparse.cc,
spparms.cc, sqrtm.cc, str2double.cc, strfind.cc, strfns.cc, sub2ind.cc, svd.cc,
sylvester.cc, symtab.cc, syscalls.cc, sysdep.cc, text-renderer.cc, time.cc,
toplev.cc, tril.cc, tsearch.cc, txt-eng.cc, typecast.cc, urlwrite.cc, utils.cc,
variables.cc, xdiv.cc, xgl2ps.c, xnorm.cc, xpow.cc, zfstream.cc,
__delaunayn__.cc, __eigs__.cc, __fltk_uigetfile__.cc, __glpk__.cc,
__init_fltk__.cc, __init_gnuplot__.cc, __magick_read__.cc, __osmesa_print__.cc,
__voronoi__.cc, amd.cc, audiodevinfo.cc, audioread.cc, ccolamd.cc, chol.cc,
colamd.cc, convhulln.cc, dmperm.cc, fftw.cc, qr.cc, symbfact.cc, symrcm.cc,
mkbuiltins, mkops, ov-base-diag.cc, ov-base-int.cc, ov-base-mat.cc,
ov-base-scalar.cc, ov-base-sparse.cc, ov-base.cc, ov-bool-mat.cc,
ov-bool-sparse.cc, ov-bool.cc, ov-builtin.cc, ov-cell.cc, ov-ch-mat.cc,
ov-class.cc, ov-classdef.cc, ov-colon.cc, ov-complex.cc, ov-cs-list.cc,
ov-cx-diag.cc, ov-cx-mat.cc, ov-cx-sparse.cc, ov-dld-fcn.cc, ov-fcn-handle.cc,
ov-fcn-inline.cc, ov-fcn.cc, ov-float.cc, ov-flt-complex.cc, ov-flt-cx-diag.cc,
ov-flt-cx-mat.cc, ov-flt-re-diag.cc, ov-flt-re-mat.cc, ov-int16.cc,
ov-int32.cc, ov-int64.cc, ov-int8.cc, ov-java.cc, ov-lazy-idx.cc,
ov-mex-fcn.cc, ov-null-mat.cc, ov-oncleanup.cc, ov-perm.cc, ov-range.cc,
ov-re-diag.cc, ov-re-mat.cc, ov-re-sparse.cc, ov-scalar.cc, ov-str-mat.cc,
ov-struct.cc, ov-typeinfo.cc, ov-uint16.cc, ov-uint32.cc, ov-uint64.cc,
ov-uint8.cc, ov-usr-fcn.cc, ov.cc, ovl.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-dm-template.cc, op-dms-template.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-pm-template.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, lex.ll, oct-parse.in.yy,
pt-arg-list.cc, pt-array-list.cc, pt-assign.cc, pt-binop.cc, pt-bp.cc,
pt-cbinop.cc, pt-cell.cc, pt-check.cc, pt-classdef.cc, pt-cmd.cc, pt-colon.cc,
pt-const.cc, pt-decl.cc, pt-eval.cc, pt-except.cc, pt-exp.cc, pt-fcn-handle.cc,
pt-funcall.cc, pt-id.cc, pt-idx.cc, pt-jump.cc, pt-loop.cc, pt-mat.cc,
pt-misc.cc, pt-pr-code.cc, pt-select.cc, pt-stmt.cc, pt-unop.cc, pt.cc,
token.cc, Array-jit.cc, Array-os.cc, Array-sym.cc, Array-tc.cc, version.cc,
Array-C.cc, Array-b.cc, Array-ch.cc, Array-d.cc, Array-f.cc, Array-fC.cc,
Array-i.cc, Array-idx-vec.cc, Array-s.cc, Array-str.cc, Array-util.cc,
Array-voidp.cc, Array.cc, CColVector.cc, CDiagMatrix.cc, CMatrix.cc,
CNDArray.cc, CRowVector.cc, CSparse.cc, DiagArray2.cc, MArray-C.cc,
MArray-d.cc, MArray-f.cc, MArray-fC.cc, MArray-i.cc, MArray-s.cc, MArray.cc,
MDiagArray2.cc, MSparse-C.cc, MSparse-d.cc, MatrixType.cc, PermMatrix.cc,
Range.cc, Sparse-C.cc, Sparse-b.cc, Sparse-d.cc, Sparse.cc, boolMatrix.cc,
boolNDArray.cc, boolSparse.cc, chMatrix.cc, chNDArray.cc, dColVector.cc,
dDiagMatrix.cc, dMatrix.cc, dNDArray.cc, dRowVector.cc, dSparse.cc,
dim-vector.cc, fCColVector.cc, fCDiagMatrix.cc, fCMatrix.cc, fCNDArray.cc,
fCRowVector.cc, fColVector.cc, fDiagMatrix.cc, fMatrix.cc, fNDArray.cc,
fRowVector.cc, idx-vector.cc, int16NDArray.cc, int32NDArray.cc,
int64NDArray.cc, int8NDArray.cc, intNDArray.cc, uint16NDArray.cc,
uint32NDArray.cc, uint64NDArray.cc, uint8NDArray.cc, blaswrap.c, cquit.c,
f77-extern.cc, f77-fcn.c, lo-error.c, quit.cc, CollocWt.cc, DASPK.cc, DASRT.cc,
DASSL.cc, EIG.cc, LSODE.cc, ODES.cc, Quad.cc, aepbalance.cc, chol.cc,
eigs-base.cc, fEIG.cc, gepbalance.cc, hess.cc, lo-mappers.cc, lo-specfun.cc,
lu.cc, oct-convn.cc, oct-fftw.cc, oct-norm.cc, oct-rand.cc, oct-spparms.cc,
qr.cc, qrp.cc, randgamma.c, randmtzig.c, randpoisson.c, schur.cc,
sparse-chol.cc, sparse-dmsolve.cc, sparse-lu.cc, sparse-qr.cc, svd.cc,
mk-ops.awk, dir-ops.cc, file-ops.cc, file-stat.cc, lo-sysdep.cc, mach-info.cc,
oct-env.cc, oct-group.cc, oct-passwd.cc, oct-syscalls.cc, oct-time.cc,
oct-uname.cc, cmd-edit.cc, cmd-hist.cc, data-conv.cc, f2c-main.c,
glob-match.cc, kpse.cc, lo-array-errwarn.cc, lo-array-gripes.cc, lo-cutils.c,
lo-ieee.cc, lo-regexp.cc, lo-utils.cc, oct-base64.cc, oct-glob.cc,
oct-inttypes.cc, oct-locbuf.cc, oct-mutex.cc, oct-rl-edit.c, oct-rl-hist.c,
oct-shlib.cc, oct-sort.cc, pathsearch.cc, singleton-cleanup.cc, sparse-sort.cc,
sparse-util.cc, str-vec.cc, unwind-prot.cc, url-transfer.cc,
display-available.c, main-cli.cc, main-gui.cc, main.in.cc, mkoctfile.in.cc,
octave-config.in.cc:
Use '#include "config.h"' rather than <config.h>.
author | Rik <rik@octave.org> |
---|---|
date | Thu, 18 Feb 2016 13:34:50 -0800 |
parents | fcac5dbbf9ed |
children | 3d60ed163b70 |
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 "ovl.h" template <typename 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"); dim_vector x_dims = x.dims (); if (dim < 0 || dim > x_dims.length ()) error ("filter: DIM must be a valid dimension"); 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"); if (si_dims.length () != x_dims.length ()) error ("filter: dimensionality of SI and X must agree"); 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"); } 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"); } 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; } template <typename 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) dim = x_dims.first_non_singleton (); else if (dim > x_dims.length ()) error ("filter: DIM must be a valid dimension"); 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, , "-*- texinfo -*-\n\ @deftypefn {} {@var{y} =} filter (@var{b}, @var{a}, @var{x})\n\ @deftypefnx {} {[@var{y}, @var{sf}] =} filter (@var{b}, @var{a}, @var{x}, @var{si})\n\ @deftypefnx {} {[@var{y}, @var{sf}] =} filter (@var{b}, @var{a}, @var{x}, [], @var{dim})\n\ @deftypefnx {} {[@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") { int nargin = args.length (); if (nargin < 3 || nargin > 5) print_usage (); 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"); } else dim = x_dims.first_non_singleton (); octave_value_list 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"; 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)); retval = ovl (y, si); } 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)); retval = ovl (y, si); } } 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)); retval = ovl (y, si); } 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)); retval = ovl (y, si); } } 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); */