返回
An improved constant coefficient multiplication algorithm based on cascaded adder graph
DOI:10.1007/s11432-013-4872-z.png)
摘要
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.
Keyword:
constant coefficient multiplication
cascaded adder graph
finite impulse response (FIR)
resource occupation
adder-step
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
1.0W
机构
引用论文
Compound flap from the great toe and vascularized joints from the second toe for posttraumatic thumb reconstruction at the level of the proximal metacarpal bone
Microsurgery
IF0
没有更多内容

