Signal separation using linear canonical and fractional

Fourier transforms
Kamalesh Kumar Sharma
a,b,
*
, Shiv Dutt Joshi
b
a
Electronics and Communication Engineering Department, Malaviya National Institute of Technology, Jaipur, India
b
Department of Electrical Engineering, Indian Institute of technology, New Delhi, India
Received 22 December 2005; received in revised form 21 March 2006; accepted 31 March 2006
Abstract
Signal separation is an important operation in many areas such as communications, geophysics, and optics including optical signal
processing. In this article, the issue of signal separation based on the linear canonical transform (LCT) and the fractional Fourier trans-
form (FRFT) is considered. An iterative algorithm for signal separation in the 2-ray ground reected model using the FRFT is also pre-
sented along with the simulation results.
2006 Elsevier B.V. All rights reserved.
Keywords: Linear canonical transform; Fractional Fourier transform; Signal separation; Filtering
1. Introduction
Signal separation and ltering are important operations
frequently encountered in many diverse areas such as com-
munications, geophysics, radar andsonar, andoptics includ-
ing optical signal processing [2,4,8,14]. For instance, in
mobile communications and under-water acoustics, the sig-
nal at the receiver is often expressed as the sum of the trans-
mitted signal and its delayed versions (due to the multi-path
propagation environment) corrupted by some noise signal.
In such a scenario, it will be extremely useful to separate
the desired signal from the other unwanted signals including
the noise terms. Various methods and techniques exist to get
rid of the unwanted signals from the desired signal including
the ltering in the conventional frequency domain [4,10].
Recently, the ltering operation in the conventional fre-
quency domain has been extended to its generalized version,
called fractional Fourier transform (FRFT) domains, and it
has been shown to be more useful to work in the FRFT
domains for some class of signals such as chirp and non-
stationary signals [2,8,14].
In this paper, the issue of signal separation/ltering
using the linear canonical transform (LCT) and the FRFT
is considered. It is shown here that the LCT and the FRFT
can be exploited in some situations to separate the desired
signal from the other signal components. The basic signal
model considered in this article assumes that the given sig-
nal r(t) can be expressed as a linear combination of the
delayed versions of the signal f(t) corrupted by the noise
component n(t) and the aim is to separate the signal f(t)
from it. This signal model is of practical importance in
many areas mentioned earlier such as radar and sonar,
wireless communications, television receivers (appearances
of ghosts due to multi-path propagation), and in many
optical signal-processing applications. It is also shown here
that some signals can be better resolved in the FRFT
domains using the scaling property of the FRFT. An iter-
ative algorithm for signal separation in the 2-ray ground
reected model [10] using the FRFT is also presented here
along with the simulation results.
0030-4018/$ - see front matter 2006 Elsevier B.V. All rights reserved.
doi:10.1016/j.optcom.2006.03.062
*
Corresponding author. Tel.: +91 141 2551693.
E-mail addresses: kksharma_mrec@yahoo.com (K.K. Sharma),
sdjoshi@iitd.ac.ernet.in (S.D. Joshi).
www.elsevier.com/locate/optcom
Optics Communications 265 (2006) 454460
The basic motivation stems from the fact that the LCT
and the FRFT in particular, oer some degree of freedom
to the user in terms of the parameters of the transform
[4,15], which can be exploited eectively as compared to
the ltering in conventional Fourier transform, without
increasing the complexity of the computation, as it can also
be evaluated easily with the same number of computations
as the conventional Fourier transform [4,12].
The rest of the paper is organized as follows. We briey
review the LCT and the FRFT in Section 2. In Section 3, the
LCT based signal separation/ltering is discussed. The
FRFT based signal separation/ltering is discussed in Sec-
tion 4 along with some simulation results. The conclusions
are presented in Section 5.
2. Review of the LCT and the FRFT
The LCT f
M
(u) of a signal f(t) with parameter M is given
by [4]
f
M
u
_
C
M
u; u
0
f u
0
du
0
; 1
where
C
M
u; u
0
A
M
exp jp
D
B
u
2
2
1
B
uu
0

A
B
u
0
2
_ _ _ _
;
A
M

