A Variable Step-Size Proportionate Affine Projection Algorithm for Echo Cancellation

Li XU

A Variable Step-Size Proportionate Affine Projection Algorithm for Echo

Cancellation
1,2

Li XU
School of Information Engineering, Changan University, Xian 710064, Shanxi, China,
E-MAIL: xuli@chd.edu.cn
2
Shanxi Road Traffic Detection and Equipment Engineering Research Center, Xian

Abstract
The sparseness-controlled improved proportionate affine projection algorithm (SC-IPAPA) has
been proposed recently to accelerate convergence rate for acoustic both network and echo
cancellation in both sparse and dispersive circumstances. Unfortunately, there are conflicting
objectives between fast convergence and low mis-adjustment for the algorithm with fixed step size
parameter. In this paper we proposed a variable step-size version of it, namely VSS-SC-IPAPA,
providing a feasible solution for this problem. The new algorithm obtained a new step size control
approach for proportionate affine projection algorithm by forcing the a posteriori error not to be zero,
but to be the disturbance signal. It incorporates the advantages of the sparseness-controlled algorithm,
data reusing method and variable step size algorithm. Echo cancellation simulation results confirm
that the proposed algorithm can constitute a significant improvement in the convergence speed with
very small mis-adjustment when compared with SC-IPAPA employing fixed step-size constant
parameter. Furthermore, this algorithm offers the overall best performance compare to other variable
step-size algorithms across the range of sparseness measure.

Keywords: Sparseness-Controlled, Variable Step Size, Echo Cancellation

1. Introduction
Adaptive algorithms have become a popular topic in signal processing field and have been
widely used in signal processing practices, such as system identification [1][2], acoustic echo
cancellation (AEC) [3] and adaptive channel equalization [4] and so on. The conventional
adaptive filtering algorithms with a uniform step-size across all filter coefficients such as the
normalized least mean square (NLMS) algorithm suffer slow convergence for sparse network
echo cancellation applications. A recently proposed modification of NLMSthe proportionate
normalized least-mean-square (PNLMS) algorithm [5] exploits the sparseness of the echo
path impulse response to speed up the initial convergence of the conventional NLMS algorithm.
However, after the initial period, the PNLMS algorithm begins to slow down dramatically. The
IPNLMS algorithm is proposed in [6] to improve the convergence of PNLMS after its fast
initial period. It alternates the PNLMS algorithm and the NLMS algorithm during the adaptation.
IPNLMS, as demonstrated in [7], presents more optimal way how to exploit the shape of the
estimated echo path so as to perform better than NLMS with sparse impulse responses for and
have better performance than PNLMS in some cases, for dispersive impulse responses. One of
the major drawbacks of the IPNLMS algorithm is its slow convergence for colored input signals.
The improved proportionate affine projection algorithm (IPAPA) [8] is a natural extension of
proportionate NLMS algorithms. It is expected to present faster convergence for highly
correlated input signals. However, its performance on non-sparse systems can be relatively poor.
In order to address the problem of slow convergence in IPAPA for dispersive system, a
sparseness-controlled IPAPA algorithm (SC-IPAPA) is proposed in [9] by incorporating the
sparseness measure into IPAPA such that the proportionate term in the IPAPA update is
allocated a higher weighting for increasing sparse systems.
The SC-IPAPA algorithm uses a step-size parameter to control their performances.
Nevertheless, a compromise should be made when choosing this parameter; a large value
implies fast convergence rate, while a small value leads to low mis-adjustment and good
robustness features. In order to deal with this problem, various schemes for controlling the stepsize have been proposed in the literature[10]. Nevertheless, most of the existing VSS-NLMS

International Journal of Advancements in Computing Technology(IJACT)

Volume4,Number10,June 2012
doi:10.4156/ijact.vol4.issue10.13

109

A Variable Step-Size Proportionate Affine Projection Algorithm for Echo Cancellation

Li XU

