Signal Processing ] (]]]]) ]]]]]]

Contents lists available at ScienceDirect

Signal Processing
journal homepage: www.elsevier.com/locate/sigpro

Sampling random signals in a fractional Fourier domain

Ran Tao n, Feng Zhang, Yue Wang
Department of Electronic Engineering, Beijing Institute of Technology, Beijing 100081, China

a r t i c l e in f o
Article history: Received 21 February 2010 Received in revised form 12 November 2010 Accepted 20 November 2010 Keywords: Random signals Fractional Fourier transform Fractional power spectrum Fractional correlation Multi-channel sampling Periodic nonuniform sampling

abstract
In this paper, we consider the sampling and reconstruction schemes for random signals in the fractional Fourier domain. We dene the bandlimited random signal in the fractional Fourier domain, and then propose the uniform sampling and multi-channel sampling theorems for the bandlimited random signal in the fractional Fourier domain by analyzing statistical properties of the input and the output signals for the fractional Fourier lters. Our formulation and results are general and include derivative sampling and periodic nonuniform sampling in the fractional Fourier domain for random signals as special cases. & 2010 Elsevier B.V. All rights reserved.

1. Introduction Digital signal processing relies on sampling a signal and reconstructing it from its samples. Consequently, sampling theory lies at the heart of signal processing as the digital applications have developed rapidly over the last few decades. Shannon sampling theory (also attributed to Nyquist, Whittaker and Kotelnikov) is the milestone both in terms of achievement and conciseness, which states that for a complete reconstruction of an original bandlimited signal the sampling rate must be at least twice the maximum frequency present in the signal. (This is the so-called Nyquist rate.) [1,2] The reconstruction formula that complements the sampling theorem is xt
1 X n 1

xnT

sin pt=Tn pt=Tn

where T is the sampling interval. In this widely used theorem, the signal is assumed to be bandlimited or compact in the Fourier domain. Thus, the sampling theorem associated with
Corresponding author. E-mail addresses: rantao@bit.edu.cn (R. Tao), oUo@bit.edu.cn (F. Zhang). 0165-1684/$ - see front matter & 2010 Elsevier B.V. All rights reserved. doi:10.1016/j.sigpro.2010.11.006
n

the Fourier transform (FT) represents a signal in terms of sinusoidals. In fact, many natural signals are better represented in alternative bases other than the Fourier basis. As the fractional Fourier transform (FRFT) is a generalization of the conventional Fourier transform and has found many applications in optics and signal processing [311], the study of the sampling theorems associated with the FRFT has blossomed in recent years [1218]. In [12], Xia rstly shows that if a nonzero signal x(t) is bandlimited in the fractional Fourier domain with angle a, then it cannot be bandlimited in the fractional Fourier domain with respect to another angle b where ba7 a +np for any integer n. Then, the sampling expansion and spectral properties for a uniformly sampled signal bandlimited in the fractional Fourier domain have been derived from different ways [1215]. In [16], the spectral analysis and reconstruction of a periodic nonuniformly sampled signal bandlimited in the fractional Fourier domain are presented. A more general sampling theorem is considered in [17], where the multi-channel sampling theorem in the fractional Fourier domain is also studied. Recently, sampling and reconstruction of sparse signals in the fractional Fourier domain have been presented [18]. The above sampling theorems assert that if a signal has a narrower bandwidth or compact support in a fractional

Please cite this article as: R. Tao, et al., Sampling random signals in a fractional Fourier domain, Signal Process. (2010), doi:10.1016/j.sigpro.2010.11.006

R. Tao et al. / Signal Processing ] (]]]]) ]]]]]]

