Design of low complexity programmable FIR filters using multiplexers array optimization

This paper presents a new method to design low complexity programmable FIR filters by the merit of optimization on the multiplexer array. Searching approach for efficient common subexpressions has been presented to design each filter tap with the minimum number of multiplexers. The other multiplexer optimization technique is also proposed to reduce the number of inputs of multiplexers. These design methods contributed to the significant complexity reduction comparing to other design methods. Logic synthesis result shows that the designed 12-bit programmable filter can achieve the complexity saving up to 40.37% in ASIC implementation and 36.31% in FPGA implementation over other existing methods.