检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙梦博 吕洪君[1] 张永强[1] 解光军[1] SUN Meng-bo;LV Hong-jun;ZHANG Yong-qiang;XIE Guang-jun(School of Electronic Science and Applied Physics,Hefei University of Technology,Hefei,Anhui 230009,Chin)
机构地区:[1]合肥工业大学电子科学与应用物理学院,安徽合肥230009
出 处:《电子学报》2018年第7期1774-1780,共7页Acta Electronica Sinica
基 金:国家自然科学基金(No.61271122)
摘 要:作为一种新型的纳米器件,量子元胞自动机(Quantum-dot cellular automata,QCA)有望取代传统CMOS器件.本文总结了目前已提出的三种全加器(Full Adder,FA)架构,通过概率转移矩阵(Probabilistic Transfer Matrix,PTM)分析找出其中最稳定的架构,进一步地,利用这三种全加器分别构建串行加法器,并从复杂度、不可逆功耗、成本等方面进行比较,结果发现性能最优的全加器架构为MR Azghadi FA.随后,选择该架构提出了一种针对全加器的新型逻辑门和共面QCA全加器电路,并应用此全加器设计了多位串行加法器,经对比分析表明,本文所提出的全加器电路在面积、元胞数和功耗等方面均有较大改进,且具有很好的扩展性.Quantum-dot cellular automata( QCA),a burgeoning technology at nano-scale range,has the potential to take the important place of CMOS technology to be the next IC technique. In this paper,three existing schemes of QCA full adders( FAs) are analyzed in detail using probabilistic transfer matrix( PTM) to find out the most robust one. Three types of n-bit carry flowadders connected serially by these three FAs respectively are also analyzed in terms of complexity,irreversible power dissipation and cost to find out the corresponding FA scheme with best performance. It turns out that MR Azghadi FA always performs well by these two means. With MR Azghadi FA layout,a newlogic gate and coplanar QCA FA are then proposed. Analysis and comparison with previous coplanar FAs demonstrate that the proposed FA has a great optimization with respect to area,cell count and power dissipation and also has favorable scalability.
分 类 号:TN402[电子电信—微电子学与固体电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.59.234.246