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
|
## Copyright (C) 1996 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 2, 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, write to the Free
## Software Foundation, 59 Temple Place - Suite 330, Boston, MA
## 02111-1307, USA.
## usage: fftconv (a, b [, N])
##
## c = fftconv (a, b) returns the convolution of the vectors a and b,
## a vector with length equal to length (a) + length (b) - 1.
## If a and b are the coefficient vectors of two polynomials, c is
## the coefficient vector of the product polynomial.
##
## The computation uses the FFT by calling fftfilt. If the optional
## argument N is specified, an N-point FFT is used.
## Author: KH <Kurt.Hornik@ci.tuwien.ac.at>
## Created: 3 September 1994
## Adapted-By: jwe
function c = fftconv (a, b, N)
if (nargin < 2 || nargin > 3)
usage ("fftconv (b, x [, N])");
endif
if (! (is_vector (a) && is_vector (b)))
error ("fftconv: both a and b should be vectors");
endif
la = length (a);
lb = length (b);
if ((la == 1) || (lb == 1))
c = a * b;
else
lc = la + lb - 1;
a(lc) = 0;
b(lc) = 0;
if (nargin == 2)
c = fftfilt (a, b);
else
if !(is_scalar (N))
error ("fftconv: N has to be a scalar");
endif
c = fftfilt (a, b, N);
endif
endif
endfunction
|