require the tuning of some parameters which are not a priori available or have to be estimated
(e.g., background noise power). For real-world AEC applications, it is highly desirable to use
nonparametric algorithms, in the sense that no information about the acoustic environment is
required. The VSS-NLMS algorithm presented in [11] does not need any additional information
regarding the acoustic environment, so it is efficient and easy to control in real-world AEC
applications. In [12], it was extended further to affine projection algorithm (APA) with a new
perspective of signal enhancement. However, these approaches are only applicable for nonproportionate adaptive algorithms. In [13], a variable step-size approach is obtained for segment
proportionate APA (VSS-SPAPA) by forcing the posterior error to cancel negative effect of
disturbance signal. This approach is independent from the proportionate step-size control matrix.
Since, it is easy to control in practice.
In order to approach the goal of finding a variable step-size proportionate affine projection
algorithm suitable for any type of echo path impulse response, we will apply the idea of VSSSPAPA to the SC-IPAPA and propose a variable step-size SC-IPAPA algorithm. The algorithm
provides a simple and efficient solution to the conflicting requirements of fast convergence and
low mis-adjustment needed by any adaptive system. The experimental results indicate the good
performance of the proposed algorithm.

2. SC-IPAPA
A general AEC configuration is depicted in Fig. 1, where the goal is to model an unknown
system h using an adaptive filter w . Both systems are assumed to be finite impulse response filters,
defined by the real-valued vectors:

h(k ) [h1 (k ), h2 (k ),....hN (k )]T

(1)

w(k ) [ w1 (k ), w2 (k ),....wN (k )]

(2)

where N is the adaptive filter length assumed to be equal to the unknown room impulse response and

x(k ) is the far-end

speech which goes through the acoustic impulse response, providing the echo signal y ( k ) . This signal
is added with the near-end signal v (k ) (which can contain both the background noise and the near-end
speech), resulting the microphone signal d (k ) . The output of the adaptive filter y (k ) provides a
the superscript

is defined as the transposition operator. In an AEC scenario,

replica of the echo, which will be subtracted from the microphone signal. For simplicity, the goal of
this paper is limited to the single-talk case, when the near-end signal consists of only of the background
noise.
x (k )

y (k )
v(k )

d (k )

y ( k )
e( k )

Figure 1. Schematic diagram of an acoustic echo canceller

The SC-IPAPA is expected to converge faster than the SC-IPNLMS algorithm for colored input signals.
It exploits more information from the input signal, not only the current input vector but also the most
recent P input vectors. We first define the input matrix X (k ) as the P successive input vector and
the desired vector

D(k ) as the P successive past value of d (k ) :

Xk x(k )x(k 1)x(k P 1)

(3)

110

A Variable Step-Size Proportionate Affine Projection Algorithm for Echo Cancellation

Li XU

D(k ) [d (k ) d (k 1) ... d (k P 1)]T X T (k )h V (k )

(4)

Where x( k ) [x(k ), x( k 1),..., x( k N 1)] is the input vector, d ( k ) h ( k ) x( k ) v( k )

T

is the desired signal, V ( k ) v( k )v( k 1) v (k P 1)

Accordingly, the priori error signal

is the disturbance signal vector.

E (k ) and the posteriori error signal (k ) can be written using the

adaptive filter coefficients at time k , as:

E (k ) [e(k ) e(k 1) ... e(k P 1)]T D(k ) X T (k ) w(k )

(k ) [e(k ) e(k 1) ... e(k P 1)]T D(k ) X T (k ) w(k 1)
Where e(k ) and e(k ) are the priori error signal and the posteriori error signal, as:

(5)
(6)

e(k ) d (k ) wT (k ) x(k ) (hT (k ) wT ( k )) x( k ) v( k )

(7)

e(k ) d (k ) wT (k 1) x(k ) (hT (k ) wT (k 1)) x(k ) v(k )

(8)

In order to improve the robustness to the sparseness of impulse response, the SC-IPAPA incorporates
the degree of sparseness for an impulse response, namely ( k ) , into IPAPA. The sparseness of current
adaptive filter

(k ) is estimated as

(k )

