SlideShare a Scribd company logo
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
DOI: 10.5121/sipij.2021.12502 21
MIXED SPECTRA FOR STABLE SIGNALS
FROM DISCRETE OBSERVATIONS
Rachid Sabre
Biogeosciences (UMR CNRS/uB 6282),
University of Burgundy, 26, Bd Docteur Petitjean, Dijon, France
ABSTRACT
This paper concerns the continuous-time stable alpha symmetric processes which are inivitable in the
modeling of certain signals with indefinitely increasing variance. Particularly the case where the spectral
measurement is mixed: sum of a continuous measurement and a discrete measurement. Our goal is to
estimate the spectral density of the continuous part by observing the signal in a discrete way. For that, we
propose a method which consists in sampling the signal at periodic instants. We use Jackson's polynomial
kernel to build a periodogram which we then smooth by two spectral windows taking into account the
width of the interval where the spectral density is non-zero. Thus, we bypass the phenomenon of aliasing
often encountered in the case of estimation from discrete observations of a continuous time process.
KEYWORDS
Spectral density, stable processes, periodogram, smoothing estimate, aliasing.
1. INTRODUCTION
The multiple applications where the random signals whose variance increases indefinitely impose
the interest of using stable alpha processes by several research authors in various fields. In
particular, Stable symmetric harmonizable processes and their properties have been widely
studied by many authors such as [1] - [10] to name a few.
Concrete applications of stable symmetric processes cover a wide spectrum of fields such as:
physics, biology, electronics and electricity, hydrology, economics, communications and radar
applications., ...ect. See: [11]-[22]. In this paper we consider a symmetric alpha stable
harmonizable process = { ( ): }
X X t t R
 . Alternatively X has the integral representation:
 
( ) = exp ( ) ( )
X t i t d
  
 (1)
where 1< < 2
 and  is a complex valued symmetric  -stable random measure on R with
independent and isotropic increments. The control measure is defined by ( ) =| ( ) |
m A A 

 (see
[4]) is called spectral measure. The estimation of the spectral density function was already
studied in different cases: by E.Masry and S.Combanis [4] when the time of the process is
continuous, by Sabre [23] when the time of the process is discrete and by R.Sabre [24]-[25]when
the time of the process is p-adic.
In this paper we consider a general case where the spectral measure is the sum of an absolutely
continuous measure with respect to Lebesgue measure and a discrete measure:
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
22
=1
( ) = ( )
q
i wi
i
d x dx c
   
+ 
where  is a Dirac measure, the specral density  is nonnegative integrable and bounded
function. i
c is an unknown positive real number and i
w is an unknown real number. Assume
that 0
i
w  . The discrete measurement comes from the repeated random energy jumps during the
experimental measurements. Spectral density represents the distribution of the energy carried by
the signal.
Our objective is to propose a nonparametric estimator of the spectral density after discrete
sampling of the process ( )
X t . This work is motivated by the fact that in practice it is impossible
to observe the process over a continuous time interval. However, we sampled the process at
equidistant times, i.e., =
n
t n , > 0
 . It is known that aliasing of  occurs. For more details
about aliasing phenomenon, see [26]. To avoid this difficulty, we suppose that the spectral
density  is vanishing for | |>
  where  is a nonnegative real number. We create an
estimate of the spectral density based on smoothing methods. We show that it is asymptotically
unbiased and consistent.
Briefly, the organization of this paper will be as follows: in the second section two technical
lemmas will be presented as well as a preiodogram and we will show that this periodogram is an
asymptotically unbiased but inconsistent estimator. In the third section, the periodogram will be
smoothed by two well chosen spectral windows to estimate the spectral density at the jump
points. We show that the smoothing periodogram is a consistent estimator. The fourth section
gives conclusions and working perspectives.
2. THE PERIODOGRAM AND ITS PROPRIETIES
In this section we give some basic notations and properties of the Jackson's polynomial kernel.
Let N is the size of sample of X . Let k and n are the numbers satisfying:
1
1= 2 ( 1)
2
N k n with n N k N
 
− −     
 
if
1
=
2
k then 1 1
= 2 1,
n n n N
−  .
The Jackson's polynomial kernel is defined by: ( )
( ) = ( )
N
N N
H A H


  where
2 2
( )
,
,
sin sin
1 1
2 2
( ) = = .
2
sin sin
2 2
k k
N
k n
k n
n n
H with q d
q


 
 
 
 −
   
   
   
   
   

where
1
,
= ( )
N N
A B 

−
with ( )
, = ( ) .
N
N
B H d
 
 
 
−

We cite two lemmas which are used in this paper. Their proof are given in [23].
Lemma 2.1 There is a non negative function k
h such as:
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
23
( 1)
( )
= ( 1)
( ) = cos( )
k n
N
k
m k n
m
H h m
n
 
−
− −
 
 
 

Lemma 2.2 Let
2
, ,
sin
2
= = | | | ( ) | ,
sin
2
k
N N N
n
B d and J u H u du

 
 
 
 



− −
   where
]0,2],
  then
2
2 1
,
2 1
2
2 0 < < 2
4 1
< < 2
2 1 2
k
k
N
k
n if
B
k
n if
k k




 

 


−
−
  

  
  
 

 −

and
2
2 2 1
, 2
2
1 1 1
< <
2 ( 2 1) 2 2
2 1 1
< < 2
2 ( 1)(2 1) 2
k
k k
N k
k
if
k n k k
J
k
if
k n k
 
 
  
 
 

 
 

  
+
−
+
 +
 − +

 
+

 + − −

This paragraph gives a periodogram and develops its proprieties. Consider the process ( ),
X t
defined in (1), observed at instants =
j
t j , =1,2,...
j N and
2
=



, where  is a real
number strictly greater than 2 . Define the periodogram ˆ
N
I on ] , [
−   as follows:
( )
,
ˆ ( ) = | | , 0 < <
2
p
N p N
I C I p


 
Where
1 = ( 1)
= ( 1)
( ) = [ ] e[ exp{ ( )} ( ( 1) )],
' '
n k n
' '
N N k
'
n k n
n
I A R h i n X n k n
n

    
−
− −
 
− + −
 
 

The normalisation constant ,
p
C  is given by , /
,
=
[ ]
p
p p
p
D
C
F C
 
 
, with
| |
,
1 1
1 cos( ) 1
= a =
| | | |
a
u
p p
p p
u e
D du nd F du
u u

−
 
+ +
− −
− −
  .
Lemma 2.3
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
24
The characteristic function of ( )
N
I  ,  
exp ( )
N
E irI  , converges to
,1 ,2
exp[ | | ( ( ) ( )].
N N
C r 
    
− + where
( )
,1( ) = | |
N N
y
H y dy



   

−
 
−  
 
 and ,2
=1
( ) = ( )
q
N i N i
i
c H w

  
−

Proof
From (1) and the expression of N
I , we have:
   
1 = ( 1)
= ( 1)
( ) = [ ] e exp [ ( )] exp [ ( 1)] ( ).
' '
n k n
'
N N k
R
'
n k n
n
I A R h i n u i uk n d u
n

     
−
− −
 
− −
 
 


Using [1] and the definition of the Jackson polynomial kernel we obtain that the characteristic
function is the form:
 
exp ( ) = exp | | ( ) .
a
N a N
E irI C r
  
 
−
  (2)
where ,1 ,2
( ) = ( ) ( )
N N N
     
+ with
( )
,1( ) = | |a
N N
R
v
H v dv
   

 
−  
 
 and ,2
=1
( ) = ( )
q
N i N i
i
c H w

  
−

( )
,1( ) = | |a
N N
R
v
H v dv
   

 
−  
 
 ( )
(2 1)
(2 1)
= | | .
j
a
N
j
j Z
v
H v dv


 

+
−

 
−  
 

Putting = 2
v y j

− and using the fact that N
H is 2 -periodic, we get
( )
( ) = | | ( ) ,
a
N N j
j Z
H y y dy


   
 −
−
  where
2
( ) = .
j
y
y j

 
 
 
−
 
 
Let j be an integer
such that
2
< <
y j


−
−  . Since <
 
 and | |<
y  , we get
1
| |< <1
2 2
j



+ and then
= 0
j . Therefore
( )
,1( ) = | | .
N N
y
H y dy



   

−
 
−  
 
 (3)
Theorem 2.4 Let < <

−  then ( )
ˆ ( ) = ,
p
N N
E I 
  
   
 
 
Proof
From the following equality used in [4], for all real x and 0 < < 2
p ,
1 1
1 1
1 cos( ) 1
| | = = e ,
| | | |
ixu
p
p p
p p
xu e
x D du D R du
u u
 
− −
+ +
− −
− −
  (4)
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
25
and replacing x by N
I , we obtain
/ 1
,
1 exp{ ( )}
1
ˆ ( ) = e ,
[ ] | |
N
N p p
p a
iuI
I R du
F C u





+
−
−
 (5)
The equation (5) and the definition of the , ,
p
F  give
 
 
/ 1
,
/
1 exp | | ( )
1
ˆ ( ) = .
[ ] | |
= ( ) .
a N
N p p
R
p a
p
N
C u
EI du
F C u




 

 
+
− −

3. SMOOTHING PERIODOGRAM
In order to obtain a consistent estimate of [ ( )]
p

  , we smooth the periodogram via spectral
windows depending on whether  is a jump point or not( )
i
w
  .
(1)
1 2
(2) (1)
( ) { , , , }
( ) = ( ) ( )
1
N q
N N N
f if w w w
f f cf
else
c
 
  
 

 −

−

where (1) (1) ˆ
( ) = ( ) ( )
N N N
f W u I u du


 
−
−
 and (2) (2) ˆ
( ) = ( ) ( ) .
N N N
f W u I u du


 
−
−

The spectral windows (1)
N
W and (2)
N
W are defined by: (1) (1) (1)
( ) = ( )
N N N
W x M W M x and
(2) (2)) (2)
( ) = ( )
N N N
W x M W M x with W is an even nonnegative, continuous function , vanishing for
| |>1
 such that
1
1
( ) =1
W u du
−
 . The bandwidths (1)
)
N
M and (2)
)
N
M satisfying:
(2)
(1)
N
N
M
c
M
=
( )
lim
i
N N
M
→ = +,
( )
= 0
lim
i
N
N
M
N
→ for 1,2
i = ,
(2)
(1)
= 0
lim
N
N
N
M
M
→+ and such that
(2) (1)
(1) (1)
1 1
( ) = ( ) ,
N N
N N
W M W M
M M
  
 
  −
 
 
.
Th following theorem shows that ( )
N
f  is an asymptotically unbiased estimator of [ ( )]
p

  for
< <

−  and 1 2
{ , , , }
q
w w w
  .
Theorem 3.1
Let < <

− , such that 1 2
{ , , , }
q
w w w
  . Then,     ( )
( ) ( ) = o 1 .
p
N
E f 
  
−
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
26
If  satisfies the hypothesis ( ) ( ) ( ) ,
x y cste x y

 
−
−  − with < 2 1
k
  − , then,
 
(2 1) (1)
(1) (2 1) (1) 2 1
1 1
= 0
( ) [ ( )] = .
1 1 1
= 0
k
p
N
N
k k
N N
O if
n M
E f
O if
M n M n
 

  

  

−
− −
  
+
  
  
− 
 
 + +
 

 

Proof
It is easy to see that:
  (1) (1) ˆ
( ) = ( ) ( ) .
N N N N
R
E f M W M u E I u du
   
 
−
   

Let (1)
( ) =
N
M u v
 − , we obtain:
1
(1)
1
[ ( )] = ( ) .
p
N N
N
v
E f W v dv
M

  
−
 
 
−
 
 
 
 
 (7)
Since
1
1
( ) =1
W u du
−
 and the inequality (3), we get:
   
1
(1)
1
( ) ( ) ( ) ( ) .
p
p
N N
N
v
E f W v dv
M


      
−
 
−  − −
 
 

As < 1
p

, we obtain
,1 ,2
(1) (1) (1)
( ) ( ) |
p p p
N N N
N N N
v v v
M M M
  
         
     
− −  − − + −
     
     
We now examine the limit of ,1 (1)
N
N
v
M
 
 
−
 
 
. From (3) we get:
,1 (1) (1)
= .
N N
N N
v v u
H u du
M M

    


−
 
     
− − −
 
     
   
   
 

Let (1)
=
N
v
u y
M
 
 
− −
 
 
, we obtain:
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
27
,1 (1) (1)
(2 1)
(1)
(2 1)
= ( )
= ( ) .
N N
R
N N
j
N
j
j Z N
v v y
H y dy
M M
v y
H y dy
M

 

   

 

+
−

   
− − +
   
   
 
− +
 
 

 (8)
Let 2 =
y j s

− . Since | (.) |
N
H 
is 2 −periodic function, we get
,1 (1) (1)
2
= ( ) .
N N
j Z
N N
v v s
H s j ds
M M
 


   
 
+
−

   
− − + +
   
   

The function  is uniformly continuous on [ , ]
−  and since | |
N
H 
is a kernel, the right hand
side of the last equality converges to
2
.
j Z
j

 


 
+
 
 
 Let j be an integer such that
2
< <
j
 

+
− . The definition of  implies that | |<| |<
  
 . It is easy to see that
| |< 1
j and then = 0
j . Since (1)
N
H is a kernel, we obtain that ,1 (1)
N
N
v
M
 
 
−
 
 
converges to
( )
  . On the other hand, (1)
,2 (1) (1)
=1
=
q
N N i
i
N N
v v
H w
M M

   
 
   
− − −
 
   
 
   
 

Since i
w is different from  and from the lemma 2.2, we get
1
2 (1)
2 1
,2 (1)
=1
2 1
2 , where cte =inf sin .
2
k i
q
N
k
N i
i
N
v
w
M
v
n c
M cte



 
  

−
−
 
 
− −
 
 
 
     
 
−   
     
 
 
     
 
 

Therefore, ,2 (1) 2 1
1
=
N k
N
v
O
M n 
  −
   
−
   
 
 