Fourier domain, then we can use the FRFT instead of the FT to sample a signal with a larger sampling interval. Therefore, the classical sampling methods are not always efcient with the possibility of unnecessary computational cost. In practice, signals are often of random character. While all previous generalized sampling approaches have typically dealt with the class of deterministic signals of known nite spectral support in the fractional Fourier domain, we will consider sampling methods for random signals with known spectral densities. Firstly, we dene a bandlimited random signal in the fractional Fourier domain using the fractional power spectrum. Then, we address the problem of reconstructing the random signal with nite power spectral support in the fractional Fourier domain from uniform samples and multi-channel samples. Instead of perfect reconstruction of the original signal in terms of the samples, we determine the reconstruction through minimization of the mean squared error (MSE) between the signal and its reconstructed version. In particular, we construct two kinds of multi-channel sampling structures for fractional correlation functions. Our formulation and proof are general and include derivative sampling and periodic nonuniform sampling in the fractional Fourier domain for random signals as special cases. 2. Preliminaries 2.1. The fractional Fourier transform The FRFT with angle a of a signal x(t) is dened as [3,4] exp jp sgnsin a=4 exp ja=2 Xa u Fa xtu pq  2p sin a Z 1 2 2 eju t =2cot ajutcsca xt dt 1
1

superscript n is the complex conjugation. Motivated by the fact that the FRFT generalizes the FT in a rotational manner, the ath fractional auto-correlation function of x(t) is dened as [19] Z T 1 Rxx t2 t,t2 ejt2 tcota dt2 5 Ra t lim xx T-1 2T T Then, the ath fractional power spectral density can be given by [19] r 1 j cot a a 2 a Fa Rxx t ueju =2cota Pxx u 6 2p From (5) and (6) we can see that both a time average and an ensemble average are in the fractional correlation function, and the fractional power spectrum is expressed in terms of the fractional correlation function. When a = p/2, (6) becomes the WienerKhinchine theorem. Filtering in a fractional Fourier domain can be expressed as [7,9] s1 t Fa Fa s0 t Ha u where Ha(u) is the transfer function, s0(t) is the deterministic input signal and s1(t) is the corresponding output signal. Let x(t) and y(t) be the random input and output of a a a fractional Fourier lter Ha(u), respectively; Pxx u and Pyy u be the fractional auto-power spectra of x(t) and y(t), a respectively; and Pyx u be the fractional cross-power spectrum. Then the inputoutput relationships of the fractional power spectral density for Ha(u) are expressed as [19]
a a Pyx u Ha uPxx u

and  2 a a Pyy u Ha u Pxx u 3. Sampling random signals in the fractional Fourier domain In this section, we treat the problem of reconstructing a random signal that has compact support in the fractional Fourier domain from a sequence of its uniform samples and multi-channel samples. To analyze the sampling of random signals in the fractional Fourier domain, we rstly give the denition of a bandlimited random signal in the fractional Fourier domain. Denition 1. A random signal x(t) is said to be bandlimited in the ath fractional Fourier domain if its fractional power spectral density satises
a Pxx u 0,

where sgnU is the sign function. For a =0 and a = p/2, the FRFT reduces to the identity transform and the conventional FT, respectively. Note that the factor exp   pq jp sgnsin a=4 exp ja=2 = 2p sin a is sometimes p simplied as 1j cot a=2p. The fundamental property of the FRFT is the angle additivity property, which can be given by 2 Fa b xtu Fa Fb xt u Besides, the FRFT has the following important space shift and phase shift properties [3]: Fa xtt Xa utcosaejt
2

=2sin a cos ajut sin a

3 4

h i 2 Fa xtejvt Xa uv sin aejv =2sin a cos a juv sin a

9u9 4 ur

where t and v represent the space and phase shift parameters, respectively. More details on the FRFT can be found in [3,4]. 2.2. The fractional power spectral density For a random signal {x(t), NotoN}, its auto-correlation function is dened by Rxx(t1,t2)=Rxx(t2 + t,t2)=E[x(t1)xn(t2)] where Ed indicates the statistical expectation, t =t1 t2, and

where ur is the smallest number such that (9) holds true and is called the bandwidth of the random signal x(t) in the fractional Fourier domain. 3.1. Uniform sampling theorem for bandlimited random signals in the fractional Fourier domain Let a deterministic signal x(t) be bandlimited in the