w(k ) 1
N
1
N N
N w(k )

(9)

Where
N

w(k ) 1 wn (k ) and w(k ) 2

n 1

w (k )
n 1

,The value of

(k )

is between 0 and 1.

The SC-IPAPA can be generalized using the following set of equations [9]:

w(k 1) w(k ) Q(k ) X (k )[ I P X T (k )Q(k ) X (k )]1 E (k ) (10)

Q (k ) diag{q1 (k ) q2 (k ) ... qN (k ) }

1 0.5 ( k )

qn ( k )
N

(11)

1 [1 0.5(k )] (1 ) w (k )

(12)

2 w(k ) 1
2N

where is the regularization parameter , I P is a P P identity matrix, is the adaptive stepsize ,

is a very small positive number to avoid division by zero. The parameter

is

predetermined and constant during the adaptation process. Such as = 0, 0.5 or 0.75, is a
favorable choice for most echo cancellation applications. In order to avoid the dividing by zero or a
small number in the computation of sparseness measure at the early stages of the adaptive process, this
adapting process can be employed for k N . For k N the elements of the Q ( k ) is computed
using the actual IPAPA equation.

3. The proposed algorithm

For SC-IPAPA, the step-size parameter reflects a trade-off between fast convergence and low
steady-state misalignment. One solution to decrease the steady-state misalignment is variable step-size
technique.
Let us rewrite (10) in a different form

w(k 1) w(k ) Q(k ) X (k )[ I P X T (k )Q(k ) X (k )]1 (k ) E (k )

Where

(k ) diag 0 (k ) 1 (k ) ... P 1 (k ) is

a P P diagonal matrix.

(13)

Pre-multiplying

111

A Variable Step-Size Proportionate Affine Projection Algorithm for Echo Cancellation

Li XU

X T (k ) at both sides of (13), then taking (5) and (6) into account, a relation between the a priori error
and the a posterior error is obtained as:

(k ) I P (k ) E (k )

(14)

e(k p ) 1 p (k ) e(k p), p 1, 2, , P

It can be observed that the a posteriori estimation error

(k )

(15)

is determined by the step size parameter

(k ) and error vector E (k )

and is independent from Q ( k ) .In a noise free system, a straightforward

method for determining the step-size parameter is to force the a posteriori output estimation error to be
zeros, i.e., (k ) 0 .This is the case of the classical SC- IPAPA algorithm; apparently, this could be
the optimum value of the step-size parameter. However, in practical applications, the disturbance
signal v (k ) is inevitable, forcing the posteriori error ( k ) to be zero will force the adaptive filter to
adapt the disturbance signal, it results from (6) that ( k ) X ( k )( h w(k 1)) V ( k ) , which
will bias the adaptive filter estimate.
Therefore, in the presence of V ( k ) , the coefficients should be updated to make the posteriori error
not to be zero, but to be the disturbance signal [14]:
(k ) V (k )
(16)
T

In practical application, the disturbance signal V ( k ) is not available, but its power level can be
approximately estimated. Therefore, a more reasonable condition is

E 2 (k ) V2 (k ) v20 (k ) v2( P 1) (k )

where

vp2 (k ), p 0,1, P 1 denote the pth

mathematical expectation and

elements of the vectors

V2 (k ) , E

V2 (k ) E V 2 (k ) is the power of the system noise.

(17)

denotes the

Squaring (14) and taking the expectations results in

E e 2 (k p) (1 p (k )) 2 E e 2 (k p )

(18)

e(k p ) and e(k p) denote the ( p 1)th elements of vectors (k ) and E (k ) ,

with p 0,1, , P .As a quadratic equation, equation (18) has two solutions. Following the analysis

where

from [13] [14], so a more reasonable solution is

p (k ) 1 E e 2 (k p ) E e 2 (k p )

Taking (17) into account, we can get

In practice,

p (k ) 1 vp2 (k ) E e 2 (k p)

(19)

(20)

E e 2 (k p) has to be evaluated in terms of power estimate ep2 (k ) and can be