1=B
_
expjp=4 and M
A B
C D
_ _
with determinant AD BC = 1. Various signal transforms
such as the Fresnel transform and the FRFT are simply
special cases of the LCT. The FRFT is in fact a one-param-
eter subgroup of the group of LCTs. To be specic, if we
substitute A = D = cos a and B = C = sina in the matrix
M and evaluate (1), we obtain the FRFT of the signal within
a unit magnitude complex constant. One important prop-
erty of the LCT is its delay property, which is reproduced
below [4, p. 97]:
f u s $
LCT
expjp2usC s
2
ACf
M
u As: 2
It is clear from this property that the LCT of a delayed sig-
nal is a shifted version of the LCT of the original signal
multiplied by a chirp factor. This can be exploited in the l-
tering problems as discussed below in Section 3.
The other details and more discussion on the LCT and
its eigenfunctions can be seen in [4,15] and the references
therein.
The FRFT of a signal f(t), denoted as F
a
(u), is dened as
F
a
u
_
1
1
f tK
a
t; udt;
f t
_
1
1
F
a
uK

a
t; udu;
3
where the transformkernel K
a
(t,u) of the FRFTis givenby[3]
Here, a also corresponds to the rotation angle in the Wigner
domain and
*
denotes complex conjugation. Thus the FRFT
reduces tothe conventional Fourier transformfor a = p/2. In
short notation, we can write as
f t $
a
F
a
u:
Several useful properties are currently under study in the
signal-processing community [13,59,13]. The FRFT has
also been proved to relate to other signal analysis tools such
as Wigner distribution, neural network, wavelet transform
and various chirp related operations [2]. It may be men-
tioned here that the FRFT may be more useful in the cases,
where the signal has some desirable property in the FRFT
domain, such as compact support, lesser number of coe-
cients for its adequate representation (this applies specially
for nonstationary/chirp type of signals) etc. We now men-
tion some properties of the FRFT for ready reference.
Scaling property of the FRFT: this property of the
FRFT gives the eects of scaling of a signal f(t) in the time
domain. It has been shown [3] that if
f t $
a
F
a
u;
then
f ct $
a

1 j cot a
c
2
j cot a

F
b
u sin b
c sin a
_ _
e
jh
;
where tanb = c
2
tana, and
h
u
2
2
cot a 1
cos
2
a
cos
2
b
_ _
: 5
Two other important properties of FRFT, which will be
used in this correspondence for signal separation algo-
rithm, are the following: the rst property relates the
FRFT of the delayed signal to that of the original signal,
f t s $
a
expjps
2
sin a cos a
expj2pus sin aF
a
u s cos a 6
and the other property gives the eect of the multiplication
of a signal by an exponential signal,
expj2pstf t $
a
expjps
2
sin a cos a
expj2pus cos aF
a
u s sin a: 7
K
a
t; u

1j cot a
2p
_
expj
t
2
u
2
2
cot a jtucoseca if a is not a multiple of p;
dt u if a is a multiple of 2p;
dt u if a p is a multiple of 2p:
_

_
4
K.K. Sharma, S.D. Joshi / Optics Communications 265 (2006) 454460 455
It is clear from (6) that as opposed to the case of the con-
ventional Fourier transform, the support of the FRFT of
the delayed signal f(t s) is dierent from the support of
the FRFT of the signal f(t). In fact the F
a
(u) gets shifted
by scos a in the FRFT of the delayed signal f(t s). Simi-
larly, multiplication by an exponential signal exp(j2pst) to
a signal f(t) results in a similar shift of F
a
(u) by ssina. An
excellent and comprehensive discussion of the FRFT can
be found in [4].
3. Signal separation based on the LCT
In this section, we consider the issue of signal separation
based on the LCT. The given signal r(t) is assumed to be a
linear combination of the several delayed versions of the
signal f(t) corrupted by the noise component n(t). The sig-
nal model can be mathematically expressed as
rt

n
j0
k
j
f t s
j
nt 8
with s
0
= 0, and s
1
< s
2
< < s
n
. As mentioned earlier, this
signal model is of practical importance in many areas such
as radar and sonar, wireless communications, television
receivers (appearances of ghosts due to multi-path propaga-
tion), and in many optical signal-processing applications.
On taking the LCT of (8), we get
R
M
u

n
j0
k
j
expip2us
j
C s
2
j
ACF
M
u As
j
N
M
u:
9
It is clear from Eq. (9) that for suciently large values of
the parameter A of the LCT, the separation of the other
components on the right hand side of (9) from the rst
component k
0
F
M
(u) has increased considerably and as a
result if the signal f(t) is bandlimited in the Mth LCT do-
main or approximately a low-pass signal in the Mth LCT
domain, then it can be ltered out easily by performing
the low-pass ltering in the Mth LCT domain. The ltering
in the LCT domain has already been discussed in [11].
We consider another signal model for the signal separa-
tion, which is a modied version of (8), commonly encoun-
tered in the fading environment in a mobile communication
scenario. Here the given signal r(t) is considered as a prod-
uct of a time varying signal x(t) with the signal given in (8).
rt xt

