Multiplierless implementation of recursive digital filters based on coefficient translation methods in low sensitivity structures

In the coefficient translation methods for reducing sensitivity in recursive filters the modified coefficients can be realized with multipliers of shorter wordlength i.e., by fewer number of bits. When these are implemented in minimum numbers of signed powers of two (MNSPT) form, we have a multiplierless implementation. These implementations are not associated with an increase in the order of the filter that involves an increase in complexity i.e., indirect overheads