Professional Documents
Culture Documents
ABSTRACT
Many information-processing applications are based
on digital data although the origin of most sources of
information is analog. A new signal sampling and
representation framework for such purposes is
introduced in this work. We use prolate spheroidal
wave functions (PSWF) to represent analog signals
by digital information. The proposed method can be
applied to reconstruct signals on a finite interval from
a finite number of discrete samples. It is shown that,
contrary to the Nyquist approximation, the
reconstruction error of the proposed technique can be
made as small as desired. The new method is
applicable to general signals including twodimensional sources of images. Experimental results
are presented and discussed. Our conclusion is that
the proposed approach to signal representation using
PSWF could be superior to presently available
methods and may be instrumental in most practical
cases of digital signals, which are naturally of finite
support.
KEYWORDS
Analog to Digital Conversion, Sampling Theorem,
Approximation, Reconstruction, Prolate Spheroidal
Wave Functions.
1 INTRODUCTION
Nyquist sampling theorem is widely accepted as
a means of representing band-limited signals by
their digital samples. Its main drawbacks,
however, are that practical signals are timelimited and therefore not band-limited and that
in order to reconstruct a band-limited signal an
infinite number of samples are required.
Nevertheless, although in most cases Nyquist
theorem cannot be used to perfectly reconstruct
(1)
70
Proceedings of the Third International Conference on Digital Information Processing, E-Business and Cloud Computing, Reduit, Mauritius 2015
n
sin (2 (x 2))
() = ( )
,
n
2
2 (x
)
=
2
= 2.
(2)
))
2
() =
,
2
(
)
=
2
= 2
(2 (
(4)
{ () ()22 } = { | () ()|2 }
1
= 2
(),
(5)
||>
() = |
Figure 1. Signal reconstruction using a finite number of
samples within a given interval. As can be seen, an error
is likely to occur mainly near both ends of the interval.
))
2
| .
2 (
)
2
(2 (
(6)
))
2
() =
,
2 (
)
=
2
2
(2 (
(3)
71
Proceedings of the Third International Conference on Digital Information Processing, E-Business and Cloud Computing, Reduit, Mauritius 2015
(7)
4
4 < 4 + 6
4 + 6 < .
(8)
()
|
,
| | |
4
+ 6 .
(9)
(10)
0 ,
(11)
|| >
such that:
1
() ()
=0
2 [,]
= (), ()2[,] ,
(12)
72
Proceedings of the Third International Conference on Digital Information Processing, E-Business and Cloud Computing, Reduit, Mauritius 2015
N1
y(x) (a n + a n ) n n (x)
n=0
L2 [1,1]
|a n n |2
(16)
n=N
N1
+ |a n |2 .
n=0
Figure 4.
Numerical presentation of the PSWF
eigenvalue decay.
() ()
=0
0,
2 [1,1]
| | | |2 ,
(15)
n=N
(17)
(14)
| |2 ,
n=0
() ()
|2
|y(x) a n n n (x)|
(13)
2 [,]
N1
| n a n n (x)| ,
=0
n (x)2L2 [1,1]
n (x)2L2 [,]
(18)
73
Proceedings of the Third International Conference on Digital Information Processing, E-Business and Cloud Computing, Reduit, Mauritius 2015
and
T
(19)
where:
0 (x0 )
(x) = [
0 (xN1 )
N1 (x0 )
] ,
N1 (xN1 )
a al (x) N | n a n
2
l2
n=N
(21)
(23)
a al 2 | + 0.5|.
2
(20)
(x Zeros )
l2
a = 1 (x)y(x) ,
(22)
a = [0 a 0 , , N1 a N1 ] .
(24)
n + 0.5| ,
() ()
=0
2 [1,1]
(25)
| |2 + 2 | + 0.5| .
=
2
|a n
n | sup|a n |
nN
n=N
|
N|
1 e2
(26)
|
n a n n + 0.5|
n=N
Figure 5. ( )
| |2
norm bound. As can be seen, all
|
N|
N + 1
,
(1 e2 )
(27)
curve.
74
Proceedings of the Third International Conference on Digital Information Processing, E-Business and Cloud Computing, Reduit, Mauritius 2015
sup|a n | |a n |2 yL2 .
nN
(28)
n=N
|a n |2 |
N| (
n=N
1
1 e2
2 N + 1
).
(1 e2 )
(29)
1
1
e2
2 N + 1
).
(1 e2 )
proposed
approach
significantly,
by
approximately 20. A related two-dimensional
result is shown in Fig. 8.
4 CONCLUSION
A new framework for digital signal
representation has been introduced in this work.
We have compared it with the standard
bandlimited interpolation and with a fast
decaying kernel. The main advantage of the new
method over uniform sampling is that here a
small increase in oversampling results in a
significant decrease of the approximation error.
This behavior of the approximation error is due
to the fast decay of the eigenvalues of the PSWF
N for 4 + 6.
Our conclusion is that the proposed approach is
superior to presently available methods. The
new method could be instrumental in most
practical cases of processing of finite support
signals [6],[7], especially in cases where the
sampling-interval multiplied by the bandwidth is
small.
(30)
75
Proceedings of the Third International Conference on Digital Information Processing, E-Business and Cloud Computing, Reduit, Mauritius 2015
() ()
=0
1
2 [,]
() 1 { ()}
=0
1
.
2 [,]
() ()
=0
2 [,]
Derivation of (14):
1
() ()
=0
2 [1,1]
() ()
=0
2 [1,1]
+ ()
=
2 [1,1]
+ | |2
() ()
=0
2 [,]
2 [1,1]
APPENDIX A
Derivation of (17):
1
|() ()|
Derivation of (13):
1 { ()} = ()2
.
()2
=0
1
( ) 2
|() ()|
=0
|(0 ) (0 )| =
() ()
=0
+ | ()|
().
=0
2 [,]
76
Proceedings of the Third International Conference on Digital Information Processing, E-Business and Cloud Computing, Reduit, Mauritius 2015
Derivation of (27):
| (() ()) 20 |
=0
1
|() ()|
=0
2
| |2 |
1 |
=
=+1
2
(1) |2 =
|
1 | |
=0
=+1
=+1
Therefore:
1
|(0 ) (0 )| | (0 )|
=0
(+1)
=+1
=0
( + )
,
(1 )2
= () () =
=+1
2(+1) ( 2
() (() ())
1
=0
() () = |( ) ( )|
=0
=0
2
(+1)
2 =
17
(+1) 2 + ( + 1) ( + 1) 2
(+1)
1 2
=0 =
By choosing m = N:
=+1
| ( )| | + 0.5|
=0 =
=0
+ ( + 1) ( + 1) 2 )
,
(1 2 )2
Therefore:
() () ()
2
2 = 2 2 =
2 |() ()|
|
+ 0.5|
= | + 0.5|
=
+ 1
.
1 2
As a consequence:
2 | + 0.5| .
|
+ 0.5|
| |2
=
+ 1
.
1 2
Derivation of (26):
2
() |2 = 2 =
|
| |
1
1 2
2
1 2 1 2
1 2
=
()
1 2
By choosing = :
2
|
|
=
REFERENCES
2
2
|
| | | | | | |
=
[1]
[2]
Therefore:
ACKNOWLEDGMENT
|
|
1 2
77
Proceedings of the Third International Conference on Digital Information Processing, E-Business and Cloud Computing, Reduit, Mauritius 2015
[3]
[4]
[5]
[6]
[7]
78