computed as

(21)
ep2 (k ) ep2 (k 1) 1 e2 (k p)
where (0 1) is an exponential window. Its value is chosen as 1 1 ( MN ) . A large M
2
can obtain a smooth estimate of ep ( k ) but it will decrease the tracking ability of the adaptive filter.
Consequently, the step-size parameter from (20) can be expressed as

p (k ) 1 vp2 (k ) ep2 (k ), p 0,1, P 1

(22)

2
Looking at (22) it can be seen that before the algorithm converges, ep ( k ) is large compared to

vp2 (k )

and consequently the adaptation step is close to 1, which provides the fastest convergence.

112

A Variable Step-Size Proportionate Affine Projection Algorithm for Echo Cancellation

Li XU

ep2 (k )

After the adaptive filter reaches a certain degree convergence,

becomes small,

hence p ( k ) decreases. Consequently, low misalignment can be obtained. In addition, a practical issue
has to be addressed. The initial value ep (0) should be a small positive number to avoid being divided
2

vp2 (k ) , can be obtained during the

by zero in (21), The power estimation of the disturbance signal

silences and can be assumed constant. Nevertheless, the background noise can be time-variant, so that
the power of the background noise should be periodically estimated [13].
Let us consider the previous cases in a more unified framework. The desired vector at time index k
can be expressed as
D(k ) Y (k ) V (k )
(23)

where Y ( k ) X ( k ) h y (k ) y ( k 1) y (k P 1)
T

. Since the echo signal and the

background noise can be considered uncorrelated, Squaring (23) and taking the expectation of both
sides, it results that

E D 2 (k ) E Y 2 (k ) E V 2 (k )

(24)

Assuming that the adaptive filter has converged to a certain degree, it can be considered that

E Y 2 (k ) E Y 2 (k )

(25)

Where Y ( k ) X ( k ) w( k ) y ( k ) y ( k 1) y ( k P 1) , Consequently,
T

E V (k ) E D (k ) E Y 2 (k )
2

(26)

Similar to (21)the previous relation can be rewritten in terms of power estimates as

2
2
vp2 (k ) dp
(k ) yp
(k )
2
2
2
(27)
dp (k ) dp (k 1) 1 d (k p)
2
2
2 (k p)
( k ) yp
( k 1) 1 y
yp
2
2
Where dp (k ), p 0,1, , P 1 denotes a power estimate of d (k p ) , Accordingly, yp
(k )
represents a power estimate of y ( k p ) .Consequently, (26) can be rewritten as:
2
2
p (k ) 1 ( dp2 (k ) yp
( k )) ep ( k ), p 0,1, P 1

(28)

Regarding (22), a few practical issues have to be considered. First, in order to avoid divisions by zero,
a small positive constant , known as the regularization factor, needs to be added to the denominator
in (28). Secondly, under the assumptions from (24) and (25), we have

E d 2 (k p ) E y 2 (k p) . Nevertheless, the estimates of these parameters, computed

according to (27), could lead to minor deviations from the previous theoretical conditions, so that we
will take the absolute value of the step-size parameter from (28)[12]. Third, the estimate of

ep2 (k ) and vp2 (k )

could slightly deviate from their theoretical values, which could result in a

negative step size or large one to drive the adaptive algorithm to diverge. Therefore, the value of
p (k ) should be restricted in a range to guarantee the adaptive algorithm convergence. In [13],

p (k ) is set a small positive constant p min (k ) when ep2 (k ) vp2 (k ) .The upper bound obtained
for the value of

p (k ) is important from the practical point of view, because it gives us an indication

of the maximum value of p ( k ) that could be used in order to achieve convergence of the
coefficients. In most cases, the value of p ( k ) should not be chosen close to the upper bound. Since,

113

A Variable Step-Size Proportionate Affine Projection Algorithm for Echo Cancellation

Li XU

p (k ) must be restricted in the range p min (k ) p (k ) p max (k ) 2 , Consequently, in all

the analyzed cases, so the variable step-size parameters can be computed as:

