变结构数字计算机中对数和指数函数的计算

D. Cantor, G. Estrin, R. Turn
{"title":"变结构数字计算机中对数和指数函数的计算","authors":"D. Cantor, G. Estrin, R. Turn","doi":"10.1109/TEC.1962.5219348","DOIUrl":null,"url":null,"abstract":"Sequential table look-up algorithms are proposed for the evaluation of ln x and exp x. Tables of pre-computed constants are utilized in transforming the argument into a range where the function may be approximated by a simpler polynomial. In the case of ln x, x is transformed so that it falls into a close neighborhood of 1; in the case of exp x, x is transformed to a close neighborhood of 0. These algorithms are particularly effective when mechanized so as to carry out the predetermined sequence of operations without waste manipulation. Such special purpose organization is reasonable within the variable structure part of UCLA's proposed Fixed-Plus-Variable structure computer, as the same equipment may be reorganized for use in other special purpose configurations at other times. In this paper the sequential table look-up algorithms and their speed advantages over existing subroutine approximation procedures are described. The design of special purpose configurations which leads to another factor of speed increase as compared to a stored program implementation of the algorithms is presented. The properties of the supervisory control which integrate the operation of the ``fixed structure'' general purpose computer and the ``variable structure'' special purpose configurations are specified and the over-all computational gains evaluated. An order-of-magnitude increase in speed compared to existing subroutines is predicted in both cases.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1962-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Logarithmic and Exponential Function Evaluation in a Variable Structure Digital Computer\",\"authors\":\"D. Cantor, G. Estrin, R. Turn\",\"doi\":\"10.1109/TEC.1962.5219348\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sequential table look-up algorithms are proposed for the evaluation of ln x and exp x. Tables of pre-computed constants are utilized in transforming the argument into a range where the function may be approximated by a simpler polynomial. In the case of ln x, x is transformed so that it falls into a close neighborhood of 1; in the case of exp x, x is transformed to a close neighborhood of 0. These algorithms are particularly effective when mechanized so as to carry out the predetermined sequence of operations without waste manipulation. Such special purpose organization is reasonable within the variable structure part of UCLA's proposed Fixed-Plus-Variable structure computer, as the same equipment may be reorganized for use in other special purpose configurations at other times. In this paper the sequential table look-up algorithms and their speed advantages over existing subroutine approximation procedures are described. The design of special purpose configurations which leads to another factor of speed increase as compared to a stored program implementation of the algorithms is presented. The properties of the supervisory control which integrate the operation of the ``fixed structure'' general purpose computer and the ``variable structure'' special purpose configurations are specified and the over-all computational gains evaluated. An order-of-magnitude increase in speed compared to existing subroutines is predicted in both cases.\",\"PeriodicalId\":177496,\"journal\":{\"name\":\"IRE Trans. Electron. Comput.\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1962-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IRE Trans. Electron. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TEC.1962.5219348\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IRE Trans. Electron. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TEC.1962.5219348","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

对于ln x和exp x的求值,提出了顺序表查找算法。在将参数转换为函数可以用更简单的多项式近似的范围时,使用预先计算的常数表。在ln x的情况下,x被变换成1的近邻;在exp x的情况下,x被转换成0的近邻。这些算法在机械化时特别有效,以便在没有浪费操作的情况下执行预定的操作顺序。这种特殊用途的组织在UCLA的Fixed-Plus-Variable结构计算机的可变结构部分是合理的,因为相同的设备可以在其他时间重组用于其他特殊用途配置。本文描述了顺序表查找算法及其相对于现有子程序逼近算法的速度优势。与算法的存储程序实现相比,提出了导致速度提高的另一个因素的特殊目的配置的设计。对“固定结构”通用计算机和“变结构”专用计算机的综合监控性能进行了说明,并对总体计算增益进行了评估。预计在这两种情况下,与现有子程序相比,速度都会有数量级的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Logarithmic and Exponential Function Evaluation in a Variable Structure Digital Computer
Sequential table look-up algorithms are proposed for the evaluation of ln x and exp x. Tables of pre-computed constants are utilized in transforming the argument into a range where the function may be approximated by a simpler polynomial. In the case of ln x, x is transformed so that it falls into a close neighborhood of 1; in the case of exp x, x is transformed to a close neighborhood of 0. These algorithms are particularly effective when mechanized so as to carry out the predetermined sequence of operations without waste manipulation. Such special purpose organization is reasonable within the variable structure part of UCLA's proposed Fixed-Plus-Variable structure computer, as the same equipment may be reorganized for use in other special purpose configurations at other times. In this paper the sequential table look-up algorithms and their speed advantages over existing subroutine approximation procedures are described. The design of special purpose configurations which leads to another factor of speed increase as compared to a stored program implementation of the algorithms is presented. The properties of the supervisory control which integrate the operation of the ``fixed structure'' general purpose computer and the ``variable structure'' special purpose configurations are specified and the over-all computational gains evaluated. An order-of-magnitude increase in speed compared to existing subroutines is predicted in both cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Electronic Generator of Random Numbers Real-Time Computation and Recursive Functions Not Real-Time Computable A Transistor Flip-Flop Full Binary Adder Bias-Controlled Tunnel-Pair Logic Circuits Analog-To-Digital Converter Utilizing an Esaki Diode Stack
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1