Open Access Open Access  Restricted Access Subscription or Fee Access

Using Global Value Numbering Algorithm for Finite Impulse Response Filter Design

A. Yin


Finite duration Impulse Response (FIR) filter has found enormous applications in the field of communication and signal processing for a number of encouraging features associated with it like phase linearity, guaranteed stability, etc. Reduction of computational complexity of digital hardware has drawn the special attention of researchers in recent past. Proper emphasis is needed in this regard towards the settlement of computationally efficient as well as functionally competent design of digital systems. In this communication, we have made one novel attempt for designing multiplier-free Finite duration Impulse Response (FIR) digital filter using Global Valued Numbering. The Aim of this research is to design a low cost finite impulse response filter using the concept of faithfully rounded truncated multipliers. The optimization of bit width and the hardware resources are done with good accuracy. In direct FIR filter the multiple constant multiplication are implemented using the improved version of truncated multipliers


Finite Impulse Response, Multiple Constant Multiplications, Global Value Numbering, CSE Algorithm, GB Algorithm

Full Text:



Exact and Approximate Algorithms for the Optimization of Area and Delay Multiple Constant Multiplications Levent Aksoy, Student Member, IEEE, duardo da Costa, Paulo Flores, Member, IEEE, and José Monteiro, Member, 2007

L. Wanhammar, DSP Integrated Circuits. New York: Academic,2001.

C. Wallace, “A suggestion for a fast multiplier,” IEEE Trans. Electron.Comput., vol. 13, no. 1, pp. 14–17, Feb. 2002.

J. McClellan, T. Parks, and L. Rabiner, “A computer program for designing optimum FIR linear phase digital filters,” IEEE Trans. Audio Electroacoust., vol. 21, no. 6, pp. 506–526, Dec. 2008.

M. Ercegovac and T. Lang, Digital Arithmetic. San Mateo, CA: Morgan Kaufmann, 2003.

I.-C. Park and H.-J. Kang, “Multiple Constant Multiplications For Digit-Serial Implementation Of Low Power Fir Filters” in Proc. DAC, 2001, pp.

L. Aksoy, E. Costa, P. Flores, and J. Monteiro, “Exact and Approximate algorithms for the optimization of area and delay in multiple constant multiplications,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 27, no. 6, pp. 1013–1026, Jun. 2008.

Y.Voronenko and M. Püschel, “Multiplierless multiple constant multiplication,”ACM Trans. Algor., vol. 3, no. 2, pp. 1–39, May 2007.

L. Aksoy, E. Gunes, and P. Flores, “Search algorithms for the multiple constant multiplications problem: Exact and approximate, J.microprocess. Microsyst., vol. 34, no. 5, pp. 151–162, Aug. 2010.

L. Aksoy, E. Costa, P. Flores, and J. Monteiro, “Optimization of Area in digital FIR filters using gate-level metrics,” in Proc. DAC, 2007, pp.420–423.

Meyer-Baese, Uwe, Guillermo Botella, David ET Romero, and Martin Kumm. "Optimization of high speed pipelining in FPGA-based FIR filter design using genetic algorithm." In SPIE Defense, Security, and Sensing, pp. 84010R-84010R. International Society for Optics and Photonics, 2012.

Nekoei, Farzad, Yousef S. Kavian, and Otto Strobel. "Some schemes of realization digital FIR filters on FPGA for communication applications." InMicrowave and Telecommunication Technology (CriMiCo), 2010 20th International Crimean Conference, pp. 616-619. IEEE, 2010.

Chandra, Abhijit, and Sudipta Chattopadhyay. "Role of mutation strategies of differential evolution algorithm in designing hardware efficient multiplier-less low-pass FIR filter." Journal of Multimedia 7, no. 5 (2012): 353-363.

Yu, Ya Jun, and Yong Ching Lim. "Optimization of linear phase FIR filters in dynamically expanding subexpression space." Circuits, Systems and Signal Processing 29, no. 1 (2010): 65-80.

Shi, Dong, and Ya Jun Yu. "Design of discrete-valued linear phase FIR filters in cascade form." Circuits and Systems I: Regular Papers, IEEE Transactions on58, no. 7 (2011): 1627-1636.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.