One important application of Volterra filters is the equalization of n
onlinear systems, Under certain conditions, this problem can be posed
as a fixed point problem involving a contraction mapping, In this pape
r, we generalize the previously studied local inverse problem to a ver
y broad class of equalization problems, We also demonstrate that subsp
ace information regarding the response behavior of the Volterra filter
s can be incorporated to improve the theoretical analysis of equalizat
ion algorithms. To this end, a new ''windowed'' signal norm is introdu
ced. Using this norm, we show that the class of allowable inputs is in
creased and the upper bounds on the convergence rate are improved when
subspace information is exploited.