ath fractional Fourier domain with the bandwidth ur,

Please cite this article as: R. Tao, et al., Sampling random signals in a fractional Fourier domain, Signal Process. (2010), doi:10.1016/j.sigpro.2010.11.006

R. Tao et al. / Signal Processing ] (]]]]) ]]]]]]

i.e., Fa[x(t)]= 0 when 9u94ur. Then, the signal x(t) can be reconstructed from its uniform samples [12]: xt ejt
2

=2cot a

1 X n 1

xnTejn

2 2

T =2cot a

sinur cscatnT ur cscatnT 10

Substituting (15) into (13), we can deduce that 2 ^ E xtxt x mT Ra tmTejmTtmTcota ejt =2cot a xx ( 1 X 2 2 Ra nTmTejn T =2cot ajmTnTmTcot a xx
n 1

where the sampling interval T satises p sin a=T ur . It should be pointed that ur cscatnT pt=Tn. Now, let us consider the case of uniform sampling for a bandlimited random signal in the fractional Fourier domain. We have the following sampling theorem: Theorem 1. Let a random signal x(t) be bandlimited in the ath fractional Fourier domain with the bandwidth ur. If its 2 chirped form, i.e., xtejt =2cot a , is stationary in the wide sense, then x(t) can be reconstructed as xt l:i:m: ejt
2

sinur tnTcsca ur tnTcsca

) : 16

According to (3), (4) and (6), the FRFT of the fractional correlation function with space shift and phase shift can be written as h i 2 Fa Ra tt0 ejt0 tcota Fa Ra t ejt0 =2cot ajut0 csca xx xx s 2p 2 2 Pa ueju =2cotajt0 =2cot ajut0 csca 1 j cot a xx Note that the random signal x(t) is bandlimited in the ath fractional Fourier domain, i.e., the ath fractional power spectral density of the signal x(t) obeys (9). Thus the shifted fractional correlation function Ra tt0 ejt0 t cot a is banxx dlimited in the ath fractional Fourier domain with the bandwidth ur. Applying the uniform sampling expansion to the deterministic function Ra tt0 ejt0 t cot a yields xx
Ra tt0 ejt0 t cot a ejt xx
2

=2cot a

1 X n 1

xnTejn

2 2

T =2cot a

sinur tnTcsca ur tnTcsca

11

where l:i:m: stands for limit in the mean square sense or convergence in probability as well, i.e., (" N  X 2 2 2  lim E xtejt =2cot a xnTejn T =2cot a  N-1 n N #2 ) sinur tnTcsca  0 ur tnTcsca  and sampling interval T p sin a=ur . ^ Proof. Let the estimate xt be ^ xt ejt
2

=2cot a

1 X n 1

ejn

2 2

T =2cot a a Rxx nT 0

ejt0 nT cot a

sinur tnTcsca ur tnTcsca

17

Interchanging the variables t = t and t0 = mT in (17), we obtain

Ra tmTejmTt cot a ejt xx
T =2cot a sinur tnTcsca ur tnTcsca
2

=2cot a

1 X n 1

ejn

T 2 =2cot a a Rxx nTmT

=2cot a

1 X n 1

xnTejn

2 2

ejmnT

cot a

sinur tnTcsca ur tnTcsca

18

12 Then, we have 2 ^ E xtxt x mT Rxx t,mTejt =2cota 1 X sinur tnTcsca 2 2 Rxx nT,mTejn T =2cota ur tnTcsca n 1
2

13

Substituting (18) into (16), we deduce ^ 19 E xtxt x mT 0 ^ This means that, for every m, xtxt is orthogonal to ^ ^ x(mT). Since xt is a linear summation of x(mT), xtxt ^ is also orthogonal to xt, i.e., ^ ^ 20 E xtxt x t 0 On the other hand,
1 X 2 ^ Rxx nT,t E xtxt x t Rxx t,tejt =2cot a n 1

Since xtejt =2cot a is wide-sense stationary (WSS), we have that h i 2 2 E xt1 ejt1 =2cota x t2 ejt2 =2cota ejt2 t ejt
2 2 2 t2 =2cot a

Ext2 tx t2 Rxx t2 t,t2 14

=2cot a jt2 t cot a

is only a function of the variable t where t =t1 t2. That is to say ejt2 t cot a Rxx t2 t,t2 is only a function of the variable t, then the fractional correlation function of x(t) can be expressed as Z T 1 Rxx t2 t,t2 ejt2 t cot a dt2 Ra t lim xx T-1 2T T Rxx r t, rejrt cot a where the equation is valid for all r. 15

sinur tnTcsca e ur tnTcsca 1 X 2 a 0 Rxx Ra nTtejnTt =2cot a xx

jnT 2 =2cot a n 1

sinur tnTcsca ur tnTcsca

21

Similarly, choosing the variables t = t0 =t in (17), we obtain Ra 0ejt xx

2

cot a

ejt

=2cot a

1 X n 1

ejn

2 2

T =2cot a a Rxx nTt

Please cite this article as: R. Tao, et al., Sampling random signals in a fractional Fourier domain, Signal Process. (2010), doi:10.1016/j.sigpro.2010.11.006

R. Tao et al. / Signal Processing ] (]]]]) ]]]]]]

