...
首页> 外文期刊>Nanotechnology >Bennett clocking of quantum-dot cellular automata and the limits to binary logic scaling
【24h】

Bennett clocking of quantum-dot cellular automata and the limits to binary logic scaling

机译:量子点元胞自动机的Bennett计时和二进制逻辑定标的限制

获取原文
获取原文并翻译 | 示例
           

摘要

We examine power dissipation in different clocking schemes for molecular quantum-dot cellular automata (QCA) circuits. 'Landauer clocking' involves the adiabatic transition of a molecular cell from the null state to an active state carrying data. Cell layout creates devices which allow data in cells to interact and thereby perform useful computation. We perform direct solutions of the equation of motion for the system in contact with the thermal environment and see that Landauer's Principle applies: one must dissipate an energy of at least k_B per bit only when the information is erased. The ideas of Bennett can be applied to keep copies of the bit information by echoing inputs to outputs, thus embedding any logically irreversible circuit in a logically reversible circuit, at the cost of added circuit complexity. A promising alternative which we term 'Bennett clocking' requires only altering the timing of the clocking signals so that bit information is simply held in place by the clock until a computational block is complete, then erased in the reverse order of computation. This approach results in ultralow power dissipation without additional circuit complexity. These results offer a concrete example in which to consider recent claims regarding the fundamental limits of binary logic scaling.
机译:我们研究了分子量子点元胞自动机(QCA)电路在不同时钟方案中的功耗。 “兰道时钟”涉及分子细胞从零态到载有数据的活性态的绝热转变。单元布局会创建允许单元中的数据进行交互从而执行有用的计算的设备。我们对与热环境接触的系统执行运动方程式的直接解,并发现Landauer原理适用:仅当信息被擦除时,才必须耗散至少k_B的能量。 Bennett的思想可以应用于通过将输入回显到输出来保留位信息的副本,从而以增加电路复杂性为代价将任何逻辑不可逆电路嵌入到逻辑可逆电路中。我们称其为“ Bennett时钟”的一种有前途的替代方案仅需更改时钟信号的时序,以便时钟将位信息简单地保持在适当位置,直到完成计算块,然后以相反的计算顺序将其擦除。这种方法可实现超低功耗,而不会增加电路复杂度。这些结果提供了一个具体的示例,其中可以考虑有关二进制逻辑缩放的基本限制的最新主张。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号