. Thus, we have    
( ) ( ) = (1).
p
N
E f o

  
−
The rate of convergence:
Assume that the spectral density  satisfies the hypothesis H . Let
/
=| ( ( )) |=| [ ( )] [ ( )] |
p
N N
F Bias f E f 
   
− . It follows that
1
1
1
(1) (1)
1
( ) [ ( )] ( ) .
2
p
p
N N
N N
p v v
F W v dv
M M


       

−
−
−
 
 
   
 
 − + − −
 
   
 
   
 
 
 

Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
28
Since N
N
v
M
 
 
−
 
 
converges to ( )
  , in order to study the rate of the convergence for F
we examine the rate of convergence of
1
(1)
1
( ) ( )
N
N
v
W v dv
M
   
−
 
− −
 
 
 . Indeed, from (3), we
obtain (1) (1)
= | | .
N N
N N
v v y
H y dy
M M




   

−
     
− − +
     
 
   

Let ( ) (1)
, = ( )
N N
N
v
M
     
 
 − −
 
 
. Putting (1)
=
N
v
t y
M


 
− − +
 
 
and using the condition
H , we get ( ) ( )
(1)
1 (1)
(1)
, .
v
MN
v
N N
N
MN
v t
C H t dt
M
 
 


 
 

− +
− −
  +

We can maximize as follows:
( )
1 1
1 (1)
1 1
1
(1)
1
1
1
1 (1)
1
( ) ( , ) 2 ( ) | |
2 ( )
N
N
v
MN
v N
MN
W v dv C W v v dv
M
C
W v H t t dtdv

 

 
 


   
 

− −
− +
− − −
 
+
 
 
The second integral of the right hand side is bounded as follows:
( ) ( )
( )
( )
(1)
| | | |
(1)
(1)
| | | |
(1)
.
v
MN
v
v N N
M
M N
N
N
v
MN
N
H t t dt H t t dt
H t t dt
H t t dt

 

 
 


 
 
  


 
 

− +
−
− − −
− −
−
+ +

+
+
 


(9)
Since | (.) |
N
H is even, the first and the last integrals in the right hand side of (9) are equal. As
N
v
M

converges to zero and < <
  
 , for a large N we have:
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
29
( ) ( )
| | | | | | | |
(1) (1)
(1)
2
,
(1)
(2 )
| |
(2 )
sin | |
v v
M M
N N
N N
N
k
'
N
N
H t t dt H t dt
M
B
M
 
   
 
 
 








 
+ + + +

+

 
+ +
 
 
 
The lemma 2.1 gives:
( )
2 1
| | | |
(1)
(1) 2 1
1
O 0,
=
1
O = 0,
k
v
MN
N
k
N
if
n
H t t dt
if
M n


 
 




−
+ +
−
  

  
 




 
  
  


Thus, we obtain the result of the theorem.
Theorem 3.2. Let  a real nuber belonging to ] , [
−   , and = i
w
 . Choose k such that
( )
2
(1)
2 1
= 0
lim
k
N
N k
M
n


→ −
. Then,
i) [ ( )] [ ( )] = (1)
p
N
E f o

  
−
ii) If  satisfiies the hypothesis ( ) ( ) ( ) ,
x y cste x y

 
−
−  − with
1
< < 2
2k


+
, then
( )
( )
( )
2
(1)
2 1
(2)
2
(1)
(2) 2 1
1
0 < 1
[ ( )] [ ( )] =
1
1< 2
k
N
k
p
N
N k
N
k
N
M
O if
n
M
E f
M
O if
M n

 




  

−
−
  
  
+ 
  
  
− 
 

 
 + 
 

 

Proof :
The form of estimator gives:
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
30
(2)
(2) (1)
(1)
(2)
(1)
( ) ( )
[ ( )] = [ ( )]
1
N
N N p
N
N N
N
N
M
W u W u
M
E f u du
M
M



 
 
−
− − −
−

1 1
(1) (1)
1
1 1 2 3
(1)
(1)
[ ( )] =
M M
N N
N
M
M N
N
E f E E E
 

 


− +
− +
−
+ + = + +
  
Put
1
(2) (2) (1)
(1)
1
2 (2)
(1)
(1)
[ ] [ ]
= , = [ ( )] .
1
p
N n N
MN
N
N
MN
N
M W M v W M v
u v E v dv
M
M

  
−
 
−
 
− −
−
 Therefore 2 0
E =
for a large N.
1
(2) (1)
(2)
1 (2)
(1)
= [ ( )][ ( )]
1
p
M
N N
N N
N
N
M
E W M u u du
M
M



 
−
−
− −
−

1
(2) (1)
(1)
(2)
(1)
[ ( )][ ( )]
1
p
M
N N
N N
N
N
M
W M u u du
M
M



 
−
−
−
−

Put (2)
( ) =
N
M u v
 − in the first integral and put (1)
( ) = ,
N
M u w
 − in the second integral and for
a large N, we have (1) (2)
( ) >1 ( ) >1.
N N
M et M
   
+ + As W is null outside of [ 1,1]
− , for
large N, the second integral of 1
E is zero.Therefore,
1
(2)
1 (2) (2)
(1)
(1)
1
= ( ) .
1
p
N
MN
N N
MN
N
v
E W v dv
M M
M

 
 
 
−
 
 
 
 
−
 (10)
(2) (2)
(2) (1)
1 1
3 (2) (2)
(1) (1)
(1) (1)
= [ ( )][ ( )] [ ( )][ ( )]
1 1
p p
N N
N N N N
N N
M M
N N
N N
M M
E W M u u du W M u u du
M M
M M
 
 
 
   
+ +
− − −
− −
 
Putting (2)
( ) =
N
M u v
 − in the first integral and (1)
( ) =
N
M u w
 − in the second integral, we
obtain
(2)
(2)
(1)
(1) 1
(2) (1)
3 (2) (2)
(2) (1)
( ) ( )
(1) (1)
1
= ( ) ( ) .
1 1
p p
N
MN
M N
N
N N
M M
N N
N N
N N
N N
M
M
v w
E W v dv W w dw
M M
M M
M M
 
   
   
−
−
− −
   
   
− − −
   
   
   
   
− −
 
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
31
(2) (1)
For large we have, ( ) < 1 ( ) < 1.
N N
N M and M
   
− − − −
1
(2)
3 (2) (2)
(1)
(1)
1
= ( ) .
1
p
N
MN
N N
MN
N
v
E W v dv
M M
M

 
 
 
+
 
 
 
 
−
 (11)
It is easy to show that for a large N
1
(2)
(2)
(1)
(1)
1 1
( ) = .
2
1
MN
N
MN
N
W v dv
M
M
−
 (12)
1 3
[ ( )] [ ( )] = [ ( )]
p p
N
E f E E
 
    
− + − 1 3
1 1
[ ( )] [ ( )]
2 2
p p
E E
 
   
 − + −
From (10) and (12), for a large N, we have
1
(2)
1 ,1
(2) (2) (2)
2
(1)
(1)
1 1
[ ( )] ( ) ( )
2
1
p
p
N N
MN
N N N
MN
N
v v
E W v dv
M M M
M


       
   
−  − + − −
   
   
−

As 1
p

 , we obtain
1
(2)
1 ,1
(2) (2)
(1)
(1)
1 1
[ ( )] ( ) ( )
2
1
p
p
N
MN
N N
MN
N
v
E W v dv
M M
M


     
 
−  − −
 
 
−

+
1
(2) ,2
(2) (2)
(1)
(1)
1
( ) .
1
p
N
MN
N N
MN
N
v
W v dv
M M
M

 
 
−
 
 
−

On the other hand,
1 1
(2) ,1 ,1
(2) (2)
0
(1)
( ) ( ) ( ) ( )
p p
N N
MN N N
MN
v v
W v dv W v dv
M M
 
       
   
 −   −
   
   
 
For all  belonging to ] , [
 
− ,1 (2)
N
N
v
M
 
 

 
 
converges to ( )
  , uniformly in
[ 1,1].
v − Therefore,
1
(2) ,1
(2) (2)
(1)
(1)
1
( ) ( )
1
p
N
MN
N N
MN
N
v
W v dv
M M
M

   
 
 −
 
 
−
 converge to zero.
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
32
Since = ,
i
w ,2 2
(2)
=1 ,
=
(2)
1
1
sin
2
m
N i k
m
N N
m i i m
N
q
a
v
M B v
w w
M


 

 
 
 

   
 
 −
 
 
 
 

2
,
(2)
1
.
1
sin
2
i
k
N
N
a
B v
M

 
+
  
 

 
 
 
 
For all =
m i ,
( )
2 2
[ 1,1]
(2)
1 1
= .
sup
lim
1
1 sin
sin
2
2
k k
N v
i m
i m
N
v w w
w w
M
 

→+  −    
  −
 −
   
   
 
 
Thus, for large N, we get
( )
2 2
=1 =1
, ,
= =
(2) {1,2, , } { }
1 1
.
1
1 sin
inf
sin
2
2
m m
k k
m m
N N
m i m i
i m
i m m q i
N
q q
a a
B B
v w w
w w
M
 
 


 −
 
 
 
 +
 
 
   
   
−
 −  
   
   
 
 
 
 
The lemma 2.1 gives 2 2 1
=1 ,
=
(2)
1 1
= .
1
sin
2
m
k k
m N
m i i m
N
q
a
O
B n
v
w w
M
 
 
−
 
 
  
 
 
 −
 
 
 
 
 (13)
For large N, we have ]0,1] (2) (2)
= <
supv
N N
v
M M
 


. Consequently
2
2 2
, ,
(2)
(2)
1
.
1
sin
2
k
i i
k k
N N
N
N
a a
B B v
v
M
M

 
 




 
 
 

 
 
 
 
As (1) (2) (2)
N N N
v
M M M
  
  , we obtain 2
,
(2)
1
1
sin
2
i
k
N
N
a
B v
M

 
  
 

 
 
 
 
2
2
,
(1)
.
k
i
k
N
N
a
B
M







Frome the lemma 2.2 , we obtain
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
33
( )
2
(1)
2 2 1
,
(2)
1
= .
1
sin
2
k
N
i
k k
N
N
M
a
O
B n
v
M

 
 
−
 
 
 
  
   
+ −
 
 
 
 
(14)
Therefore, we get
( )
2
(1)
1
(2) ,2
(2) (2) 2 1
(2 1)
(1)
(1)
2 1
( ) =
1
p
p
p k
N
N p k
M k
N
N N
MN
N
M
v
W v dv O
M M n
n
M
 






  −
−
 
 
 
   
 +
 
   
   
−  
 
 
 (15)
Choosing (1)
N
M such that
( )
2
(1)
2 1
k
N
k
M
n

−
converges to 0 . For example (1)
= b
N
M n with
1
0 < <1
2
b
k
− . Thus, [ ( )] [ ( )] = 0.
lim
p
N
N
E f 
  
→+
−
Theorem 4.2 Let < <

−  such that ( ) > 0
  . Then,  
( ))
N
var f  converges to zero.
If (1)
= c
N
M n with 2 2
1 1
< <
2 2
c
k 
, then   (1 2 )
1
( )) = O .
N c
var f
n
 −
 
 
 
Proof
Fisrt suppose that 1 2
{ , , , }
q
w w w
  . It is clear that the variance of N
f can be written as
follows:
(1) (1)
1
2
ˆ ˆ
[ ( )] = ( ) ( )c ( ), ( ) .
' ' '
N N N N N
R
var f W u W u ov I u I u dudu
    
− −  

Since W is zero for | |>1
 , for large N , we have
1
1 1
1 1 1 1
1
ˆ ˆ
[ ( )] = , ( ) ( ) .
'
' '
N N N
N N
x x
var f cov I I W x W x dx dx
M M
  
−
 
   
− −
 
   
   
 

Define two subsets of the 2
[ 1,1]
− by:
•  
2
1 1 1 1 1
= ( , ) [ 1,1] ; | |> ,
' '
N
L x x x x 
 − −
•  
2
2 1 1 1 1
= ( , ) [ 1,1] ; | | ,
' '
N
L x x x x 
 − − 
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
34
where N
 is a nonnegative real, converging to 0 . We split the integral into an integral over the
subregion 2
L and an integral over 1
L : 1 2
2 1
var[ ( )] = = .
N L L
f J J


+ +
 
Cauchy-Schwartz inequality and theorem 3.1, give
1 1 1 1 1
| |
1 1
( ) ( ) .
' '
'
x x N
J C W x W x dx dx

− 
  where C is constant. Thus, we obtain
1 = ( )
N
J O  (16)
It remains to show that 2
J converges to zero. For simplicity, we define
1 1
1 2
(1) (1)
= ; = ,
'
N N
x x
M M
   
− − and 1 1
(1) (1)
ˆ ˆ
( ) = c , .
'
N N
N N
x x
C ov I I
M M
  
 
   
− −
 
   
   
 
We first show that ( )
C  converges to zero uniformly in 1 1
, [ 1,1]
'
x x  − . Indeed, from lemma
2.3, we have
( )
( ) | | ( )
1 /
, 1
e
ˆ ˆ
( ) ( ) = [ ] .
| |
iuI v C u v
N N
p
N N p p
R e e
EI v I v F C du
u



 
−

− −
+
−
−
− 
Thus, the expression of the covariance becomes
( )
 
2 2
2
, 2
=1
2 1 2
1
=1
1 2
( ) = cos ( )
exp | | ( )
| |
p
p k N k
R
k
k N k p
k
C F C E u I
du du
C u
u u

 


 
 
−
−
+
 
 
 
− −



Using the following equality: 2cos cos = cos( ) cos( )
x y x y x y
+ + − , we have
( )
1
2 2
=1
=1
1
2 1
=1
1
cos ( ) = exp ( ) ( ) ( )
2
1
exp ( ) ( 1) ( ) ( ) .
2
k N k k N k
k
k
k
k N k
k
E u I C u H v d v
C u H v d v






    
   
+
 
   
− −
   
 
 
 
+ − − −
 
 

 


By substituting the expression for ( )
C  and changing the variable 2
u to 2
( )
u
− in the second
term, we obtain
( )
2
2 1 2
, 2 1
1 2
( ) = ,
| |
p
'
K K
p p
R
du du
C F C e e
u u

 