ejtnT cot a

sinur tnTcsca ur tnTcsca

22

Substituting (22) into (21) yields ^ E xtxt x t 0

23

Therefore, combining (20) and (23), we can obtain h 2 i ^ ^ ^ E xtxt E xtxt x tx t ^ ^ ^ E xtxt x t E xtxt x t 0: This concludes the proof of the theorem.

can be regarded as special cases of this generalized sampling method such as derivative sampling and periodic nonuniform sampling in the fractional Fourier domain. In this part, we consider this generalized sampling for the bandlimited random signal in the fractional Fourier domain. We have the following theorem: Theorem 2. Let a random signal x(t) be bandlimited in the

ath fractional Fourier domain with the bandwidth ur, and its
chirped form, i.e., xtejt =2cot a , be stationary in the wide sense. If the random signal x(t) is processed by M ath fractional Fourier lters Ha,k(u) resulting M outputs gk(t), k 1,. . .,M, then x(t) can be reconstructed in terms of the samples gk(nT) in the mean square sense: xt l:i:m:ejt
2 2

Remarks. Theorem 1 can be developed and understood from another aspect. Let xc(t) denote the chirped form of the signal x(t), i.e., xc t xte
jt 2 =2cot a

=2cot a

1 M X X n 1 k 1

24

gk nTejn

2 2

T =2cot a

yk tnT 28

Since the random signal x(t) is bandlimited in the ath fractional Fourier domain with the bandwidth ur, by (6) and (9) we can derive Z ur h i 2 2 2 a Pxx ueju =2cot a eju t =2 cot a jutcsca du Ra t xx u Z urr 2 a Pxx uejt =2cot a jutcsca du 25
ur

where l:i:m: stands for limit in the mean square sense or convergence in probability as well, i.e.,
8" #2 9 <  N M  = X X 2 2 2   0 lim E xtejt =2cota gk nTejn T =2cota yk tnT   ; N-1 :  n N
k1

Since xc(t) is WSS, we can obtain its auto-correlation function from (14) and (15): Rxc xc t ej 2 cota jt2 tcota Rxx t2 t,t2 ej 2 cota Ra t xx Combining (25) and (26), we have Z ur 2 a Pxx uejutcsca du Rxc xc t Ra tejt =2cot a xx
ur
t2 t2

26

and sampling interval is T Mp sin a=ur . R u c Here, reconstruction kernel functions yk t 1=c urr Yk u,tejutcsca du, k 1,. . .,M, and M functions Yk(u,t) are obtained by solving the following M linear equations:
8 > H1 uY1 u,t HM uYM u,t 1 > > > < H1 u cY1 u,t HM u cYM u,t ejctcsca > > > > : H1 u M1cY1 u,t HM u M1cYM u,t ejM1ctcsca

