{"title":"On residue number A/D and D/A converters","authors":"G. Lipovski","doi":"10.1109/ARITH.1975.6156998","DOIUrl":"https://doi.org/10.1109/ARITH.1975.6156998","url":null,"abstract":"A very simple analog to digital converter and digital to analog converter is described for residue number digital processing. These simple devices make it feasible to replace analog components with comparitively inexpensive digital processors that use residue, or modulus, arithmetic capable of operating at very high speeds. Using off-the-shelf integrated circuits, addition, subtraction or multiplication of about 15 bits of accuracy can easily be done in as little as fifty nanoseconds. Any function using these operations (polynomial expansions, linear filters, fast fourier transforms) can be economically implemented in a pipeline or other structure to get very fast systems. Moreover, a stage in the pipeline can correct for non-linearities in the A/D or D/A converters. The simple devices described herein make residue arithmetic digital processors extremely attractive for use in fast analog systems.","PeriodicalId":360742,"journal":{"name":"1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124201062","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 unified numeric data type in Pascal","authors":"Peter Kornerup","doi":"10.1109/ARITH.1975.6156993","DOIUrl":"https://doi.org/10.1109/ARITH.1975.6156993","url":null,"abstract":"It is proposed to substitute the standard data type real of a high level language, with a unified data representation which can include a variety of interpretations as well as formats, in order to allow experiments with an environment containing a spectrum of non-standard arithmetics, as well as standard. The implementation of a system is described where syntatic extensions to a language are made to support a microprogrammed virtual arithmetic unit which can treat variants such as integers, normalized, and unnormalized floating point numbers and intervals, within a unified representation.∗∗ More specifically Pascal is chosen as the base language, because it allows the user to define new data types, and the extension then mainly consists in substituting the simple (unstructured) data type real with a skeletal structured type (which will be called numeric). The system is intended to be implemented on a microprogrammable processor (called MATHILDA) with a 64 bit wide datapath. The language Pascal has already been partially implemented based on a stack machine specifically designed for that language, and realized by interpretation in microcode. The present compiler was constructed with the aid of a parser-generator system, which will allow the language extensions to be made with a moderate effort.","PeriodicalId":360742,"journal":{"name":"1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122900108","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 general method for evaluation of functions and computations in a digital computing","authors":"M. Ercegovac","doi":"10.1109/ARITH.1975.6156981","DOIUrl":"https://doi.org/10.1109/ARITH.1975.6156981","url":null,"abstract":"This paper presents a recently discovered general computational method, amenable for efficient implementation in digital computing systems. The method provides a unique, simple and fast algorithm for solving many computational problems, such as the evaluation of polynomials, rational functions and arithmetic expressions, or solving a class of systems of linear equations, or performing the basic arithmetics. In particular, the method, is well suited for fast evaluation of commonly used, mathematical functions.","PeriodicalId":360742,"journal":{"name":"1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH)","volume":"232-233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123778660","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}