Abstract
In many digital signal processing algorithms, e.g., digital filters, the multiplier coefficients are constant. Hence, it is possible to implement the multiplier using shifts, adders, and subtracters. In this work a new algorithm of constant coefficient multiplication with few adders and registers is proposed. This approach is based on cascaded adder graph. In this paper all cascaded adder graph structures for any integer can be derived, and the analytical method for the number of register and adder occupation is given. Through comparison of occupied resources, the optimal adder graph can be obtained. Finally, comparing with previous optimal algorithms, a design example for finite impulse response (FIR) filter confirms the validity and good engineering practicability of this algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ma G K, Taylor F J. Multiplier policies for digital signal processing. IEEE ASSP Mag, 1990, 7: 6–20
Liu H X, Yuan B. Low-power design and application based on CSD optimization for a fixed coefficient multiplier. Sci China Inf Sci, 2011, 54: 2443–2453
Bull D B, Horrocks D H. Primitive operator digital filters. In: IEE Proc G Circ Devices Syst, 1991, 138: 401–412
Dempster, Macleod M D. Use of minimum adder multiplier blocks in FIR digital filters. IEEE Trans Circuits Syst II-Express Briefs, 1995, 42: 569–577
Gustafsson, Dempster A G, Johansson K, et al. Simplified design of constant coefficient multipliers. Circuits Syst Signal Process, 2006, 25: 225–251
Cappello P R, Steiglitz K. Some complexity issues in digital signal processing. IEEE Trans Acoust Speech Signal Process, 1984, 32: 1037–1041
Voronenko Y, Puschel M. Multilierless multiple constant multiplication. ACM Trans Algorithms, 2007, 3: 11
Kang H J, Park I C. FIR filter synthesis algorithms for minimizing the delay and the number of adders. IEEE Trans Circuits Syst II-Express Briefs, 2001, 48: 770–777
Mehboob R, Khan S A, Qamar R. FIR filter design methodology for hardware optimized implementation. IEEE Trans Consum Electron, 2009, 55: 1669–1673
Yang S C. A note of the number of multiplicative partition of natural number. J Beihua Univ (Nat Sci), 2006, 7: 485–487
Knopfmacher M M A. Ordered and unordered factorizations of integers. Math J, 2006, 10: 72–89
Hutchinson G. Partitioning algorithms for finite sets. Commun ACM, 1963, 6: 613–614
Maskell D L, Jussipekka L, Patra J C. The design of multiplierless FIR filters with a minimum adder step and reduced hardware complexity. In: Proceedings of IEEE International Symposium on Circuits and Systems, Island of Kos, 2006
Yao C Y, Chen H H, Lin T F, et al. A novel common-subexpression-elimination method for synthesizing fixed-point FIR filters. IEEE Trans Circuits Syst I-Regul Pap, 2004, 51: 2215–2221
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, H., Qu, X., Pang, L. et al. An improved constant coefficient multiplication algorithm based on cascaded adder graph. Sci. China Inf. Sci. 56, 1–7 (2013). https://doi.org/10.1007/s11432-013-4872-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-013-4872-z