27

We can see that xc(t) is conventionally bandlimited with the bandwidth ur csca. Therefore, applying the classical reconstruction to the bandlimited random signal xc(t), we can obtain (11). In fact, we can utilize the chirp multiplication (Q) and FRFT (F a ) operators for the development [4]. Eq. (10) establishes the relationship between an original random signal and its uniform samples. From Theorem 1, for a bandlimited random signal in the fractional Fourier domain, we can reconstruct the original signal in terms of its uniform samples x(nT) in mean square sense, provided the sampling interval satises T rp sin a=ur . 3.2. Multi-channel sampling theorem for bandlimited random signals in the fractional Fourier domain There is a variety of applications in which a signal is sampled in other ways, such as derivative sampling or periodic nonuniform sampling [20,21]. In [22], Papoulis has introduced the multi-channel sampling (generalized sampling) theorem, and the derivative sampling and the periodic nonuniform sampling are typical instances of it. In [17], the generalized sampling theorem for deterministic signals bandlimited in the fractional Fourier domain is obtained. Multi-channel sampling theorem in the fractional Fourier domain is a generalized sampling theorem. Many sampling strategies in the fractional Fourier domain

29 where ur rur ur +c and c 2ur =M. Proof. Rewriting the fractional Fourier lter in the form ! 2 Ha,k u H a,k ueju =2cot a , we have ! 2 Ga,k u Xa uHa,k u Xa u H a,k ueju =2cot a 30

where Ga,k(u) is the ath FRFT of gk(t). From the denition of the FRFT, we have r Z 1 2 2 1jcot a 2 Ga,k u eju =2cot a eju t =2cot ajutcsca xt dt
2p 1 r Z 1 ! 2 2 1j cot a eju v =2 cot ajuvcsca h k v dv 2p 1 r!2 Z 1 Z 1 1j cot a 2 2 2 eju t v =2cot ajut vcsca 2p 1 1 ! xt h k v dt dv

By making the change of variable v = z t, we can obtain a convolution form of (30): r ! 1j cot a 2 2 2 xtejt =2cot a h k tejt =2cot a gk tejt =2cot a 2p 31 where n denotes the conventional convolution operator.

Please cite this article as: R. Tao, et al., Sampling random signals in a fractional Fourier domain, Signal Process. (2010), doi:10.1016/j.sigpro.2010.11.006

R. Tao et al. / Signal Processing ] (]]]]) ]]]]]]

Note that xtejt =2cot a is a wide-sense stationary random 2 signal. Then, from (31) we can obtain that gk tejt =2cot a is also 2 wide-sense stationary, and random signals xtejt =2cot a and jt2 =2cot a are jointly wide-sense stationary. gk te From (6) and (7), we have
a a Pgk ,x u Ha,k uPxx u

Let the estimate ^ xt ejt

2 =2cot

1 M X X n 1 k 1

gk nTejn

2 T 2 =2cot

ay

k tnT

38 According to the joint stationarity of the random signals 2 2 xtejt =2cot a and gk tejt =2cot a , we can derive 2 ^ E xtxt x t Rx,x t,tejt =2cot a 1 M X X 2 Rgk ,x nT,tejnT =2cot a yk tnT
n 1 k 1

32

and h i Fa Rak ,x t Ha,k uFa Ra t : g x,x

33

From (33) we can see that, the deterministic fractional correlation function Ra t can be seen as the input of the M x,x fractional Fourier lters Ha,k(u), k 1,. . .,M, and consequently results in M deterministic outputs Rak ,x t. We g show this important relation in Fig. 1, where Ta,k u p R 1 1j cot a=2p 1 yk tejutcsca dt. Therefore, applying the generalized sampling theorem in the fractional Fourier domain to the fractional correlation function Ra t, we can obtain x,x Ra t ejt x,x
2