−
− − −
+
−
 (17)
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
35
where
1
2
=1
= ( ) ( ) ( )
k N k
k
R
K C u H v d v


    
−

 and
2
=1
= | | ( ) ( )
'
k N k
k R
K C u H v v dv


   
−
 
Since , > 0
'
K K , exp{ }
'
K K ' ' '
e e K K K K K
− −
−  − − − , we obtain:
2
1 2
2 | | ( ; ),
'
N
K K C u Q

  
−  where
2 2
1 2 1 2
( ; ) = | ( ) | | ( ) | ( )
N N N
Q H u H u d u
 
      

−
− −

Now, let us show that 1 2
( ; )
N
Q   converges to zero. Indeed, since  is bounded on [ , ]
−  ,
we have
2
1 2 1 2
2
1 2
=1
( ; ) sup( ) | ( ) ( ) |
( ) ( )
N N N
q
i N i N i
i
Q H u H u du
c H w H w


      
   

−
 − −
+ − −


(18)
From the definition of N
H , we can write
( ) ( )
( )
( )
( )
( )
1 2
2
1 2
,
1 2
sin sin
1 2 2
| | = .
1 1
sin sin
2 2
k k
N N '
N
n n
v v
H v H v dv dv
B
v v
 


   
   
   
 
− −
   
− −
   
   
− −
   
− −
   
   
 
a) First step:
We show that the denominators of the first and second terms under the last integral do not vanish
for the same v, so we suppose thatv exists, belonging to [ , ]
−  and , '
z z Z
 such as:
1 2
= 2 = 2 '
v z and v z
     
− − . Since 1 2
=
  , then z and z are different.
Therefore, ( )
1 2
=
2
'
z z

 

− − . Hence, 1 2
1
| |= .
'
z z
w
 
− − As 1 2 =0
limN  
→ − ,
consequently, for a large N we get:
1
<
2
'
z z
− .
Thus, we obtain a contradiction with the fact that z and '
z are different integers.
b) Second step:
Asuume there exist q points, 1 2
, , , [ , ]
q
V V V  −  such as:
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
36
for 1
=1,2, , 2
j
j q V Z
  
−  then 1 j
V
Z
w w

−  , and we assume that there exist '
q points
1 2
, , , [ , ]
' ' '
'
q
V V V  −  such that for =1,2, , '
i q 2
'
i
V
Z
w w

−  . Showing that, | |=
j
V  ,
| |=
i
V  for 1 j q
  and 1 '
i q
  . Indeed, 1< < 0
w
 − 
− and 0 < <1
w
 + 
because
> 2
w  . Hence Z
w
 − 
 and Z
w
 + 
 . For a large N , we get that
1
< <1 ,
E E
w w w w

 
−  −
   
− +
   
   
where  E
x is the integer part of x . Hence,
1
Z
w w
 
−  . In the same manner, we show that 1
Z
w w
 
+  . Similarly, it can be shown that
2
Z
w
 + 
 . Thus, | |=
j
V  and | |=
i
V  .
c) Third step:
We classify j
V and '
i
V by increasing order:
1 2
< < < < <
j j j '
q q
V V V
+
−  , and we write
the integral in the following manner:
( )
( )
( )
( )
1 2 1
1 2, 3, 4
=1 =1
1 2 1
sin sin
2 2
=
1 1
sin sin
2 2
k k
' '
q q q q
i i
i i
n n
v v
dv I I I I
v v
 
   
   
+ + −

−
   
− −
   
    + + +
   
− −
   
   
 

where
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
37
( )
( )
( )
( )
( )
( )
( )
( )
1 2
( )
1
1
1
1 2
1 2
( )
2, ( )
1 2
3, ( )
sin sin
2 2
=
1 1
sin sin
2 2
sin sin
2 2
=
1 1
sin sin
2 2
=
k k
V N
j
k k
V N
ji
i V N
ji
Vj
i V N
ji
n n
v v
I dv
v v
n n
v v
I dv
v v
I
 

 



   
   
   
   
−
−
+
−
+
   
− −
   
   
   
− −
   
   
   
− −
   
   
   
− −
   
   


( )
( )
( )
( )
( )
( )
( )
( )
1 2
( )
1
1 2
1 2
4 ( )
1 1 2
sin sin
2 2
1 1
sin sin
2 2
sin sin
2 2
=
1 1
sin sin
2 2
k k
N
i
k k
V N
j '
q q
n n
v v
dv
v v
n n
v v
I dv
v v
 

 

   
   
   
    
−
+

+
+
   
− −
   
   
   
− −
   
   
   
− −
   
   
   
− −
   
   


where ( )
N
 is a nonnegative real number converging to zero and satisfying:
1 1 2 2
< ( ) < ( ) < ( ) < ( ) < < ( ) < ( ) < ,
j j j j j j
' '
q q q q
V N V N V N V N V N V N
     
+ +
− − + − + − +  a
nd 1 2
( ) < .
2
N
 

−
Showing that the first integral converges to zero. For a large N , it easy to see that 1 <
 .
Without loss of generality, we assume that 1 = 2
j i
i
V k
  
− for all i , with i
k Z
 . The fact that
there is no v between − and
1
( )
j
V N

− on which the denominators are vanishing, gives
1
1
1 2 1 2
( ) 1
.
( ) ( ( ))
( ) ( )
inf sin , sin inf sin , sin
2 2 2 2
j
k k
k k
j
V N
I
V N
N
 
 

    
  
− + 

   
+  − + + 
   
   
 
 
Substituting
1
j
V in the last inequality, we get
2 1 2 1
( ( )) | ( ) |
sin = sin
2 2
k k
j
V N N
 
      
− + − +
. For a large N ,we obtain
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
38
2 1
| ( ) | ( ) ( )
<
2 2 2
N N N
     
 
− +
  + − .
On the other hand, two cases are possible:
1. 2 1 > 0
 
− , then we have 2 1 2 1
| ( ) |= ( ) > ( )
N N N
      
− + − +
2. 2 1 < 0
 
− , since 2 1
| |> 2 ( )
N
  
− , we have
2 1 1 2
| ( ) |= ( ) > ( )
N N N
      
− + − − .
Therefore, 2 1
| ( ) |
( ) ( )
< <
2 2 2
N
N N
   
 

− +
− . For a large N , we have
1
( ) < 2 ( )
N
   
− +  and 2
( ) < 2 ( )
N
   
− +  . Then,
1
( )
( ) ( )
< <
2 2 2
N N
 
 

+ 
− and 2
( )
( ) ( )
< < .
2 2 2
N N
 
 

+ 
−
Therefore,
1
1 2
( )
.
( )
sin
2
j
k
V N
I
N



− + 

For the integral 2,i
I , we bound the first fraction under integral by k
n 
:
( )
( )
2, ( )
2
1
1
sin
2
V N
j
k i
i k
V N
ji
I n dv
v




 
+
−

 
−
 
 
 . By substituting for ji
V in the last
inequality and putting
2
=
k
v u


− , we get
( )
( )
1
2, ( )
1
2
1
1
sin
2
N
k
i k
N
I n du
u
 


 
 
+
−

 
−
 
 
 . Since 1
| |< ( )
u N
 
− , it is easy to see that
:
2 1
2 2 1 1 2 1
| |
| | | | | | | | ( ) >
2
u u N
 
      
−
−  − − −  − −
Since ( )
N
 converges to zero, for a large N we have 2 1
2
( ) < | |
2
N

   

 
− −
 
 
, therefore
2 1 2 2 1
| | | | | | ( )
0 < < < < .
4 2 2
u N
     
   
− − − +
Consequently:
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
39
2,
1 2 1 2
2 ( )
,
| | | | ( )
inf sin ; sin
4 2
k
i
N n
I
N


       

− − +
 
 
 
where 2 1
2 1
| |=
N
x x
M
 
−
− . Then, for a large N , we have 2 1
3
< 2 .
2

  
− Therefore,
2 1 2 1 2 1
| | | | ( ) | |
< < .
4 2 4
N
       
  
− − + −
− Thus, we bound the integral as follows:
2,
2 1
2 ( )
| |)
sin
4
k
i k
N n
I



  

−
Since there is no v between ( )
ji
V N

+ and
1
( )
ji
V N

+
− on which the denominators are
vanishing, we get:
1
3,
2 ( )
,
j j
i i
i
V V N
I
A B

+
− −


where
1 1 1
2 2 1
( ) ( )
= inf sin , sin
2 2
( ) ( )
= inf sin , sin
2 2
k k
j j
i i
k k
j j
i i
V N V N
A
V N V N
B
 
 
     
     
+
+
 
− − − +
 
 
 
 
− − − +
 
 
 
It follows from the hypothesis on ( )
N
 that
1 2 1 2 1 2
| | | ( ) | | |
( ) | ( ) | | ( ) | ( )
< < < < .
2 2 2 2 2 2 2
N
N N N N
         
     

− − − −
− + −
The definition of ji
V gives
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
40
2
1 1
< .
( ) ( )
sin
sin 2
2
k k
ji
V N N
 
   
− −
Similarly we bound the other terms:
1
3, 2
2 ( )
.
( )
sin
2
j j
i i
i k
V V N
I
N



+
− −

We can show by same majoration that :
1
4
2 ( )
,
j j
i i
V V N
I
E F

+
− −


where
1
1
2
2
( )
= inf sin , sin
2 2
( )
= inf sin , sin
2 2
k
k
jq q
k
k
jq q
V N
E
V N
F




  
 
  
 

+

+
 
− −
− 
 
 
 
 
− −
− 
 
 
 
Since ( )
N
 converges to zero, for a large N , we have 1
2
( ) < | |
2
N

  

 
− − 
 
 
, and
1 2
2
( ) < | |
2
N

   

 
− −
 
 
. It follows that: 4 2
( )
.
( )
sin
2
jq q
k
V N
I
N




+
 − −
 We recapitulate, from the
previous increases, we obtain
( )
( )
( )
( )
1 2
1
2
=1 2 1
1 2
sin sin ( ) 2 ( )
2 2
1 1 ( ) | |
sin sin sin sin
2 2 2 4
k k
k
q q
j
k k
i
n n
v v V N n N
dv
N
v v
 

 
     
   
   

+

−
   
− −
     + −
     +
    −
− −
   
   


1
1
2 2
=1
( )
( )
( ) ( )
sin sin
2 2
q q
j
j j q q
i i
k k
i
V N
V V N
N N
 


 

+ −

+
+
 − −
− −
+ +

After simplification, we have
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
41
( )
( )
( )
( )
1 2
2
2 1
1 2
sin sin
2 2( 1) ( ) 2 ( )( )
2 2
.
1 1 ( ) | |
sin sin sin sin
2 2 2 4
k k
k
k k
n n
v v
q q N n N q q
dv
N
v v
 

 
   
 
   
   

−
   
− −
     
− + + +
     +
    −
− −
   
   

Using the following inequality
| |
sin
2
x x

 , we get
( )
( )
( )
( ) ( )
2
1 2
2
2 1
1 2
sin sin
2 2 ( )( )(2 )
2 2
.
1 1 ( ) | |
sin sin
2 2
k k
k k k
k k
N
n n
v v
n N q q
dv
N x x
v v
M
 
  
 
   
  
 
   

−
   
− −
    
 +
     +
     
−
− −
     
   
 

The lemma 2.1 gives
( )
( )
( )
( )
( )
1 2
,
1 2
2 2
2
2 1
1
sin sin
1 2 2
1 1
sin sin
2 2
1 2 2 ( )( )(2 )
2 ( )
k k
N
k k k
k k
k
k N
N
n n
v v
dv
B
v v
N q q
n N
n
M
 

  
 


   
   
   
  

−
−
−
   
− −
   
    
    
− −
   
   
 
 

 +
 
 
+
   
   

 

 
 

.


(19)
In order to obtain the convergence of the last expression to zero, we choose
( ) = , > 0
N n 
 
−
, such as
2
2 1
1
1
= 0 = 0.
lim lim
k
k
k
n n
k N
N
n
and
n
n
M



  
−
→ →
+ −  
 
 
(20)
Thus, from (18) N
Q converges to zero. On the other hand,
2
2 | | 1 2
, 1
1 2
( ) | | ,
| |
p
K K K
p p
du du
C F C K K e
u u

 

−    
− − −
+
− −

 −
 
where ( )
2
1 2
=1
| | | | ( ; )
k N k N
k
K K K C u Q

     
 

 
− −  − −
 .
We denote by: ( )
( , ) 1 2
= ( ; )
N k N k N
Q
     
  − . It follows from (18) and (20) that ( , )
N k
 
converges to ( )
  . Hence,
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
42
2 2
2
, 1 2 ( , )
0 1
=1 2
( ) 2 ( ; )4 exp ( ) | | .
( )
p
k
p a N k N k
p
k
k
du
C F C C Q C u
u


   
    
− 
− 
 
+ −


 
 −
 

Putting ( )
1
, = ,
k N k
u v


  we obtain
2
| |
2
2 1 2
, 1
1
2 2
( ,1) ( ,2)
( ; )
( ) 2 .
| |
C v
p
N
p p
p
N N
Q e
C F C C dv
v



   

 
 
 
−
− 
−
−
− + −
 
 

 
 
   
 
 (20)
Since ( ) > 0
  , ( )
C  converges uniformly in 1 1
, [ 1,1]
x x − to zero. From (20), we obtain
2 2 (1 ) 1
1
1 1
= .
k
k
k N
N
J O
n
n
M

 
  
− −
+ −
 
 
 
+
 
 
 
 
 
 
 
