An Area Optimization Method for Digital Filter Design

ETRI Journal

关键词: architecture;    adder sharing;    flattened coefficient;    Digital filter;   

Others  :  1184928
DOI  :  10.4218/etrij.04.0804.0010

【 摘 要 】

In this paper, we propose an efficient design method for area optimization in a digital filter. The conventional methods to reduce the number of adders in a filter have the problem of a long critical path delay caused by the deep logic depth of the filter due to adder sharing. Furthermore, there is such a disadvantage that they use the transposed direct form (TDF) filter which needs more registers than those of the direct form (DF) filter. In this paper, we present a hybrid structure of a TDF and DF based on the flattened coefficients method so that it can reduce the number of flip-flops and full-adders without additional critical path delay. We also propose a resource sharing method and sharing-pattern searching algorithm to reduce the number of adders without deepening the logic depth. Simulation results show that the proposed structure can save the number of adders and registers by 22 and 26%, respectively, compared to the best one used in the past.

   

【 参考文献 】

• [1]R. Hartley, "Optimization of Canonical Signed Digit Multipliers for Filter Design," Proc. IEEE Int’l. Symp. Circuits Systems, Singapore, June 1991, pp. 1992-1995.
• [2]M. Potkonjak et al., "Multiple Constant Multiplication: Efficient and Versatile Framework and Algorithms for Exploring Common Subexpression Elimination," IEEE Trans. Computer-Aided Design, vol. 15, no. 2, Feb. 1996, pp. 151-165.
• [3]A. Dempster and M.D. Macleod, "Use of Minimum-Adder Multiplier Blocks in FIR Digital Filters," IEEE Trans. Circuits Syst. II, vol. 42, Sept. 1995, pp. 569-577.
• [4]D.R. Bull and D.H. Horrocks, "Primitive Operator Digital Filter," Proc. Inst. Ele. Eng. Circuits, Devices and Systems, vol. 138, pt. G, June 1991, pp. 401-412.
• [5]R. Hartley, "Subexpression Sharing in Filters Using Canonical Signed Digit Multipliers," IEEE Trans. Circuits Syst. II, vol. 43, Oct. 1996, pp. 677-688.
• [6]M. Martinez-Peiro, E.I. Boemo, and L. Wanhammar, "Design of High-Speed Multiplierless Filters Using a Nonrecursive Signed Common Subexpression Algorithm," IEEE Trans. Circuits Syst. II, vol. 49, no. 3, Mar. 2002, pp. 196-203.
• [7]S.H. Yoon and J.W. Chong, "FIR Digital Filter Implementation Using flattened coefficient," Proc. IEEE Int’l Symp. Circuits and Systems, Geneva, May 2000, pp. III-363-366.
• [8]H.J. Kang and I.C. Park, "FIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders," IEEE Trans. Circuits Syst. II, vol. 48, no. 8, Aug. 2001, pp. 770-777.
• [9]A. Dempster, S. Demirsoy, and I. Kale, "Designing Multiplier Blocks with Low Logic Depth," Proc. IEEE Int’l Symp. Circuits and Systems, Mar. 2002, pp. V-773-776.