p min (k ) if p (k ) p min (k )

p (k ) pmax (k ) if else p (k ) pmax (k )

(29)

2
2
2
(k ) yp
p (k ) 1 ( dp
( k )) ( ep ( k )), otherwise

It is interesting to notice that the variable step-size parameter is independent with the proportionate
step-size control matrix Q(k ) , since the proposed algorithm provides a simple, straightforward
approach to control its global step-size parameter. In addition, the step-size of the proposed VSS-SCIPAPA does not depend explicitly on the background noise, even if it was developed taking into
account its presence; consequently, a robust behavior under background noise variations is expected.
Furthermore, Suitable choice of p min (k ) and pmax (k ) can make the proposed algorithm robust to
2
an inaccurate estimate of vp ( k ) . This makes it very preferable in practical application.

4. Computational Complexity
Compared to the APA, the additional computation load of the proposed VSS-SC-IPAPA is
composed of five parts. First, the additional computation of estimating the sparseness, in (9),
that consumes N 5 multipliers/division, 2 N 4 additions and 1 square root. Second, the
calculation of Q(k ) costs approximate 2 N additions and 4 N multiplications or divisions.

Q(k ) X (k ) require an additional PN multiplications. Fourth, the

estimate of ( k ) and calculation of ( k ) will require an additional 4 P 6 multiplications
or divisions, P square-root operations, and 2 P 2 additions or subtractions. Finally, the
calculation of ( k ) E ( k ) consumes P multiplication. The remaining operations are common

Third, the calculation of

2
ep

with APA. In general, the dominant additional computation cost of the proposed VSS-SPAPA is
( P 5) N 5 P 11 multiplications or divisions operations, 2 N 2 P 6 additions and

P 1 square-root operations. For practical applications, the computation of the sparseness

measure ( k ) is unnecessary at each iteration, because it changes relatively slowly. It can be
calculated in a large interval varying from 10 to N [12], thus its computational cost is greatly
reduced without loss of performance. Furthermore, the value of projection order P is usually in
the range of 2 to 8. Therefore the additional computational complexity of the proposed VSS-SCIPAPA is light.

5. Simulation and discussion

In this section, the proposed algorithm (VSS-SC-IPAPA) is compared with the SC-IPAPA [9],
VSS-APA [12], VSS-SPAPA [13] in an acoustic echo cancellation application. The acoustic
impulse response h(k ) is generated synthetically using the method proposed in [14]. Three kinds
of performance are compared: convergence speed, steady-state misalignment and tracking ability,
using a speech sequence for input signals. The disturbance signal v(k ) is zero-mean white
Gaussian signal that is uncorrelated to the input signal. And is adjusted to get 20dB signal-tonoise ratio (SNR) for all the experiments. We assume that the noise power

v2 (k ) , is known. The

value
of
the
projection
order
is
for
all
the
P2
8
2
algorithms. 10 , p min (k ) 0.005 , p max (k ) 0.8 , ep (0) 0.1 and the weighting

114

A Variable Step-Size Proportionate Affine Projection Algorithm for Echo Cancellation

Li XU

factor uses K 6 for VSS-APA, VSS-SPAPA and the proposed algorithm. The measure of
performance is the normalized misalignment (in dB), defined as

10 log10 h(k ) w(k )

h( k )

(30)

1
0.8

0.5

0.4

magnitude

magnitude

0.6

0.2
0
-0.2
-0.4

-0.5

-0.6
-1

-0.8
-1
0

100

200

300

400

-1.5

500

50

100

150

200

(n)

250

300

350

400

450

500

(n)

(a) sparse impulse response

(b) dispersive impulse responses

Figure 2. Impulse responses

In this first experiment we used impulse response as shown in Fig. 2(a) with N 512 . Fig.3
illustrates the convergence speed of the related algorithms when the echo path is sparse. It can be seen
that VSS-SC-IPAPA and VSS-SPAPA converge much faster than VSS-APA. The proposed algorithm
has an initial convergence rate similar to the SC-IPAPA 0.5 . However, it can offer an
improvement of approximate 10dB normalized misalignment. To achieve this low level misalignment,
a small step-size is necessary for the SC-IPAPA, in this case 0.01 , whose convergence rate is
significantly reduced as compared to the proposed VSS-SC-IPAPA.
5