Thus, [ ( )]
N
var f  converges to zero and then, ( )
N
f 
is an asymptotically unbiased and consistent estimator.
4. CONCLUSIONS
This paper gives an estimate of the spectral density of a mixed continuous-time stable process
from observations at discrete instants. To avoid the phenomenon of aliasing we have assumed
that the spectral density is a compact support. The applications of these processes are found in
various fields. For example:
- The study of soil cracking where the observed signal is the resistance of the soil. This signal
encounters random jumps due to the encounter of certain stones in the ground. The spectral
measurement will therefore be composed of two parts, one continuous and the other discrete.
This last corresponds to the resistance jumps encountered during the measurement.
- The growth of fruits on a tree can be seen as a continuous distribution, and when there is a fall
of a fruit, the other fruits remaining on the tree absorb more energy and their growth will have a
jump in value.
As perspective of this work is to find the optimum smoothing parameters to have a better rate of
convergence. For this purpose, the cross-validation method will be the most appropriate tool.
We intend to complete this work by studying the case where the process is observed with random
errors. For this, we will use the deconvolution methods known for their efficiency in the presence
of random errors.
We think to give an estimator of the mode of the spectral density representing the frequency
where the spectral density reaches the maximum of energy.
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
43
REFERENCES
[1] S. Cambanis, (1983)“Complex symetric stable variables and processes” In P.K.SEN, ed,
Contributions to Statistics”: Essays in Honour of Norman L. Johnson North-Holland. New York,(P.
K. Sen. ed.), pp. 63-79
[2] S. Cambanis, and M. Maejima (1989). “Two classes of self-similar stable processes with stationary
increments”. Stochastic Process. Appl. Vol. 32, pp. 305-329
[3] M.B. Marcus and K. Shen (1989). “Bounds for the expected number of level crossings of certain
harmonizable infinitely divisible processes”. Stochastic Process. Appl., Vol. 76, no. 1 pp 1-32.
[4] E. Masry, S. Cambanis (1984). “Spectral density estimation for stationary stable processes”.
Stochastic processes and their applications, Vol. 18, pp. 1-31 North-Holland.
[5] G. Samorodnitsky and M. Taqqu (1994). “Stable non Gaussian processes ». Chapman and Hall, New
York.
[6] K., Panki and S. Renming (2014). “Stable process with singular drift”. Stochastic Process. Appl., Vol.
124, no. 7, pp. 2479-2516
[7] C. Zhen-Qing and W. Longmin (2016). “Uniqueness of stable processes with drift.” Proc. Amer.
Math. Soc., Vol. 144, pp. 2661-2675
[8] K. Panki, K. Takumagai and W. Jiang (2017). “Laws of the iterated logarithm for symmetric jump
processes”. Bernoulli, Vol. 23, n° 4 pp. 2330-2379.
[9] M. Schilder (1970). “Some Structure Theorems for the Symmetric Stable Laws”. Ann. Math. Statist.,
Vol. 41, no. 2, pp. 412-421.
[10] R. Sabre (2012b). “Missing Observations and Evolutionary Spectrum for Random”. International
Journal of Future Generation Communication and Networking, Vol. 5, n° 4, pp. 55-64.
[11] E. Sousa (1992). “Performance of a spread spectrum packet radio network link in a Poisson of
interferences”. IEEE Trans. Inform. Theory, Vol. 38, pp. 1743-1754
[12] M. Shao and C.L. Nikias (1993). “Signal processing with fractional lower order moments: Stable
processes and their applications”, Proc. IEEE, Vol.81, pp. 986-1010
[13] C.L. Nikias and M. Shao (1995). “Signal Processing with Alpha-Stable Distributions and
Applications”. Wiley, New York
[14] S. Kogon and D. Manolakis (1996). “Signal modeling with self-similar alpha- stable processes: The
fractional levy motion model”. IEEE Trans. Signal Processing, Vol 44, pp. 1006-1010
[15] N. Azzaoui, L. Clavier, R. Sabre, (2002). “Path delay model based on stable distribution for the
60GHz indoor channel” IEEE GLOBECOM, IEEE, pp. 441-467
[16] J.P. Montillet and Yu. Kegen (2015). “Modeling Geodetic Processes with Levy alpha-Stable
Distribution and FARIMA”, Mathematical Geosciences. Vol. 47, no. 6, pp. 627-646.
[17] M. Pereyra and H. Batalia (2012). “Modeling Ultrasound Echoes in Skin Tissues Using Symmetric
alpha-Stable Processes”. IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control,
Vol. 59, n°. 1, pp. 60-72.
[18] X. Zhong and A.B. Premkumar (2012). “Particle filtering for acoustic source tracking in impulsive
noise with alpha-stable process”. IEEE Sensors Journal, Vol. 13, no. 2, pp. 589 - 600.
[19] Wu. Ligang and W. Zidong (2015). “Filtering and Control for Classes of Two-Dimensional
Systems”. The series Studies in Systems of, Decision and Control, Vol.18, pp. 1-29.
[20] N. Demesh (1988). “Application of the polynomial kernels to the estimation of the spectra of discrete
stable stationary processes”. (Russian) Akad.Nauk.ukrain. S.S.R. Inst.Mat. Preprint 64, pp. 12-36
[21] F. Brice, F. Pene, and M. Wendler, (2017) “Stable limit theorem for U-statistic processes indexed by
a random walk”, Electron. Commun. Prob., Vol. 22, no. 9, pp.12-20.
[22] R. Sabre (2019). “Alpha Stable Filter and Distance for Multifocus Image Fusion”. IJSPS, Vol. 7, no.
2, pp. 66-72.
[23] JN. Chen, J.C. Coquille, J.P. Douzals, R. Sabre (1997). “Frequency composition of traction and
tillage forces on a mole plough”. Soil and Tillage Research, Vol. 44, pp. 67-76.
[24] R. Sabre (1995). “Spectral density estimate for stationary symmetric stable random field”,
Applicationes Mathematicaes, Vol. 23, n°. 2, pp. 107-133
[25] R. Sabre (2012a). “Spectral density estimate for alpha-stable p-adic processes”. Revisita Statistica,
Vol. 72, n°. 4, pp. 432-448.
[26] R. Sabre (2017). “Estimation of additive error in mixed spectra for stable prossess”. Revisita
Statistica, Vol. LXXVII, n°. 2, pp. 75-90.
Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021
44
[27] E. Masry, (1978). “Alias-free sampling: An alternative conceptualization and its applications”, IEEE
Trans. Information theory, Vol. 24, pp.317-324.
AUTHORS
Rachid Sabre received the PhD degree in statistics from the University of Rouen, France, in 1993 and
Habilitation to direct research (HdR) from the University of Burgundy, Dijon, France, in 2003. He joined
Agrosup Dijon, France, in 1995, where he is an Associate Professor. From 1998 through 2010, he served as
a member of Institut de Mathématiques de Bourgogne, France. He was a member of the Scientific Council
AgroSup Dijon from 2009 to 2013. From 2012 to 2019, he has been a member of Laboratoire Electronic,
Informatique, and Image (LE2I), France. Since 2019 he has been a member of Laboratory Biogeosciences
UMR CNRS University Burgundy. He is author/co-author of numerous papers in scientific and technical
journals and conference proceedings. His research interests lie in areas of statistical process and spectral
analysis for signal and image processing.

More Related Content

What's hot

IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
ijceronline
 
MDL/Bayesian Criteria based on Universal Coding/Measure
MDL/Bayesian Criteria based on Universal Coding/MeasureMDL/Bayesian Criteria based on Universal Coding/Measure
MDL/Bayesian Criteria based on Universal Coding/Measure
Joe Suzuki
 
The Universal Measure for General Sources and its Application to MDL/Bayesian...
The Universal Measure for General Sources and its Application to MDL/Bayesian...The Universal Measure for General Sources and its Application to MDL/Bayesian...
The Universal Measure for General Sources and its Application to MDL/Bayesian...
Joe Suzuki
 
Paper Introduction "Density-aware person detection and tracking in crowds"
Paper Introduction "Density-aware person detection and tracking in crowds"Paper Introduction "Density-aware person detection and tracking in crowds"
Paper Introduction "Density-aware person detection and tracking in crowds"
壮 八幡
 
2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...
2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...
2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...
The Statistical and Applied Mathematical Sciences Institute
 
INFLUENCE OF OVERLAYERS ON DEPTH OF IMPLANTED-HETEROJUNCTION RECTIFIERS
INFLUENCE OF OVERLAYERS ON DEPTH OF IMPLANTED-HETEROJUNCTION RECTIFIERSINFLUENCE OF OVERLAYERS ON DEPTH OF IMPLANTED-HETEROJUNCTION RECTIFIERS
INFLUENCE OF OVERLAYERS ON DEPTH OF IMPLANTED-HETEROJUNCTION RECTIFIERS
Zac Darcy
 
It 05104 digsig_1
It 05104 digsig_1It 05104 digsig_1
It 05104 digsig_1
goutamkrsahoo
 
Free vibration analysis of composite plates with uncertain properties
Free vibration analysis of composite plates  with uncertain propertiesFree vibration analysis of composite plates  with uncertain properties
Free vibration analysis of composite plates with uncertain properties
University of Glasgow
 
Stochastic Alternating Direction Method of Multipliers
Stochastic Alternating Direction Method of MultipliersStochastic Alternating Direction Method of Multipliers
Stochastic Alternating Direction Method of Multipliers
Taiji Suzuki
 
short course on Subsurface stochastic modelling and geostatistics
short course on Subsurface stochastic modelling and geostatisticsshort course on Subsurface stochastic modelling and geostatistics
short course on Subsurface stochastic modelling and geostatistics
Amro Elfeki
 
Lecture5
Lecture5Lecture5
Lecture5
Atner Yegorov
 
G234247
G234247G234247
Estimating structured vector autoregressive models
Estimating structured vector autoregressive modelsEstimating structured vector autoregressive models
Estimating structured vector autoregressive models
Akira Tanimoto
 
The Multivariate Gaussian Probability Distribution
The Multivariate Gaussian Probability DistributionThe Multivariate Gaussian Probability Distribution
The Multivariate Gaussian Probability Distribution
Pedro222284
 
a decomposition methodMin quasdratic.pdf
a decomposition methodMin quasdratic.pdfa decomposition methodMin quasdratic.pdf
a decomposition methodMin quasdratic.pdf
AnaRojas146538
 
Adaptive dynamic programming for control
Adaptive dynamic programming for controlAdaptive dynamic programming for control
Adaptive dynamic programming for control
Springer
 
Dynamics of structures with uncertainties
Dynamics of structures with uncertaintiesDynamics of structures with uncertainties
Dynamics of structures with uncertainties
University of Glasgow
 
Iaetsd vlsi implementation of gabor filter based image edge detection
Iaetsd vlsi implementation of gabor filter based image edge detectionIaetsd vlsi implementation of gabor filter based image edge detection
Iaetsd vlsi implementation of gabor filter based image edge detection
Iaetsd Iaetsd
 
Image Restitution Using Non-Locally Centralized Sparse Representation Model
Image Restitution Using Non-Locally Centralized Sparse Representation ModelImage Restitution Using Non-Locally Centralized Sparse Representation Model
Image Restitution Using Non-Locally Centralized Sparse Representation Model
IJERA Editor
 

What's hot (19)

IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
 
MDL/Bayesian Criteria based on Universal Coding/Measure
MDL/Bayesian Criteria based on Universal Coding/MeasureMDL/Bayesian Criteria based on Universal Coding/Measure
MDL/Bayesian Criteria based on Universal Coding/Measure
 
The Universal Measure for General Sources and its Application to MDL/Bayesian...
The Universal Measure for General Sources and its Application to MDL/Bayesian...The Universal Measure for General Sources and its Application to MDL/Bayesian...
The Universal Measure for General Sources and its Application to MDL/Bayesian...
 
Paper Introduction "Density-aware person detection and tracking in crowds"
Paper Introduction "Density-aware person detection and tracking in crowds"Paper Introduction "Density-aware person detection and tracking in crowds"
Paper Introduction "Density-aware person detection and tracking in crowds"
 
2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...
2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...
2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...
 
INFLUENCE OF OVERLAYERS ON DEPTH OF IMPLANTED-HETEROJUNCTION RECTIFIERS
INFLUENCE OF OVERLAYERS ON DEPTH OF IMPLANTED-HETEROJUNCTION RECTIFIERSINFLUENCE OF OVERLAYERS ON DEPTH OF IMPLANTED-HETEROJUNCTION RECTIFIERS
INFLUENCE OF OVERLAYERS ON DEPTH OF IMPLANTED-HETEROJUNCTION RECTIFIERS
 
It 05104 digsig_1
It 05104 digsig_1It 05104 digsig_1
It 05104 digsig_1
 
Free vibration analysis of composite plates with uncertain properties
Free vibration analysis of composite plates  with uncertain propertiesFree vibration analysis of composite plates  with uncertain properties
Free vibration analysis of composite plates with uncertain properties
 
Stochastic Alternating Direction Method of Multipliers
Stochastic Alternating Direction Method of MultipliersStochastic Alternating Direction Method of Multipliers
Stochastic Alternating Direction Method of Multipliers
 
short course on Subsurface stochastic modelling and geostatistics
short course on Subsurface stochastic modelling and geostatisticsshort course on Subsurface stochastic modelling and geostatistics
short course on Subsurface stochastic modelling and geostatistics
 
Lecture5
Lecture5Lecture5
Lecture5
 
G234247
G234247G234247
G234247
 
Estimating structured vector autoregressive models
Estimating structured vector autoregressive modelsEstimating structured vector autoregressive models
Estimating structured vector autoregressive models
 
The Multivariate Gaussian Probability Distribution
The Multivariate Gaussian Probability DistributionThe Multivariate Gaussian Probability Distribution
The Multivariate Gaussian Probability Distribution
 
a decomposition methodMin quasdratic.pdf
a decomposition methodMin quasdratic.pdfa decomposition methodMin quasdratic.pdf
a decomposition methodMin quasdratic.pdf
 
Adaptive dynamic programming for control
Adaptive dynamic programming for controlAdaptive dynamic programming for control
Adaptive dynamic programming for control
 
Dynamics of structures with uncertainties
Dynamics of structures with uncertaintiesDynamics of structures with uncertainties
Dynamics of structures with uncertainties
 
Iaetsd vlsi implementation of gabor filter based image edge detection
Iaetsd vlsi implementation of gabor filter based image edge detectionIaetsd vlsi implementation of gabor filter based image edge detection
Iaetsd vlsi implementation of gabor filter based image edge detection
 
