发布求助
文献互助 智能选刊 最新文献

2015 IEEE 22nd Symposium on Computer Arithmetic最新文献

筛选
英文 中文
A negative-binary adder-subtracter 负二进制加减法器
2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI: 10.1109/ARITH.1972.6153899
G. S. Rao, A. Krishnamurthy, M. N. Rao
{"title":"A negative-binary adder-subtracter","authors":"G. S. Rao, A. Krishnamurthy, M. N. Rao","doi":"10.1109/ARITH.1972.6153899","DOIUrl":"https://doi.org/10.1109/ARITH.1972.6153899","url":null,"abstract":"The logical design of an adder-subtracter for negative binary numbers is described. The twin-carry generates during the addition, is converted into a single hybrid-carry-borrow, this helps to design a circuit which can function as an adder or a subtracter with a simple switching control.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"23 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74306052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Two optimal square-rooting algorithms ussing iterative multiplication 使用迭代乘法的两种最优平方根算法
2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI: 10.1109/ARITH.1972.6153896
C. Ramamoorthy, K. H. Kim
{"title":"Two optimal square-rooting algorithms ussing iterative multiplication","authors":"C. Ramamoorthy, K. H. Kim","doi":"10.1109/ARITH.1972.6153896","DOIUrl":"https://doi.org/10.1109/ARITH.1972.6153896","url":null,"abstract":"With a view to the computational speed, it is obviously advantageous to perform the frequently used arithmetic operations in the hardware rather than in software, especially in scientifically oriented real-time applications.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"35 1","pages":"1-37"},"PeriodicalIF":0.0,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73668443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Eadix l6 evaluation of some elementary functions 一些初等函数的求值
2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI: 10.1109/ARITH.1972.6153907
M. Ercegovac
{"title":"Eadix l6 evaluation of some elementary functions","authors":"M. Ercegovac","doi":"10.1109/ARITH.1972.6153907","DOIUrl":"https://doi.org/10.1109/ARITH.1972.6153907","url":null,"abstract":"This paper describes an approach for obtaining a class of similar algorithms for evaluation of some elementary functions. The main objective is to show feasibility of higher radix implementations, in particular radix 16, as they offer better performance than radix 2. The emphasis is not on optimality of a single algorithm but rather on the optimality of the whole class of algorithms. An attempt to implement a much wider class of functions than is done in conventional arithmetic units, would be encouraged by the present level of technology and by the existence of suitable algorithms. Besides the definitions of the algorithms, which are based on continued products (sums), some details related to implementation are discussed.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"82 1","pages":"1-25"},"PeriodicalIF":0.0,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89650662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A polarizer for negative binary numbers 负二进制数的偏振器
2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI: 10.1109/ARITH.1972.6153900
G. S. Rao, E. Krishnamurthy, M. Rao
{"title":"A polarizer for negative binary numbers","authors":"G. S. Rao, E. Krishnamurthy, M. Rao","doi":"10.1109/ARITH.1972.6153900","DOIUrl":"https://doi.org/10.1109/ARITH.1972.6153900","url":null,"abstract":"The logical design of a polarizer for negative binary numbers is described and compared with the two's complementer used for positive binary numbers.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"1 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81567118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Application of continued fractions for fast evaluation of certain functions on a digital computer 连分式在数字计算机上快速求函数的应用
2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI: 10.1109/ARITH.1972.6153908
Amnon Bracha
{"title":"Application of continued fractions for fast evaluation of certain functions on a digital computer","authors":"Amnon Bracha","doi":"10.1109/ARITH.1972.6153908","DOIUrl":"https://doi.org/10.1109/ARITH.1972.6153908","url":null,"abstract":"The purpose of this paper is to develop a method for evaluation of certain elementary functions on a digital computer by the use of continued fractions. The time required for this evaluation is drastically reduced by using “short” operations like shift and add, instead of multiplications. Consistency is the most important factor that allows the expansion of a function into a continued fraction. Several cases are discussed and in particular the solution of the quadratic equation is discussed in more detail to demonstrate the convergence of the method.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"18 1","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82479754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Programming a vector computer 矢量计算机编程
2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI: 10.1109/ARITH.1972.6153901
W. Glaß
{"title":"Programming a vector computer","authors":"W. Glaß","doi":"10.1109/ARITH.1972.6153901","DOIUrl":"https://doi.org/10.1109/ARITH.1972.6153901","url":null,"abstract":"The principal purpose of this paper is to illustrate how some well known algorithms have been programmed on a specific vector computer, the CDC STAR-100. The main thesis is that the extensive repertoire of programs devised for conventional machines can be transferred effectively to a vector computer, though the detailed implementation will generally not follow that of a conventional machine. This means, that efficient use of STAR, for example, will not have to wait on the development of new algorithms, but can be realized with those already at hand. Indeed, most lead to much shorter programs on STAR than on conventional computers.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"58 1","pages":"1-28"},"PeriodicalIF":0.0,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79012147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Arithmetic codes in a module: A majority decoding approach 模块中的算术代码:多数解码方法
2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI: 10.1109/ARITH.1972.6153893
Oscar N. Garcia, Jorge R. Rodriguez
{"title":"Arithmetic codes in a module: A majority decoding approach","authors":"Oscar N. Garcia, Jorge R. Rodriguez","doi":"10.1109/ARITH.1972.6153893","DOIUrl":"https://doi.org/10.1109/ARITH.1972.6153893","url":null,"abstract":"It has been shown how arithmetic codes can be embedded in the structure of a module and how generator and check matrices may be defined. The motivation is to parallel the analogy with communication codes with the purpose of showing majority decoding. The technical difficulties in the derivations are pointed out while some partial results are given.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"41 1","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77122867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Groupoids and computer arithmetic 群类群与计算机算法
2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI: 10.1109/ARITH.1972.6153886
H. Garner, N. Foo, L. Hsieh
{"title":"Groupoids and computer arithmetic","authors":"H. Garner, N. Foo, L. Hsieh","doi":"10.1109/ARITH.1972.6153886","DOIUrl":"https://doi.org/10.1109/ARITH.1972.6153886","url":null,"abstract":"Overflow detection and overflow recovery imposed no particular requirements on the structure of (X, X 1 < X 1 , f x ). In particular, if f is associative and commutative, overflow recovery is obtainable even if f x is neither associative or commutative.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"83 1","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82752791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The status of investigations into the use of continued fractions for computer hardware 连分式在计算机硬件中的应用研究现状
2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI: 10.1109/ARITH.1972.6153902
J. E. Robertson, Kishor S. Trivedi
{"title":"The status of investigations into the use of continued fractions for computer hardware","authors":"J. E. Robertson, Kishor S. Trivedi","doi":"10.1109/ARITH.1972.6153902","DOIUrl":"https://doi.org/10.1109/ARITH.1972.6153902","url":null,"abstract":"The purpose of this paper is to demonstrate that representations of numbers other than positional notation may lead to practical hardware realizations for the digital calculation of classes of algorithms. It is the authors' opinion that practicality of the use of continued products has been demonstrated. This paper describes current research in the use of continued fractions. Although practicality has not been demonstrated, theoretical results are promising, and the results thus far are presented as a case study of the difficulties which arise when use of a new representation is attempted.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"123 1","pages":"1-30"},"PeriodicalIF":0.0,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88265627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A floating point processor for elementary functions 用于基本函数的浮点处理器
2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 1972-05-15 DOI: 10.1109/ARITH.1972.6153895
J. S. Walther
{"title":"A floating point processor for elementary functions","authors":"J. S. Walther","doi":"10.1109/ARITH.1972.6153895","DOIUrl":"https://doi.org/10.1109/ARITH.1972.6153895","url":null,"abstract":"The floating point processor expands the power of a minicomputer to perform floating point and scientific functions. In increases the computer's accuracy to 12 decimal digits and increases system throughput for scientific problems by 3 to 5 times. Its applications include minicomputer time-sharing systems, real-time systems and dedicated systems where high-speed and accuracy are required and where the cost of the processor is justified.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"62 1","pages":"1-27"},"PeriodicalIF":0.0,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84281399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信