Pipelined architecture for computational nanotechnology

R. Mercer, M. Ebel, Ronald F. DeMara
{"title":"Pipelined architecture for computational nanotechnology","authors":"R. Mercer, M. Ebel, Ronald F. DeMara","doi":"10.1109/SOUTHC.1994.498124","DOIUrl":null,"url":null,"abstract":"Nanomechanical computing elements which are scalable in terms of input size and depth of propagation path are analyzed using a bounded continuum model. Boolean logic functions of NOT, AND, OR, and XOR are realized using helical latch, reset spring, and translating rod assemblies. Building upon these components a design for two-level logic operations is presented. The helical latching mechanism calculates the Boolean output function as a positional displacement from a known reset state, which occurs exactly once during each instruction cycle. To balance forces a symmetrical rotor is used to counteract applied forces by replicating input rods. This has the beneficial side-effect of providing intrinsic fault-detection capability within a gate and also decreases the rotation required for a full cycle from 360 degrees to 180 degrees. This design is further enhanced to allow operations of arbitrary word length by subdividing the logic disc into sectors where each sector contains all the components necessary to operate on a single bit. The benefits of increasing the disc diameter needed for additional bits include a further reduction in disc cycle rotation as a result of subdividing the disc into sectors. Since the inputs are sampled sequentially, throughput of resultants can be increased directly by pipelining multiple bit operands. For n inputs per logic gate, the maximum speedup for a single level of logic is (n+2). Generally, speedup is bounded by (n+2)/p where p denotes the number of cycles between initiations of the pipe.","PeriodicalId":164672,"journal":{"name":"Conference Record Southcon","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record Southcon","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOUTHC.1994.498124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Nanomechanical computing elements which are scalable in terms of input size and depth of propagation path are analyzed using a bounded continuum model. Boolean logic functions of NOT, AND, OR, and XOR are realized using helical latch, reset spring, and translating rod assemblies. Building upon these components a design for two-level logic operations is presented. The helical latching mechanism calculates the Boolean output function as a positional displacement from a known reset state, which occurs exactly once during each instruction cycle. To balance forces a symmetrical rotor is used to counteract applied forces by replicating input rods. This has the beneficial side-effect of providing intrinsic fault-detection capability within a gate and also decreases the rotation required for a full cycle from 360 degrees to 180 degrees. This design is further enhanced to allow operations of arbitrary word length by subdividing the logic disc into sectors where each sector contains all the components necessary to operate on a single bit. The benefits of increasing the disc diameter needed for additional bits include a further reduction in disc cycle rotation as a result of subdividing the disc into sectors. Since the inputs are sampled sequentially, throughput of resultants can be increased directly by pipelining multiple bit operands. For n inputs per logic gate, the maximum speedup for a single level of logic is (n+2). Generally, speedup is bounded by (n+2)/p where p denotes the number of cycles between initiations of the pipe.
计算纳米技术的流水线架构
采用有界连续体模型对输入尺寸和传播路径深度可伸缩的纳米力学计算单元进行了分析。通过螺旋锁存器、复位弹簧和平移杆组件实现非、与、或和异或的布尔逻辑功能。在这些组件的基础上,提出了两级逻辑运算的设计。螺旋锁存机制将布尔输出函数计算为从已知复位状态的位置位移,这在每个指令周期中恰好发生一次。为了平衡力,一个对称的转子被用来抵消通过复制输入杆施加的力。这具有在栅极内提供固有故障检测能力的有益副作用,并且还将整个周期所需的旋转从360度减少到180度。这种设计进一步增强,通过将逻辑磁盘细分为扇区,每个扇区包含在单个位上操作所需的所有组件,从而允许任意字长度的操作。增加额外钻头所需的磁盘直径的好处包括,由于将磁盘细分为扇区,磁盘周期旋转进一步减少。由于输入是顺序采样的,结果的吞吐量可以通过多位操作数的流水线直接增加。对于每个逻辑门的n个输入,单个逻辑级的最大加速为(n+2)。通常,加速以(n+2)/p为界,其中p表示管道启动之间的循环次数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信