Multiplierless implementations of adaptive FIR filters

Implementations of adaptive filters using field programmable gate arrays require the ability to change the coefficient values of the filter based on the adaptation algorithm. Multiplierless filter designs rely on a priori knowledge of the coefficient values to implement the filter using hard-wired shifts and additions. We describe a multiplierless approach to adaptive filter implementation that reduces the complexity from quadratic to linear in the number of bits.