{"title":"An arithmetic module for efficient evaluation of functions","authors":"M. Ercegovac, Melvin M. Takata","doi":"10.1109/ARITH.1978.6155774","DOIUrl":"https://doi.org/10.1109/ARITH.1978.6155774","url":null,"abstract":"The organization and design of an arithmetic module (Basic Byte-Slice Module — BBM) is presented. A network of BBM's implements an efficient digit-by-digit method for fast evaluation of polynomial and rational functions. Verification of the BBM design, its feasibility in present LSI technologies and its performance are discussed. The proposed BBM is characterized by a small number of input/output terminals, a uniform internal structure, and simple control and inter-module communication requirements.","PeriodicalId":443215,"journal":{"name":"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)","volume":"152 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134161821","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}
{"title":"A realistic model for error estimates in the evaluation of elementary functions","authors":"K. Frankowski","doi":"10.1109/ARITH.1978.6155776","DOIUrl":"https://doi.org/10.1109/ARITH.1978.6155776","url":null,"abstract":"Floating point error analysis, as described by J. H. Wilkinson (1963) has two known drawbacks: it is too pessimistic and too cumbersome for everyday use. This paper describes a realistic model for error analysis, gives examples of simple formulae frequently used in the calculation of elementary functions, and analyses the error generated in single precision computations with these formulae, using the proposed model for error analysis. The paper also presents error bounds for various polynomial evaluations, as predicted by the model. Model verification is done using double precision arithmetic.","PeriodicalId":443215,"journal":{"name":"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114339013","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}
{"title":"On modulo (2n+1) arithmetic logic","authors":"D. Agrawal, T. Rao","doi":"10.1109/ARITH.1978.6155764","DOIUrl":"https://doi.org/10.1109/ARITH.1978.6155764","url":null,"abstract":"A novel format for representing modulo (2n+1) numbers, is shown to be helpful in achieving modular addition and complementation. Logic for fast addition using carry-look-ahead and modular complementation is also presented.","PeriodicalId":443215,"journal":{"name":"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116616025","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}