首页> 外文会议>International Conference on Electrical, Communication, and Computer Engineering >Partial Ternary Full Adder versus Complete Ternary Full Adder
【24h】

Partial Ternary Full Adder versus Complete Ternary Full Adder

机译:部分三元完全加法器与完整三元完全加法器

获取原文

摘要

This paper explores whether or not a complete ternary full adder, whose input variables can independently be ‘0’, ‘1’, or ‘2’, is indispensable in the arithmetic blocks of adder, subtractor, and multiplier. Our investigations show that none of these arithmetic units require a complete ternary full adder. Instead, they can be designed by means of partial ternary full adder, whose input carry never becomes ‘2’. Therefore, ternary adders can be realized with fewer transistors and higher performance. Afterwards, three well-known complete ternary full adders are changed into partial versions. Simulation results show considerable improvements for the partial ternary full adders over the complete versions.
机译:本文探讨了加法器,减法器和乘法器的算术模块中,输入变量可以分别为“ 0”,“ 1”或“ 2”的完整三进制全加法器是否必不可少。我们的研究表明,这些算术单元都不要求完整的三进制全加器。取而代之的是,可以通过部分三进制全加法器来设计它们,其输入进位永远不会变成“ 2”。因此,可以用更少的晶体管和更高的性能来实现三进制加法器。之后,将三个众所周知的完整三元全加法器更改为部分版本。仿真结果表明,与完整版本相比,部分三元全加法器有很大的改进。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号