Synthesis of Asymptotically Optimal Adders for Multiple-Valued Logic

2021 IEEE 51st International Symposium on Multiple-Valued Logic (ISMVL)(2021)

引用 2|浏览1
暂无评分
摘要
Addition is the most basic arithmetic operation and efficient adder realizations are crucial to performing arithmetic operations in an efficient way. Synthesis of efficient adders has been studied exhaustively for two-valued, Boolean logic and asymptotically optimal constructions have been derived w.r.t. time and space complexity. In contrast, for multiple-valued logic typically simple, linear-tim...
更多
查看译文
关键词
Complexity theory,Time complexity,Adders
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要