Factored computing structures for multiplierless fir filters using symbol-sequence number systems in linear spaces

Abstract

A general framework is presented here for developing number systems to represent coefficient vectors in an inner-product space. Multiplierless computational structures then follow for computing sums of inner products of data vectors and fixed coefficient vectors. Those structures can often be factored into multiplierless forms having remarkable computational efficiency.