Ra 0ejt =2cot a x,x 1 M X X 2 Rgk ,x nT,tejnT =2cot a yk tnT

n 1 k 1

Ra 0ejt =2cot a x,x 1 M X X 2 Rak ,x nTtejtnTt ejnT =2cot a yk tnT: g

n 1 k 1

39 Let t = t0 =t in (37) and then substitute the result into (39): ^ E xtxt x t 0 40 On the other hand, according to (38), for the samples gl(mT) of the lth output we have ^ E xtxt gl mT Rx,gl t,mTejt
2

=2cot a

1 M X X n 1 k 1

Rak ,x nTejn g

2 2

T =2cot a

yk tnT 34

From (31), we can obtain its time-delay version: gk tt0 ejtt0 =2cot a r ! 2 1j cot a 2 xtt0 ejtt0 =2cot a h k tejt =2cot a 2p which can be further written as h i 2 2 gk tt0 ejt0 2tt0 =2cot a ejt =2cot a r i 1j cot ah 2 xtt0 ejt0 2tt0 =2cot a 2p ! 2 2 ejt =2cot a h k tejt =2cot a According to (36), we can rewrite (34) as
Ra tt0 ejt0 2tt0 =2cot a ejt x,x e
jt2 2nT t0 =2cot a jn2 T 2 =2cot a 0
2 2

=2cot a

1 M X X n 1k 1

Rgk ,gl nT,mT 41

35

ejnT

=2cot a

yk tnT

According to the properties of the fractional correlation function Ra l t, we have x,g h i h i 42 Fa Rak ,gl t Ha,k uFa Ra l t , k 1,. . .,M g x,g 36 and
a a Pgk ,gl u Ha,k uPx,gl u,

k 1,. . .,M

43

=2cot a

1 M X X n 1 k 1

Rak ,x nTt0 g

yk tnT

37

From (43) we can see that the deterministic fractional correlation function Ra l t can be seen as the input of the M x,g fractional Fourier lters Ha,k(u), k 1,. . .,M, and results in M deterministic outputs Rak ,gl t. We show this important g relation in Fig. 2.

Fig. 1. The generalized sampling conguration where the input is Ra t. x,x

Fig. 2. The generalized sampling conguration where the input is Ra l t. x,g

Please cite this article as: R. Tao, et al., Sampling random signals in a fractional Fourier domain, Signal Process. (2010), doi:10.1016/j.sigpro.2010.11.006

R. Tao et al. / Signal Processing ] (]]]]) ]]]]]]

Therefore, applying the generalized sampling theorem in the fractional Fourier domain to the fractional correlation function Ra l t, we can obtain x,g Ra l t ejt x,g
2

and its derivatives:

xt l:i:m: ejt ejnT
2 2

=2cot a

1 X n 1

4 sin2

sa tnTcsca
2

! #

=2cot a

1 X

M X

n 1 k 1

Rak ,gl nTejn g

2 2

T =2cot a

yk tnT 44

xunTsin a j nTxnTcos a =2cot a s2 tnTcsca sa tnTcsca2 a xnT

"

48 where the sampling interval is T 2p sin a=ur . Proof. Since the FRFT has the following properties [3]: Fa xut Xu ucos a juXa usin a a
2 2

Similar to (37), we can further obtain

Rx,gl tt0 e
a
jt2 2tt0 =2cot a 0

jt2 =2cot a

1 M X X n 1 k 1

Rak ,gl nTt0 ejt0 2nT t0 =2cot a ejn g

T =2cot a

yk tnT

Fa txt uXa ucos a jXu usin a a then

45 Replacing t = t and t0 = mT in (45), and then substituting the result into (41) yields 2 ^ E xtxt gl mT Rx,gl t,mTejt =2cot a Ra
1 M X X n 1 k 1
2 jmTtmTcot a ejt =2cot a x,gl tmTe

