Design of multiplier-less FRM FIR filter using Artificial Bee Colony Algorithm

Ever since the pioneering work of Y.C. Lim[1] on frequency response masking for the design of sharp FIR filters, lot of significant research have been carried out in this area. Among the various Signed Power of Two(SPT) forms, the Canonic Signed Digit(CSD) is a minimal representation, since it represents a given multiplier coefficient using minimum number of nonzero terms. This paper proposes the design of a CSD based FRM filter with reduced computational complexity using the Artificial Bee Colony Algorithm. Optimization is done in the discrete space, where the coefficient encoding is done with the help of the look up table created. The reduction in computational complexity is achieved by the appropriate selection of the initial food sources in ABC algorithm. Besides, the ABC algorithm is tailor made so that, in every exploitation and exploration phase, the candidate solutions turn out to be integers.