[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: trivial digital filter
From: |
Willem Atsma |
Subject: |
Re: trivial digital filter |
Date: |
Thu, 04 Mar 2004 10:09:12 +0100 |
Try the "filter" function.
Willem
On Wed, 3 Mar 2004 16:21:43 +0100 (CET), "Hugo Coolens"
<address@hidden> said:
> I'm trying to simulate the following digital filter in octave:
> sys=tf([1 1],[1],1e-3)
> However this gives an error message:
> # of poles (0) < # of zeros (1)
> Which is of course clear enough but I wonder whether there is a way to
> use
> a "similar method" as the one above in octave for this kind of filter?
>
> regards,
> Hugo
>
>
> To demonstrate the filter I already simulated its behaviour in the time
> domain as follows:
> a=[1];
> b=[1 1];
> fs=1000;
> time=0:1/fs:40e-3;
> x=sin(2*pi*200*time);
> y=filter(b,a,x);
> stem(time,y)
>
>
>
> -------------------------------------------------------------
> Octave is freely available under the terms of the GNU GPL.
>
> Octave's home on the web: http://www.octave.org
> How to fund new projects: http://www.octave.org/funding.html
> Subscription information: http://www.octave.org/archive.html
> -------------------------------------------------------------
>
Pinot's web ~ www.pinot.ca
-------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.
Octave's home on the web: http://www.octave.org
How to fund new projects: http://www.octave.org/funding.html
Subscription information: http://www.octave.org/archive.html
-------------------------------------------------------------