.png){kind=icon}
.png){kind=icon}
Return
An improved constant coefficient multiplication algorithm based on cascaded adder graph
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-013-4872-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
constant coefficient multiplication
cascaded adder graph
finite impulse response (FIR)
resource occupation
adder-step
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
4.9K
Citations:
8.9K