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

1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)最新文献

筛选
英文 中文
Compatible hardware for division and square root 用于除法和平方根的兼容硬件
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI: 10.1109/ARITH.1981.6159293
G. Taylor
{"title":"Compatible hardware for division and square root","authors":"G. Taylor","doi":"10.1109/ARITH.1981.6159293","DOIUrl":"https://doi.org/10.1109/ARITH.1981.6159293","url":null,"abstract":"Hardware for radix four division and radix two square root is shared in a processor designed to implement the proposed IEEE floating-point standard. The division hardware looks ahead to find the next quotient digit in parallel with the next partial remainder. An 8-bit ALU estimates the next remainder's leading bits. The quotient digit look-up table is addressed with a truncation of the estimate rather than a truncation of the full partial remainder. The estimation ALU and the look-up table are asymmetric for positive and negative remainders. This asymmetry reduces the width of the ALU and the number of minterms in the logic equations for thy look-up table. The square root algorithm obtains the correctly rounded result in about two division times using small extensions to the division hardware.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132938655","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}
引用次数: 46
Algorithms for extracting square roots and cube roots 提取平方根和立方根的算法
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI: 10.1109/ARITH.1981.6159287
Hong Peng
{"title":"Algorithms for extracting square roots and cube roots","authors":"Hong Peng","doi":"10.1109/ARITH.1981.6159287","DOIUrl":"https://doi.org/10.1109/ARITH.1981.6159287","url":null,"abstract":"This paper describes a kind of algorithms for fast extracting square roots and cube roots, their mathematical proofs, their revised algorithm formulae, and hardware implementation of the square root algorithm. These algorithms may be of no significance for large scale computer with fast division. But I am sure that it is effective and economical to apply these algorithms to the circuit designs of some mini- and microcomputers with general multiplication and division, such as nonrestoring division.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134531583","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}
引用次数: 11
Design of a digit-slice on-line arithmetic unit 一种数字切片在线运算单元的设计
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI: 10.1109/ARITH.1981.6159273
A. Gorji-Sinaki, M. Ercegovac
{"title":"Design of a digit-slice on-line arithmetic unit","authors":"A. Gorji-Sinaki, M. Ercegovac","doi":"10.1109/ARITH.1981.6159273","DOIUrl":"https://doi.org/10.1109/ARITH.1981.6159273","url":null,"abstract":"A gate level design of a digit-slice on-line arithmetic unit is presented. This unit is designed as a set of basic modules, Processing Elements (PE), each of which operates on a single digit of the operands and the results. It is capable of executing four basic operations of addition/subtraction, multiplication and division in an on-line manner. The results are generated during the digit-serial input of the operands, beginning always with the most significant digit. A general (with respect to radix) analysis of the cost and speed of the proposed unit is also given.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130196033","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}
引用次数: 17
Case study of a VLSI design project: A simple inner product machine 一个超大规模集成电路设计项目的案例研究:一个简单的内积产品机
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI: 10.1109/ARITH.1981.6159292
Rob A. Rutenbar, Y. E. Park
{"title":"Case study of a VLSI design project: A simple inner product machine","authors":"Rob A. Rutenbar, Y. E. Park","doi":"10.1109/ARITH.1981.6159292","DOIUrl":"https://doi.org/10.1109/ARITH.1981.6159292","url":null,"abstract":"We present a case study of the application of recently evolved structured VLSI design methodologies to the design and implementation of a simple VLSI quasi-serial inner product machine.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"359 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122999197","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
Algorithms for parallel addition and parallel polynomial evaluation 并行加法和并行多项式求值算法
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI: 10.1109/ARITH.1981.6159286
C. Papachristou
{"title":"Algorithms for parallel addition and parallel polynomial evaluation","authors":"C. Papachristou","doi":"10.1109/ARITH.1981.6159286","DOIUrl":"https://doi.org/10.1109/ARITH.1981.6159286","url":null,"abstract":"This paper presents two related algorithms for implementing parallel n-bit binary addition and evaluating n-th degree polynomials, respectively. The approach taken makes use of an iterative construction, the computation tree. The algorithms are particularly effective for moderate values of n and are in accord with well-known asymptotic bounds. In the case of n-bit addition, the implementations constitute look-ahead tree circuits of r-input standard logic elements. Extensions to modular tree structures for lookahead adders are also considered. In the case of parallel polynomial evaluation, the operations of ordinary addition and multiplication are assumed with the capability to employ r arguments simultaneously.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127543464","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}
引用次数: 2
Extension of the MC68000 architecture to include Standard Floating-point arithmetic MC68000架构的扩展，包括标准浮点运算
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI: 10.1109/ARITH.1981.6159295
Gregory Walker
{"title":"Extension of the MC68000 architecture to include Standard Floating-point arithmetic","authors":"Gregory Walker","doi":"10.1109/ARITH.1981.6159295","DOIUrl":"https://doi.org/10.1109/ARITH.1981.6159295","url":null,"abstract":"The synthetic aspect of designing a computer architecture is particularly evident when the design is highly constrained from two independent directions. Floating-point extensions of the MC68000 architecture incorporate the IEEE Proposed Floating-point Standard into the existing MC68000 architecture.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120979473","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
Residue arithmetic with rational operands 有理数的残数算术
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI: 10.1109/ARITH.1981.6159275
R. T. Gregory
{"title":"Residue arithmetic with rational operands","authors":"R. T. Gregory","doi":"10.1109/ARITH.1981.6159275","DOIUrl":"https://doi.org/10.1109/ARITH.1981.6159275","url":null,"abstract":"A method is described for doing residue arithmetic when the operands are rational numbers. A rational operand a/b is mapped onto the integer |a·b<sup>−1</sup>|<inf>p</inf> and the arithmetic is performed in GF(p). A method is given for taking an integer result and finding its rational equivalent (the one which corresponds to the correct rational result).","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128812837","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}
引用次数: 5
On an interval arithmetic and its applications 区间算法及其应用
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI: 10.1109/ARITH.1981.6159282
S. Markov
{"title":"On an interval arithmetic and its applications","authors":"S. Markov","doi":"10.1109/ARITH.1981.6159282","DOIUrl":"https://doi.org/10.1109/ARITH.1981.6159282","url":null,"abstract":"It is our point of view that familiar interval arithmetic defined by A∗B={a ∗ b: a ∊ A, b ∊ B}, ∗ ∊{+, −, ×, :} is inefficient in certain respects. For instance, it is not in a position to produce exact representations, of sets of the form {f(x, y, …, z):x ∊ X, y ∊ Y, …, z ∊ Z} even for simple functions f of one variable. We make use of another interval arithmetic which is very convenient for computer computations and for construction of interval algorithms. As an example we consider a method for the construction of interval expressions for sets of the form if {f(x):x ∊[x<inf>1</inf>, x<inf>2</inf>]}, where f is an elementary function.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133269295","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}
引用次数: 2
An algorithm for modular exponentiation 模幂的一种算法
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI: 10.1109/ARITH.1981.6159298
Robert Willoner, I. Chen
{"title":"An algorithm for modular exponentiation","authors":"Robert Willoner, I. Chen","doi":"10.1109/ARITH.1981.6159298","DOIUrl":"https://doi.org/10.1109/ARITH.1981.6159298","url":null,"abstract":"The best known algorithm for modular exponentiation Me mod t for arbitrary M, e and t is of O(n3) where n is the number of bits in the largest of M, e and t. This paper presents an O(n2) algorithm for the problem where Me mod t is required for many values of M and e with constant t some preprocessing is done on t, and the results are applied repeatedly to different values of M and e. The main algorithm involves on-line arithmetic in a redundant. number system. An immediate application is in encoding/decoding of messages in an RSA-based public-key cryptosystem.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131364169","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}
引用次数: 62
Sign detection in the Symmetric Residue Number System 对称剩余数系统中的符号检测
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI: 10.1109/ARITH.1981.6159278
Saroj Kaushik, R. Arora
{"title":"Sign detection in the Symmetric Residue Number System","authors":"Saroj Kaushik, R. Arora","doi":"10.1109/ARITH.1981.6159278","DOIUrl":"https://doi.org/10.1109/ARITH.1981.6159278","url":null,"abstract":"This paper is concerned with the algebraic sign detection of a number in the Symmetric Residue Number System, A new approach has been suggested which completely avoid the time consuming process of the Symmetric Mixed Radix Conversion (SMRC). An algorithm based on the above approach implementable in parallel for sign detection is also presented. The heriware representation of the above algorithm is shown. The time and hardware complexity required for the process have also bean computed.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123727905","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
首页 上一页 下一页 尾页
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学术官方微信