n
j0
k
j
f t s
j

_ _
nt: 10
Now with the following substitution xt

m
k0
a
k
t
k
and
ht

n
j0
k
j
f t s
j

_ _
, we can express r(t) as
rt

m
k0
a
k
t
k
ht nt: 11
On taking the conventional Fourier transform of the above
equation we can write it as
R
p=2
u

m
k0
a
k
i2pa
1
d=du
k
H
p=2
u N
p=2
u:
This constant coecient dierential equation can be solved
for H
p/2
(u), from which one can obtain h(t) easily. Once we
get the signal h(t), it becomes identical to the signal model
already considered in (8). Thus we are able to separate the
desired signal component from the other unwanted compo-
nents using the LCT and the conventional Fourier trans-
form overcoming the fading problem encountered in the
multi-path propagation scenario.
4. Signal separation based on the FRFT
In this section, we consider the problem of signal sepa-
ration using the FRFT. First, we consider the signal sepa-
ration based on the scaling property of the FRFT and in
the next section, an iterative algorithm for the signal sepa-
ration in the 2-ray ground reected model using the delay
property of the FRFT is presented. Simulation results per-
formed in MATLAB for the above algorithm are also pre-
sented here in Section 4.3.
4.1. Signal separation based on the scaling property of the
FRFT
Here, we consider the signal model given below where
the two signals f(t) and h(t) may have large overlap in the
time domain as well as in the other FRFT domains. The
given signal r(t) is assumed as
rt f t ht:
The aim is to increase the separation between the signals
f(t) and h(t) for better resolution of them in some FRFT
domain. If we consider the FRFT of the scaled signal
r(ct) with scaling factor c, then using the scaling property
given in (5), it is easy to observe that the separation be-
tween signals in the bth FRFT domain increases by the fac-
tor sinb/csina, provided the value of scaling factor c and
the value of a is properly selected such that sinb/csina > 1.
Thus the signals f(t) and h(t) can be better separated or re-
solved in the bth FRFT domain using the FRFT of the
scaled signal.
We take an example where scaling property allows us to
better resolve the two components of the signal. Let the
given signal r(t) be given as
rt expx a
1

2
=2 expx a
2

2
=2: 12
Then the separation between the peaks of the two exponen-
tial terms here is a
2
a
1
. It can be easily shown that the
separation between the peaks in the magnitude of the
FRFT with angle a of the signal r(t) increases by (a
2

a
1
)cos a/c. Hence if the values of a and c are properly cho-
sen, the signals can be better resolved in the FRFT domain.
The simulation results for this have been given in Fig. 1,
where it is clear that the signals can be better resolved in
the FRFT domain.
456 K.K. Sharma, S.D. Joshi / Optics Communications 265 (2006) 454460
4.2. Signal separation based on the delay property of the
FRFT
In this section, we consider a specic application of the
signal separation using the delay property of the FRFT.
For this we consider the commonly used model to predict
the propagation path loss in at terrains, i.e., the 2-ray
ground reected model [10] of wave propagation as shown
in Fig. 2. In this model, the direct and the ground reected
rays add at the receiver with a phase dierence with the
consequent possibility of reduction/cancellation in the sig-
nal strength.
If we can separate the delayed (ground reected) compo-
nent from the direct propagation path component using the
FRFT, and add them in phase, we can increase the received
signal strength. The properties of the FRFT which are
being exploited here to our advantage are given in (6)
and (7). It is clear from these properties that the FRFT
of the signal f(t) and its delayed version f(t s) have dier-
ent supports in the FRFT domain, as opposed to the case
of conventional Fourier transform, where the support is
same. This shift between supports of the two signals can
be further increased iteratively using the algorithm pro-
posed here.
Let the received signal x(t) in the 2-ray ground reected
model be expressed as
xt f t k f t s nt; 13
where the signal f(t) is the direct path component, the sig-
nal f(t s) represents the ground reected component, and
the signal n(t) is the additive noise component. Here, we
rst neglect the eect of noise term for brevity, but it can
be taken into account in the simulations. Also the factor
k and s appearing in (13) needs to be estimated from the
received signal x(t), but here we take k = 1 without loss
of generality.
We rst take the FRFT with angle a = p/4 of (13) to get
X
a
u F
a
u expj/sF
a
u s
0
expj2pus
0
; 14
where X
a
(u) and F
a
(u) are the FRFTs of x(t) and f(t),
respectively, and /(t) = exp(jpt
2
sina cos a) with
s
0
s=