Image Restitution Using Non-Locally Centralized Sparse Representation Model
Image Restitution Using Non-Locally Centralized Sparse Representation ModelImage Restitution Using Non-Locally Centralized Sparse Representation Model
Image Restitution Using Non-Locally Centralized Sparse Representation Model
 

Similar to Mixed Spectra for Stable Signals from Discrete Observations

SPECTRAL ESTIMATE FOR STABLE SIGNALS WITH P-ADIC TIME AND OPTIMAL SELECTION O...
SPECTRAL ESTIMATE FOR STABLE SIGNALS WITH P-ADIC TIME AND OPTIMAL SELECTION O...SPECTRAL ESTIMATE FOR STABLE SIGNALS WITH P-ADIC TIME AND OPTIMAL SELECTION O...
SPECTRAL ESTIMATE FOR STABLE SIGNALS WITH P-ADIC TIME AND OPTIMAL SELECTION O...
sipij
 
Bayes gauss
Bayes gaussBayes gauss
E028047054
E028047054E028047054
E028047054
inventionjournals
 
Constant strain triangular
Constant strain triangular Constant strain triangular
Constant strain triangular
rahul183
 
05_AJMS_332_21.pdf
05_AJMS_332_21.pdf05_AJMS_332_21.pdf
05_AJMS_332_21.pdf
BRNSS Publication Hub
 
Digital Signal Processing[ECEG-3171]-Ch1_L02
Digital Signal Processing[ECEG-3171]-Ch1_L02Digital Signal Processing[ECEG-3171]-Ch1_L02
Digital Signal Processing[ECEG-3171]-Ch1_L02
Rediet Moges
 
Zeros of orthogonal polynomials generated by a Geronimus perturbation of meas...
Zeros of orthogonal polynomials generated by a Geronimus perturbation of meas...Zeros of orthogonal polynomials generated by a Geronimus perturbation of meas...
Zeros of orthogonal polynomials generated by a Geronimus perturbation of meas...
Edmundo José Huertas Cejudo
 
On approximate bounds of zeros of polynomials within
On approximate bounds of zeros of polynomials withinOn approximate bounds of zeros of polynomials within
On approximate bounds of zeros of polynomials within
eSAT Publishing House
 
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
ieijjournal
 
KAUST_talk_short.pdf
KAUST_talk_short.pdfKAUST_talk_short.pdf
KAUST_talk_short.pdf
Chiheb Ben Hammouda
 
lec07_DFT.pdf
lec07_DFT.pdflec07_DFT.pdf
lec07_DFT.pdf
shannlevia123
 
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
Shizuoka Inst. Science and Tech.
 
SPDE presentation 2012
SPDE presentation 2012SPDE presentation 2012
SPDE presentation 2012
Zheng Mengdi
 
E041046051
E041046051E041046051
E041046051
inventy
 
Table 1
Table 1Table 1
Table 1
butest
 
D143136
D143136D143136
D143136
IJRES Journal
 
Litvinenko low-rank kriging +FFT poster
Litvinenko low-rank kriging +FFT  posterLitvinenko low-rank kriging +FFT  poster
Litvinenko low-rank kriging +FFT poster
Alexander Litvinenko
 
Low rank tensor approximation of probability density and characteristic funct...
Low rank tensor approximation of probability density and characteristic funct...Low rank tensor approximation of probability density and characteristic funct...
Low rank tensor approximation of probability density and characteristic funct...
Alexander Litvinenko
 
2012 mdsp pr05 particle filter
2012 mdsp pr05 particle filter2012 mdsp pr05 particle filter
2012 mdsp pr05 particle filter
nozomuhamada
 
Ph 101-9 QUANTUM MACHANICS
Ph 101-9 QUANTUM MACHANICSPh 101-9 QUANTUM MACHANICS
Ph 101-9 QUANTUM MACHANICS
Chandan Singh
 

Similar to Mixed Spectra for Stable Signals from Discrete Observations (20)

SPECTRAL ESTIMATE FOR STABLE SIGNALS WITH P-ADIC TIME AND OPTIMAL SELECTION O...
SPECTRAL ESTIMATE FOR STABLE SIGNALS WITH P-ADIC TIME AND OPTIMAL SELECTION O...SPECTRAL ESTIMATE FOR STABLE SIGNALS WITH P-ADIC TIME AND OPTIMAL SELECTION O...
SPECTRAL ESTIMATE FOR STABLE SIGNALS WITH P-ADIC TIME AND OPTIMAL SELECTION O...
 
Bayes gauss
Bayes gaussBayes gauss
Bayes gauss
 
E028047054
E028047054E028047054
E028047054
 
Constant strain triangular
Constant strain triangular Constant strain triangular
Constant strain triangular
 
05_AJMS_332_21.pdf
05_AJMS_332_21.pdf05_AJMS_332_21.pdf
05_AJMS_332_21.pdf
 
Digital Signal Processing[ECEG-3171]-Ch1_L02
Digital Signal Processing[ECEG-3171]-Ch1_L02Digital Signal Processing[ECEG-3171]-Ch1_L02
Digital Signal Processing[ECEG-3171]-Ch1_L02
 
Zeros of orthogonal polynomials generated by a Geronimus perturbation of meas...
Zeros of orthogonal polynomials generated by a Geronimus perturbation of meas...Zeros of orthogonal polynomials generated by a Geronimus perturbation of meas...
Zeros of orthogonal polynomials generated by a Geronimus perturbation of meas...
 
On approximate bounds of zeros of polynomials within
On approximate bounds of zeros of polynomials withinOn approximate bounds of zeros of polynomials within
On approximate bounds of zeros of polynomials within
 
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...
 
KAUST_talk_short.pdf
KAUST_talk_short.pdfKAUST_talk_short.pdf
KAUST_talk_short.pdf
 
lec07_DFT.pdf
lec07_DFT.pdflec07_DFT.pdf
lec07_DFT.pdf
 
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
 
SPDE presentation 2012
SPDE presentation 2012SPDE presentation 2012
SPDE presentation 2012
 
E041046051
E041046051E041046051
E041046051
 
Table 1
Table 1Table 1
Table 1
 
D143136
D143136D143136
D143136
 
Litvinenko low-rank kriging +FFT poster
Litvinenko low-rank kriging +FFT  posterLitvinenko low-rank kriging +FFT  poster
Litvinenko low-rank kriging +FFT poster
 
Low rank tensor approximation of probability density and characteristic funct...
Low rank tensor approximation of probability density and characteristic funct...Low rank tensor approximation of probability density and characteristic funct...
Low rank tensor approximation of probability density and characteristic funct...
 
2012 mdsp pr05 particle filter
2012 mdsp pr05 particle filter2012 mdsp pr05 particle filter
2012 mdsp pr05 particle filter
 
Ph 101-9 QUANTUM MACHANICS
Ph 101-9 QUANTUM MACHANICSPh 101-9 QUANTUM MACHANICS
Ph 101-9 QUANTUM MACHANICS
 

Recently uploaded

一比一原版(USF毕业证)旧金山大学毕业证如何办理
一比一原版(USF毕业证)旧金山大学毕业证如何办理一比一原版(USF毕业证)旧金山大学毕业证如何办理
一比一原版(USF毕业证)旧金山大学毕业证如何办理
uqyfuc
 
Mechatronics material . Mechanical engineering
Mechatronics material . Mechanical engineeringMechatronics material . Mechanical engineering
Mechatronics material . Mechanical engineering
sachin chaurasia
 
Introduction to verilog basic modeling .ppt
Introduction to verilog basic modeling   .pptIntroduction to verilog basic modeling   .ppt
Introduction to verilog basic modeling .ppt
AmitKumar730022
 
5g-5G SA reg. -standalone-access-registration.pdf
5g-5G SA reg. -standalone-access-registration.pdf5g-5G SA reg. -standalone-access-registration.pdf
5g-5G SA reg. -standalone-access-registration.pdf
devtomar25
 
An Introduction to the Compiler Designss
An Introduction to the Compiler DesignssAn Introduction to the Compiler Designss
An Introduction to the Compiler Designss
ElakkiaU
 
Bayesian Decision Theory details ML.pptx
Bayesian Decision Theory details ML.pptxBayesian Decision Theory details ML.pptx
Bayesian Decision Theory details ML.pptx
amrita chaturvedi
 
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
upoux
 
Software Engineering and Project Management - Introduction, Modeling Concepts...
Software Engineering and Project Management - Introduction, Modeling Concepts...Software Engineering and Project Management - Introduction, Modeling Concepts...
Software Engineering and Project Management - Introduction, Modeling Concepts...
Prakhyath Rai
 
Design and optimization of ion propulsion drone
Design and optimization of ion propulsion droneDesign and optimization of ion propulsion drone
Design and optimization of ion propulsion drone
bjmsejournal
 
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Sinan KOZAK
 
Transformers design and coooling methods
Transformers design and coooling methodsTransformers design and coooling methods
Transformers design and coooling methods
Roger Rozario
 
CEC 352 - SATELLITE COMMUNICATION UNIT 1
CEC 352 - SATELLITE COMMUNICATION UNIT 1CEC 352 - SATELLITE COMMUNICATION UNIT 1
CEC 352 - SATELLITE COMMUNICATION UNIT 1
PKavitha10
 
VARIABLE FREQUENCY DRIVE. VFDs are widely used in industrial applications for...
VARIABLE FREQUENCY DRIVE. VFDs are widely used in industrial applications for...VARIABLE FREQUENCY DRIVE. VFDs are widely used in industrial applications for...
VARIABLE FREQUENCY DRIVE. VFDs are widely used in industrial applications for...
PIMR BHOPAL
 
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
ecqow
 
Computational Engineering IITH Presentation
Computational Engineering IITH PresentationComputational Engineering IITH Presentation
Computational Engineering IITH Presentation
co23btech11018
 
一比一原版(osu毕业证书)美国俄勒冈州立大学毕业证如何办理
一比一原版(osu毕业证书)美国俄勒冈州立大学毕业证如何办理一比一原版(osu毕业证书)美国俄勒冈州立大学毕业证如何办理
一比一原版(osu毕业证书)美国俄勒冈州立大学毕业证如何办理
upoux
 
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student MemberIEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
VICTOR MAESTRE RAMIREZ
 
Call For Paper -3rd International Conference on Artificial Intelligence Advan...
Call For Paper -3rd International Conference on Artificial Intelligence Advan...Call For Paper -3rd International Conference on Artificial Intelligence Advan...
Call For Paper -3rd International Conference on Artificial Intelligence Advan...
ijseajournal
 
Software Engineering and Project Management - Software Testing + Agile Method...
Software Engineering and Project Management - Software Testing + Agile Method...Software Engineering and Project Management - Software Testing + Agile Method...
Software Engineering and Project Management - Software Testing + Agile Method...
Prakhyath Rai
 
一比一原版(爱大毕业证书)爱荷华大学毕业证如何办理
一比一原版(爱大毕业证书)爱荷华大学毕业证如何办理一比一原版(爱大毕业证书)爱荷华大学毕业证如何办理
一比一原版(爱大毕业证书)爱荷华大学毕业证如何办理
nedcocy
 

Recently uploaded (20)

一比一原版(USF毕业证)旧金山大学毕业证如何办理
一比一原版(USF毕业证)旧金山大学毕业证如何办理一比一原版(USF毕业证)旧金山大学毕业证如何办理
一比一原版(USF毕业证)旧金山大学毕业证如何办理
 
Mechatronics material . Mechanical engineering
Mechatronics material . Mechanical engineeringMechatronics material . Mechanical engineering
Mechatronics material . Mechanical engineering
 
Introduction to verilog basic modeling .ppt
Introduction to verilog basic modeling   .pptIntroduction to verilog basic modeling   .ppt
Introduction to verilog basic modeling .ppt
 
5g-5G SA reg. -standalone-access-registration.pdf
5g-5G SA reg. -standalone-access-registration.pdf5g-5G SA reg. -standalone-access-registration.pdf
5g-5G SA reg. -standalone-access-registration.pdf
 
An Introduction to the Compiler Designss
An Introduction to the Compiler DesignssAn Introduction to the Compiler Designss
An Introduction to the Compiler Designss
 
Bayesian Decision Theory details ML.pptx
Bayesian Decision Theory details ML.pptxBayesian Decision Theory details ML.pptx
Bayesian Decision Theory details ML.pptx
 
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
 
Software Engineering and Project Management - Introduction, Modeling Concepts...
Software Engineering and Project Management - Introduction, Modeling Concepts...Software Engineering and Project Management - Introduction, Modeling Concepts...
Software Engineering and Project Management - Introduction, Modeling Concepts...
 
Design and optimization of ion propulsion drone
Design and optimization of ion propulsion droneDesign and optimization of ion propulsion drone
Design and optimization of ion propulsion drone
 
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
 
Transformers design and coooling methods
Transformers design and coooling methodsTransformers design and coooling methods
Transformers design and coooling methods
 
CEC 352 - SATELLITE COMMUNICATION UNIT 1
CEC 352 - SATELLITE COMMUNICATION UNIT 1CEC 352 - SATELLITE COMMUNICATION UNIT 1
CEC 352 - SATELLITE COMMUNICATION UNIT 1
 
VARIABLE FREQUENCY DRIVE. VFDs are widely used in industrial applications for...
VARIABLE FREQUENCY DRIVE. VFDs are widely used in industrial applications for...VARIABLE FREQUENCY DRIVE. VFDs are widely used in industrial applications for...
VARIABLE FREQUENCY DRIVE. VFDs are widely used in industrial applications for...
 
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
 
Computational Engineering IITH Presentation
Computational Engineering IITH PresentationComputational Engineering IITH Presentation
Computational Engineering IITH Presentation
 
一比一原版(osu毕业证书)美国俄勒冈州立大学毕业证如何办理
一比一原版(osu毕业证书)美国俄勒冈州立大学毕业证如何办理一比一原版(osu毕业证书)美国俄勒冈州立大学毕业证如何办理
一比一原版(osu毕业证书)美国俄勒冈州立大学毕业证如何办理
 
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student MemberIEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
 
