Optimal Single Constant Multiplication Using Ternary Adders.

IEEE Transactions on Circuits and Systems II: Express Briefs(2018)

引用 25|浏览14
暂无评分
摘要
The single constant coefficient multiplication is a frequently used operation in many numeric algorithms. Extensive previous work is available on how to reduce constant multiplications to additions, subtractions, and bit shifts. However, on previous work, only common two-input adders were used. As modern field-programmable gate arrays (FPGAs) support efficient ternary adders, i.e., adders with thr...
更多
查看译文
关键词
Adders,Complexity theory,Field programmable gate arrays,Optimization,Topology,Signal processing algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要