The problem of designing the weights for recursive L-filters optimized by t
he feast mean square (LMS) algorithm is addressed. The coefficients derived
for nonrecursive filtering are not optimal for recursive implementation, w
here the estimate of current pixel depends on the past outputs of the filte
r, To combat this analogous to the design of adaptive IIR filters, the opti
mization scheme referred to as equation-error formulation is employed. The
recursive filter performs better in suppressing noise than its nonrecursive
counterpart.