# bibtab

bibtype: mastersthesis
filename: fparith.bib
label: Williams:1983:BFP
author: Bertrand Jeffery Williams
title: A bit-serial floating point multiply / add architecture for signal processing applications
type: Electrical Engineering Thesis (M.S.)
school: Texas A&M University
address: College Station, TX, USA
pages: x + 97
year: 1983
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
keywords: Computer architecture.; Floating-point arithmetic.; Signal processing.
acknowledgement: ack-nhfb
rawauthor: Bertrand Jeffery Williams
rawtitle: A bit-serial floating point multiply\slash add architecture for signal processing applications
entry:
@MastersThesis{Williams:1983:BFP,
  author =       "Bertrand Jeffery Williams",
  title =        "A bit-serial floating point multiply\slash add
                 architecture for signal processing applications",
  type =         "Electrical Engineering Thesis ({M.S.})",
  school =       "Texas A\&M University",
  address =      "College Station, TX, USA",
  pages =        "x + 97",
  year =         "1983",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Computer architecture.; Floating-point arithmetic.;
                 Signal processing.",
}


bibtype: article
filename: fparith.bib
label: Wingert:1983:ITA
author: J. A. Wingert
title: Improved Table-assisted Addition and Multiplication Methods
journal: j-IBM-TDB
volume: 25
number: 9
pages: 4742--4743
month: feb
monthnumber: 2
year: 1983
CODEN: IBMTAA
ISSN: 0018-8689 OR 00188689
bibdate: Thu Sep 1 10:16:11 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.01 10:16:11 ???
fjournal: IBM Technical Disclosure Bulletin
acknowledgement: ack-nj
rawauthor: J. A. Wingert
rawtitle: Improved Table-assisted Addition and Multiplication Methods
entry:
@Article{Wingert:1983:ITA,
  author =       "J. A. Wingert",
  title =        "Improved Table-assisted Addition and Multiplication
                 Methods",
  journal =      j-IBM-TDB,
  volume =       "25",
  number =       "9",
  pages =        "4742--4743",
  month =        feb,
  year =         "1983",
  CODEN =        "IBMTAA",
  ISSN =         "0018-8689",
  bibdate =      "Thu Sep 1 10:16:11 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "IBM Technical Disclosure Bulletin",
}


bibtype: inproceedings
filename: fparith.bib
label: Yoshida:1983:FPR
author: Kaoru Yoshida
title: Floating-Point Recurring Rational Arithmetic System
crossref: IEEE:1983:PSC
pages: 194--200
year: 1983
bibdate: Tue Nov 13 15:58:57 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.13 15:58:57 ???
URL: http://www.acsel-lab.com/arithmetic/arith6/papers/ARITH6_Yoshida.pdf
keywords: ARITH-6; rational arithmetic
acknowledgement: ack-nhfb
rawauthor: Kaoru Yoshida
rawtitle: Floating-Point Recurring Rational Arithmetic System
abstract:
Major computer arithmetic systems are based on the concept of realizing only terminate rationals in positional notation. This paper proposes a new arithmetic scheme of indicating periodicity in the radix representation of a mantissa to realize recurring rationals as well as terminate rationals. A new arithmetic system adopting the scheme, called the ``FLP/R* arithmetic system'', is proposed. Properties of the FLP/R* numbers and the procedure of the FLP/R* arithmetic are described.

rawabstract:
Major computer arithmetic systems are based on the concept of realizing only terminate rationals in positional notation. This paper proposes a new arithmetic scheme of indicating periodicity in the radix representation of a mantissa to realize recurring rationals as well as terminate rationals. A new arithmetic system adopting the scheme, called the ``FLP/R* arithmetic system'', is proposed. Properties of the FLP/R* numbers and the procedure of the FLP/R* arithmetic are described.

entry:
@InProceedings{Yoshida:1983:FPR,
  author =       "Kaoru Yoshida",
  title =        "Floating-Point Recurring Rational Arithmetic System",
  crossref =     "IEEE:1983:PSC",
  pages =        "194--200",
  year =         "1983",
  bibdate =      "Tue Nov 13 15:58:57 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith6/papers/ARITH6_Yoshida.pdf",
  abstract =     "Major computer arithmetic systems are based on the
                 concept of realizing only terminate rationals in
                 positional notation. This paper proposes a new
                 arithmetic scheme of indicating periodicity in the
                 radix representation of a mantissa to realize recurring
                 rationals as well as terminate rationals. A new
                 arithmetic system adopting the scheme, called the
                 ``FLP/R* arithmetic system'', is proposed. Properties
                 of the FLP/R* numbers and the procedure of the FLP/R*
                 arithmetic are described.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-6; rational arithmetic",
}


bibtype: article
filename: fparith.bib
label: Ypma:1983:ERE
author: T. J. Ypma
title: The effect of rounding errors on Newtonlike methods
journal: j-IMA-J-NUMER-ANAL
volume: 3
number: 1
pages: 109--118
year: 1983
CODEN: IJNADH
ISSN: 0272-4979 (print), 1464-3642 (electronic) OR 02724979 (print), 14643642 (electronic)
ISSNL: 0272-4979 OR 02724979
MRclass: 65G05 (65H05)
MRnumber: 84h:65047
MRreviewer: Ren{\'e} Alt
bibdate: Sat Dec 23 17:06:35 MST 2000
bibtimestamp: 2000.12.23 17:06:35 MST
fjournal: IMA Journal of Numerical Analysis
acknowledgement: ack-nhfb
journalURL: http://imajna.oxfordjournals.org/content/by/year
rawauthor: T. J. Ypma
rawtitle: The effect of rounding errors on {Newtonlike} methods
bibsource:
https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/imajnumeranal.bib; MathSciNet database

entry:
@Article{Ypma:1983:ERE,
  author =       "T. J. Ypma",
  title =        "The effect of rounding errors on {Newtonlike}
                 methods",
  journal =      j-IMA-J-NUMER-ANAL,
  volume =       "3",
  number =       "1",
  pages =        "109--118",
  year =         "1983",
  CODEN =        "IJNADH",
  ISSN =         "0272-4979 (print), 1464-3642 (electronic)",
  ISSN-L =       "0272-4979",
  MRclass =      "65G05 (65H05)",
  MRnumber =     "84h:65047",
  MRreviewer =   "Ren{\'e} Alt",
  bibdate =      "Sat Dec 23 17:06:35 MST 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/imajnumeranal.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "IMA Journal of Numerical Analysis",
  journal-URL =  "http://imajna.oxfordjournals.org/content/by/year",
}


bibtype: inproceedings
filename: fparith.bib
label: Abruzzo:1984:ACA
author: J. Abruzzo
title: Applicability of CORDIC Algorithm to Arithmetic Processing
crossref: Kirk:1984:CRE
pages: 79--86
year: 1984
bibdate: Thu Sep 01 11:21:05 1994
bibtimestamp: 1994.09.01 11:21:05 ???
acknowledgement: ack-nj
rawauthor: J. Abruzzo
rawtitle: Applicability of {CORDIC} Algorithm to Arithmetic Processing
entry:
@InProceedings{Abruzzo:1984:ACA,
  author =       "J. Abruzzo",
  title =        "Applicability of {CORDIC} Algorithm to Arithmetic
                 Processing",
  crossref =     "Kirk:1984:CRE",
  pages =        "79--86",
  year =         "1984",
  bibdate =      "Thu Sep 01 11:21:05 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
}


bibtype: inproceedings
filename: fparith.bib
label: Abuzzo:1984:ACA
author: J. Abuzzo
title: Applicability of CORDIC algorithm to arithmetic processing
publisher: pub-IEEE
address: pub-IEEE:adr
pages: ??--??
year: 1984
bibdate: Wed Oct 29 10:19:20 2025
bibsource: https://www.math.utah.edu/pub/tex/bib/cordic.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2025.10.29 10:19:20 ???
acknowledgement: ack-nhfb
rawauthor: J. Abuzzo
rawtitle: Applicability of {CORDIC} algorithm to arithmetic processing
booktitle:
IEEE Eighteenth Asilomar Conf. on Circuits, Systems and Computers, Pacific Grove, CA, USA, November 5--7, 1984

rawbooktitle:
{IEEE Eighteenth Asilomar Conf. on Circuits, Systems and Computers, Pacific Grove, CA, USA, November 5--7, 1984}

entry:
@InProceedings{Abuzzo:1984:ACA,
  author =       "J. Abuzzo",
  editor =       "????",
  booktitle =    "{IEEE Eighteenth Asilomar Conf. on Circuits, Systems
                 and Computers, Pacific Grove, CA, USA, November 5--7,
                 1984}",
  title =        "Applicability of {CORDIC} algorithm to arithmetic
                 processing",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "??--??",
  year =         "1984",
  DOI =          "",
  ISBN =         "",
  ISBN-13 =      "",
  LCCN =         "",
  bibdate =      "Wed Oct 29 10:19:20 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: fparith.bib
label: Agrawal:1984:ACB
author: V. K. Agrawal and S. Murugesan
title: Algorithm converts BCD fractions to binary
journal: j-EDN
volume: 29
number: 13
pages: 278--280
month: jun
monthnumber: 6
year: 1984
CODEN: EDNSBH
ISSN: 0012-7515, 0364-6637 OR 00127515, 03646637
bibdate: Thu Sep 1 10:16:10 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.01 10:16:10 ???
fjournal: EDN
acknowledgement: ack-nj
rawauthor: V. K. Agrawal and S. Murugesan
rawtitle: Algorithm converts {BCD} fractions to binary
entry:
@Article{Agrawal:1984:ACB,
  author =       "V. K. Agrawal and S. Murugesan",
  title =        "Algorithm converts {BCD} fractions to binary",
  journal =      j-EDN,
  volume =       "29",
  number =       "13",
  pages =        "278--280",
  month =        jun,
  year =         "1984",
  CODEN =        "EDNSBH",
  ISSN =         "0012-7515, 0364-6637",
  bibdate =      "Thu Sep 1 10:16:10 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "EDN",
}


bibtype: article
filename: fparith.bib
label: Alia:1984:VAD
author: G. Alia and E. Martinelli
journal: j-IEEE-TRANS-CIRCUITS-SYST
volume: 31
number: 12
pages: 1033--1039
month: dec
monthnumber: 12
year: 1984
CODEN: ICSYBT
DOI: https://doi.org/10.1109/TC.1984.1676355
ISSN: 0098-4094 (print), 1558-1276 (electronic) OR 00984094 (print), 15581276 (electronic)
ISSNL: 0098-4094 OR 00984094
bibdate: Fri Nov 9 11:38:57 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.09 11:38:57 MST
URL: https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=23552
fjournal: IEEE Transactions on Circuits and Systems
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
rawauthor: G. Alia and E. Martinelli
title:
A VLSI algorithm for direct and reverse conversion from weighted binary number system to residue number system

rawtitle:
A {VLSI} algorithm for direct and reverse conversion from weighted binary number system to residue number system

entry:
@Article{Alia:1984:VAD,
  author =       "G. Alia and E. Martinelli",
  title =        "A {VLSI} algorithm for direct and reverse conversion
                 from weighted binary number system to residue number
                 system",
  journal =      j-IEEE-TRANS-CIRCUITS-SYST,
  volume =       "31",
  number =       "12",
  pages =        "1033--1039",
  month =        dec,
  year =         "1984",
  CODEN =        "ICSYBT",
  DOI =          "https://doi.org/10.1109/TC.1984.1676355",
  ISSN =         "0098-4094 (print), 1558-1276 (electronic)",
  ISSN-L =       "0098-4094",
  bibdate =      "Fri Nov 9 11:38:57 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=23552",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Circuits and Systems",
  keywords =     "residue arithmetic; residue number system",
  summary =      "Residue Number Systems (RNS) are proved to be useful
                 in many applications, as for example in signal
                 processing. In this paper, a VLSI computing
                 architecture is proposed for converting an integer
                 number N from the weighted binary representation into
                 \ldots{}",
}


bibtype: inproceedings
filename: fparith.bib
label: Ancona:1984:PET
author: M. Ancona and G. Dodero and F. Ricci
title: A portable environment for teaching mathematical software development
crossref: Ford:1984:TML
pages: 135--145
year: 1984
bibdate: Sat Nov 9 08:26:18 MST 2002
bibsource: ACM Computing Archive CD-ROM database (1991); https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2002.11.09 08:26:18 MST
note: See main entry CR, Rev. 8508--0689.
acknowledgement: ack-nhfb
rawauthor: M. Ancona and G. Dodero and F. Ricci
rawnote: See main entry CR, Rev. 8508--0689.
rawtitle: A portable environment for teaching mathematical software development
subject:
G. Mathematics of Computing; G.4 MATHEMATICAL SOFTWARE; K. Computing Milieux; K.6 MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS; D. Software; D.2 SOFTWARE ENGINEERING; K. Computing Milieux; K.3 COMPUTERS AND EDUCATION

entry:
@InProceedings{Ancona:1984:PET,
  author =       "M. Ancona and G. Dodero and F. Ricci",
  title =        "A portable environment for teaching mathematical
                 software development",
  crossref =     "Ford:1984:TML",
  pages =        "135--145",
  year =         "1984",
  bibdate =      "Sat Nov 9 08:26:18 MST 2002",
  bibsource =    "ACM Computing Archive CD-ROM database (1991);
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "See main entry CR, Rev. 8508--0689.",
  acknowledgement = ack-nhfb,
  content =      "ALGORITHMS; DESIGN; LANGUAGES; STANDARDIZATION",
  procloc =      "Proceedings paper",
  subject =      "G. Mathematics of Computing; G.4 MATHEMATICAL
                 SOFTWARE; K. Computing Milieux; K.6 MANAGEMENT OF
                 COMPUTING AND INFORMATION SYSTEMS; D. Software; D.2
                 SOFTWARE ENGINEERING; K. Computing Milieux; K.3
                 COMPUTERS AND EDUCATION",
  subjects =     "mathematics of computing, mathematical software,
                 portability; computing milieux, management of computing
                 and information systems, software management, software
                 development; software, software engineering,
                 distribution and maintenance, portability; computing
                 milieux, computers and education, computer and
                 information science education, computer science
                 education",
  wsub =         "A. C. R. Newbery",
}


bibtype: article
filename: fparith.bib
label: Anonymous:1984:CPD
author: Anonymous
title: Correction to ``A Pipelined Distributed Arithmetic PFFT Processor''
journal: j-IEEE-TRANS-COMPUT
volume: C-33
number: 3
pages: 288--288
month: mar
monthnumber: 3
year: 1984
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1984.1676429
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 09:22:50 MDT 2011
bibtimestamp: 2011.07.10 09:22:50 MDT
note: See cite Chow:1983:PDA.
URL: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676429
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: Anonymous
rawnote: See \cite{Chow:1983:PDA}.
rawtitle: Correction to {``A Pipelined Distributed Arithmetic PFFT Processor''}
entry:
@Article{Anonymous:1984:CPD,
  author =       "Anonymous",
  title =        "Correction to {``A Pipelined Distributed Arithmetic
                 PFFT Processor''}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-33",
  number =       "3",
  pages =        "288--288",
  month =        mar,
  year =         "1984",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1984.1676429",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 09:22:50 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  note =         "See \cite{Chow:1983:PDA}.",
  URL =          "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676429",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: inproceedings
filename: fparith.bib
label: Bell:1984:RMR
author: M. Bell, Jr. and W. Jenkins
booktitle: IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '84
title: A residue to mixed radix converter and error checker for a five-moduli residue number system
publisher: pub-IEEE
address: pub-IEEE:adr
pages: 242--245
year: 1984
bibdate: Fri Nov 9 11:38:58 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.09 11:38:58 MST
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
rawauthor: M. {Bell, Jr.} and W. Jenkins
rawbooktitle: {IEEE} International Conference on Acoustics, Speech, and Signal Processing, {ICASSP '84}
rawtitle: A residue to mixed radix converter and error checker for a five-moduli residue number system
entry:
@InProceedings{Bell:1984:RMR,
  author =       "M. {Bell, Jr.} and W. Jenkins",
  booktitle =    "{IEEE} International Conference on Acoustics, Speech,
                 and Signal Processing, {ICASSP '84}",
  title =        "A residue to mixed radix converter and error checker
                 for a five-moduli residue number system",
  volume =       "??",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "242--245",
  year =         "1984",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Fri Nov 9 11:38:58 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "residue arithmetic; residue number system",
  summary =      "A design is presented for an experimental device which
                 converts data from residue representation to mixed
                 radix representation while simultaneously checking for
                 single digit errors. The experimental system has a high
                 speed pipelined architecture and \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Black:1984:NIS
author: Cheryl M. Black and Robert P. Burton and Thomas M. Miller
title: The Need for an Industry Standard of Accuracy for Elementary-Function Programs
journal: j-TOMS
volume: 10
number: 4
pages: 361--366
month: dec
monthnumber: 12
year: 1984
CODEN: ACMSCU
DOI: https://doi.org/10.1145/2701.356101
ISSN: 0098-3500 (print), 1557-7295 (electronic) OR 00983500 (print), 15577295 (electronic)
ISSNL: 0098-3500 OR 00983500
bibdate: Sun Sep 04 20:32:29 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.04 20:32:29 ???
fjournal: ACM Transactions on Mathematical Software (TOMS)
acknowledgement: ack-nhfb
journalURL: https://dl.acm.org/loi/toms
rawauthor: Cheryl M. Black and Robert P. Burton and Thomas M. Miller
rawtitle: The Need for an Industry Standard of Accuracy for Elementary-Function Programs
entry:
@Article{Black:1984:NIS,
  author =       "Cheryl M. Black and Robert P. Burton and Thomas M.
                 Miller",
  title =        "The Need for an Industry Standard of Accuracy for
                 Elementary-Function Programs",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "361--366",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/2701.356101",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sun Sep 04 20:32:29 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "https://dl.acm.org/loi/toms",
}


bibtype: article
filename: fparith.bib
label: Bollen:1984:NSD
author: J. A. M. Bollen
title: Numerical Stability of Descent Methods for Solving Linear Equations
journal: j-NUM-MATH
volume: 43
number: 3
pages: 361--377
year: 1984
CODEN: NUMMA7
ISSN: 0029-599X (print), 0945-3245 (electronic) OR 0029599X (print), 09453245 (electronic)
ISSNL: 0029-599X OR 0029599X
MRclass: 65G05 (65F10)
MRnumber: 85f:65041
bibdate: Mon May 26 11:49:34 MDT 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1997.05.26 11:49:34 MDT
fjournal: Numerische Mathematik
acknowledgement: ack-nhfb
corpsource: Department of Appl. Maths., Twente University of Technol., Enschede, Netherlands
journalURL: http://link.springer.com/journal/211
treatment: T Theoretical or Mathematical
rawauthor: J. A. M. Bollen
rawtitle: Numerical Stability of Descent Methods for Solving Linear Equations
keywords:
descent methods; digital arithmetic; error analysis; floating point arithmetic; Gauss-Southwell method; gradient method; linear differential equations; linear equations; linear systems; numerical stability; roundoff error analysis; stability

entry:
@Article{Bollen:1984:NSD,
  author =       "J. A. M. Bollen",
  title =        "Numerical Stability of Descent Methods for Solving
                 Linear Equations",
  journal =      j-NUM-MATH,
  volume =       "43",
  number =       "3",
  pages =        "361--377",
  year =         "1984",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  MRclass =      "65G05 (65F10)",
  MRnumber =     "85f:65041",
  bibdate =      "Mon May 26 11:49:34 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  classification = "B0290B (Error analysis in numerical methods); C4110
                 (Error analysis in numerical methods)",
  corpsource =   "Department of Appl. Maths., Twente University of
                 Technol., Enschede, Netherlands",
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  keywords =     "descent methods; digital arithmetic; error analysis;
                 floating point arithmetic; Gauss-Southwell method;
                 gradient method; linear differential equations; linear
                 equations; linear systems; numerical stability;
                 roundoff error analysis; stability",
  treatment =    "T Theoretical or Mathematical",
}


bibtype: inproceedings
filename: fparith.bib
label: Boney:1984:GTD
author: J. Boney
title: Goals and tradeoffs in the design of the MC68881 floating point coprocessor
crossref: NCC:1984:ACP
pages: 107--113
year: 1984
bibdate: Wed Sep 7 22:31:45 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.07 22:31:45 ???
acknowledgement: ack-nj
rawauthor: J. Boney
rawtitle: Goals and tradeoffs in the design of the {MC68881} floating point coprocessor
entry:
@InProceedings{Boney:1984:GTD,
  author =       "J. Boney",
  title =        "Goals and tradeoffs in the design of the {MC68881}
                 floating point coprocessor",
  crossref =     "NCC:1984:ACP",
  pages =        "107--113",
  year =         "1984",
  bibdate =      "Wed Sep 7 22:31:45 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
}


bibtype: article
filename: fparith.bib
label: Borwein:1984:AGM
author: J. M. Borwein and P. B. Borwein
title: The Arithmetic-Geometric Mean and Fast Computation of Elementary Functions
journal: j-SIAM-REVIEW
volume: 26
number: 3
pages: 351--366
month: jul
monthnumber: 7
year: 1984
CODEN: SIREAD
DOI: https://doi.org/10.1137/1026073
ISSN: 0036-1445 (print), 1095-7200 (electronic) OR 00361445 (print), 10957200 (electronic)
ISSNL: 0036-1445 OR 00361445
MRclass: 65D20 (26A09)
MRnumber: 86d:65029
MRreviewer: S. Conde
bibdate: Sat Mar 29 09:53:48 MDT 2014
bibtimestamp: 2014.03.29 09:53:48 MDT
fjournal: SIAM Review
acknowledgement: ack-nhfb
affiliationaddress: Dalhousie Univ, Halifax, NS, Can
journalURL: http://epubs.siam.org/sirev
journalabr: SIAM Rev
onlinedate: July 1984
rawauthor: J. M. Borwein and P. B. Borwein
rawtitle: The Arithmetic-Geometric Mean and Fast Computation of Elementary Functions
bibsource:
Compendex database; ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt; http://epubs.siam.org/toc/siread/26/3; https://www.math.utah.edu/pub/tex/bib/elefunt.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/siamreview.bib

abstract:
We produce a self contained account of the relationship between the Gaussian arithmetic-geometric mean iteration and the fast computation of elementary functions. A particularly pleasant algorithm for pi is one of the by-products.

keywords:
AGM (Arithmetic-Geometric Mean); arithmetic-geometric mean; calculation of pi; computational methods; elliptic functions; Iterative Methods; mathematical techniques; numerical mathematics

rawabstract:
We produce a self contained account of the relationship between the Gaussian arithmetic-geometric mean iteration and the fast computation of elementary functions. A particularly pleasant algorithm for pi is one of the by-products.

entry:
@Article{Borwein:1984:AGM,
  author =       "J. M. Borwein and P. B. Borwein",
  title =        "The Arithmetic-Geometric Mean and Fast Computation of
                 Elementary Functions",
  journal =      j-SIAM-REVIEW,
  volume =       "26",
  number =       "3",
  pages =        "351--366",
  month =        jul,
  year =         "1984",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1026073",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "65D20 (26A09)",
  MRnumber =     "86d:65029",
  MRreviewer =   "S. Conde",
  bibdate =      "Sat Mar 29 09:53:48 MDT 2014",
  bibsource =    "Compendex database;
                 ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt;
                 http://epubs.siam.org/toc/siread/26/3;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  abstract =     "We produce a self contained account of the
                 relationship between the Gaussian arithmetic-geometric
                 mean iteration and the fast computation of elementary
                 functions. A particularly pleasant algorithm for pi is
                 one of the by-products.",
  acknowledgement = ack-nhfb # " and " # ack-nj,
  affiliationaddress = "Dalhousie Univ, Halifax, NS, Can",
  classification = "723; 921",
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  journalabr =   "SIAM Rev",
  keywords =     "AGM (Arithmetic-Geometric Mean); arithmetic-geometric
                 mean; calculation of pi; computational methods;
                 elliptic functions; Iterative Methods; mathematical
                 techniques; numerical mathematics",
  onlinedate =   "July 1984",
}


bibtype: inproceedings
filename: fparith.bib
label: Braddock:1984:ASP
author: M. Braddock and V. Shahan
title: Amplifying System Performance in Floating-point Intensive Applications with the MC68881
crossref: Mini-Micro:1984:MMS
pages: 6/2/1--7
year: 1984
bibdate: Wed Sep 7 22:31:45 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.07 22:31:45 ???
acknowledgement: ack-nj
rawauthor: M. Braddock and V. Shahan
rawtitle: Amplifying System Performance in Floating-point Intensive Applications with the {MC68881}
entry:
@InProceedings{Braddock:1984:ASP,
  author =       "M. Braddock and V. Shahan",
  title =        "Amplifying System Performance in Floating-point
                 Intensive Applications with the {MC68881}",
  crossref =     "Mini-Micro:1984:MMS",
  pages =        "6/2/1--7",
  year =         "1984",
  bibdate =      "Wed Sep 7 22:31:45 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
}


bibtype: article
filename: fparith.bib
label: Butterfield:1984:MT
author: J. Butterfield
title: Math and Tables
journal: j-COMPUTE
volume: 6
number: 9
pages: 134--135
month: sep
monthnumber: 9
year: 1984
CODEN: COMPER
ISSN: 0194-357X OR 0194357X
bibdate: Thu Sep 1 10:15:30 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.01 10:15:30 ???
fjournal: Compute
acknowledgement: ack-nj
rawauthor: J. Butterfield
rawtitle: Math and Tables
entry:
@Article{Butterfield:1984:MT,
  author =       "J. Butterfield",
  title =        "Math and Tables",
  journal =      j-COMPUTE,
  volume =       "6",
  number =       "9",
  pages =        "134--135",
  month =        sep,
  year =         "1984",
  CODEN =        "COMPER",
  ISSN =         "0194-357X",
  bibdate =      "Thu Sep 1 10:15:30 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "Compute",
}


bibtype: article
filename: fparith.bib
label: Caraiscos:1984:REA
author: C. Caraiscos and Bede Liu
title: A roundoff error analysis of the LMS adaptive algorithm
journal: j-IEEE-TRANS-ACOUST-SPEECH
volume: 32
number: 1
pages: 34--41
month: feb
monthnumber: 2
year: 1984
CODEN: IETABA
ISSN: 0096-3518 OR 00963518
bibdate: Sat Jul 16 11:25:06 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2005.07.16 11:25:06 MDT
fjournal: IEEE Transactions on Acoustics, Speech, and Signal Processing
acknowledgement: ack-nhfb
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=29
rawauthor: C. Caraiscos and Bede Liu
rawtitle: A roundoff error analysis of the {LMS} adaptive algorithm
entry:
@Article{Caraiscos:1984:REA,
  author =       "C. Caraiscos and Bede Liu",
  title =        "A roundoff error analysis of the {LMS} adaptive
                 algorithm",
  journal =      j-IEEE-TRANS-ACOUST-SPEECH,
  volume =       "32",
  number =       "1",
  pages =        "34--41",
  month =        feb,
  year =         "1984",
  CODEN =        "IETABA",
  ISSN =         "0096-3518",
  bibdate =      "Sat Jul 16 11:25:06 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Acoustics, Speech, and Signal
                 Processing",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=29",
  summary =      "The steady state output error of the least mean square
                 (LMS) adaptive algorithm due to the finite precision
                 arithmetic of a digital processor is analyzed. It is
                 found to consist of three terms: (1) the error due to
                 the input data quantization, (2) the \ldots{}",
}


bibtype: book
filename: fparith.bib
label: Cavanagh:1984:DCA
author: Joseph J. F. Cavanagh
title: Digital Computer Arithmetic: Design and Implementation
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xi + 468
year: 1984
ISBN: 0-07-010282-1 OR 0070102821
ISBN13: 978-0-07-010282-8 OR 9780070102828
LCCN: QA76.9.C62 C38 1984
bibdate: Sat May 18 14:16:35 2002
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2002.05.18 14:16:35 ???
acknowledgement: ack-nj
rawauthor: Joseph J. F. Cavanagh
rawtitle: Digital Computer Arithmetic: Design and Implementation
entry:
@Book{Cavanagh:1984:DCA,
  author =       "Joseph J. F. Cavanagh",
  title =        "Digital Computer Arithmetic: Design and
                 Implementation",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xi + 468",
  year =         "1984",
  ISBN =         "0-07-010282-1",
  ISBN-13 =      "978-0-07-010282-8",
  LCCN =         "QA76.9.C62 C38 1984",
  bibdate =      "Sat May 18 14:16:35 2002",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  price =        "US\$21.95",
  acknowledgement = ack-nj,
}


bibtype: mastersthesis
filename: fparith.bib
label: Cheng:1984:FPC
author: Doreen Y. Cheng
title: A floating point coprocessor for the Butterfly multiprocessor system: research project
type: Thesis (M.S. in Electrical Engineering)
school: University of California, Berkeley. Dept. of Electrical Engineering and Computer Sciences
address: Berkeley, CA, USA
pages: 51 + 38
month: may
monthnumber: 5
year: 1984
bibdate: Wed Nov 25 08:35:11 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1998.11.25 08:35:11 ???
acknowledgement: ack-nhfb
rawauthor: Doreen Y. Cheng
rawtitle: A floating point coprocessor for the {Butterfly} multiprocessor system: research project
entry:
@MastersThesis{Cheng:1984:FPC,
  author =       "Doreen Y. Cheng",
  title =        "A floating point coprocessor for the {Butterfly}
                 multiprocessor system: research project",
  type =         "Thesis ({M.S. in Electrical Engineering})",
  school =       "University of California, Berkeley. Dept. of
                 Electrical Engineering and Computer Sciences",
  address =      "Berkeley, CA, USA",
  pages =        "51 + 38",
  month =        may,
  year =         "1984",
  bibdate =      "Wed Nov 25 08:35:11 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: fparith.bib
label: Clarke:1984:AAR
author: M. R. Clarke
title: An Analytical Approach to Rounding
journal: j-J-APPL-STAT
volume: 11
number: 1
pages: 12--20
year: 1984
DOI: https://doi.org/10.1080/02664768400000003
ISSN: 0266-4763 (print), 1360-0532 (electronic) OR 02664763 (print), 13600532 (electronic)
ISSNL: 0266-4763 OR 02664763
bibdate: Tue Sep 6 11:15:48 MDT 2011
bibtimestamp: 2011.09.06 11:15:48 MDT
fjournal: Journal of Applied Statistics
acknowledgement: ack-nhfb
journalURL: http://www.tandfonline.com/loi/cjas20
onlinedate: 28 Jul 2006
rawauthor: M. R. Clarke
rawtitle: An Analytical Approach to Rounding
bibsource:
http://www.tandf.co.uk/journals/routledge/02664763.html; https://www.math.utah.edu/pub/tex/bib/fparith.bib

entry:
@Article{Clarke:1984:AAR,
  author =       "M. R. Clarke",
  title =        "An Analytical Approach to Rounding",
  journal =      j-J-APPL-STAT,
  volume =       "11",
  number =       "1",
  pages =        "12--20",
  year =         "1984",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/02664768400000003",
  ISSN =         "0266-4763 (print), 1360-0532 (electronic)",
  ISSN-L =       "0266-4763",
  bibdate =      "Tue Sep 6 11:15:48 MDT 2011",
  bibsource =    "http://www.tandf.co.uk/journals/routledge/02664763.html;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Statistics",
  journal-URL =  "http://www.tandfonline.com/loi/cjas20",
  onlinedate =   "28 Jul 2006",
}


bibtype: article
filename: fparith.bib
label: Clenshaw:1984:BFP
author: C. W. Clenshaw and F. W. J. Olver
title: Beyond Floating Point
journal: j-J-ACM
volume: 31
number: 2
pages: 319--328
month: apr
monthnumber: 4
year: 1984
CODEN: JACOAH
DOI: https://doi.org/10.1145/62.322429
ISSN: 0004-5411 (print), 1557-735X (electronic) OR 00045411 (print), 1557735X (electronic)
ISSNL: 0004-5411 OR 00045411
MRclass: 65G05
MRnumber: 819 141
bibdate: Wed Jan 15 18:12:53 MST 1997
bibtimestamp: 1997.01.15 18:12:53 MST
fjournal: Journal of the Association for Computing Machinery
acknowledgement: ack-nhfb
affiliationaddress: Univ of Lancaster, Dep of Mathematics, Lancaster, Engl
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J401
journalabr: J Assoc Comput Mach
rawauthor: C. W. Clenshaw and F. W. J. Olver
rawtitle: Beyond Floating Point
bibsource:
Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib

abstract:
A new number system is proposed for computer arithmetic based on iterated exponential functions. The main advantage is to eradicate overflow and underflow, but there are several other advantages and these are described and discussed.

keywords:
computer arithmetic; computer metatheory; error analysis; mathematical techniques --- Digital Arithmetic; overflow; rounding error; underflow

rawabstract:
A new number system is proposed for computer arithmetic based on iterated exponential functions. The main advantage is to eradicate overflow and underflow, but there are several other advantages and these are described and discussed.

entry:
@Article{Clenshaw:1984:BFP,
  author =       "C. W. Clenshaw and F. W. J. Olver",
  title =        "Beyond Floating Point",
  journal =      j-J-ACM,
  volume =       "31",
  number =       "2",
  pages =        "319--328",
  month =        apr,
  year =         "1984",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/62.322429",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  MRclass =      "65G05",
  MRnumber =     "819 141",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A new number system is proposed for computer
                 arithmetic based on iterated exponential functions. The
                 main advantage is to eradicate overflow and underflow,
                 but there are several other advantages and these are
                 described and discussed.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Univ of Lancaster, Dep of Mathematics,
                 Lancaster, Engl",
  classification = "723",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer arithmetic; computer metatheory; error
                 analysis; mathematical techniques --- Digital
                 Arithmetic; overflow; rounding error; underflow",
}


bibtype: article
filename: fparith.bib
label: Cody:1984:PRW
title: A Proposed Radix- and Word-length-independent Standard for Floating-Point Arithmetic
journal: j-IEEE-MICRO
volume: 4
number: 4
pages: 86--100
month: jul
monthnumber: 7
year: 1984
CODEN: IEMIDZ
DOI: https://doi.org/10.1109/MM.1984.291224
ISSN: 0272-1732 (print), 1937-4143 (electronic) OR 02721732 (print), 19374143 (electronic)
ISSNL: 0272-1732 OR 02721732
bibdate: Thu Nov 8 14:50:28 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.08 14:50:28 ???
fjournal: IEEE Micro
acknowledgement: ack-nj
journalURL: http://www.computer.org/csdl/mags/mi/index.html
rawtitle: A Proposed Radix- and Word-length-independent Standard for Floating-Point Arithmetic
author:
William J. Cody, Jr. and Jerome T. Coonen and David M. Gay and K. Hanson and David Hough and W. Kahan and R. Karpinski and John F. Palmer and F. N. Ris and D. Stevenson

rawauthor:
William J. {Cody, Jr.} and Jerome T. Coonen and David M. Gay and K. Hanson and David Hough and W. Kahan and R. Karpinski and John F. Palmer and F. N. Ris and D. Stevenson

entry:
@Article{Cody:1984:PRW,
  author =       "William J. {Cody, Jr.} and Jerome T. Coonen and David
                 M. Gay and K. Hanson and David Hough and W. Kahan and
                 R. Karpinski and John F. Palmer and F. N. Ris and D.
                 Stevenson",
  title =        "A Proposed Radix- and Word-length-independent Standard
                 for Floating-Point Arithmetic",
  journal =      j-IEEE-MICRO,
  volume =       "4",
  number =       "4",
  pages =        "86--100",
  month =        jul # "\slash " # aug,
  year =         "1984",
  CODEN =        "IEMIDZ",
  DOI =          "https://doi.org/10.1109/MM.1984.291224",
  ISSN =         "0272-1732 (print), 1937-4143 (electronic)",
  ISSN-L =       "0272-1732",
  bibdate =      "Thu Nov 8 14:50:28 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "IEEE Micro",
  journal-URL =  "http://www.computer.org/csdl/mags/mi/index.html",
}


bibtype: phdthesis
filename: fparith.bib
label: Coonen:1984:CPS
author: Jerome Toby Coonen
title: Contributions to a Proposed Standard for Binary Floating-Point Arithmetic
type: Thesis (Ph.D. in Mathematics)
school: Department of Mathematics, University of California at Berkeley
address: Berkeley, CA, USA
pages: 320
day: 18
month: dec
monthnumber: 12
year: 1984
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
URL: https://www.proquest.com/pqdtglobal/docview/303300605
remark: Doctoral degree conferred December 18, 1984.
acknowledgement: ack-nj
advisor: William M. Kahan
rawauthor: Jerome Toby Coonen
rawtitle: Contributions to a Proposed Standard for Binary Floating-Point Arithmetic
abstract:
In the fall of 1977 the Institute of Electrical and Electronics Engineers commissioned working group 754 to draft a standard for binary floating-point arithmetic. It was intended to prevent the proliferation of disparate arithmetics in the new microprocessor industry. At that time there were so many different flavors of arithmetic available on mainframes and minicomputers that the cost of reconciling their differences in numerical software had become, and remains, staggering. Now, more than five years later, draft 10.0 of the proposed standard has been voted out of the working group for IEEE approval.par This thesis consists of a set of ``footnotes'' to the proposed standard. The first of them, an implementation guide published in January 1980, served as a working draft of the standard for over a year. The remaining chapters unfolded as the proposed standard did. They include an analysis of gradual underflow, the most controversial feature of the standard; an exhaustive discussion of radix conversion, which has been specified in the proposed standard only up to a worst-case error bound; and a revised version of the arithmetic test suite which has been available in machine-readable form from the working group.

rawabstract:
In the fall of 1977 the Institute of Electrical and Electronics Engineers commissioned working group 754 to draft a standard for binary floating-point arithmetic. It was intended to prevent the proliferation of disparate arithmetics in the new microprocessor industry. At that time there were so many different flavors of arithmetic available on mainframes and minicomputers that the cost of reconciling their differences in numerical software had become, and remains, staggering. Now, more than five years later, draft 10.0 of the proposed standard has been voted out of the working group for IEEE approval.\par This thesis consists of a set of ``footnotes'' to the proposed standard. The first of them, an implementation guide published in January 1980, served as a working draft of the standard for over a year. The remaining chapters unfolded as the proposed standard did. They include an analysis of gradual underflow, the most controversial feature of the standard; an exhaustive discussion of radix conversion, which has been specified in the proposed standard only up to a worst-case error bound; and a revised version of the arithmetic test suite which has been available in machine-readable form from the working group.

entry:
@PhdThesis{Coonen:1984:CPS,
  author =       "Jerome Toby Coonen",
  title =        "Contributions to a Proposed Standard for Binary
                 Floating-Point Arithmetic",
  type =         "Thesis ({Ph.D.} in Mathematics)",
  school =       "Department of Mathematics, University of California at
                 Berkeley",
  address =      "Berkeley, CA, USA",
  pages =        "320",
  day =          "18",
  month =        dec,
  year =         "1984",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "https://www.proquest.com/pqdtglobal/docview/303300605",
  abstract =     "In the fall of 1977 the Institute of Electrical and
                 Electronics Engineers commissioned working group 754 to
                 draft a standard for binary floating-point arithmetic.
                 It was intended to prevent the proliferation of
                 disparate arithmetics in the new microprocessor
                 industry. At that time there were so many different
                 flavors of arithmetic available on mainframes and
                 minicomputers that the cost of reconciling their
                 differences in numerical software had become, and
                 remains, staggering. Now, more than five years later,
                 draft 10.0 of the proposed standard has been voted out
                 of the working group for IEEE approval.\par

                 This thesis consists of a set of ``footnotes'' to the
                 proposed standard. The first of them, an implementation
                 guide published in January 1980, served as a working
                 draft of the standard for over a year. The remaining
                 chapters unfolded as the proposed standard did. They
                 include an analysis of gradual underflow, the most
                 controversial feature of the standard; an exhaustive
                 discussion of radix conversion, which has been
                 specified in the proposed standard only up to a
                 worst-case error bound; and a revised version of the
                 arithmetic test suite which has been available in
                 machine-readable form from the working group.",
  acknowledgement = ack-nj # " and " # ack-nhfb,
  advisor =      "William M. Kahan",
  remark =       "Doctoral degree conferred December 18, 1984.",
}


bibtype: incollection
filename: fparith.bib
label: Corliss:1984:AGT
author: George F. Corliss and Louis B. Rall
crossref: Anonymous:1984:TFA
pages: 177--209
year: 1984
bibdate: Fri Dec 8 13:09:09 1995
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1995.12.08 13:09:09 ???
keywords: automatic differentiation; stability.; Taylor series
acknowledgement: ack-nj
rawauthor: George F. Corliss and Louis B. Rall
title:
Automatic generation of Taylor series in Pascal-SC: Basic operations and applications to differential equations

abstract:
Pascal-SC supports user-defined data types, user-defined operators, and accurate floating point and interval arithmetic for numerical computations. The authors implement data types TAYLOR and ITAYLOR (Interval Taylor) with operators $+$, $-$, $*$, $/$, $ ** $, and the functions SQR, SQRT, EXP, SIN, COS, ARCTAN, and LN. An initial value problem $ y' = y^2 $, $ y(0) = 1 $, is solved with TAYLOR and with ITAYLOR types to show that the series generation exhibits a mild instability which has no significant effect on the values of the solution computed by analytic continuation.

rawabstract:
Pascal-SC supports user-defined data types, user-defined operators, and accurate floating point and interval arithmetic for numerical computations. The authors implement data types TAYLOR and ITAYLOR (Interval Taylor) with operators $+$, $-$, $*$, $/$, $ ** $, and the functions SQR, SQRT, EXP, SIN, COS, ARCTAN, and LN. An initial value problem $ y' = y^2 $, $ y(0) = 1 $, is solved with TAYLOR and with ITAYLOR types to show that the series generation exhibits a mild instability which has no significant effect on the values of the solution computed by analytic continuation.

rawtitle:
Automatic generation of {Taylor} series in {Pascal-SC}: {Basic} operations and applications to differential equations

entry:
@InCollection{Corliss:1984:AGT,
  author =       "George F. Corliss and Louis B. Rall",
  title =        "Automatic generation of {Taylor} series in
                 {Pascal-SC}: {Basic} operations and applications to
                 differential equations",
  crossref =     "Anonymous:1984:TFA",
  pages =        "177--209",
  year =         "1984",
  bibdate =      "Fri Dec 8 13:09:09 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  abstract =     "Pascal-SC supports user-defined data types,
                 user-defined operators, and accurate floating point and
                 interval arithmetic for numerical computations. The
                 authors implement data types TAYLOR and ITAYLOR
                 (Interval Taylor) with operators $+$, $-$, $*$, $/$, $
                 ** $, and the functions SQR, SQRT, EXP, SIN, COS,
                 ARCTAN, and LN. An initial value problem $ y' = y^2 $,
                 $ y(0) = 1 $, is solved with TAYLOR and with ITAYLOR
                 types to show that the series generation exhibits a
                 mild instability which has no significant effect on the
                 values of the solution computed by analytic
                 continuation.",
  acknowledgement = ack-nj,
  comment =      "Also appeared as {\sl MRC Technical Summary Report No.
                 2497}, Mathematics Research Center, University of
                 Wisconsin-Madison, 1983.",
  keywords =     "automatic differentiation; stability.; Taylor series",
}


bibtype: article
filename: fparith.bib
label: Cowlishaw:1984:DRL
author: M. F. Cowlishaw
title: The Design of the REXX Language
journal: j-IBM-SYS-J
volume: 23
number: 4
pages: 326--335
year: 1984
CODEN: IBMSA7
ISSN: 0018-8670 OR 00188670
bibdate: Wed Jan 08 16:35:07 1997
bibsource: Compendex database; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1997.01.08 16:35:07 ???
note: First published as IBM Hursley Technical Report TR12.223, October 1983.
fjournal: IBM Systems Journal
acknowledgement: ack-nhfb
affiliation: IBM UK Ltd, Scientific Cent, Winchester, Engl
affiliationaddress: IBM UK Ltd, Scientific Cent, Winchester, Engl
journalabr: IBM Syst J
rawauthor: M. F. Cowlishaw
rawnote: First published as IBM Hursley Technical Report TR12.223, October 1983.
rawtitle: The Design of the {REXX} Language
abstract:
One way of classifying computer languages is by two classes: languages needing skilled programmers, and personal languages used by an expanding population of general users. REstructured eXtended eXecutor (REXX) is a flexible personal language designed with particular attention to feedback from its users. It has proved to be effective and easy to use, yet it is sufficiently general and powerful to fulfill the needs of many demanding professional applications. REXX is system and hardware independent, so that it has been possible to integrate it experimentally into several operating systems. Here REXX is used for such purposes as command and macro programming, prototyping, education, and personal programming. This study introduces REXX and describes the basic design principles that were followed in developing it.

keywords:
command program interpreters; computer operating systems; computer programming languages; decimal floating-point arithmetic; language concepts; personal language; REXX language

remark:
REXX supports arbitrary precision arithmetic with up to $ 10^9 $ digits, and an exponent range of $ pm 10^9 $. This capability was added to REXX in 1981.

rawabstract:
One way of classifying computer languages is by two classes: languages needing skilled programmers, and personal languages used by an expanding population of general users. REstructured eXtended eXecutor (REXX) is a flexible personal language designed with particular attention to feedback from its users. It has proved to be effective and easy to use, yet it is sufficiently general and powerful to fulfill the needs of many demanding professional applications. REXX is system and hardware independent, so that it has been possible to integrate it experimentally into several operating systems. Here REXX is used for such purposes as command and macro programming, prototyping, education, and personal programming. This study introduces REXX and describes the basic design principles that were followed in developing it.

entry:
@Article{Cowlishaw:1984:DRL,
  author =       "M. F. Cowlishaw",
  title =        "The Design of the {REXX} Language",
  journal =      j-IBM-SYS-J,
  volume =       "23",
  number =       "4",
  pages =        "326--335",
  year =         "1984",
  CODEN =        "IBMSA7",
  ISSN =         "0018-8670",
  bibdate =      "Wed Jan 08 16:35:07 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "First published as IBM Hursley Technical Report
                 TR12.223, October 1983.",
  abstract =     "One way of classifying computer languages is by two
                 classes: languages needing skilled programmers, and
                 personal languages used by an expanding population of
                 general users. REstructured eXtended eXecutor (REXX) is
                 a flexible personal language designed with particular
                 attention to feedback from its users. It has proved to
                 be effective and easy to use, yet it is sufficiently
                 general and powerful to fulfill the needs of many
                 demanding professional applications. REXX is system and
                 hardware independent, so that it has been possible to
                 integrate it experimentally into several operating
                 systems. Here REXX is used for such purposes as command
                 and macro programming, prototyping, education, and
                 personal programming. This study introduces REXX and
                 describes the basic design principles that were
                 followed in developing it.",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM UK Ltd, Scientific Cent, Winchester, Engl",
  affiliationaddress = "IBM UK Ltd, Scientific Cent, Winchester, Engl",
  classification = "723",
  fjournal =     "IBM Systems Journal",
  journalabr =   "IBM Syst J",
  keywords =     "command program interpreters; computer operating
                 systems; computer programming languages; decimal
                 floating-point arithmetic; language concepts; personal
                 language; REXX language",
  remark =       "REXX supports arbitrary precision arithmetic with up
                 to $ 10^9 $ digits, and an exponent range of $ \pm 10^9
                 $. This capability was added to REXX in 1981.",
}


bibtype: article
filename: fparith.bib
label: Demmel:1984:URN
author: James Demmel
title: Underflow and the reliability of numerical software
journal: j-SIAM-J-SCI-STAT-COMP
volume: 5
number: 4
pages: 887--919
month: dec
monthnumber: 12
year: 1984
CODEN: SIJCD4
ISSN: 0196-5204 OR 01965204
MRclass: 65G05
MRnumber: 85m:65035
MRreviewer: G. Alefeld
bibdate: Tue Apr 29 19:18:28 MDT 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1997.04.29 19:18:28 MDT
fjournal: SIAM Journal on Scientific and Statistical Computing
acknowledgement: ack-nhfb
corpsource: Div. of Computer Science, California University, Berkeley, CA, USA
journalURL: http://epubs.siam.org/loi/sijcd4
treatment: T Theoretical or Mathematical
rawauthor: James Demmel
rawtitle: Underflow and the reliability of numerical software
keywords:
codes; digital arithmetic; eigenvalue calculation; Gaussian elimination; gradual underflow; numerical software; polynomial evaluation; reliability; roundoff; roundoff errors; store zero; uncertainty; underflow mechanisms

entry:
@Article{Demmel:1984:URN,
  author =       "James Demmel",
  title =        "Underflow and the reliability of numerical software",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "5",
  number =       "4",
  pages =        "887--919",
  month =        dec,
  year =         "1984",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "65G05",
  MRnumber =     "85m:65035",
  MRreviewer =   "G. Alefeld",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  classification = "C5230 (Digital arithmetic methods)",
  corpsource =   "Div. of Computer Science, California University,
                 Berkeley, CA, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "codes; digital arithmetic; eigenvalue calculation;
                 Gaussian elimination; gradual underflow; numerical
                 software; polynomial evaluation; reliability; roundoff;
                 roundoff errors; store zero; uncertainty; underflow
                 mechanisms",
  treatment =    "T Theoretical or Mathematical",
}


bibtype: article
filename: fparith.bib
label: Demsky:1984:MMC
author: J. Demsky and M. Schlesinger and R. D. Kent
title: Micro / mini computer program for calculating the square root of rationals at arbitrary precision
journal: j-COMP-PHYS-COMM
volume: 35
number: 1--3
pages: C-877
year: 1984
CODEN: CPHCBZ
DOI: https://doi.org/10.1016/S0010-4655(84)82981-1
ISSN: 0010-4655 (print), 1879-2944 (electronic) OR 00104655 (print), 18792944 (electronic)
ISSNL: 0010-4655 OR 00104655
bibdate: Sat Feb 25 10:56:58 MST 2012
bibtimestamp: 2012.02.25 10:56:58 MST
URL: http://www.sciencedirect.com/science/article/pii/S0010465584829811
fjournal: Computer Physics Communications
acknowledgement: ack-nhfb
journalURL: http://www.sciencedirect.com/science/journal/00104655
rawauthor: J. Demsky and M. Schlesinger and R. D. Kent
bibsource:
https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib; https://www.math.utah.edu/pub/tex/bib/elefunt.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib

rawtitle:
Micro\slash mini computer program for calculating the square root of rationals at arbitrary precision

entry:
@Article{Demsky:1984:MMC,
  author =       "J. Demsky and M. Schlesinger and R. D. Kent",
  title =        "Micro\slash mini computer program for calculating the
                 square root of rationals at arbitrary precision",
  journal =      j-COMP-PHYS-COMM,
  volume =       "35",
  number =       "1--3",
  pages =        "C-877",
  month =        "????",
  year =         "1984",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(84)82981-1",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Sat Feb 25 10:56:58 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465584829811",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}


bibtype: article
filename: fparith.bib
label: Dietrich:1984:FPR
author: D. Dietrich and R. Fischer
journal: j-ELEKTRONIKER
volume: 8
pages: 49--54
year: 1984
CODEN: ELKRBL
ISSN: 0531-9218 OR 05319218
bibdate: Fri Sep 16 16:30:39 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.16 16:30:39 ???
fjournal: Elektroniker (Switzerland)
acknowledgement: ack-nj
rawauthor: D. Dietrich and R. Fischer
title:
Floating-Point-Routinen, entwickelt fur Mikrorechner toenglish Floating-point Routines Developed for Microcomputers endtoenglish 

rawtitle:
{Floating-Point-Routinen, entwickelt f{\"u}r Mikrorechner} \toenglish {Floating-point Routines Developed for Microcomputers} \endtoenglish

entry:
@Article{Dietrich:1984:FPR,
  author =       "D. Dietrich and R. Fischer",
  title =        "{Floating-Point-Routinen, entwickelt f{\"u}r
                 Mikrorechner} \toenglish {Floating-point Routines
                 Developed for Microcomputers} \endtoenglish",
  journal =      j-ELEKTRONIKER,
  volume =       "8",
  pages =        "49--54",
  year =         "1984",
  CODEN =        "ELKRBL",
  ISSN =         "0531-9218",
  bibdate =      "Fri Sep 16 16:30:39 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "Elektroniker (Switzerland)",
}


bibtype: article
filename: fparith.bib
label: Duncan:1984:FSF
author: Ray Duncan and Martin Tracy
title: The FVG Standard Floating-Point Extension
journal: j-DDJ
volume: 9
number: 9
pages: 110--??
month: sep
monthnumber: 9
year: 1984
CODEN: DDJOEB
ISSN: 1044-789X OR 1044789X
bibdate: Mon Sep 2 09:09:39 MDT 1996
bibsource: http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.09.02 09:09:39 MDT
fjournal: Dr. Dobb's Journal of Software Tools
acknowledgement: ack-nhfb
rawauthor: Ray Duncan and Martin Tracy
rawtitle: The {FVG} Standard Floating-Point Extension
entry:
@Article{Duncan:1984:FSF,
  author =       "Ray Duncan and Martin Tracy",
  title =        "The {FVG} Standard Floating-Point Extension",
  journal =      j-DDJ,
  volume =       "9",
  number =       "9",
  pages =        "110--??",
  month =        sep,
  year =         "1984",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
  xxnote =       "??Check author order??",
}


bibtype: article
filename: fparith.bib
label: Dunford:1984:SFPa
author: Christopher J. Dunford
title: Savage floating-point benchmark in 8088 / 8087 assembly language in 16BST
journal: j-DDJ
volume: 9
number: 7
pages: 116--??
month: jul
monthnumber: 7
year: 1984
CODEN: DDJOEB
ISSN: 1044-789X OR 1044789X
bibdate: Mon Sep 2 09:09:39 MDT 1996
bibsource: http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.09.02 09:09:39 MDT
fjournal: Dr. Dobb's Journal of Software Tools
acknowledgement: ack-nhfb
rawauthor: Christopher J. Dunford
rawtitle: {Savage} floating-point benchmark in 8088\slash 8087 assembly language in {16BST}
entry:
@Article{Dunford:1984:SFPa,
  author =       "Christopher J. Dunford",
  title =        "{Savage} floating-point benchmark in 8088\slash 8087
                 assembly language in {16BST}",
  journal =      j-DDJ,
  volume =       "9",
  number =       "7",
  pages =        "116--??",
  month =        jul,
  year =         "1984",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}


bibtype: article
filename: fparith.bib
label: Dunford:1984:SFPb
author: Christopher J. Dunford
title: Savage floating-point benchmark in Modula-2 in 16BST
journal: j-DDJ
volume: 9
number: 8
pages: 106--??
month: aug
monthnumber: 8
year: 1984
CODEN: DDJOEB
ISSN: 1044-789X OR 1044789X
bibdate: Mon Sep 2 09:09:39 MDT 1996
bibsource: http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.09.02 09:09:39 MDT
fjournal: Dr. Dobb's Journal of Software Tools
acknowledgement: ack-nhfb
rawauthor: Christopher J. Dunford
rawtitle: {Savage} floating-point benchmark in {Modula-2} in {16BST}
entry:
@Article{Dunford:1984:SFPb,
  author =       "Christopher J. Dunford",
  title =        "{Savage} floating-point benchmark in {Modula-2} in
                 {16BST}",
  journal =      j-DDJ,
  volume =       "9",
  number =       "8",
  pages =        "106--??",
  month =        aug,
  year =         "1984",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}


bibtype: article
filename: fparith.bib
label: Ercegovac:1984:LAO
author: Milos D. Ercegovac
title: On-line arithmetic: An overview
journal: j-SPIE
volume: 495
pages: 86--93
year: 1984
bibdate: Fri Nov 30 06:32:39 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.30 06:32:39 ???
note: Real Time Signal Processing VII.
acknowledgement: ack-nhfb
rawauthor: Milo{\v{s}} D. Ercegovac
rawnote: Real Time Signal Processing VII.
rawtitle: On-line arithmetic: An overview
entry:
@Article{Ercegovac:1984:LAO,
  author =       "Milo{\v{s}} D. Ercegovac",
  title =        "On-line arithmetic: An overview",
  journal =      j-SPIE,
  volume =       "495",
  pages =        "86--93",
  year =         "1984",
  bibdate =      "Fri Nov 30 06:32:39 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "Real Time Signal Processing VII.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: fparith.bib
label: Ferguson:1984:SFP
author: Kenneth M. Ferguson
title: Savage floating-point benchmark deficiencies of in 16BST
journal: j-DDJ
volume: 9
number: 8
pages: 107--??
month: aug
monthnumber: 8
year: 1984
CODEN: DDJOEB
ISSN: 1044-789X OR 1044789X
bibdate: Mon Sep 2 09:09:39 MDT 1996
bibsource: http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.09.02 09:09:39 MDT
fjournal: Dr. Dobb's Journal of Software Tools
acknowledgement: ack-nhfb
rawauthor: Kenneth M. Ferguson
rawtitle: {Savage} floating-point benchmark deficiencies of in {16BST}
entry:
@Article{Ferguson:1984:SFP,
  author =       "Kenneth M. Ferguson",
  title =        "{Savage} floating-point benchmark deficiencies of in
                 {16BST}",
  journal =      j-DDJ,
  volume =       "9",
  number =       "8",
  pages =        "107--??",
  month =        aug,
  year =         "1984",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}


bibtype: article
filename: fparith.bib
label: Fisher:1984:UAP
author: Gerry Fisher
title: Universal Arithmetic Packages
journal: j-SIGADA-LETTERS
volume: 3
number: 6
pages: 30--47
month: may
monthnumber: 5
year: 1984
CODEN: AALEE5
DOI: https://doi.org/10.1145/998388.998389
ISSN: 1094-3641 (print), 1557-9476 (electronic) OR 10943641 (print), 15579476 (electronic)
ISSNL: 1094-3641 OR 10943641
bibdate: Thu Sep 28 07:33:23 MDT 2000
bibtimestamp: 2000.09.28 07:33:23 MDT
note: See erratum cite Froggatt:2015:EAU.
fjournal: ACM SIGAda Ada Letters
keywords: universal integer, universal real, rational arithmetic
acknowledgement: ack-nhfb
journalURL: http://portal.acm.org/citation.cfm?id=J32
rawauthor: Gerry Fisher
rawnote: See erratum \cite{Froggatt:2015:EAU}.
rawtitle: Universal Arithmetic Packages
bibsource:
ftp://ftp.uu.net/library/bibliography; http://www.adahome.com/Resources/Bibliography/articles.ref; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/sigada.bib

entry:
@Article{Fisher:1984:UAP,
  author =       "Gerry Fisher",
  title =        "Universal Arithmetic Packages",
  journal =      j-SIGADA-LETTERS,
  volume =       "3",
  number =       "6",
  pages =        "30--47",
  month =        may # "\slash " # jun,
  year =         "1984",
  CODEN =        "AALEE5",
  DOI =          "https://doi.org/10.1145/998388.998389",
  ISSN =         "1094-3641 (print), 1557-9476 (electronic)",
  ISSN-L =       "1094-3641",
  bibdate =      "Thu Sep 28 07:33:23 MDT 2000",
  bibsource =    "ftp://ftp.uu.net/library/bibliography;
                 http://www.adahome.com/Resources/Bibliography/articles.ref;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigada.bib",
  note =         "See erratum \cite{Froggatt:2015:EAU}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGAda Ada Letters",
  journal-URL =  "http://portal.acm.org/citation.cfm?id=J32",
  keywords =     "universal integer, universal real, rational
                 arithmetic",
}


bibtype: incollection
filename: fparith.bib
label: Gautschi:1984:QNC
author: Walter Gautschi
title: Questions of numerical condition related to polynomials
crossref: Golub:1984:SNA
volume: 24
pages: 140--177
year: 1984
MRclass: 65F35 (65H05)
MRnumber: 925213
bibdate: Fri Feb 9 15:28:14 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2018.02.09 15:28:14 ???
acknowledgement: ack-nhfb
rawauthor: Walter Gautschi
rawtitle: Questions of numerical condition related to polynomials
entry:
@InCollection{Gautschi:1984:QNC,
  author =       "Walter Gautschi",
  title =        "Questions of numerical condition related to
                 polynomials",
  crossref =     "Golub:1984:SNA",
  volume =       "24",
  pages =        "140--177",
  year =         "1984",
  MRclass =      "65F35 (65H05)",
  MRnumber =     "925213",
  bibdate =      "Fri Feb 9 15:28:14 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
}


bibtype: phdthesis
filename: fparith.bib
label: Gleditsch:1984:FTR
author: Torstein Gleditsch
type: Hovedoppgave i informatikk (cand.scient)
school: Universitetet i Oslo
address: Oslo, Norway
pages: 140--177
year: 1984
bibdate: Thu May 09 08:19:32 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2002.05.09 08:19:32 ???
language: Norwegian
acknowledgement: ack-nhfb
rawauthor: Torstein Gleditsch
title:
Forslag til rask prosessor for flerformat floating-point aritmetikk. (Norwegian) [Proposal for a fast processor for multiformat floating-point arithmetic]

rawtitle:
Forslag til rask prosessor for flerformat floating-point aritmetikk. ({Norwegian}) [{Proposal} for a fast processor for multiformat floating-point arithmetic]

entry:
@PhdThesis{Gleditsch:1984:FTR,
  author =       "Torstein Gleditsch",
  title =        "Forslag til rask prosessor for flerformat
                 floating-point aritmetikk. ({Norwegian}) [{Proposal}
                 for a fast processor for multiformat floating-point
                 arithmetic]",
  type =         "Hovedoppgave i informatikk (cand.scient)",
  school =       "Universitetet i Oslo",
  address =      "Oslo, Norway",
  year =         "1984",
  bibdate =      "Thu May 09 08:19:32 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  language =     "Norwegian",
}


bibtype: article
filename: fparith.bib
label: Goldberg:1984:LVS
author: Morton Goldberg
title: LISP Version of the Savage Floating Point Benchmark in 16BST
journal: j-DDJ
volume: 9
number: 6
pages: 82--??
month: jun
monthnumber: 6
year: 1984
CODEN: DDJOEB
ISSN: 1044-789X OR 1044789X
bibdate: Mon Sep 2 09:09:39 MDT 1996
bibsource: http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.09.02 09:09:39 MDT
fjournal: Dr. Dobb's Journal of Software Tools
acknowledgement: ack-nhfb
rawauthor: Morton Goldberg
rawtitle: {LISP} Version of the {Savage} Floating Point Benchmark in {16BST}
entry:
@Article{Goldberg:1984:LVS,
  author =       "Morton Goldberg",
  title =        "{LISP} Version of the {Savage} Floating Point
                 Benchmark in {16BST}",
  journal =      j-DDJ,
  volume =       "9",
  number =       "6",
  pages =        "82--??",
  month =        jun,
  year =         "1984",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}


bibtype: book
filename: fparith.bib
label: Gregory:1984:MAE
author: Robert Todd Gregory and E. V. Krishnamurthy
title: Methods and Applications of Error-Free Computation
publisher: pub-SV
address: pub-SV:adr
pages: xii + 194
year: 1984
ISBN: 0-387-90967-2 OR 0387909672
ISBN13: 978-0-387-90967-7 OR 9780387909677
LCCN: QA297.5 .G735 1984
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
series: Texts and monographs in computer science
keywords: Approximation theory --- Data processing.; Floating-point arithmetic.
acknowledgement: ack-nhfb
rawauthor: Robert Todd Gregory and E. V. Krishnamurthy
rawtitle: Methods and Applications of Error-Free Computation
TOC:
Glossary of Notation / xi I: Residue or Modular Arithmetic / 1 1. Introduction / 1 2. Single-Modulus Residue Arithmetic / 3 3. Multiple-Modulus Residue Arithmetic / 11 4. Mapping Standard Residue Representations onto Integers / 17 5. Single-Modulus Residue Arithmetic with Rational Numbers / 23 6. The Forward Mapping and the Inverse Mapping / 31 7. Multiple-Modulus Residue Arithmetic with Rational Numbers / 49 II: Finite-Segment p-adic Arithmetic / 63 1. Introduction / 63 2. The Field of p-adic Numbers / 63 3. Arithmetic in QP / 73 4. A Finite-Segment p-adic Number System / 79 5. Arithmetic Operations on Hensel Codes / 90 6. Removing a Leading Zero from a Hensel Code / 99 7. Mapping a Hensel Code onto a Unique Order-N Farey Fraction / 100 III: Exact Computation of Generalized Inverses / 109 1. Introduction / 109 2. Properties of g-inverses / 110 3. Applications of g-inverses / 116 4. Exact Computation of A+ if A Is a Rational Matrix / 118 5. Failures of Residue Arithmetic and Precautionary Measures / 131 IV: Integer Solutions to Linear Equations / 134 1. Introduction / 134 2. Theoretical Background / 135 3. The Matrix Formulation of Chemical Equations / 138 4. Solving the Homogeneous System / 140 5. Solving a Non-Homogeneous System / 148 6. Solving Interval Linear Programming Problems / 150 7. The Solution of Systems of Mixed-Integer Linear Equations / 155 V: Iterative Matrix Inversion and the Iterative Solution of Linear Equations / 162 1. Introduction / 162 2. The Newton--Schultz Method for the Matrix Inverse / 163 3. Iterative Solution of a Linear System / 169 4. Iterative Computation of g-inverses / 174 VI: The Exact Computation of the Characteristic Polynomial of a Matrix / 180 1. Introduction / 180 2. The Algorithm Applied to Lower Hessenberg Matrices / 181 Bibliography / 186 Index / 191

shortTOC:
Glossary of Notation / xi I: Residue or Modular Arithmetic / 1 II: Finite-Segment p-adic Arithmetic / 63 III: Exact Computation of Generalized Inverses / 109 IV: Integer Solutions to Linear Equations / 134 V: Iterative Matrix Inversion and the Iterative Solution of Linear Equations / 162 VI: The Exact Computation of the Characteristic Bibliography / 186 Index / 191

rawshortTOC:
Glossary of Notation / xi \\ I: Residue or Modular Arithmetic / 1 \\ II: Finite-Segment p-adic Arithmetic / 63 \\ III: Exact Computation of Generalized Inverses / 109 IV: Integer Solutions to Linear Equations / 134 \\ V: Iterative Matrix Inversion and the Iterative Solution of Linear Equations / 162 \\ VI: The Exact Computation of the Characteristic Bibliography / 186 \\ Index / 191

rawTOC:
Glossary of Notation / xi \\ I: Residue or Modular Arithmetic / 1 \\ 1. Introduction / 1 \\ 2. Single-Modulus Residue Arithmetic / 3 \\ 3. Multiple-Modulus Residue Arithmetic / 11 \\ 4. Mapping Standard Residue Representations onto Integers / 17 \\ 5. Single-Modulus Residue Arithmetic with Rational Numbers / 23 \\ 6. The Forward Mapping and the Inverse Mapping / 31 \\ 7. Multiple-Modulus Residue Arithmetic with Rational Numbers / 49 \\ II: Finite-Segment p-adic Arithmetic / 63 \\ 1. Introduction / 63 \\ 2. The Field of p-adic Numbers / 63 \\ 3. Arithmetic in QP / 73 \\ 4. A Finite-Segment p-adic Number System / 79 \\ 5. Arithmetic Operations on Hensel Codes / 90 \\ 6. Removing a Leading Zero from a Hensel Code / 99 \\ 7. Mapping a Hensel Code onto a Unique Order-N Farey Fraction / 100 \\ III: Exact Computation of Generalized Inverses / 109 \\ 1. Introduction / 109 \\ 2. Properties of g-inverses / 110 \\ 3. Applications of g-inverses / 116 \\ 4. Exact Computation of A+ if A Is a Rational Matrix / 118 \\ 5. Failures of Residue Arithmetic and Precautionary Measures / 131 \\ IV: Integer Solutions to Linear Equations / 134 \\ 1. Introduction / 134 \\ 2. Theoretical Background / 135 \\ 3. The Matrix Formulation of Chemical Equations / 138 \\ 4. Solving the Homogeneous System / 140 \\ 5. Solving a Non-Homogeneous System / 148 \\ 6. Solving Interval Linear Programming Problems / 150 \\ 7. The Solution of Systems of Mixed-Integer Linear Equations / 155 \\ V: Iterative Matrix Inversion and the Iterative Solution of Linear Equations / 162 \\ 1. Introduction / 162 \\ 2. The Newton--Schultz Method for the Matrix Inverse / 163 \\ 3. Iterative Solution of a Linear System / 169 \\ 4. Iterative Computation of g-inverses / 174 \\ VI: The Exact Computation of the Characteristic Polynomial of a Matrix / 180 \\ 1. Introduction / 180 \\ 2. The Algorithm Applied to Lower Hessenberg Matrices / 181 \\ Bibliography / 186 \\ Index / 191

entry:
@Book{Gregory:1984:MAE,
  author =       "Robert Todd Gregory and E. V. Krishnamurthy",
  title =        "Methods and Applications of Error-Free Computation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 194",
  year =         "1984",
  ISBN =         "0-387-90967-2",
  ISBN-13 =      "978-0-387-90967-7",
  LCCN =         "QA297.5 .G735 1984",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  series =       "Texts and monographs in computer science",
  acknowledgement = ack-nhfb,
  keywords =     "Approximation theory --- Data processing.;
                 Floating-point arithmetic.",
  shorttableofcontents = "Glossary of Notation / xi \\
                 I: Residue or Modular Arithmetic / 1 \\
                 II: Finite-Segment p-adic Arithmetic / 63 \\
                 III: Exact Computation of Generalized Inverses / 109
                 IV: Integer Solutions to Linear Equations / 134 \\
                 V: Iterative Matrix Inversion and the Iterative
                 Solution of Linear Equations / 162 \\
                 VI: The Exact Computation of the Characteristic
                 Bibliography / 186 \\
                 Index / 191",
  tableofcontents = "Glossary of Notation / xi \\
                 I: Residue or Modular Arithmetic / 1 \\
                 1. Introduction / 1 \\
                 2. Single-Modulus Residue Arithmetic / 3 \\
                 3. Multiple-Modulus Residue Arithmetic / 11 \\
                 4. Mapping Standard Residue Representations onto
                 Integers / 17 \\
                 5. Single-Modulus Residue Arithmetic with Rational
                 Numbers / 23 \\
                 6. The Forward Mapping and the Inverse Mapping / 31 \\
                 7. Multiple-Modulus Residue Arithmetic with Rational
                 Numbers / 49 \\
                 II: Finite-Segment p-adic Arithmetic / 63 \\
                 1. Introduction / 63 \\
                 2. The Field of p-adic Numbers / 63 \\
                 3. Arithmetic in QP / 73 \\
                 4. A Finite-Segment p-adic Number System / 79 \\
                 5. Arithmetic Operations on Hensel Codes / 90 \\
                 6. Removing a Leading Zero from a Hensel Code / 99 \\
                 7. Mapping a Hensel Code onto a Unique Order-N Farey
                 Fraction / 100 \\
                 III: Exact Computation of Generalized Inverses / 109
                 \\
                 1. Introduction / 109 \\
                 2. Properties of g-inverses / 110 \\
                 3. Applications of g-inverses / 116 \\
                 4. Exact Computation of A+ if A Is a Rational Matrix /
                 118 \\
                 5. Failures of Residue Arithmetic and Precautionary
                 Measures / 131 \\
                 IV: Integer Solutions to Linear Equations / 134 \\
                 1. Introduction / 134 \\
                 2. Theoretical Background / 135 \\
                 3. The Matrix Formulation of Chemical Equations / 138
                 \\
                 4. Solving the Homogeneous System / 140 \\
                 5. Solving a Non-Homogeneous System / 148 \\
                 6. Solving Interval Linear Programming Problems / 150
                 \\
                 7. The Solution of Systems of Mixed-Integer Linear
                 Equations / 155 \\
                 V: Iterative Matrix Inversion and the Iterative
                 Solution of Linear Equations / 162 \\
                 1. Introduction / 162 \\
                 2. The Newton--Schultz Method for the Matrix Inverse /
                 163 \\
                 3. Iterative Solution of a Linear System / 169 \\
                 4. Iterative Computation of g-inverses / 174 \\
                 VI: The Exact Computation of the Characteristic
                 Polynomial of a Matrix / 180 \\
                 1. Introduction / 180 \\
                 2. The Algorithm Applied to Lower Hessenberg Matrices /
                 181 \\
                 Bibliography / 186 \\
                 Index / 191",
}


bibtype: article
filename: fparith.bib
label: Guest:1984:RNS
author: C. C. Guest and M. M. Mirsalehi and T. K. Gaylord
title: Residue Number System Truth-Table Look-Up Processing --- Moduli Selection and Logical Minimization
journal: j-IEEE-TRANS-COMPUT
volume: C-33
number: 10
pages: 927--931
month: oct
monthnumber: 10
year: 1984
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1984.1676355
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 09:22:55 MDT 2011
bibtimestamp: 2011.07.10 09:22:55 MDT
fjournal: IEEE Transactions on Computers
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: C. C. Guest and M. M. Mirsalehi and T. K. Gaylord
rawtitle: Residue Number System Truth-Table Look-Up Processing --- Moduli Selection and Logical Minimization
URL:
http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12; http://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=35232; https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676355

entry:
@Article{Guest:1984:RNS,
  author =       "C. C. Guest and M. M. Mirsalehi and T. K. Gaylord",
  title =        "Residue Number System Truth-Table Look-Up Processing
                 --- Moduli Selection and Logical Minimization",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-33",
  number =       "10",
  pages =        "927--931",
  month =        oct,
  year =         "1984",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1984.1676355",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 09:22:55 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  URL =          "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12;
                 http://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=35232;
                 https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676355",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "residue arithmetic; residue number system",
  summary =      "Truth table look-up processing using binary coded
                 residue numbers is investigated for full-precision
                 addition and multiplication for implementations using
                 either electronic or optical technologies. The
                 logically minimized numbers of input \ldots{}",
}


bibtype: book
filename: fparith.bib
label: Hamacher:1984:CO
author: V. Carl Hamacher and Zvonko G. Vranesic and Safwat G. Zaky
title: Computer organization
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
edition: Second
pages: xvi + 590
year: 1984
ISBN: 0-07-025683-7 OR 0070256837
ISBN13: 978-0-07-025683-5 OR 9780070256835
LCCN: QA76.9.A73 H351 1984
bibdate: Sat Nov 9 08:26:18 MST 2002
bibsource: ACM Computing Archive CD-ROM database (1991); https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2002.11.09 08:26:18 MST
series: McGraw-Hill series in computer organization and architecture
subject: C. Computer Systems Organization; C.0 GENERAL; B. Hardware; B.0 GENERAL
acknowledgement: ack-nhfb
reviewer: A. Deb
rawauthor: V. Carl Hamacher and Zvonko G. Vranesic and Safwat G. Zaky
rawtitle: Computer organization
TOC:
Basic structure of computers Addressing methods and machine program sequencing Instruction sets The processing Unit Microprogrammed control Input--output organization- Arithmetic The main memory Computer peripherals and work stations Software Microprocessors Computer communications

rawTOC:
Basic structure of computers \\ Addressing methods and machine program sequencing \\ Instruction sets \\ The processing Unit \\ Microprogrammed control \\ Input--output organization- \\ Arithmetic \\ The main memory \\ Computer peripherals and work stations \\ Software \\ Microprocessors \\ Computer communications

entry:
@Book{Hamacher:1984:CO,
  author =       "V. Carl Hamacher and Zvonko G. Vranesic and Safwat G.
                 Zaky",
  title =        "Computer organization",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "xvi + 590",
  year =         "1984",
  ISBN =         "0-07-025683-7",
  ISBN-13 =      "978-0-07-025683-5",
  LCCN =         "QA76.9.A73 H351 1984",
  bibdate =      "Sat Nov 9 08:26:18 MST 2002",
  bibsource =    "ACM Computing Archive CD-ROM database (1991);
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  price =        "US\$34.95",
  series =       "McGraw-Hill series in computer organization and
                 architecture",
  acknowledgement = ack-nhfb,
  catcode =      "C; B",
  content =      "The reviewer recommends this book to those who are
                 interested in learning the basics of computer
                 organization, particularly at the hardware and device
                 level. This book does not deal with the concepts
                 related to computer organization from an abstract,
                 mathematical level. It also does not attempt to
                 describe the computer organization using a high-level
                 language. Instead, the authors concentrate on
                 uniprocessing systems, with a large number of examples
                 drawn from VAX-11, IBM 370, and HP 3000. The book does
                 not cover multiprocessors.\par

                 The organization of the book is summarized here.
                 Chapter 1 introduces a number of terms. Chapters 2 and
                 3 concentrate in detail (a total of 101 pages) on the
                 addressing methods and instruction sets, with examples
                 taken primarily from the above mentioned machines.
                 Chapters 4 and 5 (a total of 50 pages) deal with the
                 control unit for the instruction fetch and execute,
                 with Chapter 5 being devoted to microprogrammed control
                 and bit slice designs. In Chapter 6 (a total of 64
                 pages) the authors cover Input/Output organization,
                 which includes a good deal about the
                 synchronous/asynchronous I/O operations, I/O
                 interfaces, etc. Chapter 7 presents the usual material
                 on the fixed- and floating-point arithmetic. \ldots{}",
  CRnumber =     "8509-0786",
  descriptor =   "Computer Systems Organization, GENERAL; Hardware,
                 GENERAL",
  genterm =      "DESIGN",
  reviewer =     "A. Deb",
  subject =      "C. Computer Systems Organization; C.0 GENERAL; B.
                 Hardware; B.0 GENERAL",
  tableofcontents = "Basic structure of computers \\
                 Addressing methods and machine program sequencing \\
                 Instruction sets \\
                 The processing Unit \\
                 Microprogrammed control \\
                 Input--output organization- \\
                 Arithmetic \\
                 The main memory \\
                 Computer peripherals and work stations \\
                 Software \\
                 Microprocessors \\
                 Computer communications",
}


bibtype: article
filename: fparith.bib
label: Honma:1984:IAE
author: Hitoshi Honma and Masahiko Sagawa
title: Improving the accuracy and error analysis in floating-point FFT computation
journal: j-ELECTRON-COMMUN-JPN
volume: 67
number: 11
pages: 9--18
year: 1984
CODEN: ECOJAL
ISSN: 0424-8368 OR 04248368
MRclass: 65T05 (65G05 94A11)
MRnumber: 86g:65238
bibdate: Fri Dec 8 08:24:13 1995
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1995.12.08 08:24:13 ???
fjournal: Electronics and communications in Japan
acknowledgement: ack-nhfb
rawauthor: Hitoshi Honma and Masahiko Sagawa
rawtitle: Improving the accuracy and error analysis in floating-point {FFT} computation
entry:
@Article{Honma:1984:IAE,
  author =       "Hitoshi Honma and Masahiko Sagawa",
  title =        "Improving the accuracy and error analysis in
                 floating-point {FFT} computation",
  journal =      j-ELECTRON-COMMUN-JPN,
  volume =       "67",
  number =       "11",
  pages =        "9--18",
  year =         "1984",
  CODEN =        "ECOJAL",
  ISSN =         "0424-8368",
  MRclass =      "65T05 (65G05 94A11)",
  MRnumber =     "86g:65238",
  bibdate =      "Fri Dec 8 08:24:13 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronics and communications in Japan",
}


bibtype: techreport
filename: fparith.bib
label: IBM:1984:ISR
author: IBM Corporation
title: IBM System / 370 RPQ. High Accuracy Arithmetic
type: Technical report
number: SA22-7093-0
institution: pub-IBM
address: pub-IBM:adr
pages: 9--18
month: jan
monthnumber: 1
year: 1984
bibdate: Wed Oct 04 09:39:49 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2006.10.04 09:39:49 ???
keywords: accurate floating-point dot product; accurate floating-point summation; ACRITH
acknowledgement: ack-nhfb
rawauthor: {IBM Corporation}
rawtitle: {IBM System\slash 370 RPQ}. High Accuracy Arithmetic
URL:
http://bitsavers.trailing-edge.com/pdf/ibm/370/princOps/SA22-7093-0_High_Accuracy_Arithmetic_Jan84.pdf

remark:
According to IBM Web pages, ACRITH was withdrawn in 1991, and replaced by ACRITH XSC; however, I have yet to be able to find online documentation for that system.

TOC:
HIGH-ACCURACY-ARITHMETIC FACILITY / 1 Floating-Point Instructions With Rounding Options / 1 Normalization / 2 Rounding / 2 Rounding Modes / 2 Guard Digit, Rounding Digit, and Sticky Bit / 3 Arithmetic Exceptions / 4 Default Result for Exponent Underflow / 5 Floating-Point Accumulator / 5 Vectors / 5 Accumulator Layout / 6 Accumulator Status Area / 8 Accumulator Overflow / 9 Storage-Operand Consistency / 9 Instructions / 10 ADD ACCUMULATOR TO ACCUMULATOR / 11 ADD TO ACCUMULATOR / 12 ADD WITH ROUNDING / 12 CLEAR ACCUMULATOR / 13 DIVIDE WITH ROUNDING / 13 LOAD WITH ROUNDING / 14 MULTIPLY AND ACCUMULATE / 15 MULTIPLY WITH ROUNDING / 17 ROUND FROM ACCUMULATOR / 17 SUBTRACT ACCUMULATOR FROM ACCUMULATOR / 18 SUBTRACT FROM ACCUMULATOR / 18 SUBTRACT WITH ROUNDING / 19 INDEX / 21

rawTOC:
HIGH-ACCURACY-ARITHMETIC FACILITY / 1 \\ Floating-Point Instructions With Rounding Options / 1 \\ Normalization / 2 \\ Rounding / 2 \\ Rounding Modes / 2 \\ Guard Digit, Rounding Digit, and Sticky Bit / 3 \\ Arithmetic Exceptions / 4 \\ Default Result for Exponent Underflow / 5 \\ Floating-Point Accumulator / 5 \\ Vectors / 5 \\ Accumulator Layout / 6 \\ Accumulator Status Area / 8 \\ Accumulator Overflow / 9 \\ Storage-Operand Consistency / 9 \\ Instructions / 10 \\ ADD ACCUMULATOR TO ACCUMULATOR / 11 \\ ADD TO ACCUMULATOR / 12 \\ ADD WITH ROUNDING / 12 \\ CLEAR ACCUMULATOR / 13 \\ DIVIDE WITH ROUNDING / 13 \\ LOAD WITH ROUNDING / 14 \\ MULTIPLY AND ACCUMULATE / 15 \\ MULTIPLY WITH ROUNDING / 17 \\ ROUND FROM ACCUMULATOR / 17 \\ SUBTRACT ACCUMULATOR FROM ACCUMULATOR / 18 \\ SUBTRACT FROM ACCUMULATOR / 18 \\ SUBTRACT WITH ROUNDING / 19 \\ INDEX / 21

entry:
@TechReport{IBM:1984:ISR,
  author =       "{IBM Corporation}",
  title =        "{IBM System\slash 370 RPQ}. High Accuracy Arithmetic",
  type =         "Technical report",
  number =       "SA22-7093-0",
  institution =  pub-IBM,
  address =      pub-IBM:adr,
  month =        jan,
  year =         "1984",
  bibdate =      "Wed Oct 04 09:39:49 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://bitsavers.trailing-edge.com/pdf/ibm/370/princOps/SA22-7093-0_High_Accuracy_Arithmetic_Jan84.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "accurate floating-point dot product; accurate
                 floating-point summation; ACRITH",
  remark =       "According to IBM Web pages, ACRITH was withdrawn in
                 1991, and replaced by ACRITH XSC; however, I have yet
                 to be able to find online documentation for that
                 system.",
  tableofcontents = "HIGH-ACCURACY-ARITHMETIC FACILITY / 1 \\
                 Floating-Point Instructions With Rounding Options / 1
                 \\
                 Normalization / 2 \\
                 Rounding / 2 \\
                 Rounding Modes / 2 \\
                 Guard Digit, Rounding Digit, and Sticky Bit / 3 \\
                 Arithmetic Exceptions / 4 \\
                 Default Result for Exponent Underflow / 5 \\
                 Floating-Point Accumulator / 5 \\
                 Vectors / 5 \\
                 Accumulator Layout / 6 \\
                 Accumulator Status Area / 8 \\
                 Accumulator Overflow / 9 \\
                 Storage-Operand Consistency / 9 \\
                 Instructions / 10 \\
                 ADD ACCUMULATOR TO ACCUMULATOR / 11 \\
                 ADD TO ACCUMULATOR / 12 \\
                 ADD WITH ROUNDING / 12 \\
                 CLEAR ACCUMULATOR / 13 \\
                 DIVIDE WITH ROUNDING / 13 \\
                 LOAD WITH ROUNDING / 14 \\
                 MULTIPLY AND ACCUMULATE / 15 \\
                 MULTIPLY WITH ROUNDING / 17 \\
                 ROUND FROM ACCUMULATOR / 17 \\
                 SUBTRACT ACCUMULATOR FROM ACCUMULATOR / 18 \\
                 SUBTRACT FROM ACCUMULATOR / 18 \\
                 SUBTRACT WITH ROUNDING / 19 \\
                 INDEX / 21",
}


bibtype: book
filename: fparith.bib
label: ISO:1984:IID
author: International Organization for Standardization
title: ISO / IEC DIS 10858: Information technology --- Radix-independent floating-point arithmetic
publisher: pub-ISO
address: pub-ISO:adr
year: 1984
bibdate: Fri May 28 21:52:25 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1999.05.28 21:52:25 ???
URL: http://www.iso.ch/cate/d18890.html
acknowledgement: ack-nhfb
key: ISO
rawauthor: {International Organization for Standardization}
rawtitle:
{ISO\slash IEC DIS 10858}: {Information} technology --- {Radix-independent} floating-point arithmetic

entry:
@Book{ISO:1984:IID,
  author =       "{International Organization for Standardization}",
  key =          "ISO",
  title =        "{ISO\slash IEC DIS 10858}: {Information} technology
                 --- {Radix-independent} floating-point arithmetic",
  publisher =    pub-ISO,
  address =      pub-ISO:adr,
  pages =        "????",
  year =         "1984",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Fri May 28 21:52:25 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.iso.ch/cate/d18890.html",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: fparith.bib
label: Jones:1984:SRM
author: Christopher B. Jones
title: A Significance Rule for Multiple-Precision Arithmetic
journal: j-TOMS
volume: 10
number: 1
pages: 97--107
month: mar
monthnumber: 3
year: 1984
CODEN: ACMSCU
DOI: https://doi.org/10.1145/356068.356076
ISSN: 0098-3500 (print), 1557-7295 (electronic) OR 00983500 (print), 15577295 (electronic)
ISSNL: 0098-3500 OR 00983500
MRclass: 65G05 (65G10)
MRnumber: 86e:65063
bibdate: Sun Sep 04 20:02:26 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.04 20:02:26 ???
fjournal: ACM Transactions on Mathematical Software (TOMS)
acknowledgement: ack-nhfb
journalURL: https://dl.acm.org/loi/toms
rawauthor: Christopher B. Jones
rawtitle: A Significance Rule for Multiple-Precision Arithmetic
abstract:
Multiple-precision arithmetic overcomes the round-off error incurred in conventional floating-point arithmetic, at the cost of increased processing overhead. Significance arithmetic takes into account the inexactness of the operands of a calculation, but can lead to loss of significant digits after a long series of operations. A new technique is described which alleviates the overhead of multiple-precision arithmetic by allowing nonsignificant digits to be discarded, while limiting the significance loss per operation to a controllable and acceptable rate. The technique is based on storing an inexact number interval, using a criterion of significance to determine the precision with which the limits of interval should be stored. A procedure referred to as a significance rule uses this criterion to remove some of the nonsignificant digits from the limits of an interval prior to storage. A certain number of nonsignificant digits are retained as guard digits. Calculations are performed using exact interval arithmetic and the significance-rule procedure is invoked after each operation to remove superfluous digits. Round-off in the procedure causes a slight increase in the interval width on each operation. This results in a cumulative loss of significance at a rate related to the number of guard digits.

rawabstract:
Multiple-precision arithmetic overcomes the round-off error incurred in conventional floating-point arithmetic, at the cost of increased processing overhead. Significance arithmetic takes into account the inexactness of the operands of a calculation, but can lead to loss of significant digits after a long series of operations. A new technique is described which alleviates the overhead of multiple-precision arithmetic by allowing nonsignificant digits to be discarded, while limiting the significance loss per operation to a controllable and acceptable rate. The technique is based on storing an inexact number interval, using a criterion of significance to determine the precision with which the limits of interval should be stored. A procedure referred to as a significance rule uses this criterion to remove some of the nonsignificant digits from the limits of an interval prior to storage. A certain number of nonsignificant digits are retained as guard digits. Calculations are performed using exact interval arithmetic and the significance-rule procedure is invoked after each operation to remove superfluous digits. Round-off in the procedure causes a slight increase in the interval width on each operation. This results in a cumulative loss of significance at a rate related to the number of guard digits.

entry:
@Article{Jones:1984:SRM,
  author =       "Christopher B. Jones",
  title =        "A Significance Rule for Multiple-Precision
                 Arithmetic",
  journal =      j-TOMS,
  volume =       "10",
  number =       "1",
  pages =        "97--107",
  month =        mar,
  year =         "1984",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/356068.356076",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65G05 (65G10)",
  MRnumber =     "86e:65063",
  bibdate =      "Sun Sep 04 20:02:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  abstract =     "Multiple-precision arithmetic overcomes the round-off
                 error incurred in conventional floating-point
                 arithmetic, at the cost of increased processing
                 overhead. Significance arithmetic takes into account
                 the inexactness of the operands of a calculation, but
                 can lead to loss of significant digits after a long
                 series of operations. A new technique is described
                 which alleviates the overhead of multiple-precision
                 arithmetic by allowing nonsignificant digits to be
                 discarded, while limiting the significance loss per
                 operation to a controllable and acceptable rate. The
                 technique is based on storing an inexact number
                 interval, using a criterion of significance to
                 determine the precision with which the limits of
                 interval should be stored. A procedure referred to as a
                 significance rule uses this criterion to remove some of
                 the nonsignificant digits from the limits of an
                 interval prior to storage. A certain number of
                 nonsignificant digits are retained as guard digits.
                 Calculations are performed using exact interval
                 arithmetic and the significance-rule procedure is
                 invoked after each operation to remove superfluous
                 digits. Round-off in the procedure causes a slight
                 increase in the interval width on each operation. This
                 results in a cumulative loss of significance at a rate
                 related to the number of guard digits.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "https://dl.acm.org/loi/toms",
}


bibtype: article
filename: fparith.bib
label: Karp:1984:ELS
author: A. H. Karp
title: Exponential and Logarithm by Sequential Squaring
journal: j-IEEE-TRANS-COMPUT
volume: C-33
number: 5
pages: 462--464
month: may
monthnumber: 5
year: 1984
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1984.1676464
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Thu Sep 1 10:16:09 1994
bibtimestamp: 1994.09.01 10:16:09 ???
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nj
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: A. H. Karp
rawtitle: Exponential and Logarithm by Sequential Squaring
bibsource:
ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib

entry:
@Article{Karp:1984:ELS,
  author =       "A. H. Karp",
  title =        "Exponential and Logarithm by Sequential Squaring",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-33",
  number =       "5",
  pages =        "462--464",
  month =        may,
  year =         "1984",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1984.1676464",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Sep 1 10:16:09 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  acknowledgement = ack-nj,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: book
filename: fparith.bib
label: Katzan:1984:IA
author: Harry Katzan
title: Invitation to Ada
publisher: PBI
address: New York, NY, USA
pages: x + 173
year: 1984
ISBN: 0-89433-239-2 (paperback) OR 0894332392 (paperback)
ISBN13: 978-0-89433-239-5 (paperback) OR 9780894332395 (paperback)
LCCN: QA76.73.A35 K36 1984
bibdate: Wed Oct 13 06:37:40 MDT 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2010.10.13 06:37:40 MDT
series: Petrocelli invitation to series
subject: Ada (Computer program language)
acknowledgement: ack-nhfb
rawauthor: Harry Katzan
rawtitle: Invitation to {Ada}
remark:
See cite [p. 1.10]Coonen:1984:CPS for negative comments about the floating-point model for Ada in the predecessor of this book cite Katzan:1982:IAA.

entry:
@Book{Katzan:1984:IA,
  author =       "Harry Katzan",
  title =        "Invitation to {Ada}",
  publisher =    "PBI",
  address =      "New York, NY, USA",
  pages =        "x + 173",
  year =         "1984",
  ISBN =         "0-89433-239-2 (paperback)",
  ISBN-13 =      "978-0-89433-239-5 (paperback)",
  LCCN =         "QA76.73.A35 K36 1984",
  bibdate =      "Wed Oct 13 06:37:40 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$14.95",
  series =       "Petrocelli invitation to series",
  acknowledgement = ack-nhfb,
  remark =       "See \cite[p. 1.10]{Coonen:1984:CPS} for negative
                 comments about the floating-point model for Ada in the
                 predecessor of this book \cite{Katzan:1982:IAA}.",
  subject =      "Ada (Computer program language)",
}


bibtype: article
filename: fparith.bib
label: Kawabata:1984:SFP
author: Hugh M. Kawabata
title: Savage Floating Point Benchmark in Fortran in 16BST
journal: j-DDJ
volume: 9
number: 1
pages: 83--??
month: jan
monthnumber: 1
year: 1984
CODEN: DDJOEB
ISSN: 1044-789X OR 1044789X
bibdate: Mon Sep 2 09:09:39 MDT 1996
bibsource: http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.09.02 09:09:39 MDT
fjournal: Dr. Dobb's Journal of Software Tools
acknowledgement: ack-nhfb
rawauthor: Hugh M. Kawabata
rawtitle: {Savage} Floating Point Benchmark in {Fortran} in {16BST}
entry:
@Article{Kawabata:1984:SFP,
  author =       "Hugh M. Kawabata",
  title =        "{Savage} Floating Point Benchmark in {Fortran} in
                 {16BST}",
  journal =      j-DDJ,
  volume =       "9",
  number =       "1",
  pages =        "83--??",
  month =        jan,
  year =         "1984",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}


bibtype: book
filename: fparith.bib
label: Koopman:1984:FFP
author: Philip J. Koopman
title: FORTH floating point
publisher: Mountain View Pr.
address: Mountain View, CA, USA
edition: Second
pages: 346
year: 1984
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
series: MVP-FORTH series; v. 3
acknowledgement: ack-nhfb
rawauthor: Philip J. Koopman
rawtitle: {FORTH} floating point
keywords:
Electronic digital computers --- Programming.; Floating-point arithmetic.; FORTH (Computer program language)

entry:
@Book{Koopman:1984:FFP,
  author =       "Philip J. Koopman",
  title =        "{FORTH} floating point",
  publisher =    "Mountain View Pr.",
  address =      "Mountain View, CA, USA",
  edition =      "Second",
  pages =        "346",
  year =         "1984",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  series =       "MVP-FORTH series; v. 3",
  acknowledgement = ack-nhfb,
  keywords =     "Electronic digital computers --- Programming.;
                 Floating-point arithmetic.; FORTH (Computer program
                 language)",
}


bibtype: article
filename: fparith.bib
label: Korn:1984:ISD
author: G. A. Korn
title: Interactive simulation with a direct-executing, floating-point equation language
journal: j-SYS-ANA-MODEL-SIM
volume: 1
number: 1
pages: 45--54
year: 1984
CODEN: SAMSEC
ISSN: 0232-9298 OR 02329298
ISSNL: 0232-9298 OR 02329298
bibdate: Sat Nov 9 08:26:18 MST 2002
bibsource: ACM Computing Archive CD-ROM database (1991); https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2002.11.09 08:26:18 MST
fjournal: Systems analysis, modelling, simulation
acknowledgement: ack-nhfb
affiliation: The University of Arizona, Tucson
rawauthor: G. A. Korn
rawtitle: Interactive simulation with a direct-executing, floating-point equation language
subject:
I. Computing Methodologies; I.6 SIMULATION AND MODELING; I. Computing Methodologies; I.6 SIMULATION AND MODELING

entry:
@Article{Korn:1984:ISD,
  author =       "G. A. Korn",
  title =        "Interactive simulation with a direct-executing,
                 floating-point equation language",
  journal =      j-SYS-ANA-MODEL-SIM,
  volume =       "1",
  number =       "1",
  pages =        "45--54",
  year =         "1984",
  CODEN =        "SAMSEC",
  ISSN =         "0232-9298",
  ISSN-L =       "0232-9298",
  bibdate =      "Sat Nov 9 08:26:18 MST 2002",
  bibsource =    "ACM Computing Archive CD-ROM database (1991);
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "The University of Arizona, Tucson",
  bibno =        "43792",
  catcode =      "I.6.2; I.6.3",
  CRclass =      "I.6.2 Simulation Languages; I.6.3 Applications",
  descriptor =   "Computing Methodologies, SIMULATION AND MODELING,
                 Simulation Languages; Computing Methodologies,
                 SIMULATION AND MODELING, Applications",
  fjournal =     "Systems analysis, modelling, simulation",
  genterm =      "THEORY; DESIGN; LANGUAGES",
  guideno =      "1988-14427",
  journalabbrev = "Syst. Anal. Model. Simul.",
  subject =      "I. Computing Methodologies; I.6 SIMULATION AND
                 MODELING; I. Computing Methodologies; I.6 SIMULATION
                 AND MODELING",
}


bibtype: article
filename: fparith.bib
label: Kornerup:1984:CFP
author: Peter Kornerup and David W. Matula
title: Correction to ``Finite Precision Rational Arithmetic: An Arithmetic Unit''
journal: j-IEEE-TRANS-COMPUT
volume: C-33
number: 7
pages: 682--682
month: jul
monthnumber: 7
year: 1984
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1984.5009346
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 09:22:53 MDT 2011
bibtimestamp: 2011.07.10 09:22:53 MDT
URL: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5009346
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: Peter Kornerup and David W. Matula
rawtitle: Correction to `{`Finite Precision Rational Arithmetic: An Arithmetic Unit''}
entry:
@Article{Kornerup:1984:CFP,
  author =       "Peter Kornerup and David W. Matula",
  title =        "Correction to `{`Finite Precision Rational Arithmetic:
                 An Arithmetic Unit''}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-33",
  number =       "7",
  pages =        "682--682",
  month =        jul,
  year =         "1984",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1984.5009346",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 09:22:53 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  URL =          "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5009346",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: article
filename: fparith.bib
label: Lin:1984:DSD
author: Ming-Liang Lin and Ernst Leiss and Bayliss McInnis
title: Division and sign detection algorithms for residue number systems
journal: j-COMPUT-MATH-APPL
volume: 10
number: 4--5
pages: 331--342
year: 1984
CODEN: CMAPDK
ISSN: 0898-1221 (print), 1873-7668 (electronic) OR 08981221 (print), 18737668 (electronic)
ISSNL: 0898-1221 OR 08981221
bibdate: Wed Mar 1 19:00:50 MST 2017
bibtimestamp: 2017.03.01 19:00:50 MST
URL: http://www.sciencedirect.com/science/article/pii/0898122184900610
fjournal: Computers and Mathematics with Applications
acknowledgement: ack-nhfb
journalURL: http://www.sciencedirect.com/science/journal/08981221
rawauthor: Ming-Liang Lin and Ernst Leiss and Bayliss McInnis
rawtitle: Division and sign detection algorithms for residue number systems
bibsource:
https://www.math.utah.edu/pub/tex/bib/computmathappl1980.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib

entry:
@Article{Lin:1984:DSD,
  author =       "Ming-Liang Lin and Ernst Leiss and Bayliss McInnis",
  title =        "Division and sign detection algorithms for residue
                 number systems",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "10",
  number =       "4--5",
  pages =        "331--342",
  month =        "????",
  year =         "1984",
  CODEN =        "CMAPDK",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 19:00:50 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0898122184900610",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}


bibtype: inproceedings
filename: fparith.bib
label: Ling:1984:NAS
author: Fuyun Ling and J. Proakis
booktitle: IEEE International Conference on Acoustics, Speech, and Signal Processing: ICASSP '84
publisher: pub-IEEE
address: pub-IEEE:adr
pages: 571--574
year: 1984
bibdate: Sat Jul 16 11:25:04 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2005.07.16 11:25:04 MDT
acknowledgement: ack-nhfb
rawauthor: Fuyun Ling and J. Proakis
rawbooktitle: {IEEE} International Conference on Acoustics, Speech, and Signal Processing: {ICASSP '84}
title:
Numerical accuracy and stability: Two problems of adaptive estimation algorithms caused by round-off error

rawtitle:
Numerical accuracy and stability: Two problems of adaptive estimation algorithms caused by round-off error

entry:
@InProceedings{Ling:1984:NAS,
  author =       "Fuyun Ling and J. Proakis",
  booktitle =    "{IEEE} International Conference on Acoustics, Speech,
                 and Signal Processing: {ICASSP '84}",
  title =        "Numerical accuracy and stability: Two problems of
                 adaptive estimation algorithms caused by round-off
                 error",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "571--574",
  year =         "1984",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Sat Jul 16 11:25:04 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  summary =      "This paper investigates the numerical accuracy and the
                 numerical stability of adaptive estimation algorithms.
                 A feedback system model is provided to investigate the
                 numerical stability of the algorithms. Simulation
                 results on the comparison of \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Longo:1984:CFU
author: S. A. Longo
title: Calculating Functions using Ada
journal: j-J-PAS-ADA
volume: 3
number: 4
pages: 34--36
month: jul
monthnumber: 7
year: 1984
ISSN: 0735-1232 OR 07351232
bibdate: Fri Dec 08 13:05:34 1995
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1995.12.08 13:05:34 ???
fjournal: Journal of Pascal and Ada
acknowledgement: ack-nj
rawauthor: S. A. Longo
rawtitle: Calculating Functions using {Ada}
entry:
@Article{Longo:1984:CFU,
  author =       "S. A. Longo",
  title =        "Calculating Functions using {Ada}",
  journal =      j-J-PAS-ADA,
  volume =       "3",
  number =       "4",
  pages =        "34--36",
  month =        jul # "--" # aug,
  year =         "1984",
  ISSN =         "0735-1232",
  bibdate =      "Fri Dec 08 13:05:34 1995",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "Journal of Pascal and Ada",
}


bibtype: inproceedings
filename: fparith.bib
label: Look:1984:CSH
author: H. W. Look
crossref: NCC:1984:ACP
pages: 101--105
year: 1984
bibdate: Wed Sep 7 22:31:45 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.07 22:31:45 ???
acknowledgement: ack-nj
rawauthor: H. W. Look
title:
Compatible software and hardware implementations permitted by IEEE standards for binary floating-point arithmetic

rawtitle:
Compatible software and hardware implementations permitted by {IEEE} standards for binary floating-point arithmetic

entry:
@InProceedings{Look:1984:CSH,
  author =       "H. W. Look",
  title =        "Compatible software and hardware implementations
                 permitted by {IEEE} standards for binary floating-point
                 arithmetic",
  crossref =     "NCC:1984:ACP",
  pages =        "101--105",
  year =         "1984",
  bibdate =      "Wed Sep 7 22:31:45 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
}


bibtype: article
filename: fparith.bib
label: Lorenz:1984:MIL
author: E. Lorenz and R. Sandau
journal: j-NACH-ELEK
volume: 34
number: 8
pages: 288--290
year: 1984
CODEN: NTELAP
ISSN: 0323-4657 OR 03234657
bibdate: Fri Sep 16 16:30:40 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.16 16:30:40 ???
fjournal: Nachrichtentechnik Elektronik
acknowledgement: ack-nj
rawauthor: E. Lorenz and R. Sandau
title:
Moglichkeiten der Implementierung leistungsfahiger Multiplikationsprogramme in Mikrorechnersystemen toenglish Possibilities of the Implementation of Efficient Multiplication Instructions in Microcomputer Systems endtoenglish 

rawtitle:
{M{\"o}glichkeiten der Implementierung leistungsf{\"a}higer Multiplikationsprogramme in Mikrorechnersystemen} \toenglish {Possibilities of the Implementation of Efficient Multiplication Instructions in Microcomputer Systems} \endtoenglish

entry:
@Article{Lorenz:1984:MIL,
  author =       "E. Lorenz and R. Sandau",
  title =        "{M{\"o}glichkeiten der Implementierung
                 leistungsf{\"a}higer Multiplikationsprogramme in
                 Mikrorechnersystemen} \toenglish {Possibilities of the
                 Implementation of Efficient Multiplication Instructions
                 in Microcomputer Systems} \endtoenglish",
  journal =      j-NACH-ELEK,
  volume =       "34",
  number =       "8",
  pages =        "288--290",
  month =        "????",
  year =         "1984",
  CODEN =        "NTELAP",
  ISSN =         "0323-4657",
  bibdate =      "Fri Sep 16 16:30:40 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "Nachrichtentechnik Elektronik",
}


bibtype: techreport
filename: fparith.bib
label: Mackin:1984:FFG
author: Michael A. Mackin and James F. Soeder
title: Floating-point function generation routines for 16-bit microcomputers
institution: National Aeronautics and Space Administration
address: Washington DC, USA
year: 1984
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
series: NASA technical memorandum; 83783
keywords: Microcomputers --- Programming.
acknowledgement: ack-nhfb
rawauthor: Michael A. Mackin and James F. Soeder
rawtitle: Floating-point function generation routines for 16-bit microcomputers
remark:
Distributed to depository libraries in microfiche. Microfiche. [Washington, D.C.?: National Aeronautics and Space Administration], 1984. 1 microfiche.

entry:
@TechReport{Mackin:1984:FFG,
  author =       "Michael A. Mackin and James F. Soeder",
  title =        "Floating-point function generation routines for 16-bit
                 microcomputers",
  institution =  "National Aeronautics and Space Administration",
  address =      "Washington DC, USA",
  pages =        "????",
  year =         "1984",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  series =       "NASA technical memorandum; 83783",
  acknowledgement = ack-nhfb,
  govtdocnumber = "NAS 1.15:83783 830-D (MF)",
  keywords =     "Microcomputers --- Programming.",
  remark =       "Distributed to depository libraries in microfiche.
                 Microfiche. [Washington, D.C.?: National Aeronautics
                 and Space Administration], 1984. 1 microfiche.",
}


bibtype: article
filename: fparith.bib
label: Mactaggart:1984:SCR
author: I. Ross Mactaggart and Mervyn A. Jack
title: A single chip radix-$2$ FFT butterfly architecture using parallel data distributed arithmetic
journal: j-IEEE-J-SOLID-STATE-CIRCUITS
volume: SC-19
number: 3
pages: 368--373
month: jun
monthnumber: 6
year: 1984
CODEN: IJSCBC
DOI: https://doi.org/10.1109/JSSC.1984.1052151
ISSN: 0018-9200 (print), 1558-173X (electronic) OR 00189200 (print), 1558173X (electronic)
ISSNL: 0018-9200 OR 00189200
bibdate: Thu Jul 07 10:57:50 2011
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2011.07.07 10:57:50 ???
fjournal: IEEE Journal of Solid-State Circuits
acknowledgement: ack-nhfb
rawauthor: I. Ross Mactaggart and Mervyn A. Jack
rawtitle: A single chip radix-$2$ {FFT} butterfly architecture using parallel data distributed arithmetic
entry:
@Article{Mactaggart:1984:SCR,
  author =       "I. Ross Mactaggart and Mervyn A. Jack",
  title =        "A single chip radix-$2$ {FFT} butterfly architecture
                 using parallel data distributed arithmetic",
  journal =      j-IEEE-J-SOLID-STATE-CIRCUITS,
  volume =       "SC-19",
  number =       "3",
  pages =        "368--373",
  month =        jun,
  year =         "1984",
  CODEN =        "IJSCBC",
  DOI =          "https://doi.org/10.1109/JSSC.1984.1052151",
  ISSN =         "0018-9200 (print), 1558-173X (electronic)",
  ISSN-L =       "0018-9200",
  bibdate =      "Thu Jul 07 10:57:50 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Journal of Solid-State Circuits",
}


bibtype: article
filename: fparith.bib
label: Mansfield:1984:CAC
author: Richard Mansfield
title: A Complete Axiomatization of Computer Arithmetic
journal: j-MATH-COMPUT
volume: 42
number: 166
pages: 623--635
month: apr
monthnumber: 4
year: 1984
CODEN: MCMPAF
ISSN: 0025-5718 (print), 1088-6842 (electronic) OR 00255718 (print), 10886842 (electronic)
ISSNL: 0025-5718 OR 00255718
MRclass: 65G99 (03B70 03C70 68Q40)
MRnumber: 85k:65040
MRreviewer: R. P. Brent
bibdate: Tue Oct 13 08:06:19 MDT 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database
bibtimestamp: 1998.10.13 08:06:19 MDT
fjournal: Mathematics of Computation
acknowledgement: ack-nhfb
ajournal: Math. Comput.
classcodes: C5230 (Digital arithmetic methods)
corpsource: Department of Math., Pennsylvania State University, University Park, PA, USA
journalURL: http://www.ams.org/mcom/
treatment: T Theoretical or Mathematical
rawauthor: Richard Mansfield
rawtitle: A Complete Axiomatization of Computer Arithmetic
keywords:
axiom system; complete axiomatization; computer arithmetic; digital arithmetic; multiplication; rounded addition; rounded arithmetic

entry:
@Article{Mansfield:1984:CAC,
  author =       "Richard Mansfield",
  title =        "A Complete Axiomatization of Computer Arithmetic",
  journal =      j-MATH-COMPUT,
  volume =       "42",
  number =       "166",
  pages =        "623--635",
  month =        apr,
  year =         "1984",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65G99 (03B70 03C70 68Q40)",
  MRnumber =     "85k:65040",
  MRreviewer =   "R. P. Brent",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  ajournal =     "Math. Comput.",
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Department of Math., Pennsylvania State University,
                 University Park, PA, USA",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "axiom system; complete axiomatization; computer
                 arithmetic; digital arithmetic; multiplication; rounded
                 addition; rounded arithmetic",
  treatment =    "T Theoretical or Mathematical",
}


bibtype: article
filename: fparith.bib
label: Miller:1984:ILA
author: D. Miller and J. Polky
title: An implementation of the LMS algorithm in the residue number system
journal: j-IEEE-TRANS-CIRCUITS-SYST
volume: 31
number: 5
pages: 452--461
month: may
monthnumber: 5
year: 1984
CODEN: ICSYBT
DOI: https://doi.org/10.1109/TC.1984.1676355
ISSN: 0098-4094 (print), 1558-1276 (electronic) OR 00984094 (print), 15581276 (electronic)
ISSNL: 0098-4094 OR 00984094
bibdate: Fri Nov 9 11:38:57 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.09 11:38:57 MST
URL: https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=23556
fjournal: IEEE Transactions on Circuits and Systems
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
rawauthor: D. Miller and J. Polky
rawtitle: An implementation of the {LMS} algorithm in the residue number system
entry:
@Article{Miller:1984:ILA,
  author =       "D. Miller and J. Polky",
  title =        "An implementation of the {LMS} algorithm in the
                 residue number system",
  journal =      j-IEEE-TRANS-CIRCUITS-SYST,
  volume =       "31",
  number =       "5",
  pages =        "452--461",
  month =        may,
  year =         "1984",
  CODEN =        "ICSYBT",
  DOI =          "https://doi.org/10.1109/TC.1984.1676355",
  ISSN =         "0098-4094 (print), 1558-1276 (electronic)",
  ISSN-L =       "0098-4094",
  bibdate =      "Fri Nov 9 11:38:57 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=23556",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Circuits and Systems",
  keywords =     "residue arithmetic; residue number system",
  summary =      "The Residue Arithmetic Adaptive Filter (RAAF)
                 processor performs the least mean square (LMS)
                 algorithm using 60 ns discrete PROM-latch combinations
                 for the residue operations. Parallel and pipeline
                 techniques are used throughout. Since the LMS
                 \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Moran:1984:SST
author: Thomas W. Moran
title: Some Spreadsheet Tests of the Savage Floating-Point Benchmark in 16BST
journal: j-DDJ
volume: 9
number: 8
pages: 106--??
month: aug
monthnumber: 8
year: 1984
CODEN: DDJOEB
ISSN: 1044-789X OR 1044789X
bibdate: Mon Sep 2 09:09:39 MDT 1996
bibsource: http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.09.02 09:09:39 MDT
fjournal: Dr. Dobb's Journal of Software Tools
acknowledgement: ack-nhfb
rawauthor: Thomas W. Moran
rawtitle: Some Spreadsheet Tests of the {Savage} Floating-Point Benchmark in {16BST}
entry:
@Article{Moran:1984:SST,
  author =       "Thomas W. Moran",
  title =        "Some Spreadsheet Tests of the {Savage} Floating-Point
                 Benchmark in {16BST}",
  journal =      j-DDJ,
  volume =       "9",
  number =       "8",
  pages =        "106--??",
  month =        aug,
  year =         "1984",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}


bibtype: incollection
filename: fparith.bib
label: Munzel:1984:RAE
author: Georg Munzel
booktitle: Parallel computing 83 (Berlin, 1983)
title: Residue arithmetic for exact calculations on the DAP
publisher: pub-NORTH-HOLLAND
address: pub-NORTH-HOLLAND:adr
pages: 199--204
year: 1984
MRclass: 65W05
MRnumber: MR809397 (86k:65141)
bibdate: Thu Nov 8 14:50:29 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.08 14:50:29 ???
acknowledgement: ack-nhfb
rawauthor: Georg M{\"u}nzel
rawbooktitle: Parallel computing 83 (Berlin, 1983)
rawtitle: Residue arithmetic for exact calculations on the {DAP}
entry:
@InCollection{Munzel:1984:RAE,
  author =       "Georg M{\"u}nzel",
  booktitle =    "Parallel computing 83 (Berlin, 1983)",
  title =        "Residue arithmetic for exact calculations on the
                 {DAP}",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "199--204",
  year =         "1984",
  MRclass =      "65W05",
  MRnumber =     "MR809397 (86k:65141)",
  bibdate =      "Thu Nov 8 14:50:29 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: fparith.bib
label: Murray:1984:SFA
author: J. T. Murray
title: Sin / Cos Functions via Approximations Plus Error Compensation
journal: j-IBM-TDB
volume: 26
number: 10A
pages: 4967--4968
month: mar
monthnumber: 3
year: 1984
CODEN: IBMTAA
ISSN: 0018-8689 OR 00188689
bibdate: Thu Sep 1 10:15:56 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.01 10:15:56 ???
fjournal: IBM Technical Disclosure Bulletin
acknowledgement: ack-nj
rawauthor: J. T. Murray
rawtitle: Sin\slash Cos Functions via Approximations Plus Error Compensation
entry:
@Article{Murray:1984:SFA,
  author =       "J. T. Murray",
  title =        "Sin\slash Cos Functions via Approximations Plus Error
                 Compensation",
  journal =      j-IBM-TDB,
  volume =       "26",
  number =       "10A",
  pages =        "4967--4968",
  month =        mar,
  year =         "1984",
  CODEN =        "IBMTAA",
  ISSN =         "0018-8689",
  bibdate =      "Thu Sep 1 10:15:56 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "IBM Technical Disclosure Bulletin",
}


bibtype: phdthesis
filename: fparith.bib
label: Naseem:1984:IPC
author: Asif Naseem
title: Implementation of Parallel Computational Algorithms on a Modified CORDIC Arithmetic Logic Unit
type: Ph.D. thesis
school: Michigan State University
address: East Lansing, MI, USA
pages: 137
year: 1984
ISBN13: 979-84-13-17501-9 OR 9798413175019
bibdate: Mon Oct 27 10:32:44 2025
bibsource: https://www.math.utah.edu/pub/tex/bib/cordic.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2025.10.27 10:32:44 ???
keywords: 0544:Electrical engineering; Applied sciences; Electrical engineering
acknowledgement: ack-nhfb
rawauthor: Asif Naseem
rawtitle: Implementation of Parallel Computational Algorithms on a Modified {CORDIC} Arithmetic Logic Unit
URL:
https://login.ezproxy.lib.utah.edu/login?url=https://www.proquest.com/dissertations-theses/implementation-parallel-computational-algorithms/docview/303294026/se-2

entry:
@PhdThesis{Naseem:1984:IPC,
  author =       "Asif Naseem",
  title =        "Implementation of Parallel Computational Algorithms on
                 a Modified {CORDIC} Arithmetic Logic Unit",
  type =         "{Ph.D.} thesis",
  school =       "Michigan State University",
  address =      "East Lansing, MI, USA",
  pages =        "137",
  year =         "1984",
  ISBN-13 =      "979-84-13-17501-9",
  bibdate =      "Mon Oct 27 10:32:44 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "https://login.ezproxy.lib.utah.edu/login?url=https://www.proquest.com/dissertations-theses/implementation-parallel-computational-algorithms/docview/303294026/se-2",
  acknowledgement = ack-nhfb,
  keywords =     "0544:Electrical engineering; Applied sciences;
                 Electrical engineering",
  ris-m1 =       "8503253",
}


bibtype: misc
filename: fparith.bib
label: OliverWhiteheadQuintet:1984:FN
author: Oliver Whitehead Quintet
title: Free for now
publisher: Justin Time Records
pages: 137
year: 1984
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
note: 1 sound disc
keywords: Jazz --- 1981-1990.
acknowledgement: ack-nhfb
rawauthor: Oliver Whitehead Quintet
rawnote: 1 sound disc
rawtitle: Free for now
remark:
Brief record. Free for now --- Six-string waltz --- Old friend --- Invention; Excuses, excuses --- Getting away --- Woman in blue --- Floating point --- Crazy season --- Do it with your socks on. Performed by the Oliver Whitehead Quintet. JUST 4; Justin Time Records

entry:
@Misc{OliverWhiteheadQuintet:1984:FN,
  author =       "Oliver Whitehead Quintet",
  title =        "Free for now",
  publisher =    "Justin Time Records",
  address =      "????",
  year =         "1984",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "1 sound disc",
  acknowledgement = ack-nhfb,
  keywords =     "Jazz --- 1981-1990.",
  remark =       "Brief record. Free for now --- Six-string waltz ---
                 Old friend --- Invention; Excuses, excuses --- Getting
                 away --- Woman in blue --- Floating point --- Crazy
                 season --- Do it with your socks on. Performed by the
                 Oliver Whitehead Quintet. JUST 4; Justin Time Records",
}


bibtype: misc
filename: fparith.bib
label: Palmer:1984:FBU
author: John Palmer and Bruce Ravenel and Rafi Nave
title: Fraction Bus for Use in a Numeric Data Processor
pages: 137
day: 10
month: nov
monthnumber: 11
year: 1984
bibdate: Sat Aug 23 06:36:20 2025
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2025.08.23 06:36:20 ???
URL: https://ieeemilestones.ethw.org/w/images/3/3d/Patent_8087_fraction_bus.pdf
acknowledgement: ack-nhfb
howpublished: US Patent 4,484,259.
rawauthor: John Palmer and Bruce Ravenel and Rafi Nave
rawtitle: Fraction Bus for Use in a Numeric Data Processor
note:
Filed 22 January, 1982. This patent discusses the 67-bit data path in the 8087, supporting both the use of three extra bits --- Guard, Round, and Sticky --- in computing 64-bit results and the use of full 67-bit chopped arithmetic in the computation of the transcendental functions.

abstract:
A floating point, integrated, arithmetic circuit is organized around a file format having a floating point numeric domain exceeding that of any single or double precision floating point numbers, long or short integer words of BCD data upon which it must operate. As a result the circuit has a greater reliability, range and precision than ever previously achieved without entailing additional circuit complexity. Reliability is further enhanced by a systematic three bit rounding field, and by including means for detecting every error or exception condition with an optional expected response provided thereto by hardware. As a result of such organization, an unexpected increase of capacity is achieved wherein transcendental functions can be computed to tally in hardware, and whereby mixed mode arithmetic can be implemented without difficulty. The numeric processor also includes a programmable shifter capable of arbitrary numbers of bit and byte shifts in a single clock cycle, as well as an arithmetic unit capable of implementing multiplication, division, modulo reduction and square roots directly in hardware.

rawabstract:
A floating point, integrated, arithmetic circuit is organized around a file format having a floating point numeric domain exceeding that of any single or double precision floating point numbers, long or short integer words of BCD data upon which it must operate. As a result the circuit has a greater reliability, range and precision than ever previously achieved without entailing additional circuit complexity. Reliability is further enhanced by a systematic three bit rounding field, and by including means for detecting every error or exception condition with an optional expected response provided thereto by hardware. As a result of such organization, an unexpected increase of capacity is achieved wherein transcendental functions can be computed to tally in hardware, and whereby mixed mode arithmetic can be implemented without difficulty. The numeric processor also includes a programmable shifter capable of arbitrary numbers of bit and byte shifts in a single clock cycle, as well as an arithmetic unit capable of implementing multiplication, division, modulo reduction and square roots directly in hardware.

rawnote:
Filed 22 January, 1982. This patent discusses the 67-bit data path in the 8087, supporting both the use of three extra bits --- Guard, Round, and Sticky --- in computing 64-bit results and the use of full 67-bit chopped arithmetic in the computation of the transcendental functions.

entry:
@Misc{Palmer:1984:FBU,
  author =       "John Palmer and Bruce Ravenel and Rafi Nave",
  title =        "Fraction Bus for Use in a Numeric Data Processor",
  howpublished = "US Patent 4,484,259.",
  day =          "10",
  month =        nov,
  year =         "1984",
  bibdate =      "Sat Aug 23 06:36:20 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "Filed 22 January, 1982. This patent discusses the
                 67-bit data path in the 8087, supporting both the use
                 of three extra bits --- Guard, Round, and Sticky --- in
                 computing 64-bit results and the use of full 67-bit
                 chopped arithmetic in the computation of the
                 transcendental functions.",
  URL =          "https://ieeemilestones.ethw.org/w/images/3/3d/Patent_8087_fraction_bus.pdf",
  abstract =     "A floating point, integrated, arithmetic circuit is
                 organized around a file format having a floating point
                 numeric domain exceeding that of any single or double
                 precision floating point numbers, long or short integer
                 words of BCD data upon which it must operate. As a
                 result the circuit has a greater reliability, range and
                 precision than ever previously achieved without
                 entailing additional circuit complexity. Reliability is
                 further enhanced by a systematic three bit rounding
                 field, and by including means for detecting every error
                 or exception condition with an optional expected
                 response provided thereto by hardware. As a result of
                 such organization, an unexpected increase of capacity
                 is achieved wherein transcendental functions can be
                 computed to tally in hardware, and whereby mixed mode
                 arithmetic can be implemented without difficulty. The
                 numeric processor also includes a programmable shifter
                 capable of arbitrary numbers of bit and byte shifts in
                 a single clock cycle, as well as an arithmetic unit
                 capable of implementing multiplication, division,
                 modulo reduction and square roots directly in
                 hardware.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: fparith.bib
label: Palmer:1984:P
author: John F. Palmer and Stephen P. Morse
title: The 8087 Primer
publisher: pub-WILEY
address: pub-WILEY:adr
pages: viii + 182
year: 1984
ISBN: 0-471-87569-4 OR 0471875694
ISBN13: 978-0-471-87569-7 OR 9780471875697
LCCN: QA76.8.I2923 P34 1984
bibdate: Wed Dec 15 10:40:38 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1993.12.15 10:40:38 ???
URL: https://ieeemilestones.ethw.org/w/images/d/d2/Palmer_Morse_Elementary_Functions_Chapter.pdf
acknowledgement: ack-nhfb
rawauthor: John F. Palmer and Stephen P. Morse
rawtitle: The 8087 Primer
note:
Excellent coverage of the 8087 numeric coprocessor by the chief architects of the Intel 8087 (Palmer) and 8086 (Morse). Contains many candid statements about design decisions in these processors. A must for serious assembly language coding of the 8087 and 80287 chips. See also cite Intel:1985:PRM.

rawnote:
Excellent coverage of the 8087 numeric coprocessor by the chief architects of the Intel 8087 (Palmer) and 8086 (Morse). Contains many candid statements about design decisions in these processors. A must for serious assembly language coding of the 8087 and 80287 chips. See also \cite{Intel:1985:PRM}.

entry:
@Book{Palmer:1984:P,
  author =       "John F. Palmer and Stephen P. Morse",
  title =        "The 8087 Primer",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "viii + 182",
  year =         "1984",
  ISBN =         "0-471-87569-4",
  ISBN-13 =      "978-0-471-87569-7",
  LCCN =         "QA76.8.I2923 P34 1984",
  bibdate =      "Wed Dec 15 10:40:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "Excellent coverage of the 8087 numeric coprocessor by
                 the chief architects of the Intel 8087 (Palmer) and
                 8086 (Morse). Contains many candid statements about
                 design decisions in these processors. A must for
                 serious assembly language coding of the 8087 and 80287
                 chips. See also \cite{Intel:1985:PRM}.",
  URL =          "https://ieeemilestones.ethw.org/w/images/d/d2/Palmer_Morse_Elementary_Functions_Chapter.pdf",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: fparith.bib
label: Parker:1984:CCS
author: J. R. Parker
title: On Converting Character Strings to Integers
journal: j-INFO-PROC-LETT
volume: 19
number: 1
pages: 17--19
day: 26
month: jul
monthnumber: 7
year: 1984
CODEN: IFPLAT
DOI: https://doi.org/10.1016/0020-0190(84)90122-4
ISSN: 0020-0190 (print), 1872-6119 (electronic) OR 00200190 (print), 18726119 (electronic)
ISSNL: 0020-0190 OR 00200190
bibdate: Wed Nov 11 12:16:26 MST 1998
bibtimestamp: 1998.11.11 12:16:26 MST
URL: http://www.sciencedirect.com/science/article/pii/0020019084901224
fjournal: Information Processing Letters
acknowledgement: ack-nhfb
corpsource: Department of Computer Sci., University of Calgary, Calgary, Alta., Canada
journalURL: http://www.sciencedirect.com/science/journal/00200190
journalabr: Inf Process Lett
treatment: T Theoretical or Mathematical
rawauthor: J. R. Parker
rawtitle: On Converting Character Strings to Integers
bibsource:
Compendex database; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib

keywords:
character strings; character to integer conversion; computer programming; integer overflow; programming theory

entry:
@Article{Parker:1984:CCS,
  author =       "J. R. Parker",
  title =        "On Converting Character Strings to Integers",
  journal =      j-INFO-PROC-LETT,
  volume =       "19",
  number =       "1",
  pages =        "17--19",
  day =          "26",
  month =        jul,
  year =         "1984",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(84)90122-4",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0020019084901224",
  acknowledgement = ack-nhfb,
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Department of Computer Sci., University of Calgary,
                 Calgary, Alta., Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "character strings; character to integer conversion;
                 computer programming; integer overflow; programming
                 theory",
  treatment =    "T Theoretical or Mathematical",
}


bibtype: article
filename: fparith.bib
label: Pei:1984:CAD
author: Soo-Chang Pei and Kuo-Chih Ho
title: Comments on ``Adaptive digital control implemented using residue number systems''
journal: j-IEEE-TRANS-AUTOMAT-CONTR
volume: 29
number: 9
pages: 863--863
month: sep
monthnumber: 9
year: 1984
CODEN: IETAA9
DOI: https://doi.org/10.1109/TC.1984.1676355
ISSN: 0018-9286 (print), 1558-2523 (electronic) OR 00189286 (print), 15582523 (electronic)
ISSNL: 0018-9286 OR 00189286
bibdate: Fri Nov 9 11:38:57 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.09 11:38:57 MST
note: See cite Tan:1982:ADC.
URL: https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=24217
fjournal: IEEE Transactions on Automatic Control
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=9
rawauthor: Soo-Chang Pei and Kuo-Chih Ho
rawnote: See \cite{Tan:1982:ADC}.
rawtitle: Comments on {``Adaptive digital control implemented using residue number systems''}
entry:
@Article{Pei:1984:CAD,
  author =       "Soo-Chang Pei and Kuo-Chih Ho",
  title =        "Comments on {``Adaptive digital control implemented
                 using residue number systems''}",
  journal =      j-IEEE-TRANS-AUTOMAT-CONTR,
  volume =       "29",
  number =       "9",
  pages =        "863--863",
  month =        sep,
  year =         "1984",
  CODEN =        "IETAA9",
  DOI =          "https://doi.org/10.1109/TC.1984.1676355",
  ISSN =         "0018-9286 (print), 1558-2523 (electronic)",
  ISSN-L =       "0018-9286",
  bibdate =      "Fri Nov 9 11:38:57 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "See \cite{Tan:1982:ADC}.",
  URL =          "https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=24217",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Automatic Control",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=9",
  keywords =     "residue arithmetic; residue number system",
  summary =      "The aim of this correspondence is to correct some
                 errors and modify Tan and McInnis residue number
                 decoding scheme into a simplified \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Pfenninger:1984:DES
author: E. Pfenninger
journal: j-ELEKTRONIKER
volume: 15
pages: 62--64
year: 1984
CODEN: ELKRBL
ISSN: 0531-9218 OR 05319218
bibdate: Fri Sep 16 16:30:40 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.16 16:30:40 ???
fjournal: Elektroniker (Switzerland)
acknowledgement: ack-nj
rawauthor: E. Pfenninger
title:
Divisionsalgorithmus -- einfach und schnell toenglish Division Algorithms -- Simple and Fast endtoenglish 

rawtitle:
{Divisionsalgorithmus -- einfach und schnell} \toenglish {Division Algorithms -- Simple and Fast} \endtoenglish

entry:
@Article{Pfenninger:1984:DES,
  author =       "E. Pfenninger",
  title =        "{Divisionsalgorithmus -- einfach und schnell}
                 \toenglish {Division Algorithms -- Simple and Fast}
                 \endtoenglish",
  journal =      j-ELEKTRONIKER,
  volume =       "15",
  pages =        "62--64",
  year =         "1984",
  CODEN =        "ELKRBL",
  ISSN =         "0531-9218",
  bibdate =      "Fri Sep 16 16:30:40 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "Elektroniker (Switzerland)",
}


bibtype: article
filename: fparith.bib
label: Pountain:1984:PM
author: D. Pountain
title: PROLOG on Microcomputers
journal: j-BYTE
volume: 9
number: 13
pages: 355--62
month: dec
monthnumber: 12
year: 1984
CODEN: BYTEDJ
ISSN: 0360-5280 (print), 1082-7838 (electronic) OR 03605280 (print), 10827838 (electronic)
ISSNL: 0360-5280 OR 03605280
LCCN: QA 76.5 B98
bibdate: Thu Nov 8 14:50:29 2007
bibtimestamp: 2007.11.08 14:50:29 ???
fjournal: BYTE Magazine
keywords: PROLOG
acknowledgement: ack-nhfb
rawauthor: D. Pountain
rawtitle: {PROLOG} on Microcomputers
bibsource:
/usr/local/src/bib/bibliography/Ai/log.prog.85.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib

abstract:
Discusses micro-PROLOG, a dialect of PROLOG originally written for the z80 microprocessor, which was the first microcomputer implementation of the language. The micro-PROLOG language is an interpreted language. A program consists of a database of facts and rules that you can query to solve problems. Logical propositions replace computer-oriented instructions. Micro-PROLOG has floating point arithmetic.

rawabstract:
Discusses micro-PROLOG, a dialect of PROLOG originally written for the z80 microprocessor, which was the first microcomputer implementation of the language. The micro-PROLOG language is an interpreted language. A program consists of a database of facts and rules that you can query to solve problems. Logical propositions replace computer-oriented instructions. Micro-PROLOG has floating point arithmetic.

entry:
@Article{Pountain:1984:PM,
  author =       "D. Pountain",
  title =        "{PROLOG} on Microcomputers",
  journal =      j-BYTE,
  volume =       "9",
  number =       "13",
  pages =        "355--62",
  month =        dec,
  year =         "1984",
  CODEN =        "BYTEDJ",
  ISSN =         "0360-5280 (print), 1082-7838 (electronic)",
  ISSN-L =       "0360-5280",
  LCCN =         "QA 76.5 B98",
  bibdate =      "Thu Nov 8 14:50:29 2007",
  bibsource =    "/usr/local/src/bib/bibliography/Ai/log.prog.85.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  abstract =     "Discusses micro-PROLOG, a dialect of PROLOG originally
                 written for the z80 microprocessor, which was the first
                 microcomputer implementation of the language. The
                 micro-PROLOG language is an interpreted language. A
                 program consists of a database of facts and rules that
                 you can query to solve problems. Logical propositions
                 replace computer-oriented instructions. Micro-PROLOG
                 has floating point arithmetic.",
  acknowledgement = ack-nhfb,
  fjournal =     "BYTE Magazine",
  keywords =     "PROLOG",
}


bibtype: article
filename: fparith.bib
label: Prince:1984:SFP
author: Thomas Prince
title: Savage Floating Point Benchmark in Logo in 16BST
journal: j-DDJ
volume: 9
number: 6
pages: 82--??
month: jun
monthnumber: 6
year: 1984
CODEN: DDJOEB
ISSN: 1044-789X OR 1044789X
bibdate: Mon Sep 2 09:09:39 MDT 1996
bibsource: http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.09.02 09:09:39 MDT
fjournal: Dr. Dobb's Journal of Software Tools
acknowledgement: ack-nhfb
rawauthor: Thomas Prince
rawtitle: {Savage} Floating Point Benchmark in Logo in {16BST}
entry:
@Article{Prince:1984:SFP,
  author =       "Thomas Prince",
  title =        "{Savage} Floating Point Benchmark in Logo in {16BST}",
  journal =      j-DDJ,
  volume =       "9",
  number =       "6",
  pages =        "82--??",
  month =        jun,
  year =         "1984",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}


bibtype: inproceedings
filename: fparith.bib
label: Rauchwerk:1984:MBF
author: M. D. Rauchwerk
title: A microprocessor-based fast floating point library
crossref: IEEE:1984:CPI
pages: 488--490
year: 1984
bibdate: Thu Sep 01 12:03:42 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.01 12:03:42 ???
acknowledgement: ack-nj
rawauthor: M. D. Rauchwerk
rawtitle: A micro\-pro\-cess\-or-based fast floating point library
entry:
@InProceedings{Rauchwerk:1984:MBF,
  author =       "M. D. Rauchwerk",
  title =        "A micro\-pro\-cess\-or-based fast floating point
                 library",
  crossref =     "IEEE:1984:CPI",
  pages =        "488--490",
  year =         "1984",
  bibdate =      "Thu Sep 01 12:03:42 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
}


bibtype: article
filename: fparith.bib
label: Regener:1984:MID
author: Eric Regener
title: Multiprecision Integer Division Examples Using Arbitrary Radix
journal: j-TOMS
volume: 10
number: 3
pages: 325--328
month: sep
monthnumber: 9
year: 1984
CODEN: ACMSCU
DOI: https://doi.org/10.1145/1271.2738
ISSN: 0098-3500 (print), 1557-7295 (electronic) OR 00983500 (print), 15577295 (electronic)
ISSNL: 0098-3500 OR 00983500
MRclass: 65V05
MRnumber: 86g:65241
bibdate: Sun Sep 04 20:18:56 1994
bibtimestamp: 1994.09.04 20:18:56 ???
note: See also cite BrinchHansen:1994:MLD.
fjournal: ACM Transactions on Mathematical Software (TOMS)
acknowledgement: ack-nhfb
journalURL: https://dl.acm.org/loi/toms
rawauthor: Eric Regener
rawnote: See also \cite{BrinchHansen:1994:MLD}.
rawtitle: Multiprecision Integer Division Examples Using Arbitrary Radix
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/h/hansen-per-brinch.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/toms.bib

entry:
@Article{Regener:1984:MID,
  author =       "Eric Regener",
  title =        "Multiprecision Integer Division Examples Using
                 Arbitrary Radix",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "325--328",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/1271.2738",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65V05",
  MRnumber =     "86g:65241",
  bibdate =      "Sun Sep 04 20:18:56 1994",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/hansen-per-brinch.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  note =         "See also \cite{BrinchHansen:1994:MLD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "https://dl.acm.org/loi/toms",
}


bibtype: incollection
filename: fparith.bib
label: Schryer:1984:DCF
author: N. L. Schryer
title: Determination of Correct Floating-Point Model Parameters
crossref: Cowell:1984:SDM
pages: 360--366
year: 1984
bibdate: Thu Sep 08 17:23:39 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.08 17:23:39 ???
acknowledgement: ack-nhfb
rawauthor: N. L. Schryer
rawtitle: Determination of Correct Floating-Point Model Parameters
entry:
@InCollection{Schryer:1984:DCF,
  author =       "N. L. Schryer",
  title =        "Determination of Correct Floating-Point Model
                 Parameters",
  crossref =     "Cowell:1984:SDM",
  pages =        "360--366",
  year =         "1984",
  bibdate =      "Thu Sep 08 17:23:39 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
}


bibtype: inproceedings
filename: fparith.bib
label: Shahan:1984:MIF
author: V. Shahan
title: The MC68881: The IEEE Floating Point Standard Reduced to One VLSI Chip
crossref: IEEE:1984:ILD
pages: 172--176
year: 1984
bibdate: Wed Sep 7 22:31:44 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.07 22:31:44 ???
acknowledgement: ack-nj
rawauthor: V. Shahan
rawtitle: The {MC68881}: The {IEEE} Floating Point Standard Reduced to One {VLSI} Chip
entry:
@InProceedings{Shahan:1984:MIF,
  author =       "V. Shahan",
  title =        "The {MC68881}: The {IEEE} Floating Point Standard
                 Reduced to One {VLSI} Chip",
  crossref =     "IEEE:1984:ILD",
  pages =        "172--176",
  year =         "1984",
  bibdate =      "Wed Sep 7 22:31:44 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
}


bibtype: article
filename: fparith.bib
label: Shen:1984:DET
author: J. P. Shen and F. J. Ferguson
title: The Design of Easily Testable VLSI Array Multipliers
journal: j-IEEE-TRANS-COMPUT
volume: C-33
number: 6
pages: 554--560
month: jun
monthnumber: 6
year: 1984
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1984.1676480
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 09:22:52 MDT 2011
bibtimestamp: 2011.07.10 09:22:52 MDT
URL: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676480
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: J. P. Shen and F. J. Ferguson
rawtitle: The Design of Easily Testable {VLSI} Array Multipliers
entry:
@Article{Shen:1984:DET,
  author =       "J. P. Shen and F. J. Ferguson",
  title =        "The Design of Easily Testable {VLSI} Array
                 Multipliers",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-33",
  number =       "6",
  pages =        "554--560",
  month =        jun,
  year =         "1984",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1984.1676480",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 09:22:52 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  URL =          "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676480",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: article
filename: fparith.bib
label: Shively:1984:CTG
author: R. R. Shively and W. V. Robinson and D. E. Orton
title: Cascading Transmission Gates to Enhance Multiplier Performance
journal: j-IEEE-TRANS-COMPUT
volume: C-33
number: 7
pages: 677--679
month: jul
monthnumber: 7
year: 1984
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1984.5009343
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 09:22:53 MDT 2011
bibtimestamp: 2011.07.10 09:22:53 MDT
URL: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5009343
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: R. R. Shively and W. V. Robinson and D. E. Orton
rawtitle: Cascading Transmission Gates to Enhance Multiplier Performance
entry:
@Article{Shively:1984:CTG,
  author =       "R. R. Shively and W. V. Robinson and D. E. Orton",
  title =        "Cascading Transmission Gates to Enhance Multiplier
                 Performance",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-33",
  number =       "7",
  pages =        "677--679",
  month =        jul,
  year =         "1984",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1984.5009343",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 09:22:53 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  URL =          "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5009343",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: article
filename: fparith.bib
label: Sips:1984:BSA
author: Henk J. Sips
title: Bit-Sequential Arithmetic for Parallel Processors
journal: j-IEEE-TRANS-COMPUT
volume: C-33
number: 1
pages: 7--20
month: jan
monthnumber: 1
year: 1984
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1984.5009311
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 09:22:49 MDT 2011
bibtimestamp: 2011.07.10 09:22:49 MDT
URL: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5009311
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: Henk J. Sips
rawtitle: Bit-Sequential Arithmetic for Parallel Processors
entry:
@Article{Sips:1984:BSA,
  author =       "Henk J. Sips",
  title =        "Bit-Sequential Arithmetic for Parallel Processors",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-33",
  number =       "1",
  pages =        "7--20",
  month =        jan,
  year =         "1984",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1984.5009311",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 09:22:49 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  URL =          "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5009311",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: article
filename: fparith.bib
label: Smoktunowicz:1984:BCI
author: Alicja Smoktunowicz and Jolanta Sokolnicka
title: Binary cascades iterative refinement in doubled-mantissa arithmetics
journal: j-BIT
volume: 24
number: 1
pages: 123--127
month: mar
monthnumber: 3
year: 1984
CODEN: BITTEL, NBITAB
DOI: https://doi.org/10.1007/BF01934524
ISSN: 0006-3835 (print), 1572-9125 (electronic) OR 00063835 (print), 15729125 (electronic)
ISSNL: 0006-3835 OR 00063835
MRclass: 65F05 (65G05)
MRnumber: 85i:65039
MRreviewer: A. Bultheel
bibdate: Wed Jan 4 18:52:18 MST 2006
bibtimestamp: 2006.01.04 18:52:18 MST
URL: http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=24&issue=1&spage=123
fjournal: BIT (Nordisk tidskrift for informationsbehandling)
acknowledgement: ack-nhfb
journalURL: http://link.springer.com/journal/10543
rawauthor: Alicja Smoktunowicz and Jolanta Sokolnicka
rawtitle: Binary cascades iterative refinement in doubled-mantissa arithmetics
bibsource:
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=24&issue=1; https://www.math.utah.edu/pub/tex/bib/bit.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib

entry:
@Article{Smoktunowicz:1984:BCI,
  author =       "Alicja Smoktunowicz and Jolanta Sokolnicka",
  title =        "Binary cascades iterative refinement in
                 doubled-mantissa arithmetics",
  journal =      j-BIT,
  volume =       "24",
  number =       "1",
  pages =        "123--127",
  month =        mar,
  year =         "1984",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1007/BF01934524",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  MRclass =      "65F05 (65G05)",
  MRnumber =     "85i:65039",
  MRreviewer =   "A. Bultheel",
  bibdate =      "Wed Jan 4 18:52:18 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=24&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/bit.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=24&issue=1&spage=123",
  acknowledgement = ack-nhfb,
  fjournal =     "BIT (Nordisk tidskrift for informationsbehandling)",
  journal-URL =  "http://link.springer.com/journal/10543",
}


bibtype: inproceedings
filename: fparith.bib
label: Soderstrand:1984:AQL
author: M. Soderstrand and G. Poe
booktitle: IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '84
title: Application of quadratic-like complex residue number system arithmetic to ultrasonics
publisher: pub-IEEE
address: pub-IEEE:adr
pages: 484--487
year: 1984
CODEN: ITCOB4
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Fri Nov 9 11:38:57 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.09 11:38:57 MST
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
rawauthor: M. Soderstrand and G. Poe
rawbooktitle: {IEEE} International Conference on Acoustics, Speech, and Signal Processing, {ICASSP '84}
rawtitle: Application of quadratic-like complex residue number system arithmetic to ultrasonics
entry:
@InProceedings{Soderstrand:1984:AQL,
  author =       "M. Soderstrand and G. Poe",
  booktitle =    "{IEEE} International Conference on Acoustics, Speech,
                 and Signal Processing, {ICASSP '84}",
  title =        "Application of quadratic-like complex residue number
                 system arithmetic to ultrasonics",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "484--487",
  year =         "1984",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Fri Nov 9 11:38:57 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "residue arithmetic; residue number system",
  summary =      "The concept of a ``Quadratic-Like'' Complex Residue
                 Number System is introduced in which certain purely
                 imaginary numbers exist as reals within the system. It
                 is shown that the desirable properties of a Quadratic
                 Complex Residue Number System with \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Soderstrand:1984:PRR
author: M. Soderstrand and B. Sinha
title: A pipelined recursive residue number system digital filter
journal: j-IEEE-TRANS-CIRCUITS-SYST
volume: 31
number: 4
pages: 415--417
month: apr
monthnumber: 4
year: 1984
CODEN: ICSYBT
DOI: https://doi.org/10.1109/TC.1983.1676240
ISSN: 0098-4094 (print), 1558-1276 (electronic) OR 00984094 (print), 15581276 (electronic)
ISSNL: 0098-4094 OR 00984094
bibdate: Fri Nov 9 11:38:57 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.09 11:38:57 MST
URL: https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=23555
fjournal: IEEE Transactions on Circuits and Systems
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
rawauthor: M. Soderstrand and B. Sinha
rawtitle: A pipelined recursive residue number system digital filter
entry:
@Article{Soderstrand:1984:PRR,
  author =       "M. Soderstrand and B. Sinha",
  title =        "A pipelined recursive residue number system digital
                 filter",
  journal =      j-IEEE-TRANS-CIRCUITS-SYST,
  volume =       "31",
  number =       "4",
  pages =        "415--417",
  month =        apr,
  year =         "1984",
  CODEN =        "ICSYBT",
  DOI =          "https://doi.org/10.1109/TC.1983.1676240",
  ISSN =         "0098-4094 (print), 1558-1276 (electronic)",
  ISSN-L =       "0098-4094",
  bibdate =      "Fri Nov 9 11:38:57 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=23555",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Circuits and Systems",
  keywords =     "residue arithmetic; residue number system",
  summary =      "The well-known advantages of pipelining as applied to
                 Finite Impulse Response (FIR) Residue Number System
                 (RNS) arithmetic digital filters is extended to the
                 important area of Infinite Impulse Response (IIR)
                 digital filters through a new technique \ldots{}",
}


bibtype: book
filename: fparith.bib
label: Steele:1984:CLL
author: Guy L. Steele
title: COMMON LISP: the language
publisher: pub-DP
address: pub-DP:adr
pages: xii + 465
year: 1984
ISBN: 0-932376-41-X (paperback) OR 093237641X (paperback)
ISBN13: 978-0-932376-41-1 (paperback) OR 9780932376411 (paperback)
LCCN: QA76.73.L23S73 1984
bibdate: Wed Jan 29 17:05:18 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2003.01.29 17:05:18 ???
keywords: COMMON LISP (Computer program language)
acknowledgement: ack-nhfb
rawauthor: Guy L. Steele
rawtitle: {COMMON LISP}: the language
note:
With contributions by Scott E. Fahlman and Richard P. Gabriel and David A. Moon and Daniel L. Weinreb.

remark:
From cite Steele:2004:RHP: ``In general, computations with floating-point numbers are only approximate.''

rawnote:
With contributions by Scott E. Fahlman and Richard P. Gabriel and David A. Moon and Daniel L. Weinreb.

entry:
@Book{Steele:1984:CLL,
  author =       "Guy L. Steele",
  title =        "{COMMON LISP}: the language",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xii + 465",
  year =         "1984",
  ISBN =         "0-932376-41-X (paperback)",
  ISBN-13 =      "978-0-932376-41-1 (paperback)",
  LCCN =         "QA76.73.L23S73 1984",
  bibdate =      "Wed Jan 29 17:05:18 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "With contributions by Scott E. Fahlman and Richard P.
                 Gabriel and David A. Moon and Daniel L. Weinreb.",
  acknowledgement = ack-nhfb,
  keywords =     "COMMON LISP (Computer program language)",
  remark =       "From \cite{Steele:2004:RHP}: ``In general,
                 computations with floating-point numbers are only
                 approximate.''",
}


bibtype: inproceedings
filename: fparith.bib
label: Stetter:1984:SDC
author: Hans J. Stetter
title: Sequential defect correction for high-accuracy floating-point algorithms
crossref: Griffiths:1984:NAP
pages: 186--202
year: 1984
DOI: https://doi.org/10.1007/BFb0099525
MRclass: 65V05 (65B05 65G05)
MRnumber: 86j:65188
bibdate: Fri Dec 8 08:24:13 1995
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1995.12.08 08:24:13 ???
acknowledgement: ack-nhfb
rawauthor: Hans J. Stetter
rawtitle: Sequential defect correction for high-accuracy floating-point algorithms
entry:
@InProceedings{Stetter:1984:SDC,
  author =       "Hans J. Stetter",
  title =        "Sequential defect correction for high-accuracy
                 floating-point algorithms",
  crossref =     "Griffiths:1984:NAP",
  pages =        "186--202",
  year =         "1984",
  DOI =          "https://doi.org/10.1007/BFb0099525",
  MRclass =      "65V05 (65B05 65G05)",
  MRnumber =     "86j:65188",
  bibdate =      "Fri Dec 8 08:24:13 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: fparith.bib
label: Stewart:1984:PWG
author: R. G. Stewart
title: P854 Working Group Completes Radix-Independent Floating-Point Draft
journal: j-IEEE-MICRO
volume: 4
number: 1
pages: 82--83
month: jan
monthnumber: 1
year: 1984
CODEN: IEMIDZ
DOI: https://doi.org/10.1109/MM.1984.291326
ISSN: 0272-1732 (print), 1937-4143 (electronic) OR 02721732 (print), 19374143 (electronic)
ISSNL: 0272-1732 OR 02721732
bibdate: Thu Dec 14 06:08:58 MST 2000
bibtimestamp: 2000.12.14 06:08:58 MST
fjournal: IEEE Micro
acknowledgement: ack-nhfb
journalURL: http://www.computer.org/csdl/mags/mi/index.html
rawauthor: R. G. Stewart
rawtitle: {P854} Working Group Completes Radix-Independent Floating-Point Draft
bibsource:
https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; Science Citation Index database (1980--2000)

entry:
@Article{Stewart:1984:PWG,
  author =       "R. G. Stewart",
  title =        "{P854} Working Group Completes Radix-Independent
                 Floating-Point Draft",
  journal =      j-IEEE-MICRO,
  volume =       "4",
  number =       "1",
  pages =        "82--83",
  month =        jan # "\slash " # feb,
  year =         "1984",
  CODEN =        "IEMIDZ",
  DOI =          "https://doi.org/10.1109/MM.1984.291326",
  ISSN =         "0272-1732 (print), 1937-4143 (electronic)",
  ISSN-L =       "0272-1732",
  bibdate =      "Thu Dec 14 06:08:58 MST 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
                 Science Citation Index database (1980--2000)",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Micro",
  journal-URL =  "http://www.computer.org/csdl/mags/mi/index.html",
}


bibtype: article
filename: fparith.bib
label: Takla:1984:MBF
author: N. Takla and M. Hecker
title: A Monolithic 64 Bit Floating-Point Coprocessor
journal: j-IEEE-J-SOLID-STATE-CIRCUITS
volume: SC-19
number: 4
pages: 538--539
month: aug
monthnumber: 8
year: 1984
CODEN: IJSCBC
ISSN: 0018-9200 (print), 1558-173X (electronic) OR 00189200 (print), 1558173X (electronic)
ISSNL: 0018-9200 OR 00189200
bibdate: Sat Jul 16 08:40:53 MDT 2005
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2005.07.16 08:40:53 MDT
fjournal: IEEE Journal of Solid-State Circuits
acknowledgement: ack-nj
rawauthor: N. Takla and M. Hecker
rawtitle: A Monolithic 64 Bit Floating-Point Coprocessor
entry:
@Article{Takla:1984:MBF,
  author =       "N. Takla and M. Hecker",
  title =        "A Monolithic 64 Bit Floating-Point Coprocessor",
  journal =      j-IEEE-J-SOLID-STATE-CIRCUITS,
  volume =       "SC-19",
  number =       "4",
  pages =        "538--539",
  month =        aug,
  year =         "1984",
  CODEN =        "IJSCBC",
  ISSN =         "0018-9200 (print), 1558-173X (electronic)",
  ISSN-L =       "0018-9200",
  bibdate =      "Sat Jul 16 08:40:53 MDT 2005",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj # " and " # ack-nhfb,
  fjournal =     "IEEE Journal of Solid-State Circuits",
  summary =      "A double/single-precision floating-point processor
                 using a titanium disilicide 3.5-$\mu$m NMOS process
                 achieves double-precision add/subtract, multiply, and
                 divide in 2, 8, and 16 $\mu$s respectively. The chip
                 has about 35K devices and is about \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Taylor:1984:BFP
author: F. Taylor
title: Block floating-point distributed filters
journal: j-IEEE-TRANS-CIRCUITS-SYST
volume: 31
number: 3
pages: 300--304
month: mar
monthnumber: 3
year: 1984
CODEN: ICSYBT
ISSN: 0098-4094 (print), 1558-1276 (electronic) OR 00984094 (print), 15581276 (electronic)
ISSNL: 0098-4094 OR 00984094
bibdate: Sat Jul 16 08:40:53 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2005.07.16 08:40:53 MDT
fjournal: IEEE Transactions on Circuits and Systems
acknowledgement: ack-nhfb
rawauthor: F. Taylor
rawtitle: Block floating-point distributed filters
entry:
@Article{Taylor:1984:BFP,
  author =       "F. Taylor",
  title =        "Block floating-point distributed filters",
  journal =      j-IEEE-TRANS-CIRCUITS-SYST,
  volume =       "31",
  number =       "3",
  pages =        "300--304",
  month =        mar,
  year =         "1984",
  CODEN =        "ICSYBT",
  ISSN =         "0098-4094 (print), 1558-1276 (electronic)",
  ISSN-L =       "0098-4094",
  bibdate =      "Sat Jul 16 08:40:53 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Circuits and Systems",
  summary =      "Distributed filters have been shown to offer an
                 impressive complexity-throughput tradeoff. In this
                 correspondence, a precision improvement is made in
                 distributed filtering using block floating-point
                 arithmetic. Performance improvement is predicted
                 \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Taylor:1984:RAT
author: Fred J. Taylor
title: Residue Arithmetic: a Tutorial with Examples
journal: j-COMPUTER
volume: 17
number: 5
pages: 50--62
month: may
monthnumber: 5
year: 1984
CODEN: CPTRB4
DOI: https://doi.org/10.1109/MC.1984.1659138
ISSN: 0018-9162 (print), 1558-0814 (electronic) OR 00189162 (print), 15580814 (electronic)
ISSNL: 0018-9162 OR 00189162
bibdate: Thu Nov 13 07:15:07 2025
bibtimestamp: 2025.11.13 07:15:07 ???
fjournal: Computer
acknowledgement: ack-nhfb
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2
rawauthor: Fred J. Taylor
rawtitle: Residue Arithmetic: a Tutorial with Examples
keywords:
Arithmetic; Cathode ray tubes; Digital arithmetic; Digital systems; Gaussian processes; Parallel processing; Real time systems; Tutorials

entry:
@Article{Taylor:1984:RAT,
  author =       "Fred J. Taylor",
  title =        "Residue Arithmetic: a Tutorial with Examples",
  journal =      j-COMPUTER,
  volume =       "17",
  number =       "5",
  pages =        "50--62",
  month =        may,
  year =         "1984",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.1984.1659138",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Thu Nov 13 07:15:07 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computer1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
  keywords =     "Arithmetic; Cathode ray tubes; Digital arithmetic;
                 Digital systems; Gaussian processes; Parallel
                 processing; Real time systems; Tutorials",
}


bibtype: inproceedings
filename: fparith.bib
label: Teufel:1984:HAO
author: Thomas Teufel
title: A hardware architecture of an optimal BCD-floating-point processor
crossref: Feilmeier:1984:PCP
pages: 553--560
year: 1984
MRclass: 65G05
MRnumber: 86j:65055
bibdate: Mon Apr 14 17:57:50 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1997.04.14 17:57:50 ???
acknowledgement: ack-nhfb
rawauthor: Thomas Teufel
rawtitle: A hardware architecture of an optimal {BCD}-floating-point processor
entry:
@InProceedings{Teufel:1984:HAO,
  author =       "Thomas Teufel",
  title =        "A hardware architecture of an optimal
                 {BCD}-floating-point processor",
  crossref =     "Feilmeier:1984:PCP",
  pages =        "553--560",
  year =         "1984",
  MRclass =      "65G05",
  MRnumber =     "86j:65055",
  bibdate =      "Mon Apr 14 17:57:50 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
}


bibtype: phdthesis
filename: fparith.bib
label: Teufel:1984:OG
author: T. Teufel
title: Ein optimaler Gleitkommaprozessor toenglish An Optimal Floating-Point Processor endtoenglish
type: Dissertation
school: Universitat Karlsruhe
address: Karlsruhe, Germany
year: 1984
bibdate: Fri Sep 16 16:30:40 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.16 16:30:40 ???
acknowledgement: ack-nj
rawauthor: T. Teufel
rawtitle: {Ein optimaler Gleitkommaprozessor} \toenglish {An Optimal Floating-Point Processor} \endtoenglish
entry:
@PhdThesis{Teufel:1984:OG,
  author =       "T. Teufel",
  title =        "{Ein optimaler Gleitkommaprozessor} \toenglish {An
                 Optimal Floating-Point Processor} \endtoenglish",
  type =         "Dissertation",
  school =       "Universit{\"a}t Karlsruhe",
  address =      "Karlsruhe, Germany",
  pages =        "??",
  year =         "1984",
  bibdate =      "Fri Sep 16 16:30:40 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
}


bibtype: article
filename: fparith.bib
label: Tricker:1984:ERM
author: A. R. Tricker
title: Effects of Rounding on the Moments of a Probability Distribution
journal: j-J-R-STAT-SOC-SER-D-STATISTICIAN
volume: 33
number: 4
pages: 381--390
month: dec
monthnumber: 12
year: 1984
DOI: https://doi.org/10.2307/2987741
ISSN: 0039-0526 (print), 1467-9884 (electronic) OR 00390526 (print), 14679884 (electronic)
ISSNL: 0039-0526 OR 00390526
bibdate: Thu Jan 22 18:10:22 MST 2015
bibtimestamp: 2015.01.22 18:10:22 MST
URL: http://www.jstor.org/stable/2987741
fjournal: Journal of the Royal Statistical Society. Series D (The Statistician)
acknowledgement: ack-nhfb
journalURL: http://www.jstor.org/journals/00390526.html
rawauthor: A. R. Tricker
rawtitle: Effects of Rounding on the Moments of a Probability Distribution
bibsource:
http://www.jstor.org/stable/i349978; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/jrss-d-1980.bib

entry:
@Article{Tricker:1984:ERM,
  author =       "A. R. Tricker",
  title =        "Effects of Rounding on the Moments of a Probability
                 Distribution",
  journal =      j-J-R-STAT-SOC-SER-D-STATISTICIAN,
  volume =       "33",
  number =       "4",
  pages =        "381--390",
  month =        dec,
  year =         "1984",
  CODEN =        "????",
  DOI =          "https://doi.org/10.2307/2987741",
  ISSN =         "0039-0526 (print), 1467-9884 (electronic)",
  ISSN-L =       "0039-0526",
  bibdate =      "Thu Jan 22 18:10:22 MST 2015",
  bibsource =    "http://www.jstor.org/stable/i349978;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/jrss-d-1980.bib",
  URL =          "http://www.jstor.org/stable/2987741",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series D
                 (The Statistician)",
  journal-URL =  "http://www.jstor.org/journals/00390526.html",
}


bibtype: mastersthesis
filename: fparith.bib
label: Trivedi:1984:DVF
author: Mrugesh Popatlal Trivedi
title: Dianostics of VLSI floating-point processors
type: Thesis (M.S.)
school: The University of Tennessee, Knoxville
address: Knoxville, TN, USA
pages: viii + 98
year: 1984
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
keywords: Electronic digital computers --- Programming.; Floating-point arithmetic.
acknowledgement: ack-nhfb
rawauthor: Mrugesh Popatlal Trivedi
rawtitle: Dianostics of {VLSI} floating-point processors
entry:
@MastersThesis{Trivedi:1984:DVF,
  author =       "Mrugesh Popatlal Trivedi",
  title =        "Dianostics of {VLSI} floating-point processors",
  type =         "Thesis ({M.S.})",
  school =       "The University of Tennessee, Knoxville",
  address =      "Knoxville, TN, USA",
  pages =        "viii + 98",
  year =         "1984",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Electronic digital computers --- Programming.;
                 Floating-point arithmetic.",
}


bibtype: mastersthesis
filename: fparith.bib
label: Truong:1984:FPP
author: Hung Si Truong
title: A floating point processor
type: Project (M.S., Electrical and Electronic Engineering)
school: California State University
address: Sacramento, CA, USA
pages: viii + 81
year: 1984
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
note: Charles Lytle, Chairperson
keywords: Floating-point arithmetic.
acknowledgement: ack-nhfb
rawauthor: Hung Si Truong
rawnote: Charles Lytle, Chairperson
rawtitle: A floating point processor
entry:
@MastersThesis{Truong:1984:FPP,
  author =       "Hung Si Truong",
  title =        "A floating point processor",
  type =         "Project ({M.S., Electrical and Electronic
                 Engineering})",
  school =       "California State University",
  address =      "Sacramento, CA, USA",
  pages =        "viii + 81",
  year =         "1984",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "Charles Lytle, Chairperson",
  acknowledgement = ack-nhfb,
  keywords =     "Floating-point arithmetic.",
}


bibtype: article
filename: fparith.bib
label: Uya:1984:CFP
author: M. Uya and K. Kaneko and J. Yasui
title: A CMOS floating point multiplier
journal: j-IEEE-J-SOLID-STATE-CIRCUITS
volume: 19
number: 5
pages: 697--702
month: oct
monthnumber: 10
year: 1984
CODEN: IJSCBC
ISSN: 0018-9200 (print), 1558-173X (electronic) OR 00189200 (print), 1558173X (electronic)
ISSNL: 0018-9200 OR 00189200
bibdate: Sat Jul 16 08:40:53 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2005.07.16 08:40:53 MDT
fjournal: IEEE Journal of Solid-State Circuits
acknowledgement: ack-nhfb
rawauthor: M. Uya and K. Kaneko and J. Yasui
rawtitle: A {CMOS} floating point multiplier
entry:
@Article{Uya:1984:CFP,
  author =       "M. Uya and K. Kaneko and J. Yasui",
  title =        "A {CMOS} floating point multiplier",
  journal =      j-IEEE-J-SOLID-STATE-CIRCUITS,
  volume =       "19",
  number =       "5",
  pages =        "697--702",
  month =        oct,
  year =         "1984",
  CODEN =        "IJSCBC",
  ISSN =         "0018-9200 (print), 1558-173X (electronic)",
  ISSN-L =       "0018-9200",
  bibdate =      "Sat Jul 16 08:40:53 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Journal of Solid-State Circuits",
  summary =      "A 32-bit CMOS floating-point multiplier is described.
                 The chip can perform 32-bit floating-point
                 multiplication (based on the proposed IEEE Standard
                 format) and 24-bit fixed-point multiplication (two's
                 complement format) in less than 78.7 and 71.1 ns
                 \ldots{}",
}


bibtype: article
filename: fparith.bib
label: vonGudenberg:1984:BMG
author: J. Wolff von Gudenberg
journal: j-ELEK-RECHENANLAGEN
volume: 26
number: 5
pages: 230--238
month: oct
monthnumber: 10
year: 1984
CODEN: ELRAA4
ISSN: 0013-5720 OR 00135720
bibdate: Sat Feb 10 12:41:08 1996
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.10 12:41:08 ???
fjournal: Elektronische Rechenanlagen
acknowledgement: ack-nj
rawauthor: J. Wolff von Gudenberg
title:
Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenlange toenglish Computation of Maximally Accurate Elementary Functions Using Simple Mantissa Length endtoenglish 

rawtitle:
{Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenl{\"a}nge} \toenglish {Computation of Maximally Accurate Elementary Functions Using Simple Mantissa Length} \endtoenglish

entry:
@Article{vonGudenberg:1984:BMG,
  author =       "J. Wolff von Gudenberg",
  title =        "{Berechnung maximal genauer Standardfunktionen mit
                 einfacher Mantissenl{\"a}nge} \toenglish {Computation
                 of Maximally Accurate Elementary Functions Using Simple
                 Mantissa Length} \endtoenglish",
  journal =      j-ELEK-RECHENANLAGEN,
  volume =       "26",
  number =       "5",
  pages =        "230--238",
  month =        oct,
  year =         "1984",
  CODEN =        "ELRAA4",
  ISSN =         "0013-5720",
  bibdate =      "Sat Feb 10 12:41:08 1996",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "Elektronische Rechenanlagen",
}


bibtype: incollection
filename: fparith.bib
label: Ware:1984:CMC
author: F. Ware and W. McAllister
title: C-MOS chip set streamlines floating-point processing
crossref: Evanczuk:1984:MSS
pages: 374--377
year: 1984
bibdate: Sat Nov 9 08:26:18 MST 2002
bibsource: ACM Computing Archive CD-ROM database (1991); https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2002.11.09 08:26:18 MST
acknowledgement: ack-nhfb
rawauthor: F. Ware and W. McAllister
rawtitle: {C-MOS} chip set streamlines floating-point processing
subject:
G. Mathematics of Computing; G.1 NUMERICAL ANALYSIS; C. Computer Systems Organization; C.5 COMPUTER SYSTEM IMPLEMENTATION; C. Computer Systems Organization; C.5 COMPUTER SYSTEM IMPLEMENTATION

entry:
@InCollection{Ware:1984:CMC,
  author =       "F. Ware and W. McAllister",
  title =        "{C-MOS} chip set streamlines floating-point
                 processing",
  crossref =     "Evanczuk:1984:MSS",
  pages =        "374--377",
  year =         "1984",
  bibdate =      "Sat Nov 9 08:26:18 MST 2002",
  bibsource =    "ACM Computing Archive CD-ROM database (1991);
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  catcode =      "G.1.0; C.5; C.5",
  CRclass =      "G.1.0 General; G.1.0 Computer arithmetic; C.5.3
                 Microcomputers; C.5.4 VLSI Systems",
  descriptor =   "Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Computer arithmetic; Computer Systems Organization,
                 COMPUTER SYSTEM IMPLEMENTATION, Microcomputers;
                 Computer Systems Organization, COMPUTER SYSTEM
                 IMPLEMENTATION, VLSI Systems",
  genterm =      "DESIGN",
  guideno =      "00769",
  subject =      "G. Mathematics of Computing; G.1 NUMERICAL ANALYSIS;
                 C. Computer Systems Organization; C.5 COMPUTER SYSTEM
                 IMPLEMENTATION; C. Computer Systems Organization; C.5
                 COMPUTER SYSTEM IMPLEMENTATION",
}


bibtype: mastersthesis
filename: fparith.bib
label: Wehmeyer:1984:EFF
author: Keith R. Wehmeyer
title: Effects of fixed and floating point mathematics on digital filters
type: Thesis (M.S.)
school: University of Cincinnati
address: Cincinnati, OH, USA
pages: vi + 92
year: 1984
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
keywords: University of Cincinnati --- Theses. M.S. (Electrical and Computer Engineering (1984))
acknowledgement: ack-nhfb
rawauthor: Keith R. Wehmeyer
rawtitle: Effects of fixed and floating point mathematics on digital filters
entry:
@MastersThesis{Wehmeyer:1984:EFF,
  author =       "Keith R. Wehmeyer",
  title =        "Effects of fixed and floating point mathematics on
                 digital filters",
  type =         "Thesis ({M.S.})",
  school =       "University of Cincinnati",
  address =      "Cincinnati, OH, USA",
  pages =        "vi + 92",
  year =         "1984",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "University of Cincinnati --- Theses. M.S. (Electrical
                 and Computer Engineering (1984))",
}


bibtype: article
filename: fparith.bib
label: Wolrich:1984:HPF
author: G. Wolrich and E. McLellan and L. Harada and J. Montanaro and R. A. J. Yodlowski
title: A High Performance Floating Point Coprocessor
journal: j-IEEE-J-SOLID-STATE-CIRCUITS
volume: SC-19
number: 5
pages: 690--696
month: oct
monthnumber: 10
year: 1984
CODEN: IJSCBC
ISSN: 0018-9200 (print), 1558-173X (electronic) OR 00189200 (print), 1558173X (electronic)
ISSNL: 0018-9200 OR 00189200
bibdate: Sat Jul 16 08:40:53 MDT 2005
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2005.07.16 08:40:53 MDT
fjournal: IEEE Journal of Solid-State Circuits
acknowledgement: ack-nj
rawauthor: G. Wolrich and E. McLellan and L. Harada and J. Montanaro and R. A. J. Yodlowski
rawtitle: A High Performance Floating Point Coprocessor
entry:
@Article{Wolrich:1984:HPF,
  author =       "G. Wolrich and E. McLellan and L. Harada and J.
                 Montanaro and R. A. J. Yodlowski",
  title =        "A High Performance Floating Point Coprocessor",
  journal =      j-IEEE-J-SOLID-STATE-CIRCUITS,
  volume =       "SC-19",
  number =       "5",
  pages =        "690--696",
  month =        oct,
  year =         "1984",
  CODEN =        "IJSCBC",
  ISSN =         "0018-9200 (print), 1558-173X (electronic)",
  ISSN-L =       "0018-9200",
  bibdate =      "Sat Jul 16 08:40:53 MDT 2005",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj # " and " # ack-nhfb,
  fjournal =     "IEEE Journal of Solid-State Circuits",
  summary =      "A 34000-transistor single-chip floating-point
                 coprocessor fabricated in 3-$\mu$m double metal NMOS
                 technology is described. The fraction data path,
                 including a shifter and 60-bit carry propagate ALU, is
                 cycled in 100 ns for all operations requiring
                 \ldots{}",
}


bibtype: incollection
filename: fparith.bib
label: Woo:1984:AMC
author: B. Woo and L. Lin and R. E. Owen
title: ALU, multiplier chips zip through IEEE floating-point operations
crossref: Evanczuk:1984:MSS
pages: 354--359
year: 1984
bibdate: Sat Nov 9 08:26:18 MST 2002
bibsource: ACM Computing Archive CD-ROM database (1991); https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2002.11.09 08:26:18 MST
acknowledgement: ack-nhfb
rawauthor: B. Woo and L. Lin and R. E. Owen
rawtitle: {ALU}, multiplier chips zip through {IEEE} floating-point operations
subject:
C. Computer Systems Organization; C.1 PROCESSOR ARCHITECTURES; G. Mathematics of Computing; G.1 NUMERICAL ANALYSIS

entry:
@InCollection{Woo:1984:AMC,
  author =       "B. Woo and L. Lin and R. E. Owen",
  title =        "{ALU}, multiplier chips zip through {IEEE}
                 floating-point operations",
  crossref =     "Evanczuk:1984:MSS",
  pages =        "354--359",
  year =         "1984",
  bibdate =      "Sat Nov 9 08:26:18 MST 2002",
  bibsource =    "ACM Computing Archive CD-ROM database (1991);
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  catcode =      "C.1.2; G.1.0",
  CRclass =      "C.1.2 Multiple Data Stream Architectures
                 (Multiprocessors); C.1.2 Pipeline processors; G.1.0
                 General; G.1.0 Computer arithmetic",
  descriptor =   "Computer Systems Organization, PROCESSOR
                 ARCHITECTURES, Multiple Data Stream Architectures
                 (Multiprocessors), Pipeline processors; Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Computer
                 arithmetic",
  genterm =      "DESIGN",
  guideno =      "00766",
  subject =      "C. Computer Systems Organization; C.1 PROCESSOR
                 ARCHITECTURES; G. Mathematics of Computing; G.1
                 NUMERICAL ANALYSIS",
}


bibtype: book
filename: fparith.bib
label: Zuse:1984:CML
author: Konrad Zuse
title: Der Computer, mein Lebenswerk
publisher: pub-SV
address: pub-SV:adr
pages: xv + 218
year: 1984
ISBN: 0-387-13814-5 (U.S.) OR 0387138145 (U.S.)
ISBN13: 978-0-387-13814-5 (U.S.) OR 9780387138145 (U.S.)
LCCN: TK7885.22.Z87 A33 1984
bibdate: Mon Nov 4 07:46:57 MST 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2002.11.04 07:46:57 MST
note: Based on the author's autobiography with the same title published in 1970.
keywords: computer engineers --- Germany --- biography; computers --- Germany --- history; Zuse, Konrad
acknowledgement: ack-nhfb
rawauthor: Konrad Zuse
rawnote: Based on the author's autobiography with the same title published in 1970.
rawtitle: {Der Computer, mein Lebenswerk}
entry:
@Book{Zuse:1984:CML,
  author =       "Konrad Zuse",
  title =        "{Der Computer, mein Lebenswerk}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 218",
  year =         "1984",
  ISBN =         "0-387-13814-5 (U.S.)",
  ISBN-13 =      "978-0-387-13814-5 (U.S.)",
  LCCN =         "TK7885.22.Z87 A33 1984",
  bibdate =      "Mon Nov 4 07:46:57 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "Based on the author's autobiography with the same
                 title published in 1970.",
  acknowledgement = ack-nhfb,
  keywords =     "computer engineers --- Germany --- biography;
                 computers --- Germany --- history; Zuse, Konrad",
}


bibtype: book
filename: fparith.bib
label: Ahmed:1985:AAU
author: H. M. Ahmed
title: Alternative arithmetic unit architectures for VLSI digital signal processors
publisher: Prentice-Hall
address: Englewood Cliffs, NJ, USA
year: 1985
bibdate: Wed Oct 29 10:25:39 2025
bibsource: https://www.math.utah.edu/pub/tex/bib/cordic.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2025.10.29 10:25:39 ???
acknowledgement: ack-nhfb
rawauthor: H. M. Ahmed
rawtitle: Alternative arithmetic unit architectures for {VLSI} digital signal processors
entry:
@Book{Ahmed:1985:AAU,
  author =       "H. M. Ahmed",
  title =        "Alternative arithmetic unit architectures for {VLSI}
                 digital signal processors",
  publisher =    "Prentice-Hall",
  address =      "Englewood Cliffs, NJ, USA",
  pages =        "",
  year =         "1985",
  DOI =          "",
  ISBN =         "",
  ISBN-13 =      "",
  LCCN =         "",
  bibdate =      "Wed Oct 29 10:25:39 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: fparith.bib
label: Aridgides:1985:EIQ
author: A. Aridgides and D. Morgan
title: Effects of input quantization in floating-point digital pulse compression
journal: j-IEEE-TRANS-ACOUST-SPEECH
volume: 33
number: 2
pages: 434--435
month: apr
monthnumber: 4
year: 1985
CODEN: IETABA
ISSN: 0096-3518 OR 00963518
bibdate: Sat Jul 16 08:40:53 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2005.07.16 08:40:53 MDT
fjournal: IEEE Transactions on Acoustics, Speech, and Signal Processing
acknowledgement: ack-nhfb
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=29
rawauthor: A. Aridgides and D. Morgan
rawtitle: Effects of input quantization in floating-point digital pulse compression
entry:
@Article{Aridgides:1985:EIQ,
  author =       "A. Aridgides and D. Morgan",
  title =        "Effects of input quantization in floating-point
                 digital pulse compression",
  journal =      j-IEEE-TRANS-ACOUST-SPEECH,
  volume =       "33",
  number =       "2",
  pages =        "434--435",
  month =        apr,
  year =         "1985",
  CODEN =        "IETABA",
  ISSN =         "0096-3518",
  bibdate =      "Sat Jul 16 08:40:53 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Acoustics, Speech, and Signal
                 Processing",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=29",
  summary =      "A computer simulation of an FFT-based digital LFM
                 pulse compressor using vector floating point arithmetic
                 is presented, showing the effects of retaining various
                 number of mantissa bits at the input quantizer. Plots
                 of the compressed pulse waveforms \ldots{}",
}


bibtype: techreport
filename: fparith.bib
label: Armstrong:1985:PLHa
author: Robert Clyde Armstrong
title: Procedural layout of a high-speed floating-point arithmetic unit
institution: Massachusetts Institute of Technology, Research Laboratory of Electronics
address: Cambridge, MA, USA
pages: 116
year: 1985
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
acknowledgement: ack-nhfb
rawauthor: Robert Clyde Armstrong
rawtitle: Procedural layout of a high-speed floating-point arithmetic unit
series:
Technical report; no 508 Technical report (Massachusetts Institute of Technology. Research Laboratory of Electronics); no. 508.

remark:
Originally presented as author's thesis (Electrical Engineer --- Massachusetts Institute of Technology) 1985. Bibliography: leaf 116. Supported in part by the U.S. Air Force Office of Scientific Research contract

entry:
@TechReport{Armstrong:1985:PLHa,
  author =       "Robert Clyde Armstrong",
  title =        "Procedural layout of a high-speed floating-point
                 arithmetic unit",
  institution =  "Massachusetts Institute of Technology, Research
                 Laboratory of Electronics",
  address =      "Cambridge, MA, USA",
  pages =        "116",
  year =         "1985",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  series =       "Technical report; no 508 Technical report
                 (Massachusetts Institute of Technology. Research
                 Laboratory of Electronics); no. 508.",
  acknowledgement = ack-nhfb,
  remark =       "Originally presented as author's thesis (Electrical
                 Engineer --- Massachusetts Institute of Technology)
                 1985. Bibliography: leaf 116. Supported in part by the
                 U.S. Air Force Office of Scientific Research contract",
}


bibtype: phdthesis
filename: fparith.bib
label: Armstrong:1985:PLHb
author: Robert Clyde Armstrong
title: Procedural layout of a high-speed floating-point arithmetic unit
type: Thesis (Elect. E.)
school: Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science
address: Cambridge, MA, USA
pages: 116
year: 1985
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
note: Supervised by Jonathan Allen.
acknowledgement: ack-nhfb
rawauthor: Robert Clyde Armstrong
rawnote: Supervised by Jonathan Allen.
rawtitle: Procedural layout of a high-speed floating-point arithmetic unit
entry:
@PhdThesis{Armstrong:1985:PLHb,
  author =       "Robert Clyde Armstrong",
  title =        "Procedural layout of a high-speed floating-point
                 arithmetic unit",
  type =         "Thesis ({Elect. E.})",
  school =       "Massachusetts Institute of Technology. Dept. of
                 Electrical Engineering and Computer Science",
  address =      "Cambridge, MA, USA",
  pages =        "116",
  year =         "1985",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "Supervised by Jonathan Allen.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: fparith.bib
label: Aspinwall:1985:RVM
author: D. B. Aspinwall and Y. N. Patt
journal: j-IEEE-TRANS-COMPUT
volume: C-34
number: 8
pages: 692--708
month: aug
monthnumber: 8
year: 1985
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1985.1676615
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 08:33:17 MDT 2011
bibtimestamp: 2011.07.10 08:33:17 MDT
URL: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676615
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: D. B. Aspinwall and Y. N. Patt
title:
Retrofitting the VAX-11 / 780 Microarchitecture for IEEE Floating Point Arithmetic --- Implementation Issues, Measurements, and Analysis

abstract:
The VAX-11/7801 was designed specifically to implement the VAX architecture. As such, it does not support the IEEE standard for floating point arithmetic. A project was undertaken to provide this support by modifying the 11/780 microarchitecture. Our objective was to produce a microengine that would efficiently execute the VAX instruction set, modified to handle VAX floating point instructions in accordance with the IEEE standard. Our methodology was to make minimal changes to the 11/780 hardware, relying primarily on changes to the microcode. This paper describes the modifications required to implement the IEEE standard, examines the various design alternatives available to us, presents measurements of our implementation, and analyzes our results. We also offer some comments on the matter of retrofitting an existing architecture to a new unintended use.

rawabstract:
The VAX-11/7801 was designed specifically to implement the VAX architecture. As such, it does not support the IEEE standard for floating point arithmetic. A project was undertaken to provide this support by modifying the 11/780 microarchitecture. Our objective was to produce a microengine that would efficiently execute the VAX instruction set, modified to handle VAX floating point instructions in accordance with the IEEE standard. Our methodology was to make minimal changes to the 11/780 hardware, relying primarily on changes to the microcode. This paper describes the modifications required to implement the IEEE standard, examines the various design alternatives available to us, presents measurements of our implementation, and analyzes our results. We also offer some comments on the matter of retrofitting an existing architecture to a new unintended use.

rawtitle:
Retrofitting the {VAX-11\slash 780} Microarchitecture for {IEEE} Floating Point Arithmetic --- Implementation Issues, Measurements, and Analysis

entry:
@Article{Aspinwall:1985:RVM,
  author =       "D. B. Aspinwall and Y. N. Patt",
  title =        "Retrofitting the {VAX-11\slash 780} Microarchitecture
                 for {IEEE} Floating Point Arithmetic --- Implementation
                 Issues, Measurements, and Analysis",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-34",
  number =       "8",
  pages =        "692--708",
  month =        aug,
  year =         "1985",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1985.1676615",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 08:33:17 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  URL =          "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676615",
  abstract =     "The VAX-11/7801 was designed specifically to implement
                 the VAX architecture. As such, it does not support the
                 IEEE standard for floating point arithmetic. A project
                 was undertaken to provide this support by modifying the
                 11/780 microarchitecture. Our objective was to produce
                 a microengine that would efficiently execute the VAX
                 instruction set, modified to handle VAX floating point
                 instructions in accordance with the IEEE standard. Our
                 methodology was to make minimal changes to the 11/780
                 hardware, relying primarily on changes to the
                 microcode. This paper describes the modifications
                 required to implement the IEEE standard, examines the
                 various design alternatives available to us, presents
                 measurements of our implementation, and analyzes our
                 results. We also offer some comments on the matter of
                 retrofitting an existing architecture to a new
                 unintended use.",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: article
filename: fparith.bib
label: Auzinger:1985:AAR
author: W. Auzinger and H. J. Stetter
title: Accurate arithmetic results for decimal data on non-decimal computers
journal: Computing (New York)
volume: 35
number: 2
pages: 141--151
year: 1985
bibdate: Sat Nov 9 08:26:18 MST 2002
bibsource: ACM Computing Archive CD-ROM database (1991); https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2002.11.09 08:26:18 MST
keywords: decimal floating-point arithmetic
subject: G. Mathematics of Computing; G.1 NUMERICAL ANALYSIS
acknowledgement: ack-nhfb
reviewer: J. Oliver
rawauthor: W. Auzinger and H. J. Stetter
rawtitle: Accurate arithmetic results for decimal data on non-decimal computers
entry:
@Article{Auzinger:1985:AAR,
  author =       "W. Auzinger and H. J. Stetter",
  title =        "Accurate arithmetic results for decimal data on
                 non-decimal computers",
  journal =      "Computing (New York)",
  volume =       "35",
  number =       "2",
  pages =        "141--151",
  year =         "1985",
  CODEN =        "????",
  bibdate =      "Sat Nov 9 08:26:18 MST 2002",
  bibsource =    "ACM Computing Archive CD-ROM database (1991);
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  catcode =      "G.1.0",
  content =      "One potentially useful feature absent from the High
                 Accuracy Arithmetic Subroutine Library (ACRITH) is the
                 generation of tight and guaranteed bounds on the
                 computed solution of numerical problems in cases where
                 some of the original data values are not representable
                 exactly as machine numbers. At present, such data
                 values must be replaced by enclosing machine intervals;
                 for ill-conditioned problems, the final interval
                 defining the solution may be relatively wide.\par

                 The authors here discuss the implementation of some
                 earlier ideas of Stetter's [1], relating to the
                 coupling of a conversion procedure for decimal data to
                 the evaluation algorithm proper, with the objective of
                 generating much narrower inclusions. A clear indication
                 of how this might be done is presented by means of an
                 illustrative example. A detailed specification is given
                 for a linear equation solver which should compute last
                 bit accurate inclusions of the solution for decimal
                 data using a hexadecimal machine. Also included are
                 four varied numerical examples, for which the results
                 are most impressive, and which appear to justify the
                 authors' claim. \par

                 -J. Oliver, Essex, UK \par

                 REFERENCES \par

                 [1] STETTER, H. J. Sequential defect correction for
                 high-accuracy floating-point algorithms, in Numerical
                 analysis, Proc. of the conference (Dundee, 1983),
                 Springer-Verlag",
  CRclass =      "G.1.0 General; G.1.0 Computer arithmetic",
  CRnumber =     "8607-0617",
  descriptor =   "Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Computer arithmetic",
  genterm =      "THEORY; ALGORITHMS",
  guideno =      "04640",
  keywords =     "decimal floating-point arithmetic",
  reviewer =     "J. Oliver",
  subject =      "G. Mathematics of Computing; G.1 NUMERICAL ANALYSIS",
}


bibtype: inproceedings
filename: fparith.bib
label: Avizienis:1985:AAO
author: Algirdas Avizienis
title: Arithmetic Algorithms for Operands Encoded in Two-Dimensional Low-Cost Arithmetic Error Code
crossref: Hwang:1985:PSC
pages: 285--292
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Avizienis.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Algirdas Avi{\v{z}}ienis
rawtitle: Arithmetic Algorithms for Operands Encoded in Two-Dimensional Low-Cost Arithmetic Error Code
abstract:
A generalization of low-cost residue codes into two-dimensional encodings was presented and error detecting and error correcting properties of two dimensional inverse residue codes were discussed previously. This paper presents byte-serial checking, additive inverse (complementation), and addition algorithms for operands encoded in two-dimensional residue and inverse residue codes.

rawabstract:
A generalization of low-cost residue codes into two-dimensional encodings was presented and error detecting and error correcting properties of two dimensional inverse residue codes were discussed previously. This paper presents byte-serial checking, additive inverse (complementation), and addition algorithms for operands encoded in two-dimensional residue and inverse residue codes.

entry:
@InProceedings{Avizienis:1985:AAO,
  author =       "Algirdas Avi{\v{z}}ienis",
  title =        "Arithmetic Algorithms for Operands Encoded in
                 Two-Dimensional Low-Cost Arithmetic Error Code",
  crossref =     "Hwang:1985:PSC",
  pages =        "285--292",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Avizienis.pdf",
  abstract =     "A generalization of low-cost residue codes into
                 two-dimensional encodings was presented and error
                 detecting and error correcting properties of two
                 dimensional inverse residue codes were discussed
                 previously. This paper presents byte-serial checking,
                 additive inverse (complementation), and addition
                 algorithms for operands encoded in two-dimensional
                 residue and inverse residue codes.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Bannur:1985:VIS
author: J. Bannur and A. Varma
title: The VLSI Implementation of a Square Root Algorithm
crossref: Hwang:1985:PSC
pages: 159--165
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Bannur_Varma.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: J. Bannur and A. Varma
rawtitle: The {VLSI} Implementation of a Square Root Algorithm
abstract:
VLSI implementation of a square root algorithm is studied. Two possible implementations of the basic nonrestoring algorithm are presented --- the second is more area-efficient and modular than the first. The implementations are simple and easy to control, but, at the same time, are more area-time efficient than many existing designs. A hardware algorithm suited to microprogram implementation is also given. Extension of the algorithms to achieve $ 1 / 2 $-bit precision is discussed.

rawabstract:
VLSI implementation of a square root algorithm is studied. Two possible implementations of the basic nonrestoring algorithm are presented --- the second is more area-efficient and modular than the first. The implementations are simple and easy to control, but, at the same time, are more area-time efficient than many existing designs. A hardware algorithm suited to microprogram implementation is also given. Extension of the algorithms to achieve $ 1 / 2 $-bit precision is discussed.

entry:
@InProceedings{Bannur:1985:VIS,
  author =       "J. Bannur and A. Varma",
  title =        "The {VLSI} Implementation of a Square Root Algorithm",
  crossref =     "Hwang:1985:PSC",
  pages =        "159--165",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Bannur_Varma.pdf",
  abstract =     "VLSI implementation of a square root algorithm is
                 studied. Two possible implementations of the basic
                 nonrestoring algorithm are presented --- the second is
                 more area-efficient and modular than the first. The
                 implementations are simple and easy to control, but, at
                 the same time, are more area-time efficient than many
                 existing designs. A hardware algorithm suited to
                 microprogram implementation is also given. Extension of
                 the algorithms to achieve $ 1 / 2 $-bit precision is
                 discussed.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: article
filename: fparith.bib
label: Barlow:1985:PEA
author: J. L. Barlow and E. H. Bareiss
title: Probabilistic error analysis of Gaussian elimination in floating point and logarithmic arithmetic
journal: j-COMPUTING
volume: 34
number: 4
pages: 349--364
year: 1985
CODEN: CMPTA2
ISSN: 0010-485X (print), 1436-5057 (electronic) OR 0010485X (print), 14365057 (electronic)
ISSNL: 0010-485X OR 0010485X
MRclass: 65G05
MRnumber: 87c:65046
bibdate: Fri Dec 8 08:24:13 1995
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1995.12.08 08:24:13 ???
fjournal: Computing: Archiv fur informatik und numerik
acknowledgement: ack-nhfb
journalURL: http://link.springer.com/journal/607
reviewer: N. N. Abdelmalek
rawauthor: J. L. Barlow and E. H. Bareiss
rawtitle: Probabilistic error analysis of {Gaussian} elimination in floating point and logarithmic arithmetic
entry:
@Article{Barlow:1985:PEA,
  author =       "J. L. Barlow and E. H. Bareiss",
  title =        "Probabilistic error analysis of {Gaussian} elimination
                 in floating point and logarithmic arithmetic",
  journal =      j-COMPUTING,
  volume =       "34",
  number =       "4",
  pages =        "349--364",
  year =         "1985",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65G05",
  MRnumber =     "87c:65046",
  bibdate =      "Fri Dec 8 08:24:13 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing: Archiv f{\"u}r informatik und numerik",
  journal-URL =  "http://link.springer.com/journal/607",
  reviewer =     "N. N. Abdelmalek",
}


bibtype: article
filename: fparith.bib
label: Barlow:1985:RED
author: J. L. Barlow and E. H. Bareiss
title: On Roundoff Error Distributions in Floating Point and Logarithmic Arithmetic
journal: j-COMPUTING
volume: 34
number: 4
pages: 325--347
month: dec
monthnumber: 12
year: 1985
CODEN: CMPTA2
ISSN: 0010-485X (print), 1436-5057 (electronic) OR 0010485X (print), 14365057 (electronic)
ISSNL: 0010-485X OR 0010485X
MRclass: 65G05
MRnumber: 87c:65045
MRreviewer: N. N. Abdelmalek
bibdate: Tue Oct 12 16:33:42 MDT 1999
bibtimestamp: 1999.10.12 16:33:42 MDT
fjournal: Computing
acknowledgement: ack-nhfb
affiliation: Pennsylvania State Univ, Computer Science Dep, University Park, PA, USA
affiliationaddress: USA
journalURL: http://link.springer.com/journal/607
journalabr: Computing (Vienna/New York)
rawauthor: J. L. Barlow and E. H. Bareiss
rawtitle: On Roundoff Error Distributions in Floating Point and Logarithmic Arithmetic
bibsource:
Compendex database; http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X; https://www.math.utah.edu/pub/tex/bib/benfords-law.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; MathSciNet database

keywords:
computer arithmetic; computer metatheory; floating point arithmetic; logarithmic arithmetic; roundoff error distributions

entry:
@Article{Barlow:1985:RED,
  author =       "J. L. Barlow and E. H. Bareiss",
  title =        "On Roundoff Error Distributions in Floating Point and
                 Logarithmic Arithmetic",
  journal =      j-COMPUTING,
  volume =       "34",
  number =       "4",
  pages =        "325--347",
  month =        dec,
  year =         "1985",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65G05",
  MRnumber =     "87c:65045",
  MRreviewer =   "N. N. Abdelmalek",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "Pennsylvania State Univ, Computer Science Dep,
                 University Park, PA, USA",
  affiliationaddress = "USA",
  classification = "723",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Computing (Vienna/New York)",
  keywords =     "computer arithmetic; computer metatheory; floating
                 point arithmetic; logarithmic arithmetic; roundoff
                 error distributions",
}


bibtype: article
filename: fparith.bib
label: Barnes:1985:SFP
author: C. Barnes and Boi Tran and Shu Leung
title: On the statistics of fixed-point roundoff error
journal: j-IEEE-TRANS-ACOUST-SPEECH
volume: 33
number: 3
pages: 595--606
month: jun
monthnumber: 6
year: 1985
CODEN: IETABA
ISSN: 0096-3518 OR 00963518
bibdate: Sat Jul 16 11:25:06 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2005.07.16 11:25:06 MDT
fjournal: IEEE Transactions on Acoustics, Speech, and Signal Processing
acknowledgement: ack-nhfb
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=29
rawauthor: C. Barnes and Boi Tran and Shu Leung
rawtitle: On the statistics of fixed-point roundoff error
entry:
@Article{Barnes:1985:SFP,
  author =       "C. Barnes and Boi Tran and Shu Leung",
  title =        "On the statistics of fixed-point roundoff error",
  journal =      j-IEEE-TRANS-ACOUST-SPEECH,
  volume =       "33",
  number =       "3",
  pages =        "595--606",
  month =        jun,
  year =         "1985",
  CODEN =        "IETABA",
  ISSN =         "0096-3518",
  bibdate =      "Sat Jul 16 11:25:06 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Acoustics, Speech, and Signal
                 Processing",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=29",
  summary =      "Roundoff error after fixed-point multiplication is
                 commonly modeled as uniformly distributed white noise
                 that is uncorrelated with the signal. This paper
                 presents a statistical analysis of fixed-point roundoff
                 error that identifies the conditions \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Bayoumi:1985:HVA
author: M. A. Bayoumi and G. A. Jullien and W. C. Miller
title: Hybrid VLSI architecture of FIR filters using residue number systems
journal: j-ELECT-LETTERS
volume: 21
number: 8
pages: 358--359
day: 11
month: apr
monthnumber: 4
year: 1985
CODEN: ELLEAK
DOI: https://doi.org/10.1049/el:19850252
ISSN: 0013-5194 (print), 1350-911X (electronic) OR 00135194 (print), 1350911X (electronic)
ISSNL: 0013-5194 OR 00135194
bibdate: Fri Nov 9 11:38:58 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.09 11:38:58 MST
URL: https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=4251043
fjournal: Electronics Letters
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220
rawauthor: M. A. Bayoumi and G. A. Jullien and W. C. Miller
rawtitle: Hybrid {VLSI} architecture of {FIR} filters using residue number systems
entry:
@Article{Bayoumi:1985:HVA,
  author =       "M. A. Bayoumi and G. A. Jullien and W. C. Miller",
  title =        "Hybrid {VLSI} architecture of {FIR} filters using
                 residue number systems",
  journal =      j-ELECT-LETTERS,
  volume =       "21",
  number =       "8",
  pages =        "358--359",
  day =          "11",
  month =        apr,
  year =         "1985",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19850252",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Nov 9 11:38:58 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=4251043",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronics Letters",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  keywords =     "residue arithmetic; residue number system",
  summary =      "An efficient VLSI architecture of FIR filters based on
                 large moduli set is described. The structure is hybrid,
                 combining both binary-based elements and look-up
                 tables. The binary-based section is arranged as a
                 two-dimensional systolic array using \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Bittner:1985:WPD
author: L. Bittner
journal: j-Z-ANGE-MATH-MECH
volume: 65
number: 12
pages: 605--612
year: 1985
CODEN: ZAMMAX
ISSN: 0044-2267 (print), 1521-4001 (electronic) OR 00442267 (print), 15214001 (electronic)
ISSNL: 0044-2267 OR 00442267
bibdate: Fri Sep 16 16:30:40 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.16 16:30:40 ???
fjournal: Zeitschrift fur Angewandte Mathematik und Mechanik
acknowledgement: ack-nj
journalURL: http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1521-4001
rawauthor: L. Bittner
title:
Weiteres uber Pseudo-Divisionsverfahren zur Berechnung der Standardfunktionen und gewisser Nicht-Standardfunktionen toenglish Further Details on Pseudo-Division Procedures for Computation of Standard Functions and Certain Nonstandard Functions endtoenglish 

rawtitle:
{Weiteres {\"u}ber Pseudo-Divisionsverfahren zur Berechnung der Standardfunktionen und gewisser Nicht-Stan\-dard\-funk\-tion\-en} \toenglish {Further Details on Pseudo-Division Procedures for Computation of Standard Functions and Certain Nonstandard Functions} \endtoenglish

entry:
@Article{Bittner:1985:WPD,
  author =       "L. Bittner",
  title =        "{Weiteres {\"u}ber Pseudo-Divisionsverfahren zur
                 Berechnung der Standardfunktionen und gewisser
                 Nicht-Stan\-dard\-funk\-tion\-en} \toenglish {Further
                 Details on Pseudo-Division Procedures for Computation
                 of Standard Functions and Certain Nonstandard
                 Functions} \endtoenglish",
  journal =      j-Z-ANGE-MATH-MECH,
  volume =       "65",
  number =       "12",
  pages =        "605--612",
  year =         "1985",
  CODEN =        "ZAMMAX",
  ISSN =         "0044-2267 (print), 1521-4001 (electronic)",
  ISSN-L =       "0044-2267",
  bibdate =      "Fri Sep 16 16:30:40 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "{Zeitschrift f{\"u}r Angewandte Mathematik und
                 Mechanik}",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1521-4001",
  xxmonth =      "(none)",
}


bibtype: inproceedings
filename: fparith.bib
label: Bleher:1985:AHA
author: J. H. Bleher and A. E. Roeder and Siegfried M. Rump
title: ACRITH: High-accuracy arithmetic, an advanced tool for numerical computation
crossref: Hwang:1985:PSC
pages: 318--321
year: 1985
bibdate: Sun May 28 18:31:07 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2006.05.28 18:31:07 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Bleher_Roeder_Rump.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: J. H. Bleher and A. E. Roeder and Siegfried M. Rump
rawtitle: {ACRITH}: High-accuracy arithmetic, an advanced tool for numerical computation
abstract:
The High-Accuracy Arithmetic Subroutine Library (ACRITH) is a program product for engineering / scientific application. It consists of a subroutine library for solving problems in numerical computation. All results obtained have algorithmically verified accuracy.

rawabstract:
The High-Accuracy Arithmetic Subroutine Library (ACRITH) is a program product for engineering / scientific application. It consists of a subroutine library for solving problems in numerical computation. All results obtained have algorithmically verified accuracy.

entry:
@InProceedings{Bleher:1985:AHA,
  author =       "J. H. Bleher and A. E. Roeder and Siegfried M. Rump",
  title =        "{ACRITH}: High-accuracy arithmetic, an advanced tool
                 for numerical computation",
  crossref =     "Hwang:1985:PSC",
  pages =        "318--321",
  year =         "1985",
  bibdate =      "Sun May 28 18:31:07 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Bleher_Roeder_Rump.pdf",
  abstract =     "The High-Accuracy Arithmetic Subroutine Library
                 (ACRITH) is a program product for engineering /
                 scientific application. It consists of a subroutine
                 library for solving problems in numerical computation.
                 All results obtained have algorithmically verified
                 accuracy.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Bohte:1985:GEF
author: Zvonimir Bohte and Marko Petkovsek
title: Gaussian elimination in floating-point arithmetic
crossref: Vrdoljak:1985:ICA
pages: 85--91
year: 1985
MRclass: 65F05 (65G05)
MRnumber: 86m:65028
bibdate: Fri Dec 8 08:24:13 1995
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1995.12.08 08:24:13 ???
acknowledgement: ack-nhfb
rawauthor: Zvonimir Bohte and Marko Petkov{\v{s}}ek
rawtitle: {Gaussian} elimination in floating-point arithmetic
entry:
@InProceedings{Bohte:1985:GEF,
  author =       "Zvonimir Bohte and Marko Petkov{\v{s}}ek",
  title =        "{Gaussian} elimination in floating-point arithmetic",
  crossref =     "Vrdoljak:1985:ICA",
  pages =        "85--91",
  year =         "1985",
  MRclass =      "65F05 (65G05)",
  MRnumber =     "86m:65028",
  bibdate =      "Fri Dec 8 08:24:13 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
}


bibtype: inproceedings
filename: fparith.bib
label: Brent:1985:SAI
author: R. P. Brent and H. T. Kung
title: A Systolic Algorithm for Integer GCD Computation
crossref: Hwang:1985:PSC
pages: 118--125
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Brent_Kung.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: R. P. Brent and H. T. Kung
rawtitle: A Systolic Algorithm for Integer {GCD} Computation
abstract:
It is shown that the greatest common divisor of two $n$-bit integers (given in the usual binary representation) can be computed in time $ O(n) $ on a linear systolic array of $ O(n) $ identical cells.

rawabstract:
It is shown that the greatest common divisor of two $n$-bit integers (given in the usual binary representation) can be computed in time $ O(n) $ on a linear systolic array of $ O(n) $ identical cells.

entry:
@InProceedings{Brent:1985:SAI,
  author =       "R. P. Brent and H. T. Kung",
  title =        "A Systolic Algorithm for Integer {GCD} Computation",
  crossref =     "Hwang:1985:PSC",
  pages =        "118--125",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Brent_Kung.pdf",
  abstract =     "It is shown that the greatest common divisor of two
                 $n$-bit integers (given in the usual binary
                 representation) can be computed in time $ O(n) $ on a
                 linear systolic array of $ O(n) $ identical cells.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: article
filename: fparith.bib
label: Burton:1985:SFE
author: C. G. Burton
title: The solution of finite element equations on the floating point systems FPS-164 attached processor
journal: j-COMP-PHYS-COMM
volume: 37
number: 1-3
pages: 171--180
year: 1985
CODEN: CPHCBZ
ISSN: 0010-4655 (print), 1879-2944 (electronic) OR 00104655 (print), 18792944 (electronic)
ISSNL: 0010-4655 OR 00104655
MRclass: 65N20 (65W05)
MRnumber: 817 063
bibdate: Fri Dec 8 08:24:14 1995
bibtimestamp: 1995.12.08 08:24:14 ???
fjournal: Computer Physics Communications
acknowledgement: ack-nhfb
journalURL: http://www.sciencedirect.com/science/journal/00104655
rawauthor: C. G. Burton
rawtitle: The solution of finite element equations on the floating point systems {FPS-164} attached processor
bibsource:
https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib

entry:
@Article{Burton:1985:SFE,
  author =       "C. G. Burton",
  title =        "The solution of finite element equations on the
                 floating point systems {FPS-164} attached processor",
  journal =      j-COMP-PHYS-COMM,
  volume =       "37",
  number =       "1-3",
  pages =        "171--180",
  year =         "1985",
  CODEN =        "CPHCBZ",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  MRclass =      "65N20 (65W05)",
  MRnumber =     "817 063",
  bibdate =      "Fri Dec 8 08:24:14 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}


bibtype: inproceedings
filename: fparith.bib
label: Cantoni:1985:PPA
author: V. Cantoni and M. Ferretti and S. Levialdi and R. Stefanelli
title: PAPIA: Pyramidal Architecture for Parallel Image Analysis
crossref: Hwang:1985:PSC
pages: 237--242
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Cantoni_Ferretti_Levialdi_Stefanelli.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: V. Cantoni and M. Ferretti and S. Levialdi and R. Stefanelli
rawtitle: {PAPIA}: {Pyramidal Architecture for Parallel Image Analysis}
abstract:
In 1981 a national research program for the design, simulation and construction of a multiprocessor image processing system was started. After a first phase devoted to the comparison of suggested and existing systems and to the definition of a set of benchmarks and to the evaluation of the performances of the major classes of machines, a new system has been defined. The structure of the new system is based on a pyramid of processors and many applications in which this machine may be exploited are highlighted. The multiprocessor architecture has been fully designed and the chip will be built by an Italian silicon foundry, the SGS company, within the framework of the multichip national project.

rawabstract:
In 1981 a national research program for the design, simulation and construction of a multiprocessor image processing system was started. After a first phase devoted to the comparison of suggested and existing systems and to the definition of a set of benchmarks and to the evaluation of the performances of the major classes of machines, a new system has been defined. The structure of the new system is based on a pyramid of processors and many applications in which this machine may be exploited are highlighted. The multiprocessor architecture has been fully designed and the chip will be built by an Italian silicon foundry, the SGS company, within the framework of the multichip national project.

entry:
@InProceedings{Cantoni:1985:PPA,
  author =       "V. Cantoni and M. Ferretti and S. Levialdi and R.
                 Stefanelli",
  title =        "{PAPIA}: {Pyramidal Architecture for Parallel Image
                 Analysis}",
  crossref =     "Hwang:1985:PSC",
  pages =        "237--242",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Cantoni_Ferretti_Levialdi_Stefanelli.pdf",
  abstract =     "In 1981 a national research program for the design,
                 simulation and construction of a multiprocessor image
                 processing system was started. After a first phase
                 devoted to the comparison of suggested and existing
                 systems and to the definition of a set of benchmarks
                 and to the evaluation of the performances of the major
                 classes of machines, a new system has been defined. The
                 structure of the new system is based on a pyramid of
                 processors and many applications in which this machine
                 may be exploited are highlighted. The multiprocessor
                 architecture has been fully designed and the chip will
                 be built by an Italian silicon foundry, the SGS
                 company, within the framework of the multichip national
                 project.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: article
filename: fparith.bib
label: Cathey:1985:ISR
author: James Cathey
title: 68000 Integer square root routine in 16BST
journal: j-DDJ
volume: 10
number: 5
pages: 118--??
month: may
monthnumber: 5
year: 1985
CODEN: DDJOEB
ISSN: 1044-789X OR 1044789X
bibdate: Mon Sep 2 09:09:39 MDT 1996
bibsource: http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.09.02 09:09:39 MDT
fjournal: Dr. Dobb's Journal of Software Tools
acknowledgement: ack-nhfb
rawauthor: James Cathey
rawtitle: 68000 Integer square root routine in {16BST}
entry:
@Article{Cathey:1985:ISR,
  author =       "James Cathey",
  title =        "68000 Integer square root routine in {16BST}",
  journal =      j-DDJ,
  volume =       "10",
  number =       "5",
  pages =        "118--??",
  month =        may,
  year =         "1985",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}


bibtype: mastersthesis
filename: fparith.bib
label: Chen:1985:FPP
author: Jen-Chyun Chen
title: 8087 floating point processor software utilities development and evaluation
type: Thesis (M.S.E.E.)
school: University of Alabama. Graduate School. Dept. of Electrical and Engineering
address: Tuscaloosa, AL, USA
pages: x + 128
year: 1985
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
keywords: Programming (Electronic computers); Software compatibility.
acknowledgement: ack-nhfb
rawauthor: Jen-Chyun Chen
rawtitle: 8087 floating point processor software utilities development and evaluation
entry:
@MastersThesis{Chen:1985:FPP,
  author =       "Jen-Chyun Chen",
  title =        "8087 floating point processor software utilities
                 development and evaluation",
  type =         "Thesis ({M.S.E.E.})",
  school =       "University of Alabama. Graduate School. Dept. of
                 Electrical and Engineering",
  address =      "Tuscaloosa, AL, USA",
  pages =        "x + 128",
  year =         "1985",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Programming (Electronic computers); Software
                 compatibility.",
}


bibtype: inproceedings
filename: fparith.bib
label: Chen:1985:MRS
author: Tien Chi Chen
title: Maximal Redundancy Signed-Digit Systems
crossref: Hwang:1985:PSC
pages: 296--300
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Chen.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Tien Chi Chen
rawtitle: Maximal Redundancy Signed-Digit Systems
abstract:
The maximal redundancy signed-digit (MAXSD) number system has the highest redundancy within the carry-absorbing signed-digit number system proposed by Avizienis in 1961. The digital values for radix R lie in $ [1 - R, R - 1] $.par Its compatibility with both standard nonredundant systems and binary arithmetic makes it an excellent choice for multiprecision arithmetic on binary machines. The representations for finite numbers are however nonunique and can even be unbounded in wordlength; this is resolved by algorithms for partial or complete conversion to standard nonredundant notation without explicit carry propagation.

rawabstract:
The maximal redundancy signed-digit (MAXSD) number system has the highest redundancy within the carry-absorbing signed-digit number system proposed by Avizienis in 1961. The digital values for radix R lie in $ [1 - R, R - 1] $.\par Its compatibility with both standard nonredundant systems and binary arithmetic makes it an excellent choice for multiprecision arithmetic on binary machines. The representations for finite numbers are however nonunique and can even be unbounded in wordlength; this is resolved by algorithms for partial or complete conversion to standard nonredundant notation without explicit carry propagation.

entry:
@InProceedings{Chen:1985:MRS,
  author =       "Tien Chi Chen",
  title =        "Maximal Redundancy Signed-Digit Systems",
  crossref =     "Hwang:1985:PSC",
  pages =        "296--300",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Chen.pdf",
  abstract =     "The maximal redundancy signed-digit (MAXSD) number
                 system has the highest redundancy within the
                 carry-absorbing signed-digit number system proposed by
                 Avizienis in 1961. The digital values for radix R lie
                 in $ [1 - R, R - 1] $.\par

                 Its compatibility with both standard nonredundant
                 systems and binary arithmetic makes it an excellent
                 choice for multiprecision arithmetic on binary
                 machines. The representations for finite numbers are
                 however nonunique and can even be unbounded in
                 wordlength; this is resolved by algorithms for partial
                 or complete conversion to standard nonredundant
                 notation without explicit carry propagation.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Cheng:1985:APF
author: H. D. Cheng and K. S. Fu
title: Algorithm Partition for a Fixed-Size VLSI Architecture Using Space-Time Domain Expansion
crossref: Hwang:1985:PSC
pages: 126--132
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Cheng_Fu.pdf
acknowledgement: ack-nhfb
rawauthor: H. D. Cheng and K. S. Fu
rawtitle: Algorithm Partition for a Fixed-Size {VLSI} Architecture Using Space-Time Domain Expansion
abstract:
The space-time domain expansion method has recently been used to transform a computational task with a recursive formula into a VLSI architecture. In addition to its simplicity and completeness, an important advantage of this method is that it can easily solve the problem of partitioning an algorithm to fit a fixed size VLSI architecture. We propose a computational model and a partition rule which can be easily used to partition any recursive computation problem suited to the space-time domain expansion method so it can be solved on fixed-size VLSI architectures. Several examples, such as partitioned vector inner product, partitioned comparators in relational database management, partitioned matrix multiplications. and partitioned transitive closure computation, parallel recognition of general context-free languages, string matching and dynamic time-warp pattern-matching are used to illustrate the proposed method.

keywords:
algorithm partition; ARITH-7; multiprocessing; pipelining; recursive task; space-time domain expansion; very large scale integration (VLSI)

rawabstract:
The space-time domain expansion method has recently been used to transform a computational task with a recursive formula into a VLSI architecture. In addition to its simplicity and completeness, an important advantage of this method is that it can easily solve the problem of partitioning an algorithm to fit a fixed size VLSI architecture. We propose a computational model and a partition rule which can be easily used to partition any recursive computation problem suited to the space-time domain expansion method so it can be solved on fixed-size VLSI architectures. Several examples, such as partitioned vector inner product, partitioned comparators in relational database management, partitioned matrix multiplications. and partitioned transitive closure computation, parallel recognition of general context-free languages, string matching and dynamic time-warp pattern-matching are used to illustrate the proposed method.

entry:
@InProceedings{Cheng:1985:APF,
  author =       "H. D. Cheng and K. S. Fu",
  title =        "Algorithm Partition for a Fixed-Size {VLSI}
                 Architecture Using Space-Time Domain Expansion",
  crossref =     "Hwang:1985:PSC",
  pages =        "126--132",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Cheng_Fu.pdf",
  abstract =     "The space-time domain expansion method has recently
                 been used to transform a computational task with a
                 recursive formula into a VLSI architecture. In addition
                 to its simplicity and completeness, an important
                 advantage of this method is that it can easily solve
                 the problem of partitioning an algorithm to fit a fixed
                 size VLSI architecture. We propose a computational
                 model and a partition rule which can be easily used to
                 partition any recursive computation problem suited to
                 the space-time domain expansion method so it can be
                 solved on fixed-size VLSI architectures. Several
                 examples, such as partitioned vector inner product,
                 partitioned comparators in relational database
                 management, partitioned matrix multiplications. and
                 partitioned transitive closure computation, parallel
                 recognition of general context-free languages, string
                 matching and dynamic time-warp pattern-matching are
                 used to illustrate the proposed method.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithm partition; ARITH-7; multiprocessing;
                 pipelining; recursive task; space-time domain
                 expansion; very large scale integration (VLSI)",
}


bibtype: inproceedings
filename: fparith.bib
label: Chiarulli:1985:DDR
author: Donald M. Chiarulli and W. G. Rudd and Duncan A. Buell
title: DRAFT: a Dynamically Reconfigurable Processor for Integer Arithmetic
crossref: Hwang:1985:PSC
pages: 309--317
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Chiarulli_Rudd_Buell.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Donald M. Chiarulli and W. G. Rudd and Duncan A. Buell
rawtitle: {DRAFT}: a Dynamically Reconfigurable Processor for Integer Arithmetic
abstract:
A special computer for high-precision arithmetic features an ALU that is dynamically reconfigurable under program control. The 256-bit ALU consists of 8 32-bit slices each of which has its own ALU operation code in each microinstruction. The slices can remain logically separated from each other, or be dynamically connected to either or both of their neighbors under control of a segment control code that is part of each microinstruction. The micro-assembly language designed for the machine includes special features to assist in the control of the segmentation, data addressing, and control sequencing. Estimations of the times required to execute arithmetic operations on the machine show that it will be exceptionally fast for problems in computational number theory and factoring of integers.

rawabstract:
A special computer for high-precision arithmetic features an ALU that is dynamically reconfigurable under program control. The 256-bit ALU consists of 8 32-bit slices each of which has its own ALU operation code in each microinstruction. The slices can remain logically separated from each other, or be dynamically connected to either or both of their neighbors under control of a segment control code that is part of each microinstruction. The micro-assembly language designed for the machine includes special features to assist in the control of the segmentation, data addressing, and control sequencing. Estimations of the times required to execute arithmetic operations on the machine show that it will be exceptionally fast for problems in computational number theory and factoring of integers.

entry:
@InProceedings{Chiarulli:1985:DDR,
  author =       "Donald M. Chiarulli and W. G. Rudd and Duncan A.
                 Buell",
  title =        "{DRAFT}: a Dynamically Reconfigurable Processor for
                 Integer Arithmetic",
  crossref =     "Hwang:1985:PSC",
  pages =        "309--317",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Chiarulli_Rudd_Buell.pdf",
  abstract =     "A special computer for high-precision arithmetic
                 features an ALU that is dynamically reconfigurable
                 under program control. The 256-bit ALU consists of 8
                 32-bit slices each of which has its own ALU operation
                 code in each microinstruction. The slices can remain
                 logically separated from each other, or be dynamically
                 connected to either or both of their neighbors under
                 control of a segment control code that is part of each
                 microinstruction. The micro-assembly language designed
                 for the machine includes special features to assist in
                 the control of the segmentation, data addressing, and
                 control sequencing. Estimations of the times required
                 to execute arithmetic operations on the machine show
                 that it will be exceptionally fast for problems in
                 computational number theory and factoring of
                 integers.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Chow:1985:PFD
author: Edward T. Chow and Dan I. Moldovan
title: Prime Factor DFT Parallel Processor Using Wafer Scale Integration
crossref: Hwang:1985:PSC
pages: 133--139
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Chow_Moldovan.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Edward T. Chow and Dan I. Moldovan
rawtitle: Prime Factor {DFT} Parallel Processor Using Wafer Scale Integration
abstract:
A high speed, flexible, simple and regular Discrete Fourier Transform (DFT) Array Processor architecture based on the Prime Factor Algorithm (PFA) is presented in this paper. The array processor is based only on one type of VLSI cell and can compute an $N$ point DFT in $N$ clock cycles throughput when $N$ is a composite number of prime numbers. The high throughput rate is achieved with only a small number of cells. With a special indexing scheme presented in this paper, this processor can use shift registers as the system memory so that minimum global control and addressing is achieved. This array processor architecture is also highly tolerant to both semiconductor processing yield and processor defects during run time. Thus, it can be manufactured in large quantity with VLSI technology on a single wafer and used in hazardous environments. With these advantages, it is very attractive to satellite, military and commercial applications.

rawabstract:
A high speed, flexible, simple and regular Discrete Fourier Transform (DFT) Array Processor architecture based on the Prime Factor Algorithm (PFA) is presented in this paper. The array processor is based only on one type of VLSI cell and can compute an $N$ point DFT in $N$ clock cycles throughput when $N$ is a composite number of prime numbers. The high throughput rate is achieved with only a small number of cells. With a special indexing scheme presented in this paper, this processor can use shift registers as the system memory so that minimum global control and addressing is achieved. This array processor architecture is also highly tolerant to both semiconductor processing yield and processor defects during run time. Thus, it can be manufactured in large quantity with VLSI technology on a single wafer and used in hazardous environments. With these advantages, it is very attractive to satellite, military and commercial applications.

entry:
@InProceedings{Chow:1985:PFD,
  author =       "Edward T. Chow and Dan I. Moldovan",
  title =        "Prime Factor {DFT} Parallel Processor Using Wafer
                 Scale Integration",
  crossref =     "Hwang:1985:PSC",
  pages =        "133--139",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Chow_Moldovan.pdf",
  abstract =     "A high speed, flexible, simple and regular Discrete
                 Fourier Transform (DFT) Array Processor architecture
                 based on the Prime Factor Algorithm (PFA) is presented
                 in this paper. The array processor is based only on one
                 type of VLSI cell and can compute an $N$ point DFT in
                 $N$ clock cycles throughput when $N$ is a composite
                 number of prime numbers. The high throughput rate is
                 achieved with only a small number of cells. With a
                 special indexing scheme presented in this paper, this
                 processor can use shift registers as the system memory
                 so that minimum global control and addressing is
                 achieved. This array processor architecture is also
                 highly tolerant to both semiconductor processing yield
                 and processor defects during run time. Thus, it can be
                 manufactured in large quantity with VLSI technology on
                 a single wafer and used in hazardous environments. With
                 these advantages, it is very attractive to satellite,
                 military and commercial applications.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Ciminiera:1985:ESP
author: L. Ciminiera and A. Serra
title: Efficient Serial-Parallel Arrays for Multiplikation and Addition
crossref: Hwang:1985:PSC
pages: 28--35
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Ciminiera_Serra.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: L. Ciminiera and A. Serra
rawtitle: Efficient Serial-Parallel Arrays for Multiplikation and Addition
abstract:
Three new arrays for unsigned and signed multiplication, and for multiplication / addition are presented. It is assumed that the factors are expressed in 2's complement, while the addend (in the latter array only) and the result are expressed in a redundant notation. The arrays operate in serial-parallel way since one factor is input in parallel, while the second factor and the addend (in the case of multiplication / addition) are entered digit by digit starting from the most significant one; the result is also produced serially with the most significant digit first. Hence, the arithmetic unit presented is suitable to be used as basic block of special purpose processors performing functions such as non-recursive digital filtering, signal correlation and matrix multiplication. Indeed, they have the same speed improvements as other similar units using redundant representations for the result, with a cost: equivalent to their counterparts based on full 2's complement representation.

rawabstract:
Three new arrays for unsigned and signed multiplication, and for multiplication\slash addition are presented. It is assumed that the factors are expressed in 2's complement, while the addend (in the latter array only) and the result are expressed in a redundant notation. The arrays operate in serial-parallel way since one factor is input in parallel, while the second factor and the addend (in the case of multiplication\slash addition) are entered digit by digit starting from the most significant one; the result is also produced serially with the most significant digit first. Hence, the arithmetic unit presented is suitable to be used as basic block of special purpose processors performing functions such as non-recursive digital filtering, signal correlation and matrix multiplication. Indeed, they have the same speed improvements as other similar units using redundant representations for the result, with a cost: equivalent to their counterparts based on full 2's complement representation.

entry:
@InProceedings{Ciminiera:1985:ESP,
  author =       "L. Ciminiera and A. Serra",
  title =        "Efficient Serial-Parallel Arrays for Multiplikation
                 and Addition",
  crossref =     "Hwang:1985:PSC",
  pages =        "28--35",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Ciminiera_Serra.pdf",
  abstract =     "Three new arrays for unsigned and signed
                 multiplication, and for multiplication\slash addition
                 are presented. It is assumed that the factors are
                 expressed in 2's complement, while the addend (in the
                 latter array only) and the result are expressed in a
                 redundant notation. The arrays operate in
                 serial-parallel way since one factor is input in
                 parallel, while the second factor and the addend (in
                 the case of multiplication\slash addition) are entered
                 digit by digit starting from the most significant one;
                 the result is also produced serially with the most
                 significant digit first. Hence, the arithmetic unit
                 presented is suitable to be used as basic block of
                 special purpose processors performing functions such as
                 non-recursive digital filtering, signal correlation and
                 matrix multiplication. Indeed, they have the same speed
                 improvements as other similar units using redundant
                 representations for the result, with a cost: equivalent
                 to their counterparts based on full 2's complement
                 representation.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: article
filename: fparith.bib
label: Cody:1985:PRW
title: A Proposed Radix- and Word-length-independent Standard for Floating-point Arithmetic
journal: j-SIGNUM
volume: 20
number: 1
pages: 37--51
month: jan
monthnumber: 1
year: 1985
CODEN: SNEWD6
ISSN: 0163-5778 (print), 1558-0237 (electronic) OR 01635778 (print), 15580237 (electronic)
ISSNL: 0163-5778 OR 01635778
bibdate: Thu Sep 1 10:14:17 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.01 10:14:17 ???
fjournal: ACM SIGNUM Newsletter
acknowledgement: ack-nj
journalURL: https://dl.acm.org/loi/signum
rawtitle: A Proposed Radix- and Word-length-independent Standard for Floating-point Arithmetic
author:
W. J. Cody and J. T. Coonen and D. M. Gay and K. Hanson and D. Hough and W. Kahan and R. Karpinski and J. Palmer and F. N. Ris and D. Stevenson

rawauthor:
W. J. Cody and J. T. Coonen and D. M. Gay and K. Hanson and D. Hough and W. Kahan and R. Karpinski and J. Palmer and F. N. Ris and D. Stevenson

entry:
@Article{Cody:1985:PRW,
  author =       "W. J. Cody and J. T. Coonen and D. M. Gay and K.
                 Hanson and D. Hough and W. Kahan and R. Karpinski and
                 J. Palmer and F. N. Ris and D. Stevenson",
  title =        "A Proposed Radix- and Word-length-independent Standard
                 for Floating-point Arithmetic",
  journal =      j-SIGNUM,
  volume =       "20",
  number =       "1",
  pages =        "37--51",
  month =        jan,
  year =         "1985",
  CODEN =        "SNEWD6",
  ISSN =         "0163-5778 (print), 1558-0237 (electronic)",
  ISSN-L =       "0163-5778",
  bibdate =      "Thu Sep 1 10:14:17 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "ACM SIGNUM Newsletter",
  journal-URL =  "https://dl.acm.org/loi/signum",
}


bibtype: inproceedings
filename: fparith.bib
label: Conover:1985:AHS
author: B. Conover and D. L. Gustafson
title: An Algorithm for High Speed Square Roots
crossref: IEEE:1985:ERC
pages: 19--21
year: 1985
bibdate: Fri Jun 11 18:04:41 1999
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1999.06.11 18:04:41 ???
acknowledgement: ack-nj
rawauthor: B. Conover and D. L. Gustafson
rawtitle: An Algorithm for High Speed Square Roots
entry:
@InProceedings{Conover:1985:AHS,
  author =       "B. Conover and D. L. Gustafson",
  title =        "An Algorithm for High Speed Square Roots",
  crossref =     "IEEE:1985:ERC",
  pages =        "19--21",
  year =         "1985",
  bibdate =      "Fri Jun 11 18:04:41 1999",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
}


bibtype: article
filename: fparith.bib
label: Cozzens:1985:CDF
author: J. Cozzens and L. Finkelstein
journal: j-IEEE-TRANS-INF-THEORY
volume: 31
number: 5
pages: 580--588
month: sep
monthnumber: 9
year: 1985
CODEN: IETTAW
DOI: https://doi.org/10.1109/TIT.1985.1057081
ISSN: 0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)
ISSNL: 0018-9448 OR 00189448
bibdate: Fri Nov 9 11:38:58 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.09 11:38:58 MST
URL: https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=22750
fjournal: IEEE Transactions on Information Theory
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18
rawauthor: J. Cozzens and L. Finkelstein
title:
Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers

rawtitle:
Computing the discrete {Fourier} transform using residue number systems in a ring of algebraic integers

entry:
@Article{Cozzens:1985:CDF,
  author =       "J. Cozzens and L. Finkelstein",
  title =        "Computing the discrete {Fourier} transform using
                 residue number systems in a ring of algebraic
                 integers",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "31",
  number =       "5",
  pages =        "580--588",
  month =        sep,
  year =         "1985",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/TIT.1985.1057081",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  bibdate =      "Fri Nov 9 11:38:58 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=22750",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
  keywords =     "residue arithmetic; residue number system",
  summary =      "A new method is described for computing an $N = R^{m}
                 = 2^{upsilon m}$-point complex discrete Fourier
                 transform that uses quantization within a dense ring of
                 algebraic integers in conjunction with a residue number
                 system over this ring. The \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Cuyt:1985:REA
author: Annie Cuyt and Paul Van der Cruyssen
title: Rounding error analysis for forward continued fraction algorithms
journal: j-COMPUT-MATH-APPL
volume: 11
number: 6
pages: 541--564
month: jun
monthnumber: 6
year: 1985
CODEN: CMAPDK
ISSN: 0898-1221 (print), 1873-7668 (electronic) OR 08981221 (print), 18737668 (electronic)
ISSNL: 0898-1221 OR 08981221
bibdate: Wed Mar 1 19:00:53 MST 2017
bibtimestamp: 2017.03.01 19:00:53 MST
URL: http://www.sciencedirect.com/science/article/pii/0898122185900379
fjournal: Computers and Mathematics with Applications
acknowledgement: ack-nhfb
journalURL: http://www.sciencedirect.com/science/journal/08981221
rawauthor: Annie Cuyt and Paul Van der Cruyssen
rawtitle: Rounding error analysis for forward continued fraction algorithms
entry:
@Article{Cuyt:1985:REA,
  author =       "Annie Cuyt and Paul Van der Cruyssen",
  title =        "Rounding error analysis for forward continued fraction
                 algorithms",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "11",
  number =       "6",
  pages =        "541--564",
  month =        jun,
  year =         "1985",
  CODEN =        "CMAPDK",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 19:00:53 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0898122185900379",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}


bibtype: inproceedings
filename: fparith.bib
label: Dadda:1985:FMT
author: Luigi Dadda
title: Fast Multipliers for Two's-Complement Numbers in Serial Form
crossref: Hwang:1985:PSC
pages: 57--63
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Dadda.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
authordates: 29 April 1923--26 October 2012
rawauthor: Luigi Dadda
rawtitle: Fast Multipliers for Two's-Complement Numbers in Serial Form
abstract:
Schemes for designing multipliers of binary two's-complement numbers in serial form are considered with the condition of the least possible delay between inputs and output.par Such schemes are composed by two parts: the first, the array generator, produces the terms of the multiplier array; the second, the summer, is fed by the array generator and produces the product. Two classes of multipliers are illustrated: the first generating the multiplier array by diagonals and rows, the second by columns.par The array generators are composed by and / or stack registers and linear arrays of gates; the summer is shown to be conveniently using parallel counters.

rawabstract:
Schemes for designing multipliers of binary two's-complement numbers in serial form are considered with the condition of the least possible delay between inputs and output.\par Such schemes are composed by two parts: the first, the array generator, produces the terms of the multiplier array; the second, the summer, is fed by the array generator and produces the product. Two classes of multipliers are illustrated: the first generating the multiplier array by diagonals and rows, the second by columns.\par The array generators are composed by and\slash or stack registers and linear arrays of gates; the summer is shown to be conveniently using parallel counters.

entry:
@InProceedings{Dadda:1985:FMT,
  author =       "Luigi Dadda",
  title =        "Fast Multipliers for Two's-Complement Numbers in
                 Serial Form",
  crossref =     "Hwang:1985:PSC",
  pages =        "57--63",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Dadda.pdf",
  abstract =     "Schemes for designing multipliers of binary
                 two's-complement numbers in serial form are considered
                 with the condition of the least possible delay between
                 inputs and output.\par

                 Such schemes are composed by two parts: the first, the
                 array generator, produces the terms of the multiplier
                 array; the second, the summer, is fed by the array
                 generator and produces the product. Two classes of
                 multipliers are illustrated: the first generating the
                 multiplier array by diagonals and rows, the second by
                 columns.\par

                 The array generators are composed by and\slash or stack
                 registers and linear arrays of gates; the summer is
                 shown to be conveniently using parallel counters.",
  acknowledgement = ack-nhfb,
  author-dates = "29 April 1923--26 October 2012",
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Dadda:1985:SBN
author: Luigi Dadda
title: Squares for Binary Numbers in Serial Form
crossref: Hwang:1985:PSC
pages: 173--180
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Dadda1.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
authordates: 29 April 1923--26 October 2012
rawauthor: Luigi Dadda
rawtitle: Squares for Binary Numbers in Serial Form
abstract:
The problem of designing squarers for binary number[s] in serial form (with the condition of the least possible delay between input and output) is treated.par Several schemes are illustrated, derived from fast multipliers for binary numbers in serial form, described in a previous paper.par It is shown that some of such multipliers offer a considerable saving in components when they are reduced to squarers. Some schemes are illustrated, both for positive and for two's-complement numbers.

rawabstract:
The problem of designing squarers for binary number[s] in serial form (with the condition of the least possible delay between input and output) is treated.\par Several schemes are illustrated, derived from fast multipliers for binary numbers in serial form, described in a previous paper.\par It is shown that some of such multipliers offer a considerable saving in components when they are reduced to squarers. Some schemes are illustrated, both for positive and for two's-complement numbers.

entry:
@InProceedings{Dadda:1985:SBN,
  author =       "Luigi Dadda",
  title =        "Squares for Binary Numbers in Serial Form",
  crossref =     "Hwang:1985:PSC",
  pages =        "173--180",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Dadda1.pdf",
  abstract =     "The problem of designing squarers for binary number[s]
                 in serial form (with the condition of the least
                 possible delay between input and output) is
                 treated.\par

                 Several schemes are illustrated, derived from fast
                 multipliers for binary numbers in serial form,
                 described in a previous paper.\par

                 It is shown that some of such multipliers offer a
                 considerable saving in components when they are reduced
                 to squarers. Some schemes are illustrated, both for
                 positive and for two's-complement numbers.",
  acknowledgement = ack-nhfb,
  author-dates = "29 April 1923--26 October 2012",
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: DeMori:1985:DRP
author: R. De Mori and R. Cardin
title: Design for a Recursive Parallel Multiplier
crossref: Hwang:1985:PSC
pages: 44--50
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Demori_Cardin.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: R. {De Mori} and R. Cardin
rawtitle: Design for a Recursive Parallel Multiplier
abstract:
A network for performing multiplications of two two's complement number's is proposed. The network can be implemented in a synchronous or an asynchronous way. If the factors to be multiplied have $N$ bits, the area complexity of the network is $ O(N^2) $ for practical values of $N$ as in the case of cellular multipliers. Due to the design approach based on a recursive algorithm, a time complexity $ O(log N) $ is achieved.

rawabstract:
A network for performing multiplications of two two's complement number's is proposed. The network can be implemented in a synchronous or an asynchronous way. If the factors to be multiplied have $N$ bits, the area complexity of the network is $ O(N^2) $ for practical values of $N$ as in the case of cellular multipliers. Due to the design approach based on a recursive algorithm, a time complexity $ O(\log N) $ is achieved.

entry:
@InProceedings{DeMori:1985:DRP,
  author =       "R. {De Mori} and R. Cardin",
  title =        "Design for a Recursive Parallel Multiplier",
  crossref =     "Hwang:1985:PSC",
  pages =        "44--50",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Demori_Cardin.pdf",
  abstract =     "A network for performing multiplications of two two's
                 complement number's is proposed. The network can be
                 implemented in a synchronous or an asynchronous way. If
                 the factors to be multiplied have $N$ bits, the area
                 complexity of the network is $ O(N^2) $ for practical
                 values of $N$ as in the case of cellular multipliers.
                 Due to the design approach based on a recursive
                 algorithm, a time complexity $ O(\log N) $ is
                 achieved.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Dongarra:1985:FAS
author: J. J. Dongarra and D. C. Sorensen
title: A Fast Algorithm for the Symmetric Eigenvalue Problem
crossref: Hwang:1985:PSC
pages: 338--342
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Dongarra_Sorensen.pdf
keywords: ARITH-7
remark: Listed in table of contents as 276--277.
acknowledgement: ack-nhfb
rawauthor: J. J. Dongarra and D. C. Sorensen
rawtitle: A Fast Algorithm for the Symmetric Eigenvalue Problem
abstract:
The symmetric eigenvalue problem is one of the most fundamental problems of computational mathematics. It arises in many applications, and therefore represents an important area for algorithmic research. It is also one of the first eigenvalue problems for which reliable methods have been obtained. It would be surprising therefore, if a new method were to be found that would offer a significant improvement in execution time over the fundamental algorithms available in standard software packages such as EISPACK [7]. However, it is reasonable to expect that eigenvalue calculations might be accelerated through the use of parallel algorithms for parallel computers that are emerging. We shall present such an algorithm in this paper. The algorithm is able to exploit parallelism at all levels of the computation and is well suited to a variety of architectures. However, a pleasant bonus of this research is that the parallel algorithm, even when run in serial mode, is significantly faster than the best sequential algorithm on large problems, and is effective on moderate size (order $ geq 30 $) problems when run in serial mode.

rawabstract:
The symmetric eigenvalue problem is one of the most fundamental problems of computational mathematics. It arises in many applications, and therefore represents an important area for algorithmic research. It is also one of the first eigenvalue problems for which reliable methods have been obtained. It would be surprising therefore, if a new method were to be found that would offer a significant improvement in execution time over the fundamental algorithms available in standard software packages such as EISPACK [7]. However, it is reasonable to expect that eigenvalue calculations might be accelerated through the use of parallel algorithms for parallel computers that are emerging. We shall present such an algorithm in this paper. The algorithm is able to exploit parallelism at all levels of the computation and is well suited to a variety of architectures. However, a pleasant bonus of this research is that the parallel algorithm, even when run in serial mode, is significantly faster than the best sequential algorithm on large problems, and is effective on moderate size (order $ \geq 30 $) problems when run in serial mode.

entry:
@InProceedings{Dongarra:1985:FAS,
  author =       "J. J. Dongarra and D. C. Sorensen",
  title =        "A Fast Algorithm for the Symmetric Eigenvalue
                 Problem",
  crossref =     "Hwang:1985:PSC",
  pages =        "338--342",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Dongarra_Sorensen.pdf",
  abstract =     "The symmetric eigenvalue problem is one of the most
                 fundamental problems of computational mathematics. It
                 arises in many applications, and therefore represents
                 an important area for algorithmic research. It is also
                 one of the first eigenvalue problems for which reliable
                 methods have been obtained. It would be surprising
                 therefore, if a new method were to be found that would
                 offer a significant improvement in execution time over
                 the fundamental algorithms available in standard
                 software packages such as EISPACK [7]. However, it is
                 reasonable to expect that eigenvalue calculations might
                 be accelerated through the use of parallel algorithms
                 for parallel computers that are emerging. We shall
                 present such an algorithm in this paper. The algorithm
                 is able to exploit parallelism at all levels of the
                 computation and is well suited to a variety of
                 architectures. However, a pleasant bonus of this
                 research is that the parallel algorithm, even when run
                 in serial mode, is significantly faster than the best
                 sequential algorithm on large problems, and is
                 effective on moderate size (order $ \geq 30 $) problems
                 when run in serial mode.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
  remark =       "Listed in table of contents as 276--277.",
}


bibtype: inproceedings
filename: fparith.bib
label: Dunham:1985:PFM
author: C. B. Dunham
title: Floating point with rounding before normalization
crossref: Meek:1985:PFM
pages: 91--102
year: 1985
MRclass: 65G05
MRnumber: 86f:65089
bibdate: Fri Dec 8 08:24:13 1995
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1995.12.08 08:24:13 ???
acknowledgement: ack-nhfb
rawauthor: C. B. Dunham
rawtitle: Floating point with rounding before normalization
entry:
@InProceedings{Dunham:1985:PFM,
  author =       "C. B. Dunham",
  title =        "Floating point with rounding before normalization",
  crossref =     "Meek:1985:PFM",
  pages =        "91--102",
  year =         "1985",
  MRclass =      "65G05",
  MRnumber =     "86f:65089",
  bibdate =      "Fri Dec 8 08:24:13 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
}


bibtype: inproceedings
filename: fparith.bib
label: Eldon:1985:FCF
author: John A. Eldon
title: A Family of CMOS Floating Point Arithmetic Chips
crossref: Hwang:1985:PSC
pages: 101--109
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Eldon.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: John A. Eldon
rawtitle: A Family of {CMOS} Floating Point Arithmetic Chips
abstract:
Although the advantages of floating point arithmetic have long been recognized, hardware complexity and expense have impeded its use in high speed digital signal processing (DSP). Now, however, the availability of a growing number of fast dedicated floating point adder and multiplier chips is spurring renewed interest in floating point for real time filtering and spectral analysis.

rawabstract:
Although the advantages of floating point arithmetic have long been recognized, hardware complexity and expense have impeded its use in high speed digital signal processing (DSP). Now, however, the availability of a growing number of fast dedicated floating point adder and multiplier chips is spurring renewed interest in floating point for real time filtering and spectral analysis.

entry:
@InProceedings{Eldon:1985:FCF,
  author =       "John A. Eldon",
  title =        "A Family of {CMOS} Floating Point Arithmetic Chips",
  crossref =     "Hwang:1985:PSC",
  pages =        "101--109",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Eldon.pdf",
  abstract =     "Although the advantages of floating point arithmetic
                 have long been recognized, hardware complexity and
                 expense have impeded its use in high speed digital
                 signal processing (DSP). Now, however, the availability
                 of a growing number of fast dedicated floating point
                 adder and multiplier chips is spurring renewed interest
                 in floating point for real time filtering and spectral
                 analysis.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: article
filename: fparith.bib
label: Enzmann:1985:WDS
author: K. Enzmann
journal: j-ELECTRONIK
volume: 18
pages: 92
year: 1985
CODEN: EKRKAR
ISSN: 0013-5658 OR 00135658
bibdate: Fri Sep 16 16:30:41 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.16 16:30:41 ???
fjournal: Elektronik
acknowledgement: ack-nj
rawauthor: K. Enzmann
title:
Wurzelziehen durch sukzessive Approximation toenglish Root-Finding by Successive Approximation endtoenglish 

rawtitle:
{Wurzelziehen durch sukzessive Approximation} \toenglish {Root-Finding by Successive Approximation} \endtoenglish

entry:
@Article{Enzmann:1985:WDS,
  author =       "K. Enzmann",
  title =        "{Wurzelziehen durch sukzessive Approximation}
                 \toenglish {Root-Finding by Successive Approximation}
                 \endtoenglish",
  journal =      j-ELECTRONIK,
  volume =       "18",
  pages =        "92",
  year =         "1985",
  CODEN =        "EKRKAR",
  ISSN =         "0013-5658",
  bibdate =      "Fri Sep 16 16:30:41 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "Elektronik",
}


bibtype: inproceedings
filename: fparith.bib
label: Ercegovac:1985:DAP
author: M. D. Ercegovac and T. Lang
title: A Division Algorithm with Prediction of Quotient Digits
crossref: Hwang:1985:PSC
pages: 51--56
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Ercegovac_Lang.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: M. D. Ercegovac and T. Lang
rawtitle: A Division Algorithm with Prediction of Quotient Digits
abstract:
A division algorithm with a simple selection of quotient digits including prediction is possible if the divisor is restricted to a suitable range. The condition that the divisor must satisfy to have the quotient digit $ q_i + 1 $ predicted while computing $ R_i + 1 $ are determined. Some implementation considerations are also given.

rawabstract:
A division algorithm with a simple selection of quotient digits including prediction is possible if the divisor is restricted to a suitable range. The condition that the divisor must satisfy to have the quotient digit $ q_{i + 1} $ predicted while computing $ R_{i + 1} $ are determined. Some implementation considerations are also given.

entry:
@InProceedings{Ercegovac:1985:DAP,
  author =       "M. D. Ercegovac and T. Lang",
  title =        "A Division Algorithm with Prediction of Quotient
                 Digits",
  crossref =     "Hwang:1985:PSC",
  pages =        "51--56",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Ercegovac_Lang.pdf",
  abstract =     "A division algorithm with a simple selection of
                 quotient digits including prediction is possible if the
                 divisor is restricted to a suitable range. The
                 condition that the divisor must satisfy to have the
                 quotient digit $ q_{i + 1} $ predicted while computing
                 $ R_{i + 1} $ are determined. Some implementation
                 considerations are also given.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: book
filename: fparith.bib
label: Ercegovac:1985:DSH
author: Milos D. Ercegovac and Tomas Lang
title: Digital systems and hardware / firmware algorithms
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xix + 838
year: 1985
ISBN: 0-471-88393-X OR 047188393X
ISBN13: 978-0-471-88393-7 OR 9780471883937
LCCN: TK7868.D5 E73 1985
bibdate: Wed Nov 14 14:42:00 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2007.11.14 14:42:00 MST
subject: computer firmware; digital electronics
acknowledgement: ack-nhfb
rawauthor: Milo{\v{s}} D. Ercegovac and Tom{\'a}s Lang
rawtitle: Digital systems and hardware\slash firmware algorithms
URL:
http://www.loc.gov/catdir/bios/wiley043/84021983.html; http://www.loc.gov/catdir/description/wiley035/84021983.html; http://www.loc.gov/catdir/toc/onix06/84021983.html

entry:
@Book{Ercegovac:1985:DSH,
  author =       "Milo{\v{s}} D. Ercegovac and Tom{\'a}s Lang",
  title =        "Digital systems and hardware\slash firmware
                 algorithms",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xix + 838",
  year =         "1985",
  ISBN =         "0-471-88393-X",
  ISBN-13 =      "978-0-471-88393-7",
  LCCN =         "TK7868.D5 E73 1985",
  bibdate =      "Wed Nov 14 14:42:00 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$32.95",
  URL =          "http://www.loc.gov/catdir/bios/wiley043/84021983.html;
                 http://www.loc.gov/catdir/description/wiley035/84021983.html;
                 http://www.loc.gov/catdir/toc/onix06/84021983.html",
  acknowledgement = ack-nhfb,
  subject =      "computer firmware; digital electronics",
}


bibtype: inproceedings
filename: fparith.bib
label: Fandrianto:1985:VFP
author: Jan Fandrianto and B. Y. Woo
title: VLSI Floating-Point Processors
crossref: Hwang:1985:PSC
pages: 93--100
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Fandrianto_Woo.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Jan Fandrianto and B. Y. Woo
rawtitle: {VLSI} Floating-Point Processors
abstract:
The advance of VLSI technology has been the enabling factor in the appearance of VLSI circuits handling floating-point arithmetics. These circuits have found their way into many number-crunching applications such as telecommunications, seismic energy exploration, radar, medical imaging, graphics and simulation. Because of the different requirements for different applications, some processors have a rich repertoire of functions but rather low performance, while some processors aim at haying the highest throughput for the most frequent operations such as multiply and add. This paper will review the architecture, the technology, and the design techniques for the current VLSI floating-point processors; and it will also report a high performance chipset (Weitek WTL1164 / 1165) implementing complete basic arithmetic functions.

rawabstract:
The advance of VLSI technology has been the enabling factor in the appearance of VLSI circuits handling floating-point arithmetics. These circuits have found their way into many number-crunching applications such as telecommunications, seismic energy exploration, radar, medical imaging, graphics and simulation. Because of the different requirements for different applications, some processors have a rich repertoire of functions but rather low performance, while some processors aim at haying the highest throughput for the most frequent operations such as multiply and add. This paper will review the architecture, the technology, and the design techniques for the current VLSI floating-point processors; and it will also report a high performance chipset (Weitek WTL1164\slash 1165) implementing complete basic arithmetic functions.

entry:
@InProceedings{Fandrianto:1985:VFP,
  author =       "Jan Fandrianto and B. Y. Woo",
  title =        "{VLSI} Floating-Point Processors",
  crossref =     "Hwang:1985:PSC",
  pages =        "93--100",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Fandrianto_Woo.pdf",
  abstract =     "The advance of VLSI technology has been the enabling
                 factor in the appearance of VLSI circuits handling
                 floating-point arithmetics. These circuits have found
                 their way into many number-crunching applications such
                 as telecommunications, seismic energy exploration,
                 radar, medical imaging, graphics and simulation.
                 Because of the different requirements for different
                 applications, some processors have a rich repertoire of
                 functions but rather low performance, while some
                 processors aim at haying the highest throughput for the
                 most frequent operations such as multiply and add. This
                 paper will review the architecture, the technology, and
                 the design techniques for the current VLSI
                 floating-point processors; and it will also report a
                 high performance chipset (Weitek WTL1164\slash 1165)
                 implementing complete basic arithmetic functions.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Ferguson:1985:RBA
author: Warren E. Ferguson and David W. Matula
title: Rationally Biased Arithmetic
crossref: Hwang:1985:PSC
pages: 194--202
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Ferguson_Matula.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Warren E. Ferguson and David W. Matula
rawtitle: Rationally Biased Arithmetic
abstract:
One can naively view a computer number system as a pair $ (F, P) $ consisting of a finite set $F$ of real numbers and a rounding rule $P$. One such number system is a hyperbolic rational number system which has as $F$ a finite set of rational numbers and as $P$ the so-called mediant rounding rule. In this paper we demonstrate how one can simulate a hyperbolic rational number system in any high level language that supports floating point computation. From this simulation we infer that hyperbolic rational number systems form viable alternatives to traditional binary floating point number systems. Many properties of hyperbolic rational number systems are derived fran the relationship of their rounding rule to the well-developed theory of best rational approximation.

rawabstract:
One can naively view a computer number system as a pair $ (F, P) $ consisting of a finite set $F$ of real numbers and a rounding rule $P$. One such number system is a hyperbolic rational number system which has as $F$ a finite set of rational numbers and as $P$ the so-called mediant rounding rule. In this paper we demonstrate how one can simulate a hyperbolic rational number system in any high level language that supports floating point computation. From this simulation we infer that hyperbolic rational number systems form viable alternatives to traditional binary floating point number systems. Many properties of hyperbolic rational number systems are derived fran the relationship of their rounding rule to the well-developed theory of best rational approximation.

entry:
@InProceedings{Ferguson:1985:RBA,
  author =       "Warren E. Ferguson and David W. Matula",
  title =        "Rationally Biased Arithmetic",
  crossref =     "Hwang:1985:PSC",
  pages =        "194--202",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Ferguson_Matula.pdf",
  abstract =     "One can naively view a computer number system as a
                 pair $ (F, P) $ consisting of a finite set $F$ of real
                 numbers and a rounding rule $P$. One such number system
                 is a hyperbolic rational number system which has as $F$
                 a finite set of rational numbers and as $P$ the
                 so-called mediant rounding rule. In this paper we
                 demonstrate how one can simulate a hyperbolic rational
                 number system in any high level language that supports
                 floating point computation. From this simulation we
                 infer that hyperbolic rational number systems form
                 viable alternatives to traditional binary floating
                 point number systems. Many properties of hyperbolic
                 rational number systems are derived fran the
                 relationship of their rounding rule to the
                 well-developed theory of best rational approximation.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: book
filename: fparith.bib
label: Froberg:1985:NMT
author: Carl Erik Froberg
title: Numerical mathematics: theory and computer applications
publisher: pub-BENCUM
address: pub-BENCUM:adr
pages: xi + 436
year: 1985
ISBN: 0-8053-2530-1 OR 0805325301
ISBN13: 978-0-8053-2530-0 OR 9780805325300
LCCN: QA297 .F6813 1985
bibdate: Fri Aug 20 09:03:54 MDT 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2010.08.20 09:03:54 MDT
subject: Numerical analysis; Data processing
acknowledgement: ack-nhfb
rawauthor: Carl Erik Fr{\"o}berg
rawtitle: Numerical mathematics: theory and computer applications
remark:
Revised edition of em Introduction to numerical analysis, second edition, 1969 cite Froberg:1969:INA

entry:
@Book{Froberg:1985:NMT,
  author =       "Carl Erik Fr{\"o}berg",
  title =        "Numerical mathematics: theory and computer
                 applications",
  publisher =    pub-BENCUM,
  address =      pub-BENCUM:adr,
  pages =        "xi + 436",
  year =         "1985",
  ISBN =         "0-8053-2530-1",
  ISBN-13 =      "978-0-8053-2530-0",
  LCCN =         "QA297 .F6813 1985",
  bibdate =      "Fri Aug 20 09:03:54 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Revised edition of {\em Introduction to numerical
                 analysis, second edition, 1969}
                 \cite{Froberg:1969:INA}",
  subject =      "Numerical analysis; Data processing",
}


bibtype: inproceedings
filename: fparith.bib
label: Gal:1985:CEF
author: Shmuel Gal
title: Computing Elementary Functions: a New Approach for Achieving High Accuracy and Good Performance
crossref: Miranker:1985:ASC
pages: 1--16
year: 1985
DOI: https://doi.org/10.1007/3-540-16798-6_1
bibdate: Thu Sep 01 12:27:23 1994
bibtimestamp: 1994.09.01 12:27:23 ???
acknowledgement: ack-nj
rawauthor: Shmuel Gal
rawtitle: Computing Elementary Functions: a New Approach for Achieving High Accuracy and Good Performance
bibsource:
ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/elefunt.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib

entry:
@InProceedings{Gal:1985:CEF,
  author =       "Shmuel Gal",
  title =        "Computing Elementary Functions: a New Approach for
                 Achieving High Accuracy and Good Performance",
  crossref =     "Miranker:1985:ASC",
  pages =        "1--16",
  year =         "1985",
  DOI =          "https://doi.org/10.1007/3-540-16798-6_1",
  bibdate =      "Thu Sep 01 12:27:23 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
}


bibtype: inproceedings
filename: fparith.bib
label: Gannon:1985:SPH
author: Dennis Gannon
title: On the Structure of Parallelism in a Highly Concurrent PDE Solver
crossref: Hwang:1985:PSC
pages: 252--259
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Gannon.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Dennis Gannon
rawtitle: {On} the Structure of Parallelism in a Highly Concurrent {PDE} Solver
abstract:
This paper studies a variation of a parallel multigrid PDE solver originally due to John Van Rosendale. This paper gives a detailed analysis of the method and discusses the large scale parallel structure. It will show that the method can be viewed as a data driven ``large grain'' systolic structure. At a lower level the algorithm is seen to be built from grid operators that are, in turn, defined by expressions involving vector functions.

rawabstract:
This paper studies a variation of a parallel multigrid PDE solver originally due to John Van Rosendale. This paper gives a detailed analysis of the method and discusses the large scale parallel structure. It will show that the method can be viewed as a data driven ``large grain'' systolic structure. At a lower level the algorithm is seen to be built from grid operators that are, in turn, defined by expressions involving vector functions.

entry:
@InProceedings{Gannon:1985:SPH,
  author =       "Dennis Gannon",
  title =        "{On} the Structure of Parallelism in a Highly
                 Concurrent {PDE} Solver",
  crossref =     "Hwang:1985:PSC",
  pages =        "252--259",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Gannon.pdf",
  abstract =     "This paper studies a variation of a parallel multigrid
                 PDE solver originally due to John Van Rosendale. This
                 paper gives a detailed analysis of the method and
                 discusses the large scale parallel structure. It will
                 show that the method can be viewed as a data driven
                 ``large grain'' systolic structure. At a lower level
                 the algorithm is seen to be built from grid operators
                 that are, in turn, defined by expressions involving
                 vector functions.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: article
filename: fparith.bib
label: Gnanasekaran:1985:FSP
author: R. Gnanasekaran
title: A Fast Serial-Parallel Binary Multiplier
journal: j-IEEE-TRANS-COMPUT
volume: C-34
number: 8
pages: 741--744
month: aug
monthnumber: 8
year: 1985
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1985.1676620
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 08:33:17 MDT 2011
bibtimestamp: 2011.07.10 08:33:17 MDT
URL: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676620
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: R. Gnanasekaran
rawtitle: A Fast Serial-Parallel Binary Multiplier
entry:
@Article{Gnanasekaran:1985:FSP,
  author =       "R. Gnanasekaran",
  title =        "A Fast Serial-Parallel Binary Multiplier",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-34",
  number =       "8",
  pages =        "741--744",
  month =        aug,
  year =         "1985",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1985.1676620",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 08:33:17 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  URL =          "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676620",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: article
filename: fparith.bib
label: Gomez:1985:PFA
author: Gustavo Rodriguez Gomez and David Carrasco Villareal
journal: Miscelanea Mat.
volume: 15
pages: 15--25
year: 1985
MRclass: 65G05
MRnumber: 86h:65060
bibdate: Fri Dec 8 08:24:13 1995
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1995.12.08 08:24:13 ???
language: Spanish
acknowledgement: ack-nhfb
rawauthor: Gustavo Rodr{\'\i}guez G{\'o}mez and David {Carrasco Villareal}
title:
Problems in floating-point arithmetic, and a method for obtaining internal characteristics of digital computers. (Spanish)

rawtitle:
Problems in floating-point arithmetic, and a method for obtaining internal characteristics of digital computers. ({Spanish})

entry:
@Article{Gomez:1985:PFA,
  author =       "Gustavo Rodr{\'\i}guez G{\'o}mez and David {Carrasco
                 Villareal}",
  title =        "Problems in floating-point arithmetic, and a method
                 for obtaining internal characteristics of digital
                 computers. ({Spanish})",
  journal =      "Miscel{\'a}nea Mat.",
  volume =       "15",
  pages =        "15--25",
  year =         "1985",
  MRclass =      "65G05",
  MRnumber =     "86h:65060",
  bibdate =      "Fri Dec 8 08:24:13 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  language =     "Spanish",
}


bibtype: article
filename: fparith.bib
label: Goodman:1985:REF
author: R. H. Goodman and A. Feldstein and J. Bustoz
title: Relative error in floating-point multiplication
journal: j-COMPUTING
volume: 35
number: 2
pages: 127--139
year: 1985
CODEN: CMPTA2
ISSN: 0010-485X (print), 1436-5057 (electronic) OR 0010485X (print), 14365057 (electronic)
ISSNL: 0010-485X OR 0010485X
MRclass: 65G05
MRnumber: 87d:65052
bibdate: Fri Dec 8 08:24:13 1995
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1995.12.08 08:24:13 ???
fjournal: Computing: Archiv fur informatik und numerik
acknowledgement: ack-nhfb
journalURL: http://link.springer.com/journal/607
reviewer: Luciano Biasini
rawauthor: R. H. Goodman and A. Feldstein and J. Bustoz
rawtitle: Relative error in floating-point multiplication
entry:
@Article{Goodman:1985:REF,
  author =       "R. H. Goodman and A. Feldstein and J. Bustoz",
  title =        "Relative error in floating-point multiplication",
  journal =      j-COMPUTING,
  volume =       "35",
  number =       "2",
  pages =        "127--139",
  year =         "1985",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65G05",
  MRnumber =     "87d:65052",
  bibdate =      "Fri Dec 8 08:24:13 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing: Archiv f{\"u}r informatik und numerik",
  journal-URL =  "http://link.springer.com/journal/607",
  reviewer =     "Luciano Biasini",
}


bibtype: mastersthesis
filename: fparith.bib
label: Gooley:1985:DFM
author: Markian Myron Gooley
title: Design of a floating-point multiplier with a recursive fraction-unit
type: Thesis (M.S.)
school: University of Illinois at Urbana-Champaign
address: Urbana-Champaign, IL 61801, USA
pages: vi + 54
year: 1985
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
acknowledgement: ack-nhfb
rawauthor: Markian Myron Gooley
rawtitle: Design of a floating-point multiplier with a recursive fraction-unit
entry:
@MastersThesis{Gooley:1985:DFM,
  author =       "Markian Myron Gooley",
  title =        "Design of a floating-point multiplier with a recursive
                 fraction-unit",
  type =         "Thesis ({M.S.})",
  school =       "University of Illinois at Urbana-Champaign",
  address =      "Urbana-Champaign, IL 61801, USA",
  pages =        "vi + 54",
  year =         "1985",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
}


bibtype: mastersthesis
filename: fparith.bib
label: Graham:1985:IFF
author: Douglas R. Graham
title: Implementation of FORTH with floating point capabilities of an 8085 system
type: Thesis (M.S.)
school: Ohio University
address: Athens, OH, USA
pages: v + 122
month: mar
monthnumber: 3
year: 1985
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
keywords: FORTH (Computer program language)
acknowledgement: ack-nhfb
rawauthor: Douglas R. Graham
rawtitle: Implementation of {FORTH} with floating point capabilities of an 8085 system
entry:
@MastersThesis{Graham:1985:IFF,
  author =       "Douglas R. Graham",
  title =        "Implementation of {FORTH} with floating point
                 capabilities of an 8085 system",
  type =         "Thesis ({M.S.})",
  school =       "Ohio University",
  address =      "Athens, OH, USA",
  pages =        "v + 122",
  month =        mar,
  year =         "1985",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "FORTH (Computer program language)",
}


bibtype: article
filename: fparith.bib
label: Grappel:1985:FSC
author: R. D. Grappel
title: Fast subroutine calculates exponentials
journal: j-EDN
volume: 30
number: 10
pages: 231
month: may
monthnumber: 5
year: 1985
CODEN: EDNSBH
ISSN: 0012-7515, 0364-6637 OR 00127515, 03646637
bibdate: Thu Sep 1 10:16:09 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.01 10:16:09 ???
fjournal: EDN
acknowledgement: ack-nj
rawauthor: R. D. Grappel
rawtitle: Fast subroutine calculates exponentials
entry:
@Article{Grappel:1985:FSC,
  author =       "R. D. Grappel",
  title =        "Fast subroutine calculates exponentials",
  journal =      j-EDN,
  volume =       "30",
  number =       "10",
  pages =        "231",
  month =        may,
  year =         "1985",
  CODEN =        "EDNSBH",
  ISSN =         "0012-7515, 0364-6637",
  bibdate =      "Thu Sep 1 10:16:09 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "EDN",
}


bibtype: inproceedings
filename: fparith.bib
label: Gridley:1985:IPS
author: Curt Gridley
crossref: USENIX:1985:SCP
pages: 597--610
year: 1985
bibdate: Tue Feb 20 15:42:13 MST 1996
bibsource: ftp://ftp.uu.net/library/bibliography; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.20 15:42:13 MST
acknowledgement: ack-nhfb
affiliation: Massachusetts Computer Corp.
rawauthor: Curt Gridley
title:
Improving the Performance of Scientific Applications on a Supermicro Using a Custom Floating Point Processor and An Optimizing Compiler

rawtitle:
Improving the Performance of Scientific Applications on a Supermicro Using a Custom Floating Point Processor and An Optimizing Compiler

entry:
@InProceedings{Gridley:1985:IPS,
  author =       "Curt Gridley",
  title =        "Improving the Performance of Scientific Applications
                 on a Supermicro Using a Custom Floating Point Processor
                 and An Optimizing Compiler",
  crossref =     "USENIX:1985:SCP",
  pages =        "597--610",
  year =         "1985",
  bibdate =      "Tue Feb 20 15:42:13 MST 1996",
  bibsource =    "ftp://ftp.uu.net/library/bibliography;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Computer Corp.",
}


bibtype: inproceedings
filename: fparith.bib
label: Gross:1985:FPA
author: Thomas Gross
title: Floating-Point Arithmetic on a Reduced-Instruction-Set Processor
crossref: Hwang:1985:PSC
pages: 86--92
year: 1985
bibdate: Thu Sep 01 12:02:04 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.01 12:02:04 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Gross.pdf
keywords: ARITH-7
acknowledgement: ack-nj
rawauthor: Thomas Gross
rawtitle: Floating-Point Arithmetic on a Reduced-Instruction-Set Processor
abstract:
Current single chip implementations of reduced-instruction-set processors do not support hardware floating-point operations. Instead, floating point operations have to be provided either by a co-processor or by software. This paper discusses issues arising from a software implementation of floating point arithmetic for the MIPS processor, an experimental VLSI architecture. Measurements indicate that an acceptable level of performance is achieved. but this approach is no substitute for a hardware accelerator if higher precision results are required, This paper includes instruction profiles for the basic floating point operations and evaluates the usefulness of some aspects of the instruction set.

rawabstract:
Current single chip implementations of reduced-instruction-set processors do not support hardware floating-point operations. Instead, floating point operations have to be provided either by a co-processor or by software. This paper discusses issues arising from a software implementation of floating point arithmetic for the MIPS processor, an experimental VLSI architecture. Measurements indicate that an acceptable level of performance is achieved. but this approach is no substitute for a hardware accelerator if higher precision results are required, This paper includes instruction profiles for the basic floating point operations and evaluates the usefulness of some aspects of the instruction set.

entry:
@InProceedings{Gross:1985:FPA,
  author =       "Thomas Gross",
  title =        "Floating-Point Arithmetic on a Reduced-Instruction-Set
                 Processor",
  crossref =     "Hwang:1985:PSC",
  pages =        "86--92",
  year =         "1985",
  bibdate =      "Thu Sep 01 12:02:04 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Gross.pdf",
  abstract =     "Current single chip implementations of
                 reduced-instruction-set processors do not support
                 hardware floating-point operations. Instead, floating
                 point operations have to be provided either by a
                 co-processor or by software. This paper discusses
                 issues arising from a software implementation of
                 floating point arithmetic for the MIPS processor, an
                 experimental VLSI architecture. Measurements indicate
                 that an acceptable level of performance is achieved.
                 but this approach is no substitute for a hardware
                 accelerator if higher precision results are required,
                 This paper includes instruction profiles for the basic
                 floating point operations and evaluates the usefulness
                 of some aspects of the instruction set.",
  acknowledgement = ack-nj,
  keywords =     "ARITH-7",
}


bibtype: article
filename: fparith.bib
label: Gross:1985:SIF
author: Thomas Gross
title: Software implementation of floating-point arithmetic on a reduced-instruction-set processor
journal: j-J-PAR-DIST-COMP
volume: 2
number: 4
pages: 362--375
month: nov
monthnumber: 11
year: 1985
CODEN: JPDCER
ISSN: 0743-7315 (print), 1096-0848 (electronic) OR 07437315 (print), 10960848 (electronic)
ISSNL: 0743-7315 OR 07437315
bibdate: Sat Apr 12 19:06:31 MDT 1997
bibsource: Compendex database; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1997.04.12 19:06:31 MDT
fjournal: Journal of Parallel and Distributed Computing
acknowledgement: ack-nhfb
affiliationaddress: Carnegie-Mellon Univ, Pittsburgh, PA, USA
corpsource: Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, USA
journalURL: http://www.sciencedirect.com/science/journal/07437315
journalabr: J Parallel Distrib Comput
treatment: P Practical
rawauthor: Thomas Gross
rawtitle: Software implementation of floating-point arithmetic on a reduced-instruction-set processor
keywords:
computer metatheory; computer software; data handling; digital arithmetic; floating-point arithmetic; instruction profiles; instruction sets; integrated circuits, VLSI; million instructions per minute; MIPS processor; processors; reduced-instruction-set; reduced-instruction-set processor; RISC; single chip implementations; single-chip processors; software implementation; Stanford MIPS processor; VLSI architecture

entry:
@Article{Gross:1985:SIF,
  author =       "Thomas Gross",
  title =        "Software implementation of floating-point arithmetic
                 on a reduced-instruction-set processor",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "2",
  number =       "4",
  pages =        "362--375",
  month =        nov,
  year =         "1985",
  CODEN =        "JPDCER",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Sat Apr 12 19:06:31 MDT 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA",
  classification = "723; C5230 (Digital arithmetic methods); C6130 (Data
                 handling techniques); C6140B (Machine-oriented
                 languages)",
  corpsource =   "Department of Computer Science, Carnegie-Mellon
                 University, Pittsburgh, PA, USA",
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
  journalabr =   "J Parallel Distrib Comput",
  keywords =     "computer metatheory; computer software; data handling;
                 digital arithmetic; floating-point arithmetic;
                 instruction profiles; instruction sets; integrated
                 circuits, VLSI; million instructions per minute; MIPS
                 processor; processors; reduced-instruction-set;
                 reduced-instruction-set processor; RISC; single chip
                 implementations; single-chip processors; software
                 implementation; Stanford MIPS processor; VLSI
                 architecture",
  treatment =    "P Practical",
}


bibtype: inproceedings
filename: fparith.bib
label: Gudenberg:1985:CID
author: R. Lohner and J. Wolff V. Gudenberg
title: Complex Interval Division with Maximum Accuracy
crossref: Hwang:1985:PSC
pages: 332--336
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Lohner_Gudenberg.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: R. Lohner and J. Wolff V. Gudenberg
rawtitle: Complex Interval Division with Maximum Accuracy
entry:
@InProceedings{Gudenberg:1985:CID,
  author =       "R. Lohner and J. Wolff V. Gudenberg",
  title =        "Complex Interval Division with Maximum Accuracy",
  crossref =     "Hwang:1985:PSC",
  pages =        "332--336",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Lohner_Gudenberg.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
  xxabstract =   "n/a",
}


bibtype: techreport
filename: fparith.bib
label: Hack:1985:RPS
author: James J. Hack
title: The relationship of peak to sustained performance in highly concurrent vector machine organizations
type: Research report
number: RC 11094 (\#49829)
institution: IBM T.J. Watson Research Center
address: Yorktown Heights, NY, USA
pages: 22
year: 1985
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
keywords: Floating-point arithmetic.; Performance.; Supercomputers.
acknowledgement: ack-nhfb
rawauthor: James J. Hack
rawtitle: The relationship of peak to sustained performance in highly concurrent vector machine organizations
entry:
@TechReport{Hack:1985:RPS,
  author =       "James J. Hack",
  title =        "The relationship of peak to sustained performance in
                 highly concurrent vector machine organizations",
  type =         "Research report",
  number =       "RC 11094 (\#49829)",
  institution =  "IBM T.J. Watson Research Center",
  address =      "Yorktown Heights, NY, USA",
  pages =        "22",
  year =         "1985",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Floating-point arithmetic.; Performance.;
                 Supercomputers.",
}


bibtype: article
filename: fparith.bib
label: Helyer:1985:SCC
author: R. Helyer
title: Sine and cosine calculations
journal: j-MICROPROC-MICROSYS
volume: 2
number: 5
pages: 284
month: oct
monthnumber: 10
year: 1985
CODEN: MIMID5
ISSN: 0141-9331 (print), 1872-9436 (electronic) OR 01419331 (print), 18729436 (electronic)
ISSNL: 0141-9331 OR 01419331
bibdate: Thu Sep 1 10:15:56 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.01 10:15:56 ???
fjournal: Microprocessors and Microsystems
acknowledgement: ack-nj
rawauthor: R. Helyer
rawtitle: Sine and cosine calculations
entry:
@Article{Helyer:1985:SCC,
  author =       "R. Helyer",
  title =        "Sine and cosine calculations",
  journal =      j-MICROPROC-MICROSYS,
  volume =       "2",
  number =       "5",
  pages =        "284",
  month =        oct,
  year =         "1985",
  CODEN =        "MIMID5",
  ISSN =         "0141-9331 (print), 1872-9436 (electronic)",
  ISSN-L =       "0141-9331",
  bibdate =      "Thu Sep 1 10:15:56 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "Microprocessors and Microsystems",
}


bibtype: article
filename: fparith.bib
label: Hull:1985:NT
title: Numerical Turing
journal: j-SIGNUM
volume: 20
number: 3
pages: 26--34
month: jul
monthnumber: 7
year: 1985
CODEN: SNEWD6
ISSN: 0163-5778 (print), 1558-0237 (electronic) OR 01635778 (print), 15580237 (electronic)
ISSNL: 0163-5778 OR 01635778
bibdate: Sat Aug 13 17:16:02 MDT 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.08.13 17:16:02 MDT
fjournal: ACM SIGNUM Newsletter
keywords: decimal floating-point arithmetic; documentation; languages
acknowledgement: ack-nhfb
journalURL: https://dl.acm.org/loi/signum
rawtitle: {Numerical Turing}
author:
T. E. Hull and A. Abraham and M. S. Cohen and A. F. X. Curley and C. B. Hall and D. A. Penny and J. T. M. Sawchuk

abstract:
Numerical Turing is an extension of the Turing programming language. Turing is a Pascal-like language (with convenient string handling, dynamic arrays, modules, and more general parameter lists) developed at the University of Toronto. Turing has been in use since May, 1983, and is now available on several machines.par The Numerical Turing extension is especially designed for numerical calculations. The important new features are: (a) clean decimal arithmetic, along with convenient functions for directed roundings and exponent manipulation; (b) complete precision control of variables and operations.

subject:
D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Procedures, functions, and subroutines D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, SUPERPILOT G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Computer arithmetic

rawabstract:
Numerical Turing is an extension of the Turing programming language. Turing is a Pascal-like language (with convenient string handling, dynamic arrays, modules, and more general parameter lists) developed at the University of Toronto. Turing has been in use since May, 1983, and is now available on several machines.\par The Numerical Turing extension is especially designed for numerical calculations. The important new features are: (a) clean decimal arithmetic, along with convenient functions for directed roundings and exponent manipulation; (b) complete precision control of variables and operations.

rawauthor:
T. E. Hull and A. Abraham and M. S. Cohen and A. F. X. Curley and C. B. Hall and D. A. Penny and J. T. M. Sawchuk

entry:
@Article{Hull:1985:NT,
  author =       "T. E. Hull and A. Abraham and M. S. Cohen and A. F. X.
                 Curley and C. B. Hall and D. A. Penny and J. T. M.
                 Sawchuk",
  title =        "{Numerical Turing}",
  journal =      j-SIGNUM,
  volume =       "20",
  number =       "3",
  pages =        "26--34",
  month =        jul,
  year =         "1985",
  CODEN =        "SNEWD6",
  ISSN =         "0163-5778 (print), 1558-0237 (electronic)",
  ISSN-L =       "0163-5778",
  bibdate =      "Sat Aug 13 17:16:02 MDT 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  abstract =     "Numerical Turing is an extension of the Turing
                 programming language. Turing is a Pascal-like language
                 (with convenient string handling, dynamic arrays,
                 modules, and more general parameter lists) developed at
                 the University of Toronto. Turing has been in use since
                 May, 1983, and is now available on several
                 machines.\par

                 The Numerical Turing extension is especially designed
                 for numerical calculations. The important new features
                 are: (a) clean decimal arithmetic, along with
                 convenient functions for directed roundings and
                 exponent manipulation; (b) complete precision control
                 of variables and operations.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGNUM Newsletter",
  journal-URL =  "https://dl.acm.org/loi/signum",
  keywords =     "decimal floating-point arithmetic; documentation;
                 languages",
  subject =      "D.3.3 Software, PROGRAMMING LANGUAGES, Language
                 Constructs, Procedures, functions, and subroutines \\
                 D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, SUPERPILOT \\ G.1.0 Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Computer
                 arithmetic",
}


bibtype: article
filename: fparith.bib
label: Hull:1985:PRV
author: T. E. Hull and A. Abrham
title: Properly Rounded Variable Precision Square Root
journal: j-TOMS
volume: 11
number: 3
pages: 229--237
month: sep
monthnumber: 9
year: 1985
CODEN: ACMSCU
DOI: https://doi.org/10.1145/214408.214413
ISSN: 0098-3500 (print), 1557-7295 (electronic) OR 00983500 (print), 15577295 (electronic)
ISSNL: 0098-3500 OR 00983500
MRclass: 65D15 (65G05)
MRnumber: 87a:65041
bibdate: Mon Dec 08 12:36:56 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1997.12.08 12:36:56 ???
URL: http://www.acm.org/pubs/citations/journals/toms/1985-11-3/p229-hull/
fjournal: ACM Transactions on Mathematical Software (TOMS)
keywords: algorithms; decimal floating-point arithmetic; verification
acknowledgement: ack-nhfb
journalURL: https://dl.acm.org/loi/toms
rawauthor: T. E. Hull and A. Abrham
rawtitle: Properly Rounded Variable Precision Square Root
abstract:
The square root function presented here returns a properly rounded approximation to the square root of its argument, or it raises an error condition if the argument is negative. em Properly rounded means rounded to the nearest, or to nearest even in case of a tie. It is em variable precision in that it is designed to return a $p$-digit approximation to a $p$-digit argument, for any $ p > 0 $. (Precision $p$ means $p$ decimal digits.) The program and the analysis are valid for all $ p > 0 $, but current implementations place some restrictions on $p$.

subject:
bf G.1.2: Mathematics of Computing, NUMERICAL ANALYSIS, Approximation, Elementary function approximation. bf G.4: Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis. bf G.4: Mathematics of Computing, MATHEMATICAL SOFTWARE, Certification and testing. bf G.4: Mathematics of Computing, MATHEMATICAL SOFTWARE, Verification. bf G.1.0: Mathematics of Computing, NUMERICAL ANALYSIS, General, Error analysis. bf G.1.0: Mathematics of Computing, NUMERICAL ANALYSIS, General, Numerical algorithms.

rawabstract:
The square root function presented here returns a properly rounded approximation to the square root of its argument, or it raises an error condition if the argument is negative. {\em Properly rounded} means rounded to the nearest, or to nearest even in case of a tie. It is {\em variable precision} in that it is designed to return a $p$-digit approximation to a $p$-digit argument, for any $ p > 0 $. (Precision $p$ means $p$ decimal digits.) The program and the analysis are valid for all $ p > 0 $, but current implementations place some restrictions on $p$.

entry:
@Article{Hull:1985:PRV,
  author =       "T. E. Hull and A. Abrham",
  title =        "Properly Rounded Variable Precision Square Root",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "229--237",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/214408.214413",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65D15 (65G05)",
  MRnumber =     "87a:65041",
  bibdate =      "Mon Dec 08 12:36:56 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/toms/1985-11-3/p229-hull/",
  abstract =     "The square root function presented here returns a
                 properly rounded approximation to the square root of
                 its argument, or it raises an error condition if the
                 argument is negative. {\em Properly rounded} means
                 rounded to the nearest, or to nearest even in case of a
                 tie. It is {\em variable precision} in that it is
                 designed to return a $p$-digit approximation to a
                 $p$-digit argument, for any $ p > 0 $. (Precision $p$
                 means $p$ decimal digits.) The program and the analysis
                 are valid for all $ p > 0 $, but current
                 implementations place some restrictions on $p$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "https://dl.acm.org/loi/toms",
  keywords =     "algorithms; decimal floating-point arithmetic;
                 verification",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation, Elementary function
                 approximation. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Certification and testing. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Verification. {\bf
                 G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 General, Error analysis. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Numerical
                 algorithms.",
}


bibtype: book
filename: fparith.bib
label: Hunter:1985:III
author: Colin B. Hunter and James F. Ready and Erin Farquhar
title: Introduction to the Intel iAPX 432 Architecture
publisher: pub-RESTON
address: pub-RESTON:adr
pages: vii + 181
year: 1985
ISBN: 0-8359-3222-2 OR 0835932222
ISBN13: 978-0-8359-3222-6 OR 9780835932226
LCCN: QA76.8.I267 H86 1984
bibdate: Mon Feb 7 19:14:11 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.02.07 19:14:11 ???
acknowledgement: ack-nhfb
rawauthor: Colin B. Hunter and James F. Ready and Erin Farquhar
rawtitle: Introduction to the {Intel iAPX 432} Architecture
entry:
@Book{Hunter:1985:III,
  author =       "Colin B. Hunter and James F. Ready and Erin Farquhar",
  title =        "Introduction to the {Intel iAPX 432} Architecture",
  publisher =    pub-RESTON,
  address =      pub-RESTON:adr,
  pages =        "vii + 181",
  year =         "1985",
  ISBN =         "0-8359-3222-2",
  ISBN-13 =      "978-0-8359-3222-6",
  LCCN =         "QA76.8.I267 H86 1984",
  bibdate =      "Mon Feb 7 19:14:11 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  price =        "US\$16.95",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: fparith.bib
label: Hurson:1985:SMU
author: A. R. Hurson and B. Shirazi
title: A systolic multiplier unit and its VLSI design
journal: j-COMP-ARCH-NEWS
volume: 13
number: 3
pages: 302--309
month: jun
monthnumber: 6
year: 1985
CODEN: CANED2
ISSN: 0163-5964 (print), 1943-5851 (electronic) OR 01635964 (print), 19435851 (electronic)
ISSNL: 0163-5964 OR 01635964
bibdate: Fri May 12 09:40:54 MDT 2006
bibsource: http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2006.05.12 09:40:54 MDT
fjournal: ACM SIGARCH Computer Architecture News
acknowledgement: ack-nhfb
journalURL: https://dl.acm.org/loi/sigarch
rawauthor: A. R. Hurson and B. Shirazi
rawtitle: A systolic multiplier unit and its {VLSI} design
entry:
@Article{Hurson:1985:SMU,
  author =       "A. R. Hurson and B. Shirazi",
  title =        "A systolic multiplier unit and its {VLSI} design",
  journal =      j-COMP-ARCH-NEWS,
  volume =       "13",
  number =       "3",
  pages =        "302--309",
  month =        jun,
  year =         "1985",
  CODEN =        "CANED2",
  ISSN =         "0163-5964 (print), 1943-5851 (electronic)",
  ISSN-L =       "0163-5964",
  bibdate =      "Fri May 12 09:40:54 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGARCH Computer Architecture News",
  journal-URL =  "https://dl.acm.org/loi/sigarch",
}


bibtype: inproceedings
filename: fparith.bib
label: Hwang:1985:MEC
author: Kai Hwang and Zhiwei Xu
title: Multiprocessors for Evaluating Compound Arithmetic Functions
crossref: Hwang:1985:PSC
pages: 266--275
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Hwang_Xu.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Kai Hwang and Zhiwei Xu
rawtitle: Multiprocessors for Evaluating Compound Arithmetic Functions
abstract:
A dynamic network approach is proposed for designing multifunctional arithmetic processors to support em complex, em interval, em vector, em matrix, em polynomial, and other em compound arithmetic operations. This arithmetic-network approach is extended from the multipipeline chaining concept implemented in Cray Research supercomputers. The proposed design methodology offers a viable way of developing very powerful and flexible arithmetic multiprocessors for scientific supercomputing.

rawabstract:
A dynamic network approach is proposed for designing multifunctional arithmetic processors to support {\em complex}, {\em interval}, {\em vector}, {\em matrix}, {\em polynomial}, and other {\em compound arithmetic} operations. This arithmetic-network approach is extended from the multipipeline chaining concept implemented in Cray Research supercomputers. The proposed design methodology offers a viable way of developing very powerful and flexible arithmetic multiprocessors for scientific supercomputing.

entry:
@InProceedings{Hwang:1985:MEC,
  author =       "Kai Hwang and Zhiwei Xu",
  title =        "Multiprocessors for Evaluating Compound Arithmetic
                 Functions",
  crossref =     "Hwang:1985:PSC",
  pages =        "266--275",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Hwang_Xu.pdf",
  abstract =     "A dynamic network approach is proposed for designing
                 multifunctional arithmetic processors to support {\em
                 complex}, {\em interval}, {\em vector}, {\em matrix},
                 {\em polynomial}, and other {\em compound arithmetic}
                 operations. This arithmetic-network approach is
                 extended from the multipipeline chaining concept
                 implemented in Cray Research supercomputers. The
                 proposed design methodology offers a viable way of
                 developing very powerful and flexible arithmetic
                 multiprocessors for scientific supercomputing.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Hwang:1985:SIS
author: Kai Hwang and Daniel D. Gajski and Ahmed Sameh
title: The Seventh IEEE Symposium on Computer Arithmetic: Foreword
crossref: Hwang:1985:PSC
pages: iii--iii
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Kai Hwang and Daniel D. Gajski and Ahmed Sameh
rawtitle: The {Seventh IEEE Symposium on Computer Arithmetic}: Foreword
URL:
http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_contents.pdf; http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Hwang_Gajski_Sameh.pdf; http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_preface.pdf

entry:
@InProceedings{Hwang:1985:SIS,
  author =       "Kai Hwang and Daniel D. Gajski and Ahmed Sameh",
  title =        "The {Seventh IEEE Symposium on Computer Arithmetic}:
                 Foreword",
  crossref =     "Hwang:1985:PSC",
  pages =        "iii--iii",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_contents.pdf;
                 http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Hwang_Gajski_Sameh.pdf;
                 http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_preface.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
  xxabstract =   "n/a",
}


bibtype: book
filename: fparith.bib
label: IEEE:1985:AIS
author: IEEE Task P754
title: ANSI / IEEE 754-1985, Standard for Binary Floating-Point Arithmetic
publisher: pub-IEEE-STD
address: pub-IEEE-STD:adr
pages: 20
day: 12
month: aug
monthnumber: 8
year: 1985
ISBN: 1-55937-653-8 OR 1559376538
ISBN13: 978-1-55937-653-2 OR 9781559376532
bibdate: Thu Mar 02 09:57:22 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2006.03.02 09:57:22 ???
acknowledgement: ack-nhfb
rawauthor: {IEEE Task P754}
rawtitle: {ANSI\slash IEEE 754-1985, Standard for Binary Floating-Point Arithmetic}
note:
Revised 1990. A preliminary draft was published in the January 1980 issue of IEEE Computer, together with several companion articles cite Cody:1981:APF,Coonen:1981:UDN,Coonen:1980:IGP,Coonen:1981:EIG,Hough:1981:API,Stevenson:1981:PSBa,Stevenson:1981:PSBb. The final version was republished in cite IEEE:1985:ISBa,IEEE:1985:ISBb. See also cite Waser:1982:IAD. Also standardized as em IEC 60559 (1989-01) Binary floating-point arithmetic for microprocessor systems.

URL:
http://standards.ieee.org/reading/ieee/std/busarch/754-1985.pdf; http://standards.ieee.org/reading/ieee/std_public/description/busarch/754-1985_desc.html; http://www.iec.ch/cgi-bin/procgi.pl/www/iecwww.p?wwwlang=E&wwwprog=cat-det.p&wartnum=019113; https://ieeexplore.ieee.org/iel1/2355/1316/00030711.pdf

rawnote:
Revised 1990. A preliminary draft was published in the January 1980 issue of IEEE Computer, together with several companion articles \cite{Cody:1981:APF,Coonen:1981:UDN,Coonen:1980:IGP,Coonen:1981:EIG,Hough:1981:API,Stevenson:1981:PSBa,Stevenson:1981:PSBb}. The final version was republished in \cite{IEEE:1985:ISBa,IEEE:1985:ISBb}. See also \cite{Waser:1982:IAD}. Also standardized as {{\em IEC 60559 (1989-01) Binary floating-point arithmetic for microprocessor systems}}.

entry:
@Book{IEEE:1985:AIS,
  author =       "{IEEE Task P754}",
  title =        "{ANSI\slash IEEE 754-1985, Standard for Binary
                 Floating-Point Arithmetic}",
  publisher =    pub-IEEE-STD,
  address =      pub-IEEE-STD:adr,
  pages =        "20",
  day =          "12",
  month =        aug,
  year =         "1985",
  ISBN =         "1-55937-653-8",
  ISBN-13 =      "978-1-55937-653-2",
  bibdate =      "Thu Mar 02 09:57:22 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "Revised 1990. A preliminary draft was published in the
                 January 1980 issue of IEEE Computer, together with
                 several companion articles
                 \cite{Cody:1981:APF,Coonen:1981:UDN,Coonen:1980:IGP,Coonen:1981:EIG,Hough:1981:API,Stevenson:1981:PSBa,Stevenson:1981:PSBb}.
                 The final version was republished in
                 \cite{IEEE:1985:ISBa,IEEE:1985:ISBb}. See also
                 \cite{Waser:1982:IAD}. Also standardized as {{\em IEC
                 60559 (1989-01) Binary floating-point arithmetic for
                 microprocessor systems}}.",
  price =        "US\$35.00",
  URL =          "http://standards.ieee.org/reading/ieee/std/busarch/754-1985.pdf;
                 http://standards.ieee.org/reading/ieee/std_public/description/busarch/754-1985_desc.html;
                 http://www.iec.ch/cgi-bin/procgi.pl/www/iecwww.p?wwwlang=E&wwwprog=cat-det.p&wartnum=019113;
                 https://ieeexplore.ieee.org/iel1/2355/1316/00030711.pdf",
  acknowledgement = ack-nhfb,
}


bibtype: manual
filename: fparith.bib
label: IEEE:1985:ASI
author: IEEE Task P754
title: ANSI / IEEE 754-1985, Standard for Binary Floating-Point Arithmetic
organization: IEEE, New York
pages: 20
month: aug
monthnumber: 8
year: 1985
bibdate: Thu Nov 8 14:50:30 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.08 14:50:30 ???
acknowledgement: ack-nj
rawauthor: {IEEE Task P754}
rawtitle: {ANSI}\slash {IEEE 754}-1985, Standard for Binary Floating-Point Arithmetic
note:
A preliminary draft was published in the January 1980 issue of IEEE Computer, together with several companion articles cite Cody:1981:APF,Coonen:1981:UDN,Coonen:1980:IGP,Coonen:1981:EIG,Hough:1981:API,Stevenson:1981:PSBa,Stevenson:1981:PSBb. Available from the IEEE Service Center, Piscataway, NJ, USA.

rawnote:
A preliminary draft was published in the January 1980 issue of IEEE Computer, together with several companion articles \cite{Cody:1981:APF,Coonen:1981:UDN,Coonen:1980:IGP,Coonen:1981:EIG,Hough:1981:API,Stevenson:1981:PSBa,Stevenson:1981:PSBb}. Available from the IEEE Service Center, Piscataway, NJ, USA.

entry:
@Manual{IEEE:1985:ASI,
  author =       "{IEEE Task P754}",
  title =        "{ANSI}\slash {IEEE 754}-1985, Standard for Binary
                 Floating-Point Arithmetic",
  organization = "IEEE, New York",
  month =        aug # " 12",
  year =         "1985",
  bibdate =      "Thu Nov 8 14:50:30 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "A preliminary draft was published in the January 1980
                 issue of IEEE Computer, together with several companion
                 articles
                 \cite{Cody:1981:APF,Coonen:1981:UDN,Coonen:1980:IGP,Coonen:1981:EIG,Hough:1981:API,Stevenson:1981:PSBa,Stevenson:1981:PSBb}.
                 Available from the IEEE Service Center, Piscataway, NJ,
                 USA.",
  acknowledgement = ack-nj,
}


bibtype: article
filename: fparith.bib
label: IEEE:1985:ISBa
author: IEEE
title: IEEE Standard for Binary Floating-Point Arithmetic
journal: j-SIGPLAN
volume: 22
number: 2
pages: 9--25
month: feb
monthnumber: 2
year: 1985
CODEN: SINODQ
ISSN: 0362-1340 (print), 1523-2867 (print), 1558-1160 OR 03621340 (print), 15232867 (print), 15581160
ISSNL: 0362-1340 OR 03621340
bibdate: Sun May 02 09:20:35 1999
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1999.05.02 09:20:35 ???
note: See cite IEEE:1985:AIS.
fjournal: ACM SIGPLAN Notices
acknowledgement: ack-nj
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J706
rawauthor: IEEE
rawnote: See \cite{IEEE:1985:AIS}.
rawtitle: {IEEE} Standard for Binary Floating-Point Arithmetic
entry:
@Article{IEEE:1985:ISBa,
  author =       "IEEE",
  title =        "{IEEE} Standard for Binary Floating-Point Arithmetic",
  journal =      j-SIGPLAN,
  volume =       "22",
  number =       "2",
  pages =        "9--25",
  month =        feb,
  year =         "1985",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun May 02 09:20:35 1999",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "See \cite{IEEE:1985:AIS}.",
  acknowledgement = ack-nj,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  xxnote =       "This reference is wrong; the volume 22 is from 1987,
                 and neither volume 20 (1985) nor 22 have this
                 article??",
}


bibtype: book
filename: fparith.bib
label: IEEE:1985:ISBb
title: IEEE standard for binary floating-point arithmetic
publisher: pub-IEEE
address: pub-IEEE:adr
pages: 18
year: 1985
bibdate: Sun May 02 09:20:47 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1999.05.02 09:20:47 ???
note: See cite IEEE:1985:AIS.
series: ANSI/IEEE Std 754-1985.
keywords: Computer arithmetic and logic units --- Standards.; Floating-point arithmetic --- Standards.
acknowledgement: ack-nhfb
rawnote: See \cite{IEEE:1985:AIS}.
rawtitle: {IEEE} standard for binary floating-point arithmetic
author:
IEEE Computer Society Standards Committee.Working group of the Microprocessor Standards Subcommittee and American National Standards Institute

rawauthor:
{IEEE Computer Society Standards Committee.Working group of the Microprocessor Standards Subcommittee} and {American National Standards Institute}

entry:
@Book{IEEE:1985:ISBb,
  author =       "{IEEE Computer Society Standards Committee.Working
                 group of the Microprocessor Standards Subcommittee} and
                 {American National Standards Institute}",
  title =        "{IEEE} standard for binary floating-point arithmetic",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "18",
  year =         "1985",
  bibdate =      "Sun May 02 09:20:47 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "See \cite{IEEE:1985:AIS}.",
  series =       "ANSI/IEEE Std 754-1985.",
  acknowledgement = ack-nhfb,
  keywords =     "Computer arithmetic and logic units --- Standards.;
                 Floating-point arithmetic --- Standards.",
}


bibtype: book
filename: fparith.bib
label: Intel:1985:FPL
author: Intel Staff
title: Floating Point Library for DOS 8096 Systems Manual
publisher: Intel Corporation
address: Santa Clara
pages: 60
month: dec
monthnumber: 12
year: 1985
ISBN: 0-917017-75-7 OR 0917017757
ISBN13: 978-0-917017-75-9 OR 9780917017759
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
keywords: (COMPUTER OPERATING SYSTEM); PC-DOS; TECHNOLOGY --- COMPUTERS AND COMPUTER TECHNOLOGY
language: eng
acknowledgement: ack-nhfb
rawauthor: {Intel Staff}
rawtitle: Floating Point Library for {DOS} 8096 Systems Manual
entry:
@Book{Intel:1985:FPL,
  author =       "{Intel Staff}",
  title =        "Floating Point Library for {DOS} 8096 Systems Manual",
  publisher =    "Intel Corporation",
  address =      "Santa Clara",
  pages =        "60",
  month =        dec,
  year =         "1985",
  ISBN =         "0-917017-75-7",
  ISBN-13 =      "978-0-917017-75-9",
  LCCN =         "????",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  price =        "US\$10.00",
  acknowledgement = ack-nhfb,
  keywords =     "(COMPUTER OPERATING SYSTEM); PC-DOS; TECHNOLOGY ---
                 COMPUTERS AND COMPUTER TECHNOLOGY",
  language =     "eng",
}


bibtype: book
filename: fparith.bib
label: Intel:1985:PRM
author: Intel
title: The iAPX 286 Programmer's Reference Manual
publisher: pub-INTEL
address: pub-INTEL:adr
pages: 60
year: 1985
bibdate: Sun May 2 09:20:57 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1999.05.02 09:20:57 ???
acknowledgement: ack-nhfb
rawauthor: Intel
rawtitle: The {iAPX} 286 Programmer's Reference Manual
note:
The definitive statement of what the 80286 and 80287 are. A valuable reference for instruction definitions. See also cite Intel:1983:HRM,Palmer:1984:P.

rawnote:
The definitive statement of what the 80286 and 80287 are. A valuable reference for instruction definitions. See also \cite{Intel:1983:HRM,Palmer:1984:P}.

entry:
@Book{Intel:1985:PRM,
  author =       "Intel",
  title =        "The {iAPX} 286 Programmer's Reference Manual",
  publisher =    pub-INTEL,
  address =      pub-INTEL:adr,
  year =         "1985",
  bibdate =      "Sun May 2 09:20:57 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "The definitive statement of what the 80286 and 80287
                 are. A valuable reference for instruction definitions.
                 See also \cite{Intel:1983:HRM,Palmer:1984:P}.",
  acknowledgement = ack-nhfb,
}


bibtype: manual
filename: fparith.bib
label: IntelCorporation:1985:FAL
author: Intel Corporation
title: The 8096 floating-point arithmetic library user's guide for DOS systems
organization: Intel Corporation
address: Santa Clara, CA.
pages: various
year: 1985
ISBN: 0-917017-75-7 OR 0917017757
ISBN13: 978-0-917017-75-9 OR 9780917017759
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
keywords: Computer programs.; Floating-point arithmetic.; Operating systems (Computers)
acknowledgement: ack-nhfb
rawauthor: {Intel Corporation}
rawtitle: The 8096 floating-point arithmetic library user's guide for {DOS} systems
remark:
``Order number: 122366-001.'' On cover: Software development tools. Cover title: 8096 floating point library for DOS systems.

entry:
@Manual{IntelCorporation:1985:FAL,
  author =       "{Intel Corporation}",
  title =        "The 8096 floating-point arithmetic library user's
                 guide for {DOS} systems",
  organization = "Intel Corporation",
  address =      "Santa Clara, CA.",
  pages =        "various",
  year =         "1985",
  ISBN =         "0-917017-75-7",
  ISBN-13 =      "978-0-917017-75-9",
  LCCN =         "????",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Computer programs.; Floating-point arithmetic.;
                 Operating systems (Computers)",
  remark =       "``Order number: 122366-001.'' On cover: Software
                 development tools. Cover title: 8096 floating point
                 library for DOS systems.",
}


bibtype: article
filename: fparith.bib
label: Jankowski:1985:ASC
author: M. Jankowski and H. Wozniakowski
title: The accurate solution of certain continuous problems using only single precision arithmetic
journal: j-BIT
volume: 25
number: 4
pages: 635--651
year: 1985
CODEN: BITTEL, NBITAB
ISSN: 0006-3835 (print), 1572-9125 (electronic) OR 00063835 (print), 15729125 (electronic)
ISSNL: 0006-3835 OR 00063835
MRclass: 65G05 (65L05)
MRnumber: 87d:65053
MRreviewer: E. R. Hansen
bibdate: Thu Nov 12 18:12:56 MST 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1998.11.12 18:12:56 MST
fjournal: BIT (Nordisk tidskrift for informationsbehandling)
keywords: accurate floating-point summation
acknowledgement: ack-nhfb
journalURL: http://link.springer.com/journal/10543
rawauthor: M. Jankowski and H. Wo{\'z}niakowski
rawtitle: The accurate solution of certain continuous problems using only single precision arithmetic
entry:
@Article{Jankowski:1985:ASC,
  author =       "M. Jankowski and H. Wo{\'z}niakowski",
  title =        "The accurate solution of certain continuous problems
                 using only single precision arithmetic",
  journal =      j-BIT,
  volume =       "25",
  number =       "4",
  pages =        "635--651",
  year =         "1985",
  CODEN =        "BITTEL, NBITAB",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  MRclass =      "65G05 (65L05)",
  MRnumber =     "87d:65053",
  MRreviewer =   "E. R. Hansen",
  bibdate =      "Thu Nov 12 18:12:56 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "BIT (Nordisk tidskrift for informationsbehandling)",
  journal-URL =  "http://link.springer.com/journal/10543",
  keywords =     "accurate floating-point summation",
}


bibtype: inproceedings
filename: fparith.bib
label: Jenkins:1985:CDI
author: W. Jenkins and E. Davidson and D. Paul
booktitle: IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '85
title: A custom-designed integrated circuit for the realization of residue number digital filters
publisher: pub-IEEE
address: pub-IEEE:adr
pages: 220--223
year: 1985
DOI: https://doi.org/10.1049/el:19850252
bibdate: Fri Nov 9 11:38:58 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.09 11:38:58 MST
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
rawauthor: W. Jenkins and E. Davidson and D. Paul
rawbooktitle: {IEEE} International Conference on Acoustics, Speech, and Signal Processing, {ICASSP '85}
rawtitle: A custom-designed integrated circuit for the realization of residue number digital filters
entry:
@InProceedings{Jenkins:1985:CDI,
  author =       "W. Jenkins and E. Davidson and D. Paul",
  booktitle =    "{IEEE} International Conference on Acoustics, Speech,
                 and Signal Processing, {ICASSP '85}",
  title =        "A custom-designed integrated circuit for the
                 realization of residue number digital filters",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "220--223",
  year =         "1985",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1049/el:19850252",
  ISSN =         "????",
  bibdate =      "Fri Nov 9 11:38:58 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "residue arithmetic; residue number system",
  summary =      "Results are presented on the design, layout, and
                 fabrication of a custom-designed integrated circuit for
                 a residue number system digital filter module. The
                 architecture is based on a ROM-ACCUMULATOR FIR
                 structure in which the modular arithmetic for
                 \ldots{}",
}


bibtype: inproceedings
filename: fparith.bib
label: Kahan:1985:AIA
author: W. Kahan and E. LeBlanc
title: Anomalies in the IBM ACRITH Package
crossref: Hwang:1985:PSC
pages: 322--331
year: 1985
bibdate: Thu Sep 08 00:10:49 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.08 00:10:49 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Kahan_LeBlanc.pdf
keywords: ARITH-7
acknowledgement: ack-nj
rawauthor: W. Kahan and E. LeBlanc
rawtitle: Anomalies in the {IBM ACRITH} Package
abstract:
The IBM ACRITH package of numerical software is advertised as reliable and easy to use; but sometimes its results must astonish or confuse a naive user. This report exhibits a few of the surprises. For instance, a finite continued fraction, easy to evaluate in two dozen keystrokes on a handheld calculator, causes ACRITH to overflow either exponent range or 15 Megabytes of virtual memory. Lacking access to source code, we must speculate to explain the anomalies. Some seem attributable to small bugs in the code; some to optimistic claims or oversimplifications in the code's documentation; some to flaws in the doctrine underlying the code. We conclude that different techniques than used by ACRITH might have been about as accurate and yet more economical, robust and perspicuous.

rawabstract:
The IBM ACRITH package of numerical software is advertised as reliable and easy to use; but sometimes its results must astonish or confuse a naive user. This report exhibits a few of the surprises. For instance, a finite continued fraction, easy to evaluate in two dozen keystrokes on a handheld calculator, causes ACRITH to overflow either exponent range or 15 Megabytes of virtual memory. Lacking access to source code, we must speculate to explain the anomalies. Some seem attributable to small bugs in the code; some to optimistic claims or oversimplifications in the code's documentation; some to flaws in the doctrine underlying the code. We conclude that different techniques than used by ACRITH might have been about as accurate and yet more economical, robust and perspicuous.

entry:
@InProceedings{Kahan:1985:AIA,
  author =       "W. Kahan and E. LeBlanc",
  title =        "Anomalies in the {IBM ACRITH} Package",
  crossref =     "Hwang:1985:PSC",
  pages =        "322--331",
  year =         "1985",
  bibdate =      "Thu Sep 08 00:10:49 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Kahan_LeBlanc.pdf",
  abstract =     "The IBM ACRITH package of numerical software is
                 advertised as reliable and easy to use; but sometimes
                 its results must astonish or confuse a naive user. This
                 report exhibits a few of the surprises. For instance, a
                 finite continued fraction, easy to evaluate in two
                 dozen keystrokes on a handheld calculator, causes
                 ACRITH to overflow either exponent range or 15
                 Megabytes of virtual memory. Lacking access to source
                 code, we must speculate to explain the anomalies. Some
                 seem attributable to small bugs in the code; some to
                 optimistic claims or oversimplifications in the code's
                 documentation; some to flaws in the doctrine underlying
                 the code. We conclude that different techniques than
                 used by ACRITH might have been about as accurate and
                 yet more economical, robust and perspicuous.",
  acknowledgement = ack-nj,
  keywords =     "ARITH-7",
}


bibtype: article
filename: fparith.bib
label: Karpinski:1985:PFP
author: R. Karpinski
title: Paranoia: a Floating-Point Benchmark
journal: j-BYTE
volume: 10
number: 2
pages: 223--235
month: feb
monthnumber: 2
year: 1985
CODEN: BYTEDJ
ISSN: 0360-5280 (print), 1082-7838 (electronic) OR 03605280 (print), 10827838 (electronic)
ISSNL: 0360-5280 OR 03605280
bibdate: Thu Sep 1 10:15:07 1994
bibsource: ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1994.09.01 10:15:07 ???
fjournal: BYTE Magazine
acknowledgement: ack-nj
rawauthor: R. Karpinski
rawtitle: Paranoia: a Floating-Point Benchmark
entry:
@Article{Karpinski:1985:PFP,
  author =       "R. Karpinski",
  title =        "Paranoia: a Floating-Point Benchmark",
  journal =      j-BYTE,
  volume =       "10",
  number =       "2",
  pages =        "223--235",
  month =        feb,
  year =         "1985",
  CODEN =        "BYTEDJ",
  ISSN =         "0360-5280 (print), 1082-7838 (electronic)",
  ISSN-L =       "0360-5280",
  bibdate =      "Thu Sep 1 10:15:07 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nj,
  fjournal =     "BYTE Magazine",
}


bibtype: inproceedings
filename: fparith.bib
label: Kaushik:1985:MEC
author: Saroj Kaushik
title: Multiple Error Correction and Addictive Overflow Detection with Magnitude Indices in Residue Code
crossref: Hwang:1985:PSC
pages: 278--284
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Kaushik.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Saroj Kaushik
rawtitle: Multiple Error Correction and Addictive Overflow Detection with Magnitude Indices in Residue Code
abstract:
A new approach for correcting multiple errors and detecting an additive overflow in the Residue Number System (RNS) is suggested. It works with the code whose redundancy is in the form of magnitude indices. The residue representation of a number with magnitude index is reconsidered. The RNS with magnitude index were first studied by Sasaki [16] and Rao [15] and then by Barsi and Maestrini [5,6]. The range of a given RNS is divided into intervals of equal width and the magnitude of a number X is defined as a integer locating X into one of such intervals. We have proposed algorithm which detects and corrects multiple errors in residue number. The algorithms for special cases viz., single burst residue error and single residue error are also suggested. Some of the advantages are pointed out over the existing approaches.

rawabstract:
A new approach for correcting multiple errors and detecting an additive overflow in the Residue Number System (RNS) is suggested. It works with the code whose redundancy is in the form of magnitude indices. The residue representation of a number with magnitude index is reconsidered. The RNS with magnitude index were first studied by Sasaki [16] and Rao [15] and then by Barsi and Maestrini [5,6]. The range of a given RNS is divided into intervals of equal width and the magnitude of a number X is defined as a integer locating X into one of such intervals. We have proposed algorithm which detects and corrects multiple errors in residue number. The algorithms for special cases viz., single burst residue error and single residue error are also suggested. Some of the advantages are pointed out over the existing approaches.

entry:
@InProceedings{Kaushik:1985:MEC,
  author =       "Saroj Kaushik",
  title =        "Multiple Error Correction and Addictive Overflow
                 Detection with Magnitude Indices in Residue Code",
  crossref =     "Hwang:1985:PSC",
  pages =        "278--284",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Kaushik.pdf",
  abstract =     "A new approach for correcting multiple errors and
                 detecting an additive overflow in the Residue Number
                 System (RNS) is suggested. It works with the code whose
                 redundancy is in the form of magnitude indices. The
                 residue representation of a number with magnitude index
                 is reconsidered. The RNS with magnitude index were
                 first studied by Sasaki [16] and Rao [15] and then by
                 Barsi and Maestrini [5,6]. The range of a given RNS is
                 divided into intervals of equal width and the magnitude
                 of a number X is defined as a integer locating X into
                 one of such intervals. We have proposed algorithm which
                 detects and corrects multiple errors in residue number.
                 The algorithms for special cases viz., single burst
                 residue error and single residue error are also
                 suggested. Some of the advantages are pointed out over
                 the existing approaches.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: article
filename: fparith.bib
label: Klatte:1985:ASS
author: R. Klatte and C. P. Ullrich and J. W. Von Gudenberg
title: Arithmetic Specification for Scientific Computation in ADA
journal: j-IEEE-TRANS-COMPUT
volume: C-34
number: 11
pages: 996--1005
month: nov
monthnumber: 11
year: 1985
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1985.1676532
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 08:33:34 MDT 2011
bibtimestamp: 2011.07.10 08:33:34 MDT
URL: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676532
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: R. Klatte and C. P. Ullrich and J. W. {Von Gudenberg}
rawtitle: Arithmetic Specification for Scientific Computation in {ADA}
entry:
@Article{Klatte:1985:ASS,
  author =       "R. Klatte and C. P. Ullrich and J. W. {Von
                 Gudenberg}",
  title =        "Arithmetic Specification for Scientific Computation in
                 {ADA}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-34",
  number =       "11",
  pages =        "996--1005",
  month =        nov,
  year =         "1985",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1985.1676532",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 08:33:34 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  URL =          "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676532",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: inproceedings
filename: fparith.bib
label: Kobayashi:1985:MTC
author: Hideaki Kobayashi
title: A Multioperand Two's Complement Addition Algorithm
crossref: Hwang:1985:PSC
pages: 16--19
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Kobayashi.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Hideaki Kobayashi
rawtitle: A Multioperand Two's Complement Addition Algorithm
abstract:
This paper presents a novel algorithm for summing a set of 2's complement numbers in parallel. The 2's complement addition is converted to an equivalent parallel summation of unsigned numbers. The conversion is performed by simply complementing all the sign bits. Only a few constant bits are required for sign correction. This algorithm is suitable for computer-aided design (CAD) of custom VLSI.

rawabstract:
This paper presents a novel algorithm for summing a set of 2's complement numbers in parallel. The 2's complement addition is converted to an equivalent parallel summation of unsigned numbers. The conversion is performed by simply complementing all the sign bits. Only a few constant bits are required for sign correction. This algorithm is suitable for computer-aided design (CAD) of custom VLSI.

entry:
@InProceedings{Kobayashi:1985:MTC,
  author =       "Hideaki Kobayashi",
  title =        "A Multioperand Two's Complement Addition Algorithm",
  crossref =     "Hwang:1985:PSC",
  pages =        "16--19",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Kobayashi.pdf",
  abstract =     "This paper presents a novel algorithm for summing a
                 set of 2's complement numbers in parallel. The 2's
                 complement addition is converted to an equivalent
                 parallel summation of unsigned numbers. The conversion
                 is performed by simply complementing all the sign bits.
                 Only a few constant bits are required for sign
                 correction. This algorithm is suitable for
                 computer-aided design (CAD) of custom VLSI.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: manual
filename: fparith.bib
label: Koopman:1985:FFP
author: Philip J. Koopman
title: FORTH floating point
volume: 3
organization: Mountain View Press
address: Mountain View, CA, USA
edition: Revised
pages: 346
year: 1985
ISBN: 0-914699-28-8 OR 0914699288
ISBN13: 978-0-914699-28-6 OR 9780914699286
bibdate: Sat Feb 24 15:01:45 MST 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 1996.02.24 15:01:45 MST
series: MVP-FORTH books
acknowledgement: ack-nhfb
rawauthor: Philip J. Koopman
rawtitle: {FORTH} floating point
keywords:
Electronic digital computers --- Programming; Floating-point arithmetic; FORTH (Computer program language)

remark:
Running title: MVP-FORTH integer and floating point math. A complete glossary of MVP-FORTH math extensions.

entry:
@Manual{Koopman:1985:FFP,
  author =       "Philip J. Koopman",
  title =        "{FORTH} floating point",
  volume =       "3",
  organization = "Mountain View Press",
  address =      "Mountain View, CA, USA",
  edition =      "Revised",
  pages =        "346",
  year =         "1985",
  ISBN =         "0-914699-28-8",
  ISBN-13 =      "978-0-914699-28-6",
  LCCN =         "????",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  series =       "MVP-FORTH books",
  acknowledgement = ack-nhfb,
  keywords =     "Electronic digital computers --- Programming;
                 Floating-point arithmetic; FORTH (Computer program
                 language)",
  remark =       "Running title: MVP-FORTH integer and floating point
                 math. A complete glossary of MVP-FORTH math
                 extensions.",
}


bibtype: inproceedings
filename: fparith.bib
label: Kornerup:1985:FPL
author: Peter Kornerup and David W. Matula
title: Finite Precision Lexicographic Continued Fraction Number Systems
crossref: Hwang:1985:PSC
pages: 207--214
year: 1985
bibdate: Wed Nov 14 18:06:21 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.14 18:06:21 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Kornerup_Matula.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Peter Kornerup and David W. Matula
rawtitle: Finite Precision Lexicographic Continued Fraction Number Systems
abstract:
Lexicographic continued fraction binary (LCF) representation provides an order preserving bitstring representation of the non negative real numbers where every rational number has a finite length bitstring representation. We investigate the precision of $k$-bit LCF approximation. The maximum gap size over $ [0, 1) $ for $ (k + 1) $-bit LCF representation is shown to be less than $ 2^0.81k $, comparable to binary coded decimal in worst case representation efficiency. The distribution of gap sizes for $ (k + 1) $-bit LCF representation over $ [0, 1] $ is shown on a logarithmic scale to be bell shaped between $ 2^0.81k $ and $ 2^-1.39k $, becoming more peaked near the value corresponding to uniform spacing, $ 2^-k $, with increasing $k$.

rawabstract:
Lexicographic continued fraction binary (LCF) representation provides an order preserving bitstring representation of the non negative real numbers where every rational number has a finite length bitstring representation. We investigate the precision of $k$-bit LCF approximation. The maximum gap size over $ [0, 1) $ for $ (k + 1) $-bit LCF representation is shown to be less than $ 2^{0.81k} $, comparable to binary coded decimal in worst case representation efficiency. The distribution of gap sizes for $ (k + 1) $-bit LCF representation over $ [0, 1] $ is shown on a logarithmic scale to be bell shaped between $ 2^{0.81k} $ and $ 2^{-1.39k} $, becoming more peaked near the value corresponding to uniform spacing, $ 2^{-k} $, with increasing $k$.

entry:
@InProceedings{Kornerup:1985:FPL,
  author =       "Peter Kornerup and David W. Matula",
  title =        "Finite Precision Lexicographic Continued Fraction
                 Number Systems",
  crossref =     "Hwang:1985:PSC",
  pages =        "207--214",
  year =         "1985",
  bibdate =      "Wed Nov 14 18:06:21 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Kornerup_Matula.pdf",
  abstract =     "Lexicographic continued fraction binary (LCF)
                 representation provides an order preserving bitstring
                 representation of the non negative real numbers where
                 every rational number has a finite length bitstring
                 representation. We investigate the precision of $k$-bit
                 LCF approximation. The maximum gap size over $ [0, 1) $
                 for $ (k + 1) $-bit LCF representation is shown to be
                 less than $ 2^{0.81k} $, comparable to binary coded
                 decimal in worst case representation efficiency. The
                 distribution of gap sizes for $ (k + 1) $-bit LCF
                 representation over $ [0, 1] $ is shown on a
                 logarithmic scale to be bell shaped between $ 2^{0.81k}
                 $ and $ 2^{-1.39k} $, becoming more peaked near the
                 value corresponding to uniform spacing, $ 2^{-k} $,
                 with increasing $k$.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Krishnan:1985:CDS
author: R. Krishnan and G. Jullien and W. Miller
booktitle: IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '85
title: Complex digital signal processing using quadratic residue number systems
publisher: pub-IEEE
address: pub-IEEE:adr
pages: 764--767
year: 1985
DOI: https://doi.org/10.1049/el:19850252
bibdate: Fri Nov 9 11:38:58 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.09 11:38:58 MST
keywords: residue arithmetic; residue number system
acknowledgement: ack-nhfb
rawauthor: R. Krishnan and G. Jullien and W. Miller
rawbooktitle: {IEEE} International Conference on Acoustics, Speech, and Signal Processing, {ICASSP '85}
rawtitle: Complex digital signal processing using quadratic residue number systems
entry:
@InProceedings{Krishnan:1985:CDS,
  author =       "R. Krishnan and G. Jullien and W. Miller",
  booktitle =    "{IEEE} International Conference on Acoustics, Speech,
                 and Signal Processing, {ICASSP '85}",
  title =        "Complex digital signal processing using quadratic
                 residue number systems",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "764--767",
  year =         "1985",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1049/el:19850252",
  ISSN =         "????",
  bibdate =      "Fri Nov 9 11:38:58 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  keywords =     "residue arithmetic; residue number system",
  summary =      "Recently, the Quadratic Residue Number System (QRNS)
                 has been introduced [4,5,6], which allows the
                 multiplication of complex integers with two real
                 multiplications. Restrictions on the form of the moduli
                 can be removed if an increase in real \ldots{}",
}


bibtype: inproceedings
filename: fparith.bib
label: Kurokawa:1985:PT
author: Takakazu Kurokawa and Hideo Aiso
title: Polynomial Transformer
crossref: Hwang:1985:PSC
pages: 153--158
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Kurokawa_Aiso.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Takakazu Kurokawa and Hideo Aiso
rawtitle: Polynomial Transformer
abstract:
Any relations among finite fields can be transformed to a unique polynomial of one variable using Galois Fields. In this paper, we explain the design of a ``Polynomial Transformer'' which executes the transformation.par Polynomial Transformer consists of very simple and iterative logic, and it is very suitable for parallel and pipelined VLSI algorithm. Moreover, three dimensional construction of a Polynomial Transformer is possible. Thus, it serves as an example of a typical three dimensional VLSI.par Its application can be found in Polynomial Transformation, disturbance of data and so on.

rawabstract:
Any relations among finite fields can be transformed to a unique polynomial of one variable using Galois Fields. In this paper, we explain the design of a ``Polynomial Transformer'' which executes the transformation.\par Polynomial Transformer consists of very simple and iterative logic, and it is very suitable for parallel and pipelined VLSI algorithm. Moreover, three dimensional construction of a Polynomial Transformer is possible. Thus, it serves as an example of a typical three dimensional VLSI.\par Its application can be found in Polynomial Transformation, disturbance of data and so on.

entry:
@InProceedings{Kurokawa:1985:PT,
  author =       "Takakazu Kurokawa and Hideo Aiso",
  title =        "Polynomial Transformer",
  crossref =     "Hwang:1985:PSC",
  pages =        "153--158",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Kurokawa_Aiso.pdf",
  abstract =     "Any relations among finite fields can be transformed
                 to a unique polynomial of one variable using Galois
                 Fields. In this paper, we explain the design of a
                 ``Polynomial Transformer'' which executes the
                 transformation.\par

                 Polynomial Transformer consists of very simple and
                 iterative logic, and it is very suitable for parallel
                 and pipelined VLSI algorithm. Moreover, three
                 dimensional construction of a Polynomial Transformer is
                 possible. Thus, it serves as an example of a typical
                 three dimensional VLSI.\par

                 Its application can be found in Polynomial
                 Transformation, disturbance of data and so on.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: article
filename: fparith.bib
label: Kwan:1985:MOW
author: Hon Kwan
title: A multi-output wave --- digital biquad using magnitude truncation instead of controlled rounding
journal: j-IEEE-TRANS-CIRCUITS-SYST
volume: 32
number: 11
pages: 1185--1187
month: nov
monthnumber: 11
year: 1985
CODEN: ICSYBT
ISSN: 0098-4094 (print), 1558-1276 (electronic) OR 00984094 (print), 15581276 (electronic)
ISSNL: 0098-4094 OR 00984094
bibdate: Sat Jul 16 11:25:03 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2005.07.16 11:25:03 MDT
fjournal: IEEE Transactions on Circuits and Systems
acknowledgement: ack-nhfb
rawauthor: Hon Kwan
rawtitle: A multi-output wave --- digital biquad using magnitude truncation instead of controlled rounding
entry:
@Article{Kwan:1985:MOW,
  author =       "Hon Kwan",
  title =        "A multi-output wave --- digital biquad using magnitude
                 truncation instead of controlled rounding",
  journal =      j-IEEE-TRANS-CIRCUITS-SYST,
  volume =       "32",
  number =       "11",
  pages =        "1185--1187",
  month =        nov,
  year =         "1985",
  CODEN =        "ICSYBT",
  ISSN =         "0098-4094 (print), 1558-1276 (electronic)",
  ISSN-L =       "0098-4094",
  bibdate =      "Sat Jul 16 11:25:03 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Circuits and Systems",
  summary =      "The use of magnitude truncation instead of controlled
                 rounding for the elimination of zero-input and
                 constant-input oscillations in the wave digital biquad
                 derived from the feedforwardRC-active configuration is
                 described. We also describe \ldots{}",
}


bibtype: article
filename: fparith.bib
label: Lang:1985:ICL
author: J. H. Lang and C. A. Zukowski and R. O. Lamaire and Chae Han
title: Integrated-Circuit Logarithmic Arithmetic Units
journal: j-IEEE-TRANS-COMPUT
volume: C-34
number: 5
pages: 475--483
month: may
monthnumber: 5
year: 1985
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1985.1676588
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 08:32:33 MDT 2011
bibtimestamp: 2011.07.10 08:32:33 MDT
URL: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676588
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: J. H. Lang and C. A. Zukowski and R. O. Lamaire and Chae Han
rawtitle: Integrated-Circuit Logarithmic Arithmetic Units
entry:
@Article{Lang:1985:ICL,
  author =       "J. H. Lang and C. A. Zukowski and R. O. Lamaire and
                 Chae Han",
  title =        "Integrated-Circuit Logarithmic Arithmetic Units",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-34",
  number =       "5",
  pages =        "475--483",
  month =        may,
  year =         "1985",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1985.1676588",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 08:32:33 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  URL =          "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676588",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: article
filename: fparith.bib
label: Li:1985:FCD
author: S.-Y. R. Li
title: Fast Constant Division Routines
journal: j-IEEE-TRANS-COMPUT
volume: C-34
number: 9
pages: 866--869
month: sep
monthnumber: 9
year: 1985
CODEN: ITCOB4
DOI: https://doi.org/10.1109/TC.1985.1676646
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Sun Jul 10 08:33:33 MDT 2011
bibtimestamp: 2011.07.10 08:33:33 MDT
URL: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676646
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
ajournal: IEEE Trans. Comput.
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: S.-Y. R. Li
rawtitle: Fast Constant Division Routines
entry:
@Article{Li:1985:FCD,
  author =       "S.-Y. R. Li",
  title =        "Fast Constant Division Routines",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-34",
  number =       "9",
  pages =        "866--869",
  month =        sep,
  year =         "1985",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1985.1676646",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 08:33:33 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
  URL =          "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676646",
  acknowledgement = ack-nhfb,
  ajournal =     "IEEE Trans. Comput.",
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}


bibtype: inproceedings
filename: fparith.bib
label: Li:1985:PAC
author: Xiaobo Li and Lionel M. Ni
title: A Pipeline Architecture for Computing Cumulative Hypergeometric Distributions
crossref: Hwang:1985:PSC
pages: 166--172
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Li_Ni.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Xiaobo Li and Lionel M. Ni
rawtitle: A Pipeline Architecture for Computing Cumulative Hypergeometric Distributions
abstract:
The hypergeometric distribution is a widely used arithmetic function and is fundamental to many statistical sampling and statistical pattern recognition problems. Computation of the cumulative hypergeometric distribution function, $ H(a) $, is extremely time-consuming. As a result, many approximation algorithms have been proposed to evaluate the cumulative hypergeometric distribution. This paper describes a two-level pipeline architecture for computing $ H(a) $ with computation complexity reduced to $ c + a $, where $c$ is a constant. The main part of the design is a type of recurrence computation. A modular and systematic approach is suggested to implement the recurrence formula. The computation complexity of the proposed architecture is also compared with various other known methods. The highly regular structure of the design can lead to efficient VLSI implementation.

rawabstract:
The hypergeometric distribution is a widely used arithmetic function and is fundamental to many statistical sampling and statistical pattern recognition problems. Computation of the cumulative hypergeometric distribution function, $ H(a) $, is extremely time-consuming. As a result, many approximation algorithms have been proposed to evaluate the cumulative hypergeometric distribution. This paper describes a two-level pipeline architecture for computing $ H(a) $ with computation complexity reduced to $ c + a $, where $c$ is a constant. The main part of the design is a type of recurrence computation. A modular and systematic approach is suggested to implement the recurrence formula. The computation complexity of the proposed architecture is also compared with various other known methods. The highly regular structure of the design can lead to efficient VLSI implementation.

entry:
@InProceedings{Li:1985:PAC,
  author =       "Xiaobo Li and Lionel M. Ni",
  title =        "A Pipeline Architecture for Computing Cumulative
                 Hypergeometric Distributions",
  crossref =     "Hwang:1985:PSC",
  pages =        "166--172",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Li_Ni.pdf",
  abstract =     "The hypergeometric distribution is a widely used
                 arithmetic function and is fundamental to many
                 statistical sampling and statistical pattern
                 recognition problems. Computation of the cumulative
                 hypergeometric distribution function, $ H(a) $, is
                 extremely time-consuming. As a result, many
                 approximation algorithms have been proposed to evaluate
                 the cumulative hypergeometric distribution. This paper
                 describes a two-level pipeline architecture for
                 computing $ H(a) $ with computation complexity reduced
                 to $ c + a $, where $c$ is a constant. The main part of
                 the design is a type of recurrence computation. A
                 modular and systematic approach is suggested to
                 implement the recurrence formula. The computation
                 complexity of the proposed architecture is also
                 compared with various other known methods. The highly
                 regular structure of the design can lead to efficient
                 VLSI implementation.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


bibtype: inproceedings
filename: fparith.bib
label: Ling:1985:NFL
author: Fuyun Ling and D. Manolakis and J. Proakis
booktitle: IEEE International Conference on Acoustics, Speech, and Signal Processing: ICASSP '85
title: New forms of LS lattice algorithms and an analysis of their round-off error characteristics
publisher: pub-IEEE
address: pub-IEEE:adr
pages: 1739--1742
year: 1985
bibdate: Sat Jul 16 11:25:04 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2005.07.16 11:25:04 MDT
acknowledgement: ack-nhfb
rawauthor: Fuyun Ling and D. Manolakis and J. Proakis
rawbooktitle: {IEEE} International Conference on Acoustics, Speech, and Signal Processing: {ICASSP '85}
rawtitle: New forms of {LS} lattice algorithms and an analysis of their round-off error characteristics
entry:
@InProceedings{Ling:1985:NFL,
  author =       "Fuyun Ling and D. Manolakis and J. Proakis",
  booktitle =    "{IEEE} International Conference on Acoustics, Speech,
                 and Signal Processing: {ICASSP '85}",
  title =        "New forms of {LS} lattice algorithms and an analysis
                 of their round-off error characteristics",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "1739--1742",
  year =         "1985",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Sat Jul 16 11:25:04 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  acknowledgement = ack-nhfb,
  summary =      "New formulas are presented for direct updating of the
                 reflection coefficients in the a priori and a
                 posteriori forms of the least squares (LS) lattice
                 algorithms. An analysis of the numerical
                 characteristics of the new LS lattice forms is given
                 and \ldots{}",
}


bibtype: inproceedings
filename: fparith.bib
label: Liu:1985:DVR
author: Wentai Liu and J. C. Duh and Daniel E. Atkins
title: The Design of a Vector-Radix 2DFFT Chip
crossref: Hwang:1985:PSC
pages: 231--236
year: 1985
bibdate: Fri Nov 16 08:47:34 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib
bibtimestamp: 2007.11.16 08:47:34 ???
URL: http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Liu_Duh_Atkins.pdf
keywords: ARITH-7
acknowledgement: ack-nhfb
rawauthor: Wentai Liu and J. C. Duh and Daniel E. Atkins
rawtitle: The Design of a Vector-Radix {2DFFT} Chip
abstract:
Architectures based on the vector-radix 2DFFT algorithm and hence can avoid the matrix transpose problem have been proposed. The unique feature of the proposed architectures is that the data can be driven into the arithmetic processors in a pipeline fashion. This paper presents a prototype chip, which has been designed in $ 2 mu $ m NMOS technology, for the generalized butterfly unit. The chip is a two-stage pipelined processor. The design experience, timing information, and the chip features including four multipliers, one adder / subtracter and PLA controllers are presented.

rawabstract:
Architectures based on the vector-radix 2DFFT algorithm and hence can avoid the matrix transpose problem have been proposed. The unique feature of the proposed architectures is that the data can be driven into the arithmetic processors in a pipeline fashion. This paper presents a prototype chip, which has been designed in $ 2 \mu $ m NMOS technology, for the generalized butterfly unit. The chip is a two-stage pipelined processor. The design experience, timing information, and the chip features including four multipliers, one adder\slash subtracter and PLA controllers are presented.

entry:
@InProceedings{Liu:1985:DVR,
  author =       "Wentai Liu and J. C. Duh and Daniel E. Atkins",
  title =        "The Design of a Vector-Radix {2DFFT} Chip",
  crossref =     "Hwang:1985:PSC",
  pages =        "231--236",
  year =         "1985",
  bibdate =      "Fri Nov 16 08:47:34 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Liu_Duh_Atkins.pdf",
  abstract =     "Architectures based on the vector-radix 2DFFT
                 algorithm and hence can avoid the matrix transpose
                 problem have been proposed. The unique feature of the
                 proposed architectures is that the data can be driven
                 into the arithmetic processors in a pipeline fashion.
                 This paper presents a prototype chip, which has been
                 designed in $ 2 \mu $ m NMOS technology, for the
                 generalized butterfly unit. The chip is a two-stage
                 pipelined processor. The design experience, timing
                 information, and the chip features including four
                 multipliers, one adder\slash subtracter and PLA
                 controllers are presented.",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-7",
}


