In this thesis, we present a block formulation of least mean square (LMS) adaptive Volterra filter. This formulation has a mathematical equivalence with time domain sample-processing LMS. Hence, it maintains the same performance while allowing a reduction in arithmetical complexity (even for small block size). Simulation results are presented to validate the usefulness of our algorithm. We also consider several alternatives to trade performance with complexity.