A Step Size Control Method for Deficient Length FBLMS Algorithm

Mrs.Asiya sulthana 1, Prathyusha reddy 2,Hanamkonda Divya3, Mattepally Navya 4

Department of Electronics and communication Engineering, Balaji Institute of Technology and Science ,
3
Mrs.Asiya sulthana : Associate Professor, Department of Electronics and communication Engineering, Balaji
Institute of Technology and Science , Telangana, India
---------------------------------------------------------------------***---------------------------------------------------------------------
Abstract – In some practical situations, where the impulse 2. FREQUENCY DOMAIN BLOCK LEAST MEAN
response of some systems is very long, there the adaptive SQUARE ALGORITHM
filters works in an under-modeling situation. In previous
situation it is found that for deficient-length frequency The Least Mean Square (LMS) algorithm, introduced by
domain block least mean square (FBLMS) algorithm, the Widrow and Hoff in 1959, is an adaptive algorithm, which
steady sate solution will totally depend on step-size which is uses a gradient-based method of steepest decent. LMS
selected. This FBLMS will converge to the wiener solution algorithm uses the estimates of the gradient vector from
only if the same step-size is selected for each frequency bin. the available data. LMS incorporates an iterative
Different variable step-size methods for FBLMS algorithm procedure that makes successive corrections to the weight
have been proposed, but all of that methods cannot converge vector in the direction of the negative of the gradient
to the wiener solution in the under- modeling situation. In vector which eventually leads to the minimum mean
this paper, a step size control method for deficient-length square error. Compared to other algorithms LMS
FBLMS algorithm is proposed. Effectiveness of the proposed algorithm is relatively simple; it does not require
correlation function calculation nor does it require matrix
system is demonstrated easily through computer simulations.
inversions.
Key Words___ Adaptive filters, deficient length least- sS Sa d(n)

mean square [LMS] algorithm, variable step size.

Conc
ve
1. INTRODUCTION atenat F I la
e X(n)
Y (n) F Y(n)
In recent years, there has been a growing interest in
Xf(n) two F X (n) f
st f

block
adaptive filtering applications, such as channel
T
W (n) f
F bl
equalization, adaptive noise control, and acoustic echo
s Del
cancellation .The most popular adaptation algorithm is T oc
least-mean square (LMS) algorithm due to its ease in W (n+1)
ay
f
implementation. To reduce computational complexity and
improve convergence rate, Frequency-domain block LMS conjug k
(FBLMS) algorithms are usually used. These frequency-
domain based techniques significantly reduce the ate Pf(n)
computational complexity in comparison to LMS algorithm
when using the fast Fourier transform. They can offer
F
faster convergence when an individual step-size is chosen F
for each frequency bin. There are two kinds of FBLMS make 2 nd
algorithms: the constrained one and the unconstrained T
block
one.
zeros
The constrained FBLMS algorithm was first proposed
by Ferrara, which is an exact fast implementation of the
time-domain block LMS (BLMS) algorithm. The
unconstrained FBLMS algorithm was proposed by IFFT
Mansour, which adapts the filter coefficients using circular
convolutions. The unconstrained FBLMS algorithm is more
computational effective than the constrained one. It found
that FBLMS algorithm will converge to the Wiener solution e(n)
Insert
Only, if the same step size is selected for each frequency ef(n) FF zero
bin. Almost all of variable step size FBLMS algorithms
cannot converge to the Wiener solution in the under- T block
modelling situation. To solve this problem, a step size
control method for deficient- length FBLMS algorithm is fig 1.Block diagram of the frequency-domain block least-
proposed in this paper. mean-square (FBLMS) algorithm.

1
The idea of using an adaptive step size for FBLMS
algorithm has been reported by many researchers. The
step sizes are adjusted as a function of the interference
(noise and double-talk) as well as the misadjustment of
the filter. These algorithms are focused on making the
adaptive filtering robust in the presence of interference.
To overcome the compromise between fast convergence
and low steady-state error in conventional FBLMS
algorithm, Kun Shi proposed a bin-wise block-varying step
size. The optimal solution of step size at each iteration is
de-rived by cancelling the a posteriori error in each
frequency bin, and its estimate is connected to the
magnitude-squared coherence (MSC) function.

