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
|
function [xh]=hilb(n,wtype,par)
//<xh>=hilb(n[,wtype][,par])
//returns the first n points of the
//Hilbert transform centered around the origin.
//That is, xh=(2/(n*pi))*(sin(n*pi/2))**2.
//Window type and window parameters are optional.
// n :Number of points in filter (must be odd)
// wtype :window type ('re','tr','hn','hm','kr','ch')
// : default wtype='re'
// par :window parameter for wtype='kr' or 'ch'
// : default par=<0 0>
// :see the macro window for more help
// xh :Hilbert transform
//
//!
// author: C. Bunks date: 3 Jan 1989
// Copyright INRIA
[lhs,rhs]=argn(0);
if rhs==1 then,
wtype='re';
par=[0 0];
else if rhs==2 then,
par=[0 0];
end,
end,
if int(n/2)==n/2 then,
error('Error---Filter length must be odd')
end,
no2=(n-1)/2;
th=0*ones(1,no2);
th(1:2:no2)=ones(1:2:no2)./(1:2:no2);
xh=[-th(no2:-1:1),0,th];
xh=2*xh/%pi;
[win_l,cwp]=window(wtype,n,par);
xh=xh.*win_l;
|