Fa xutsin a j txtcos a juXa u Hence, by considering the case of Theorem 2 for M =2 with Ha,1(u) =1 and Ha,2(u) =ju, and after some derivations, we can obtain the result. Corollary 2. Consider a periodic nonuniform sampling scheme: the sampling points are divided into groups of M points with each group having a period of T. Denoting the points in one period by tk, k 1,. . .,M, the complete set of sample points can be written as nT +tk, n . . .,1,0,1,. . ., k 1,. . .,M, where T M p sin a=ur . Let a random signal x(t) be bandlimited in the ath fractional Fourier domain with the 2 bandwidth ur. If its chirped form, i.e., xtejt =2cot a , is stationary in the wide sense, then x(t) can be reconstructed from its periodic nonuniform samples: xt l:i:m: ejt
2

Rgk ,gl nT,mTejnT

=2cot a

yk tnT

1 M X X n 1 k 1

Rak ,gl nTmTejmTnTmTcot a g yk tnT 0 46

ejnT

=2cot a

From (46) we can obtain that for every m and l, 1rl rM, ^ ^ xtxt and gl(mT) are orthogonal. Since xt is a linear summation of the signals gl(mT), we have ^ ^ E xtxt x t 0 47 Combining (40) and (47), we can obtain h 2 i ^ ^ ^ E xtxt E xtxt x tx t ^ ^ ^ E xtxt x t E xtxt x t 0 This completes the proof.

=2cot a

M 1 X X

xnT tk ejnT tk

=2cot a

k 1 n 1 Q 1nM M 1 sin ttq =T q Q tnTtk =T M 1,qak sin tk tq =T q

49

where nT + tk are sampling points and T Mp sin a=ur . Proof. According to (3) and (4), we have h i 2 Fa xt tk ejtk cot a t Xa uejtk =2cot a jutk csc a Then, by choosing Ha,k u ejtk =2cot a jutk csc a in the case of Theorem 2 we can obtain the result. 4. Conclusion In this paper, we have treated the problem of sampling and reconstruction of random signals in the fractional Fourier domain. We have shown that for bandlimited random signals in the fractional Fourier domain, the original signal can be reconstructed from its uniform samples and multi-channel samples in MSE sense. Our formulation and proof are general, and include derivative sampling and periodic nonuniform sampling in the fractional Fourier domain for random signals as special cases.
2

From Theorem 2, for a bandlimited random signal in the fractional Fourier domain, we can reconstruct the original signal in terms of generalized samples gl(nT), 1 rlrM in the sense of mean square. Note that Theorem 2 has a similar form with the classical result in Papoulis work [Eq. (39), 22]. Since derivative sampling and periodic nonuniform sampling strategies in the fractional Fourier domain can be seen as the special cases of the generalized sampling method in the fractional Fourier domain by choosing special fractional Fourier lters Ha,k(u), we can obtain the reconstruction methods for bandlimited random signals in the fractional Fourier domain from derivative samples and periodic nonuniform samples that are listed as follows. Corollary 1. Let a random signal x(t) be bandlimited in the ath fractional Fourier domain with the bandwidth ur. If its 2 chirped form, i.e., xtejt =2cot a , is stationary in the wide sense, then x(t) can be reconstructed from the samples of the signal

Acknowledgements This work was supported in part by the National Science Foundation of China for Distinguished Young Scholars under

Please cite this article as: R. Tao, et al., Sampling random signals in a fractional Fourier domain, Signal Process. (2010), doi:10.1016/j.sigpro.2010.11.006

R. Tao et al. / Signal Processing ] (]]]]) ]]]]]]