2
0

VSS-APA

SC-IPAPA a=0.5

Misalignment/dB

Misalignment/dB

SC-IPAPA a=0.01

SC-IPAPA a=0.01

-2
-4
-6
-8
-10
-12

VSS-SPAPA

-5

SC-IPAPA a=0.5
-10

-15

-20

VSS-SPAPA

-14

VSS-SC-IPAPA

-25

VSS-SC-IPAPA

-16

VSS-APA
-18

-30
0

0.5

1.5

2.5

3.5

Nunber of iterations (k)

4.5

5
4

x 10

Figure 3. Misalignments of the SC-IPAPA, VSSAPA, VSS-SPAPA and VSS-SC-IPAPA for the
impulse response from Fig. 2 (a)

0.5

1.5

2.5

3.5

Nunber of iterations (k)

4.5

5
4

x 10

Figur .4 Misalignments of the SC-IPAPA, VSSAPA VSS-SPAPA and VSS-SC-IPAPA for the
impulse response from Fig. 2 (b)

In the second simulations, we used impulse responses as shown in Fig. 2(b) with N 512 . Fig.4
compares the convergence speed of the related algorithms. As can be seen from this result, the
proposed VSS-SC-IPAPA and VSS- APA achieve faster convergence than that of VSS-SPAPA when
the impulse response is relatively less sparse. More importantly, the proposed VSS-SC-IPAPA
achieves improved normalized misalignment of approximately 2dB compared to VSS-SPAPA. We
can also note that the proposed algorithm has an initial convergence rate close to the SC-IPAPA with
the value of the step-size 0.5 , but it achieves a significant lower misalignment, which is similar
to the one obtained by the SC-IPAPA with a very small step size parameter.
In the third simulation, we assume that there is an echo path change midway through the
simulation where the impulse response is changed from a sparse to one which is less sparse as shown in
Fig. 2 (a) and (b). Fig. 5 shows the result of the tracking ability of the relevant algorithms, it can see
from the result that the proposed VSS-SC-IPAPA achieve higher initial convergence compared to its

115

A Variable Step-Size Proportionate Affine Projection Algorithm for Echo Cancellation

Li XU

counterparts before and after the echo path change. Furthermore, the proposed VSS-SC-IPAPA
achieves approximately 10dB improvement in normalized misalignment during initial convergence
compared to VSS- APA for the sparse impulse responses. For a less sparse impulse responses, the
proposed VSS-SC-IPAPA achieves a 0.5dB improvement compared to VSS-SPAPA. This is because
the proposed algorithms take into account the sparseness measure of the estimated impulse response at
each iteration.
5

SC-IPAPA a=0.5

Misalignment/dB

-5

-10

VSS-APA
SC-IPAPA a=0.01

-15

-20

VSS-SC-IPAPA
VSS-SPAPA

-25

Number of iterations (k)

10
4

x 10

Figure 5. Misalignments of the SC-IPAPA, VSS-APA, VSS-SPAPA and VSS-SC-IPAPA. Impulse

response is changed from Fig. 2 (a) to (b) at

5 104 iteration.

6. Conclusion
A method is proposed to combine the variable step-size approach into the sparseness-controlled
proportionate affine projection algorithm. The proposed algorithm can not only work well in both
sparse and dispersive circumstances, but also adapt dynamically to the level of sparseness using a new
sparseness-controlled approach. More importantly, the presented approach provides a good solution to
the conflicting requirement between fast convergence rate and low final misalignment in a very simple
manner. The simulation results show this algorithm offers the overall best performance compare to
their conventional methods across the range of sparseness measure.