3. PROPOSED ALGORITHM

The frequency-domain step size control method proposed

by Kun Shi works well for sufficient-length FBLMS
algorithm. However, it cannot ensure that the same step
size is adopted for different frequency bin at steady state.
Therefore, Kun Shi’s algorithm usually cannot converge to
the Wiener solution in the under modelling situation. In
this letter, we improve the method proposed by Kun Shi.
The step size at frequency bin m is given
1
μm (n)=
1
+ γ (n)
φ m (n)
Fig.2. Convergence behaviour of MSE for different
algorithm
2
φ m(n)= ¿ At the initial convergence period, the convergence rate of
s x , m (n)
our method is almost the same with the Kun Shi’s method
since ϒ(n)=0. When the error signal cannot be reduced any
more by using Kun Shi’s method, is increased step by step,
is the variable step size proposed by Kun Shi, as shown in Fig.3.

2
sx,m(n+N)=𝛌sx,m(n)+(1⎯ 𝛌)|x m (n)|
2
se,m(n+N)=𝛌se,m(n)+(1⎯ 𝛌)|E m (n)|
sxe,m(n+N)=𝛌sxe,m(n)+(1⎯ 𝛌) x˙m (n)Em(n)

The flatness is defined by

N−1

f= ∑ ¿ ¿ ¿
m =0

4. EXPERIMENTAL RESULTS

In this simulation, we evaluated our method in the

scenario that system noise changes as follows: noise
power is 0.001 in iteration (0, 20000), increases to 10 at
20000, then changes to 0.1 at 40000. Fig. 3, shows the
convergence behaviour of MSE and for different channel. Fig.3. Convergence behaviour of MSE for different
The dotted line denotes the minimum mean square error algorithm
when the adaptive filter reaches the Wiener solution.

2
4. CONCLUSION

In existing variable step size method for FBLMS

algorithms, the adaptive filter cannot converge to the
wiener solution in under-modeling situation. To overcome
this problem, a new variable step-size FBLMS algorithm
for deficient-length case is proposed. A time-varying
parameter is introduced to control the flatness of step-size
for different frequency bin. Simulation results show that
the proposed method achieves faster convergence rate as
well as make adaptive filter converge to wiener solution.

REFERENCES

[1] E. R. Ferrara, “Fast implementation of LMS adaptive

filters,” IEEE Trans. Acoust., Speech, Signal Process.,
vol. ASSP-28, pp. 474–475,Aug. 1980.
[2] D. Mansour and A. H. Gray, Jr., “Unconstrained
frequency-domain adaptive filter,” IEEE Trans.
Acoust., Speech, Signal Process., vol. ASSP-30, pp.
726–734, Oct. 1982.
[3] M. Wu, J. Yang, Y. Xu, and X. J. Qiu, “Steady-state
solution of the deficient length constrained FBLMS
algorithm,” IEEE Trans. Signal Process., vol. 60, no.
12, pp. 6681–6687, Dec. 2012.
[4] K. Shi and X. Ma, “A frequency domain step-size
control method for LMS algorithms,” IEEE Signal
Process. Lett., vol. 17, no. 2, pp. 125–128, Feb. 2010.
[5] M. Wu, G. Y. Chen, and X. J. Qiu, “An improved active
noise control algorithm without secondary path
identification based on the frequency-domain
subband architecture,” IEEE Trans. Audio, Speech,
Lang. Process., vol. 16, no. 8, pp. 1409–1419, Oct.
2008.
[6] J. J. Shynk, “Frequency-domain and multirate
adaptive filtering,” IEEE Signal Process. Mag., vol. 9,
no. 1, pp. 14–37, Jan. 1992.
[7] J. G. Proakis, Digital Communications, 4th ed. ed. New
York, NY, USA: McGraw-Hill, 2001.
[8] J. Vogel, M. Heckmann, and K. Kroschel, “Frequency
domain step-size control in non-stationary
environments,” in Proc. IEEE Asilomar Conf. Signals,
Systems, Computers, Pacific Grove, CA, USA, 2000, pp.
212–216.