1 // Author: Aime' Fournier
2 // E-mail: fournier@ucar.edu
4 #include "qf.h" // Data structs and function prototypes.
7 void PrintFilter(int nam
,int ran
,int kin
,pqf
*f
) {
11 if( kin
==0 ) fse
=sqrt(2.);
12 else if( kin
==1 ) fse
=0.;
14 printf("Filter %s%02d[%d] has alpha=%d, omega=%2d, f={",nam
,ran
,kin
,f
->alpha
,f
->omega
);
15 for( k
=f
->alpha
; k
<=f
->omega
; k
++ ) {
16 printf(" %10.6f",f
->f
[k
]);
19 printf("} and sum-error %9.2e.\n",fs
-fse
);