File: dmt.man

package info (click to toggle)
scilab 2.4-1
  • links: PTS
  • area: non-free
  • in suites: potato, slink
  • size: 55,196 kB
  • ctags: 38,019
  • sloc: ansic: 231,970; fortran: 148,976; tcl: 7,099; makefile: 4,585; sh: 2,978; csh: 154; cpp: 101; asm: 39; sed: 5
file content (108 lines) | stat: -rw-r--r-- 1,932 bytes parent folder | download
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
.TH "dmt" 2 " June 6th 1997" "Fractales Group" "Scilab Function"
.so ../sci.an
.SH NAME
dmt - Discrete Mellin transform of a vector
.sp
Author: Paulo Goncalves
.sp
Computes the Fast Mellin transform of a signal.
.sp
.sp
.SH Usage
\f(CR[\fPmellin,beta\f(CR]\fP = dmt(s,\f(CR[\fPfmin,fmax,N\f(CR]\fP) 
.SH Input parameters


.RS

.TP
o 
\fBs\fP : real vector \f(CR[\fP1,nt\f(CR]\fP or \f(CR[\fPnt,1\f(CR]\fP
Time samples of the signal to be transformed. 

.TP
o 
\fBfmin\fP : real scalar in \f(CR[\fP0,0.5\f(CR]\fP
Lower frequency bound of the signal

.TP
o 
\fBfmax\fP :  real scalar \f(CR[\fP0,0.5\f(CR]\fP and \fIfmax\fP \f(CR>\fP 
Upper frequency bound of the  signal

.TP
o 
\fBN\fP : positive integer. 
number of Mellin samples.
.RE

.SH Output parameters


.RS

.TP
o 
\fBmellin\fP : complex vector \f(CR[\fP1,N\f(CR]\fP
Mellin transform of \fIs\fP.

.TP
o 
\fBbeta\fP : real vector \f(CR[\fP1,N\f(CR]\fP
Variable of the Mellin transform \fImellin\fP.
.RE

.SH Description
.SH Parameters


.RS

.TP
o 
\fIs\fP : signal to be transformed. Real or complex vector. 

.TP
o 
\fIfmin\fP : lower frequency bound of the analysis. \fIfmin\fP is
real scalar comprised in  \f(CR[\fP0,0.5\f(CR]\fP

.TP
o 
\fIfmax\fP : upper frequency bound of the analysis. \fIfmax\fP is
a real scalar comprised in \f(CR[\fP0,0.5\f(CR]\fP and \fIfmax\fP \f(CR>\fP
\fIfmin\fP

.TP
o 
\fIN\fP : number of Mellin samples. This number must be greater
than some ammount determined by the spectral extent of the signal, to
avoid aliasing in the Mellin domain.
.RE

.SH Algorithm details
The fast Mellin transform can be simply interpreted as a FFT applied
to a geometrically sampled vector. 
.SH See also:
idmt, dilate
.SH Example:
\fI Signal synthesis \fP 
.sp
.ft CR
.nf
x = morlet(0.1,32) ;
plot(x)
.fi 
.ec
.ft P
.sp
\fI Computation of the Mellin transform\fP 
.sp
.ft CR
.nf
[mellin,beta] = dmt(x,0.01,0.5,128) ;
plot(beta,abs(mellin))
.fi 
.ec
.ft P
.sp