Selection of computationally efficient mutation strategy of differential evolution algorithm for the design of multiplier-less low-pass FIR filter

Reduction of structural complexity of digital systems has been emerging as one of the major areas of concern to the system designers. The deployment of any physical circuit or system in any specific application is solely determined by the intricacy of the concerned circuit which restricts the use of sophisticated circuits in high speed operation. Thus the design of computationally efficient structure has drawn special attention to the modern researchers. Due to the immense development of evolutionary computation techniques over the last few years, they are being increasingly used for a number of signal processing applications. This paper deals with one such robust technique called Differential Evolution (DE) and the impact of its different mutation strategies for efficient design of multiplier-less low-pass Finite duration Impulse Response (FIR) filter. In order to find out the most favourable mutation scheme, the computational efficiency of various mutation schemes has been studied. For this purpose, the convergence behaviour and error histogram of DE algorithm has been presented. From the simulation results, the name of the computationally most efficient mutation strategy has been suggested. Finally, the superiority of the established mutation strategy has been reconfirmed in terms of the filter performance.