The Method of Addition Subexpression for High-Speed Multiplierless FIR Filters

곱셈기를 사용하지 않은 고속 FIR 필터를 위한 부분 항 덧셈 방법

  • Kim, Yong-Eun (Div. of Electronic & Information Engineering Chonbuk University)
  • 김용은 (전북대학교 전자정보공학부)
  • Published : 2008.08.25

Abstract

Multiplierless FIR filters can be designed by only adders using Common Subexpression algorithm. It has small area compared with filter which using multipliers. But it has long operation time because of carry ripple from the adder. In this paper, when the subexpressions are added in multiplier less filters, the number of subexpressions maintains 2 until final addition to avoid carry ripple of the addition, so the subexpression addition time of the filter can be reduced. To verify proposed method, subexpression adder circuit of the FIR filter is designed using given example of paper. The designed filter was synthesized using Hynix 0.18um process. By Synopsys simulation results, it is shown that by the proposed method, area, propagation delay time can be reduced up to 53.2%, 57.9% compared with conventional design method which using pipeline.

곱셈기를 사용하지 않는 FIR필터는 Common Subexpression 알고리즘을 이용하여 덧셈만으로 필터를 구현한다. 따라서 곱셈기를 이용한 필터 보다 적은 면적으로 필터를 구현할 수 있다. 그런데 덧셈에서 발생하는 캐리 리플로 인하여 필터 연산시간이 길어지는 단점이 있다. 본 논문에서는 CSE방식의 FIR 필터에서 부분 항을 더할 때 최종 덧셈이 수행되는 곳까지 더해지는 부분 항을 2줄로 유지하여 덧셈의 캐리 리플을 피하여 필터의 부분 항 덧셈 시간을 단축 시켰다. 제안한 알고리즘을 증명하기 위해 논문에서 주어진 예제를 이용하여 FIR 필터의 부분 항 덧셈 회로를 설계하여 하이닉스 0.18라이브러리로 합성한 결과 기존 파이프라인을 사용한 설계 방법 보다 면적, 속도에서 53.2%, 57.9%의 이득 있음을 알 수 있다.

Keywords

References

  1. R. Hartley, "Optimization of canonic signed digit multipliers for filter design," in Proc. IEEE int. Symp. Circuits and Systems, Singapore, June 1991, pp. 1992-1995
  2. M. Potkonjak et al., "Multiple constant multiplication: Efficient and versatile freamework and algorithms for exploring common subexpression elimination," IEEE Trans. Computer-Aided Design, vol. 15, no. 2, pp. 151-165, Feb. 1996 https://doi.org/10.1109/43.486662
  3. R. Hartley, "Subexpression sharing in filters using canonic signed digit multipliers," IEEE int. Symp. Circuits and Syst. II, vol. 43, Oct. 1996
  4. M. Mehendale, S. D. Sherlekar, and G. Vekantesh, "Systhesis of multiplierless FIR filters with minimum number of additions," in Proc. 1995, IEEE/ACMInt. Conf. computer- Aided Design, Los Alamitos, CA, 1995, pp. 1595, pp. 668-671
  5. Marcos Martinez-Peiro, Eduardo I. Boemo, and Lars Wanhammar, "Design of High-Speed Multiplierless Filter Using a Nonrecursive Signed Common Subexpression Algorithm, " IEEE Transactions on circuits and Systems II, 2002, vol. 49, pp. 196-203 https://doi.org/10.1109/TCSII.2002.1013866
  6. A. Dempster and M. D. Macleod, "Constant integer multiplication using minimum adders," Proc. Inst. Elec. Eng. Circuits and systems, vol. 141, no. 5, pp.407-413, Oct. 1994
  7. A. Dempster and M. D. Macleod, "Use of minimum adder multiplier blocks in FIR digital filters," IEEE Trans. Circuits Syst. II, vol. 42, pp569-557, Sept. 1995 https://doi.org/10.1109/82.466647
  8. C. S. Wallace, "Suggestion for a fast multiplier," IEEE Transactions on Electronic Computers, vol. EC-13, pp. 14-17, 1964 https://doi.org/10.1109/PGEC.1964.263830