Abstract
This paper presents a new efficient method for designing stable look-ahead pipelined recursive digital filters with reduced multipliers. The multiplier savings are obtained by generating pipelined transfer functions which combine numerator decomposition with look-ahead denominator distribution. This is achieved by not restricting the denominator to either the clustered or scattered forms while also preserving term count from the unpipelined filter transfer function. The coefficients of the pipelined transfer function are obtained by running product solved using matrices and an algorithm with two stages: pre and post distribution, each having a multiplier cost which are minimised independently. The proposed method can produce pipelined filter designs requiring fewer multipliers when compared with previously reported methods. For example, for a range of second order transfer functions and pipelining levels, an average 40% reduction in multipliers can be achieved while an 18% reduction in multipliers necessary for pipelining is obtained for a sixth order filter. Furthermore, the proposed two-stage algorithm can accommodate pipelined adders as well as pipelined multipliers in the recursive filter structure, avoiding delay penalties otherwise suffered by previously reported methods. A detailed analysis has been carried out confirming that filters designed using the proposed method do not suffer increased noise.
Similar content being viewed by others
References
M. Renfors and Y. Neuvo, "The Maximum Sampling Rate of Digital Filters Under Hardware Speed Constraints," IEEE Transactions on Circuits and Systems, vol. 28, 1981, pp. 196–202.
H.B. Voelcker and E.E. Hartquist, "Digital Filtering via Block Recursion," IEEE Transactions on Audio and Electroacoustics, vol. 18, 1970, pp. 169–176.
P.M. Kogge and H.S. Stone, "A Parallel Algorithm for the Ef-ficient Solution of a General Class of Recurrence Equations," IEEE Transactions on Computing, vol. 22, 1973, pp. 786–793.
H.H. Loomis and B. Sinha, "High-Speed Recursive Digital Filter Realisation," Circuits, Systems and Signal Processing, vol. 3, 1984, pp. 267–294.
K.K. Parhi and D.G. Messerschmitt, "Look-Ahead Computation: Improving the Iteration Bound in Linear Recursions," International Conference on Acoustics, Speech and Signal Processing, 1987, vol. 3, pp. 1855–1858.
K.K. Parhi and D.G. Messerschmitt, "Pipeline Interleaving and Parallelism in Recursive Digital Filters—Part I: Pipelining Using Scattered Look-Ahead and Decomposition," IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 37, 1989, pp. 1099–1117.
Y.C. Lim and B. Liu, "Pipelined Recursive Filter with Minimum Order Augmentation," IEEE Transactions on Signal Processing, vol. 40, 1992, pp. 1643–1651.
A.E. de la Serna, M.A. Soderstrand, and H.H. Loomis, "Minimum-Denominator-Multiplier Pipelined IIR Digital Filters," in Proceedings Fourth International Conference on Signal Processing Applications and Technology, 1993, vol. 1, pp. 327–336.
A.E. de la Serna and M.A. Soderstrand, "Canonical MDM Pipelined IIR Digital Filters," in Proceedings 37th Midwest Symposium on Circuits and Systems, 1994, vol. 2, pp. 1079–1082.
M.A. Soderstrand, A.E. de la Serna, and H.H. Loomis, "New Approach to Clustered Look-Ahead Pipelined IIR Digital Filters," IEEE Transactions on Circuits and Systems II: Analogue and Digital Signal Processing, vol. 4, 1995, pp. 269–274.
Z. Jiang and A.N.Willson, "Design and Implementation of Effi-cient Pipelined IIR Digital Filters," IEEE Transactions on Signal Processing, vol. 43, 1995, pp. 579–590.
Y.C. Lim, "A New Approach for Deriving Scattered Coefficients of Pipelined IIR Filters," IEEE Transactions on Signal Processing, vol. 43, 1995, pp. 2405–2407.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Living, J., Moniri, M. & Tennakoon, S. Efficient Recursive Digital Filters using Combined Look-Ahead Denominator Distribution and Numerator Decomposition. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 27, 269–295 (2001). https://doi.org/10.1023/A:1008195302092
Published:
Issue Date:
DOI: https://doi.org/10.1023/A:1008195302092