|
3213
|
1 # Copyright (C) 1996,1998 A. Scottedward Hodel |
|
|
2 # |
|
|
3 # This file is part of Octave. |
|
|
4 # |
|
|
5 # Octave is free software; you can redistribute it and/or modify it |
|
|
6 # under the terms of the GNU General Public License as published by the |
|
|
7 # Free Software Foundation; either version 2, or (at your option) any |
|
|
8 # later version. |
|
|
9 # |
|
|
10 # Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
11 # ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
12 # FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
13 # for more details. |
|
|
14 # |
|
|
15 # You should have received a copy of the GNU General Public License |
|
|
16 # along with Octave; see the file COPYING. If not, write to the Free |
|
|
17 # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
18 |
|
|
19 function [num,den] = zp2tf(zer,pol,k) |
|
|
20 # [num,den] = zp2tf(zer,pol,k) |
|
|
21 # Converts zeros / poles to a transfer function. |
|
|
22 # |
|
|
23 # Inputs: |
|
|
24 # zer, pol: vectors of (possibly complex) poles and zeros of a transfer |
|
|
25 # function. Complex values should appear in conjugate pairs |
|
|
26 # k: real scalar (leading coefficient) |
|
|
27 # Forms the transfer function num/den from |
|
|
28 # the vectors of poles and zeros. K is a scalar gain associated with the |
|
|
29 # zeros. |
|
|
30 |
|
|
31 # Find out whether data was entered as a row or a column vector and |
|
|
32 # convert to a column vector if necessary |
|
|
33 # Written by A. S. Hodel with help from students Ingram, McGowan. |
|
|
34 # a.s.hodel@eng.auburn.edu |
|
3229
|
35 # $Revision: 2.0.0.2 $ |
|
3213
|
36 # |
|
|
37 |
|
|
38 [rp,cp] = size(pol); |
|
|
39 [rz,cz] = size(zer); |
|
|
40 |
|
|
41 if(!(is_vector(zer) | isempty(zer)) ) |
|
|
42 error(sprintf("zer(%dx%d) must be a vector",rz,cz)); |
|
|
43 elseif(!(is_vector(pol) | isempty(pol)) ) |
|
|
44 error(sprintf("pol(%dx%d) must be a vector",rp,cp)); |
|
|
45 elseif(length(zer) > length(pol)) |
|
|
46 error(sprintf("zer(%dx%d) longer than pol(%dx%d)",rz,cz,rp,cp)); |
|
|
47 endif |
|
|
48 |
|
|
49 num = k; den = 1; # initialize converted polynomials |
|
|
50 |
|
|
51 # call zp2ssg2 if there are complex conjugate pairs left, otherwise |
|
|
52 # construct real zeros one by one. Repeat for poles. |
|
|
53 while(!isempty(zer)) |
|
|
54 if( max(abs(imag(zer))) ) [poly,zer] = zp2ssg2(zer); |
|
|
55 else poly = [1 -zer(1)]; |
|
|
56 zer = zer(2:length(zer)); endif |
|
|
57 num = conv(num,poly); |
|
|
58 endwhile |
|
|
59 |
|
|
60 while(!isempty(pol)) |
|
|
61 if( max(abs(imag(pol))) ) [poly,pol] = zp2ssg2(pol); |
|
|
62 else poly = [1 -pol(1)]; |
|
|
63 pol = pol(2:length(pol)); endif |
|
|
64 den = conv(den,poly); |
|
|
65 endwhile |
|
|
66 |
|
|
67 endfunction |