2
p
: 15
Now multiplying (13) by e
j2pst
and taking its FRFT with
angle a = p/4, we get
e
j/sj2pus
0
X
a
u s
0
e
j/s
e
j2pus
0
F
a
u s
0

e
j/s
F
a
u 2s
0
e
j2pus
0
s
0
: 16
If we multiply (16) by e
j2/(s)j4pus
0
and subtract it from (14),
we get
X
a
u e
j/sj2pus
0
X
a
u s
0

F
a
u e
j2/sj2pus
0
j2pus
0
s
0
F
a
u 2s
0
: 17
We can observe that compared to the second term in RHS
of (14), the second term in RHS of (17) has more separa-
tion from the rst term in the FRFT domain.
Again multiplying (13) by e
j2p(2s)t
and taking its FRFT
with angle a = p/4, we get
e
j/2sj2pu2s
0

X
a
u 2s
0

e
j/2sj2pu2s
0

F
a
u 2s
0
e
j/s
F
a
u 3s
0
e
j2pu2s
0
s
0
:
18
To cancel out the second term in (17), we multiply (18) by
e
j/(2s)+j2/(s)j6pus
0
j2p(us
0
)s
0
and add in (17) to obtain
X
a
u e
j/sj2pus
0
X
a
us
0
e
j2/sj2pus
0
j2pus
0
s
0
X
a
u2s
0

F
a
u e
j3/sj2pus
0
j2pus
0
s
0
j2pu2s
0
s
0
F
a
u3s
0
: 19
Similarly multiplying (13) by e
j2p(3s)t
and taking its FRFT
with angle a = p/4, we get
e
j/3sj2pu3s
0

X
a
u 3s
0

e
j/3sj2pu3s
0

F
a
u 3s
0
e
j/s
F
a
u 4s
0
e
j2pu3s
0
s
0
:
20
On multiplying (20) by
Fig. 1. (a) The given signal in Eq. (12). (b) The magnitude of the FRFT
with angle a = p/4 of signal given in (a) indicating the increased separation
between them.
Tx
Direct ray
Rx
Ground reflected ray
Fig. 2. 2-Ray ground reected model.
K.K. Sharma, S.D. Joshi / Optics Communications 265 (2006) 454460 457
e
j/3sj3/sj8pus
0
j2pus
0
s
0
j2pu2s
0
s
0
to cancel out the second term in (19) and subtracting it
from (19), we obtain.
X
a
ue
j/sj2pus
0
X
a
us
0
e
j2/sj2pus
0
j2pus
0
s
0
X
a
u2s
0

e
j3/sj2pus
0
j2pus
0
s
0
j2pu2s
0
s
0
X
a
u3s
0