Grant 60625104, the National Natural Science Foundation of China under Grants 60890072 and 60572094 and the National Key Basic Research Program Founded by MOST under Grant 2009CB724003. References
[1] A.J. Jerri, The Shannon sampling theoremits various extensions and applications: a tutorial review, Proc. IEEE 65 (11) (1977) 15651596. [2] M. Unser, Sampling-50 years after Shannon, Proc. IEEE 88 (4) (2000) 569587. [3] L.B. Almeida, The fractional Fourier transform and timefrequency representations, IEEE Trans. Signal Process 42 (11) (1994) 30843091. [4] H.M. Ozaktas, Z. Zalevsky, M.A. Kutay, The Fractional Fourier Transform with Applications in Optics and Signal Processing, Wiley, New York, 2000. [5] D. Mendlovic, H.M. Ozaktas, Fractional Fourier transforms and their optical implementation: I, J. Opt. Soc. Am. A 10 (1993) 18751881. [6] H.M. Ozaktas, D. Mendlovic, Fractional Fourier transforms and their optical implementation: II, J. Opt. Soc. Am. A 10 (1993) 25222531. [7] H.M. Ozaktas, B. Barshan, D. Mendlovic, L. Onural, Convolution, ltering, and multiplexing in fractional Fourier domains and their relation to chirp and wavelet transforms, J. Opt. Soc. Am. A 11 (1994) 547559. [8] H.M. Ozaktas, O. Arikan, M.A. Kutay, G. Bozdagi, Digital computation of the fractional Fourier transform, IEEE Trans. Signal Process. 44 (9) (1996) 21412150. [9] M.A. Kutay, H.M. Ozaktas, O. Arikan, L. Onural, Optimal ltering in fractional Fourier domains, IEEE Trans. Signal Process. 45 (5) (1997) 11291143. [10] I.S. Yetik, A. Nehorai, Beamforming using the fractional Fourier transform, IEEE Trans. Signal Process. 51 (6) (2003) 16631668.

[11] H.-B. Sun, G.-S. Liu, H. Gu, W.-M. Su, Application of the fractional Fourier transform to moving target detection in airborne SAR, IEEE Trans. Aerosp. Electron. Syst. 38 (4) (2002) 14161424. [12] X.-G. Xia, On bandlimited signals with fractional Fourier transform, IEEE Signal Process. Lett. 3 (3) (1996) 7274. [13] R. Torres, P. Pellat-Finet, Y. Torres, Sampling theorem for fractional bandlimited signals: a self-contained proof. Application to digital holography, IEEE Signal Process. Lett. 13 (11) (2006) 676679. [14] R. Tao, B. Deng, W.-Q. Zhang, Y. Wang, Sampling and sampling rate conversion of band-limited signals in the fractional Fourier transform domain, IEEE Trans. Signal Process 56 (1) (2008) 158171. [15] C. Candan, H.M. Ozaktas, Sampling and series expansion theorems for fractional Fourier and other transforms, Signal Process. 83 (11) (2003) 24552457. [16] R. Tao, B.-Z. Li, Y. Wang, Spectral analysis and reconstruction for periodic nonuniformly samples signals in fractional Fourier domain, IEEE Trans. Signal Process. 55 (7) (2007) 35413547. [17] F. Zhang, R. Tao, Y. Wang, Multi-channel sampling theorems for band-limited signals with fractional Fourier transform, Sci. China 51 (6) (2008) 790802. [18] A. Bhandari, P. Marziliano, Sampling and reconstruction of sparse signals in fractional Fourier domain, IEEE Signal Process. Lett. 17 (3) (2010) 221224. [19] R. Tao, F. Zhang, Y. Wang, Fractional power spectrum, IEEE Trans. Signal Process. 56 (9) (2008) 41994206. [20] Y.C. Eldar, A.V. Oppenheim, Filterbank reconstruction of bandlimited signals from nonuniform and generalized samples, IEEE Trans. Signal Process 48 (10) (2000) 28642875. [21] Y.-C. Jenq, Digital spectra of nonuniformly sampled signals: fundamentals and high-speed waveform digitizers, IEEE Trans. Instrum. Meas. 37 (2) (1988) 245251. [22] A. Papoulis, Generalized sampling expansion, IEEE Trans. Circ. Syst. CAS-24 (11) (1977) 652654.

Please cite this article as: R. Tao, et al., Sampling random signals in a fractional Fourier domain, Signal Process. (2010), doi:10.1016/j.sigpro.2010.11.006