arrow
返回

An improved constant coefficient multiplication algorithm based on cascaded adder graph

delete2013-06-05
delete2
PRE
AI
H
He Chen
L
Long Pang
T
Teng Long
DOI:10.1007/s11432-013-4872-zdelete
delete原文链接
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Science China Information Sciences 封面图
Science China Information Sciences
IF:
7.6
论文数:
4.9K
被引数:
1.0W

机构

B
Beijing Institute of Technology
学者数:
5.5K
论文数: 1.6K
被引数: 3
C
Communication University of China
学者数:
155
论文数: 53
被引数: 0
引用论文

引用论文

Anger, Hostility, and the Heart
err
IF0
err2013-05-13
err0
PREAI
errAron Wolfe Siegman
err分享
err收藏
err分享
err收藏
err分享
err收藏
没有更多内容