F
a
ue
j4/sj2pus
0
j2pus
0
s
0
j2pu2s
0
s
0
j2pu3s
0
s
0
F
a
u4s
0
:
21
It is noted easily that separation of the second term in RHS
of (21) has increased from the rst term, as compared to
the terms in the RHS of (19). Repeating the above men-
tioned steps of multiplication and alternate addition and
subtraction in the algorithm, we obtain an expression
where the two terms in the RHS have a large separation
and therefore can be easily ltered out in the FRFT do-
main a = p /4, giving us signal F
a
(u). By taking the inverse
FRFT with angle a = p/4 of it, we obtain the signal f(t),
which can be delayed by an amount s and added in phase
with the ground reected component f(t s) of signal x(t).
Thus the signal strength in the above scenario can be
increased, giving us improved signal to noise ratio at the
receiver. The ow chart of the above iterative algorithm
for N number of iterations is given in Fig. 8.
It is assumed in the above analysis that the value of
delay s between the two components f(t) and f(t s) is
known. In practice, this delay factor needs to be estimated
from the received noisy signal x(t). For example, the max-
imum likelihood (ML) estimate of this delay parameter is
given by
^s arg max
s
pxjs;
where the probability density function (pdf) p(xjs) of the
received observations, which are arranged in the vector x,
will be a complex Gaussian probability density function
(pdf) for complex deterministic/random signals f(t) and
f(t s), and complex Gaussian noise term n(t), in general.
Various other methods of time delay estimation also exist
in the literature, e.g. [1618].
This algorithm can be more useful for the class of
signals, which are bandlimited in the FRFT domain
a = p/4. This is because for the nite duration signals in
time domain, the above signal separation problem can be
implemented by simple time delay elements; of course,
the design of the delay elements at high frequencies may
require some special attention. To be specic, delaying
the signal x(t) by amount s and subtracting it from x(t),
we get
xt xt s f t f t 2s;
where the separation between the rst term and second
term has increased. Similarly, we can write
xt xt s xt 2s f t f t 3s:
This iterative process in time domain can be repeated for a
desired number of times until the signal f(t) is well sepa-
rated from its delayed version, where one can again use a
window function in time domain to separate the desired
signal from unwanted delayed copy of it. But even in such
situations also, the FRFT can be useful to eliminate the
noise term before applying this algorithm using techniques
described in [14] in some optimum FRFT domain.
If the signal f(t) is having innite support in time
domain, the above iterative process in time domain will
not be able to lter the desired signal even after suciently
large number of iterations. But if the signal f(t) has com-
pact support in some FRFT domain, it can be easily sepa-
rated using the above-proposed approach/algorithm in the
FRFT domain.
It may also be mentioned that if the value of scos a is lar-
ger than the support of the FRFT of the signal f(t), then
the desired signal f(t) can be separated from the given sig-
nal x(t) in one step only because here on taking the FRFT
of the x(t), we get two terms which are well separated in
FRFT domain and can be ltered out easily as evident
from (19).
4.3. Simulation results
The proposed algorithm is simulated in MATLAB with
f(t) taken as a rectangular pulse. Fig. 3(a) given below indi-
cates the FRFT with angle a = p/4, of the received signal
x(t) in (13). The results after rst and second iteration of
the proposed algorithm are shown in Fig. 3(b) and (c),
respectively, which clearly shows that the separation
between the two components has increased in these gures
as compared to the original signal shown in Fig. 3(a). This
separated component can be windowed in the FRFT
domain and inverse FRFT of the result will give us the
original signal f(t). Simulation results for the second exam-
ple is given in Fig. 4, where the signal is taken to be an
Fig. 3. (a) The FRFT of the signal x(t), when f(t) is a pulse signal and
a = 0.5, s = 11. (b) The results after rst iteration of the proposed
algorithm. (c) The results after second iteration of the proposed algorithm.
458 K.K. Sharma, S.D. Joshi / Optics Communications 265 (2006) 454460
exponentially decaying chirp, which is very commonly used
in sonar and radar applications, i.e.,
f t expt cost
2
=2:
Here also the results given in Fig. 4(b) and (c) indicate that
the signal separation has increased as compared to Fig. 4(a).
The residuals/imperfect cancellation present in these
gures is because of the innite support of the FRFT of
the signals taken here in the FRFT domain. Nevertheless,
the simulations support the theory behind the algorithm
clearly.
The residuals/artifacts present in these gures may
also be because of the nite-word length eects/nite num-
ber of samples taken in the simulations. The FRFT in these
simulations was calculated using the freely available MAT-
LAB routines in [12].
The ecacy of the algorithm up to a particular SNR can
also be tested by adding some noise in the given signal
model and studying its eect on the separation and signal
resolvability. The eects of sensitivity of the algorithm to
the change in the angle of the FRFT and estimation error
in the value of the delay parameter s can also be evaluated
through simulations and the results of the simulations are
Fig. 4. (a) The FRFT of the signal x(t), when f(t) is an exponentially
decaying signal and a = 0.5, s = 20. (b) The results after rst iteration of
the proposed algorithm. (c) The results after second iteration of the
proposed algorithm.
Fig. 5. (a) The FRFT of the signal x(t), when f(t) is a pulse signal and
a = 0.499, s = 11. (b) The results after rst iteration of the proposed
algorithm. (c) The results after second iteration of the proposed algorithm.
Fig. 6. (a) The FRFT of the signal x(t), when f(t) is a pulse signal and
a = 0.5, s = 9.9. (b) The results after rst iteration of the proposed
algorithm. (c) The results after second iteration of the proposed algorithm.
Fig. 7. (a) The FRFT of the signal x(t), when f(t) is a pulse signal and
a = 0.499, s = 8.9. (b) The results after rst iteration of the proposed
algorithm. (c) The results after second iteration of the proposed algorithm.
K.K. Sharma, S.D. Joshi / Optics Communications 265 (2006) 454460 459
shown in Figs. 57 for a true value of delay parameter
s = 11. It is clear that the algorithm is very sensitive with
respect to the estimation errors in the value of the delay
parameter s and the angle of the FRFT.
5. Conclusion
The issue of signal separation based on the properties of
the LCT and the FRFT was considered here. An iterative
algorithm for signal separation in the 2-ray signal model
using the FRFTwas also presented along with its simulation
results. We can separate the delayed (ground reected) com-
ponent from the direct propagation path component using
this algorithmand add them in phase increasing the received
signal strength. The LCT and the FRFT based signal sepa-
ration techniques considered here may also nd applications
in mobile environments and under-water acoustics to over-
come the fading problem. It would be of interest to extend
the iterative algorithm for arbitrary number of rays in the
assumed signal model for the signal separation.
References
[1] V. Namias, J. Inst. Math. Appl. 25 (1980) 241.
[2] H.M. Ozaktas, B. Barshan, J. Opt. Soc. Am. A 11 (1994) 547.
[3] L.B. Almeida, IEEE Trans. Signal Process. 42 (11) (1994) 3084.
[4] H.M. Ozaktas, Z. Zalevsky, M.A. Kutay, The Fractional Fourier
Transform with Applications in Optics and Signal Processing, Wiley,
New York, 2001.
[5] L.B. Almeida, IEEE Signal Process. Lett. 4 (1) (1997) 15.
[6] A.I. Zayed, IEEE Signal Process. Lett. 5 (4) (1998) 101.
[7] K.K. Sharma, S.D. Joshi, Opt. Commun. 257 (1) (2006) 27.
[8] K.K. Sharma, S.D. Joshi, in: Proceedings of NCC 2006, New Delhi,
India, January 2006, p. 151.
[9] M.F. Erden, H.M. Ozaktas, D. Mendlovic, Opt. Commun. 125 (1996)
288.
[10] T.S. Rappaport, Wireless Communications Principles and Practice,
Prentice Hall, 1996.
[11] B. Barshan, M.A. Kutay, H.M. Ozaktas, Opt. Commun. 135 (13)
(1997) 32.
[12] J. O Neill, Discrete TFDs: A collection of Matlab les for time
frequency analysis, 1999. Available from: <ftp.mathworks.com/pub/
contrib/v5/signal/Discrete>, TFDs.
[13] G. Cariolaro, T. Erseghe, P. Kraniauskas, N. Laurenti, IEEE Trans.
Signal Process. 48 (1) (2000) 227.
[14] M. Alper Kutay, Haldun M. Ozaktas, Orhan Arikan, Levent Onural,
IEEE Trans. Signal Process. 45 (5) (1997) 1129.
[15] S.-C. Pei, J.-J. Ding, IEEE Trans. Signal Process. 50 (1) (2002) 11.
[16] C.H. Knapp, G.C. Carter, IEEE Trans. Acoust. Speech Signal
Process. ASSP-24 (4) (1976) 320.
[17] M.A. Rodriguez, R.H. Williams, T.J. Carlow, IEEE Trans. Acoust.
Speech Signal Process. ASSP-29 (3) (1981) 508.
[18] K.K. Sharma, S.D. Joshi, in: Proceedings of NCC 2006, New Delhi,
India, January 2006, p. 155.
No
Yes
Let { } Result= ( ) F x t

and
1 1
( ) ( ).exp( 2 ( ) 4 ) S u Y u j j u = where
/ 2 =
1
Result = Result- ( ) S u
Calculate
1
1
( ) ( ).exp[ ( ) ( )
2 ( 1) 2 ( )]
N N
N
i
S u Y u j N jN
j N u u i

=
= +
+ +
N
Result=Result+(-1) ( )
N
S u
N=N+1
Take signals
( ) ( ) ( ) x t f t f t = + and let
( ) ( ) exp( 2 )
N
x t x t j N t = and
{ } ( ) ( )
N N
Y u F x t

=
Enter the number of desired
iterations, say N=M
Is N=M
Multiply result by a window to
separate the desired signal
Fig. 8. Flow chart for the iterative algorithm proposed for signal
separation in 2-ray ground reected model.
460 K.K. Sharma, S.D. Joshi / Optics Communications 265 (2006) 454460