Abstract
Multiple Constant Multiplication (MCM) circuits are often used in Digital Signal Processing (DSP), such as Finite-Impulse Response (FIR) filters, linear transforms and so on, and a synthesis method to minimize computational complexity is required considering hardware cost. In synthesis of an MCM circuit, shift-chain made from partial sum is very important. The shift-chain greatly depends on the order of synthesis coefficient because it is updated in the process of synthesizing the coefficient. In this research, we propose a synthesis method considering the order of coefficients to be synthesized using the Genetic Algorithm. Furthermore, this method can reduce not only the number of adders but also the number of adder-steps. Through simulations, we show that the proposed method achieves better performance than the existing methods.