Call For Paper -3rd International Conference on Artificial Intelligence Advan...
Call For Paper -3rd International Conference on Artificial Intelligence Advan...Call For Paper -3rd International Conference on Artificial Intelligence Advan...
Call For Paper -3rd International Conference on Artificial Intelligence Advan...
 
Software Engineering and Project Management - Software Testing + Agile Method...
Software Engineering and Project Management - Software Testing + Agile Method...Software Engineering and Project Management - Software Testing + Agile Method...
Software Engineering and Project Management - Software Testing + Agile Method...
 
一比一原版(爱大毕业证书)爱荷华大学毕业证如何办理
一比一原版(爱大毕业证书)爱荷华大学毕业证如何办理一比一原版(爱大毕业证书)爱荷华大学毕业证如何办理
一比一原版(爱大毕业证书)爱荷华大学毕业证如何办理
 

Mixed Spectra for Stable Signals from Discrete Observations

  • 1. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 DOI: 10.5121/sipij.2021.12502 21 MIXED SPECTRA FOR STABLE SIGNALS FROM DISCRETE OBSERVATIONS Rachid Sabre Biogeosciences (UMR CNRS/uB 6282), University of Burgundy, 26, Bd Docteur Petitjean, Dijon, France ABSTRACT This paper concerns the continuous-time stable alpha symmetric processes which are inivitable in the modeling of certain signals with indefinitely increasing variance. Particularly the case where the spectral measurement is mixed: sum of a continuous measurement and a discrete measurement. Our goal is to estimate the spectral density of the continuous part by observing the signal in a discrete way. For that, we propose a method which consists in sampling the signal at periodic instants. We use Jackson's polynomial kernel to build a periodogram which we then smooth by two spectral windows taking into account the width of the interval where the spectral density is non-zero. Thus, we bypass the phenomenon of aliasing often encountered in the case of estimation from discrete observations of a continuous time process. KEYWORDS Spectral density, stable processes, periodogram, smoothing estimate, aliasing. 1. INTRODUCTION The multiple applications where the random signals whose variance increases indefinitely impose the interest of using stable alpha processes by several research authors in various fields. In particular, Stable symmetric harmonizable processes and their properties have been widely studied by many authors such as [1] - [10] to name a few. Concrete applications of stable symmetric processes cover a wide spectrum of fields such as: physics, biology, electronics and electricity, hydrology, economics, communications and radar applications., ...ect. See: [11]-[22]. In this paper we consider a symmetric alpha stable harmonizable process = { ( ): } X X t t R  . Alternatively X has the integral representation:   ( ) = exp ( ) ( ) X t i t d     (1) where 1< < 2  and  is a complex valued symmetric  -stable random measure on R with independent and isotropic increments. The control measure is defined by ( ) =| ( ) | m A A    (see [4]) is called spectral measure. The estimation of the spectral density function was already studied in different cases: by E.Masry and S.Combanis [4] when the time of the process is continuous, by Sabre [23] when the time of the process is discrete and by R.Sabre [24]-[25]when the time of the process is p-adic. In this paper we consider a general case where the spectral measure is the sum of an absolutely continuous measure with respect to Lebesgue measure and a discrete measure:
  • 2. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 22 =1 ( ) = ( ) q i wi i d x dx c     +  where  is a Dirac measure, the specral density  is nonnegative integrable and bounded function. i c is an unknown positive real number and i w is an unknown real number. Assume that 0 i w  . The discrete measurement comes from the repeated random energy jumps during the experimental measurements. Spectral density represents the distribution of the energy carried by the signal. Our objective is to propose a nonparametric estimator of the spectral density after discrete sampling of the process ( ) X t . This work is motivated by the fact that in practice it is impossible to observe the process over a continuous time interval. However, we sampled the process at equidistant times, i.e., = n t n , > 0  . It is known that aliasing of  occurs. For more details about aliasing phenomenon, see [26]. To avoid this difficulty, we suppose that the spectral density  is vanishing for | |>   where  is a nonnegative real number. We create an estimate of the spectral density based on smoothing methods. We show that it is asymptotically unbiased and consistent. Briefly, the organization of this paper will be as follows: in the second section two technical lemmas will be presented as well as a preiodogram and we will show that this periodogram is an asymptotically unbiased but inconsistent estimator. In the third section, the periodogram will be smoothed by two well chosen spectral windows to estimate the spectral density at the jump points. We show that the smoothing periodogram is a consistent estimator. The fourth section gives conclusions and working perspectives. 2. THE PERIODOGRAM AND ITS PROPRIETIES In this section we give some basic notations and properties of the Jackson's polynomial kernel. Let N is the size of sample of X . Let k and n are the numbers satisfying: 1 1= 2 ( 1) 2 N k n with n N k N   − −        if 1 = 2 k then 1 1 = 2 1, n n n N −  . The Jackson's polynomial kernel is defined by: ( ) ( ) = ( ) N N N H A H     where 2 2 ( ) , , sin sin 1 1 2 2 ( ) = = . 2 sin sin 2 2 k k N k n k n n n H with q d q          −                      where 1 , = ( ) N N A B   − with ( ) , = ( ) . N N B H d       −  We cite two lemmas which are used in this paper. Their proof are given in [23]. Lemma 2.1 There is a non negative function k h such as:
  • 3. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 23 ( 1) ( ) = ( 1) ( ) = cos( ) k n N k m k n m H h m n   − − −        Lemma 2.2 Let 2 , , sin 2 = = | | | ( ) | , sin 2 k N N N n B d and J u H u du             − −    where ]0,2],   then 2 2 1 , 2 1 2 2 0 < < 2 4 1 < < 2 2 1 2 k k N k n if B k n if k k            − −               −  and 2 2 2 1 , 2 2 1 1 1 < < 2 ( 2 1) 2 2 2 1 1 < < 2 2 ( 1)(2 1) 2 k k k N k k if k n k k J k if k n k                     + − +  +  − +    +   + − −  This paragraph gives a periodogram and develops its proprieties. Consider the process ( ), X t defined in (1), observed at instants = j t j , =1,2,... j N and 2 =    , where  is a real number strictly greater than 2 . Define the periodogram ˆ N I on ] , [ −   as follows: ( ) , ˆ ( ) = | | , 0 < < 2 p N p N I C I p     Where 1 = ( 1) = ( 1) ( ) = [ ] e[ exp{ ( )} ( ( 1) )], ' ' n k n ' ' N N k ' n k n n I A R h i n X n k n n       − − −   − + −      The normalisation constant , p C  is given by , / , = [ ] p p p p D C F C     , with | | , 1 1 1 cos( ) 1 = a = | | | | a u p p p p u e D du nd F du u u  −   + + − − − −   . Lemma 2.3
  • 4. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 24 The characteristic function of ( ) N I  ,   exp ( ) N E irI  , converges to ,1 ,2 exp[ | | ( ( ) ( )]. N N C r       − + where ( ) ,1( ) = | | N N y H y dy         −   −      and ,2 =1 ( ) = ( ) q N i N i i c H w     −  Proof From (1) and the expression of N I , we have:     1 = ( 1) = ( 1) ( ) = [ ] e exp [ ( )] exp [ ( 1)] ( ). ' ' n k n ' N N k R ' n k n n I A R h i n u i uk n d u n        − − −   − −       Using [1] and the definition of the Jackson polynomial kernel we obtain that the characteristic function is the form:   exp ( ) = exp | | ( ) . a N a N E irI C r      −   (2) where ,1 ,2 ( ) = ( ) ( ) N N N       + with ( ) ,1( ) = | |a N N R v H v dv        −      and ,2 =1 ( ) = ( ) q N i N i i c H w     −  ( ) ,1( ) = | |a N N R v H v dv        −      ( ) (2 1) (2 1) = | | . j a N j j Z v H v dv      + −    −      Putting = 2 v y j  − and using the fact that N H is 2 -periodic, we get ( ) ( ) = | | ( ) , a N N j j Z H y y dy        − −   where 2 ( ) = . j y y j        −     Let j be an integer such that 2 < < y j   − −  . Since <    and | |< y  , we get 1 | |< <1 2 2 j    + and then = 0 j . Therefore ( ) ,1( ) = | | . N N y H y dy         −   −      (3) Theorem 2.4 Let < <  −  then ( ) ˆ ( ) = , p N N E I             Proof From the following equality used in [4], for all real x and 0 < < 2 p , 1 1 1 1 1 cos( ) 1 | | = = e , | | | | ixu p p p p p xu e x D du D R du u u   − − + + − − − −   (4)
  • 5. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 25 and replacing x by N I , we obtain / 1 , 1 exp{ ( )} 1 ˆ ( ) = e , [ ] | | N N p p p a iuI I R du F C u      + − −  (5) The equation (5) and the definition of the , , p F  give     / 1 , / 1 exp | | ( ) 1 ˆ ( ) = . [ ] | | = ( ) . a N N p p R p a p N C u EI du F C u          + − −  3. SMOOTHING PERIODOGRAM In order to obtain a consistent estimate of [ ( )] p    , we smooth the periodogram via spectral windows depending on whether  is a jump point or not( ) i w   . (1) 1 2 (2) (1) ( ) { , , , } ( ) = ( ) ( ) 1 N q N N N f if w w w f f cf else c          −  −  where (1) (1) ˆ ( ) = ( ) ( ) N N N f W u I u du     − −  and (2) (2) ˆ ( ) = ( ) ( ) . N N N f W u I u du     − −  The spectral windows (1) N W and (2) N W are defined by: (1) (1) (1) ( ) = ( ) N N N W x M W M x and (2) (2)) (2) ( ) = ( ) N N N W x M W M x with W is an even nonnegative, continuous function , vanishing for | |>1  such that 1 1 ( ) =1 W u du −  . The bandwidths (1) ) N M and (2) ) N M satisfying: (2) (1) N N M c M = ( ) lim i N N M → = +, ( ) = 0 lim i N N M N → for 1,2 i = , (2) (1) = 0 lim N N N M M →+ and such that (2) (1) (1) (1) 1 1 ( ) = ( ) , N N N N W M W M M M        −     . Th following theorem shows that ( ) N f  is an asymptotically unbiased estimator of [ ( )] p    for < <  −  and 1 2 { , , , } q w w w   . Theorem 3.1 Let < <  − , such that 1 2 { , , , } q w w w   . Then,     ( ) ( ) ( ) = o 1 . p N E f     −
  • 6. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 26 If  satisfies the hypothesis ( ) ( ) ( ) , x y cste x y    − −  − with < 2 1 k   − , then,   (2 1) (1) (1) (2 1) (1) 2 1 1 1 = 0 ( ) [ ( )] = . 1 1 1 = 0 k p N N k k N N O if n M E f O if M n M n            − − −    +       −     + +       Proof It is easy to see that:   (1) (1) ˆ ( ) = ( ) ( ) . N N N N R E f M W M u E I u du       −      Let (1) ( ) = N M u v  − , we obtain: 1 (1) 1 [ ( )] = ( ) . p N N N v E f W v dv M     −     −          (7) Since 1 1 ( ) =1 W u du −  and the inequality (3), we get:     1 (1) 1 ( ) ( ) ( ) ( ) . p p N N N v E f W v dv M          −   −  − −      As < 1 p  , we obtain ,1 ,2 (1) (1) (1) ( ) ( ) | p p p N N N N N N v v v M M M                    − −  − − + −             We now examine the limit of ,1 (1) N N v M     −     . From (3) we get: ,1 (1) (1) = . N N N N v v u H u du M M         −         − − −                    Let (1) = N v u y M     − −     , we obtain:
  • 7. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 27 ,1 (1) (1) (2 1) (1) (2 1) = ( ) = ( ) . N N R N N j N j j Z N v v y H y dy M M v y H y dy M             + −      − − +           − +       (8) Let 2 = y j s  − . Since | (.) | N H  is 2 −periodic function, we get ,1 (1) (1) 2 = ( ) . N N j Z N N v v s H s j ds M M           + −      − − + +          The function  is uniformly continuous on [ , ] −  and since | | N H  is a kernel, the right hand side of the last equality converges to 2 . j Z j        +      Let j be an integer such that 2 < < j    + − . The definition of  implies that | |<| |<     . It is easy to see that | |< 1 j and then = 0 j . Since (1) N H is a kernel, we obtain that ,1 (1) N N v M     −     converges to ( )   . On the other hand, (1) ,2 (1) (1) =1 = q N N i i N N v v H w M M            − − −                Since i w is different from  and from the lemma 2.2, we get 1 2 (1) 2 1 ,2 (1) =1 2 1 2 , where cte =inf sin . 2 k i q N k N i i N v w M v n c M cte          − −     − −               −                         Therefore, ,2 (1) 2 1 1 = N k N v O M n    −     −         . Thus, we have     ( ) ( ) = (1). p N E f o     − The rate of convergence: Assume that the spectral density  satisfies the hypothesis H . Let / =| ( ( )) |=| [ ( )] [ ( )] | p N N F Bias f E f      − . It follows that 1 1 1 (1) (1) 1 ( ) [ ( )] ( ) . 2 p p N N N N p v v F W v dv M M            − − −            − + − −                   
  • 8. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 28 Since N N v M     −     converges to ( )   , in order to study the rate of the convergence for F we examine the rate of convergence of 1 (1) 1 ( ) ( ) N N v W v dv M     −   − −      . Indeed, from (3), we obtain (1) (1) = | | . N N N N v v y H y dy M M          −       − − +              Let ( ) (1) , = ( ) N N N v M          − −     . Putting (1) = N v t y M     − − +     and using the condition H , we get ( ) ( ) (1) 1 (1) (1) , . v MN v N N N MN v t C H t dt M            − + − −   +  We can maximize as follows: ( ) 1 1 1 (1) 1 1 1 (1) 1 1 1 1 (1) 1 ( ) ( , ) 2 ( ) | | 2 ( ) N N v MN v N MN W v dv C W v v dv M C W v H t t dtdv                  − − − + − − −   +     The second integral of the right hand side is bounded as follows: ( ) ( ) ( ) ( ) (1) | | | | (1) (1) | | | | (1) . v MN v v N N M M N N N v MN N H t t dt H t t dt H t t dt H t t dt                         − + − − − − − − − + +  + +     (9) Since | (.) | N H is even, the first and the last integrals in the right hand side of (9) are equal. As N v M  converges to zero and < <     , for a large N we have:
  • 9. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 29 ( ) ( ) | | | | | | | | (1) (1) (1) 2 , (1) (2 ) | | (2 ) sin | | v v M M N N N N N k ' N N H t t dt H t dt M B M                       + + + +  +    + +       The lemma 2.1 gives: ( ) 2 1 | | | | (1) (1) 2 1 1 O 0, = 1 O = 0, k v MN N k N if n H t t dt if M n           − + + −                        Thus, we obtain the result of the theorem. Theorem 3.2. Let  a real nuber belonging to ] , [ −   , and = i w  . Choose k such that ( ) 2 (1) 2 1 = 0 lim k N N k M n   → − . Then, i) [ ( )] [ ( )] = (1) p N E f o     − ii) If  satisfiies the hypothesis ( ) ( ) ( ) , x y cste x y    − −  − with 1 < < 2 2k   + , then ( ) ( ) ( ) 2 (1) 2 1 (2) 2 (1) (2) 2 1 1 0 < 1 [ ( )] [ ( )] = 1 1< 2 k N k p N N k N k N M O if n M E f M O if M n            − −       +        −        +        Proof : The form of estimator gives:
  • 10. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 30 (2) (2) (1) (1) (2) (1) ( ) ( ) [ ( )] = [ ( )] 1 N N N p N N N N N M W u W u M E f u du M M        − − − − −  1 1 (1) (1) 1 1 1 2 3 (1) (1) [ ( )] = M M N N N M M N N E f E E E        − + − + − + + = + +    Put 1 (2) (2) (1) (1) 1 2 (2) (1) (1) [ ] [ ] = , = [ ( )] . 1 p N n N MN N N MN N M W M v W M v u v E v dv M M     −   −   − − −  Therefore 2 0 E = for a large N. 1 (2) (1) (2) 1 (2) (1) = [ ( )][ ( )] 1 p M N N N N N N M E W M u u du M M      − − − − −  1 (2) (1) (1) (2) (1) [ ( )][ ( )] 1 p M N N N N N N M W M u u du M M      − − − −  Put (2) ( ) = N M u v  − in the first integral and put (1) ( ) = , N M u w  − in the second integral and for a large N, we have (1) (2) ( ) >1 ( ) >1. N N M et M     + + As W is null outside of [ 1,1] − , for large N, the second integral of 1 E is zero.Therefore, 1 (2) 1 (2) (2) (1) (1) 1 = ( ) . 1 p N MN N N MN N v E W v dv M M M        −         −  (10) (2) (2) (2) (1) 1 1 3 (2) (2) (1) (1) (1) (1) = [ ( )][ ( )] [ ( )][ ( )] 1 1 p p N N N N N N N N M M N N N N M M E W M u u du W M u u du M M M M           + + − − − − −   Putting (2) ( ) = N M u v  − in the first integral and (1) ( ) = N M u w  − in the second integral, we obtain (2) (2) (1) (1) 1 (2) (1) 3 (2) (2) (2) (1) ( ) ( ) (1) (1) 1 = ( ) ( ) . 1 1 p p N MN M N N N N M M N N N N N N N N M M v w E W v dv W w dw M M M M M M           − − − −         − − −                 − −  
  • 11. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 31 (2) (1) For large we have, ( ) < 1 ( ) < 1. N N N M and M     − − − − 1 (2) 3 (2) (2) (1) (1) 1 = ( ) . 1 p N MN N N MN N v E W v dv M M M        +         −  (11) It is easy to show that for a large N 1 (2) (2) (1) (1) 1 1 ( ) = . 2 1 MN N MN N W v dv M M −  (12) 1 3 [ ( )] [ ( )] = [ ( )] p p N E f E E        − + − 1 3 1 1 [ ( )] [ ( )] 2 2 p p E E        − + − From (10) and (12), for a large N, we have 1 (2) 1 ,1 (2) (2) (2) 2 (1) (1) 1 1 [ ( )] ( ) ( ) 2 1 p p N N MN N N N MN N v v E W v dv M M M M               −  − + − −         −  As 1 p   , we obtain 1 (2) 1 ,1 (2) (2) (1) (1) 1 1 [ ( )] ( ) ( ) 2 1 p p N MN N N MN N v E W v dv M M M           −  − −     −  + 1 (2) ,2 (2) (2) (1) (1) 1 ( ) . 1 p N MN N N MN N v W v dv M M M      −     −  On the other hand, 1 1 (2) ,1 ,1 (2) (2) 0 (1) ( ) ( ) ( ) ( ) p p N N MN N N MN v v W v dv W v dv M M                −   −           For all  belonging to ] , [   − ,1 (2) N N v M          converges to ( )   , uniformly in [ 1,1]. v − Therefore, 1 (2) ,1 (2) (2) (1) (1) 1 ( ) ( ) 1 p N MN N N MN N v W v dv M M M         −     −  converge to zero.
  • 12. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 32 Since = , i w ,2 2 (2) =1 , = (2) 1 1 sin 2 m N i k m N N m i i m N q a v M B v w w M                    −          2 , (2) 1 . 1 sin 2 i k N N a B v M    +               For all = m i , ( ) 2 2 [ 1,1] (2) 1 1 = . sup lim 1 1 sin sin 2 2 k k N v i m i m N v w w w w M    →+  −       −  −             Thus, for large N, we get ( ) 2 2 =1 =1 , , = = (2) {1,2, , } { } 1 1 . 1 1 sin inf sin 2 2 m m k k m m N N m i m i i m i m m q i N q q a a B B v w w w w M        −        +             −  −                   The lemma 2.1 gives 2 2 1 =1 , = (2) 1 1 = . 1 sin 2 m k k m N m i i m N q a O B n v w w M     −             −          (13) For large N, we have ]0,1] (2) (2) = < supv N N v M M     . Consequently 2 2 2 , , (2) (2) 1 . 1 sin 2 k i i k k N N N N a a B B v v M M                         As (1) (2) (2) N N N v M M M      , we obtain 2 , (2) 1 1 sin 2 i k N N a B v M                  2 2 , (1) . k i k N N a B M        Frome the lemma 2.2 , we obtain
  • 13. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 33 ( ) 2 (1) 2 2 1 , (2) 1 = . 1 sin 2 k N i k k N N M a O B n v M      −              + −         (14) Therefore, we get ( ) 2 (1) 1 (2) ,2 (2) (2) 2 1 (2 1) (1) (1) 2 1 ( ) = 1 p p p k N N p k M k N N N MN N M v W v dv O M M n n M           − −            +           −        (15) Choosing (1) N M such that ( ) 2 (1) 2 1 k N k M n  − converges to 0 . For example (1) = b N M n with 1 0 < <1 2 b k − . Thus, [ ( )] [ ( )] = 0. lim p N N E f     →+ − Theorem 4.2 Let < <  −  such that ( ) > 0   . Then,   ( )) N var f  converges to zero. If (1) = c N M n with 2 2 1 1 < < 2 2 c k  , then   (1 2 ) 1 ( )) = O . N c var f n  −       Proof Fisrt suppose that 1 2 { , , , } q w w w   . It is clear that the variance of N f can be written as follows: (1) (1) 1 2 ˆ ˆ [ ( )] = ( ) ( )c ( ), ( ) . ' ' ' N N N N N R var f W u W u ov I u I u dudu      − −    Since W is zero for | |>1  , for large N , we have 1 1 1 1 1 1 1 1 ˆ ˆ [ ( )] = , ( ) ( ) . ' ' ' N N N N N x x var f cov I I W x W x dx dx M M    −       − −              Define two subsets of the 2 [ 1,1] − by: •   2 1 1 1 1 1 = ( , ) [ 1,1] ; | |> , ' ' N L x x x x   − − •   2 2 1 1 1 1 = ( , ) [ 1,1] ; | | , ' ' N L x x x x   − − 
  • 14. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 34 where N  is a nonnegative real, converging to 0 . We split the integral into an integral over the subregion 2 L and an integral over 1 L : 1 2 2 1 var[ ( )] = = . N L L f J J   + +   Cauchy-Schwartz inequality and theorem 3.1, give 1 1 1 1 1 | | 1 1 ( ) ( ) . ' ' ' x x N J C W x W x dx dx  −    where C is constant. Thus, we obtain 1 = ( ) N J O  (16) It remains to show that 2 J converges to zero. For simplicity, we define 1 1 1 2 (1) (1) = ; = , ' N N x x M M     − − and 1 1 (1) (1) ˆ ˆ ( ) = c , . ' N N N N x x C ov I I M M          − −             We first show that ( ) C  converges to zero uniformly in 1 1 , [ 1,1] ' x x  − . Indeed, from lemma 2.3, we have ( ) ( ) | | ( ) 1 / , 1 e ˆ ˆ ( ) ( ) = [ ] . | | iuI v C u v N N p N N p p R e e EI v I v F C du u      −  − − + − − −  Thus, the expression of the covariance becomes ( )   2 2 2 , 2 =1 2 1 2 1 =1 1 2 ( ) = cos ( ) exp | | ( ) | | p p k N k R k k N k p k C F C E u I du du C u u u          − − +       − −    Using the following equality: 2cos cos = cos( ) cos( ) x y x y x y + + − , we have ( ) 1 2 2 =1 =1 1 2 1 =1 1 cos ( ) = exp ( ) ( ) ( ) 2 1 exp ( ) ( 1) ( ) ( ) . 2 k N k k N k k k k k N k k E u I C u H v d v C u H v d v                +       − −           + − − −          By substituting the expression for ( ) C  and changing the variable 2 u to 2 ( ) u − in the second term, we obtain ( ) 2 2 1 2 , 2 1 1 2 ( ) = , | | p ' K K p p R du du C F C e e u u     − − − − + −  (17)
  • 15. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 35 where 1 2 =1 = ( ) ( ) ( ) k N k k R K C u H v d v        −   and 2 =1 = | | ( ) ( ) ' k N k k R K C u H v v dv       −   Since , > 0 ' K K , exp{ } ' K K ' ' ' e e K K K K K − − −  − − − , we obtain: 2 1 2 2 | | ( ; ), ' N K K C u Q     −  where 2 2 1 2 1 2 ( ; ) = | ( ) | | ( ) | ( ) N N N Q H u H u d u           − − −  Now, let us show that 1 2 ( ; ) N Q   converges to zero. Indeed, since  is bounded on [ , ] −  , we have 2 1 2 1 2 2 1 2 =1 ( ; ) sup( ) | ( ) ( ) | ( ) ( ) N N N q i N i N i i Q H u H u du c H w H w               −  − − + − −   (18) From the definition of N H , we can write ( ) ( ) ( ) ( ) ( ) ( ) 1 2 2 1 2 , 1 2 sin sin 1 2 2 | | = . 1 1 sin sin 2 2 k k N N ' N n n v v H v H v dv dv B v v                   − −     − −         − −     − −           a) First step: We show that the denominators of the first and second terms under the last integral do not vanish for the same v, so we suppose thatv exists, belonging to [ , ] −  and , ' z z Z  such as: 1 2 = 2 = 2 ' v z and v z       − − . Since 1 2 =   , then z and z are different. Therefore, ( ) 1 2 = 2 ' z z     − − . Hence, 1 2 1 | |= . ' z z w   − − As 1 2 =0 limN   → − , consequently, for a large N we get: 1 < 2 ' z z − . Thus, we obtain a contradiction with the fact that z and ' z are different integers. b) Second step: Asuume there exist q points, 1 2 , , , [ , ] q V V V  −  such as:
  • 16. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 36 for 1 =1,2, , 2 j j q V Z    −  then 1 j V Z w w  −  , and we assume that there exist ' q points 1 2 , , , [ , ] ' ' ' ' q V V V  −  such that for =1,2, , ' i q 2 ' i V Z w w  −  . Showing that, | |= j V  , | |= i V  for 1 j q   and 1 ' i q   . Indeed, 1< < 0 w  −  − and 0 < <1 w  +  because > 2 w  . Hence Z w  −   and Z w  +   . For a large N , we get that 1 < <1 , E E w w w w    −  −     − +         where  E x is the integer part of x . Hence, 1 Z w w   −  . In the same manner, we show that 1 Z w w   +  . Similarly, it can be shown that 2 Z w  +   . Thus, | |= j V  and | |= i V  . c) Third step: We classify j V and ' i V by increasing order: 1 2 < < < < < j j j ' q q V V V + −  , and we write the integral in the following manner: ( ) ( ) ( ) ( ) 1 2 1 1 2, 3, 4 =1 =1 1 2 1 sin sin 2 2 = 1 1 sin sin 2 2 k k ' ' q q q q i i i i n n v v dv I I I I v v           + + −  −     − −         + + +     − −            where
  • 17. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 37 ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) 1 2 ( ) 1 1 1 1 2 1 2 ( ) 2, ( ) 1 2 3, ( ) sin sin 2 2 = 1 1 sin sin 2 2 sin sin 2 2 = 1 1 sin sin 2 2 = k k V N j k k V N ji i V N ji Vj i V N ji n n v v I dv v v n n v v I dv v v I                         − − + − +     − −             − −             − −             − −           ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) 1 2 ( ) 1 1 2 1 2 4 ( ) 1 1 2 sin sin 2 2 1 1 sin sin 2 2 sin sin 2 2 = 1 1 sin sin 2 2 k k N i k k V N j ' q q n n v v dv v v n n v v I dv v v                        − +  + +     − −             − −             − −             − −           where ( ) N  is a nonnegative real number converging to zero and satisfying: 1 1 2 2 < ( ) < ( ) < ( ) < ( ) < < ( ) < ( ) < , j j j j j j ' ' q q q q V N V N V N V N V N V N       + + − − + − + − +  a nd 1 2 ( ) < . 2 N    − Showing that the first integral converges to zero. For a large N , it easy to see that 1 <  . Without loss of generality, we assume that 1 = 2 j i i V k    − for all i , with i k Z  . The fact that there is no v between − and 1 ( ) j V N  − on which the denominators are vanishing, gives 1 1 1 2 1 2 ( ) 1 . ( ) ( ( )) ( ) ( ) inf sin , sin inf sin , sin 2 2 2 2 j k k k k j V N I V N N              − +       +  − + +              Substituting 1 j V in the last inequality, we get 2 1 2 1 ( ( )) | ( ) | sin = sin 2 2 k k j V N N          − + − + . For a large N ,we obtain
  • 18. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 38 2 1 | ( ) | ( ) ( ) < 2 2 2 N N N         − +   + − . On the other hand, two cases are possible: 1. 2 1 > 0   − , then we have 2 1 2 1 | ( ) |= ( ) > ( ) N N N        − + − + 2. 2 1 < 0   − , since 2 1 | |> 2 ( ) N    − , we have 2 1 1 2 | ( ) |= ( ) > ( ) N N N        − + − − . Therefore, 2 1 | ( ) | ( ) ( ) < < 2 2 2 N N N        − + − . For a large N , we have 1 ( ) < 2 ( ) N     − +  and 2 ( ) < 2 ( ) N     − +  . Then, 1 ( ) ( ) ( ) < < 2 2 2 N N      +  − and 2 ( ) ( ) ( ) < < . 2 2 2 N N      +  − Therefore, 1 1 2 ( ) . ( ) sin 2 j k V N I N    − +   For the integral 2,i I , we bound the first fraction under integral by k n  : ( ) ( ) 2, ( ) 2 1 1 sin 2 V N j k i i k V N ji I n dv v       + −    −      . By substituting for ji V in the last inequality and putting 2 = k v u   − , we get ( ) ( ) 1 2, ( ) 1 2 1 1 sin 2 N k i k N I n du u         + −    −      . Since 1 | |< ( ) u N   − , it is easy to see that : 2 1 2 2 1 1 2 1 | | | | | | | | | | ( ) > 2 u u N          − −  − − −  − − Since ( ) N  converges to zero, for a large N we have 2 1 2 ( ) < | | 2 N         − −     , therefore 2 1 2 2 1 | | | | | | ( ) 0 < < < < . 4 2 2 u N           − − − + Consequently:
  • 19. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 39 2, 1 2 1 2 2 ( ) , | | | | ( ) inf sin ; sin 4 2 k i N n I N            − − +       where 2 1 2 1 | |= N x x M   − − . Then, for a large N , we have 2 1 3 < 2 . 2     − Therefore, 2 1 2 1 2 1 | | | | ( ) | | < < . 4 2 4 N            − − + − − Thus, we bound the integral as follows: 2, 2 1 2 ( ) | |) sin 4 k i k N n I        − Since there is no v between ( ) ji V N  + and 1 ( ) ji V N  + − on which the denominators are vanishing, we get: 1 3, 2 ( ) , j j i i i V V N I A B  + − −   where 1 1 1 2 2 1 ( ) ( ) = inf sin , sin 2 2 ( ) ( ) = inf sin , sin 2 2 k k j j i i k k j j i i V N V N A V N V N B                 + +   − − − +         − − − +       It follows from the hypothesis on ( ) N  that 1 2 1 2 1 2 | | | ( ) | | | ( ) | ( ) | | ( ) | ( ) < < < < . 2 2 2 2 2 2 2 N N N N N                  − − − − − + − The definition of ji V gives
  • 20. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 40 2 1 1 < . ( ) ( ) sin sin 2 2 k k ji V N N       − − Similarly we bound the other terms: 1 3, 2 2 ( ) . ( ) sin 2 j j i i i k V V N I N    + − −  We can show by same majoration that : 1 4 2 ( ) , j j i i V V N I E F  + − −   where 1 1 2 2 ( ) = inf sin , sin 2 2 ( ) = inf sin , sin 2 2 k k jq q k k jq q V N E V N F                +  +   − − −          − − −        Since ( ) N  converges to zero, for a large N , we have 1 2 ( ) < | | 2 N        − −      , and 1 2 2 ( ) < | | 2 N         − −     . It follows that: 4 2 ( ) . ( ) sin 2 jq q k V N I N     +  − −  We recapitulate, from the previous increases, we obtain ( ) ( ) ( ) ( ) 1 2 1 2 =1 2 1 1 2 sin sin ( ) 2 ( ) 2 2 1 1 ( ) | | sin sin sin sin 2 2 2 4 k k k q q j k k i n n v v V N n N dv N v v                     +  −     − −      + −      +     − − −           1 1 2 2 =1 ( ) ( ) ( ) ( ) sin sin 2 2 q q j j j q q i i k k i V N V V N N N        + −  + +  − − − − + +  After simplification, we have
  • 21. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 41 ( ) ( ) ( ) ( ) 1 2 2 2 1 1 2 sin sin 2 2( 1) ( ) 2 ( )( ) 2 2 . 1 1 ( ) | | sin sin sin sin 2 2 2 4 k k k k k n n v v q q N n N q q dv N v v                     −     − −       − + + +      +     − − −          Using the following inequality | | sin 2 x x   , we get ( ) ( ) ( ) ( ) ( ) 2 1 2 2 2 1 1 2 sin sin 2 2 ( )( )(2 ) 2 2 . 1 1 ( ) | | sin sin 2 2 k k k k k k k N n n v v n N q q dv N x x v v M                      −     − −       +      +       − − −              The lemma 2.1 gives ( ) ( ) ( ) ( ) ( ) 1 2 , 1 2 2 2 2 2 1 1 sin sin 1 2 2 1 1 sin sin 2 2 1 2 2 ( )( )(2 ) 2 ( ) k k N k k k k k k k N N n n v v dv B v v N q q n N n M                           − − −     − −               − −               +     +                  .   (19) In order to obtain the convergence of the last expression to zero, we choose ( ) = , > 0 N n    − , such as 2 2 1 1 1 = 0 = 0. lim lim k k k n n k N N n and n n M       − → → + −       (20) Thus, from (18) N Q converges to zero. On the other hand, 2 2 | | 1 2 , 1 1 2 ( ) | | , | | p K K K p p du du C F C K K e u u     −     − − − + − −   −   where ( ) 2 1 2 =1 | | | | ( ; ) k N k N k K K K C u Q             − −  − −  . We denote by: ( ) ( , ) 1 2 = ( ; ) N k N k N Q         − . It follows from (18) and (20) that ( , ) N k   converges to ( )   . Hence,
  • 22. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 42 2 2 2 , 1 2 ( , ) 0 1 =1 2 ( ) 2 ( ; )4 exp ( ) | | . ( ) p k p a N k N k p k k du C F C C Q C u u            −  −    + −      −    Putting ( ) 1 , = , k N k u v     we obtain 2 | | 2 2 1 2 , 1 1 2 2 ( ,1) ( ,2) ( ; ) ( ) 2 . | | C v p N p p p N N Q e C F C C dv v               − −  − − − + −                 (20) Since ( ) > 0   , ( ) C  converges uniformly in 1 1 , [ 1,1] x x − to zero. From (20), we obtain 2 2 (1 ) 1 1 1 1 = . k k k N N J O n n M       − − + −       +               Thus, [ ( )] N var f  converges to zero and then, ( ) N f  is an asymptotically unbiased and consistent estimator. 4. CONCLUSIONS This paper gives an estimate of the spectral density of a mixed continuous-time stable process from observations at discrete instants. To avoid the phenomenon of aliasing we have assumed that the spectral density is a compact support. The applications of these processes are found in various fields. For example: - The study of soil cracking where the observed signal is the resistance of the soil. This signal encounters random jumps due to the encounter of certain stones in the ground. The spectral measurement will therefore be composed of two parts, one continuous and the other discrete. This last corresponds to the resistance jumps encountered during the measurement. - The growth of fruits on a tree can be seen as a continuous distribution, and when there is a fall of a fruit, the other fruits remaining on the tree absorb more energy and their growth will have a jump in value. As perspective of this work is to find the optimum smoothing parameters to have a better rate of convergence. For this purpose, the cross-validation method will be the most appropriate tool. We intend to complete this work by studying the case where the process is observed with random errors. For this, we will use the deconvolution methods known for their efficiency in the presence of random errors. We think to give an estimator of the mode of the spectral density representing the frequency where the spectral density reaches the maximum of energy.
  • 23. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 43 REFERENCES [1] S. Cambanis, (1983)“Complex symetric stable variables and processes” In P.K.SEN, ed, Contributions to Statistics”: Essays in Honour of Norman L. Johnson North-Holland. New York,(P. K. Sen. ed.), pp. 63-79 [2] S. Cambanis, and M. Maejima (1989). “Two classes of self-similar stable processes with stationary increments”. Stochastic Process. Appl. Vol. 32, pp. 305-329 [3] M.B. Marcus and K. Shen (1989). “Bounds for the expected number of level crossings of certain harmonizable infinitely divisible processes”. Stochastic Process. Appl., Vol. 76, no. 1 pp 1-32. [4] E. Masry, S. Cambanis (1984). “Spectral density estimation for stationary stable processes”. Stochastic processes and their applications, Vol. 18, pp. 1-31 North-Holland. [5] G. Samorodnitsky and M. Taqqu (1994). “Stable non Gaussian processes ». Chapman and Hall, New York. [6] K., Panki and S. Renming (2014). “Stable process with singular drift”. Stochastic Process. Appl., Vol. 124, no. 7, pp. 2479-2516 [7] C. Zhen-Qing and W. Longmin (2016). “Uniqueness of stable processes with drift.” Proc. Amer. Math. Soc., Vol. 144, pp. 2661-2675 [8] K. Panki, K. Takumagai and W. Jiang (2017). “Laws of the iterated logarithm for symmetric jump processes”. Bernoulli, Vol. 23, n° 4 pp. 2330-2379. [9] M. Schilder (1970). “Some Structure Theorems for the Symmetric Stable Laws”. Ann. Math. Statist., Vol. 41, no. 2, pp. 412-421. [10] R. Sabre (2012b). “Missing Observations and Evolutionary Spectrum for Random”. International Journal of Future Generation Communication and Networking, Vol. 5, n° 4, pp. 55-64. [11] E. Sousa (1992). “Performance of a spread spectrum packet radio network link in a Poisson of interferences”. IEEE Trans. Inform. Theory, Vol. 38, pp. 1743-1754 [12] M. Shao and C.L. Nikias (1993). “Signal processing with fractional lower order moments: Stable processes and their applications”, Proc. IEEE, Vol.81, pp. 986-1010 [13] C.L. Nikias and M. Shao (1995). “Signal Processing with Alpha-Stable Distributions and Applications”. Wiley, New York [14] S. Kogon and D. Manolakis (1996). “Signal modeling with self-similar alpha- stable processes: The fractional levy motion model”. IEEE Trans. Signal Processing, Vol 44, pp. 1006-1010 [15] N. Azzaoui, L. Clavier, R. Sabre, (2002). “Path delay model based on stable distribution for the 60GHz indoor channel” IEEE GLOBECOM, IEEE, pp. 441-467 [16] J.P. Montillet and Yu. Kegen (2015). “Modeling Geodetic Processes with Levy alpha-Stable Distribution and FARIMA”, Mathematical Geosciences. Vol. 47, no. 6, pp. 627-646. [17] M. Pereyra and H. Batalia (2012). “Modeling Ultrasound Echoes in Skin Tissues Using Symmetric alpha-Stable Processes”. IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control, Vol. 59, n°. 1, pp. 60-72. [18] X. Zhong and A.B. Premkumar (2012). “Particle filtering for acoustic source tracking in impulsive noise with alpha-stable process”. IEEE Sensors Journal, Vol. 13, no. 2, pp. 589 - 600. [19] Wu. Ligang and W. Zidong (2015). “Filtering and Control for Classes of Two-Dimensional Systems”. The series Studies in Systems of, Decision and Control, Vol.18, pp. 1-29. [20] N. Demesh (1988). “Application of the polynomial kernels to the estimation of the spectra of discrete stable stationary processes”. (Russian) Akad.Nauk.ukrain. S.S.R. Inst.Mat. Preprint 64, pp. 12-36 [21] F. Brice, F. Pene, and M. Wendler, (2017) “Stable limit theorem for U-statistic processes indexed by a random walk”, Electron. Commun. Prob., Vol. 22, no. 9, pp.12-20. [22] R. Sabre (2019). “Alpha Stable Filter and Distance for Multifocus Image Fusion”. IJSPS, Vol. 7, no. 2, pp. 66-72. [23] JN. Chen, J.C. Coquille, J.P. Douzals, R. Sabre (1997). “Frequency composition of traction and tillage forces on a mole plough”. Soil and Tillage Research, Vol. 44, pp. 67-76. [24] R. Sabre (1995). “Spectral density estimate for stationary symmetric stable random field”, Applicationes Mathematicaes, Vol. 23, n°. 2, pp. 107-133 [25] R. Sabre (2012a). “Spectral density estimate for alpha-stable p-adic processes”. Revisita Statistica, Vol. 72, n°. 4, pp. 432-448. [26] R. Sabre (2017). “Estimation of additive error in mixed spectra for stable prossess”. Revisita Statistica, Vol. LXXVII, n°. 2, pp. 75-90.
  • 24. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.5, October 2021 44 [27] E. Masry, (1978). “Alias-free sampling: An alternative conceptualization and its applications”, IEEE Trans. Information theory, Vol. 24, pp.317-324. AUTHORS Rachid Sabre received the PhD degree in statistics from the University of Rouen, France, in 1993 and Habilitation to direct research (HdR) from the University of Burgundy, Dijon, France, in 2003. He joined Agrosup Dijon, France, in 1995, where he is an Associate Professor. From 1998 through 2010, he served as a member of Institut de Mathématiques de Bourgogne, France. He was a member of the Scientific Council AgroSup Dijon from 2009 to 2013. From 2012 to 2019, he has been a member of Laboratoire Electronic, Informatique, and Image (LE2I), France. Since 2019 he has been a member of Laboratory Biogeosciences UMR CNRS University Burgundy. He is author/co-author of numerous papers in scientific and technical journals and conference proceedings. His research interests lie in areas of statistical process and spectral analysis for signal and image processing.