7. Acknowledgements
The Project was supported by the Special Fund for Basic Scientific Research of Central Colleges
(CHD2011JC125), Changan University, by the Special Fund for Basic Research Program of Changan
University and by the open Fund for Shaanxi Road Traffic Detection and Equipment Engineering
Research Center.

8. References
[1] S. Subramanian, D. J. Shpak, P. S. R. Diniz, and A. Antoniou, The performance of adaptive
filtering algorithms in a simulated HDSL environment, Proc. IEEE Canadian Conf. Electrical and
Computer Engineering, Toronto, Canada, pp. TA 2.19.1-TA 2.19.5, 1992.
[2] Suma S.A., Dr. K.S.Gurumurthy, "New Improved echo canceller based on Normalized LMS
Adaptive filter for Single talk and Double talk Detection, Subband echo cancellation, Acoustic
Echo cancellation", JNIT, Vol. 1, No. 2, pp. 61 ~ 74, 2010.
[3] C. Breining, P. Dreiseitel, E. Haensler, A. Mader, B. Nitsch, H. Puder,T. Schertler, G. Schmidt,
and J. Tilp, Acoustic echo controlAnapplication of very-high-order adaptive filters, IEEE
Signal Process. Mag., vol. 16, no. 4, pp. 4269, 1999.
[4] T. Wang and C. Wang A New Block Adaptive Filtering Algorithm for Decision Feedback
Equalization of Multipath Fading Channel, IEEE Trans. Circuit Syst.-II: Analog and Digital
Signal Processing, vol. 44, pp. 877-881, 1997.

116

A Variable Step-Size Proportionate Affine Projection Algorithm for Echo Cancellation

Li XU

[5] D.L.Duttweile. Proportionate normalized least-mean-squares adaptation in echo cancellers,

IEEE Trans.Speech Audio Process,vol. 8, no.5, pp. 508518 , 2000.
[6] J.Benesty,L.S.Gay. An improved PNLMS algorithm, in Proc.IEEE ICASSP-02Orlando
USA , vol. 2, pp. 18811884 , 2002.
[7] J. Cui, P. A. Naylor, and D. T. Brown, An improved IPNLMS algortihm for echo cancellation in
packet-switched networks, in Proceedings of the IEEE International Conference on Acoustics,
Speech and Signal Processing (ICASSP 04), vol. 4,pp. 141144, Montreal, Canada, 2004.
[8] Kirill Sakhnov. An improved proportionate affine projection algorithm for network echo
cancellation, Systems, Signals and Image Processingvol. 8, no.2, pp.125128, 2008.
[9] Lei Liao , Andy W. H. Khong, Sparseness-Controlled Affine Projection Algorithm for Echo
Cancelation, in Proceedings of the Second APSIPA Annual Summit and Conference, pp.355361,
Biopolis, Singapore, 2010.
[10] A.Mader, H.Puder, and G.U.Schmidt, Step-size control for acoustic echo cancellation filters-An
overview,Signal Process, Vol. 80, pp.1697 ~ 1719, 2000.
[11] Chiung-Sui Chang, David Tawei Ku, "A Framework of PBL Strategy Integrated in LMS and a
Ubiquitous Learning Environment", JCIT, Vol. 6, No. 4, pp. 361 ~ 368, 2011.
[12] C. Paleologu, J. Benesty, and S. Ciochina, A variable step-size affine projection algorithm
designed for acoustic echo cancellation, IEEE Trans. Acoust., Speech, Signal Processing,vol.16,
no.8, pp.14661478, 2008.
[13] Suma S.A., Dr. K.S.Gurumurthy, "New Improved echo canceller based on Normalized LMS
Adaptive filter for Single talk and Double talk Detection, Subband echo cancellation, Acoustic
Echo cancellation", JNIT, Vol. 1, No. 2, pp. 61 ~ 74, 2010.
[14] A.W.H. Khong and P.A.A. Naylor, Efficient use of sparse adaptive filters, in Proc.
40thAsilomar Conf. on Signals, Systems and Computers (ACSSC 06), Pacific Grove, Calif, USA,
pp.13751379, 2006.

117