SQLite format 3@ Üõ
ø¸NËµ!¸ˆMšutablebibtabbibtabCREATE TABLE bibtab (
authorcount INTEGER,
editorcount INTEGER,
pagecount INTEGER,
bibtype TEXT,
filename TEXT,
label TEXT,
author TEXT,
editor TEXT,
booktitle TEXT,
title TEXT,
crossref TEXT,
chapter TEXT,
journal TEXT,
volume TEXT,
type TEXT,
number TEXT,
institution TEXT,
organization TEXT,
publisher TEXT,
school TEXT,
address TEXT,
edition TEXT,
pages TEXT,
day TEXT,
month TEXT,
monthnumber TEXT,
year TEXT,
CODEN TEXT,
DOI TEXT,
ISBN TEXT,
ISBN13 TEXT,
ISSN TEXT,
ISSNL TEXT,
LCCN TEXT,
MRclass TEXT,
MRnumber TEXT,
MRreviewer TEXT,
bibdate TEXT,
bibsource TEXT,
bibtimestamp TEXT,
note TEXT,
series TEXT,
URL TEXT,
abstract TEXT,
fjournal TEXT,
keywords TEXT,
language TEXT,
remark TEXT,
subject TEXT,
TOC TEXT,
ZMnumber TEXT,
acknowledgement TEXT,
advisor TEXT,
affiliation TEXT,
affiliationaddress TEXT,
ajournal TEXT,
annote TEXT,
articleno TEXT,
authordates TEXT,
bookDOI TEXT,
bookURL TEXT,
bookpages TEXT,
classcodes TEXT,
corpsource TEXT,
editordates TEXT,
howpublished TEXT,
journalURL TEXT,
journalabr TEXT,
key TEXT,
onlinedate TEXT,
reviewer TEXT,
subjectdates TEXT,
thesaurus TEXT,
treatment TEXT,
ZMclass TEXT,
issue TEXT,
rawabstract TEXT,
rawauthor TEXT,
rawbooktitle TEXT,
raweditor TEXT,
rawnote TEXT,
rawtitle TEXT,
entry TEXT NOT NULL UNIQUE
)+?indexsqlite_autoindex_bibtab_1bibtabj/tablenamtabnamtabCREATE TABLE namtab (
name TEXT NOT NULL UNIQUE,
count INTEGER
)+?indexsqlite_autoindex_namtab_1namtab{QtablestrtabstrtabCREATE TABLE strtab (
key TEXT,
value TEXT,
entry TEXT NOT NULL UNIQUE
)+?indexsqlite_autoindex_strtab_1strtab’ ŽûöñìæàÚÔÎÈÂ¼¶°ª¤ž˜’art F. Oberman, email: path =stuart.oberman@amd.com=@String{acksfo = "Stuart F. Oberman,
email: \path=stuart.oberman@amd.com="}„ ƒ#…ackrfbRonald F. Boisvert, Applied and Computational Mathematics Division, National Institute of Standards and Technology, Gaithersburg, MD 20899, USA, Tel: +1 301 975 3812, email: path =boisvert@cam.nist.gov=@String{ackrfb = "Ronald F. Boisvert,
Applied and Computational Mathematics Division,
National Institute of Standards and Technology,
Gaithersburg, MD 20899, USA,
Tel: +1 301 975 3812,
email: \path=boisvert@cam.nist.gov="}ƒ3‚„KackpbPreston Briggs, Tera Computer Company, 2815 Eastlake East, Seattle, WA 98102, USA, Tel: +1 206 3250800, email: path preston@tera.com@String{ackpb = "Preston Briggs,
Tera Computer Company,
2815 Eastlake East,
Seattle, WA 98102,
USA,
Tel: +1 206 3250800,
email: \pathpreston@tera.com"}‚Oƒ
acknjNorbert Juffa, 2445 Mission College Blvd. Santa Clara, CA 95054 USA email: path =norbert@iit.com=@String{acknj = "Norbert Juffa,
2445 Mission College Blvd.
Santa Clara, CA 95054
USA
email: \path=norbert@iit.com="}†v…ˆcacknhfbNelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 841120090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, email: path beebe@math.utah.edu, path beebe@acm.org, path beebe@computer.org (Internet), URL: path http://www.math.utah.edu/~beebe/@String{acknhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 841120090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
email: \pathbeebe@math.utah.edu,
\pathbeebe@acm.org,
\pathbeebe@computer.org (Internet),
URL: \pathhttp://www.math.utah.edu/~beebe/"}ƒq‚W…ackmfcMichael F. Cowlishaw, IBM UK (MP5), PO Box 31, Birmingham Road, Warwick, CV34 5JL, UK, email: path mfc@uk.ibm.com, URL: path http://www2.hursley.ibm.com/decimal@String{ackmfc = "Michael F. Cowlishaw,
IBM UK (MP5),
PO Box 31,
Birmingham Road,
Warwick, CV34 5JL,
UK,
email: \pathmfc@uk.ibm.com,
URL: \pathhttp://www2.hursley.ibm.com/decimal"}„ƒ…ackkrKarin Remington, National Institute of Standards and Technology, Building 820, Room 365, Gaithersburg, MD 20899, USA, Tel: +1 301 9755119, FAX: +1 301 9904127, email: path karin@cam.nist.gov@String{ackkr = "Karin Remington,
National Institute of Standards and Technology,
Building 820, Room 365,
Gaithersburg, MD 20899, USA,
Tel: +1 301 9755119,
FAX: +1 301 9904127,
email: \pathkarin@cam.nist.gov"}ƒ‚„ackjrJon Rokne, Department of Computer Science, The University of Calgary, 2500 University Drive N.W., Calgary, Alberta T2N 1N4, Canada@String{ackjr = "Jon Rokne,
Department of Computer Science,
The University of Calgary,
2500 University Drive N.W.,
Calgary, Alberta T2N 1N4,
Canada"}sEackjhJohn Harrison, email: path =johnh@ichips.intel.com=@String{ackjh = "John Harrison,
email: \path=johnh@ichips.intel.com="}]ackjgJoe Grcar, „ ‹ƒt ‰ƒO ˆƒ0 †ƒ
„‚m ‚‚P ‚6 ‚ } d zL x5 w u sa rE o% n
¨ ~Bû¤N
ö
m
/÷q"æ¨PH
B„<G@String{instCSC:adr = "Salt Lake City, UT 84112, USA"}<‚{@String{instCSC = "Center for Scientific Computing,
Department of Mathematics, University of
Utah"}L@String{instCSPURDUE:adr = "West Lafayette, IN 479072107, USA"}}}@String{instCSPURDUE = "Department of Computer Science, Purdue
University"}:y@String{instBERKELEYEECS:adr = "Berkeley, CA, USA"}Kƒ@String{instBERKELEYEECS = "Department of Electrical Engineering and
Computer Science, University of California,
Berkeley"}:y@String{instBERKELEYCS:adr = "Berkeley, CA, USA"}‚@String{instBERKELEYCS = "Department of Computer Science, University
of California"}:y@String{instBERKELEYCPAM:adr = "Berkeley, CA, USA"}
‚@String{instBERKELEYCPAM = "Center for Pure and Applied Mathematics,
University of California"}:y@String{instBERKELEY:adr = "Berkeley, CA, USA"}B@String{instBERKELEY = "University of California"}
‚@String{instANL:adr = "9700 South Cass Avenue, Argonne, IL
604394801, USA"}E
@String{instANL = "Argonne National Laboratory"}eM@String{acksfo = "Stuart F. Oberman,
email: \path=stuart.oberman@amd.com="}
‚?…@String{ackrfb = "Ronald F. Boisvert,
Applied and Computational Mathematics Division,
National Institute of Standards and Technology,
Gaithersburg, MD 20899, USA,
Tel: +1 301 975 3812,
email: \path=boisvert@cam.nist.gov="} ‚$„K@String{ackpb = "Preston Briggs,
Tera Computer Company,
2815 Eastlake East,
Seattle, WA 98102,
USA,
Tel: +1 206 3250800,
email: \pathpreston@tera.com"}Eƒ
@String{acknj = "Norbert Juffa,
2445 Mission College Blvd.
Santa Clara, CA 95054
USA
email: \path=norbert@iit.com="}„0ˆc@String{acknhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 841120090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
email: \pathbeebe@math.utah.edu,
\pathbeebe@acm.org,
\pathbeebe@computer.org (Internet),
ŠN@String{pubOLDENBOURG:adr = "M Œ9u@String{pubSPRINGERWIEN:adr = "Wien / New York"} Š7q@String{pubMIT = "The MIT Press"}Ù ‡J@String{pubELSEVIERMORGANKAUFMANN:adr = "San Francisco, CA, USA"}® …‚@String{jTRANSSOCCOMPSIM = "Transactions of the Society for Computer
Simulation"}x ƒ3i@String{jSIAMNEWS = "SIAM News"}R €9u@String{jOPERSYSREV = "Operating Systems Review"}, ~‚@String{jJAPANJINDUSTAPPLMATH = "Japan Journal of Industrial and Applied
Mathematics"} {S'@String{jIRETRANSELECCOMPUT = "IRE Transactions on Electronic Computers"}Ý yQ#@String{jIEEETRANSSIGPROC = "IEEE Transactions on Signal Processing"}¼ vR%@String{jIEEECGA = "IEEE Computer Graphics and Applications"}™ tB@String{jCOMPUTINGSUPPLEMENTUM = "Computing. Supplementum"}k q7s@String{jAPPLOPTICS = "Applied Optics"}A p}}@String{instCSPURDUE = "Department of Computer Science, Purdue
University"}$( ÛúôîèâÜÖÐÊÄ¾¸²¬¦ š”Žˆ‚vpjd^XRLF@:4.(
H
9
+
îÝÐÄ³¢‘„vaM7&òåÒÅ«_I=,
õ
â
Ð
À
š
‡
s
f
U
B
1
ö Ý Î ¾ §  h ] J 4 % ëØÍ»§’ƒucH6"üèÕÀ±¤~iYM7+ùàÍ»ª•o^J8%þìÙÆ³¢€pVB/ìÜÌ¸£~m]N5"öäÓ¿¯ ŽzhN=*
ôÛ¾ª“mZG7õàÐ½©–G' Matthew BadinF) A. E. BashaghaE' Khan A. Wahid
D! M. OhhashiC+ B. K. P. ScaifeB% P. M. MaurerA+ Hiroto Fukuhisa@5PeterMichael Seidel
?J.D. Sun>' N. Kumprasert=%John E. Croy<) Osamu Kitajima;#M. H. Etzel:/ BaekKyu K. Young9) Kiran Kundargi8; Debapriyay Mukhopadhyay73 L. Torres y Quevedo61Hossam A. H. Fahmy5D. Zuras4 Chae Han3' Roman Hermida2# P. Thompson15 Douglas K. Erlandson0% Chengpu Wang/'Jo Ann Howell.#Holger OrupE. Savas
,! T. Machida+'Eric Schkufza*# W. D. Munro)% Gerhard Frey(D. Basu
'! Ingo Teetz& W. H. Ku%' J. C. Svercek$1E. G. Kogbetliantz#S. Perri
"! D. J. Kuck!!P. Schatte % A. Schurmann' Daniel Lipetz+ GuyRene Perrin) Manfred Tasche
! Jiaye Wang
Howon Kim+ K. D. Heidtmann) Steve Marshall5 Rashmi Arun Patankar%H. Nishikawa) Eugeny Gladkov5 Jaideep Ramachandran
D. Batten
A. Amam+ Hidetoshi Yokoo# A. E. Sheue' J. F. Brennan%David Defour
%J.M. Moreau
% Y. Voronenko) Harpreet Singh' Chao H. Huang
' Nai Kuan Tsao % Isaac Dooley'Eric Goubault# Paul Putter
! R. Averill+Kouichi Sakurai+ Adele Goldstine# Erkay Savas% Martin Zabel%T. A. Bailey1Zvonimir Rakamaric/ Shinichi Kawamura~; James Edward Stine, Jr.
} L. Pace/ Nader Bagherzadeh
{ R. Thunz!Zhaolin Liy+David R. Ditzel
x! Ajay Nainiw1 Marcelo E. Kaiharav J. Haess
uT. Demurat+James W. Thomass) M. Christensenr+ Leonard J. Mossq' Juergen Haessp+ John Erick Holmo+ S. M. Burchfieln%TingAo Tangm9 Burton S. Kaliski, Jr.l' W. E. Meservek L. Fousse
j! J. H. Feifi Arindam Banerjeeh+ Ralph L. Londong' G. K. Sorknes f H. Alte'C. H. Brogdond1Dennis Verschaerenc' L. Lacassagneb# Annie Tsang
a! M. Arakawa`/ JeanMarc Delosme_) Timothy Slegel ^ Qi Guo]+ Edward M. Regan\) T. W. Griffith[3 Naven Chuen Wing HoZ1 James P. Wong, Jr.Y# L. Gerzberg
XJ. KontroW5 Martin AtkinsonBarrV% SangYong HanU1 Laurence E. TurnerT) David G. CartaS% Nicola PetraR) David M. HoganQ% HongYu ChenP T. KrickO+ M. D. RauchwerkN'Mioara JoldesM'R. C. AgarwalL'S. F. ObermanK# Cesar MunozJ' S. H. ArdalanI) Thomas Dowling
H! J. I. AchaG) ChangFuu ChenF Paul GlendinningE% YuCheng Liu
D J. YeunC/ K. S. VenkatramanB= Srinivasan ParthasarathyA% Mark Johnson@? Bertrand Jeffery Williams?7 Jaiprakash D. Intwala> X. Parra=) P. W. Pedersen< I. Ortiz;!J. M. Yohe:) M. Subramaniam9% Hyungju Park8% V. J. Mooney7/ Bidyut Kumar Bose6+ Gerd Kortemeyer5 Emden R. Gansner4 A. Martin3 K. Grohe2#D. Goldberg1% Ingo Dittmer0% Thom Mulders
/ P. Hung. G. Dixon% A. R. Lebeck,+ Alex Tiountchik++ Dusan Suvakovic* James Schimandle) S.I. Liu
(! Xiangku Li'%Gotz Alefeld&3 Charalambos Basetas%1 Paraskevas Kalivas$% Debby Jensen#' Wolfgang Paul"% R. L. Bivins!% M. P. Taborn
L. Lin) Brian Hickmann/ Maurice V. Wilkes# L. Montalvo+ F. V. C. Mendis% Niels Moller
! Dov Jarden'H. Henkelmann
J. Levy) Raymond S. Lim) J. J. Hofbauer
! E. Tosatti# Yuxiang ZhuMichael J. Flynn
A. Olesin' Larry Rudolph' Abdel Ejnioui# R. Goldberg!JaLing Wu
%H. Takahashi Ú¶ Ö´X Õ³ Ò±[ Ñ° Ð®S Í Ì«W Éª Ç¨\ Ä§ Ã¥Z À¤ ½¢\ »¡ ºŸ[ ¹ž µœ\ ³› ²™T ¯˜ ®–U «• ©“T §’ ¥V £ N ŸŒ ŠK ›‰ ˜‡M –† ”„I ‘ƒ Gd'6; Ô 6žzÃ¯Mˆ©õÜH4çÅ7œˆ4ÄfPªj6”Èƒd5Ÿp\è
’üv@
XÆ“ xleäÃ`ÚÍXÕ
RÃßONª5µ
dü ñ¬'SE¶Ð•¹€ Þaþ¤Idõ t·& ·
Ô Dì¢†!¾ñUëÔ™‡ Î
×BÕ
û 57è
‚¬þ
Æ
Ø¢ˆ ìÔÄ
õ²
–žsN@ Ÿ
@/˜Î#ŽeÞ
{#xJ m‰
¨ù
µd¹4mR
º
Ü5p
5
]k æÆ
uÔ Œ~½
î ZI1÷u7
£Ñ
C8¢pø%J. T. AstolaÉ
J. ChungÈ'Matthew BadinÇ)A. E. BashaghaÆ'Khan A. WahidÅ!M. OhhashiÄ+B. K. P. ScaifeÃ%P. M. MaurerÂ Á'R. M. FewsterÃ ž'E. H. Bareiss¦€ ¸%Qihong Zhang¢Î+Robert M. Ow Î/Reinhard Kirchner± œ7David Michael Fischer+Paul B. JacksonÅ Å1John C. FlaspohlerŠ² ž!E. Gvozdev
h š+D. P. RozenbergG ¾!J. M. Pena‘ ¨!J. B. Liman Ë!Y. Savaria
ó Â)W. W. Troutman È'G. De Michelia ¿V. Szwarc®'Kevin D. Tr ¬'K. Eshraghian— ¦+Hiroyasu Ohtomo– ¤H. Schmid“ ¡
F. Barsiå˜#R. W. Doran¬˜ Ï+Khaled ElWazeer# ¶%P. A. BergerV ´+N. Maslennikowað ª+James H. Billen#ÝE. Guizzo ·5Paruvachi V. R. Raja Ü#S. Kawamura¶F&
N. Juffa(F0G. EstrinÒ ×1RolfJurgen Bruss ø ¼%Thom Mulders0 °
M. ThillR³%Mark JohnsonA ÏK Ê7Stephen L. B. Moshier˜ Æ)Sebastian Hackàã —#Bryan BradyÆà+Morton Go ±1Michael A. Malcolm»K=!R. Averill† ¨%J Ø7JacquesHenri Jourdanê •+B. J. Flehinger
« “#Amrita Saha}Ž/!W. A ¼Thomas A. Bailey IŽ #B ™#Cesar MunozKàHani H. M. Saleh± ¢Gillian R. Evans‰ Ó3Claire MoreauFinotGU+R. A. Reininger6 Î%Pall ·#Pak K. ChanÓ ¿/Vadym Kliuchnikov Ù
T. Datta×³A ª'Khan A. WahidÅÛ\K. Brauneû Æ'Shing I. Kong`Û2%S. M. Denton*Û1Evgenija D. Popova È#D. Mitchell¼³ ·ANortheastern University Reconfigurable Computi ØkWIEEE Computer Society Standards Committee. Working group of the Microprocessor Standards Subcommittee !M. Hoemmen
Ø'Leon J. Sigal “ÉRobert P. Burton
€ È#E. DavidsonW “š °+Moshe Olshansky÷ ªAJurgen Wolff von Gudenbergo ¦!JinHao Tu c#W. A. BeyerÄ Ï%Jack MoshmanP ª ¿#W “; ’'A. R. Trickerñ€'WooChan Park•
.iAnuja J. Thakkar ’'A. Skavantzos
.83Gerhard P. Fettweis ž/Frederic Goualardü š/David Mark Blaker“å!Sven Simonœ
r%Pierre Neron ·)Mark R. Dennis
ëb/Germund ž+Franklin T. Luk Î5JeanGuillaume Dumas /Francoise Tisseur •'Bjorn PehrsonÚ(3Thomas B. Preuss erN
ø/Jean E. VuilleminÑ Â!Vic Kelsonq
É ±S. C. OngY%Garth GibsonÝ ´Tao BaoŠ Â'Stefan Siegel?Ø2+Duncan žAFrancoise ChaitinChatelin. ¼'Wolfgang Kunz ?
(J. C. Flaspohl ¢%J. M. Conrad
Å/Intel Corporationa
Þ#M. Syrzy ¦;M. C. BartholomewBiggs Ï
=Christopher Marion Maple z
‹1Reddy P. Sreekanth*âA'Charles SeifeÂâ*W. T. 1Reddy P. Sreekanth* “B. LiuN
% ·%J.M. Muller È!C. Herring
ÇÿD. Paul
½xStephen P. Morse°“#IAleksandr Mikha ± ¼#V. Z. GrozaM
½,'Gene Sheppard/ š#F. A. Potra¿ ’ ¾kWIEEE Computer Society Standards Committee. Working group of the Microprocessor Standards SubcommitteeTTWµ’ ¬3 ¶/Philip Rabinowitz [Theodore P. HillÚ ™/Dileep Bhandarkarµ31Peter Y. K. Cheung
·'Eric Schkufza«÷÷ÐS. Mamidi Ã8 •)ChanFeng Chiu œ'H. R. WaltersÊXXr*WAmer ±+Walter E. Br ¬9Stanley R. Sieler, Jr.c ¼)Ramon E. MooreF+I. Pechtchanski²Ð·»»»* ’! °Joseph M. MorrisÓÓØ!M. Goesselº( “AC ¸+P. W. MarksteinàÖ´úôîèâÜÖØÓÎÉÄ¿ºµ°«¦¡œ—’ˆƒ~ytoje`[VQLGB=83.)$ü÷òíèãÞÙÓÍÇÁ»µ¯©£—‘‹…ysmga[UOIC=71+%
û
õ
ï
é
ã
Ý
×
Ñ
Ë
Å
¿
¹
³
§
¡
›
•
‰
ƒ
}
w
q
k
e
_
Y
S
M
G
A
;
5
/
)
#
ÿùóíçáÛÕÏÉÃ½·±«¥Ÿ™“‡{uoic]WQKE?93'! ý÷ñëåßÙÓÍÇÁ»µ¯©£—‘‹…ysmga[UOIC=71+%
û
õ
ï
é
ã
Ý
×
Ñ
Ë
Å
¿
¹
³
§
¡
›
•
‰
ƒ
}
w
q
k
e
_
Y
S
M
G
A
;
5
/
)
#
ÿ ù ó í ç á Û Õ Ï É Ã ½ · ± « ¥ Ÿ ™ “ ‡ { u o i c ] W Q K E ? 9 3  ' ! ý÷ñëåßÙÓÍÇÁ»µ¯©£—‘‹…ysmga[UOIC=71+%
ûõïéãÝ×ÑËÅ¿¹³§¡›•‰ƒ}wqke_YSMGA;5/)#ÿùóíçáÛÕÏÉÃ½·±«¥Ÿ™“‡{uoic]WQKE?93'! ý÷ñëåßÙÓÍÇÁ»µ¯©£—‘‹…ysmga[UOIC=71+%
ûõïéãÝ×ÑËÅ¿¹³§¡›•‰ƒ}wqke_YSMGA;5/)#g‡df‡be‡`c‡_`‡]]‡[Z‡YY‡UX‡SS‡RP‡PN‡NJ‡LG‡IF‡GD‡EA‡D>‡A;‡?8‡<4‡:1‡8/‡5‡3*‡1)‡/'‡$‡,"‡* ‡(‡'‡$‡"‡!‡ ‡
‡ ‡‡‡‡‡ÿ‡ü‡ú‡ø‡
÷‡ö‡ñ‡ï†~î†ì†{ë†zé†wç†uå†sä†qâ†pá†oÞ†mÝ†kÛ†iÙ†gÕ†eÓ†bÑ†`Î†^Ê†[È†XÆ†WÄ†VÃ†TÀ†R¾†Pº†N¶†L°†I¯†F«†Eª†B§†@¦†>¤†<¢†;ž†9›†6š†4˜†3–†2”†0’†/†.Ž†Œ†,‰†+‡†)††'„†%‚†$†#}†!y† w†u†q†m†k†g†e†c†`†]†[†
X†Q†ã†O†N†L†J†I†G†F…D…~C…}@…>…{=…y:…x6…u3…s0…p,…n*…k(…i%…g#…f!…e…c…a…_…\…Z…X…W
…V…U
…S…R…Q…P…N…Mü…Kû…Iù…G÷…Eõ…Cò…Bñ…@ï…>î…;í…8é…6ç…4ä…2à…/ß…,Ý…*Û…)Ù…(Ø…'Õ…%Ð…"Î…Í…Ê…È…Æ…Å…Ã…Á…¿…¾…»…
º…¶… µ…²…¯…¬…«…©„§„}¥„{£„zŸ„yž„vœ„tš„s™„r”„q’„oŽ„n„l‹„kŠ„iˆ„f…„dƒ„b‚„`€„]~„[„Zz„Yx„Wv„Ut„So„Qm„Nk„Mj„Je„Hd„Fb„D^„C]„A\„?Y„=U„:T„8R„6O„5M„3K„2I„0E„.C„,?„*>„(<„&:„$9„!5„4„3„/„,„*„(„'„%„ „„„ „„„„„ƒ~ƒƒzƒxƒwÿƒvýƒtüƒrúƒpùƒnøƒlöƒkõƒióƒgñƒfïƒeìƒdéƒbåƒaâƒ_ßƒ]Ýƒ[ÜƒXÙƒUØƒSÔƒQÒƒNÏƒKÎƒIÊƒGÉƒEÇƒCÅƒAÄƒ?Âƒ=Àƒ;¾ƒ9½ƒ6»ƒ4¹ƒ3·ƒ1µƒ/´ƒ²ƒ+°ƒ*®ƒ)¬ƒ'ªƒ$§ƒ"¥ƒ!£ƒ ¡ƒ ƒ›ƒšƒ˜ƒ—ƒƒƒŠƒˆƒ…ƒ„ƒƒƒ~‚~}‚{‚{v‚yu‚vt‚tp‚sn‚pm‚mk‚li‚kh‚hf‚gd‚fa‚d`‚`^‚_]‚]\‚YY‚XX‚UW‚SU‚QS‚OR‚MP‚LO‚KJ‚JG‚HF‚FE‚DC‚C@‚B?‚?>‚=<‚;;‚8:‚68‚45‚23‚.0‚/‚,.‚*‚(+‚')‚&'‚%%‚##‚ "‚ ‚‚‚‚‚‚‚‚‚ ‚‚‚‚
~zwýuüsúrøq÷oömòlñiïgîeícëaê_è]å[ãYâVßUÞTÝRÜPÚOÙNÌLËHÉGÇFÅDÄBÁ@¾?¼=»;¸9¶7²6±4¯3®2¬1¨0¦.¤,¡+ )Ÿ&$œ!™ —•“ŽŒŠ‰‡†
…ƒ €~yxvu}s{qypwntmqiphmdlcjbhaf_d]bZ_Y\WYVVUSSPPNOLMIKGIFEEDBC?A<?:=7:68472301/+.)*&)"( &% c«,ƒ¦42 [
Ä™{ã“*m"l†gEŒEÁNÛ‡B
@Article{Lyashenko:1991:PAR,
author = "N. N. Lyashenko and M. S. Nikulin",
title = "Prow‰’1
@InProceedings{Kim:1993:FABc,
author = "S. W. Kim and T. Stouraitis and A. Skavantzos",
booktiw†m[
@Book{ISO:1994:IIIa,
author = "{ISO}",
title = "{ISO\slash IEC 109671 (199412)}: {Information}
technology  {Language} independent arithmetic 
{Part 1}: {Integer} and floating point arithmetic",
publisher = pubISO,
address = pubISO:adr,
pages = "viii + 92",
day = "15",
month = dec,
year = "1994",
bibdate = "Sun Mar 15 11:09:44 2009",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
price = "CHF 176, US\$136.00",
URL = "http://standards.iso.org/ittf/PubliclyAvailableStandards/c018939_ISO_IEC_109671_1994(E).zip;
http://www.iec.ch/cgibin/procgi.pl/www/iecwww.p?wwwlang=E&wwwprog=catdet.p&wartnum=019729;
http://www.iso.ch/cate/d18939.html",
acknowledgement = acknhfb,
} r‡5Žk
@Article{Rall:1983:BRB,
author = "L. B. Rall",
title = "Book Review: {{\booktitle{Computer Arithmetic in
Theory and Practice}} (Ulrich W. Kulisch and Willard L.
Miranker)}",
journal = jSIAMREVIEW,
volume = "25",
number = "4",
pages = "585588",
month = "????",
year = "1983",
CODEN = "SIREAD",
DOI = "http://dx.doi.org/10.1137/1025138",
ISSN = "00361445 (print), 10957200 (electronic)",
ISSNL = "00361445",
bibdate = "Sat Mar 29 09:53:41 MDT 2014",
bibsource = "http://epubs.siam.org/toc/siread/25/4;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/siamreview.bib",
acknowledgement = acknhfb,
fjournal = "SIAM Review",
journalURL = "http://epubs.siam.org/sirev",
onlinedate = "October 1983",
}û‡B
@Article{Lyashenko:1991:PAR,
author = "N. N. Lyashenko and M. S. Nikulin",
title = "Probability Analysis of RoundOff Errors in
FloatingPoint Arithmetic",
journal = jTHEORYPROBABAPPL,
volume = "35",
number = "1",
pages = "6674",
month = "????",
year = "1991",
CODEN = "TPRBAU",
DOI = "http://dx.doi.org/10.1137/1135006",
ISSN = "0040585X (print), 10957219 (electronic)",
ISSNL = "0040585X",
bibdate = "Tue Apr 1 10:40:31 MDT 2014",
bibsource = "http://epubs.siam.org/sambin/dbq/toc/TVP/35/1;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
acknowledgement = acknhfb,
fjournal = "Theory of Probability and its Applications",
journalURL = "http://epubs.siam.org/tvp",
onlinedate = "January 1991",
}
‹‡5Žk
@Article{Rall:1983:BRB,
author = "L. B. Rall",
title = "Book Review: {{\booktitle{Computer Arithmetic in
Theory and Practice}} (Ulrich W. Kulisch and Willard L.
Miranker)}",
journal = jSIAMREVIEW,
volume = "25",
number = "4",
pages = "585588",
month = "????",
year = "1983",
CODEN = "SIREAD",
DOI = "http://dx.doi.org/10.1137/1025138",
ISSN = "00361445 (print), 10957200 (electronic)",
ISSNL = "00361445",
bibdate = "Sat Mar 29 09:53:41 MDT 2014",
bibsource = "http://epubs.siam.org/toc/siread/25/4;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/siamreview.bib",
acknowledgement = acknhfb,
fjournal = "SIAM Review",
journalURL = "http://epubs.siam.org/sirev",
onlinedate = "October 1983",
}û
: ƒ:ˆFW ##+u=m;a+iu‡q
unpublishedfparith.bibBabbage:1837:MPCCharles BabbageOn the mathematical powers of the calculating engine161173dec121837Wed Oct 13 11:09:59 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:09:59 ???Manuscript held by Museum of the History of Science, Oxford, UK. Reprinted in cite [ 2.1]Randell:1982:ODC.acknhfbCharles BabbageManuscript held by Museum of the History of Science, Oxford, UK. Reprinted in \cite[\S 2.1]{Randell:1982:ODC}.On the mathematical powers of the calculating engine
@Unpublished{Babbage:1837:MPC,
author = "Charles Babbage",
title = "On the mathematical powers of the calculating engine",
month = dec,
year = "1837",
bibdate = "Wed Oct 13 11:09:59 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Manuscript held by Museum of the History of Science,
Oxford, UK. Reprinted in \cite[\S
2.1]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
}ŒzV #+3s?]7=m;y‚7sŽc
articlefparith.bibColson:1726:SANJohn Colson, F.R.S.A Short Account of NegativoAffirmative ArithmetickjPHILOSTRANSRSOCLOND343923981611731726PTRSAVhttp://dx.doi.org/10.1098/rstl.1726.003203702316 OR 03702316Tue Jul 28 14:21:05 2015http://www.math.utah.edu/pub/tex/bib/fparith.bib2015.07.28 14:21:05 ???http://arith22.gforge.inria.fr/slides/s2ercegovac.pdfPhilosophical transactions of the Royal Society of LondonEarly work on signeddigit arithmetic, reported by Milos Ercegovac in a talk at the ARITH'22 conference, Lyon, France, June 2015.acknhfbJohn {Colson, F.R.S.}A Short Account of NegativoAffirmative Arithmetick
@Article{Colson:1726:SAN,
author = "John {Colson, F.R.S.}",
title = "A Short Account of NegativoAffirmative Arithmetick",
journal = jPHILOSTRANSRSOCLOND,
volume = "34",
number = "392398",
pages = "161173",
month = "????",
year = "1726",
CODEN = "PTRSAV",
DOI = "http://dx.doi.org/10.1098/rstl.1726.0032",
ISSN = "03702316",
bibdate = "Tue Jul 28 14:21:05 2015",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://arith22.gforge.inria.fr/slides/s2ercegovac.pdf",
acknowledgement = acknhfb,
fjournal = "Philosophical transactions of the Royal Society of
London",
remark = "Early work on signeddigit arithmetic, reported by
Milo{\v{s}} Ercegovac in a talk at the ARITH'22
conference, Lyon, France, June 2015.",
}
» C»X #1c!}57EU;K3]cŽOarticlefparith.bibAnonymous:1879:TRAAnonymousThree Rules for Abbreviating MultiplicationjSCIAMER411218418420sep91879SCAMAChttp://dx.doi.org/10.1038/scientificamerican0920187918400368733 (print), 19467087 (electronic) OR 00368733 (print), 19467087 (electronic)00368733 OR 00368733Fri May 17 10:36:54 MDT 2013http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/sciam1870.bib2013.05.17 10:36:54 MDThttp://www.nature.com/scientificamerican/journal/v41/n12/pdf/scientificamerican09201879184.pdfScientific Americanacknhfbhttp://www.nature.com/scientificamericanAnonymousThree Rules for Abbreviating Multiplication
@Article{Anonymous:1879:TRA,
author = "Anonymous",
title = "Three Rules for Abbreviating Multiplication",
journal = jSCIAMER,
volume = "41",
number = "12",
pages = "184184",
day = "20",
month = sep,
year = "1879",
CODEN = "SCAMAC",
DOI = "http://dx.doi.org/10.1038/scientificamerican09201879184",
ISSN = "00368733 (print), 19467087 (electronic)",
ISSNL = "00368733",
bibdate = "Fri May 17 10:36:54 MDT 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/sciam1870.bib",
URL = "http://www.nature.com/scientificamerican/journal/v41/n12/pdf/scientificamerican09201879184.pdf",
acknowledgement = acknhfb,
fjournal = "Scientific American",
journalURL = "http://www.nature.com/scientificamerican",
}:Z #1!{57EU;G3]articlefparith.bibAnonymous:1875:AOMAnonymousThe Arithmetical Operations of Multiplication and DivisionjSCIAMER323414216jan11875SCAMAChttp://dx.doi.org/10.1038/scientificamerican011618754100368733 (print), 19467087 (electronic) OR 00368733 (print), 19467087 (electronic)00368733 OR 00368733Fri May 17 10:29:24 MDT 2013http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/sciam1870.bib2013.05.17 10:29:24 MDThttp://www.nature.com/scientificamerican/journal/v32/n3/pdf/scientificamerican0116187541.pdfScientific Americanacknhfbhttp://www.nature.com/scientificamericanAnonymousThe Arithmetical Operations of Multiplication and Division
@Article{Anonymous:1875:AOM,
author = "Anonymous",
title = "The Arithmetical Operations of Multiplication and
Division",
journal = jSCIAMER,
volume = "32",
number = "3",
pages = "4142",
day = "16",
month = jan,
year = "1875",
CODEN = "SCAMAC",
DOI = "http://dx.doi.org/10.1038/scientificamerican0116187541",
ISSN = "00368733 (print), 19467087 (electronic)",
ISSNL = "00368733",
bibdate = "Fri May 17 10:29:24 MDT 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/sciam1870.bib",
URL = "http://www.nature.com/scientificamerican/journal/v32/n3/pdf/scientificamerican0116187541.pdf",
acknowledgement = acknhfb,
fjournal = "Scientific American",
journalURL = "http://www.nature.com/scientificamerican",
}://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://links.jstor.org/sici?sici=00029327%281881%294%3A1%2F4%3C39%3ANOTFOU%3E2.0.CO%3B2K",
abstract = "That the ten digits do not occur with equal frequency
must be evident to any one making much use of
logarithmic tables, and noticing how much faster the
first pages wear out than the last ones. The first
significant figure is oftener 1 than any other digit,
and the frequency diminishes up to 9.",
acknowledgement = acknhfb,
fjournal = "American Journal of Mathematics",
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
remark = "From p. 40: ``The law of probability of the occurrence
of numbers is such that all mantissas of their
logarithms are equally probable.''",
}
÷÷–\ #'#57=m;A„[Ks‚„['•iarticlefparith.bibNewcomb:1881:NFUSimon NewcombNote on the frequency of use of the different digits in natural numbersjAMJMATH41/439401881AJMAAN00029327 (print), 10806377 (electronic) OR 00029327 (print), 10806377 (electronic)00029327 OR 00029327Thu Feb 15 16:35:24 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.02.15 16:35:24 ???http://links.jstor.org/sici?sici=00029327%281881%294%3A1%2F4%3C39%3ANOTFOU%3E2.0.CO%3B2KThat the ten digits do not occur with equal frequency must be evident to any one making much use of logarithmic tables, and noticing how much faster the first pages wear out than the last ones. The first significant figure is oftener 1 than any other digit, and the frequency diminishes up to 9.American Journal of MathematicsBenford's Law; Law of Anomalous Numbers; Zipf's LawFrom p. 40: ``The law of probability of the occurrence of numbers is such that all mantissas of their logarithms are equally probable.''acknhfbThat the ten digits do not occur with equal frequency must be evident to any one making much use of logarithmic tables, and noticing how much faster the first pages wear out than the last ones. The first significant figure is oftener 1 than any other digit, and the frequency diminishes up to 9.Simon NewcombNote on the frequency of use of the different digits in natural numbers
@Article{Newcomb:1881:NFU,
author = "Simon Newcomb",
title = "Note on the frequency of use of the different digits
in natural numbers",
journal = jAMJMATH,
volume = "4",
number = "1/4",
pages = "3940",
year = "1881",
CODEN = "AJMAAN",
ISSN = "00029327 (print), 10806377 (electronic)",
ISSNL = "00029327",
bibdate = "Thu Feb 15 16:35:24 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://links.jstor.org/sici?sici=00029327%281881%294%3A1%2F4%3C39%3ANOTFOU%3E2.0.CO%3B2K",
abstract = "That the ten digits do not occur with equal frequency
must be evident to any one making much use of
logarithmic tables, and noticing how much faster the
first pages wear out than the last ones. The first
significant figure is oftener 1 than any other digit,
and the frequency diminishes up to 9.",
acknowledgement = acknhfb,
fjournal = "American Journal of Mathematics",
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
remark = "From p. 40: ``The law of probability of the occurrence
of numbers is such that all mantissas of their
logarithms are equally probable.''",
}
w
3D"fUŠ,”Y
@Article{AMD:1988:IFP,
author = "{Advanced Micro Devices}",
title = "{IEEE} floatingpoint format",
journal = jMICROPROCMICROSYS,
volume = "12",
number = "1",
pages = "1323",
month = jan # "\slash " # feb,
year = "1988",
CODEN = "MIMID5",
ISSN = "01419331 (print), 18729436 (electronic)",
ISSNL = "01419331",
bibdate = "Sat Nov 9 08:26:18 MST 2002",
bibsource = "ACM Co i9
@Article{Acha:1992:LOF,
author = "J. I. Acha and J. Calvo",
title = "LowfrequencœO¹
@Article{Aamodt:2008:CTI,
author = "Tor M. Aamodt and Paul Chow",
title = "Compiletime and instructionset methods for improving
floating to fixedpoint conversion accuracy",
journal = jTECS,
volume = "7",
number = "3",
pages = "26:126:??",
month = apr,
year = "2008",
CODEN = "????",
DOI = "http://doi.acm.org/10.1145/1347375.1347379",
ISSN = "15399087 (print), åŠ=”{
@Article{Abdallah:2005:MRN,
author = "M. Abdallah and A. Skavantzos",
title = "On MultiModuli residue number systems with moduli of
forms $ r^a $, $ r^b  1 $, $ r^c + 1 $",
journal = "IEEE Transactions on Circuits and Systems I: Regular
Papers, [see also IEEE Transactions on Circuits and
Systems I: Fundamental Theory and Applications]",
volume = "52",
number = "7",
pages = "12537Š”
@Article{Aberbour:1998:PMF,
author = "M. Aberbour and A. Houelle and H. Mehrez and N.
Vaucher and A. Guyot",
title = "On portable macrocell {FPU} generators for division
and square root operators complying to the full
{IEEE754} standard",
journal = jIEEETRANSVLSISYST,
volume = "6",
number = "1",
pages = "114121",
month = mar,
year = "1998",
CODEN = ¥ŽI
@Article{Abbott:1999:ASS,
author = "P. H. Abbott and D. G. Brush and C. W. {Clark III} and
C. J. Crone and J. R. Ehrman and G. W. Ewart and C. A.
Goodrich and M. Hack and J. S. Kapernick and B. J.
Minchau and W. C. Shepard and R. M. {Smith, Sr.} and R.
Tallman and S. Walkowiak and A. Watanabe and W. R.
White",
title = "Architecture and software support in {IBM S/390
/ˆW‘/
@Article{Abbasbandy:2004:USA,
author = "S. Abbasbandy and M. A. Fariborzi Araghi",
title = "The use of the stochastic arithmetic to estimate the
value of interpolation polynomial with optimal degree",
journal = jAPPLNUMMATH,
volume = "50",
number = "34",
pages = "279290",
month = sep,
year = "2004",
CODEN = "ANMAEL",
DOI = "http://dx.doi.org/10.1016/j.apnum.2004.01.003"C’]¥;
@Article{Abbott:2012:TFA,
author = "John Abbott",
title = "Twinfloat arithmetic",
journal = jJSYMBOLICCOMP,
volume = "47",
number = "5",
pages = "536551",
month = may,
year = "2012",
CODEN = "JSYCEH",
DOI = "http://dx.doi.org/10.1016/j.jsc.2011.12.005",
ISSN = "07477171 (print), 1095855X (electronic)",
ISSNL = "07477171",
bibdate = "Sat Feb 25 10:12:47 MST 20U‰’'
@Article{Abdelmalek:1971:REA,
author = "Nabih N. Abdelmalek",
title = "Roundoff Error Analysis for {GramSchmidt} Method
and Solution of Linear Least Squares Problems",
journal = jBIT,
volume = "11",
number = "4",
pages = "345367",
month = dec,
year = "1971",
CODEN = "BITTEL, NBITAB",
DOI = "http://dx.doi.org/10.1007/BF01939404",
ISSN = "00063835 (print), 15720
5
"53äõ‡N
@Article{Adam:2012:FPD,
author = "Sanda Adam and Gheorghe Adam",
title = "Floating Point Degree of Precision in Numerical
Quadrature",
journal = jLECTNOTESCOMPSCI,
volume = "7125",
pages = "189194",
year = "2012",
CODEN = "LNCSD9",
DOI = "http://dx.doi.org/10.1007/9783642282126_19",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Wed Dec 19 15:24:39 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/9783642282126_19/",
acknowledgement = acknhfb,
bookDOI = "http://dx.doi.org/10.1007/9783642282126",
bookURL = "http://www.springerlink.com/content/9783642282126",
fjournal = "Lecture Notes in Computer Science",
}£fÇM
@Article{Agarwal:1994:EFP,
author = "R. C. Agarwal and F. G. Gustavson and M. Zubair",
title = "Exploiting functional parallelism of {POWER2} to
design highperformance numerical algorithms",
journal = jIBMJRD,
volume = "38",
number = "5",
pages = "563576",
month = sep,
year = "1994",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "001°™C³
@Article{Agarwal:1986:NSV,
author = "Ramesh C. Agarwal and James W. Cooley and Fred G.
Gustavson and James B. Shearer and Gordon Slishman and
Bryant Tuckerman",
title = "New Scalar and Vector Elementary Functions for the
{IBM System\slash 370}",
journal = jIBMJRD,
volume = "30",
number = "2",
pages = "126144",
month = mar,
year = "1986",
CODEN = "IBMZ†M
@Article{Adikari:2011:HBT,
author = "Jithra Adikari and Vassil S. Dimitrov and Laurent
Imbert",
title = "Hybrid BinaryTernary Number System for Elliptic Curve
Cryptosystems",
journal = jIEEETRANSCOMPUT,
volume = "60",
number = "2",
pages = "254265",
month = feb,
year = "2011",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2010.138",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Sun Feb 20 19:15:33 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}‹ŒD™
@Article{Adams:1967:SCP,
author = "Duane A. Adams",
title = "A stopping criterion for polynomial root finding",
journal = jCACM,
volume = "10",
number = "10",
pages = "655658",
month = oct,
year = "1967",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "65.50",
MRnumber = "39\#2314",
bibdate = "Fri Nov 25 18:20j…\‹9
@Article{Acha:1992:LOF,
author = "J. I. Acha and J. Calvo",
title = "Lowfrequency oscillator for floatingpoint digital
signal processor chips",
journal = jELECTLETTERS,
volume = "28",
number = "17",
pages = "1582??",
month = aug,
year = "1992",
CODEN = "ELLEAK",
ISSN = "00135194 (print), 1350911X (electronic)",
ISSNL = "00135194",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Electronics Letters",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}
n
a ªaŒFX #%%7!57EU;M3]%7Ž!articlefparith.bibFelt:1893:MADorr E. FeltMechanical ArithmeticjSCIAMER692030931011nov111893SCAMAChttp://dx.doi.org/10.1038/scientificamerican11111893309b00368733 (print), 19467087 (electronic) OR 00368733 (print), 19467087 (electronic)00368733 OR 00368733Wed May 22 19:04:25 MDT 2013http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/sciam1890.bib2013.05.22 19:04:25 MDThttp://www.nature.com/scientificamerican/journal/v69/n20/pdf/scientificamerican11111893309b.pdfScientific Americanacknhfbhttp://www.nature.com/scientificamericanDorr E. FeltMechanical Arithmetic
@Article{Felt:1893:MA,
author = "Dorr E. Felt",
title = "Mechanical Arithmetic",
journal = jSCIAMER,
volume = "69",
number = "20",
pages = "309310",
day = "11",
month = nov,
year = "1893",
CODEN = "SCAMAC",
DOI = "http://dx.doi.org/10.1038/scientificamerican11111893309b",
ISSN = "00368733 (print), 19467087 (electronic)",
ISSNL = "00368733",
bibdate = "Wed May 22 19:04:25 MDT 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/sciam1890.bib",
URL = "http://www.nature.com/scientificamerican/journal/v69/n20/pdf/scientificamerican11111893309b.pdf",
acknowledgement = acknhfb,
fjournal = "Scientific American",
journalURL = "http://www.nature.com/scientificamerican",
}ŒSX #1?!57EU;M3]?Ž/articlefparith.bibAnonymous:1893:IDbAnonymousThe Instantaneous DividerjSCIAMER682132532527may51893SCAMAChttp://dx.doi.org/10.1038/scientificamerican05271893325a00368733 (print), 19467087 (electronic) OR 00368733 (print), 19467087 (electronic)00368733 OR 00368733Wed May 22 19:04:00 MDT 2013http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/sciam1890.bib2013.05.22 19:04:00 MDThttp://www.nature.com/scientificamerican/journal/v68/n21/pdf/scientificamerican05271893325a.pdfScientific Americanacknhfbhttp://www.nature.com/scientificamericanAnonymousThe Instantaneous Divider
@Article{Anonymous:1893:IDb,
author = "Anonymous",
title = "The Instantaneous Divider",
journal = jSCIAMER,
volume = "68",
number = "21",
pages = "325325",
day = "27",
month = may,
year = "1893",
CODEN = "SCAMAC",
DOI = "http://dx.doi.org/10.1038/scientificamerican05271893325a",
ISSN = "00368733 (print), 19467087 (electronic)",
ISSNL = "00368733",
bibdate = "Wed May 22 19:04:00 MDT 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/sciam1890.bib",
URL = "http://www.nature.com/scientificamerican/journal/v68/n21/pdf/scientificamerican05271893325a.pdf",
acknowledgement = acknhfb,
fjournal = "Scientific American",
journalURL = "http://www.nature.com/scientificamerican",
}
ü
züŒ{ X #1[!}57EU;K3][ŽGarticlefparith.bibAnonymous:1898:OFAAnonymousOur Fingers as an Aid in MultiplicationjSCIAMER791726526622oct101898SCAMAChttp://dx.doi.org/10.1038/scientificamerican1022189826500368733 (print), 19467087 (electronic) OR 00368733 (print), 19467087 (electronic)00368733 OR 00368733Wed May 22 19:08:57 MDT 2013http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/sciam1890.bib2013.05.22 19:08:57 MDThttp://www.nature.com/scientificamerican/journal/v79/n17/pdf/scientificamerican10221898265.pdfScientific Americanacknhfbhttp://www.nature.com/scientificamericanAnonymousOur Fingers as an Aid in Multiplication
@Article{Anonymous:1898:OFA,
author = "Anonymous",
title = "Our Fingers as an Aid in Multiplication",
journal = jSCIAMER,
volume = "79",
number = "17",
pages = "265266",
day = "22",
month = oct,
year = "1898",
CODEN = "SCAMAC",
DOI = "http://dx.doi.org/10.1038/scientificamerican10221898265",
ISSN = "00368733 (print), 19467087 (electronic)",
ISSNL = "00368733",
bibdate = "Wed May 22 19:08:57 MDT 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/sciam1890.bib",
URL = "http://www.nature.com/scientificamerican/journal/v79/n17/pdf/scientificamerican10221898265.pdf",
acknowledgement = acknhfb,
fjournal = "Scientific American",
journalURL = "http://www.nature.com/scientificamerican",
}‹Y #')357E
;G)Œarticlefparith.bibAley:1897:DESRobert J. AleyA Device for Extracting the Square Root of Certain Surd QuantitiesjAMERMATHMONTHLY48/9204208aug81897AMMYAE00029890 (print), 19300972 (electronic) OR 00029890 (print), 19300972 (electronic)00029890 OR 00029890Mon Jun 28 12:37:08 MDT 1999http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1999.06.28 12:37:08 MDTAmerican Mathematical Monthlyacknhfbhttp://www.jstor.org/page/journal/amermathmont/about.htmlRobert J. AleyA Device for Extracting the Square Root of Certain Surd Quantities
@Article{Aley:1897:DES,
author = "Robert J. Aley",
title = "A Device for Extracting the Square Root of Certain
Surd Quantities",
journal = jAMERMATHMONTHLY,
volume = "4",
number = "8/9",
pages = "204208",
month = aug # "\slash " # sep,
year = "1897",
CODEN = "AMMYAE",
ISSN = "00029890 (print), 19300972 (electronic)",
ISSNL = "00029890",
bibdate = "Mon Jun 28 12:37:08 MDT 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "American Mathematical Monthly",
journalURL = "http://www.jstor.org/page/journal/amermathmont/about.html",
}
÷¨÷‰.U #'UE'77=m;_o'g]Šarticlefparith.bibBabbage:1910:BBAH. P. BabbageBabbage: Babbage's analytical enginejMONTHLYNOTROYASTRONSOC70517526, 6451910MNRAA400358711 OR 0035871100358711 OR 00358711Wed Oct 13 11:12:08 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:12:08 ???Reprinted in cite [ 2.3]Randell:1982:ODC.Monthly Notices of the Royal Astronomical SocietyacknhfbH. P. BabbageReprinted in \cite[\S 2.3]{Randell:1982:ODC}.{Babbage}: {Babbage}'s analytical engine
@Article{Babbage:1910:BBA,
author = "H. P. Babbage",
title = "{Babbage}: {Babbage}'s analytical engine",
journal = jMONTHLYNOTROYASTRONSOC,
volume = "70",
number = "??",
pages = "517526, 645",
year = "1910",
CODEN = "MNRAA4",
ISSN = "00358711",
ISSNL = "00358711",
bibdate = "Wed Oct 13 11:12:08 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 2.3]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
fjournal = "Monthly Notices of the Royal Astronomical Society",
}ˆU
U #'M?7=m;_q'gM‰3articlefparith.bibLudgate:1909:PAMP. E. LudgateOn a proposed analytical machinejSCIPROCROYDUBLINSOC12977911909SPRDAP03712303 OR 03712303Wed Oct 13 11:14:08 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:14:08 ???Reprinted in cite [ 2.4]Randell:1982:ODC.Scientific proceedings of the Royal Dublin SocietyacknhfbP. E. LudgateReprinted in \cite[\S 2.4]{Randell:1982:ODC}.On a proposed analytical machine
@Article{Ludgate:1909:PAM,
author = "P. E. Ludgate",
title = "On a proposed analytical machine",
journal = jSCIPROCROYDUBLINSOC,
volume = "12",
number = "9",
pages = "7791",
year = "1909",
CODEN = "SPRDAP",
ISSN = "03712303",
bibdate = "Wed Oct 13 11:14:08 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 2.4]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
fjournal = "Scientific proceedings of the Royal Dublin Society",
}
È
¹ á_ˆ>}
@Article{Aiken:1964:PAC,
author = "H. H. Aiken",
title = "Proposed automatic calculating machine",
journal = jIEEESPECTRUM,
volume = "1",
number = "??",
pages = "6269",
month = aug,
year = "1964",
CODEN = "IEESAM",
ISSN = "00189235 (print), 19399340 (electronic)",
ISSNL = "00189235",
bibdate = "Wed Oct 13 11:16:56 2010",
bibsource = "http://www.math.utah.edu/pub/tex/ˆ
@Article{Agrawal:1977:CNB,
author = "D. P. Agrawal",
title = "Comments on {``A Note on Base$2$ Arithmetic
Logic''}",
journal = jIEEETRANSCOMPUT,
volume = "C26",
number = "5",
pages = "511511",
month = may,
year = "1977",
CODEN = "ITCOB4",
DOI = ‡3Žg
@Article{Agrawal:1979:HSA,
author = "D. P. Agrawal",
title = "HighSpeed Arithmetic Arrays",
journal = jIEEETRANSCOMPUT,
volume = "C28",
number = "3",
pages = "215224",
month = mar,
year = "1979",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1979.1675322",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Mon Jul 11 06:49:36 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.‡<Žy
@Article{Agou:2003:SPR,
author = "Simon Joseph Agou and Marc Del{\'e}glise and
JeanLouis Nicolas",
title = "Short Polynomial Representations for Square Roots
Modulo $p$",
journal = jDESIGNSCODESCRYPTOGR,
volume = "28",
number = "1",
pages = "3344",
month = jan,
year = "2003",
CODEN = "DCCREC",
ISSN = "09251022 (print), 15737586 (electronic)",
ISSNL = "09251022",
bibdate = "Thu Dec 11 06:27:20 MST 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.wkap.nl/jrnltoc.htm/09251022",
URL = "http://ipsapp007.kluweronline.com/content/getfile/4630/45/2/abstract.htm;
http://ipsapp007.kluweronline.com/content/getfile/4630/45/2/fulltext.pdf",
acknowledgement = acknhfb,
fjournal = "Designs, codes, and cryptography",
}†V
@Article{Aggarwal:1979:REM,
author = "Vijay B. Aggarwal and James W. Burgmeier",
title = "A roundoff error model with applications to
arithmetic expressions",
journal = jSIAMJCOMPUT,
volume = "8",
number = "1",
pages = "6072",
month = "????",
year = "1979",
CODEN = "SMJCAT",
ISSN = "00975397 (print), 10957111 (electronic)",
ISSNL = "00975397",
MRclass = "68C01 (65G05)",
MRnumber = "81b:68031",
bibdate = "Mon Nov 29 10:58:59 MST 2010",
bibsource = "http://epubs.siam.org/sambin/dbq/toclist/SICOMP/8/1;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "SIAM Journal on Computing",
journalURL = "http://epubs.siam.org/sicomp",
}6…^‹=
@Article{Agrawal:1974:NCL,
author = "D. P. Agrawal",
title = "Negabinary carrylookahead adder and fast
multiplier",
journal = jELECTLETTERS,
volume = "10",
number = "??",
pages = "312313",
month = jul,
year = "1974",
CODEN = "ELLEAK",
ISSN = "00135194 (print), 1350911X (electronic)",
ISSNL = "00135194",
bibdate = "Thu Nov 06 06:16:38 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Electronics Letters",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
keywords = "negative base",
}Ð
_ê_‹
Y #+%!357E
;G%!‹articlefparith.bibBarrow:1924:QDDD. F. BarrowQuestions and Discussions: Discussions: On Taking Square Roots of IntegersjAMERMATHMONTHLY3110482484dec121924AMMYAE00029890 (print), 19300972 (electronic) OR 00029890 (print), 19300972 (electronic)00029890 OR 00029890Mon Jun 28 12:37:29 MDT 1999http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1999.06.28 12:37:29 MDTAmerican Mathematical Monthlyacknhfbhttp://www.jstor.org/page/journal/amermathmont/about.htmlD. F. BarrowQuestions and Discussions: Discussions: On Taking Square Roots of Integers
@Article{Barrow:1924:QDD,
author = "D. F. Barrow",
title = "Questions and Discussions: Discussions: On Taking
Square Roots of Integers",
journal = jAMERMATHMONTHLY,
volume = "31",
number = "10",
pages = "482484",
month = dec,
year = "1924",
CODEN = "AMMYAE",
ISSN = "00029890 (print), 19300972 (electronic)",
ISSNL = "00029890",
bibdate = "Mon Jun 28 12:37:29 MDT 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "American Mathematical Monthly",
journalURL = "http://www.jstor.org/page/journal/amermathmont/about.html",
}ŽY #;3‚Y=7=m;k7‚}ŽQarticlefparith.bibTorresyQuevedo:1915:EASL. Torres y QuevedoEssais sur l'automatique. Sa definition. Etendue theorique de ses applications (French) [Essays on automation. Its definition. Theoretical extent of its applications]jREVGENSCIPURESAPPL60161115nov11191503707431 OR 03707431Wed Oct 13 11:15:08 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:15:08 ???Reprinted in cite [ 2.5]Randell:1982:ODC. Translated by Mr. R. Basu.Revue Generale des Sciences Pures et AppliqueesFrenchacknhfbL. {Torres y Quevedo}Reprinted in \cite[\S 2.5]{Randell:1982:ODC}. Translated by Mr. R. Basu.Essais sur l'automatique. Sa definition. {{\'E}}tendue th{\'e}orique de ses applications ({French}) [{Essays} on automation. {Its} definition. {Theoretical} extent of its applications]
@Article{TorresyQuevedo:1915:EAS,
author = "L. {Torres y Quevedo}",
title = "Essais sur l'automatique. Sa definition. {{\'E}}tendue
th{\'e}orique de ses applications ({French}) [{Essays}
on automation. {Its} definition. {Theoretical} extent
of its applications]",
journal = jREVGENSCIPURESAPPL,
volume = "??",
number = "??",
pages = "601611",
day = "15",
month = nov,
year = "1915",
ISSN = "03707431",
bibdate = "Wed Oct 13 11:15:08 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 2.5]{Randell:1982:ODC}.
Translated by Mr. R. Basu.",
acknowledgement = acknhfb,
fjournal = "Revue G{\'e}n{\'e}rale des Sciences Pures et
Appliqu{\'e}es",
language = "French",
}
• ©•†U #/;?9/=m;;?†OÓbookfparith.bibKarpinski:1925:HALouis Charles KarpinskiThe History of ArithmeticRand McNally & CompanyNew York, NY, USAxi + 2001925Fri Nov 28 18:09:05 2003http://www.math.utah.edu/pub/tex/bib/fparith.bib2003.11.28 18:09:05 ???ackmfcLouis Charles KarpinskiThe History of Arithmetic
@Book{Karpinski:1925:HA,
author = "Louis Charles Karpinski",
title = "The History of Arithmetic",
publisher = "Rand McNally \& Company",
address = "New York, NY, USA",
pages = "xi + 200",
year = "1925",
bibdate = "Fri Nov 28 18:09:05 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ackmfc # " and " # acknhfb,
}ŒTW #)1e57Eƒ;Qo1iŽarticlefparith.bibSmith:1924:FPADavid Eugene SmithThe First Printed Arithmetic (Treviso, 1478)jISIS633113311924ISISA400211753 (print), 15456994 (electronic) OR 00211753 (print), 15456994 (electronic)00211753 OR 00211753Tue Jul 30 21:57:26 MDT 2013http://www.jstor.org/action/showPublication?journalCode=isis; http://www.jstor.org/stable/i211087; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/isis1920.bib2013.07.30 21:57:26 MDThttp://www.jstor.org/stable/224315Isisacknhfbhttp://www.jstor.org/page/journal/isis/about.htmlDavid Eugene SmithThe First Printed Arithmetic ({Treviso}, 1478)
@Article{Smith:1924:FPA,
author = "David Eugene Smith",
title = "The First Printed Arithmetic ({Treviso}, 1478)",
journal = jISIS,
volume = "6",
number = "3",
pages = "311331",
month = "????",
year = "1924",
CODEN = "ISISA4",
ISSN = "00211753 (print), 15456994 (electronic)",
ISSNL = "00211753",
bibdate = "Tue Jul 30 21:57:26 MDT 2013",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/i211087;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/isis1920.bib",
URL = "http://www.jstor.org/stable/224315",
acknowledgement = acknhfb,
fjournal = "Isis",
journalURL = "http://www.jstor.org/page/journal/isis/about.html",
}
ÿ :ÿŒ8W #)1W57Eƒ;Qo1Ww articlefparith.bibSmith:1926:FGCDavid Eugene SmithThe First Great Commercial ArithmeticjISIS814149feb21926ISISA400211753 (print), 15456994 (electronic) OR 00211753 (print), 15456994 (electronic)00211753 OR 00211753Tue Jul 30 21:57:36 MDT 2013http://www.jstor.org/action/showPublication?journalCode=isis; http://www.jstor.org/stable/i211094; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/isis1920.bib2013.07.30 21:57:36 MDThttp://www.jstor.org/stable/223673Isisacknhfbhttp://www.jstor.org/page/journal/isis/about.htmlDavid Eugene SmithThe First Great Commercial Arithmetic
@Article{Smith:1926:FGC,
author = "David Eugene Smith",
title = "The First Great Commercial Arithmetic",
journal = jISIS,
volume = "8",
number = "1",
pages = "4149",
month = feb,
year = "1926",
CODEN = "ISISA4",
ISSN = "00211753 (print), 15456994 (electronic)",
ISSNL = "00211753",
bibdate = "Tue Jul 30 21:57:36 MDT 2013",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/i211094;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/isis1920.bib",
URL = "http://www.jstor.org/stable/223673",
acknowledgement = acknhfb,
fjournal = "Isis",
journalURL = "http://www.jstor.org/page/journal/isis/about.html",
}CY #+)#57Eƒ;Qo)/Žoarticlefparith.bibCajori:1926:BRBFlorian CajoriBook Review: booktitle The History of Arithmetic by Louis Charles KarpinskijISIS81231232feb21926ISISA400211753 (print), 15456994 (electronic) OR 00211753 (print), 15456994 (electronic)00211753 OR 00211753Tue Jul 30 21:57:36 MDT 2013http://www.jstor.org/action/showPublication?journalCode=isis; http://www.jstor.org/stable/i211094; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/isis1920.bib2013.07.30 21:57:36 MDThttp://www.jstor.org/stable/223706Isisacknhfbhttp://www.jstor.org/page/journal/isis/about.htmlFlorian CajoriBook Review: {{\booktitle{The History of Arithmetic}} by Louis Charles Karpinski}
@Article{Cajori:1926:BRB,
author = "Florian Cajori",
title = "Book Review: {{\booktitle{The History of Arithmetic}}
by Louis Charles Karpinski}",
journal = jISIS,
volume = "8",
number = "1",
pages = "231232",
month = feb,
year = "1926",
CODEN = "ISISA4",
ISSN = "00211753 (print), 15456994 (electronic)",
ISSNL = "00211753",
bibdate = "Tue Jul 30 21:57:36 MDT 2013",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/i211094;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/isis1920.bib",
URL = "http://www.jstor.org/stable/223706",
acknowledgement = acknhfb,
fjournal = "Isis",
journalURL = "http://www.jstor.org/page/journal/isis/about.html",
}
N
\m¢N„R‰%
@Article{Agrawal:1984:ACB,
author = "V. K. Agrawal and S. Murugesan",
title = "Algorithm converts {BCD} fractions to binary",
journal = jEDN,
volume = "29",
number = "13",
pages = "278280",
month = jun,
year = "1984",
CODEN = "EDNSBH",
ISSN = "00127515, 03646637",
bibdate = "Thu Sep 1 10:16:10 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "EDN",
}‡I
@Article{Agrawal:1983:ICA,
author = "D. P. Agrawal and T. R. N. Rao",
title = "Introduction: Computer Arithmetic",
journal = jIEEETRANSCOMPUT,
volume = "C32",
number = "4",
pages = "329330",
month = apr,
year = "1983",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1983.1676232",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Sun Jul 10 10:01:08 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676232",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}˜‡wo
@Article{Agrawal:1980:NBA,
author = "D. P. Agrawal",
title = "On NegabinaryBinary Arithmetic Relationships and
Their Hardware Reciprocity",
journal = jIEEETRANSCOMPUT,
volume = "C29",
number = "11",
pages = "10321035",
month = nov,
year = "1980",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1980.1675502",
ISSN = "00189340 (print), 15579956 (electron(‡3Žg
@Article{Agrawal:1979:HSA,
author = "D. P. Agrawal",
title = "HighSpeed Arithmetic Arrays",
journal = jIEEETRANSCOMPUT,
volume = "C28",
number = "3",
pages = "215224",
month = mar,
year = "1979",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1979.1675322",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Mon Jul 11 06:49:36 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1675322",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}7ˆ
@Article{Agrawal:1977:CNB,
author = "D. P. Agrawal",
title = "Comments on {``A Note on Base$2$ Arithmetic
Logic''}",
journal = jIEEETRANSCOMPUT,
volume = "C26",
number = "5",
pages = "511511",
month = may,
year = "1977",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1977.1674869",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00ý
÷ ±÷‹7Y ##;357E
;GIŒ9articlefparith.bibJ:1930:RPRbR. A. J.Recent Publications: Reviews: em Standard Table of Square Roots, by L. M. MilneThomsonjAMERMATHMONTHLY376314314jun61930AMMYAE00029890 (print), 19300972 (electronic) OR 00029890 (print), 19300972 (electronic)00029890 OR 00029890Mon Jun 28 12:35:55 MDT 1999http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1999.06.28 12:35:55 MDTAmerican Mathematical Monthlyacknhfbhttp://www.jstor.org/page/journal/amermathmont/about.htmlR. A. J.Recent Publications: Reviews: {{\em Standard Table of Square Roots}}, by {L. M. MilneThomson}
@Article{J:1930:RPRb,
author = "R. A. J.",
title = "Recent Publications: Reviews: {{\em Standard Table of
Square Roots}}, by {L. M. MilneThomson}",
journal = jAMERMATHMONTHLY,
volume = "37",
number = "6",
pages = "314314",
month = jun # "\slash " # jul,
year = "1930",
CODEN = "AMMYAE",
ISSN = "00029890 (print), 19300972 (electronic)",
ISSNL = "00029890",
bibdate = "Mon Jun 28 12:35:55 MDT 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "American Mathematical Monthly",
journalURL = "http://www.jstor.org/page/journal/amermathmont/about.html",
}ŒLW #+)e57Eƒ;Qo)iŽarticlefparith.bibCajori:1927:EAPFlorian CajoriThe Earliest Arithmetic Published in AmericajISIS93391401dec121927ISISA400211753 (print), 15456994 (electronic) OR 00211753 (print), 15456994 (electronic)00211753 OR 00211753Tue Jul 30 21:57:45 MDT 2013http://www.jstor.org/action/showPublication?journalCode=isis; http://www.jstor.org/stable/i214411; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/isis1920.bib2013.07.30 21:57:45 MDThttp://www.jstor.org/stable/330806Isisacknhfbhttp://www.jstor.org/page/journal/isis/about.htmlFlorian CajoriThe Earliest Arithmetic Published in {America}
@Article{Cajori:1927:EAP,
author = "Florian Cajori",
title = "The Earliest Arithmetic Published in {America}",
journal = jISIS,
volume = "9",
number = "3",
pages = "391401",
month = dec,
year = "1927",
CODEN = "ISISA4",
ISSN = "00211753 (print), 15456994 (electronic)",
ISSNL = "00211753",
bibdate = "Tue Jul 30 21:57:45 MDT 2013",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/i214411;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/isis1920.bib",
URL = "http://www.jstor.org/stable/330806",
acknowledgement = acknhfb,
fjournal = "Isis",
journalURL = "http://www.jstor.org/page/journal/isis/about.html",
}
À ‹Y #)+357E
;G)+Œ
articlefparith.bibGarver:1932:QDNbRaymond GarverQuestions, Discussions, and Notes: a Square Root Method and Continued FractionsjAMERMATHMONTHLY399533535nov111932AMMYAE00029890 (print), 19300972 (electronic) OR 00029890 (print), 19300972 (electronic)00029890 OR 00029890Mon Jun 28 12:36:47 MDT 1999http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1999.06.28 12:36:47 MDTAmerican Mathematical Monthlyacknhfbhttp://www.jstor.org/page/journal/amermathmont/about.htmlRaymond GarverQuestions, Discussions, and Notes: a Square Root Method and Continued Fractions
@Article{Garver:1932:QDNb,
author = "Raymond Garver",
title = "Questions, Discussions, and Notes: a Square Root
Method and Continued Fractions",
journal = jAMERMATHMONTHLY,
volume = "39",
number = "9",
pages = "533535",
month = nov,
year = "1932",
CODEN = "AMMYAE",
ISSN = "00029890 (print), 19300972 (electronic)",
ISSNL = "00029890",
bibdate = "Mon Jun 28 12:36:47 MDT 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "American Mathematical Monthly",
journalURL = "http://www.jstor.org/page/journal/amermathmont/about.html",
}Š=W #//e357E
;G/e‹Qarticlefparith.bibLaughlin:1930:LNDHarry H. LaughlinLargeNumber Division by Calculating MachinejAMERMATHMONTHLY376287293jun61930AMMYAE00029890 (print), 19300972 (electronic) OR 00029890 (print), 19300972 (electronic)00029890 OR 00029890Mon Jun 28 12:35:55 MDT 1999http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1999.06.28 12:35:55 MDTAmerican Mathematical Monthlyacknhfbhttp://www.jstor.org/page/journal/amermathmont/about.htmlHarry H. LaughlinLargeNumber Division by Calculating Machine
@Article{Laughlin:1930:LND,
author = "Harry H. Laughlin",
title = "LargeNumber Division by Calculating Machine",
journal = jAMERMATHMONTHLY,
volume = "37",
number = "6",
pages = "287293",
month = jun # "\slash " # jul,
year = "1930",
CODEN = "AMMYAE",
ISSN = "00029890 (print), 19300972 (electronic)",
ISSNL = "00029890",
bibdate = "Mon Jun 28 12:35:55 MDT 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "American Mathematical Monthly",
journalURL = "http://www.jstor.org/page/journal/amermathmont/about.html",
}
¨
‡UD‡Ž
@Article{Akishita:2001:FSS,
author = "Toru Akishita",
title = "Fast Simultaneous Scalar Multiplication on Elliptic
Curve with {Montgomery} Form",
journal = jLECTNOTESCOMPSCI,
volume = "2259",
pages = "255??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t2259.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/2259/22590255.htm;
http://link.springerny.com/link/service/series/0558/papers/2259/22590255.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}³ 35
@Article{AlTwaijry:1998:SPB,
author = "H. A. AlTwaijry and S. F. Oberman and S. T. Fu and M.
J. Flynn",
title = "The {SNAP} Project: Building Validated Floating
Point",
journal = jJUCS,
volume = "4",
number = "2",
pages = "99109",
day = "28",
month = feb,
year = "1998",
CODEN = "????",
ISSN ‹q—c
@Article{AlMohy:2012:MAB,
author = "Awad H. AlMohy",
title = "A more accurate {Briggs} method for the logarithm",
journal = jNUMERALGORITHMS,
volume = "59",
number = "??",
pages = "????",
month = "????",
year = "2012",
CODEN = "NUALEG",
DOI = "http://dx.doi.org/10.1007/s110750119496z",
ISSN = "10171398 (print), 15729265 (electronic)",
ISSNL = "10171398",
bibdat[Ž
@Article{AlMouhamed:1995:ELF,
author = "Mayez AlMouhamed and Lubomir Bic",
title = "Effects of Loop Fusion and Statement Migration on the
Speedup of Vector Multiprocessors",
journal = jJPARDISTCOMP,
volume = "31",
number = "1",
pages = "5664",
day = "15",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1144",
ISSN =¾T
@Article{Alam:1993:RTO,
author = "M. S. Alam and M. A. Karim",
title = ‡O
@Article{AlTwaijry:1998:TSE,
author = "H. A. AlTwaijry and M. J. Flynn",
title = "Technology scaling effects on multipliers",
journal = jIEEETRANSCOMPUT,
volume = "47",
number = "11",
pages = ‡Ž
@Article{Akleylek:2012:MRR,
author = "Sedat Akleylek and Ferruh Ozbudak",
title = "Modified Redundant Representation for Designing
Arithmetic Circuits with Small Complexity",
journal = jIEEETRANSCOMPUT,
volume = "61",
number = "3",
pages = "427432",
month = mar,
year = "2012",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2011.29",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Fri Feb 3 07:35:03 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
} ˆK‘
@Article{Akbarpour:2010:VSI,
author = "Behzad Akbarpour and Amr T. AbdelHamid and
Sofi{\`e}ne Tahar and John Harrison",
title = "Verifying a Synthesized Implementation of {IEEE754}
FloatingPoint Exponential Function using {HOL}",
journal = jCOMPJ,
volume = "53",
number = "4",
pages = "465488",
month = may,
year = "2010",
CODEN = "CMPJA6",
DOI = "http://&
¯‹Y #/)!357E
;G)!Œarticlefparith.bibKalbfell:1934:QDND. C. KalbfellQuestions, Discussions and Notes: On a Method for Calculating Square RootsjAMERMATHMONTHLY418504506oct101934AMMYAE00029890 (print), 19300972 (electronic) OR 00029890 (print), 19300972 (electronic)00029890 OR 00029890Mon Jun 28 12:37:31 MDT 1999http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1999.06.28 12:37:31 MDTAmerican Mathematical Monthlyacknhfbhttp://www.jstor.org/page/journal/amermathmont/about.htmlD. C. KalbfellQuestions, Discussions and Notes: On a Method for Calculating Square Roots
@Article{Kalbfell:1934:QDN,
author = "D. C. Kalbfell",
title = "Questions, Discussions and Notes: On a Method for
Calculating Square Roots",
journal = jAMERMATHMONTHLY,
volume = "41",
number = "8",
pages = "504506",
month = oct,
year = "1934",
CODEN = "AMMYAE",
ISSN = "00029890 (print), 19300972 (electronic)",
ISSNL = "00029890",
bibdate = "Mon Jun 28 12:37:31 MDT 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "American Mathematical Monthly",
journalURL = "http://www.jstor.org/page/journal/amermathmont/about.html",
}ŠNY #3'‚'=m;''/‚Š
bookfparith.bibCouffignal:1933:MCLL. CouffignalLes machines a calculer, leurs principes, leur evolution. (French) [Calculating machines, their principles, their evolution]GauthierVillarsParis, France5335351933Wed Oct 13 11:19:11 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:19:11 ???Extracts reprinted in cite [ 3.2]Randell:1982:ODC. Translated by Mr. R. Basu.FrenchacknhfbL. CouffignalExtracts reprinted in \cite[\S 3.2]{Randell:1982:ODC}. Translated by Mr. R. Basu.Les machines {\`a} calculer, leurs principes, leur {\'e}volution. ({French}) [{Calculating} machines, their principles, their evolution]
@Book{Couffignal:1933:MCL,
author = "L. Couffignal",
title = "Les machines {\`a} calculer, leurs principes, leur
{\'e}volution. ({French}) [{Calculating} machines,
their principles, their evolution]",
publisher = "GauthierVillars",
address = "Paris, France",
year = "1933",
bibdate = "Wed Oct 13 11:19:11 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Extracts reprinted in \cite[\S 3.2]{Randell:1982:ODC}.
Translated by Mr. R. Basu.",
acknowledgement = acknhfb,
language = "French",
}
/
arè/†\9
@Article{Balasubramaniam:2007:ECS,
author = "P. Balasubramaniam and E. Karthikeyan",
title = "Elliptic curve scalar multiplication algorithm using
complementary recoding",
journal = jAPPLMATHCOMP,
volume = "190",
number = "1",
pages = "5156",
day = "1",
month = jul,
year = "2007",
CODEN = "AMHCBQ",
ISSN = "00963003 (print), 18735649 (electronic)",
ISSNL = "00963003",
bibdate = "Sat Jul 12 09:03:06 MDT 2008",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = acknhfb,
fjournal = "Applied Mathematics and Computation",
journalURL = "http://www.sciencedirect.com/science/journal/00963003",
}&j›U
@Article{Bakhrakh:1993:NIF,
author = "S. M. Bakhrakh and S. V. Velichko and N. E.
Pilipchatin and V. F. Spiridonov and E. G. Sukhov and
Yu. G. Fedorova and V. I. Kheifets",
title = "Numerical investigation of floatingpoint arithmetic
operations",
journal = jPROGCOMPSOFT,
volume = "18",
number = "6",
pages = "255258",
year = "1993",
CODEN = "PCSODA",
ISSN
Ó†jU
@Article{Bakhrakh:1992:NIF,
author = "S. M. Bakhrakh and S. V. Velichko and N. E.
Pilipchatin and V. F. Spiridonov and E. G. Sukhov and
Yu. G. Fedorova and V. I. Kheifets",
title = "Numerical investigation of floatingpoint arithmetic
operations. ({Russian})",
journal = jPROGRAMMIROVANIE,
volume = "6",
pages = "1317",
year = "1992",
CODEN = "PROGD3",
ISSN = "01323474, 03617688",
MRclass = "65G05",
MRnumber = "1 227 941",
bibdate = "Fri Dec 8 08:24:14 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "English translation appears in
\cite{Bakhrakh:1993:NIF}.",
acknowledgement = acknhfb,
fjournal = "Programmirovanie",
language = "Russian",
}
w…Š
@Article{Baker:1997:LEP,
author = "Louis Baker",
title = "Letter to the {Editor}: {Pentium II} Math Bug",
journal = jDDJ,
volume = "22",
number = "10",
pages = "1010",
month = oct,
year = "1997",
CODEN = "DDJOEB",
ISSN = "1044789X",
bibdate = "Thu Nov 8 14:50:37 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Comments on the Ariane 5 missile failure mentioned in
\cite{Collins:1997:IPI}.",
acknowledgement = acknhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
Ÿ À
@Article{Baker:1993:SLR,
author = "Henry G. {Baker, Jr.}",
title = "Safe and leakproof resource management using {Ada83}
limited types",
journal = jSIGADALETTERS,
volume = "13",
number = "5",
pages = "3242",
month = sep # "\slash " # oct,
year = "1993",
CODEN = "AALEE5",
ISSN = "10943641 (print), 15579476 (electronic)",
ISSNL = "10943641",
bibdate = "Sat
Ï…Š;
@Article{Baker:1992:LCE,
author = "H. G. Baker",
title = "Less Complex Elementary Functions",
journal = jSIGPLAN,
volume = "27",
number = "11",
pages = "1516",
month = nov,
year = "1992",
CODEN = "SINODQ",
ISSN = "03621340 (print), 15232867 (print), 15581160
(electronic)",
ISSNL = "03621340",
bibdate = "Thu Sep 08 08:11:27 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "ACM SIGPLAN Notices",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
vmV
S`m
‡<Žy
@Article{Agou:2003:SPR,
author = "Simon Joseph Agou and Marc Del{\'e}glise and
JeanLouis Nicolas",
title = "Short Polynomial Representations for Square Roots
¥eËK
@Article{Agarwal:2002:FPN,
author = "R. C. Agarwal and R. F. Enenkel and F. G. Gustavson
and A. Kothari and M. Zubair",
title = "Fast pseudorandomnumber generators with modulus $ 2^k
…ŠA
@Article{Aiken:1946:ASC,
author = "H. H. Aiken and G. M. Hopper",
title = "The {Automatic Sequence Controlled Calculator}",
journal = jELECTRïˆ>}
@Article{Aiken:1964:PAC,
author = "H. H. Aiken",
title = "Proposed automatic calculating machine",
journal = jIEEESPECTRUM,
volume = "1",
number = "??",
pages = "6269",
month = aug,
year = "1964",
CODEN = "IEESAM",
ISSN = "00189235 (print), 19399340 (electronic)",
ISSNL = "00189235",
bibdate = "Wed Oct 13 11:16:56 2010",
bibsource = "http://www.math.utah.edu/pub/tex/ˆ%
@Article{Aharony:2012:IFP,
author = "Merav Aharony and Emanuel Gofman and Elena Guralnik
and Anatoly Koyfman",
title = "Injecting FloatingPoint Testing Knowledge into Test
Generators",
journal = jLECTNOTESCOMPSCI,
volume = "7261",
pages = "234241",
year = "2012",
CODEN = "LNCSD9",
DOI = "http://dx.doi.org/10.1007/9783642341885_20",
ISSN = "03029743 (printY‡A
@Article{Agrawal:1975:AAN,
author = "D. P. Agrawal",
title = "Arithmetic Algorithms in a Negative Base",
journal = jIEEETRANSCOMPUT,
volume = "C24",
number = "10",
pages = "9981000",
month = oct,
year = "1975",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1975.224109",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Tue Jul 12 07:57:57 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672702",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}ü
¥eËK
@Article{Agarwal:2002:FPN,
author = "R. C. Agarwal and R. F. Enenkel and F. G. Gustavson
and A. Kothari and M. Zubair",
title = "Fast pseudorandomnumber generators with modulus $ 2^k
$ or $ 2^{k  1} $ using fused multiplyadd",
journal = jIBMJRD,
volume = "46",
number = "1",
pages = "97116",
month = jan,
year = "2002",
CODEN = "IBMJAE",
DOI = "http://dx.doi.org/10.1147/rd.461.0097",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Mon Mar 18 17:27:08 MST 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
·ˆg‘O
@Article{AbuElHaija:1979:AER,
author = "A. AbuElHaija and A. Peterson",
title = "An approach to eliminate roundoff errors in digital
filters",
journal = jIEEETRANSACOUSTSPEECH,
volume = "27",
number = "2",
pages = "195198",
month = apr,
year = "1979",
CODEN = "IETABA",
ISSN = "00963518",
bibdate = "Sat Jul 16 11:25:06 MDT 2005",
bibsource = "http://ieeexpÝsŒ0`
mŒ1(ˆq‘c
@Article{An:1988:CRE,
author = "S. H. An and K. Yao",
title = "Convergent and roundoff error properties of reflection
coefficients in adaptive spatial recursive least
squares lattice algorithm",
journal = jIEEETRANSCIRCUITSSYST,
volume = "35",
number = "2",
pages = "241246",
month = feb,
year = "1988",
CODEN = "ICSYBT",
ISSN = "00984094 (print), 1558127 ƒ0†U+
@Article{Ambikairajah:1980:TPM,
author = "E. Ambikairajah and M. J. Carey",
title =D…m‹[
@Article{Alsup:1990:MFA,
author = "M. Alsup",
title = "{Motorola}'s 88000 Family Architecture",
journal = jIEEEMICRO,
volume = "10",
number = "3",
pages = "4866",
month = jun,
year = "1990",
CODEN = "IEMIDZ",
DOI = "http://dx.doi.org/10.1109/40.56325",
ISSN = "02721732 (print), 19374143 (electronic)",
ISSNL = "02721732",
bibdate = "Wed Sep 7 22:32:42 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IEEE Micro",
journalURL = "http://www.computer.org/csdl/mags/mi/index.html",
} \…n‹]
@Article{Alt:1988:FEP,
author = "Ren{\'e} Alt",
title = "Floatingpoint error propagation in iterative methods.
Stochastic methods in roundoff error analysis",
journal = jMATHCOMPSIM,
volume = "30",
number = "6",
pages = "505517",
year = "1988",
CODEN = "MCSIDR",
ISSN = "03784754 (print), 18727166 (electronic)",
ISSNL = "03784754",
MRclass = "65G05 (65F10)",
MRnumber = "90f:65067",
bibdate = "Fri Dec 8 08:24:13 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Mathematics and Computers in Simulation",
reviewer = "D. Bini",
}àú‡2Že
@Article{Alia:1991:VMM,
author = "G. Alia and E. Martinelli",
title = "A {VLSI} modulo $m$ multiplier",
journal = jIEEETRANSCOMPUT,
volume = "40",
number = "7",
pages = "873878",
month = jul,
year = "1991",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.83626",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Thu Jul 7 12:52:22 MDT ŠK•
@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 = jIEEETRANSCIRCUITSSYST,
volume = "31",
number = "12",
pages = "10331039",
month = dec,
year = "1984",
CODEN = "ICSYBT",
DOI = "http://dx.doi.org/10.1109/TC.1984!‡Ž5
@Article{AlTwaijry:1998:SPB,
author = "H. A. AlTwaijry and S. F. Oberman and S. T. Fu and M.
J. Flynn",
title = "The {SNAP} Project: Building Validated Floating
Point",
journal = jJUCS,
volume = "4",
number = "2",
pages = "99109",
day = "28",
month = feb,
year = "1998",
CODEN = "????",
ISSN = "09486968",
ISSNL = "09486968",
bibdate = "Wed Mar 4 15:32:49 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://medoc.springer.de:8000/jucs/jucs_4_2/the_snap_project_building;
http://www.jucs.org/jucs_4_2/the_snap_project_building/Al_twaijry_H_A.pdf",
acknowledgement = acknhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journalURL = "http://www.jucs.org/jucs",
}
@ ´@ŠqW #'‚c=m;_Og‚wŠ?#miscfparith.bibZuse:1936:VSDK. ZuseVerfahren zur selbsttatigen Durchfuhrung von Rechnungen mit Hilfe von Rechenmaschinen. (German) [Procedure for automatic execution of calculations by calculating machines]18722111apr41936Wed Oct 13 11:22:03 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:22:03 ???Reprinted in cite [ 4.1]Randell:1982:ODC.GermanacknhfbGerman patent application Z23624.K. ZuseReprinted in \cite[\S 4.1]{Randell:1982:ODC}.{Verfahren zur selbstt{\"a}tigen Durchfuhrung von Rechnungen mit Hilfe von Rechenmaschinen}. ({German}) [{Procedure} for automatic execution of calculations by calculating machines]
@Misc{Zuse:1936:VSD,
author = "K. Zuse",
title = "{Verfahren zur selbstt{\"a}tigen Durchfuhrung von
Rechnungen mit Hilfe von Rechenmaschinen}. ({German})
[{Procedure} for automatic execution of calculations by
calculating machines]",
howpublished = "German patent application Z23624.",
day = "11",
month = apr,
year = "1936",
bibdate = "Wed Oct 13 11:22:03 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 4.1]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
language = "German",
}‡iU #)117=m;_W)g1ˆA#articlefparith.bibPhillips:1936:BCE. W. PhillipsBinary calculationjJINSTACTUARIES67187221193600202681 OR 00202681Wed Oct 13 11:33:16 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:33:16 ???Reprinted in cite [ 7.1]Randell:1982:ODC.Journal of the Institute of ActuariesacknhfbE. W. PhillipsReprinted in \cite[\S 7.1]{Randell:1982:ODC}.Binary calculation
@Article{Phillips:1936:BC,
author = "E. W. Phillips",
title = "Binary calculation",
journal = jJINSTACTUARIES,
volume = "67",
number = "??",
pages = "187221",
year = "1936",
ISSN = "00202681",
bibdate = "Wed Oct 13 11:33:16 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 7.1]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
fjournal = "Journal of the Institute of Actuaries",
}Œ]W #'s57Eƒ;Qo'sŽarticlefparith.bibCalvert:1936:DDSH. R. CalvertDecimal Division of Scales before the Metric SystemjISIS252433436sep91936ISISA400211753 (print), 15456994 (electronic) OR 00211753 (print), 15456994 (electronic)00211753 OR 00211753Tue Jul 30 21:21:25 MDT 2013http://www.jstor.org/action/showPublication?journalCode=isis; http://www.jstor.org/stable/i211115; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/isis1930.bib2013.07.30 21:21:25 MDThttp://www.jstor.org/stable/225380Isisacknhfbhttp://www.jstor.org/page/journal/isis/about.htmlH. R. CalvertDecimal Division of Scales before the Metric System
@Article{Calvert:1936:DDS,
author = "H. R. Calvert",
title = "Decimal Division of Scales before the Metric System",
journal = jISIS,
volume = "25",
number = "2",
pages = "433436",
month = sep,
year = "1936",
CODEN = "ISISA4",
ISSN = "00211753 (print), 15456994 (electronic)",
ISSNL = "00211753",
bibdate = "Tue Jul 30 21:21:25 MDT 2013",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/i211115;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/isis1930.bib",
URL = "http://www.jstor.org/stable/225380",
acknowledgement = acknhfb,
fjournal = "Isis",
journalURL = "http://www.jstor.org/page/journal/isis/about.html",
}
o
o‹Y #+%%357E
;G%%Œarticlefparith.bibEscott:1937:QDNE. B. EscottQuestions, Discussions, and Notes: Rapid Method for Extracting a Square RootjAMERMATHMONTHLY4410644646dec121937AMMYAE00029890 (print), 19300972 (electronic) OR 00029890 (print), 19300972 (electronic)00029890 OR 00029890Mon Jun 28 12:38:44 MDT 1999http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1999.06.28 12:38:44 MDTAmerican Mathematical Monthlyacknhfbhttp://www.jstor.org/page/journal/amermathmont/about.htmlE. B. EscottQuestions, Discussions, and Notes: Rapid Method for Extracting a Square Root
@Article{Escott:1937:QDN,
author = "E. B. Escott",
title = "Questions, Discussions, and Notes: Rapid Method for
Extracting a Square Root",
journal = jAMERMATHMONTHLY,
volume = "44",
number = "10",
pages = "644646",
month = dec,
year = "1937",
CODEN = "AMMYAE",
ISSN = "00029890 (print), 19300972 (electronic)",
ISSNL = "00029890",
bibdate = "Mon Jun 28 12:38:44 MDT 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "American Mathematical Monthly",
journalURL = "http://www.jstor.org/page/journal/amermathmont/about.html",
}rith.bib",
note = "Not submitted until 1940",
URL = "http://dspace.mit.edu/bitstream/handle/1721.1/11173/34541425.pdf",
acknowledgement = acknhfb,
authordates = "April 30, 1916February 24, 2001",
remark = "Smiley \cite[p. 91]{Smiley:2010:MWI} claims: ``He
[Shannon] also had the insight, like Atanasoff, that
the binary arithmetic that relay switches represented
would simplify information systems. His master's
thesis, written when he as twentyone and published
when he was twentytwo, is considered to be one of the
most important, if not the most important, master's
thesis of the twentieth century.''\par
Pages 5961 of the thesis are a section called
``Electric Adder to the Base Two'', and pages 6268,
``A Factor Table Machine'', describe a machine that
will print a table of factors and primes of all the
integers from 1 to 100,000,000. Shannon notes on page
68: ``As to the practicality of such a device, it might
be said that J. P. Kulik spent 20 years in constructing
a table of primes up to 100,000,000 and when finished
it was found to contain so many errors that it was not
worth publishing. The machine described here could
probably be made to handle 5 numbers per second so that
the table would require only about 2 months to
construct.''",
}
::CW '#7s/_1=m;=
=O7=s¡%mastersthesisfparith.bibShannon:1937:SARClaude Elwood ShannonA Symbolic Analysis of Relay and Switching CircuitsMaster of ScienceDepartment of Electrical Engineering, MITCambridge, MA, USA7210aug81937Thu Nov 18 10:35:20 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.11.18 10:35:20 ???Not submitted until 1940http://dspace.mit.edu/bitstream/handle/1721.1/11173/34541425.pdfSmiley cite [p. 91]Smiley:2010:MWI claims: ``He [Shannon] also had the insight, like Atanasoff, that the binary arithmetic that relay switches represented would simplify information systems. His master's thesis, written when he as twentyone and published when he was twentytwo, is considered to be one of the most important, if not the most important, master's thesis of the twentieth century.''par Pages 5961 of the thesis are a section called ``Electric Adder to the Base Two'', and pages 6268, ``A Factor Table Machine'', describe a machine that will print a table of factors and primes of all the integers from 1 to 100,000,000. Shannon notes on page 68: ``As to the practicality of such a device, it might be said that J. P. Kulik spent 20 years in constructing a table of primes up to 100,000,000 and when finished it was found to contain so many errors that it was not worth publishing. The machine described here could probably be made to handle 5 numbers per second so that the table would require only about 2 months to construct.''acknhfbApril 30, 1916February 24, 2001Claude Elwood ShannonNot submitted until 1940A Symbolic Analysis of Relay and Switching Circuits
@MastersThesis{Shannon:1937:SAR,
author = "Claude Elwood Shannon",
title = "A Symbolic Analysis of Relay and Switching Circuits",
type = "{Master of Science}",
school = "Department of Electrical Engineering, MIT",
address = "Cambridge, MA, USA",
pages = "72",
day = "10",
month = aug,
year = "1937",
bibdate = "Thu Nov 18 10:35:20 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Not submitted until 1940",
URL = "http://dspace.mit.edu/bitstream/handle/1721.1/11173/34541425.pdf",
acknowledgement = acknhfb,
authordates = "April 30, 1916February 24, 2001",
remark = "Smiley \cite[p. 91]{Smiley:2010:MWI} claims: ``He
[Shannon] also had the insight, like Atanasoff, that
the binary arithmetic that relay switches represented
would simplify information systems. His master's
thesis, written when he as twentyone and published
when he was twentytwo, is considered to be one of the
most important, if not the most important, master's
thesis of the twentieth century.''\par
Pages 5961 of the thesis are a section called
``Electric Adder to the Base Two'', and pages 6268,
``A Factor Table Machine'', describe a machine that
will print a table of factors and primes of all the
integers from 1 to 100,000,000. Shannon notes on page
68: ``As to the practicality of such a device, it might
be said that J. P. Kulik spent 20 years in constructing
a table of primes up to 100,000,000 and when finished
it was found to contain so many errors that it was not
worth publishing. The machine described here could
probably be made to handle 5 numbers per second so that
the table would require only about 2 months to
construct.''",
}umbers begin with the
digit 1 than with the digit 9. A compilation of some
20,000 first digits taken from widely divergent sources
shows that there is a logarithmic distribution of first
digits when the numbers are composed of four or more
digits. An analysis of the numbers from different
sources shows that the numbers taken from unrelated
subjects, such as a group of newspaper items, show a
much better agreement with a logarithmic distribution
than do numbers from mathematical tabulations or other
formal data. There is here the peculiar fact that
numbers that individually are without relationship are,
when considered in large groups, in good agreement with
a distribution lawhence the name ``Anomalous
Numbers.''\par
A further analysis of the data shows a strong tendency
for bodies of numerical data to fall into geometric
series. If the series is made up of numbers containing
three or more digits the first digits form a
logarithmic series. If the numbers contain only single
digits the geometric relation still holds but the
simple logarithmic relation no longer applies.\par
An equation is given showing the frequencies of first
digits in the different orders of numbers 1 to 10, 10
to 100, etc.\par
The equation also gives the frequency of digits in the
second, third + place of a multidigit number, and it
is shown that the same law applies to
reciprocals.\par
There are many instances showing that the geometric
series, or the logarithmic law, has long been
recognized as a common phenomenon in factual literature
and in the ordinary affairs of life. The wire gauge and
drill gauge of the mechanic, the magnitude scale of the
astronomer and the sensory response curves of the
psychologist are all particular examples of a
relationship that seems to extend to all human affairs.
The Law of Anomalous Numbers is thus a general
probability law of widespread application.",
acknowledgement = acknhfb,
fjournal = "Proceedings of the {American Philosophical Society}
held at {Philadelphia} for promoting useful knowledge",
journalURL = "http://www.jstor.org/journal/procamerphilsoci",
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
remark = "From \cite{Logan:1978:FDP}: ``Benford's paper was
published in 1938 in a journal of rather limited
circulation and not usually read by mathematicians. It
so happened that it was immediately followed in the
same issue by a physics paper which became of some
importance for secret nuclear work during World War II
[H. A. Bethe, M. E. Rose, and L. P. Smith, `The
Multiple Scattering of Electrons', Proc. Amer. Phil.
Soc. 78(4), 573585 (1938)]. That is why Benford's
paper caught the attention of physicists in the early
1940's and was much discussed. This led to the notes in
Nature by Goudsmit and Furry [3] and Furry and Hurwitz
[4] containing an effort to explain Benford's law. We
considered it at that time merely a welcome diversion
and did not expect that over thirty papers would be
devoted to this subject in subsequent years.'' The 2006
bibliography \cite{Hurlimann:2006:BLB} cites 325
publications about Benford's Law.",
}
h
yû–¬
@Article{Cmelik:1991:AMS,
author = "Robert F. Cmelik and Shing I. Kong and David R. Ditzel
and Edmund J. Kelly",
title = "An Analysis of {MIPS} and {SPARC} Instruction Set
Utilization on the {SPEC} Benchmarks",
journal = jSIGPLAN,
volume = "26",
number = "4",
pages = "290301 (or 290302??)",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "03621340 (pŽœ
@Article{Codenotti:1990:ATT,
author = "B. Codenotti and G. Lotti and F. Romani",
title = "Areatime tradeoffs for matrixvector
multiplication",
journal = jJPARDISTCOMP,
volume = "8",
number = "1",
pages = "5259",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "07437315 (print), 10960848 (electronic)",
ISSNL = "07437315",
bibdate = "Sat Apr 12 19F†Œ1
@Article{Cody:1971:DHC,
author = "W. J. Cody",
title = "Desirable Hardware Characteristics for Scientific
Computation",
journal = jSIGNUM,
volume = "6",
number = "1",
pages = "1631",
month = jan,
year = "1971",
CODEN = "SNEWD6",
DOI = "http://doi.acm.org/10.1145/1052614.1052616",
ISSN = "01635778 (print), 15580237 (electronic)",
ISSNL = "01635778",
bibdate = "Tue Apr 12 07:49:57 MDT 2005",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "ACM SIGNUM Newsletter",
xxtitle = "Hardware characteristics (pages missing from print)",
}"„b‰E
@Article{Cody:1967:CFI,
author = "W. J. Cody",
title = "Critique of the {FORTRAN IV (H)} Library for the {IBM
System\slash 360}",
journal = "{SHARE Secretary Distribution}",
volume = "SSD 169",
number = "C4473",
pages = "411",
year = "1967",
bibdate = "Fri Aug 20 08:52:04 2010",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/c/codywilliamj.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}oŒu™k
@Article{Cody:1964:DPS,
author = "W. J. {Cody, Jr.}",
title = "DoublePrecision Square Root for the {CDC3600}",
journal = jCACM,
volume = "7",
number = "12",
pages = "715718",
month = dec,
year = "1964",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/355588.365122",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu Sep 1
‡Ž
@Article{Cluley:1980:DCB,
author = "J. C. Cluley",
title = "Digital Circuits for Binary Arithmetic",
journal = jCOMPJ,
volume = "23",
number = "3",
pages = "269269",
month = aug,
year = "1980",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/23.3.269",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:08 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/23/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://comjnl.oxfordjournals.org/content/23/3/269.full.pdf+html",
acknowledgement = acknhfb,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}†$e Law of Anomalous Numbers is thus a general probability law of widespread application.Proceedings of the American Philosophical Society held at Philadelphia for promoting useful knowledgeBenford's Law; Law of Anomalous Numbers; Zipf's LawFrom cite Logan:1978:FDP: ``Benford's paper was published in 1938 in a journal of rather limited circulation and not usually read by mathematicians. It so happened that it was immediately followed in the same issue by a physics paper which became of some importance for secret nuclear work during World War II [H. A. Bethe, M. E. Rose, and L. P. Smith, `The Multiple Scattering of Electrons', Proc. Amer. Phil. Soc. 78(4), 573585 (1938)]. That is why Benford's paper caught the attention of physicists in the early 1940's and was much discussed. This led to the notes in Nature by Goudsmit and Furry [3] and Furry and Hurwitz [4] containing an effort to explain Benford's law. We considered it at that time merely a welcome diversion and did not expect that over thirty papers would be devoted to this subject in subsequent years.'' The 2006 bibliography cite Hurlimann:2006:BLB cites 325 publications about Benford's Law.acknhfbhttp://www.jstor.org/journal/procamerphilsociIt has been observed that the first pages of a table of common logarithms show more wear than do the last pages, indicating that more used numbers begin with the digit 1 than with the digit 9. A compilation of some 20,000 first digits taken from widely divergent sources shows that there is a logarithmic distribution of first digits when the numbers are composed of four or more digits. An analysis of the numbers from different sources shows that the numbers taken from unrelated subjects, such as a group of newspaper items, show a much better agreement with a logarithmic distribution than do numbers from mathematical tabulations or other formal data. There is here the peculiar fact that numbers that individually are without relationship are, when considered in large groups, in good agreement with a distribution lawhence the name ``Anomalous Numbers.''\par A further analysis of the data shows a strong tendency for bodies of numerical data to fall into geometric series. If the series is made up of numbers containing three or more digits the first digits form a logarithmic series. If the numbers contain only single digits the geometric relation still holds but the simple logarithmic relation no longer applies.\par An equation is given showing the frequencies of first digits in the different orders of numbers 1 to 10, 10 to 100, etc.\par The equation also gives the frequency of digits in the second, third + place of a multidigit number, and it is shown that the same law applies to reciprocals.\par There are many instances showing that the geometric series, or the logarithmic law, has long been recognized as a common phenomenon in factual literature and in the ordinary affairs of life. The wire gauge and drill gauge of the mechanic, the magnitude scale of the astronomer and the sensory response curves of the psychologist are all particular examples of a relationship that seems to extend to all human affairs. The Law of Anomalous Numbers is thus a general probability law of widespread application.Frank BenfordThe Law of Anomalous Numbers
@Article{Benford:1938:LAN,
author = "Frank Benford",
title = "The Law of Anomalous Numbers",
journal = jPROCAMERPHILSOC,
volume = "78",
number = "4",
pages = "551572",
month = mar,
year = "1938",
CODEN = "PAPCAA",
ISSN = "0003049X (print), 23269243 (electronic)",
ISSNL = "0003049X",
bibdate = "Thu Feb 15 16:28:28 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://links.jstor.org/sici?sici=0003049X%2819380331%2978%3A4%3C551%3ATLOAN%3E2.0.CO%3B2G",
abstract = "It has been observed that the first pages of a table
of common logarithms show more wear than do the last
pages, indicating that more used numbers begin with the
digit 1 than with the digit 9. A compilation of some
20,000 first digits taken from widely divergent sources
shows that there is a logarithmic distribution of first
digits when the numbers are composed of four or more
digits. An analysis of the numbers from different
sources shows that the numbers taken from unrelated
subjects, such as a group of newspaper items, show a
much better agreement with a logarithmic distribution
than do numbers from mathematical tabulations or other
formal data. There is here the peculiar fact that
numbers that individually are without relationship are,
when considered in large groups, in good agreement with
a distribution lawhence the name ``Anomalous
Numbers.''\par
A further analysis of the data shows a strong tendency
for bodies of numerical data to fall into geometric
series. If the series is made up of numbers containing
three or more digits the first digits form a
logarithmic series. If the numbers contain only single
digits the geometric relation still holds but the
simple logarithmic relation no longer applies.\par
An equation is given showing the frequencies of first
digits in the different orders of numbers 1 to 10, 10
to 100, etc.\par
The equation also gives the frequency of digits in the
second, third + place of a multidigit number, and it
is shown that the same law applies to
reciprocals.\par
There are many instances showing that the geometric
series, or the logarithmic law, has long been
recognized as a common phenomenon in factual literature
and in the ordinary affairs of life. The wire gauge and
drill gauge of the mechanic, the magnitude scale of the
astronomer and the sensory response curves of the
psychologist are all particular examples of a
relationship that seems to extend to all human affairs.
The Law of Anomalous Numbers is thus a general
probability law of widespread application.",
acknowledgement = acknhfb,
fjournal = "Proceedings of the {American Philosophical Society}
held at {Philadelphia} for promoting useful knowledge",
journalURL = "http://www.jstor.org/journal/procamerphilsoci",
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
remark = "From \cite{Logan:1978:FDP}: ``Benford's paper was
published in 1938 in a journal of rather limited
circulation and not usually read by mathematicians. It
so happened that it was immediately followed in the
same issue by a physics paper which became of some
importance for secret nuclear work during World War II
[H. A. Bethe, M. E. Rose, and L. P. Smith, `The
Multiple Scattering of Electrons', Proc. Amer. Phil.
Soc. 78(4), 573585 (1938)]. That is why Benford's
paper caught the attention of physicists in the early
1940's and was much discussed. This led to the notes in
Nature by Goudsmit and Furry [3] and Furry and Hurwitz
[4] containing an effort to explain Benford's law. We
considered it at that time merely a welcome diversion
and did not expect that over thirty papers would be
devoted to this subject in subsequent years.'' The 2006
bibliography \cite{Hurlimann:2006:BLB} cites 325
publications about Benford's Law.",
}
qqÓ[ #'E557=m;CŸ]WsŽEgŸe'EÌSarticlefparith.bibBenford:1938:LANFrank BenfordThe Law of Anomalous NumbersjPROCAMERPHILSOC784551572mar31938PAPCAA0003049X (print), 23269243 (electronic) OR 0003049X (print), 23269243 (electronic)0003049X OR 0003049XThu Feb 15 16:28:28 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.02.15 16:28:28 ???http://links.jstor.org/sici?sici=0003049X%2819380331%2978%3A4%3C551%3ATLOAN%3E2.0.CO%3B2GIt has been observed that the first pages of a table of common logarithms show more wear than do the last pages, indicating that more used numbers begin with the digit 1 than with the digit 9. A compilation of some 20,000 first digits taken from widely divergent sources shows that there is a logarithmic distribution of first digits when the numbers are composed of four or more digits. An analysis of the numbers from different sources shows that the numbers taken from unrelated subjects, such as a group of newspaper items, show a much better agreement with a logarithmic distribution than do numbers from mathematical tabulations or other formal data. There is here the peculiar fact that numbers that individually are without relationship are, when considered in large groups, in good agreement with a distribution lawhence the name ``Anomalous Numbers.''par A further analysis of the data shows a strong tendency for bodies of numerical data to fall into geometric series. If the series is made up of numbers containing three or more digits the first digits form a logarithmic series. If the numbers contain only single digits the geometric relation still holds but the simple logarithmic relation no longer applies.par An equation is given showing the frequencies of first digits in the different orders of numbers 1 to 10, 10 to 100, etc.par The equation also gives the frequency of digits in the second, third + place of a multidigit number, and it is shown that the same law applies to reciprocals.par There are many instances showing that the geometric series, or the logarithmic law, has long been recognized as a common phenomenon in factual literature and in the ordinary affairs of life. The wire gauge and drill gauge of the mechanic, the magnitude scale of the astronomer and the sensory response curves of the psychologist are all particular examples of a relationship that seems to extend to all human affairs. Th#
Y Y‡9W#)]!)!=m;]‡I£bookfparith.bibHardy:1938:ITNG. H. (Godfrey Harold) Hardy and E. M. (Edward Maitland) WrightAn Introduction to the Theory of NumberspubOXFORDpubOXFORD:adrxvi + 4031938QA241 .H28Fri Nov 30 06:49:15 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.11.30 06:49:15 ???acknhfbG. H. (Godfrey Harold) Hardy and E. M. (Edward Maitland) WrightAn Introduction to the Theory of Numbers
@Book{Hardy:1938:ITN,
author = "G. H. (Godfrey Harold) Hardy and E. M. (Edward
Maitland) Wright",
title = "An Introduction to the Theory of Numbers",
publisher = pubOXFORD,
address = pubOXFORD:adr,
pages = "xvi + 403",
year = "1938",
LCCN = "QA241 .H28",
bibdate = "Fri Nov 30 06:49:15 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}hY #3'ƒ7G'=m;''/ƒ_ phdthesisfparith.bibCouffignal:1938:AMAL. CouffignalSur l'analyse mecanique. Application aux machines a calculer et aux calculs de la mecanique celeste. (French) [On mechanical analysis. Application to calculating machines and to calculation in celestial mechanics]GauthierVillarsFaculte des Sciences de ParisParis, France5515721938Wed Oct 13 11:17:22 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:17:22 ???Extracts reprinted in cite [ 2.7]Randell:1982:ODC. Translated by Mr. R. Basu.FrenchacknhfbL. CouffignalExtracts reprinted in \cite[\S 2.7]{Randell:1982:ODC}. Translated by Mr. R. Basu.Sur l'analyse m{\'e}canique. Application aux machines {\`a} calculer et aux calculs de la m{\'e}canique c{\'e}leste. ({French}) [{On} mechanical analysis. Application to calculating machines and to calculation in celestial mechanics]
@PhdThesis{Couffignal:1938:AMA,
author = "L. Couffignal",
title = "Sur l'analyse m{\'e}canique. Application aux machines
{\`a} calculer et aux calculs de la m{\'e}canique
c{\'e}leste. ({French}) [{On} mechanical analysis.
Application to calculating machines and to calculation
in celestial mechanics]",
publisher = "GauthierVillars",
school = "Facult{\'e} des Sciences de Paris",
address = "Paris, France",
year = "1938",
bibdate = "Wed Oct 13 11:17:22 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Extracts reprinted in \cite[\S 2.7]{Randell:1982:ODC}.
Translated by Mr. R. Basu.",
acknowledgement = acknhfb,
language = "French",
} http://www2.research.att.com/~njas/doc/shannonbio.html",
acknowledgement = acknhfb,
fjournal = "Transactions of the American Institute of Electrical
Engineers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6413714",
remark = "This is Shannon's first published paper (his Master's
thesis). In 1940, it received the Alfred Noble Prize of
the combined engineering societies of the United
States, an award given each year to a person not over
thirty for a paper published in one of the journals of
the participating societies. H. H. Goldstine
\cite{Goldstine:1972:CPN} called this work ``one of the
most important master's theses ever written ... a
landmark in that it helped to change digital circuit
design from an art to a science.''",
}
ùù” Y #/sA7=]; ‡}/s–Uarticlefparith.bibShannon:1938:SARClaude E. ShannonA Symbolic Analysis of Relay and Switching CircuitsjTRANSAMERINSTELECENG57713723dec121938TAEEA500963860 OR 00963860Sat Nov 20 08:54:12 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www2.research.att.com/~njas/doc/shannonbio.html2010.11.20 08:54:12 ???Transactions of the American Institute of Electrical EngineersThis is Shannon's first published paper (his Master's thesis). In 1940, it received the Alfred Noble Prize of the combined engineering societies of the United States, an award given each year to a person not over thirty for a paper published in one of the journals of the participating societies. H. H. Goldstine cite Goldstine:1972:CPN called this work ``one of the most important master's theses ever written ... a landmark in that it helped to change digital circuit design from an art to a science.''acknhfbhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6413714Claude E. ShannonA Symbolic Analysis of Relay and Switching Circuits
@Article{Shannon:1938:SAR,
author = "Claude E. Shannon",
title = "A Symbolic Analysis of Relay and Switching Circuits",
journal = jTRANSAMERINSTELECENG,
volume = "57",
number = "??",
pages = "713723",
month = dec,
year = "1938",
CODEN = "TAEEA5",
ISSN = "00963860",
bibdate = "Sat Nov 20 08:54:12 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www2.research.att.com/~njas/doc/shannonbio.html",
acknowledgement = acknhfb,
fjournal = "Transactions of the American Institute of Electrical
Engineers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6413714",
remark = "This is Shannon's first published paper (his Master's
thesis). In 1940, it received the Alfred Noble Prize of
the combined engineering societies of the United
States, an award given each year to a person not over
thirty for a paper published in one of the journals of
the participating societies. H. H. Goldstine
\cite{Goldstine:1972:CPN} called this work ``one of the
most important master's theses ever written ... a
landmark in that it helped to change digital circuit
design from an art to a science.''",
}
¼ ¼ŠW"X ##
)OE‚#;S]Œarticlefparith.bibK:1939:BRBdM. G. K.Book Review: booktitle Duodecimal Arithmetic, by George S. TerryjJRSTATSOC10222993001939http://dx.doi.org/10.2307/2980013Sat Jan 24 11:18:08 MST 2015http://www.jstor.org/stable/i349540; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/jrssa1930.bib2015.01.24 11:18:08 MSThttp://www.jstor.org/stable/2980013Journal of the Royal Statistical SocietyacknhfbM. G. K.Book Review: {{\booktitle{Duodecimal Arithmetic}}, by George S. Terry}
@Article{K:1939:BRBd,
author = "M. G. K.",
title = "Book Review: {{\booktitle{Duodecimal Arithmetic}}, by
George S. Terry}",
journal = jJRSTATSOC,
volume = "102",
number = "2",
pages = "299300",
month = "????",
year = "1939",
DOI = "http://dx.doi.org/10.2307/2980013",
bibdate = "Sat Jan 24 11:18:08 MST 2015",
bibsource = "http://www.jstor.org/stable/i349540;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/jrssa1930.bib",
URL = "http://www.jstor.org/stable/2980013",
acknowledgement = acknhfb,
fjournal = "Journal of the Royal Statistical Society",
}g!Y#)Q57Eƒ;QoQarticlefparith.bibJager:1939:AADRobert Jager and Boyd C. PattersonThe Artificial Arithmetick in Decimals of Robert Jager (London, 1651)jISIS3112531nov111939ISISA400211753 (print), 15456994 (electronic) OR 00211753 (print), 15456994 (electronic)00211753 OR 00211753Tue Jul 30 21:26:49 MDT 2013http://www.jstor.org/action/showPublication?journalCode=isis; http://www.jstor.org/stable/i302217; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/isis1930.bib2013.07.30 21:26:49 MDThttp://www.jstor.org/stable/226014Isisacknhfbhttp://www.jstor.org/page/journal/isis/about.htmlRobert Jager and Boyd C. PattersonThe Artificial Arithmetick in Decimals of {Robert Jager} ({London}, 1651)
@Article{Jager:1939:AAD,
author = "Robert Jager and Boyd C. Patterson",
title = "The Artificial Arithmetick in Decimals of {Robert
Jager} ({London}, 1651)",
journal = jISIS,
volume = "31",
number = "1",
pages = "2531",
month = nov,
year = "1939",
CODEN = "ISISA4",
ISSN = "00211753 (print), 15456994 (electronic)",
ISSNL = "00211753",
bibdate = "Tue Jul 30 21:26:49 MDT 2013",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/i302217;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/isis1930.bib",
URL = "http://www.jstor.org/stable/226014",
acknowledgement = acknhfb,
fjournal = "Isis",
journalURL = "http://www.jstor.org/page/journal/isis/about.html",
}
fŠÐVf x&V '#)7#1'=m;‡!7³kmastersthesisfparith.bibBerry:1941:DEDClifford Edward BerryDesign of electrical data recording and reading mechanismM.S. thesisIowa State CollegeAmes, IA, USA321941Thu Nov 18 11:18:18 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.11.18 11:18:18 ???This thesis may be one of the earliest surviving records of the ABC computer built by John Atanasoff and Clifford Berry in the late 1930s. The o†w%U !#)'9C/=m;_'g‡techreportfparith.bibStibitz:1940:CG. R. StibitzComputerUnpublished memorandumBell Telephone LaboratoriesNew York, NY, USA2993001940Wed Oct 13 11:30:38 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:30:38 ???Reprinted in cite [ 6.1]Randell:1982:ODC.acknhfbG. R. StibitzReprinted in \cite[\S 6.1]{Randell:1982:ODC}.Computer
@TechReport{Stibitz:1940:C,
author = "G. R. Stibitz",
title = "Computer",
type = "Unpublished memorandum",
institution = "Bell Telephone Laboratories",
address = "New York, NY, USA",
year = "1940",
bibdate = "Wed Oct 13 11:30:38 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 6.1]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
}‰7$X #%5=m;‚#‚+5ˆ}miscfparith.bibBush:1940:AMV. BushArithmetical Machine2993001940Wed Oct 13 11:37:32 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:37:32 ???Reprinted in cite [ 7.3]Randell:1982:ODC. Copyright interest in the unpublished writings of Vannevar Bush has been dedicated to the public.acknhfbVannevar Bush Papers, Container 18, Folder: Caldwell, Samuel, 19391940V. BushReprinted in \cite[\S 7.3]{Randell:1982:ODC}. Copyright interest in the unpublished writings of Vannevar Bush has been dedicated to the public.Arithmetical Machine
@Misc{Bush:1940:AM,
author = "V. Bush",
title = "Arithmetical Machine",
howpublished = "Vannevar Bush Papers, Container 18, Folder: Caldwell,
Samuel, 19391940",
year = "1940",
bibdate = "Wed Oct 13 11:37:32 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 7.3]{Randell:1982:ODC}.
Copyright interest in the unpublished writings of
Vannevar Bush has been dedicated to the public.",
acknowledgement = acknhfb,
}ˆs#W !#1+/91'=m;_+g/ˆqtechreportfparith.bibAtanasoff:1940:CMSJ. V. AtanasoffComputing machine for the solution of large systems of linear algebraic equationsUnpublished memorandumIowa State CollegeAmes, IA, USA299300aug81940Wed Oct 13 11:36:11 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:36:11 ???Reprinted in cite [ 7.2]Randell:1982:ODC.acknhfbJ. V. AtanasoffReprinted in \cite[\S 7.2]{Randell:1982:ODC}.Computing machine for the solution of large systems of linear algebraic equations
@TechReport{Atanasoff:1940:CMS,
author = "J. V. Atanasoff",
title = "Computing machine for the solution of large systems of
linear algebraic equations",
type = "Unpublished memorandum",
institution = "Iowa State College",
address = "Ames, IA, USA",
month = aug,
year = "1940",
bibdate = "Wed Oct 13 11:36:11 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 7.2]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
}
ŽÁŸ
):°Áˆ
@Article{Koc:1998:LCB,
author = "C. K. Koc and B. Sunar",
title = "Lowcomplexity bitparallel canonical and normal basis
multipliers for a class of finite fields",
journal = jIEEETRANSCOMPUT,
volume = "47",
number = "3",
pages = "353356",
month = mar,
year = "1998",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.660172",
ISSN = "00189340 (print), 15579îŽre
@Article{Koc:1991:FAG,
author = "Cetin K. Koc and Sarath N. Arachchige",
title = "A fast algorithm for {Gaussian} elimination over
{GF(2)} and its implementation on the {GAPP}",
journal = jJPARDISTCOMP,
volume = "13",
number = "1",
pages = "118122",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "07437315 (print), 10960848 (electronic)",
IS]‡kW
@Article{Knuth:1970:VNF,
author = "Donald E. Knuth",
title = "{Von Neumann}'s First Computer Program",
journal = jCOMPSURV,
volume = "2",
number = "4",
pages = "247260",
month = dec,
year = "1970",
CODEN = "CMSVAN",
DOI = "http://doi.acm.org/10.1145/356580.356581",
ISSN = "00104892",
ISSNL = "03600300",
bibdate = "Sat Mar 23 15:03:00 2002",
bibsource = "ftpþ¬+
@Article{Knuth:1963:LEE,
author = "Donald E. Knuth",
title = "Letter to the {Editor}: {Evaluation} of polynomials by
computer",
j”7¨o
@Article{Kobbelt:1994:FDP,
author = "L. Kobbelt",
title = "A Fast DotProduct Algorithm with Minimal Rounding
Errors",
journal = jCOMPUTING,
volume = "52",
number = "4",
pages = "355369",
year = "1994",
CODEN = "CMPTA2",
ISSN = "0010485X (print), 14365057 (electronic)",
ISSNL = "0010485X",
MRclass = "68Q20 (68Q25)",
MRnumber = "1 287 970",
bibdate = "T.ž)
@Article{Kobayashi:2000:HBF,
author = "Shiro Kobayashi and Gerhard P. Fettweis",
title = "A Hierarchical BlockFloatingPoint Arithmetic",
journal = jJVLSISIGNALPROC,
volume = "24",
number = "1",
pages = "1930",
month = feb,
year = "2000",
CODEN = "JVSPED",
DOI = "http://dx.doi.org/10.1023/A:1008110410087",
ISSN = "09225773",
ISSNL = "09225773",
bibdate = "Fri~Œ'˜O
@Article{Ko:2004:CCF,
author = "Sangho Ko and Robert R. Bitmead",
title = "Covariance calculation for floatingpoint statespace
realizations",
journal = jIEEETRANSSIGPROC,
volume = "52",
number = "12",
pages = "33703377",
month = dec,
year = "2004",
CODEN = "ITPRED",
ISSN = "1053587X (print), 19410476 (electronic)",
ISSNL = "1053587X",
MRclass = "93B15Ã…w‹o
@Article{Knuth:1988:FM,
author = "Donald E. Knuth",
title = "{Fibonacci} multiplication",
journal = jAPPLMATHLETT,
volume = "1",
number = "1",
pages = "5760",
year = "1988",
CODEN = "AMLEEL",
ISSN = "08939659 (print), 18735452 (electronic)",
ISSNL = "08939659",
MRclass = "11B39",
MRnumber = "89f:11031",
MRreviewer = "W. Herget",
bibdate = "Fri Mar 22 18:03:29 MST 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
MathSciNet database",
acknowledgement = acknhfb,
fjournal = "Applied Mathematics Letters",
journalURL = "http://www.sciencedirect.com/science/journal/08939659",
}""19181963",
historicalnote = "From
http://www.lib.iastate.edu/arch/rgrp/5211.html:
``John Vincent Atanasoff received his M.S. (1926) in
Mathematics from Iowa State College (University) and
received his Ph.D. (1930) in Theoretical Physics from
the University of WisconsinMadison. He returned to
Iowa State in 1930 as Assistant Professor in
mathematics and physics and was promoted to Associate
Professor (1936). Atanasoff began developing concepts
for an electronic computing machine in 1937. It was
shortly thereafter that he, along with graduate student
Clifford Berry, started work on the world's first
electronic digital computer. The computer would later
be named the AtanasoffBerry Computer (ABC).
Work on the machine stopped at the start of World War
II in 1941 and the ABC was never patented. Atanasoff
and Berry were both called to support the war effort
and left Iowa State. By the end of the decade, the ABC
was removed from the basement of Physics Hall and
dismantled.
Atanasoff and the ABC were part of a major court case
between Honeywell, Inc. and Sperry Rand Corporation
which occurred 19671973. The case involved the ENIAC
patent which covered basic ownership rights to the
design of electronic digital computers. During the
trial, the judge concluded that the invention of the
ENIAC was derived from the work of John Vincent
Atanasoff at Iowa State University.
A replica of the AtanasoffBerry Computer was completed
and unveiled to the public in 1996. The ABC replica was
constructed by a team of Iowa State scientists at the
Ames Laboratory and was exhibited at museums throughout
the country over the next several years.''",
remark = "This thesis may be one of the earliest surviving
records of the ABC computer built by John Atanasoff and
Clifford Berry in the late 1930s. The oneofakind ABC
was destroyed in 1948, and most of its parts were lost.
Also cited in ``Charles W. Bradley Collection on the
ENIAC Trial, 19301966'', (found in
http://discover.lib.umn.edu/): CWB as an attorney for
the group retained by Honeywell in the Honeywell v.
Sperry Rand ENIAC trial. The ABC had a 50bit word.",
}&neofakind ABC was destroyed in 1948, and most of its parts were lost. Also cited in ``Charles W. Bradley Collection on the ENIAC Trial, 19301966'', (found in http://discover.lib.umn.edu/): CWB as an attorney for the group retained by Honeywell in the Honeywell v. Sperry Rand ENIAC trial. The ABC had a 50bit word.acknhfb19181963Clifford Edward BerryDesign of electrical data recording and reading mechanism
@MastersThesis{Berry:1941:DED,
author = "Clifford Edward Berry",
title = "Design of electrical data recording and reading
mechanism",
type = "{M.S.} thesis",
school = "Iowa State College",
address = "Ames, IA, USA",
pages = "32",
year = "1941",
bibdate = "Thu Nov 18 11:18:18 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
authordates = "19181963",
historicalnote = "From
http://www.lib.iastate.edu/arch/rgrp/5211.html:
``John Vincent Atanasoff received his M.S. (1926) in
Mathematics from Iowa State College (University) and
received his Ph.D. (1930) in Theoretical Physics from
the University of WisconsinMadison. He returned to
Iowa State in 1930 as Assistant Professor in
mathematics and physics and was promoted to Associate
Professor (1936). Atanasoff began developing concepts
for an electronic computing machine in 1937. It was
shortly thereafter that he, along with graduate student
Clifford Berry, started work on the world's first
electronic digital computer. The computer would later
be named the AtanasoffBerry Computer (ABC).
Work on the machine stopped at the start of World War
II in 1941 and the ABC was never patented. Atanasoff
and Berry were both called to support the war effort
and left Iowa State. By the end of the decade, the ABC
was removed from the basement of Physics Hall and
dismantled.
Atanasoff and the ABC were part of a major court case
between Honeywell, Inc. and Sperry Rand Corporation
which occurred 19671973. The case involved the ENIAC
patent which covered basic ownership rights to the
design of electronic digital computers. During the
trial, the judge concluded that the invention of the
ENIAC was derived from the work of John Vincent
Atanasoff at Iowa State University.
A replica of the AtanasoffBerry Computer was completed
and unveiled to the public in 1996. The ABC replica was
constructed by a team of Iowa State scientists at the
Ames Laboratory and was exhibited at museums throughout
the country over the next several years.''",
remark = "This thesis may be one of the earliest surviving
records of the ABC computer built by John Atanasoff and
Clifford Berry in the late 1930s. The oneofakind ABC
was destroyed in 1948, and most of its parts were lost.
Also cited in ``Charles W. Bradley Collection on the
ENIAC Trial, 19301966'', (found in
http://discover.lib.umn.edu/): CWB as an attorney for
the group retained by Honeywell in the Honeywell v.
Sperry Rand ENIAC trial. The ABC had a 50bit word.",
}
: W¡:ˆd)X!#/k +m_kg ˆQtechreportfparith.bibRajchman:1942:REPJ. A. Rajchman and G. A. Morton and A. W. VanceReport on Electronic Predictors for AntiAircraft Fire ControlResearch Laboratories, R. C. A. Manufacturing Company, Inc.Camden, NJ, USA112115apr41942http://www.math.utah.edu/pub/tex/bib/fparith.bibReprinted in cite [ 7.4]Randell:1982:ODC.acknhfbJ. A. Rajchman and G. A. Morton and A. W. VanceReprinted in \cite[\S 7.4]{Randell:1982:ODC}.Report on Electronic Predictors for AntiAircraft Fire Control
@TechReport{Rajchman:1942:REP,
author = "J. A. Rajchman and G. A. Morton and A. W. Vance",
title = "Report on Electronic Predictors for AntiAircraft Fire
Control",
institution = "Research Laboratories, R. C. A. Manufacturing Company,
Inc.",
address = "Camden, NJ, USA",
month = apr,
year = "1942",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 7.4]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
}‰3(V !#'K7=m;_'g‰]techreportfparith.bibMauchly:1942:UHSJ. W. MauchlyThe use of high speed vacuum tube devices for calculatingPrivately circulated memorandumMoore School of Electrical Engineering, University of PennsylvaniaPhiladelphia, PA, USA112115aug81942Wed Oct 13 11:52:54 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:52:54 ???Reprinted in cite [ 7.6]Randell:1982:ODC.acknhfbJ. W. MauchlyReprinted in \cite[\S 7.6]{Randell:1982:ODC}.The use of high speed vacuum tube devices for calculating
@TechReport{Mauchly:1942:UHS,
author = "J. W. Mauchly",
title = "The use of high speed vacuum tube devices for
calculating",
type = "Privately circulated memorandum",
institution = "Moore School of Electrical Engineering, University of
Pennsylvania",
address = "Philadelphia, PA, USA",
month = aug,
year = "1942",
bibdate = "Wed Oct 13 11:52:54 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 7.6]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
}&'W #1/i/57Eƒ;SkW/iŽ]articlefparith.bibLancaster:1942:MMEOtis E. LancasterMachine Method for the Extraction of Cube RootjJAMSTATASSOC37217112115mar31942JSTNAL01621459 (print), 1537274X (electronic) OR 01621459 (print), 1537274X (electronic)01621459 OR 01621459Wed Jan 25 08:05:24 MST 2012http://www.jstor.org/journals/01621459.html; http://www.jstor.org/stable/i314096; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/jamstatassoc1940.bib2012.01.25 08:05:24 MSThttp://www.jstor.org/stable/2279437Journal of the American Statistical Associationacknhfbhttp://www.tandfonline.com/loi/uasa20Otis E. LancasterMachine Method for the Extraction of Cube Root
@Article{Lancaster:1942:MME,
author = "Otis E. Lancaster",
title = "Machine Method for the Extraction of Cube Root",
journal = jJAMSTATASSOC,
volume = "37",
number = "217",
pages = "112115",
month = mar,
year = "1942",
CODEN = "JSTNAL",
ISSN = "01621459 (print), 1537274X (electronic)",
ISSNL = "01621459",
bibdate = "Wed Jan 25 08:05:24 MST 2012",
bibsource = "http://www.jstor.org/journals/01621459.html;
http://www.jstor.org/stable/i314096;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/jamstatassoc1940.bib",
URL = "http://www.jstor.org/stable/2279437",
acknowledgement = acknhfb,
fjournal = "Journal of the American Statistical Association",
journalURL = "http://www.tandfonline.com/loi/uasa20",
}
0
’0”_+Y#/IuQ57=m;
„ysW„yIu”?articlefparith.bibGoudsmit:1944:SFNS. A. Goudsmit and W. H. FurrySignificant Figures of Numbers in Statistical TablesjNATURE154392180080123dec121944NATUAShttp://dx.doi.org/10.1038/154800a000280836 (print), 14764687 (electronic) OR 00280836 (print), 14764687 (electronic)00280836 OR 00280836Sun Sep 18 11:57:19 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib2011.09.18 11:57:19 ???http://www.nature.com/nature/journal/v154/n3921/pdf/154800a0.pdfA rough qualitative explanation of this fact can easily be given. If we consider tables in which the entries become rarer the larger they are, we can draw the obvious conclusion that in any interval, say, between 10 and 99, or 10,000 and 99,999, there are more entries on the small side than on the large side.NatureBenford's Law; Law of Anomalous Numbers; Zipf's Lawacknhfbhttp://www.nature.com/nature/archive/A rough qualitative explanation of this fact can easily be given. If we consider tables in which the entries become rarer the larger they are, we can draw the obvious conclusion that in any interval, say, between 10 and 99, or 10,000 and 99,999, there are more entries on the small side than on the large side.S. A. Goudsmit and W. H. FurrySignificant Figures of Numbers in Statistical Tables
@Article{Goudsmit:1944:SFN,
author = "S. A. Goudsmit and W. H. Furry",
title = "Significant Figures of Numbers in Statistical Tables",
journal = jNATURE,
volume = "154",
number = "3921",
pages = "800801",
day = "23",
month = dec,
year = "1944",
CODEN = "NATUAS",
DOI = "http://dx.doi.org/10.1038/154800a0",
ISSN = "00280836 (print), 14764687 (electronic)",
ISSNL = "00280836",
bibdate = "Sun Sep 18 11:57:19 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.nature.com/nature/journal/v154/n3921/pdf/154800a0.pdf",
abstract = "A rough qualitative explanation of this fact can
easily be given. If we consider tables in which the
entries become rarer the larger they are, we can draw
the obvious conclusion that in any interval, say,
between 10 and 99, or 10,000 and 99,999, there are more
entries on the small side than on the large side.",
acknowledgement = acknhfb,
fjournal = "Nature",
journalURL = "http://www.nature.com/nature/archive/",
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
}Šk*Y #//357E
;G/‹marticlefparith.bibCrawford:1943:DNSW. S. H. CrawfordDiscussions and Notes: Square Roots from a Table of CosinesjAMERMATHMONTHLY503190191mar31943AMMYAE00029890 (print), 19300972 (electronic) OR 00029890 (print), 19300972 (electronic)00029890 OR 00029890Mon Jun 28 12:36:57 MDT 1999http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1999.06.28 12:36:57 MDTAmerican Mathematical Monthlyacknhfbhttp://www.jstor.org/page/journal/amermathmont/about.htmlW. S. H. CrawfordDiscussions and Notes: Square Roots from a Table of Cosines
@Article{Crawford:1943:DNS,
author = "W. S. H. Crawford",
title = "Discussions and Notes: Square Roots from a Table of
Cosines",
journal = jAMERMATHMONTHLY,
volume = "50",
number = "3",
pages = "190191",
month = mar,
year = "1943",
CODEN = "AMMYAE",
ISSN = "00029890 (print), 19300972 (electronic)",
ISSNL = "00029890",
bibdate = "Mon Jun 28 12:36:57 MDT 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "American Mathematical Monthly",
journalURL = "http://www.jstor.org/page/journal/amermathmont/about.html",
} "00280836",
bibdate = "Sun Sep 18 11:57:19 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.nature.com/nature/journal/v154/n3921/pdf/154800a0.pdf",
abstract = "A rough qualitative explanation of this fact can
easily be given. If we consider tables in which the
entries become rarer the larger they are, we can draw
the obvious conclusion that in any interval, say,
between 10 and 99, or 10,000 and 99,999, there are more
entries on the small side than on the large side.",
acknowledgement = acknhfb,
fjournal = "Nature",
journalURL = "http://www.nature.com/nature/archive/",
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
}+
B ŒBŽGW !#3UA=‚ ;_‚ugY‘utechreportfparith.bibvonNeumann:1945:FDRJohn von NeumannFirst Draft of a Report on the EDVACUniversity of Pennsylvania525330jun61945Mon Jun 06 19:17:03 2005ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/alife.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.06.06 19:17:03 ???Reprinted in cite [ 8.2]Randell:1982:ODC.This is the report that got von Neumann's name associated with the serial, storedprogram, general purpose, digital architecture upon which 99.99% of all computers today are based.acknhfbJohn von NeumannReprinted in \cite[\S 8.2]{Randell:1982:ODC}.First Draft of a Report on the {EDVAC}
@TechReport{vonNeumann:1945:FDR,
author = "John von Neumann",
title = "First Draft of a Report on the {EDVAC}",
institution = "University of Pennsylvania",
day = "30",
month = jun,
year = "1945",
bibdate = "Mon Jun 06 19:17:03 2005",
bibsource = "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/alife.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 8.2]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
remark = "This is the report that got von Neumann's name
associated with the serial, storedprogram, general
purpose, digital architecture upon which 99.99\% of all
computers today are based.",
xxnote = "Report prepared for U.S. Army Ordinance Department
under Contract W670ORD4926. Reprinted in
\cite[pp.~177246]{Stern:1981:EUA},
\cite[pp.~399413]{Randell:1982:ODC},
\cite{vonNeumann:1993:FDR}, and
\cite{Laplante:1996:GPC}.",
}Œq,Y#)GQ57=m;
sWGŽ'articlefparith.bibFurry:1945:DNDW. H. Furry and Henry HurwitzDistribution of Numbers and Distribution of Significant FiguresjNATURE155525313jan11945NATUAShttp://dx.doi.org/10.1038/155052a000280836 (print), 14764687 (electronic) OR 00280836 (print), 14764687 (electronic)00280836 OR 00280836Sun Sep 18 11:51:37 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib2011.09.18 11:51:37 ???http://www.nature.com/nature/journal/v155/n3924/pdf/155052a0.pdfNatureBenford's Law; Law of Anomalous Numbers; Zipf's Lawacknhfbhttp://www.nature.com/nature/archive/W. H. Furry and Henry HurwitzDistribution of Numbers and Distribution of Significant Figures
@Article{Furry:1945:DND,
author = "W. H. Furry and Henry Hurwitz",
title = "Distribution of Numbers and Distribution of
Significant Figures",
journal = jNATURE,
volume = "155",
number = "??",
pages = "5253",
day = "13",
month = jan,
year = "1945",
CODEN = "NATUAS",
DOI = "http://dx.doi.org/10.1038/155052a0",
ISSN = "00280836 (print), 14764687 (electronic)",
ISSNL = "00280836",
bibdate = "Sun Sep 18 11:51:37 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.nature.com/nature/journal/v155/n3924/pdf/155052a0.pdf",
acknowledgement = acknhfb,
fjournal = "Nature",
journalURL = "http://www.nature.com/nature/archive/",
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
}n \cite[\S 8.2]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
remark = "This is the report that got von Neumann's name
associated with the serial, storedprogram, general
purpose, digital architecture upon which 99.99\% of all
computers today are based.",
xxnote = "Report prepared for U.S. Army Ordinance Department
under Contract W670ORD4926. Reprinted in
\cite[pp.~177246]{Stern:1981:EUA},
\cite[pp.~399413]{Randell:1982:ODC},
\cite{vonNeumann:1993:FDR}, and
\cite{Laplante:1996:GPC}.",
}
xix‡n0U #+!917=m;_=!g9ˆ[articlefparith.bibCesareo:1946:RIO. CesareoThe Relay InterpolatorjBELLLABSRECORD234574601946BLRCAB00058564 OR 00058564Wed Oct 13 11:31:47 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:31:47 ???Reprinted in cite [ 6.2]Randell:1982:ODC.Bell Laboratories RecordacknhfbO. CesareoReprinted in \cite[\S 6.2]{Randell:1982:ODC}.The Relay Interpolator
@Article{Cesareo:1946:RI,
author = "O. Cesareo",
title = "The Relay Interpolator",
journal = jBELLLABSRECORD,
volume = "23",
number = "??",
pages = "457460",
year = "1946",
CODEN = "BLRCAB",
ISSN = "00058564",
bibdate = "Wed Oct 13 11:31:47 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 6.2]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
fjournal = "Bell Laboratories Record",
}«/]!#)13;=„q;‚Y•U‚i1®]techreportfparith.bibBurks:1946:PDLArthur W. Burks and Herman H. Goldstine and John von NeumannPreliminary discussion of the logical design of an electronic computing instrumentinstINSTADVSTUDYinstINSTADVSTUDY:adr4228jun61946Wed Oct 13 08:17:48 2004ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/computer.arithmetic.bib; ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/fparith.bib; ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/arith.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2004.10.13 08:17:48 ???Report to the U.S. Army Ordnance Department. Reprinted in cite [pp.~221259]Swartzlander:1976:CDD, cite [ 8.3]Randell:1982:ODC, and cite [pp.~97146]Aspray:1987:PJNDiscusses floatingpoint versus fixedpoint computation, and concludes that floatingpoint is probably not justifiable. They wrote:par ``There appear to be two major purposes in a `floating' decimal point system both of which arise from the fact that the number of digits in a word is a constant fixed by design considerations for each particular machine. The first of these purposes is to retain in a sum or product as many significant digits as possible and the second of these is to free the human operator from the burden of estimating and inserting into a problem `scale factors'  multipl5‰m.V#)Ee%E7=m;_EgiŠAarticlefparith.bibAiken:1946:ASCH. H. Aiken and G. M. HopperThe Automatic Sequence Controlled CalculatorjELECTRENG65384391, 449454, 5225281946ELENAC00959197 OR 00959197Wed Oct 13 11:26:29 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:26:29 ???Reprinted in cite [ 5.2]Randell:1982:ODC.Electrical Engineering (American Institute of Electrical Engineers)acknhfbH. H. Aiken and G. M. HopperReprinted in \cite[\S 5.2]{Randell:1982:ODC}.The {Automatic Sequence Controlled Calculator}
@Article{Aiken:1946:ASC,
author = "H. H. Aiken and G. M. Hopper",
title = "The {Automatic Sequence Controlled Calculator}",
journal = jELECTRENG,
volume = "65",
number = "??",
pages = "384391, 449454, 522528",
year = "1946",
CODEN = "ELENAC",
ISSN = "00959197",
bibdate = "Wed Oct 13 11:26:29 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 5.2]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
fjournal = "Electrical Engineering (American Institute of
Electrical Engineers)",
}p://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/computer.arithmetic.bib;
ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/fparith.bib;
ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/arith.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Report to the U.S. Army Ordnance Department. Reprinted
in \cite[pp.~221259]{Swartzlander:1976:CDD}, \cite[\S
8.3]{Randell:1982:ODC}, and
\cite[pp.~97146]{Aspray:1987:PJN}",
acknowledgement = acknhfb,
remark = "Discusses floatingpoint versus fixedpoint
computation, and concludes that floatingpoint is
probably not justifiable. They wrote:\par
``There appear to be two major purposes in a `floating'
decimal point system both of which arise from the fact
that the number of digits in a word is a constant fixed
by design considerations for each particular machine.
The first of these purposes is to retain in a sum or
product as many significant digits as possible and the
second of these is to free the human operator from the
burden of estimating and inserting into a problem
`scale factors'  multiplicative constants which
serve to keep numbers within the limits of the
machine.\par
There is, of course, no denying the fact that human
time is consumed in arranging for the introduction of
suitable scale factors. We only argue that the time so
consumed is a very small percentage of the total time
we will spend in preparing an interesting problem for
our machine. The first advantage of the floating point
is, we feel, somewhat illusory. In order to have such a
floating point, one must waste memory capacity which
could otherwise be used for carrying more digits per
word. It would therefore seem to us not at all clear
whether the modest advantages of a floating binary
point offset the loss of memory capacity and the
increased complexity of the arithmetic and control
circuits.''",
}/icative constants which serve to keep numbers within the limits of the machine.par There is, of course, no denying the fact that human time is consumed in arranging for the introduction of suitable scale factors. We only argue that the time so consumed is a very small percentage of the total time we will spend in preparing an interesting problem for our machine. The first advantage of the floating point is, we feel, somewhat illusory. In order to have such a floating point, one must waste memory capacity which could otherwise be used for carrying more digits per word. It would therefore seem to us not at all clear whether the modest advantages of a floating binary point offset the loss of memory capacity and the increased complexity of the arithmetic and control circuits.''acknhfbArthur W. Burks and Herman H. Goldstine and John von NeumannReport to the U.S. Army Ordnance Department. Reprinted in \cite[pp.~221259]{Swartzlander:1976:CDD}, \cite[\S 8.3]{Randell:1982:ODC}, and \cite[pp.~97146]{Aspray:1987:PJN}Preliminary discussion of the logical design of an electronic computing instrument
@TechReport{Burks:1946:PDL,
author = "Arthur W. Burks and Herman H. Goldstine and John von
Neumann",
title = "Preliminary discussion of the logical design of an
electronic computing instrument",
institution = instINSTADVSTUDY,
address = instINSTADVSTUDY:adr,
pages = "42",
day = "28",
month = jun,
year = "1946",
bibdate = "Wed Oct 13 08:17:48 2004",
bibsource = "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/computer.arithmetic.bib;
ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/fparith.bib;
ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/arith.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Report to the U.S. Army Ordnance Department. Reprinted
in \cite[pp.~221259]{Swartzlander:1976:CDD}, \cite[\S
8.3]{Randell:1982:ODC}, and
\cite[pp.~97146]{Aspray:1987:PJN}",
acknowledgement = acknhfb,
remark = "Discusses floatingpoint versus fixedpoint
computation, and concludes that floatingpoint is
probably not justifiable. They wrote:\par
``There appear to be two major purposes in a `floating'
decimal point system both of which arise from the fact
that the number of digits in a word is a constant fixed
by design considerations for each particular machine.
The first of these purposes is to retain in a sum or
product as many significant digits as possible and the
second of these is to free the human operator from the
burden of estimating and inserting into a problem
`scale factors'  multiplicative constants which
serve to keep numbers within the limits of the
machine.\par
There is, of course, no denying the fact that human
time is consumed in arranging for the introduction of
suitable scale factors. We only argue that the time so
consumed is a very small percentage of the total time
we will spend in preparing an interesting problem for
our machine. The first advantage of the floating point
is, we feel, somewhat illusory. In order to have such a
floating point, one must waste memory capacity which
could otherwise be used for carrying more digits per
word. It would therefore seem to us not at all clear
whether the modest advantages of a floating binary
point offset the loss of memory capacity and the
increased complexity of the arithmetic and control
circuits.''",
}
ºð ‡˜©ºÂVŸ
@InProceedings{Brisebarre:2007:FPA,
author = "Nicolas Brisebarre and Guillaume Hanrot",
title = "Floatingpoint {$ L^2 $}approximations to functions",
crossref = "Kornerup:2007:PIS",
pages = "177186",
year = "2007",
DOI = "http://dx.doi.org/10.1109/ARITH.2007.38",
bibdate = "Tue Oct 9 17:16:03 MDT 2007",
bibsource = "http://ieeexplore.ieee.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
ˆ,Y
@InProceedings{Brisebarre:2007:EPA,
author = "Nicolas Brisebarre and Sylvain Chevillard",
title = "Efficient polynomial {$L$}approximations",
crossref = "Kornerup:2007:PIS",
pages = "169176",
year = "2007",
DOI = "http://dx.doi.org/10.1109/ARITH.2007.17",
bibdate = "Tue Oct 9 17:16:03 MDT 2007",
bibsource = "http://ieeexplore.ieee.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstrac‰,’Y
@InProceedings{Brisebarre:2005:CRM,
author = "Nicolas Brisebarre and JeanMichel Muller",
title = "Correctly Rounded Multiplication by Arbitrary
Precision Constants",
crossref = "Montuschi:2005:PIS",
pages = "????",
year = "2005",
bibdate = "Wed Jun 22 07:02:55 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://arith17.polito.it/final/paper122.pdf",
abstract = \… Š
@InProceedings{Briggs:1993:XBM,
author = "W. S. Briggs and D. W. Matula",
title = "A $ 17 \times 69 $ Bit Multiply and Add Unit with
Redundant Binary Feedback and Single Cycle Latency",
crossref = "Swartzlander:1993:SCA",
pages = "163170",
year = "1993",
bibdate = "Thu Jun 20 10:16:11 2002",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.acsellab.com/arithmetic/arith11/papers/ARITH11_Briggs.pdf",
acknowledgement = acknj,
keywords = "ARITH11",
}&š9
@InProceedings{Bridge:1981:AAA,
author = "Carol L. Bridge and P. David Fisher and Robert G.
Reynolds",
title = "Asynchronous Arithmetic Algorithms for DataDriven
Machines",
crossref = "IEEE:1981:PSC",
pages = "5662",
year = "1981",
bibdate = "Wed Nov 14 17:53:26 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.acsellab.com/arithmetic/arith’‘¢%
@InProceedings{Brent:1999:CAP,
author = "Richard P. Brent",
title = "Computer Arithmetic  a Programmer's Perspective",
crossref = "Koren:1999:ISC",
pages = "22",
year = "1999",
bibdate = "Wed Jan 20 09:38:39 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://euler.ecs.umass.edu/paper/final/brentr.pdf;
http://euler.ecs.umass.edu/paper/final/brentr.ps;
K†Œ
@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 = "118125",
year = "1985",
bibdate = "Wed Nov 14 18:06:21 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.acsellab.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 = acknhfb,
keywords = "ARITH7",
}†
!Ã!‹2W#1S}K7E
;_o=SgŒarticlefparith.bibGoldstine:1946:ENIH. H. Goldstine and Adele GoldstineThe Electronic Numerical Integrator and Computer (ENIAC)jMATHTABLESOTHERAIDSCOMPUT21597110jul71946MTTCAS08916837 OR 08916837Tue Oct 13 08:44:19 MDT 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.13 08:44:19 MDTReprinted in cite [ 7.7]Randell:1982:ODC.Mathematical Tables and Other Aids to Computationacknhfbhttp://www.ams.org/mcom/H. H. Goldstine and Adele GoldstineReprinted in \cite[\S 7.7]{Randell:1982:ODC}.The {Electronic Numerical Integrator and Computer (ENIAC)}
@Article{Goldstine:1946:ENI,
author = "H. H. Goldstine and Adele Goldstine",
title = "The {Electronic Numerical Integrator and Computer
(ENIAC)}",
journal = jMATHTABLESOTHERAIDSCOMPUT,
volume = "2",
number = "15",
pages = "97110",
month = jul,
year = "1946",
CODEN = "MTTCAS",
ISSN = "08916837",
bibdate = "Tue Oct 13 08:44:19 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
note = "Reprinted in \cite[\S 7.7]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
fjournal = "Mathematical Tables and Other Aids to Computation",
journalURL = "http://www.ams.org/mcom/",
}Ž:1Y!#+Cƒ;=m;'C/ƒŽ#techreportfparith.bibDreyer:1946:REMH.J. Dreyer and A. WaltherDer Rechenautomat Ipm. Entwicklung Mathematischer Instrumente in Deutschland 1939 bis 1945. (German) [The Ipm Calculator. The development of mathematical instruments in Germany 19391945]BerichtA3Institut fur Praktische Mathematik, Technische HochschuleDarmstadt, West Germany45746019aug81946Wed Oct 13 11:20:15 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:20:15 ???Reprinted in cite [ 3.3]Randell:1982:ODC. Translated by Mr. and Mrs. P. JonesGermanacknhfbH.J. Dreyer and A. WaltherReprinted in \cite[\S 3.3]{Randell:1982:ODC}. Translated by Mr. and Mrs. P. Jones{Der Rechenautomat Ipm. Entwicklung Mathematischer Instrumente in Deutschland 1939 bis 1945}. ({German}) [{The} {Ipm} Calculator. {The} development of mathematical instruments in {Germany} 19391945]
@TechReport{Dreyer:1946:REM,
author = "H.J. Dreyer and A. Walther",
title = "{Der Rechenautomat Ipm. Entwicklung Mathematischer
Instrumente in Deutschland 1939 bis 1945}. ({German})
[{The} {Ipm} Calculator. {The} development of
mathematical instruments in {Germany} 19391945]",
type = "{Bericht}",
number = "A3",
institution = "Institut f{\"u}r Praktische Mathematik, Technische
Hochschule",
address = "Darmstadt, West Germany",
day = "19",
month = aug,
year = "1946",
bibdate = "Wed Oct 13 11:20:15 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 3.3]{Randell:1982:ODC}.
Translated by Mr. and Mrs. P. Jones",
acknowledgement = acknhfb,
language = "German",
}
ú‡\4U #'917=m;_=g9ˆKarticlefparith.bibJuley:1947:BCJ. JuleyThe Ballistic ComputerjBELLLABSRECORD24591947BLRCAB00058564 OR 00058564Wed Oct 13 11:32:38 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:32:38 ???Reprinted in cite [ 6.3]Randell:1982:ODC.Bell Laboratories RecordacknhfbJ. JuleyReprinted in \cite[\S 6.3]{Randell:1982:ODC}.The Ballistic Computer
@Article{Juley:1947:BC,
author = "J. Juley",
title = "The Ballistic Computer",
journal = jBELLLABSRECORD,
volume = "24",
number = "??",
pages = "59",
year = "1947",
CODEN = "BLRCAB",
ISSN = "00058564",
bibdate = "Wed Oct 13 11:32:38 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 6.3]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
fjournal = "Bell Laboratories Record",
}3Y!#1]3;=m;„;]„Ctechreportfparith.bibGoldstine:1947:PCPHerman H. Goldstine and John von NeumannPlanning and coding of problems for an electronic computing instrumentTechnical report1instINSTADVSTUDYinstINSTADVSTUDY:adr691apr41947Wed Jun 01 17:41:33 2005http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.06.01 17:41:33 ???Report prepared for U.S. Army Ordnance Department under contract W36034OKD7481. Reprinted in cite [80151]Taub:1963:JNCa. Knuth cite [p.~278]Knuth:1997:SA cites pp.~142151 of this report as the first published treatment of doubleprecision arithmetic on digital computers.acknhfbHerman H. Goldstine and John von NeumannReport prepared for U.S. Army Ordnance Department under contract W36034OKD7481. Reprinted in \cite[80151]{Taub:1963:JNCa}. Knuth \cite[p.~278]{Knuth:1997:SA} cites pp.~142151 of this report as the first published treatment of doubleprecision arithmetic on digital computers.Planning and coding of problems for an electronic computing instrument
@TechReport{Goldstine:1947:PCP,
author = "Herman H. Goldstine and John von Neumann",
title = "Planning and coding of problems for an electronic
computing instrument",
type = "Technical report",
number = "1",
institution = instINSTADVSTUDY,
address = instINSTADVSTUDY:adr,
pages = "69",
day = "1",
month = apr,
year = "1947",
bibdate = "Wed Jun 01 17:41:33 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Report prepared for U.S. Army Ordnance Department
under contract W36034OKD7481. Reprinted in
\cite[80151]{Taub:1963:JNCa}. Knuth
\cite[p.~278]{Knuth:1997:SA} cites pp.~142151 of this
report as the first published treatment of
doubleprecision arithmetic on digital computers.",
acknowledgement = acknhfb,
}
}Ó±ÂÓ"
Œ/˜_
@Article{Sasaki:1968:BIA,
author = "A. Sasaki",
title = "The Basis for Implementation of Additive Operations in
the Residue Number System",
journal = jIEEETRANSCOMPUT,
volume = "C17",
number = "11",
pages = "10661073",
month = nov,
year = "1968",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/PGEC.1967.264810;
http://dx.doi.org/10.1109/TC.1968.226466¯‹B—
@Article{Sasaki:1967:ASR,
author = "Akio Sasaki",
title = "Addition and Subtraction in the Residue Number
System",
journal = jIEEETRANSELECCOMPUT,
volume = "EC16",
number = "2",
pages = "157164",
month = apr,
year = "1967",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1967.264811",
ISSN = "03677508",
bibdate = "Wed Jul 13 21:15:01 MDT 2011",–‡J
@Article{Sarafyan:1960:DCS,
author = "Diran Sarafyan",
title = "Divisionless computation of square roots through
continued squaring",
journal = jCACM,
volume = "3",
number = "5",
pages = "319321",
month = may,
year = "1960",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "65.00",
MRnumber = "22\#8639",
bibdate = "Fri Nov 25 18:19:26 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "$\sqrt(x)$; elementary functions",
ZMreviewer = "M. Lotkin",
}©‡u
@Article{Sarafyan:1959:NMC,
author = "Diran Sarafyan",
title = "A New Method of Computation of Square Roots Without
Using Division",
journal = jCACM,
volume = "2",
number = "11",
pages = "2324",
month = nov,
year = "1959",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317„ˆ9
@Article{Sasaki:1982:PFM,
author = "T. Sasaki and Y. Kanada",
title = "Practically Fast Multiple Precision Evaluation of
{LOG} ($ {X} $ )",
journal = jINFOPROC,
volume = "5",
number = "4",
pages = "247250",
month = "????",
year = "1982",
bibdate = "Thu Sep 8 08:20:54 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
}…
º
@Article{Sasaki:1982:EGE,
author = "T. Sasaki and H. Murao",
key = "Symbolic_determinant; Symbolic_linear_systems;
Gaussian_elimination",
title = "Efficient {Gaussian} elimination method for symbolic
determinants and linear systems",
journal = jTOMS,
volume = "8",
number = "3",
pages = "277289",
month = sep,
year = "1982",
CODEN = "ACMSCU",
DOI = d‰3’g
@Article{Sarkar:1971:EPP,
author = "B. P. Sarkar and E. V. Krishnamurthy",
title = "Economic Pseudodivision Processes for Obtaining Square
Root, Logarithm, and Arctan",
journal = jIEEETRANSCOMPUT,
volume = "C20",
number = "12",
pages = "15891593",
month = dec,
year = "1971",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1971.223178",
ISSN = "00189340 _
l ³lŒD6W #/)[57Eƒ;Qo)_Ž
articlefparith.bibRicheson:1947:FAPA. W. RichesonThe First Arithmetic Printed in EnglishjISIS37124756may51947ISISA400211753 (print), 15456994 (electronic) OR 00211753 (print), 15456994 (electronic)00211753 OR 00211753Tue Jul 30 21:27:09 MDT 2013http://www.jstor.org/action/showPublication?journalCode=isis; http://www.jstor.org/stable/i302230; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/isis1940.bib2013.07.30 21:27:09 MDThttp://www.jstor.org/stable/226161Isisacknhfbhttp://www.jstor.org/page/journal/isis/about.htmlA. W. RichesonThe First Arithmetic Printed in {English}
@Article{Richeson:1947:FAP,
author = "A. W. Richeson",
title = "The First Arithmetic Printed in {English}",
journal = jISIS,
volume = "37",
number = "12",
pages = "4756",
month = may,
year = "1947",
CODEN = "ISISA4",
ISSN = "00211753 (print), 15456994 (electronic)",
ISSNL = "00211753",
bibdate = "Tue Jul 30 21:27:09 MDT 2013",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/i302230;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/isis1940.bib",
URL = "http://www.jstor.org/stable/226161",
acknowledgement = acknhfb,
fjournal = "Isis",
journalURL = "http://www.jstor.org/page/journal/isis/about.html",
}ŒJ5Y '#'Ck=1=m;‚''G‚;o‹?inproceedingsfparith.bibMauchly:1947:PPEJ. W. MauchlyProceedings of a Symposium on Large Scale Digital Calculating Machinery, 710 January 1947Preparation of problems for EDVACtype machinesHarvard University PressCambridge, MA, USA591947Wed Oct 13 11:55:58 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:55:58 ???Reprinted in em Annals of the Computation Laboratory of Harvard University, bf 16, 203207 (1948). Reprinted in cite [ 8.2]Randell:1982:ODC.acknhfbJ. W. Mauchly{Proceedings of a Symposium on Large Scale Digital Calculating Machinery, 710 January 1947}Reprinted in {\em Annals of the Computation Laboratory of Harvard University}, {\bf 16}, 203207 (1948). Reprinted in \cite[\S 8.2]{Randell:1982:ODC}.Preparation of problems for {EDVAC}type machines
@InProceedings{Mauchly:1947:PPE,
author = "J. W. Mauchly",
booktitle = "{Proceedings of a Symposium on Large Scale Digital
Calculating Machinery, 710 January 1947}",
title = "Preparation of problems for {EDVAC}type machines",
publisher = "Harvard University Press",
address = "Cambridge, MA, USA",
year = "1947",
bibdate = "Wed Oct 13 11:55:58 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in {\em Annals of the Computation Laboratory
of Harvard University}, {\bf 16}, 203207 (1948).
Reprinted in \cite[\S 8.2]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
}
Äå
X
ðöˆ/
@Article{Ushio:1987:CRE,
author = "T. Ushio and C. Hsu",
title = "Chaotic rounding error in digital control systems",
journal = jIEEETRANSCIRCUITSSYST,
volume = "34",
number = "2",
pages = "133139",
month = feb,
year = "1987",
CODEN = "ICSYBT",
ISSN = "00984094 (print), 15581276 (electronic)",
ISSNL = "00984094",
bibdate = "Sat Jul 16 11:25:03 MDT 2005",
bibsource = lˆ)
@Article{Uya:1984:CFP,
author = "M. Uya and K. Kaneko and J. Yasui",
title = "A {CMOS} floating point multiplier",
journal = jIEEEJSOLIDSTATECIRCUITS,
volume = "19",
number = "5",
pages = "697702",
month = oct,
year = "1984",
CODEN = "IJSCBC",
ISSN = "00189200 (print), 1558173X (electronic)",
ISSNL = "00189200",
bibdate = "Sat Jul 16 08:40:53 MDT 2005",
bibsource = ƒ…]‹;
@Article{Ushijima:1977:SEP,
author = "Kazuo Ushijima",
title = "Step to an Efficient Program for Floatingpoint
Summation",
journal = jSPE,
volume = "7",
number = "6",
pages = "759769",
month = nov # "\slash " # dec,
year = "1977",
CODEN = "SPEXBL",
ISSN = "00380644 (print), 1097024X (electronic)",
ISSNL = "00380644",
bibdate = "Sat May 31 13:36:16 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "SoftwarePractice and Experience",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097024X",
}Î†*ŒU
@Article{Urabe:1973:CEA,
author = "Minoru Urabe",
title = "Componentwise error analysis of iterative methods
practiced on a floatingpoint system",
journal = jMEMFACSCIKYUSHUUNIVA,
volume = "27",
pages = "2364",
year = "1973",
CODEN = "MFKAAF",
ISSN = "03736385",
ISSNL = "03736385",
MRclass = "65H10",
MRnumber = "48 1457",
bibdate = "Fri Dec 8 08:24:14 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Memoirs of the Faculty of Science, Kyushu Imperial
University. Series A, Mathematics = Kyushu Teikoku
Daigaku Rigakubu kiyo",
reviewer = "D. C. Handscomb",
}É„f‰M
@Article{Usow:1970:CB,
author = "K. H. Usow",
title = "Certification Bibliography",
journal = jSIGNUM,
volume = "5",
number = "2",
pages = "1415",
month = mar,
year = "1970",
CODEN = "SNEWD6",
ISSN = "01635778 (print), 15580237 (electronic)",
ISSNL = "01635778",
bibdate = "Fri Aug 20 10:26:49 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "ACM SIGNUM Newsletter",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}…&ŠM
@Article{Usow:1969:SSC,
author = "Karl H. Usow",
title = "{SIGNUM} subroutine certification committee",
journal = jSIGNUM,
volume = "4",
number = "3",
pages = "1518",
month = oct,
year = "1969",
CODEN = "SNEWD6",
ISSN = "01635778 (print), 15580237 (electronic)",
ISSNL = "01635778",
bibdate = "Mon Mar 5 17:26:29 MST 2007",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "ACM SIGNUM Newsletter",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}Ú9,471b)",
MRreviewer = "E. Bodewig",
bibdate = "Thu Nov 8 14:49:36 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Goldstine:1951:NIM} for Part II. Reprinted
in \cite[v.~5, pp.~479557]{Taub:1961:JNC}.",
ZMnumber = "0031.31402",
acknowledgement = acknhfb # " and " # ackjg,
fjournal = "Bulletin of the American Mathematical Society",
kwds = "nla, linear system, rounding error",
referred = "[Markov1999a].",
remark = "This may be the first journal publication about the
use of doubleprecision arithmetic on computers, used
for the accumulation of inner products and matrix
products. On pp.~10351038, the authors show that when
the sum of $m$ products of two $s$digit numbers is
accumulated in precision $ 2 s $, with rounding to $s$
digits only after the final sum is complete, then the
rounding error is essentially one unit in the last
place, instead of $m$ times that value. Cited in
\cite{Sterbenz:1974:FPC}.",
}7
DD—97Y#3]g!!571!;m;Gg‡m!]Ogš3Oarticlefparith.bibvonNeumann:1947:NIMJohn von Neumann and Herman H. GoldstineNumerical Inverting of Matrices of High OrderjBULLAMS531110211099nov111947BAMOAD00029904 (print), 1936881X (electronic) OR 00029904 (print), 1936881X (electronic)00029904 OR 0002990465.0XMR0024235 (9,471b)E. BodewigThu Nov 8 14:49:36 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.11.08 14:49:36 ???See cite Goldstine:1951:NIM for Part II. Reprinted in cite [v.~5, pp.~479557]Taub:1961:JNC.Bulletin of the American Mathematical SocietyThis may be the first journal publication about the use of doubleprecision arithmetic on computers, used for the accumulation of inner products and matrix products. On pp.~10351038, the authors show that when the sum of $m$ products of two $s$digit numbers is accumulated in precision $ 2 s $, with rounding to $s$ digits only after the final sum is complete, then the rounding error is essentially one unit in the last place, instead of $m$ times that value. Cited in cite Sterbenz:1974:FPC.0031.31402acknhfbJohn von Neumann and Herman H. GoldstineSee \cite{Goldstine:1951:NIM} for Part II. Reprinted in \cite[v.~5, pp.~479557]{Taub:1961:JNC}.Numerical Inverting of Matrices of High Order
@Article{vonNeumann:1947:NIM,
author = "John von Neumann and Herman H. Goldstine",
title = "Numerical Inverting of Matrices of High Order",
journal = jBULLAMS,
volume = "53",
number = "11",
pages = "10211099",
month = nov,
year = "1947",
CODEN = "BAMOAD",
ISSN = "00029904 (print), 1936881X (electronic)",
ISSNL = "00029904",
MRclass = "65.0X",
MRnumber = "MR0024235 (9,471b)",
MRreviewer = "E. Bodewig",
bibdate = "Thu Nov 8 14:49:36 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Goldstine:1951:NIM} for Part II. Reprinted
in \cite[v.~5, pp.~479557]{Taub:1961:JNC}.",
ZMnumber = "0031.31402",
acknowledgement = acknhfb # " and " # ackjg,
fjournal = "Bulletin of the American Mathematical Society",
kwds = "nla, linear system, rounding error",
referred = "[Markov1999a].",
remark = "This may be the first journal publication about the
use of doubleprecision arithmetic on computers, used
for the accumulation of inner products and matrix
products. On pp.~10351038, the authors show that when
the sum of $m$ products of two $s$digit numbers is
accumulated in precision $ 2 s $, with rounding to $s$
digits only after the final sum is complete, then the
rounding error is essentially one unit in the last
place, instead of $m$ times that value. Cited in
\cite{Sterbenz:1974:FPC}.",
}
Q'i&Q…S‹'
@Article{Fiske:1988:RAP,
author = "S. Fiske and W. J. Dally",
title = "The reconfigurable arithmetic processor",
journal = jCOMPARCHNEWS,
volume = "16",
number = "2",
pages = "3036",
month = may,
year = "1988",
CODEN = "CANED2",
ISSN = "01635964 (print), 19435851 (electronic)",
ISSNL = "01635964",
bibdate = "Fri May 12 09:40:45 MDT 2006",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
ˆ
@Article{Fisher:1984:UAP,
author = "Gerry Fisher",
title = "Universal Arithmetic Packages",
journal = jSIGADALETTERS,
volume = "3",
number = "6",
pages = "3047",
month = may # "\slash " # jun,
year = "1984",
CODEN = "AALEE5",
DOI = "http://dx.doi.org/10.1145/998388.998389",
ISSN = "10943641 (print), 15579476 (electronic)",
ISSNL = "10943641",
bibdate = "Thu SepE†R%
@Article{Fischler:1962:TRA,
author = "M. A. Fischler and E. A. Poe",
title = "Threshold Realization of Arithmetic Circuits",
journal = jIRETRANSELECCOMPUT,
volume = "EC11",
number = "2",
pages = "287288",
month = apr,
year = "1962",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1962.5219366",
ISSN = "03679950",
bibdate = "Thu Jul 14 09:11:50 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219366",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}Ï‡<Žy
@Article{Fiore:1999:PMU,
author = "P. D. Fiore",
title = "Parallel multiplication using fast sorting networks",
journal = jIEEETRANSCOMPUT,
volume = "48",
number = "6",
pages = "640645",
month = jun,
year = "1999",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.773800",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Wed Jul 6 08:46:58 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=773800",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}¹‡W/
@Article{Filippi:1966:BEE,
author = "S. Filippi",
title = "{Die Berechnung einiger elementarer transzendenter
Funktionen mit Hilfe des RichardsonAlgorithmus}
\toenglish {The Computation of Some Elementary
Transcendental Functions by Means of the Richardson
Algorithm} \endtoenglish",
journal = jCOMPUTING,
volume = "1",
number = "??",
pages = "127132",
month = "????",
year = "1966",
CODEN = "CMPTA2",
ISSN = "0010485X (print), 14365057 (electronic)",
ISSNL = "0010485X",
bibdate = "Fri Sep 16 16:30:40 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Computing: Archiv f{\"u}r informatik und numerik",
journalURL = "http://link.springer.com/journal/607",
}Q
k
»°kˆB:V !#)'S7)1=‚Q;'S‰3techreportfparith.bibTukey:1948:NSRJohn W. TukeyA note on the squareroot iterationSRG Memorandum report10instPRINCETONinstPRINCETON:adr181948Tue May 15 08:00:09 2012http://www.math.utah.edu/pub/bibnet/authors/t/tukeyjohnw.bib; http://www.math.utah.edu/pub/tex/bib/elefunt.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2012.05.15 08:00:09 ???acknhfbJohn W. TukeyA note on the squareroot iteration
@TechReport{Tukey:1948:NSR,
author = "John W. Tukey",
title = "A note on the squareroot iteration",
type = "SRG Memorandum report",
number = "10",
institution = instPRINCETON,
address = instPRINCETON:adr,
pages = "18",
year = "1948",
bibdate = "Tue May 15 08:00:09 2012",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/t/tukeyjohnw.bib;
http://www.math.utah.edu/pub/tex/bib/elefunt.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}ˆ9U #)%?'7=m;_9%g?ˆ articlefparith.bibEckert:1948:ECW. J. EckertElectrons and computationjSCIMONTHLY675315323nov111948SCMOAA00963771 OR 00963771Wed Oct 13 11:27:40 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:27:40 ???Reprinted in cite [ 5.3]Randell:1982:ODC.The Scientific MonthlyacknhfbW. J. EckertReprinted in \cite[\S 5.3]{Randell:1982:ODC}.Electrons and computation
@Article{Eckert:1948:EC,
author = "W. J. Eckert",
title = "Electrons and computation",
journal = jSCIMONTHLY,
volume = "67",
number = "5",
pages = "315323",
month = nov,
year = "1948",
CODEN = "SCMOAA",
ISSN = "00963771",
bibdate = "Wed Oct 13 11:27:40 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 5.3]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
fjournal = "The Scientific Monthly",
}ŠB8V #'%uK7E
;_o=%g}‹U
articlefparith.bibAlt:1948:BTLaFranz L. AltA Bell Telephone Laboratories' Computing MachineIjMATHTABLESOTHERAIDSCOMPUT321113jan11948MTTCAS08916837 OR 08916837Tue Oct 13 08:44:19 MDT 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.13 08:44:19 MDTReprinted in cite [ 6.4]Randell:1982:ODC.Mathematical Tables and Other Aids to Computationacknhfbhttp://www.ams.org/mcom/Franz L. AltReprinted in \cite[\S 6.4]{Randell:1982:ODC}.A {Bell Telephone Laboratories}' Computing Machine{I}
@Article{Alt:1948:BTLa,
author = "Franz L. Alt",
title = "A {Bell Telephone Laboratories}' Computing
Machine{I}",
journal = jMATHTABLESOTHERAIDSCOMPUT,
volume = "3",
number = "21",
pages = "113",
month = jan,
year = "1948",
CODEN = "MTTCAS",
ISSN = "08916837",
bibdate = "Tue Oct 13 08:44:19 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
note = "Reprinted in \cite[\S 6.4]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
fjournal = "Mathematical Tables and Other Aids to Computation",
journalURL = "http://www.ams.org/mcom/",
} 2005",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/a/turingalanmathison.bib;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg2ed.bib;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite{Turing:1992:PM} with summary and
notes (including corrections)",
URL = "http://turing.ecs.soton.ac.uk/browse.php/B/18",
ZMnumber = "0033.28501",
acknowledgement = acknhfb,
fjournal = "Quarterly Journal of Mechanics and Applied
Mathematics",
mynote = "The notes are not very good. They mainly correct
errors and fill in the gaps of derivations. Much better
would have been higher level comments from a numerical
analyst, e.g. on where Turing's ideas/predictions were
wrong.",
};
™‰yW #+%
97=m;M%
ˆiarticlefparith.bibHuskey:1949:PCPH. D. HuskeyOn the Precision of a Certain Procedure of Numerical IntegrationjJRESNATLBURSTAND4257621949JRNBAG00910635 OR 00910635Fri Aug 20 09:32:34 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.08.20 09:32:34 ???Cited in cite Sterbenz:1974:FPC.acknhfbH. D. HuskeyOn the Precision of a Certain Procedure of Numerical Integration
@Article{Huskey:1949:PCP,
author = "H. D. Huskey",
title = "On the Precision of a Certain Procedure of Numerical
Integration",
journal = jJRESNATLBURSTAND,
volume = "42",
number = "??",
pages = "5762",
year = "1949",
CODEN = "JRNBAG",
ISSN = "00910635",
bibdate = "Fri Aug 20 09:32:34 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}‡}=W #S{=m;SˆIarticlefparith.bibHartree:1949:NSRDouglas R. (Douglas Rayner) HartreeNote On Systematic Roundoff Errors in Numerical IntegrationJournal of Research of the National Bureau of Standards4262??1949Wed Feb 14 19:07:37 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.02.14 19:07:37 ???acknhfbDouglas R. (Douglas Rayner) HartreeNote On Systematic Roundoff Errors in Numerical Integration
@Article{Hartree:1949:NSR,
author = "Douglas R. (Douglas Rayner) Hartree",
title = "Note On Systematic Roundoff Errors in Numerical
Integration",
journal = "Journal of Research of the National Bureau of
Standards",
volume = "42",
number = "??",
pages = "62??",
month = "????",
year = "1949",
bibdate = "Wed Feb 14 19:07:37 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}
Çö ‰SBW '#+'7;Q'=m;_';g?‰Uinproceedingsfparith.bibWorsley:1950:EDB. H. WorsleyReport of a Conference on High Speed Automatic Calculating Machines, 2225 June 1949The EDSAC demonstrationUniversity Mathematical LaboratoryCambridge, UK1216jan11950Wed Oct 13 11:39:09 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:39:09 ???Reprinted in cite [ 8.6]Randell:1982:ODC.acknhfbB. H. WorsleyReport of a Conference on High Speed Automatic Calculating Machines, {2225 June 1949}Reprinted in \cite[\S 8.6]{Randell:1982:ODC}.The {EDSAC} demonstration
@InProceedings{Worsley:1950:ED,
author = "B. H. Worsley",
booktitle = "Report of a Conference on High Speed Automatic
Calculating Machines, {2225 June 1949}",
title = "The {EDSAC} demonstration",
publisher = "University Mathematical Laboratory",
address = "Cambridge, UK",
pages = "1216",
month = jan,
year = "1950",
bibdate = "Wed Oct 13 11:39:09 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 8.6]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
}‰NAW'#'C7Q'=m;_C;g#‰Oinproceedingsfparith.bibWilkes:1950:EM. V. Wilkes and W. RenwickReport of a Conference on High Speed Automatic Calculating Machines, 2225 June 1949The EDSACUniversity Mathematical LaboratoryCambridge, UK911jan11950Wed Oct 13 12:00:41 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 12:00:41 ???Reprinted in cite [ 8.5]Randell:1982:ODC.acknhfbM. V. Wilkes and W. Renwick{Report of a Conference on High Speed Automatic Calculating Machines, 2225 June 1949}Reprinted in \cite[\S 8.5]{Randell:1982:ODC}.The {EDSAC}
@InProceedings{Wilkes:1950:E,
author = "M. V. Wilkes and W. Renwick",
booktitle = "{Report of a Conference on High Speed Automatic
Calculating Machines, 2225 June 1949}",
title = "The {EDSAC}",
publisher = "University Mathematical Laboratory",
address = "Cambridge, UK",
pages = "911",
month = jan,
year = "1950",
bibdate = "Wed Oct 13 12:00:41 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 8.5]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
}Œ6@W #1E+3!E%;„I5EŽÐbookfparith.bibStifler:1950:HSCW. W. Stifler, Jr.Highspeed computing devicespubMCGRAWHILLpubMCGRAWHILL:adrxiii + 4511950QA75 .E5Fri Aug 20 10:18:44 MDT 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib; z3950.loc.gov:7090/Voyager2010.08.20 10:18:44 MDTSupervised by Charles Brown Tompkins and C. H. Wakelin, Engineering Research Associates. The contents of this volume were first assembled in the form of a report to the Office of Naval Research, prepared under a provision of contract N6ONR240, Task 1. Cited in cite Sterbenz:1974:FPC.computersacknhfbW. W. {Stifler, Jr.}Highspeed computing devices
@Book{Stifler:1950:HSC,
editor = "W. W. {Stifler, Jr.}",
title = "Highspeed computing devices",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
pages = "xiii + 451",
year = "1950",
LCCN = "QA75 .E5",
bibdate = "Fri Aug 20 10:18:44 MDT 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = acknhfb,
remark = "Supervised by Charles Brown Tompkins and C. H.
Wakelin, Engineering Research Associates. The contents
of this volume were first assembled in the form of a
report to the Office of Naval Research, prepared under
a provision of contract N6ONR240, Task 1. Cited in
\cite{Sterbenz:1974:FPC}.",
subject = "computers",
}
,¶‹,\EZ #'i?7=m;9'„Ci’1
articlefparith.bibGill:1951:PSSS. GillA process for the stepbystep integration of differential equations in an automatic digital computing machinejPROCCAMBRIDGEPHILSOC47961081951PCPSA400081981 OR 00081981Tue Aug 28 05:54:12 2001http://www.math.utah.edu/pub/tex/bib/fparith.bib2001.08.28 05:54:12 ???Proceedings of the Cambridge Philosophical Society. Mathematical and physical sciencesaccurate floatingpoint summation; floatingpoint arithmetic; rounding errorsHigham cite Higham:1993:AFP comments ``In 1951 Gill [8] noticed that the rounding error in the sum of two numbers could be estimated by subtracting one of the numbers from the sum, and he made use of this estimate in a RungeKutta code in a program library for the EDSAC computer.''acknhfbS. GillA process for the stepbystep integration of differential equations in an automatic digital computing machine
@Article{Gill:1951:PSS,
author = "S. Gill",
title = "A process for the stepbystep integration of
differential equations in an automatic digital
computing machine",
journal = jPROCCAMBRIDGEPHILSOC,
volume = "47",
pages = "96108",
year = "1951",
CODEN = "PCPSA4",
ISSN = "00081981",
bibdate = "Tue Aug 28 05:54:12 2001",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Proceedings of the Cambridge Philosophical Society.
Mathematical and physical sciences",
keywords = "accurate floatingpoint summation; floatingpoint
arithmetic; rounding errors",
remark = "Higham \cite{Higham:1993:AFP} comments ``In 1951 Gill
[8] noticed that the rounding error in the sum of two
numbers could be estimated by subtracting one of the
numbers from the sum, and he made use of this estimate
in a RungeKutta code in a program library for the
EDSAC computer.''",
}†(DU %#)#K5=m;g#O†Wincollectionfparith.bibBrown:1951:HRRG. W. BrownHistory of RAND's random digitsHouseholder:1951:MCM31321951Sun Sep 18 12:02:43 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib2011.09.18 12:02:43 ???http://www.rand.org/pubs/papers/2008/P113.pdfacknhfbG. W. BrownHistory of {RAND}'s random digits
@InCollection{Brown:1951:HRR,
author = "G. W. Brown",
title = "History of {RAND}'s random digits",
crossref = "Householder:1951:MCM",
pages = "3132",
year = "1951",
bibdate = "Sun Sep 18 12:02:43 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.rand.org/pubs/papers/2008/P113.pdf",
acknowledgement = acknhfb,
}ˆGCU #)#]C77;m;y#]‰{articlefparith.bibBooth:1951:SBMA. D. BoothA signed binary multiplication techniquejQUARTJMECHAPPLIEDMATH422362401951QJMMAV00335614 OR 0033561400335614 OR 00335614Thu Apr 2 08:38:35 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib1998.04.02 08:38:35 ???Quarterly Journal of Mechanics and Applied MathematicsacksfoA. D. BoothA signed binary multiplication technique
@Article{Booth:1951:SBM,
author = "A. D. Booth",
title = "A signed binary multiplication technique",
journal = jQUARTJMECHAPPLIEDMATH,
volume = "4",
number = "2",
pages = "236240",
month = "????",
year = "1951",
CODEN = "QJMMAV",
ISSN = "00335614",
ISSNL = "00335614",
bibdate = "Thu Apr 2 08:38:35 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acksfo # " and " # acknhfb,
fjournal = "Quarterly Journal of Mechanics and Applied
Mathematics",
}
ö“gxë
ö‡Ž
@Article{Weinstein:1969:CCR,
author = "C. Weinstein and A. V. Oppenheim",
title = "Correction to {``A comparison of roundoff noise in
floating point and fixed point digital filter
realizations''}",
journal = jPROCIEEE,
volume = "57",
number = "8",
pages = "14661466",
month = aug,
year = "1969",
CODEN = "IEEPAD",
ISSN = "00189219 (print), 15582256 (electronic)",
ISSNL = "00189219",
bibdate = "Sat Jul 16 08:40:52 MDT 2005",
bibsource = "http://ieeexplore.ieee.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Weinstein:1969:CRN}.",
acknowledgement = acknhfb,
fjournal = "Proceedings of the IEEE",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
}Û‰Y“3
@Article{Wei:2003:REE,
author = "Musheng Wei and Qiaohua Liu",
title = "Roundoff error estimates of the modified
{GramSchmidt} algorithm with column pivoting",
journal = jBITNUMMATH,
volume = "43",
number = "3",
pages = "627645",
month = sep,
year = "2003",
CODEN = "BITTEL, NBITAB",
DOI = "http://dx.doi.org/10.1023/B:BITN.0000007051.49808.04",
ISSN = "0006383;„*ˆU
@Article{Wehringer:1981:SBM,
author = "A. Wehringer",
title = "{Schnelle 16bitMultiplikation und Division}
\toenglish {Fast 16bit Multiplication and Division}
\endtoenglish",
journal = "Elektronikschau",
volume = "10",
pages = "3637",
year = "1981",
bibdate = "Fri Sep 16 16:30:40 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
}Jƒx‡q
@Article{Wehringer:1981:FSA,
author = "A. Wehringer",
title = "{Flie{\ss}kommaArithmetik} \toenglish {Floatingpoint
Arithmetic} \endtoenglish",
journal = "Elektronikschau",
volume = "5",
pages = "3436",
year = "1981",
bibdate = "Fri Sep 16 16:30:39 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
}I„\‰;
@Article{Weinberger:1956:OMA,
author = "A. Weinberger and J. L. Smith",
title = "A OneMicrosecond Adder Using OneMegacycle
Circuitry",
journal = jIRETRANSELECCOMPUT,
volume = "EC5",
number = "??",
pages = "6573",
month = jun,
year = "1956",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Fri Nov 09 19:38:57 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}c†Œ)
@Article{Weibel:1957:EAM,
author = "Erich S. Weibel",
title = "An Electronic Analog Multiplier Using Carriers",
journal = jIRETRANSELECCOMPUT,
volume = "EC6",
number = "1",
pages = "3034",
month = mar,
year = "1957",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1957.5221558",
ISSN = "03679950",
bibdate = "Thu Jun 30 16:07:23 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5221558",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}rb/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Proceedings of the Cambridge Philosophical Society.
Mathematical and physical sciences",
keywords = "accurate floatingpoint summation; floatingpoint
arithmetic; rounding errors",
remark = "Higham \cite{Higham:1993:AFP} comments ``In 1951 Gill
[8] noticed that the rounding error in the sum of two
numbers could be estimated by subtracting one of the
numbers from the sum, and he made use of this estimate
in a RungeKutta code in a program library for the
EDSAC computer.''",
}E
0…ARct…
<ˆ4i
@Article{Kroft:1974:CTC,
author = "D. Kroft",
title = "Comments on {``A Two's Complement Parallel Array
Multiplication Algorithm''}",
journal = jIEEETRANSCOMPUT,
volume = "C23",
number = "12",
pages = "13271328",
month = dec,
year = "1974",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1974.223863",
ISSN = "00189340 (print), 15579956 (electronic)",
&‹(–Q
@Article{Krishnan:1992:CGF,
author = "R. Krishnan and G. A. Jullien and W. C. Miller",
title = "Computation of generalized {FIR} filter structure
using the modified quadratic residue number system",
journal = jIEEETRANSCIRCUITSSYST2,
volume = "39",
number = "1",
pages = "5862",
month = jan,
year = "1992",
CODEN = "ICSPE5",
DOI = "http://dx.doi.org/10.1109/82.204110",
GŠ ”A
@Article{Krishnan:1986:MQR,
author = "R. Krishnan and G. Jullien and W. Miller",
title = "The modified quadratic residue number system ({MQRNS})
for complex highspeed signal processing",
journal = jIEEETRANSCIRCUITSSYST,
volume = "33",
number = "3",
pages = "325327",
month = mar,
year = "1986",
CODEN = "ICSYBT",
DOI = "http://dx.doi.org/10.1049/el:19850252",
ISSN = —Š2”e
@Article{Krishnan:1986:ICN,
author = "R. Krishnan and G. Jullien and W. Miller",
title = "Implementation of complex number theoretic transforms
using quadratic residue number systems",
journal = jIEEETRANSCIRCUITSSYST,
volume = "33",
number = "8",
pages = "759766",
month = aug,
year = "1986",
CODEN = "ICSYBT",
DOI = "http://dx.doi.org/10.1049/el:19850252",
ISSN = •‰\“9
@Article{Krishnan:1986:CDS,
author = "R. Krishnan and G. Jullien and W. Miller",
title = "Complex digital signal processing using quadratic
residue number systems",
journal = "Acoustics, Speech, and Signal Processing [see also
IEEE Transactions on Signal Processing], IEEE
Transactions on",
volume = "34",
number = "1",
pages = "166177",
month = feb,
year = "1986“?
@Arti‡S'
@Article{Ku:2002:NPA,
author = "KyoMin Ku and KyeoungJu Ha and HyunSung Kim and
KeeYoung Yoo",
title = "New Parallel Architecture for Modular Multiplication
and Squaring Based on Cellular Automata",
journal = jLECTNOTESCOMPSCI,
volume = "2367",
pages = "359??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Tue Sep 10 19:09:54 MDT 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t2367.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/2367/23670359.htm;
http://link.springerny.com/link/service/series/0558/papers/2367/23670359.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}¸ˆm‘[
@Article{Ku:1975:FPC,
author = "W. Ku and SiuMing Ng",
title = "Floatingpoint coefficient sensitivity and roundoff
noise of recursive digital filters realized in ladder
structures",
journal = jIEEETRANSCIRCUITSSYST,
volume = "22",
number = "12",
pages = "927936",
month = dec,
year = "1975",
CODEN = "ICSYBT",
ISSN = "00984094 (print), 15581276 (electro…
ÄÄŽ9FX#1]o1573%;m;Qym]YsŽ}articlefparith.bibGoldstine:1951:NIMHerman H. Goldstine and John von NeumannNumerical Inverting of Matrices of High Order. IIjPROCAMMATHSOC21882021951PAMYAR00029939 (print), 10886826 (electronic) OR 00029939 (print), 10886826 (electronic)00029939 OR 0002993965.0XMR0041539 (12,861b)F. J. MurrayThu Nov 8 14:49:46 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.11.08 14:49:46 ???See cite vonNeumann:1947:NIM for Part I. Reprinted in cite [Paper~15, pp.~558572]Taub:1963:JNCa.http://www.jstor.org/view/00029939/di970628/97p0185x/0Proceedings of the American Mathematical Society043.12301acknhfbHerman H. Goldstine and John von NeumannSee \cite{vonNeumann:1947:NIM} for Part I. Reprinted in \cite[Paper~15, pp.~558572]{Taub:1963:JNCa}.Numerical Inverting of Matrices of High Order. {II}
@Article{Goldstine:1951:NIM,
author = "Herman H. Goldstine and John von Neumann",
title = "Numerical Inverting of Matrices of High Order. {II}",
journal = jPROCAMMATHSOC,
volume = "2",
pages = "188202",
year = "1951",
CODEN = "PAMYAR",
ISSN = "00029939 (print), 10886826 (electronic)",
ISSNL = "00029939",
MRclass = "65.0X",
MRnumber = "MR0041539 (12,861b)",
MRreviewer = "F. J. Murray",
bibdate = "Thu Nov 8 14:49:46 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{vonNeumann:1947:NIM} for Part I. Reprinted
in \cite[Paper~15, pp.~558572]{Taub:1963:JNCa}.",
URL = "http://www.jstor.org/view/00029939/di970628/97p0185x/0",
ZMnumber = "043.12301",
acknowledgement = acknhfb,
fjournal = "Proceedings of the American Mathematical Society",
}arith.bib",
URL = "http://scitation.aip.org/content/aapt/journal/ajp/19/8/10.1119/1.1933042",
abstract = "Though it is frequently stated that binary numeration
was first formally proposed by Leibniz as an
illustration of his dualistic philosophy, the
mathematical papers of Thomas Hariot (15601621) show
clearly that Hariot not only experimented with number
systems, but also understood clearly the theory and
practice of binary numeration nearly a century before
Leibniz's time.",
acknowledgement = acknhfb,
fjournal = "American Journal of Physics",
journalURL = "http://scitation.aip.org/content/aapt/journal/ajp",
}G
ÐÐ”GY #+MS57m…{Co…{+Q“Yarticlefparith.bibShirley:1951:BNBJohn W. ShirleyBinary Numeration before LeibnizjAMERJPHYSICS1984524541951AJPIAShttp://dx.doi.org/10.1119/1.193304200029505 (print), 19432909 (electronic) OR 00029505 (print), 19432909 (electronic)00029505 OR 00029505http://www.math.utah.edu/pub/tex/bib/fparith.bibhttp://scitation.aip.org/content/aapt/journal/ajp/19/8/10.1119/1.1933042Though it is frequently stated that binary numeration was first formally proposed by Leibniz as an illustration of his dualistic philosophy, the mathematical papers of Thomas Hariot (15601621) show clearly that Hariot not only experimented with number systems, but also understood clearly the theory and practice of binary numeration nearly a century before Leibniz's time.American Journal of Physicsacknhfbhttp://scitation.aip.org/content/aapt/journal/ajpThough it is frequently stated that binary numeration was first formally proposed by Leibniz as an illustration of his dualistic philosophy, the mathematical papers of Thomas Hariot (15601621) show clearly that Hariot not only experimented with number systems, but also understood clearly the theory and practice of binary numeration nearly a century before Leibniz's time.John W. ShirleyBinary Numeration before {Leibniz}
@Article{Shirley:1951:BNB,
author = "John W. Shirley",
title = "Binary Numeration before {Leibniz}",
journal = jAMERJPHYSICS,
volume = "19",
number = "8",
pages = "452454",
year = "1951",
CODEN = "AJPIAS",
DOI = "http://dx.doi.org/10.1119/1.1933042",
ISSN = "00029505 (print), 19432909 (electronic)",
ISSNL = "00029505",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://scitation.aip.org/content/aapt/journal/ajp/19/8/10.1119/1.1933042",
abstract = "Though it is frequently stated that binary numeration
was first formally proposed by Leibniz as an
illustration of his dualistic philosophy, the
mathematical papers of Thomas Hariot (15601621) show
clearly that Hariot not only experimented with number
systems, but also understood clearly the theory and
practice of binary numeration nearly a century before
Leibniz's time.",
acknowledgement = acknhfb,
fjournal = "American Journal of Physics",
journalURL = "http://scitation.aip.org/content/aapt/journal/ajp",
}pubACM,
address = pubACM:adr,
pages = "101105",
year = "1952",
DOI = "http://dx.doi.org/10.1145/1434770.1434787",
LCCN = "????",
bibdate = "Fri Dec 03 09:17:58 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
bookpages = "vi + 114",
keywords = "Bell Laboratories Model 15 relay computers; complex
fixedpoint decimal arithmetic; complex floatingpoint
decimal arithmetic",
}H
ˆfIU#)]Y/77=m;e]Y‰earticlefparith.bibDavis:1952:ARSK. Davis and R. Biddulph and S. BalashekAutomatic Recognition of Spoken DigitsjJACOUSTSOCAM246637642nov111952JASMAN00014966 OR 0001496600014966 OR 00014966Fri Nov 28 16:38:51 2003http://www.math.utah.edu/pub/tex/bib/fparith.bib2003.11.28 16:38:51 ???Journal of the Acoustical Society of AmericaackmfcK. Davis and R. Biddulph and S. BalashekAutomatic Recognition of Spoken Digits
@Article{Davis:1952:ARS,
author = "K. Davis and R. Biddulph and S. Balashek",
title = "Automatic Recognition of Spoken Digits",
journal = jJACOUSTSOCAM,
volume = "24",
number = "6",
pages = "637642",
month = nov,
year = "1952",
CODEN = "JASMAN",
ISSN = "00014966",
ISSNL = "00014966",
bibdate = "Fri Nov 28 16:38:51 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ackmfc # " and " # acknhfb,
fjournal = "Journal of the Acoustical Society of America",
}gHZ '#'+ƒ
#_=m;‚'ƒ+inproceedingsfparith.bibAndrews:1952:RBLE. G. AndrewsJ. C. McPhersonProceedings of the AIEEIRE '51: Papers and discussions presented at the December 1012, 1951, joint AIEEIRE computer conference, Philadelphia, PA: Review of electronic digital computersA review of the Bell Laboratories' digital computer developmentspubACMpubACM:adr1011051952http://dx.doi.org/10.1145/1434770.1434787Fri Dec 03 09:17:58 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.12.03 09:17:58 ???Bell Laboratories Model 15 relay computers; complex fixedpoint decimal arithmetic; complex floatingpoint decimal arithmeticacknhfbvi + 114E. G. AndrewsProceedings of the AIEEIRE '51: Papers and discussions presented at the December 1012, 1951, joint AIEEIRE computer conference, Philadelphia, PA: Review of electronic digital computersJ. C. McPhersonA review of the {Bell Laboratories}' digital computer developments
@InProceedings{Andrews:1952:RBL,
author = "E. G. Andrews",
editor = "J. C. McPherson",
booktitle = "Proceedings of the AIEEIRE '51: Papers and
discussions presented at the December 1012, 1951,
joint AIEEIRE computer conference, Philadelphia, PA:
Review of electronic digital computers",
title = "A review of the {Bell Laboratories}' digital computer
developments",
publisher = pubACM,
address = pubACM:adr,
pages = "101105",
year = "1952",
DOI = "http://dx.doi.org/10.1145/1434770.1434787",
LCCN = "????",
bibdate = "Fri Dec 03 09:17:58 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
bookpages = "vi + 114",
keywords = "Bell Laboratories Model 15 relay computers; complex
fixedpoint decimal arithmetic; complex floatingpoint
decimal arithmetic",
}
O>OÎ
½'žO
@Article{Lei:2013:VCI,
author = "Yuanwu Lei and Yong Dou and Lei Guo and Jinbo Xu and
Jie Zhou and Yazhuo Dong and Hongjian Li",
title = "{VLIW} coprocessor for {IEEE754} quadrupleprecision
elementary functions",
journal = jTACO,
volume = "10",
number = "3",
pages = "12:112:??",
month = sep,
year = "2013",
CODEN = "????",
DOI = "http://dx.doi.org/10.1145/#‰’
@Article{Lei:2013:FIE,
author = "Yuanwu Lei and Yong Dou and Yazhuo Dong and Jie Zhou
and Fei Xia",
title = "{FPGA} implementation of an exact dot product and its
application in variableprecision floatingpoint
arithmetic",
journal = jJSUPERCOMPUTING,
volume = "64",
number = "2",
pages = "580605",
month = may,
year = "2013",
CODEN = "JOSUED",
DOI "„^‰=
@Article{Lemaire:1980:INR,
author = "C. A. Lemaire and J. C. Svercek",
title = "Improved Nonrestoring Division",
journal = jIBMTDB,
volume = "23",
number = "3",
pages = "11491151",
month = aug,
year = "1980",
CODEN = "IBMTAA",
ISSN = "00188689",
bibdate = "Thu Sep 1 10:15:08 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IBM Technical Disclosure Bulletin",
}©ˆv‘m
@Article{Lehmer:1963:RDO,
author = "D. H. Lehmer",
title = "{R6317} Division and Overflow Detection in Residue
Number Systems",
journal = jIEEETRANSELECCOMPUT,
volume = "EC12",
number = "1",
pages = "3637",
month = feb,
year = "1963",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1963.263493",
ISSN = "03677508",
bibdate = "Thu Jul 14 08:10:ùR
@Article{Lenaerts:1955:ASR,
author = "E. H. Lenaerts",
title = œ0¸a
@Article{Lei:2014:FIS,
author = "Yuanwu Lei and Lei Guo and Yong Dou and Sheng Ma and
Jinbo Xu",
title = "{FPGA} Implementation of a SpecialPurpose {VLIW}
Structure for DoublePrecision Elementary Function",
journal = jTRETS,
volume = "7",
number = "2",
pages = "8:18:??",
month = jun,
year = "2014",
CODEN = "????",
DOI = "http://dx.doi.org/10.1145/2617594"…†R%
@Article{Lemieux:2001:FPM,
author = "Joe Lemieux",
title = "FixedPoint Math in {C}",
journal = jEMBEDSYSPROG,
volume = "14",
number = "1",
pages = "????",
month = apr,
year = "2001",
CODEN = "EYPRE4",
ISSN = "10403272",
bibdate = "Fri Nov 28 18:24:03 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.embedded.com/story/OEG20010311S0022",
abstract = "Floatingpoint arithmetic can be expensive if you're
using an integeronly processor. But floatingpoint
values can be manipulated as integers, as a less
expensive alternative.",
acknowledgement = ackmfc # " and " # acknhfb,
fjournal = "Embedded Systems Programming",
}‰’
@Article{Lemeire:1975:CEI,
author = "Frans Lemeire",
title = "Computation of Equivalent Inherent Rounding Errors in
the Solution of a Set of Linear Equations",
journal = jBIT,
volume = "15",
number = "1",
pages = "6571",
month = mar,
year = "1975",
CODEN = "BITTEL, NBITAB",
DOI = "http://dx.doi.org/10.1007/BF01932997",
ISSN = "00063835 (print), 15729125 (electro
*
g¦*ŠyLW'#AQga/=m;_AYgkŠIinproceedingsfparith.bibSheldon:1952:ICPJ. W. Sheldon and L. TatumReview of Electronic Digital Computers. Joint AIEEIRE Computer Confer ence. 1012 December 1951The IBM cardprogrammed electronic calculatorAmerican Institute of Electrical EngineersNew York, NY, USA30361952Wed Oct 13 11:28:45 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:28:45 ???Reprinted in cite [ 5.4]Randell:1982:ODC.acknhfbJ. W. Sheldon and L. TatumReview of Electronic Digital Computers. Joint {AIEEIRE} Computer Confer ence. {1012 December 1951}Reprinted in \cite[\S 5.4]{Randell:1982:ODC}.The {IBM} cardprogrammed electronic calculator
@InProceedings{Sheldon:1952:ICP,
author = "J. W. Sheldon and L. Tatum",
booktitle = "Review of Electronic Digital Computers. Joint
{AIEEIRE} Computer Confer ence. {1012 December
1951}",
title = "The {IBM} cardprogrammed electronic calculator",
publisher = "American Institute of Electrical Engineers",
address = "New York, NY, USA",
pages = "3036",
year = "1952",
bibdate = "Wed Oct 13 11:28:45 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 5.4]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
}‰>KW#EQQ=a;EQŠearticlefparith.bibMorrill:1952:SEMC. D. Morrill and R. V. BaumA Stabilized Electronic MultiplierjTRANSIREPROFGROUPELECCOMPUTEC15259dec121952Fri Jul 15 15:20:53 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.15 15:20:53 ???Transactions of the I.R.E. Professional Group on Electronic ComputersacknhfbC. D. Morrill and R. V. BaumA Stabilized Electronic Multiplier
@Article{Morrill:1952:SEM,
author = "C. D. Morrill and R. V. Baum",
title = "A Stabilized Electronic Multiplier",
journal = jTRANSIREPROFGROUPELECCOMPUT,
volume = "EC1",
number = "??",
pages = "5259",
month = dec,
year = "1952",
CODEN = "????",
ISSN = "????",
bibdate = "Fri Jul 15 15:20:53 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
acknowledgement = acknhfb,
fjournal = "Transactions of the I.R.E. Professional Group on
Electronic Computers",
}‹JV #1/!O77E‚#;SGc/articlefparith.bibMichaelson:1952:BAR. L. MichaelsonBinary ArithmeticjINCSTAT313540feb21952http://dx.doi.org/10.2307/298659114669404 OR 1466940414669404 OR 14669404Thu Jan 22 18:10:18 MST 2015http://www.jstor.org/stable/i349863; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/jrssd1950.bib2015.01.22 18:10:18 MSThttp://www.jstor.org/stable/2986591The Incorporated Statisticianacknhfbhttp://www.jstor.org/journals/14669404.htmlR. L. MichaelsonBinary Arithmetic
@Article{Michaelson:1952:BA,
author = "R. L. Michaelson",
title = "Binary Arithmetic",
journal = jINCSTAT,
volume = "3",
number = "1",
pages = "3540",
month = feb,
year = "1952",
CODEN = "????",
DOI = "http://dx.doi.org/10.2307/2986591",
ISSN = "14669404",
ISSNL = "14669404",
bibdate = "Thu Jan 22 18:10:18 MST 2015",
bibsource = "http://www.jstor.org/stable/i349863;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/jrssd1950.bib",
URL = "http://www.jstor.org/stable/2986591",
acknowledgement = acknhfb,
fjournal = "The Incorporated Statistician",
journalURL = "http://www.jstor.org/journals/14669404.html",
}
:â:™%NY #+%I57=m;'‰1e‰%M—Marticlefparith.bibBackus:1954:ISSJ. W. BackusThe IBM 701 Speedcoding SystemjJACM1146jan11954JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Fri Nov 04 00:18:27 1994http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.11.04 00:18:27 ???http://community.computerhistory.org/scc/projects/FORTRAN/paper/p4backus.pdfThe IBM 701 Speedcoding System is a set of instructions which causes the 701 to behave like a threeaddress floating point calculator. Let us call this the Speedcoding calculator. In addition to operating in floating point, this Speedcoding calculator has extremely convenient means for getting information into the machine and for printing results; it has an extensive set of operations to make the job of programming as easy as possible. Speedcoding also provides automatic address modification, flexible tracing, convenient use of auxiliary storage, and builtin checking.Journal of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J401The IBM 701 Speedcoding System is a set of instructions which causes the 701 to behave like a threeaddress floating point calculator. Let us call this the Speedcoding calculator. In addition to operating in floating point, this Speedcoding calculator has extremely convenient means for getting information into the machine and for printing results; it has an extensive set of operations to make the job of programming as easy as possible. Speedcoding also provides automatic address modification, flexible tracing, convenient use of auxiliary storage, and builtin checking.J. W. BackusThe {IBM 701 Speedcoding} System
@Article{Backus:1954:ISS,
author = "J. W. Backus",
title = "The {IBM 701 Speedcoding} System",
journal = jJACM,
volume = "1",
number = "1",
pages = "46",
month = jan,
year = "1954",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Fri Nov 04 00:18:27 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://community.computerhistory.org/scc/projects/FORTRAN/paper/p4backus.pdf",
abstract = "The IBM 701 Speedcoding System is a set of
instructions which causes the 701 to behave like a
threeaddress floating point calculator. Let us call
this the Speedcoding calculator. In addition to
operating in floating point, this Speedcoding
calculator has extremely convenient means for getting
information into the machine and for printing results;
it has an extensive set of operations to make the job
of programming as easy as possible. Speedcoding also
provides automatic address modification, flexible
tracing, convenient use of auxiliary storage, and
builtin checking.",
acknowledgement = acknhfb,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}†MW #%+#=m;/†7bookfparith.bibIBM:1953:POTIBM CorporationPrinciples of Operation: Type 701 and Associated EquipmentpubIBMpubIBM:adr1031953Wed Sep 14 23:17:49 1994http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.14 23:17:49 ???acknhfb{IBM Corporation}Principles of Operation: Type 701 and Associated Equipment
@Book{IBM:1953:POT,
author = "{IBM Corporation}",
title = "Principles of Operation: Type 701 and Associated
Equipment",
publisher = pubIBM,
address = pubIBM:adr,
pages = "103",
year = "1953",
bibdate = "Wed Sep 14 23:17:49 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}",
URL = "http://community.computerhistory.org/scc/projects/FORTRAN/paper/p4backus.pdf",
abstract = "The IBM 701 Speedcoding System is a set of
instructions which causes the 701 to behave like a
threeaddress floating point calculator. Let us call
this the Speedcoding calculator. In addition to
operating in floating point, this Speedcoding
calculator has extremely convenient means for getting
information into the machine and for printing results;
it has an extensive set of operations to make the job
of programming as easy as possible. Speedcoding also
provides automatic address modification, flexible
tracing, convenient use of auxiliary storage, and
builtin checking.",
acknowledgement = acknhfb,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}Nnd coding manual  Datatron
operation manual  Central computer handbook 
Paper tape system handbook  Card converter Model 500
handbook  Magnetic tape system handbook 
Cardatron system handbook  Model 560 DATAFILE
handbook  Control console and consolette handbook
 Floating point control unit handbook  External
switching unit handbook  Tape preparation unit
handbook.",
}O
W²WŒXPX#?WQ=a;‚[?[ŽEarticlefparith.bibFreeman:1954:TSAH. Freeman and E. ParsonsTimeSharing Analog Multiplier (TSAM)jTRANSIREPROFGROUPELECCOMPUTEC311117mar31954Fri Jul 15 15:20:53 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.15 15:20:53 ???Transactions of the I.R.E. Professional Group on Electronic ComputersCited in US Patent 3,043,516 (10 July 1962): Time Summing Device for Division, Multiplication, Root Taking and Interpolation, by Harold W. Abbott and Vernon P. Mathis.acknhfbH. Freeman and E. ParsonsTimeSharing Analog Multiplier ({TSAM})
@Article{Freeman:1954:TSA,
author = "H. Freeman and E. Parsons",
title = "TimeSharing Analog Multiplier ({TSAM})",
journal = jTRANSIREPROFGROUPELECCOMPUT,
volume = "EC3",
number = "1",
pages = "1117",
month = mar,
year = "1954",
CODEN = "????",
ISSN = "????",
bibdate = "Fri Jul 15 15:20:53 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
acknowledgement = acknhfb,
fjournal = "Transactions of the I.R.E. Professional Group on
Electronic Computers",
remark = "Cited in US Patent 3,043,516 (10 July 1962): Time
Summing Device for Division, Multiplication, Root
Taking and Interpolation, by Harold W. Abbott and
Vernon P. Mathis.",
}ŽKOV #/Q1%/Em;3†WU1
manualfparith.bibBurroughs:1954:DHBurroughs Corporation. ElectroDataDatatron handbooksThe DivisionPasadena, CA, USA461954Sat Feb 24 15:01:45 MST 1996http://www.math.utah.edu/pub/tex/bib/fparith.bib1996.02.24 15:01:45 MST12 volumes in 1.Datatron (Computer)Datatron programming and coding manual  Datatron operation manual  Central computer handbook  Paper tape system handbook  Card converter Model 500 handbook  Magnetic tape system handbook  Cardatron system handbook  Model 560 DATAFILE handbook  Control console and consolette handbook  Floating point control unit handbook  External switching unit handbook  Tape preparation unit handbook.acknhfb{Burroughs Corporation. ElectroData}12 volumes in 1.Datatron handbooks
@Manual{Burroughs:1954:DH,
author = "{Burroughs Corporation. ElectroData}",
title = "Datatron handbooks",
organization = "The Division",
address = "Pasadena, CA, USA",
year = "1954",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "12 volumes in 1.",
acknowledgement = acknhfb,
keywords = "Datatron (Computer)",
remark = "Datatron programming and coding manual  Datatron
operation manual  Central computer handbook 
Paper tape system handbook  Card converter Model 500
handbook  Magnetic tape system handbook 
Cardatron system handbook  Model 560 DATAFILE
handbook  Control console and consolette handbook
 Floating point control unit handbook  External
switching unit handbook  Tape preparation unit
handbook.",
}
& .&1ðˆq‘c
@Article{Hahn:1994:UDF,
author = "H. Hahn and D. Timmermann and B. J. Hosticka and B.
Rix",
title = "A unified and divisionfree {CORDIC} argument
reduction method with unlimited convergence domain
including inverse hyperbolic functions",
journal = jIEEETRANSCOMPUT,
volume = "43",
number = "11",
pages = "13391344",
month = nov,
year = "1994",
CODEN = óß3
@Article{Hammersley:1969:NAP,
author = "P. Hammersley",
title = "Note on {Algorithm 34}: Procedures for the Basic
Arithmetical Operations in MultiLength Working",
journal = jCOMPJ,
volume = "12",
number = "1",
pages…=Š{
@Article{Halfhill:1995:TBP,
author = "Tom R. Halfhill",
title = "The Truth Behind the {Pentium} Bug: How often do the
five empty cells in the {Pentium}'s {FPU} lookup table
spell miscalculation?",
journal = jBYTE,
volume = "20",
number = "3",
pages = "163??",
month = mar,
year = "1995",
CODEN = "BYTEDJ",
ISSN = "03605280 (print), 10827838 (electronic)",
ISSNL = "03605280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "BYTE Magazine",
}•‰’
@Article{Haller:1996:AFP,
author = "G. M. Haller and D. R. Freytag",
title = "Analog floatingpoint {BiCMOS} sampling chip and
architecture of the {BaBar CsI} calorimeter frontend
electronics system at the {SLAC} {B}factory",
journal = jIEEETRANSNUCLSCI,
volume = "43",
number = "3",
pages = "16101614",
month = jun,
year = "1996",
CODEN = "IRNSAM",
ISSN = «Oy
@Article{Hammel:1965:RLC,
author = "D. Hammel",
title = "{R6554} The Logic of Computer Arithmetic",
journal = jIEEETRANSELECCOMPUT,
volume = "EC14",
number = "4",
pages = "670670",
month = aug,
year = "1965",
CODEN = "IEECA8",
DOI = ‰’
@Article{Hagihara:1997:FPD,
author = "Y. Hagihara and S. Inui and F. Okamoto and M. Nishida
and T. Nakamura and H. Yamada",
title = "Floatingpoint datapaths with online builtin self
speed test",
journal = jIEEEJSOLIDSTATECIRCUITS,
volume = "32",
number = "3",
pages = "444449",
month = mar,
year = "1997",
CODEN = "IJSCBC",
ISSN = "00189200 (print), 155I…r‹e
@Article{Hallin:1972:PAF,
author = "T. G. Hallin and M. J. Flynn",
title = "Pipelining of Arithmetic Functions",
journal = jIEEETRANSCOMPUT,
volume = "C21",
number = "8",
pages = "880886",
month = aug,
year = "1972",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1972.5009044",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Fri Nov 09 18:57:52 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}^ˆ
@Article{Halatsis:1983:ECC,
author = "C. Halatsis and N. Gaitanis and M. Sigala",
title = "ErrorCorrecting Codes in BinaryCoded Radix$r$
Arithmetic",
journal = jIEEETRANSCOMPUT,
volume = "C32",
number = "3",
pages = "326328",
month = mar,
year = "1983",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1983.1676227",
ISSN = "00189340 (print), 15579956 ¯
ÑGÑ‰;SV#)g[;7=a;]g[Š'articlefparith.bibMayer:1954:ODFM. A. Mayer and B. M. Gordon and R. N. NicolaAn operational digital feedback dividerjIRETRANSELECCOMPUTEC311720mar31954IRELAO03679950 OR 03679950Sun Jul 17 09:52:58 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.17 09:52:58 ???IRE Transactions on Electronic ComputersacknhfbM. A. Mayer and B. M. Gordon and R. N. NicolaAn operational digital feedback divider
@Article{Mayer:1954:ODF,
author = "M. A. Mayer and B. M. Gordon and R. N. Nicola",
title = "An operational digital feedback divider",
journal = jIRETRANSELECCOMPUT,
volume = "EC3",
number = "1",
pages = "1720",
month = mar,
year = "1954",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Sun Jul 17 09:52:58 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}‰5RW#+AQQ=a;AQŠ]articlefparith.bibKovach:1954:AMUL. D. Kovach and W. ComleyAn Analog Multiplier Using ThyritejTRANSIREPROFGROUPELECCOMPUTEC324245jun61954Sun Jul 17 09:57:13 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.17 09:57:13 ???Transactions of the I.R.E. Professional Group on Electronic ComputersacknhfbL. D. Kovach and W. ComleyAn Analog Multiplier Using Thyrite
@Article{Kovach:1954:AMU,
author = "L. D. Kovach and W. Comley",
title = "An Analog Multiplier Using Thyrite",
journal = jTRANSIREPROFGROUPELECCOMPUT,
volume = "EC3",
number = "2",
pages = "4245",
month = jun,
year = "1954",
CODEN = "????",
ISSN = "????",
bibdate = "Sun Jul 17 09:57:13 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
acknowledgement = acknhfb,
fjournal = "Transactions of the I.R.E. Professional Group on
Electronic Computers",
}‰6QX #'y5E
;yŠ9
articlefparith.bibGorn:1954:AACSaul GornThe Automatic Analysis and Control of Computing ErrorsjJSIAM226981jun61954JSIMAV03684245 (print), 1095712X (electronic) OR 03684245 (print), 1095712X (electronic)Thu Oct 15 18:16:06 MDT 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.15 18:16:06 MDTJournal of the Society for Industrial and Applied MathematicsacknhfbSaul GornThe Automatic Analysis and Control of Computing Errors
@Article{Gorn:1954:AAC,
author = "Saul Gorn",
title = "The Automatic Analysis and Control of Computing
Errors",
journal = jJSIAM,
volume = "2",
number = "2",
pages = "6981",
month = jun,
year = "1954",
CODEN = "JSIMAV",
ISSN = "03684245 (print), 1095712X (electronic)",
bibdate = "Thu Oct 15 18:16:06 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "Journal of the Society for Industrial and Applied
Mathematics",
}
®
È,®Š{VX#+wM#E%;M!wMŒ bookfparith.bibEckert:1955:FFSW. J. (Wallace John) Eckert and Rebecca Bradley JonesFaster, faster; a simple description of a giant electronic calculator and the problems it solvespubIBMpubIBM:adr1601955QA76 .E25Fri Aug 20 08:57:56 MDT 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib; z3950.loc.gov:7090/Voyager2010.08.20 08:57:56 MDTCited in cite Sterbenz:1974:FPC.Computersacknhfb19021971W. J. (Wallace John) Eckert and Rebecca Bradley JonesFaster, faster; a simple description of a giant electronic calculator and the problems it solves
@Book{Eckert:1955:FFS,
author = "W. J. (Wallace John) Eckert and Rebecca Bradley
Jones",
title = "Faster, faster; a simple description of a giant
electronic calculator and the problems it solves",
publisher = pubIBM,
address = pubIBM:adr,
pages = "160",
year = "1955",
LCCN = "QA76 .E25",
bibdate = "Fri Aug 20 08:57:56 MDT 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = acknhfb,
authordates = "19021971",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
subject = "Computers",
xxaddress = pubMCGRAWHILL:adr,
xxpublisher = pubMCGRAWHILL,
}‰UV#/IM%57=m;IMIM‰{articlefparith.bibCrockett:1955:GMMJ. B. Crockett and H. ChernoffGradient Methods of MaximizationjPACJMATH533501955PJMAAI00308730 (print), 19455844 (electronic) OR 00308730 (print), 19455844 (electronic)00308730 OR 00308730Fri Aug 20 08:54:24 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.08.20 08:54:24 ???Pacific Journal of MathematicsCited in cite Sterbenz:1974:FPC.acknhfbJ. B. Crockett and H. ChernoffGradient Methods of Maximization
@Article{Crockett:1955:GMM,
author = "J. B. Crockett and H. Chernoff",
title = "Gradient Methods of Maximization",
journal = jPACJMATH,
volume = "5",
number = "??",
pages = "3350",
year = "1955",
CODEN = "PJMAAI",
ISSN = "00308730 (print), 19455844 (electronic)",
ISSNL = "00308730",
bibdate = "Fri Aug 20 08:54:24 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Pacific Journal of Mathematics",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}Š5TX #%57=m;1Oe%‹=articlefparith.bibMoshman:1954:GPRJack MoshmanThe Generation of PseudoRandom Numbers on a Decimal CalculatorjJACM128891apr41954JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Fri Nov 04 00:18:27 1994http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.11.04 00:18:27 ???Journal of the ACMdecimal floatingpoint arithmeticacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J401Jack MoshmanThe Generation of PseudoRandom Numbers on a Decimal Calculator
@Article{Moshman:1954:GPR,
author = "Jack Moshman",
title = "The Generation of PseudoRandom Numbers on a Decimal
Calculator",
journal = jJACM,
volume = "1",
number = "2",
pages = "8891",
month = apr,
year = "1954",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Fri Nov 04 00:18:27 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "decimal floatingpoint arithmetic",
}
n¾×nŠfYX #1W57=m;1e1W‹articlefparith.bibParsons:1955:SDCFrances L. ParsonsA Simple DeskCalculator Method for Checking Binary Results of Digital Computer Arithmetic OperationsjJACM23205207jul71955JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Wed Nov 09 01:00:34 1994http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.11.09 01:00:34 ???Journal of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J401Frances L. ParsonsA Simple DeskCalculator Method for Checking Binary Results of Digital Computer Arithmetic Operations
@Article{Parsons:1955:SDC,
author = "Frances L. Parsons",
title = "A Simple DeskCalculator Method for Checking Binary
Results of Digital Computer Arithmetic Operations",
journal = jJACM,
volume = "2",
number = "3",
pages = "205207",
month = jul,
year = "1955",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Wed Nov 09 01:00:34 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}‡dXV #/)=)7;K;9)=‰articlefparith.bibLenaerts:1955:ASRE. H. LenaertsAutomatic Square RootingjELECTRONENG27287289jul71955ELEGAP00134902 OR 00134902Thu Sep 1 10:15:41 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:15:41 ???Electronic EngineeringacknjE. H. LenaertsAutomatic Square Rooting
@Article{Lenaerts:1955:ASR,
author = "E. H. Lenaerts",
title = "Automatic Square Rooting",
journal = jELECTRONENG,
volume = "27",
number = "??",
pages = "287289",
month = jul,
year = "1955",
CODEN = "ELEGAP",
ISSN = "00134902",
bibdate = "Thu Sep 1 10:15:41 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Electronic Engineering",
}ˆ?WX#/U'/!=K;Uˆ_Ñbookfparith.bibHastings:1955:ADCCecil B. Hastings, Jr. and Jeanne T. Hayward and James P. Wong, Jr.Approximations for Digital ComputerspubPRINCETONpubPRINCETON:adrviii + 2011955QA76 .H33Mon Sep 30 14:51:50 1996ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1996.09.30 14:51:50 ???acknjCecil B. {Hastings, Jr.} and Jeanne T. Hayward and James P. {Wong, Jr.}Approximations for Digital Computers
@Book{Hastings:1955:ADC,
author = "Cecil B. {Hastings, Jr.} and Jeanne T. Hayward and
James P. {Wong, Jr.}",
title = "Approximations for Digital Computers",
publisher = pubPRINCETON,
address = pubPRINCETON:adr,
pages = "viii + 201",
year = "1955",
LCCN = "QA76 .H33",
bibdate = "Mon Sep 30 14:51:50 1996",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
}
ƒvrƒå"‰_“?
@Article{McLaughlin:2004:NFM,
author = "Philip B. McLaughlin Jr.",
title = "New frameworks for {Montgomery}'s modular
multiplication method",
journal = jMATHCOMPUT,
volume = "73",
number = "246",
pages = "899906",
month = apr,
year = "2004",
CODEN = "MCMPAF",
ISSN = "00255718 (paper), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Wed Aug 11 08:23Ù†qc
@Article{McKenzie:2004:ACP,
author = "Pierre McKenzie and Heribert Vollmer and Klaus W.
Wagner",
title = "Arithmetic Circuits and Polynomial Replacement
Systems",
journal = jSIAMJCOMPUT,
volume = "33",
number = "6",
pages = "15131531",
month = dec,
year = "2004",
CODEN = "SMJCAT",
ISSN = "00975397 (print), 10957111 (electronic)",
ISSNL = "00975397",
bibdate = "Sat Apr 16 10:19:28 MDT 2005",
bibsource = "http://epubs.siam.org/sambin/dbq/toclist/SICOMP/33/6;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://epubs.siam.org/sambin/dbq/article/39207",
acknowledgement = acknhfb,
fjournal = "SIAM Journal on Computing",
journalURL = "http://epubs.siam.org/sicomp",
}à…Š
@Article{McLellan:1988:DCF,
author = "E. J. McLellan and G. M. Wolrich and R. A. J.
Yodlowski",
title = "Development of the {CVAX} floatingpoint chip",
journal = jDECTECHJ,
volume = "??",
number = "7",
pages = "109120",
month = aug,
year = "1988",
CODEN = "DTJOEL",
ISSN = "0898901X",
bibdate = "Wed Sep 7 22:32:00 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Digital Technical Journal",
}0‡*ŽU
@Article{McKenzie:2000:ACP,
author = "Pierre McKenzie and Heribert Vollmer and Klaus W.
Wagner",
title = "Arithmetic Circuits and Polynomial Replacement
Systems",
journal = jLECTNOTESCOMPSCI,
volume = "1974",
pages = "164??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Fri Feb 1 09:17:23 MST 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t1974.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/1974/19740164.htm;
http://link.springerny.com/link/service/series/0558/papers/1974/19740164.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}†ˆW‘/
@Article{McQuillan:1992:VMH,
author = "S. E. McQuillan and J. V. McCanny",
title = "{VLSI} module for highperformance multiply, square
root and divide",
journal = jIEEPROCCOMPUTDIGITTECH,
volume = "139",
number = "6",
pages = "505510",
month = nov,
year = "1992",
CODEN = "ICDTEA",
ISSN = "13502387 (print), 13597027 (electronic)",
ISSNL = "13502387",
bibdat
\‰’
@Article{McQuillan:1991:HPV,
author = "S. E. McQuillan and J. V. McCanny and R. F. Woods",
title = "High performance {VLSI} architecture for division and
square root",
journal = jELECTLETTERS,
volume = "27",
number = "1",
pages = "1921",
day = "3",
month = jan,
year = "1991",
CODEN = "ELLEAK",
ISSN = "00135194 (print), 1350911X (electronic)",
ISSNL = "
Çá
‹Q\W #+gc;a7Ea;]gcŒcarticlefparith.bibEstrin:1956:NHSG. Estrin and B. Gilchrist and J. H. PomereneA Note on HighSpeed Digital MultiplicationjIRETRANSELECCOMPUTEC53140140sep91956IRELAOhttp://dx.doi.org/10.1109/TEC.1956.521993603679950 OR 03679950Thu Jun 30 15:46:27 MDT 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.06.30 15:46:27 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219936IRE Transactions on Electronic ComputersacknhfbG. Estrin and B. Gilchrist and J. H. PomereneA Note on HighSpeed Digital Multiplication
@Article{Estrin:1956:NHS,
author = "G. Estrin and B. Gilchrist and J. H. Pomerene",
title = "A Note on HighSpeed Digital Multiplication",
journal = jIRETRANSELECCOMPUT,
volume = "EC5",
number = "3",
pages = "140140",
month = sep,
year = "1956",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1956.5219936",
ISSN = "03679950",
bibdate = "Thu Jun 30 15:46:27 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219936",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}‹c[Y #1+;i7Ea;]+ articlefparith.bibRobertson:1955:TCMJ. E. RobertsonTwo's Complement Multiplication in Binary Parallel Digital ComputersjIRETRANSELECCOMPUTEC43118119sep91955IRELAOhttp://dx.doi.org/10.1109/IRETELC.1955.540791103679950 OR 03679950Thu Jun 30 15:10:39 MDT 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.06.30 15:10:39 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5407911IRE Transactions on Electronic ComputersacknhfbJ. E. RobertsonTwo's Complement Multiplication in Binary Parallel Digital Computers
@Article{Robertson:1955:TCM,
author = "J. E. Robertson",
title = "Two's Complement Multiplication in Binary Parallel
Digital Computers",
journal = jIRETRANSELECCOMPUT,
volume = "EC4",
number = "3",
pages = "118119",
month = sep,
year = "1955",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/IRETELC.1955.5407911",
ISSN = "03679950",
bibdate = "Thu Jun 30 15:10:39 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5407911",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}†6ZU #/)a+/'=m;)a†k‘bookfparith.bibRichards:1955:AODR. K. RichardsArithmetic Operations in Digital ComputersD. Van NostrandNew York, NY, USAiv + 3971955QA75 .R5 1955Fri Nov 28 18:46:37 2003http://www.math.utah.edu/pub/tex/bib/fparith.bib2003.11.28 18:46:37 ???acknhfbR. K. RichardsArithmetic Operations in Digital Computers
@Book{Richards:1955:AOD,
author = "R. K. Richards",
title = "Arithmetic Operations in Digital Computers",
publisher = "D. Van Nostrand",
address = "New York, NY, USA",
pages = "iv + 397",
year = "1955",
LCCN = "QA75 .R5 1955",
bibdate = "Fri Nov 28 18:46:37 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}
ÓÃÓ¢_X #)?57=m;Ž1OqeŽ)Gžgarticlefparith.bibPerkins:1956:EPCRobert PerkinsEASIAC, A PseudoComputerjJACM326572apr41956JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Fri Nov 04 23:46:26 1994http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.11.04 23:46:26 ???One of the primary functions of the MIDAC installation at the University of Michigan is the instru\ŠJ^W #//A;a7Ea;]/AŒ articlefparith.bibLilamand:1956:TDMM. Lejet LilamandA TimeDivision MultiplierjIRETRANSELECCOMPUTEC512634mar31956IRELAOhttp://dx.doi.org/10.1109/TEC.1956.521978903679950 OR 03679950Thu Jun 30 15:46:18 MDT 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.06.30 15:46:18 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219789IRE Transactions on Electronic ComputersacknhfbM. Lejet LilamandA TimeDivision Multiplier
@Article{Lilamand:1956:TDM,
author = "M. Lejet Lilamand",
title = "A TimeDivision Multiplier",
journal = jIRETRANSELECCOMPUT,
volume = "EC5",
number = "1",
pages = "2634",
month = mar,
year = "1956",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1956.5219789",
ISSN = "03679950",
bibdate = "Thu Jun 30 15:46:18 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219789",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}‰m]W #3AQ+3E%;u1AQŠ}bookfparith.bibHildebrand:1956:INAFrancis Begnaud HildebrandIntroduction to numerical analysispubMCGRAWHILLpubMCGRAWHILL:adr5111956QA300 .H5Fri Aug 20 09:19:58 MDT 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib; z3950.loc.gov:7090/Voyager2010.08.20 09:19:58 MDTInternational series in pure and applied mathematicsSee also second edition cite Hildebrand:1974:INA,Hildebrand:1987:INA.Numerical analysisacknhfbFrancis Begnaud HildebrandIntroduction to numerical analysis
@Book{Hildebrand:1956:INA,
author = "Francis Begnaud Hildebrand",
title = "Introduction to numerical analysis",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
pages = "511",
year = "1956",
LCCN = "QA300 .H5",
bibdate = "Fri Aug 20 09:19:58 MDT 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
z3950.loc.gov:7090/Voyager",
series = "International series in pure and applied mathematics",
acknowledgement = acknhfb,
remark = "See also second edition
\cite{Hildebrand:1974:INA,Hildebrand:1987:INA}.",
subject = "Numerical analysis",
}ib",
abstract = "One of the primary functions of the MIDAC installation
at the University of Michigan is the instruction of
beginners in the various aspects of digital machine use
including programming and coding. \ldots{} In
conducting these courses it was soon found to be
extremely difficult, in five or six instruction
periods, to bring a complete newcomer up to the point
where he can code and check out on MIDAC anything more
than a rather trivial routine. As might be expected the
difficulty centers around problems of scaling,
instruction modification and binary representation.
\ldots{} To alleviate these problems it was decided
that a new computer was needed: one designed to make
programming easier. At the cost of some of MIDAC's
speed and capacity plus two or three manmonths of
programming time EASIAC, the EASy Instruction Automatic
Computer, was realized as a translationinterpretation
program in MIDAC.",
acknowledgement = acknhfb,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "decimal floatingpoint arithmetic",
remark = "Early example of a decimal floatingpoint machine.",
}_ction of beginners in the various aspects of digital machine use including programming and coding. ldots In conducting these courses it was soon found to be extremely difficult, in five or six instruction periods, to bring a complete newcomer up to the point where he can code and check out on MIDAC anything more than a rather trivial routine. As might be expected the difficulty centers around problems of scaling, instruction modification and binary representation. ldots To alleviate these problems it was decided that a new computer was needed: one designed to make programming easier. At the cost of some of MIDAC's speed and capacity plus two or three manmonths of programming time EASIAC, the EASy Instruction Automatic Computer, was realized as a translationinterpretation program in MIDAC.Journal of the ACMdecimal floatingpoint arithmeticEarly example of a decimal floatingpoint machine.acknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J401One of the primary functions of the MIDAC installation at the University of Michigan is the instruction of beginners in the various aspects of digital machine use including programming and coding. \ldots{} In conducting these courses it was soon found to be extremely difficult, in five or six instruction periods, to bring a complete newcomer up to the point where he can code and check out on MIDAC anything more than a rather trivial routine. As might be expected the difficulty centers around problems of scaling, instruction modification and binary representation. \ldots{} To alleviate these problems it was decided that a new computer was needed: one designed to make programming easier. At the cost of some of MIDAC's speed and capacity plus two or three manmonths of programming time EASIAC, the EASy Instruction Automatic Computer, was realized as a translationinterpretation program in MIDAC.Robert Perkins{EASIAC}, {A} PseudoComputer
@Article{Perkins:1956:EPC,
author = "Robert Perkins",
title = "{EASIAC}, {A} PseudoComputer",
journal = jJACM,
volume = "3",
number = "2",
pages = "6572",
month = apr,
year = "1956",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Fri Nov 04 23:46:26 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "One of the primary functions of the MIDAC installation
at the University of Michigan is the instruction of
beginners in the various aspects of digital machine use
including programming and coding. \ldots{} In
conducting these courses it was soon found to be
extremely difficult, in five or six instruction
periods, to bring a complete newcomer up to the point
where he can code and check out on MIDAC anything more
than a rather trivial routine. As might be expected the
difficulty centers around problems of scaling,
instruction modification and binary representation.
\ldots{} To alleviate these problems it was decided
that a new computer was needed: one designed to make
programming easier. At the cost of some of MIDAC's
speed and capacity plus two or three manmonths of
programming time EASIAC, the EASy Instruction Automatic
Computer, was realized as a translationinterpretation
program in MIDAC.",
acknowledgement = acknhfb,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "decimal floatingpoint arithmetic",
remark = "Early example of a decimal floatingpoint machine.",
}
F`FŒbY#+k;a7Ea;]k%articlefparith.bibSydnor:1956:AMSR. L. Sydnor and T. R. O'Meara and J. StrathmanAnalog Multipliers and Squarers Using a Multigrid ModulatorjIRETRANSELECCOMPUTEC528285jun61956IRELAOhttp://dx.doi.org/10.1109/TEC.1956.521980403679950 OR 03679950Thu Jun 30 15:46:21 MDT 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.06.30 15:46:21 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219804IRE Transactions on Electronic ComputersacknhfbR. L. Sydnor and T. R. O'Meara and J. StrathmanAnalog Multipliers and Squarers Using a Multigrid Modulator
@Article{Sydnor:1956:AMS,
author = "R. L. Sydnor and T. R. O'Meara and J. Strathman",
title = "Analog Multipliers and Squarers Using a Multigrid
Modulator",
journal = jIRETRANSELECCOMPUT,
volume = "EC5",
number = "2",
pages = "8285",
month = jun,
year = "1956",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1956.5219804",
ISSN = "03679950",
bibdate = "Thu Jun 30 15:46:21 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219804",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}‡8aV#)W;=m;MW;‡{
articlefparith.bibStegun:1956:PCIrene A. Stegun and Milton AbramowitzPitfalls in computationJournal of the Society for Industrial and Applied Mathematics42072191956Tue Aug 28 06:16:28 2001http://www.math.utah.edu/pub/tex/bib/fparith.bib2001.08.28 06:16:28 ???Cited in cite Sterbenz:1974:FPC.acknhfbIrene A. Stegun and Milton AbramowitzPitfalls in computation
@Article{Stegun:1956:PC,
author = "Irene A. Stegun and Milton Abramowitz",
title = "Pitfalls in computation",
journal = "Journal of the Society for Industrial and Applied
Mathematics",
volume = "4",
pages = "207219",
year = "1956",
bibdate = "Tue Aug 28 06:16:28 2001",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}‡b`U #1+[;7=m;]+[ˆ_ articlefparith.bibRobertson:1956:NCDJ. E. RobertsonA new class of digital division methodsjIRETRANSELECCOMPUTEC56573jun61956IRELAO03679950 OR 03679950Fri Nov 09 19:14:45 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.11.09 19:14:45 ???IRE Transactions on Electronic ComputersacknhfbJ. E. RobertsonA new class of digital division methods
@Article{Robertson:1956:NCD,
author = "J. E. Robertson",
title = "A new class of digital division methods",
journal = jIRETRANSELECCOMPUT,
volume = "EC5",
number = "??",
pages = "6573",
month = jun,
year = "1956",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Fri Nov 09 19:14:45 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
úbÈ+éú‡aC
@Article{Shenoy:1989:FBE,
author = "A. P. Shenoy and R. Kumaresan",
title = "Fast base extens‡kW
@Article{Shen:1984:DET,
author = "J. P. Shen and F. J. Ferguson",
title = "The Design of Easily Testable {VLSI} Array
Multipliers",
journal = jIEEETRANSCOMPUT,
volume = "C33",
number = "6",
pages = "554560",
month = jun,
year = "1984",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1984.1676480",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNs„@‰
@Article{Shen:1978:CSA,
author = "D. T. Shen and A. Weinberger",
title = "42 carrysave adder implementation using send
circuits",
journal = jIBMTDB,
volume = "20",
number = "9",
pages = "????",
month = feb,
year = "1978",
CODEN = "IBMTAA",
ISSN = "00188689",
bibdate = "Mon Dec 24 10:18:16 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IBM Technical Disclosure Bulletin",
}$‡Ž7
@Article{Shea:1973:NDN,
author = "Dale D. Shea",
title = "On the Number of Divisions Needed in Finding the
Greatest Common Divisor",
journal = jFIBQUART,
volume = "11",
number = "5",
pages = "508510",
month = dec,
year = "1973",
CODEN = "FIBQAU",
ISSN = "00150517",
ISSNL = "00150517",
bibdate = "Thu Oct 20 17:58:46 MDT 2011",
bibsource = "http://www.fq.math.ca/115.html;
http://www.math.utah.edu/pub/tex/bib/fibquart.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.fq.math.ca/Scanned/115/shea.pdf",
acknowledgement = acknhfb,
ajournal = "Fib. Quart",
fjournal = "The Fibonacci Quarterly. Official Organ of the
Fibonacci Association",
journalURL = "http://www.fq.math.ca/",
}Á‡Ž1
@Article{Shea:1969:NDN,
author = "Dale D. Shea",
title = "On the Number of Divisions Needed in Finding the
Greatest Common Divisor",
journal = jFIBQUART,
volume = "7",
number = "4",
pages = "337340",
month = nov,
year = "1969",
CODEN = "FIBQAU",
ISSN = "00150517",
ISSNL = "00150517",
bibdate = "Thu Oct 20 18:05:19 MDT 2011",
bibsource = "http://www.fq.math.ca/74.html;
http://www.math.utah.edu/pub/tex/bib/fibquart.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.fq.math.ca/Scanned/74/shea.pdf",
acknowledgement = acknhfb,
ajournal = "Fib. Quart",
fjournal = "The Fibonacci Quarterly. Official Organ of the
Fibonacci Association",
journalURL = "http://www.fq.math.ca/",
}Ó‡Ž9
@Article{Shary:1999:OEG,
author = "S. P. Shary",
title = "Outer Estimation of Generalized Solution Sets to
Interval Linear Systems",
journal = jRELIABLECOMPUTING,
volume = "5",
number = "3",
pages = "323335",
year = "1999",
CODEN = "RCOMF8",
ISSN = "13853139 (print), 15731340 (electronic)",
ISSNL = "13853139",
bibdate = "Mon May 20 06:37:48 MDT 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib; OCLC
Proceedings database",
acknowledgement = acknhfb,
fjournal = "Reliable Computing = Nadezhnye vychisleniia",
journalURL = "http://link.springer.com/journal/11155",
remark = "Papers from Scientific computing, computer arithmetic
and validated numerics (SCAN '98), September 1998,
Budapest, Hungary.",
}
Z³ZŒVdX#+IO57=m;M1SeIQSarticlefparith.bibErcoli:1957:EDOPaolo Ercoli and Roberto VaccaErrors Due to Overflow in Arithmetic Operations Particularly as Regards FINAC Electronic ComputerjJACM44450455oct101957JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Thu Dec 08 09:28:48 2005http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.12.08 09:28:48 ???See letter cite Ercoli:1960:LEE.Journal of the ACMfloatingpoint arithmetic; overflowacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J401Paolo Ercoli and Roberto VaccaSee letter \cite{Ercoli:1960:LEE}.Errors Due to Overflow in Arithmetic Operations Particularly as Regards {FINAC} Electronic Computer
@Article{Ercoli:1957:EDO,
author = "Paolo Ercoli and Roberto Vacca",
title = "Errors Due to Overflow in Arithmetic Operations
Particularly as Regards {FINAC} Electronic Computer",
journal = jJACM,
volume = "4",
number = "4",
pages = "450455",
month = oct,
year = "1957",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Thu Dec 08 09:28:48 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See letter \cite{Ercoli:1960:LEE}.",
acknowledgement = acknhfb,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "floatingpoint arithmetic; overflow",
}ˆJcU#3Gw;7=m;]Gw‰; articlefparith.bibWeinberger:1956:OMAA. Weinberger and J. L. SmithA OneMicrosecond Adder Using OneMegacycle CircuitryjIRETRANSELECCOMPUTEC56573jun61956IRELAO03679950 OR 03679950Fri Nov 09 19:38:57 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.11.09 19:38:57 ???IRE Transactions on Electronic ComputersacknhfbA. Weinberger and J. L. SmithA OneMicrosecond Adder Using OneMegacycle Circuitry
@Article{Weinberger:1956:OMA,
author = "A. Weinberger and J. L. Smith",
title = "A OneMicrosecond Adder Using OneMegacycle
Circuitry",
journal = jIRETRANSELECCOMPUT,
volume = "EC5",
number = "??",
pages = "6573",
month = jun,
year = "1956",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Fri Nov 09 19:38:57 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
!´´~2ýx†U+
@Article{Monahan:1987:AGC,
author = "John F. Monahan",
title = "An Algorithm for Generating Chi Random Variables",
…H‹
@Article{Mohn:1976:IPA,
author = "K. Mohn and R. V. Roman",
title = "An interactive polynomial approximation algorithm",
journal = jCOMPJ,
volume = "19",
number = "1",
pages = "7478",
month = feb,
year = "1976",
CODEN = "CMPJA6",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Thu Sep 15 18:39:43 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}x…2Še
@Article{Moler:1967:IRF,
author = "C. B. Moler",
title = "Iterative Refinement in Floating Point",
journal = jJACM,
volume = "14",
number = "2",
pages = "316321",
month = apr,
year = "1967",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Tue Nov 1 09:43:17 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "ir, nla, lud, iterative refinement",
}Š•w«o
@Article{Moler:1983:RSR,
author = "Cleve B. Moler and Donald Morrison",
title = "Replacing Square Roots by {Pythagorean} Sums",
journal = jIBMJRD,
volume = "27",
number = "6",
pages = "577581",
month = nov,
year = "1983",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Thu Sep 1 10:15:41 1994",
bibsource = "ftp://garÞÜ+
@Article{Monahan:1987:AGC,
author = "John F. Monahan",
title = "An Algorithm for Generating Chi Random Variables",
…H‹
@Article{Mohn:1976:IPA,
author = "K. Mohn and R. V. Roman",
ti„y‰s
@Article{Moler:1995:TTN,
author = "Cleve B. Moler",
title = "A tale of two numbers",
journal = jSIAMNEWS,
volume = "28",
number = "1",
pages = "1616",
day = "1",
month = jan,
year = "1995",
ISSN = "00361437",
bibdate = "Wed Nov 13 07:16:43 1996",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/molercleveb.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Discusses the Intel Pentium chip divide flaw.",
acknowledgement = acknhfb,
fjournal = "SIAM News",
}¾…Š/
@Article{Moller:1965:NQD,
author = "Ole M{\o}ller",
title = "Note on Quasi DoublePrecision",
journal = jNORDISKTIDSKRINFORMBEHAND,
volume = "5",
number = "4",
pages = "251255",
year = "1965",
CODEN = "BITTEL, NBITAB",
ISSN = "00063835 (print), 15729125 (electronic)",
ISSNL = "00063835",
bibdate = "Sat Nov 14 09:14:57 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Moller:1965:QDP}.",
acknowledgement = acknj # " and " # acknhfb,
journalURL = "http://link.springer.com/journal/10543",
};‡m[
@Article{Moharir:1985:ESG,
author = "P. S. Moharir",
title = "Extending the Scope of {Golub}'s Method Beyond Complex
Multiplication",
journal = jIEEETRANSCOMPUT,
volume = "C34",
number = "5",
pages = "484487",
month = may,
year = "1985",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1985.1676590",
ISSN = "00189340 (print), 15579956 (electronic)",
IS
J
ˆJŠ;fX #+%‚=m;s%‚Šwarticlefparith.bibHerzel:1957:SDDAmato HerzelSulla distribuzione della cifre iniziali dei numeri statistici. (Italian) [On the frequency of initial digits of statistical numbers]Atti dell XV e XVII Riunione, Societa Italiana di Statistica????1957Sun Sep 18 12:00:07 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib2011.09.18 12:00:07 ???Benford's Law; Law of Anomalous Numbers; Zipf's LawItalianacknhfbAmato HerzelSulla distribuzione della cifre iniziali dei numeri statistici. ({Italian}) [{On} the frequency of initial digits of statistical numbers]
@Article{Herzel:1957:SDD,
author = "Amato Herzel",
title = "Sulla distribuzione della cifre iniziali dei numeri
statistici. ({Italian}) [{On} the frequency of initial
digits of statistical numbers]",
journal = "Atti dell XV e XVII Riunione, Societa Italiana di
Statistica",
volume = "??",
number = "??",
pages = "????",
year = "1957",
bibdate = "Sun Sep 18 12:00:07 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
language = "Italian",
}ŠueW #'%‚C=m;cs%c‚‹%articlefparith.bibGini:1957:SFDCorrado GiniSulla frequenza delle cifre iniziali dei numeri osservati. (Italian) [On the frequency of initial digits of observed numbers]Bull. Inst. Internat. Stat.3557761957Sun Sep 18 11:54:25 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib2011.09.18 11:54:25 ???29th session, 2nd delivery, Rio de Janerio.Benford's Law; Law of Anomalous Numbers; Zipf's LawItalianacknhfbCorrado Gini29th session, 2nd delivery, Rio de Janerio.Sulla frequenza delle cifre iniziali dei numeri osservati. (Italian) [{On} the frequency of initial digits of observed numbers]
@Article{Gini:1957:SFD,
author = "Corrado Gini",
title = "Sulla frequenza delle cifre iniziali dei numeri
osservati. (Italian) [{On} the frequency of initial
digits of observed numbers]",
journal = "Bull. Inst. Internat. Stat.",
volume = "35",
number = "??",
pages = "5776",
year = "1957",
bibdate = "Sun Sep 18 11:54:25 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "29th session, 2nd delivery, Rio de Janerio.",
URL = "",
acknowledgement = acknhfb,
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
language = "Italian",
}
ðŠ]hW #//K;a7Ea;]/KŒarticlefparith.bibKalbfell:1957:EAMDavid C. KalbfellAn Electronic Analog MultiplierjIRETRANSELECCOMPUTEC62100103jun61957IRELAOhttp://dx.doi.org/10.1109/TEC.1957.522157903679950 OR 03679950Thu Jun 30 16:07:27 MDT 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.06.30 16:07:27 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5221579IRE Transactions on Electronic ComputersacknhfbDavid C. KalbfellAn Electronic Analog Multiplier
@Article{Kalbfell:1957:EAM,
author = "David C. Kalbfell",
title = "An Electronic Analog Multiplier",
journal = jIRETRANSELECCOMPUT,
volume = "EC6",
number = "2",
pages = "100103",
month = jun,
year = "1957",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1957.5221579",
ISSN = "03679950",
bibdate = "Thu Jun 30 16:07:27 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5221579",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}Œ
gY#'E%;a7Ea;]E%articlefparith.bibHowe:1957:TRAR. M. Howe and E. G. GilbertTrigonometric Resolution in Analog Computers by Means of Multiplier ElementsjIRETRANSELECCOMPUTEC628692jun61957IRELAOhttp://dx.doi.org/10.1109/TEC.1957.522157603679950 OR 03679950Thu Jun 30 16:07:27 MDT 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.06.30 16:07:27 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5221576IRE Transactions on Electronic ComputersacknhfbR. M. Howe and E. G. GilbertTrigonometric Resolution in Analog Computers by Means of Multiplier Elements
@Article{Howe:1957:TRA,
author = "R. M. Howe and E. G. Gilbert",
title = "Trigonometric Resolution in Analog Computers by Means
of Multiplier Elements",
journal = jIRETRANSELECCOMPUT,
volume = "EC6",
number = "2",
pages = "8692",
month = jun,
year = "1957",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1957.5221576",
ISSN = "03679950",
bibdate = "Thu Jun 30 16:07:27 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5221576",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
º
ºŠGjW #+O;a7Ea;]OŒarticlefparith.bibLehman:1957:HSDM. LehmanHighSpeed Digital MultiplicationjIRETRANSELECCOMPUTEC63204205sep91957IRELAOhttp://dx.doi.org/10.1109/TEC.1957.522202503679950 OR 03679950Thu Jun 30 16:07:34 MDT 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.06.30 16:07:34 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5222025IRE Transactions on Electronic ComputersacknhfbM. LehmanHighSpeed Digital Multiplication
@Article{Lehman:1957:HSD,
author = "M. Lehman",
title = "HighSpeed Digital Multiplication",
journal = jIRETRANSELECCOMPUT,
volume = "EC6",
number = "3",
pages = "204205",
month = sep,
year = "1957",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1957.5222025",
ISSN = "03679950",
bibdate = "Thu Jun 30 16:07:34 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5222025",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}‹yiZ #71/57=K;[13Œcarticlefparith.bibKogbetliantz:1957:CENE. G. KogbetliantzComputation of $ e^n $ for $  infty < n < + infty $ Using an Electronic ComputerjIBMJRD12110115apr41957IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Tue Sep 06 18:04:49 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.06 18:04:49 ???IBM Journal of Research and Developmentacknjhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520E. G. KogbetliantzComputation of $ e^n $ for $  \infty < n < + \infty $ Using an Electronic Computer
@Article{Kogbetliantz:1957:CEN,
author = "E. G. Kogbetliantz",
title = "Computation of $ e^n $ for $  \infty < n < + \infty $
Using an Electronic Computer",
journal = jIBMJRD,
volume = "1",
number = "2",
pages = "110115",
month = apr,
year = "1957",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Sep 06 18:04:49 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
{0{‹2lX !#)Cs+=m;‚cCŒ+techreportfparith.bibMetze:1957:SPOG. MetzeA Study of Parallel One's Complement Arithmetic Units with Separate Carry or Borrow StorageReport81Digital Computer Laboratory, University of IllinoisUrbana, IL, USA771957Thu Nov 18 09:07:07 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.11.18 09:07:07 ???Flores' book cite [p. 485]Flores:1963:LCA cites this report, and says that its conclusion is that the disadvantages of one's complement arithmetic outweigh the advantages.acknhfbG. MetzeA Study of Parallel One's Complement Arithmetic Units with Separate Carry or Borrow Storage
@TechReport{Metze:1957:SPO,
author = "G. Metze",
title = "A Study of Parallel One's Complement Arithmetic Units
with Separate Carry or Borrow Storage",
type = "Report",
number = "81",
institution = "Digital Computer Laboratory, University of Illinois",
address = "Urbana, IL, USA",
pages = "77",
year = "1957",
bibdate = "Thu Nov 18 09:07:07 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
remark = "Flores' book \cite[p. 485]{Flores:1963:LCA} cites this
report, and says that its conclusion is that the
disadvantages of one's complement arithmetic outweigh
the advantages.",
}‰MkV #'!mK7;K;o=!y‹articlefparith.bibLuke:1957:CLZY. L. LukeOn the Computation of $ log Z $ and $ arctan Z $jMATHTABLESOTHERAIDSCOMPUT1116181957MTTCAS08916837 OR 08916837Thu Sep 1 10:16:09 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:16:09 ???Mathematical Tables and Other Aids to Computationacknjhttp://www.ams.org/mcom/Y. L. LukeOn the Computation of $ \log {Z} $ and $ \arctan {Z} $
@Article{Luke:1957:CLZ,
author = "Y. L. Luke",
title = "On the Computation of $ \log {Z} $ and $ \arctan {Z}
$",
journal = jMATHTABLESOTHERAIDSCOMPUT,
volume = "11",
number = "??",
pages = "1618",
month = "????",
year = "1957",
CODEN = "MTTCAS",
ISSN = "08916837",
bibdate = "Thu Sep 1 10:16:09 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Mathematical Tables and Other Aids to Computation",
journalURL = "http://www.ams.org/mcom/",
}umber = "18,939d",
bibdate = "Tue Sep 11 15:35:33 MDT 2012",
bibsource = "http://ieeexplore.ieee.org/servlet/opac?punumber=5288520;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5392735;
http://www.research.ibm.com/journal/rd/012/ibmrd0102G.pdf",
abstract = "It is hypothesized that positive numbers suffice for
the expression of quantities in accounting. New
arithmetic operations are devised that yield
nonnegative results in computation, and the
applicability of these operations to data processing is
studied. These operations permit a wide variety of
functions to be computed with fewer and less complex
steps and imply the feasibility of constructing less
complex dataprocessing machines.",
acknowledgement = acknhfb,
bookURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
reviewer = "C. C. Gotlieb",
}m
8žž
bÃI‡zu
@Article{Page:2004:PCA,
author = "D. Page and N. P. Smart",
title = "Parallel cryptographic arithmetic using a redundant
{Montgomery} representation",
journal = jIEEETRANSCOMPUT,
volume = "53",
number = "11",
pages = "14741482",
month = nov,
year = "2004",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2004.100",
ISSN = "00189340 (print), 15579956 (elecî…:Šu
@Article{Paliouras:1999:MAR,
author = "V. Paliouras and T. Stouraitis",
title = "Multifunction Architectures for {RNS} Processors",
journal = jIEEETRANSCIRCUITSSYST,
volume = "46",
number = "8",
pages = "10411054",
month = aug,
year = "1999",
CODEN = "ICSYBT",
ISSN = "00984094 (print), 15581276 (electronic)",
ISSNL = "00984094",
bibdate = "Fri Jun 24 18:26:56 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Circuits and Systems",
keywords = "Residue Number System (RNS)",
}ø“W§/
@Article{Palmore:1990:CAC,
author = "J. Palmore and C. Herring",
title = "Computer arithmetic, chaos and fractals",
journal = jPHYSICAD,
volume = "42",
number = "13",
pages = "99110",
month = jun,
year = "1990",
CODEN = "PDNPDT",
ISSN = "01672789 (print), 18728022 (electronic)",
ISSNL = "01672789",
bibdate = "Tue Dec 12 09:17:24 MST 1995",
bibsource = "http://www.ma’ ²‹q
@Article{Padegs:1968:SAS,
author = "A. Padegs",
title = "Structural aspects of the {SYSTEM\slash 360 Model 85},
Š)”S
@Article{Paliouras:2000:FPP,
author = "V. Paliouras and K. Karagianni and T. Stouraitis",
title = "A floatingpoint processor for fast and accurate
sine\slash cosine evaluation",
journal = jIEEETRANSCIRCUITSSYST2,
volume = "47",
number = "5",
pages = "441451",
month = may,
year = "2000",
CODEN = "ICSPE5",
DOI = "http://dx.doi.org/10.1109/82.842112",
ISSN = "10©°[
@Article{Paker:1971:BFP,
author = "Y. Paker",
title = "A Binary FloatingPoint Resistor",
journal = jIEEETRANSCOMPUT,
volume = "C20",‡Ž[
@Article{Paker:1971:BFP,
author = "Y. Paker",
title = "A Binary FloatingPoint Resistor",
journal = jIEEETRANSCOMPUT,
volume = "C20",
number = "1",
pages = "711",
month = jan,
year = "1971",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1971.223074",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Wed Jul 13 06:38:11 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1671667",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}<Š\•9
@Article{Paliouras:2000:NHR,
author = "V. Paliouras and T. Stouraitis",
title = "Novel highradix residue number system architectures",
journal = jIEEETRANSCIRCUITSSYST2,
volume = "47",
number = "10",
pages = "10591073",
month = oct,
year = "2000",
CODEN = "ICSPE5",
DOI = "http://dx.doi.org/10.1109/82.877147",
ISSN = "10577130 (print), 1558125X (electronic)",
ISSNL = ¬=ì
Mè0=tˆ={
@Article{Ardalan:1986:FPE,
author = "S. Ardalan",
title = "Floatingpoint error analysis of recursive
leastsquares and leastmeansquares adaptive filters",
journal = jIEEETRANSCIRCUITSSYST,
volume = "33",
number = "12",
pages = "11921208",
month = dec,
year = "1986",
CODEN = "ICSYBT",
ISSN = "00984094 (print), 15581276 (electronic)",
ISSNL = "00984094",
bi]ß‡2Že
@Article{Antelo:2012:GEI,
author = "Elisardo Antelo and David Hough and Paolo Ienne",
title = "{Guest Editors}' Introduction: Special Section on
Computer Arithmetic",
journal = jIEEETRANSCOMPUT,
volume = "61",
number = "8",
pages = "10571058",
month = aug,
year = "2012",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2012.153",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Fri Jul 27 08:30:49 2012",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
¸†_?
@Article{Anonymous:2009:CPC,
author = "Anonymous",
title = "CallforPapers on Computer Arithmetic",
journal = jIEEETRANSCOMPUT,
volume = "58",
number = "5",
pages = "719719",
month = may,
year = "2009",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2009.47",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Mon Jul 4 11:37:41 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}â1„J‰
@Article{Anonymous:1996:IBT,
author = "Anonymous",
title = "Inquiry Board Traces {Ariane 5} Failure to Overflow
Error",
journal = jSIAMNEWS,
volume = "29",
number = "8",
pages = "1, 12, 13",
month = oct,
year = "1996",
ISSN = "00361437",
bibdate = "Sat Apr 28 18:48:53 2001",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.siam.org/siamnews/general/ariane.htm",
acknowledgement = acknhfb,
fjournal = "SIAM News",
}úò„]‰;
@Article{Anonymous:1994:SCSa,
author = "Anonymous",
title = "Single chip supercomputer: Vector processing is key to
high performance in floating point calculations",
journal = "New electronics",
volume = "27",
number = "4",
pages = "7??",
day = "1",
month = apr,
year = "1994",
ISSN = "00479624",
bibdate = "Fri Aug 23 08:32:16 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
UnCover library database",
acknowledgement = acknhfb,
}Å
llm\ #+%oU57Eƒ;‚†w['†w%o'
articlefparith.bibMurphy:1957:PIAR. W. MurphyA PositiveInteger Arithmetic for Data ProcessingjIBMJRD12158170apr41957IBMJAEhttp://dx.doi.org/10.1147/rd.12.015800188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 0018864668.0X18,939dTue Sep 11 15:35:33 MDT 2012http://ieeexplore.ieee.org/servlet/opac?punumber=5288520; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/2012.09.11 15:35:33 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5392735; http://www.research.ibm.com/journal/rd/012/ibmrd0102G.pdfIt is hypothesized that positive numbers suffice for the expression of quantities in accounting. New arithmetic operations are devised that yield nonnegative results in computation, and the applicability of these operations to data processing is studied. These operations permit a wide variety of functions to be computed with fewer and less complex steps and imply the feasibility of constructing less complex dataprocessing machines.IBM Journal of Research and Developmentacknhfbhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520C. C. GotliebIt is hypothesized that positive numbers suffice for the expression of quantities in accounting. New arithmetic operations are devised that yield nonnegative results in computation, and the applicability of these operations to data processing is studied. These operations permit a wide variety of functions to be computed with fewer and less complex steps and imply the feasibility of constructing less complex dataprocessing machines.R. W. MurphyA PositiveInteger Arithmetic for Data Processing
@Article{Murphy:1957:PIA,
author = "R. W. Murphy",
title = "A PositiveInteger Arithmetic for Data Processing",
journal = jIBMJRD,
volume = "1",
number = "2",
pages = "158170",
month = apr,
year = "1957",
CODEN = "IBMJAE",
DOI = "http://dx.doi.org/10.1147/rd.12.0158",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
MRclass = "68.0X",
MRnumber = "18,939d",
bibdate = "Tue Sep 11 15:35:33 MDT 2012",
bibsource = "http://ieeexplore.ieee.org/servlet/opac?punumber=5288520;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5392735;
http://www.research.ibm.com/journal/rd/012/ibmrd0102G.pdf",
abstract = "It is hypothesized that positive numbers suffice for
the expression of quantities in accounting. New
arithmetic operations are devised that yield
nonnegative results in computation, and the
applicability of these operations to data processing is
studied. These operations permit a wide variety of
functions to be computed with fewer and less complex
steps and imply the feasibility of constructing less
complex dataprocessing machines.",
acknowledgement = acknhfb,
bookURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
reviewer = "C. C. Gotlieb",
}
<<‡]pU #)#E;7=m;]'#Eˆarticlefparith.bibWadel:1957:NBNL. B. WadelNegative base number systemsjIRETRANSELECCOMPUTEC6123??jun61957IRELAO03679950 OR 03679950Thu Nov 06 05:53:55 2014http://www.math.utah.edu/pub/tex/bib/fparith.bib2014.11.06 05:53:55 ???IRE Transactions on Electronic Computersnegative baseacknhfbL. B. WadelNegative base number systems
@Article{Wadel:1957:NBN,
author = "L. B. Wadel",
title = "Negative base number systems",
journal = jIRETRANSELECCOMPUT,
volume = "EC6",
number = "??",
pages = "123??",
month = jun,
year = "1957",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Thu Nov 06 05:53:55 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
keywords = "negative base",
}poZ !#++‚u/Em;‚E7‚+‚mtechreportfparith.bibTaylor:1957:CCAW. Bruce TaylorCOIN (CompileInterpreter): an automatic programming, fixed and floatingpoint library of subroutines for the ERA 1103 computerOperations Research Office, Johns Hopkins UniversityBethesda, MD, USA431957Sat Feb 24 15:01:45 MST 1996http://www.math.utah.edu/pub/tex/bib/fparith.bib1996.02.24 15:01:45 MSTStaff paper / Johns Hopkins University, Operations Research Office; OROSP32 Staff paper (Johns Hopkins University. Operations Research Office); OROSP32.Military art and science  Data processing.; Military research  Data processing.Cover title. ``Operating under contract with the Department of the Army.'' ``Project COMPLAB.'' ``October 1957.'' OROSP32acknhfbW. Bruce Taylor{COIN} (CompileInterpreter): an automatic programming, fixed and floatingpoint library of subroutines for the {ERA} 1103 computer
@TechReport{Taylor:1957:CCA,
author = "W. Bruce Taylor",
title = "{COIN} (CompileInterpreter): an automatic
programming, fixed and floatingpoint library of
subroutines for the {ERA} 1103 computer",
institution = "Operations Research Office, Johns Hopkins University",
address = "Bethesda, MD, USA",
pages = "43",
year = "1957",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
series = "Staff paper / Johns Hopkins University, Operations
Research Office; OROSP32 Staff paper (Johns Hopkins
University. Operations Research Office); OROSP32.",
acknowledgement = acknhfb,
keywords = "Military art and science  Data processing.;
Military research  Data processing.",
remark = "Cover title. ``Operating under contract with the
Department of the Army.'' ``Project COMPLAB.''
``October 1957.'' OROSP32",
}‡nnW #+/Y=m;'/ˆAarticlefparith.bibPawlak:1957:UENZ. PawlakUse of expansions with a negative basis in the arithmometer of a digital computerBull. Acad. Pol. Sci., Ser. Sci. Tech.52322361957Thu Nov 06 05:56:32 2014http://www.math.utah.edu/pub/tex/bib/fparith.bib2014.11.06 05:56:32 ???negative baseacknhfbZ. PawlakUse of expansions with a negative basis in the arithmometer of a digital computer
@Article{Pawlak:1957:UEN,
author = "Z. Pawlak",
title = "Use of expansions with a negative basis in the
arithmometer of a digital computer",
journal = "Bull. Acad. Pol. Sci., Ser. Sci. Tech.",
volume = "5",
number = "??",
pages = "232236",
month = "????",
year = "1957",
bibdate = "Thu Nov 06 05:56:32 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "negative base",
}www.math.utah.edu/pub/tex/bib/fparith.bib",
series = "Staff paper / Johns Hopkins University, Operations
Research Office; OROSP32 Staff paper (Johns Hopkins
University. Operations Research Office); OROSP32.",
acknowledgement = acknhfb,
keywords = "Military art and science  Data processing.;
Military research  Data processing.",
remark = "Cover title. ``Operating under contract with the
Department of the Army.'' ``Project COMPLAB.''
``October 1957.'' OROSP32",
}oic)",
ISSNL = "00188646",
bibdate = "Tue Sep 11 15:35:35 MDT 2012",
bibsource = "http://ieeexplore.ieee.org/servlet/opac?punumber=5288520;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5392687;
http://www.research.ibm.com/journal/rd/013/ibmrd0103H.pdf",
abstract = "An experimental 50megacycle arithmetic unit has been
built which performs a repetitive multiplication
program and checks the results for errors. The unit
uses pulse circuitry which has been developed to
perform digital operations at a 50megacycle
pulserepetition rate. This paper describes the
arithmetic system and the circuits which perform the
required functions. These circuits include a full
binary adder, a phaselocked frequency divider which
provides a 3.125megacycle secondary timing source, a
reshaping and retiming circuit using germanium diodes
and capacitive storage, a highspeed shift register, a
highspeed indicator register, and a binary word
generator.\par
Various novel features of a digital system operating at
these high speeds are described. These include the use
of coaxial delay lines for the distribution of signals
and as storage elements, and the use of secondary
emission tubes in amplifier and multivibrator
circuits.\par
In a 50megacycle system the interdependence of the
space and time dimensions is marked, and although this
introduces problems which are not ordinarily
encountered in computing systems, it may be used
advantageously to provide features such as the
variablephase clock system used in the arithmetic
unit.\par
The performance and reliability of the arithmetic unit
are discussed as well as the reliability of the
components and circuits which make up the system.
Although the techniques and circuitry discussed here
have been applied only to a relatively simple
arithmetic unit, it is felt that they could be useful
in a variety of highspeed computing and measurements
applications.",
acknowledgement = acknhfb,
bookURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}q used advantageously to provide features such as the variablephase clock system used in the arithmetic unit.\par The performance and reliability of the arithmetic unit are discussed as well as the reliability of the components and circuits which make up the system. Although the techniques and circuitry discussed here have been applied only to a relatively simple arithmetic unit, it is felt that they could be useful in a variety of highspeed computing and measurements applications.R. M. Walker and D. E. Rosenheim and P. A. Lewis and A. G. AndersonAn Experimental 50Megacycle Arithmetic Unit
@Article{Walker:1957:EMA,
author = "R. M. Walker and D. E. Rosenheim and P. A. Lewis and
A. G. Anderson",
title = "An Experimental 50Megacycle Arithmetic Unit",
journal = jIBMJRD,
volume = "1",
number = "3",
pages = "257278",
month = jul,
year = "1957",
CODEN = "IBMJAE",
DOI = "http://dx.doi.org/10.1147/rd.13.0257",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Sep 11 15:35:35 MDT 2012",
bibsource = "http://ieeexplore.ieee.org/servlet/opac?punumber=5288520;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5392687;
http://www.research.ibm.com/journal/rd/013/ibmrd0103H.pdf",
abstract = "An experimental 50megacycle arithmetic unit has been
built which performs a repetitive multiplication
program and checks the results for errors. The unit
uses pulse circuitry which has been developed to
perform digital operations at a 50megacycle
pulserepetition rate. This paper describes the
arithmetic system and the circuits which perform the
required functions. These circuits include a full
binary adder, a phaselocked frequency divider which
provides a 3.125megacycle secondary timing source, a
reshaping and retiming circuit using germanium diodes
and capacitive storage, a highspeed shift register, a
highspeed indicator register, and a binary word
generator.\par
Various novel features of a digital system operating at
these high speeds are described. These include the use
of coaxial delay lines for the distribution of signals
and as storage elements, and the use of secondary
emission tubes in amplifier and multivibrator
circuits.\par
In a 50megacycle system the interdependence of the
space and time dimensions is marked, and although this
introduces problems which are not ordinarily
encountered in computing systems, it may be used
advantageously to provide features such as the
variablephase clock system used in the arithmetic
unit.\par
The performance and reliability of the arithmetic unit
are discussed as well as the reliability of the
components and circuits which make up the system.
Although the techniques and circuitry discussed here
have been applied only to a relatively simple
arithmetic unit, it is felt that they could be useful
in a variety of highspeed computing and measurements
applications.",
acknowledgement = acknhfb,
bookURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
^^½q^#+eU57Eƒ;‚™S[™Ye¶Yarticlefparith.bibWalker:1957:EMAR. M. Walker and D. E. Rosenheim and P. A. Lewis and A. G. AndersonAn Experimental 50Megacycle Arithmetic UnitjIBMJRD13257278jul71957IBMJAEhttp://dx.doi.org/10.1147/rd.13.025700188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Tue Sep 11 15:35:35 MDT 2012http://ieeexplore.ieee.org/servlet/opac?punumber=5288520; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/2012.09.11 15:35:35 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5392687; http://www.research.ibm.com/journal/rd/013/ibmrd0103H.pdfAn experimental 50megacycle arithmetic unit has been built which performs a repetitive multiplication program and checks the results for errors. The unit uses pulse circuitry which has been developed to perform digital operations at a 50megacycle pulserepetition rate. This paper describes the arithmetic system and the circuits which perform the required functions. These circuits include a full binary adder, a phaselocked frequency divider which provides a 3.125megacycle secondary timing source, a reshaping and retiming circuit using germanium diodes and capacitive storage, a highspeed shift register, a highspeed indicator register, and a binary word generator.par Various novel features of a digital system operating at these high speeds are described. These include the use of coaxial delay lines for the distribution of signals and as storage elements, and the use of secondary emission tubes in amplifier and multivibrator circuits.par In a 50megacycle system the interdependence of the space and time dimensions is marked, and although this introduces problems which are not ordinarily encountered in computing systems, it may be used advantageously to provide features such as the variablephase clock system used in the arithmetic unit.par The performance and reliability of the arithmetic unit are discussed as well as the reliability of the components and circuits which make up the system. Although the techniques and circuitry discussed here have been applied only to a relatively simple arithmetic unit, it is felt that they could be useful in a variety of highspeed computing and measurements applications.IBM Journal of Research and Developmentacknhfbhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520An experimental 50megacycle arithmetic unit has been built which performs a repetitive multiplication program and checks the results for errors. The unit uses pulse circuitry which has been developed to perform digital operations at a 50megacycle pulserepetition rate. This paper describes the arithmetic system and the circuits which perform the required functions. These circuits include a full binary adder, a phaselocked frequency divider which provides a 3.125megacycle secondary timing source, a reshaping and retiming circuit using germanium diodes and capacitive storage, a highspeed shift register, a highspeed indicator register, and a binary word generator.\par Various novel features of a digital system operating at these high speeds are described. These include the use of coaxial delay lines for the distribution of signals and as storage elements, and the use of secondary emission tubes in amplifier and multivibrator circuits.\par In a 50megacycle system the interdependence of the space and time dimensions is marked, and although this introduces problems which are not ordinarily encountered in computing systems, it may bel
Š tW #)+e57=K;?c+e‹
articlefparith.bibBemer:1958:MMSRobert W. BemerA Machine Method for SquareRoot ComputationjCACM1167jan11958CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Thu Sep 15 18:35:46 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.15 18:35:46 ???Communications of the ACMacknjhttp://portal.acm.org/browse_dl.cfm?idx=J79Robert W. BemerA Machine Method for SquareRoot Computation
@Article{Bemer:1958:MMS,
author = "Robert W. Bemer",
title = "A Machine Method for SquareRoot Computation",
journal = jCACM,
volume = "1",
number = "1",
pages = "67",
month = jan,
year = "1958",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu Sep 15 18:35:46 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}ˆ_sV !#1U+1Em;eUŠtechreportfparith.bibAnonymous:1958:ARMAnonymousAnalysis and research memorandum 294AR Memo294 (AD 207929)Massachusetts Institute of Technology, Naval Supersonic LaboratoryCambridge, MA, USA723oct101958Sat Feb 24 15:01:45 MST 1996http://www.math.utah.edu/pub/tex/bib/fparith.bib1996.02.24 15:01:45 MSTError functions.; Floatingpoint arithmetic.acknhfbAnonymousAnalysis and research memorandum 294
@TechReport{Anonymous:1958:ARM,
author = "Anonymous",
title = "Analysis and research memorandum 294",
type = "{AR} Memo",
number = "294 (AD 207929)",
institution = "Massachusetts Institute of Technology, Naval
Supersonic Laboratory",
address = "Cambridge, MA, USA",
pages = "7",
day = "23",
month = oct,
year = "1958",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "Error functions.; Floatingpoint arithmetic.",
}ŠrW #++i;a7Ea;]+iŒ)articlefparith.bibWeibel:1957:EAMErich S. WeibelAn Electronic Analog Multiplier Using CarriersjIRETRANSELECCOMPUTEC613034mar31957IRELAOhttp://dx.doi.org/10.1109/TEC.1957.522155803679950 OR 03679950Thu Jun 30 16:07:23 MDT 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.06.30 16:07:23 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5221558IRE Transactions on Electronic ComputersacknhfbErich S. WeibelAn Electronic Analog Multiplier Using Carriers
@Article{Weibel:1957:EAM,
author = "Erich S. Weibel",
title = "An Electronic Analog Multiplier Using Carriers",
journal = jIRETRANSELECCOMPUT,
volume = "EC6",
number = "1",
pages = "3034",
month = mar,
year = "1957",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1957.5221558",
ISSN = "03679950",
bibdate = "Thu Jun 30 16:07:23 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5221558",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
»îÝînÌ
‡H
@Article{Carter:1990:STA,
author = "T. M. Carter and J. E. Robertson",
title = "The set theory of arithmetic decomposition",
joŠ8”q
@Article{Cardarilli:1988:SPD,
author = "G. C. Cardarilli and R. Lojacono and G. Martinelli and
M. Salerno",
title = "Structurally passive digital filters in residue number
systems",
journal = jIEEETRANSCIRCUITSSYST,
volume = "35",
number = "2",
pages = "149158",
month = feb,
year = "1988",
CODEN = "ICSYBT",
DOI = "http://dx.doi.org/10.1109/31.1716",
IS ¡ˆ`‘A
@Article{Caraiscos:1984:REA,
author = "C. Caraiscos and Bede Liu",
title = "A roundoff error analysis of the {LMS} adaptive
algorithm",
journal = jIEEETRANSACOUSTSPEECH,
volume = "32",
number = "1",
pages = "3441",
month = feb,
year = "1984",
CODEN = "IETABA",
ISSN = "00963518",
bibdate = "Sat Jul 16 11:25:06 MDT 2005",
bibsource = "http://ieeexplore.ieee.orghŸU¿+
@Article{Carr:1994:IRM,
author = "S. Carr and K. Kennedy",
title = "Improving the Ratio of Memory Operations in
FloatingPoint Operations in Loops",
journal = jTOPLAS,
volume = "16",
number = "6",
pages = "17681810",
month = nov,
year = "1994",
CODEN = "ATPSDT",
ISSN = "01640925 (print), 15584593 (electronic)",
ISSNL = "01640925",
bibdate = "Sat Feb 24 15:ÈÕ
@Article{Carter:1990:RSD,
author = "T. M. Carter and J. E. Robertson",
title = "Radix$ 16 $ signeddigit division",
journal = jIEEETRANSCOMPUT,
volume = "39",
number = "12",
pages = "14241433",
month = dec,
year = "1990",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.61063",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "0018‡lY
@Article{Carnicer:2008:REP,
author = "J. M. Carnicer and T. N. T. Goodman and J. M.
Pe{\~n}a",
title = "Roundoff errors for polynomial evaluation by a family
of formulae",
journal = jCOMPUTING,
volume = "82",
number = "23",
pages = "199215",
month = jul,
year = "2008",
CODEN = "CMPTA2",
ISSN = "0010485X (print), 14365057 (electronic)",
ISSNL = "ñ‰,’Y
@Article{Carta:1974:HLR,
author = "David G. Carta",
title = "Help!!: {The} Lost Reference: ({A} Modified {Newton}
Method for Square Roots)",
journal = jSIGNUM,
volume = "9",
number = "4",
pages = "99",
month = oct,
year = "1974",
CODEN = "SNEWD6",
DOI = "http://doi.acm.org/10.1145/1206085.1206086",
ISSN = "01635778 (print), 15580237 (electronic)",
ISSNL = ‡Ž!
@Article{Carr:1959:EAF,
author = "John W. {Carr III}",
title = "Error Analysis in Floating Point Arithmetic",
journal = jCACM,
volume = "2",
number = "5",
pages = "1015",
month = may,
year = "1959",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Wed Jul 14 15:48:23 MDT 2004",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Carr59a;
http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Carr59a",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Carr59a",
}…
$
üŽ$†gwU #+U%7=m;;U‡9
articlefparith.bibDelury:1958:CANDaniel B. DeluryComputation with Approximate NumbersjMATHTEACH51521530nov11195800255769 OR 00255769Fri Nov 28 11:47:47 2003http://www.math.utah.edu/pub/tex/bib/fparith.bib2003.11.28 11:47:47 ???The Mathematics TeacheracknhfbDaniel B. DeluryComputation with Approximate Numbers
@Article{Delury:1958:CAN,
author = "Daniel B. Delury",
title = "Computation with Approximate Numbers",
journal = jMATHTEACH,
volume = "51",
pages = "521530",
month = nov,
year = "1958",
ISSN = "00255769",
bibdate = "Fri Nov 28 11:47:47 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "The Mathematics Teacher",
}ˆkvW #';7=m;]O' ‰earticlefparith.bibCouleur:1958:BBDJ. F. CouleurBIDEC  a BinarytoDecimal or DecimaltoBinary ConverterjIRETRANSELECCOMPUTEC73133161958IRELAO03679950 OR 03679950Fri Nov 28 16:28:12 2003http://www.math.utah.edu/pub/tex/bib/fparith.bib2003.11.28 16:28:12 ???IRE Transactions on Electronic Computersdecimal floatingpoint arithmeticackmfcJ. F. Couleur{BIDEC}  a BinarytoDecimal or DecimaltoBinary Converter
@Article{Couleur:1958:BBD,
author = "J. F. Couleur",
title = "{BIDEC}  a BinarytoDecimal or DecimaltoBinary
Converter",
journal = jIRETRANSELECCOMPUT,
volume = "EC7",
pages = "313316",
year = "1958",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Fri Nov 28 16:28:12 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ackmfc # " and " # acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
keywords = "decimal floatingpoint arithmetic",
}ŠuW #)#i57;K;?c#i‹articlefparith.bibBemer:1958:SMCR. W. BemerA Subroutine Method for Calculating LogarithmsjCACM1557may51958CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Thu Sep 1 10:16:09 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:16:09 ???Communications of the ACMacknjhttp://portal.acm.org/browse_dl.cfm?idx=J79R. W. BemerA Subroutine Method for Calculating Logarithms
@Article{Bemer:1958:SMC,
author = "R. W. Bemer",
title = "A Subroutine Method for Calculating Logarithms",
journal = jCACM,
volume = "1",
number = "5",
pages = "57",
month = may,
year = "1958",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu Sep 1 10:16:09 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
‰yW #)#o57=K;5O#o‹articlefparith.bibGower:1958:NIMJ. C. GowerA Note on an Iterative Method for Root ExtractionjCOMPJ11421431958CMPJA600104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Thu Sep 15 18:36:55 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.15 18:36:55 ???The Computer Journalacknjhttp://comjnl.oxfordjournals.org/J. C. GowerA Note on an Iterative Method for Root Extraction
@Article{Gower:1958:NIM,
author = "J. C. Gower",
title = "A Note on an Iterative Method for Root Extraction",
journal = jCOMPJ,
volume = "1",
pages = "142143",
year = "1958",
CODEN = "CMPJA6",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Thu Sep 15 18:36:55 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
xxmonth = "(none)",
xxnumber = "(none)",
}‹wxW #+[57E‚;?c[Žarticlefparith.bibErshov:1958:PAOAndrei P. ErshovOn Programming of Arithmetic OperationsjCACM1836aug81958CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Wed Jul 14 15:48:21 MDT 2004http://dblp.unitrier.de/db/journals/cacm/cacm1.html#Ershov58; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/fparith.bib2004.07.14 15:48:21 MDTCommunications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Andrei P. ErshovOn Programming of Arithmetic Operations
@Article{Ershov:1958:PAO,
author = "Andrei P. Ershov",
title = "On Programming of Arithmetic Operations",
journal = jCACM,
volume = "1",
number = "8",
pages = "36",
month = aug,
year = "1958",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Wed Jul 14 15:48:21 MDT 2004",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm1.html#Ershov58;
http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Ershov58",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ershov58",
}
ÕÔ ¹ÊÄÕ³†*ŒU
@Article{Howell:1969:ASLb,
author = "Jo Ann Howell and Robert T. Gregory",
title = "Anˆg‘O
@Article{Hsu:1994:NFP,
author = "ChauYun Hsu",
title = "Novel fixedpoint roundoff analysis of the
decimationintime {FHT}",
journal = jIEEETRANSSIGPROC,
volume = "42",
number = "1",
pages = "206208",
month = jan,
year = "1994",
CODEN = "ITPRED",
ISSN = "1053587X (print), 19410476 (electronic)",
ISSNL = "1053587X",
bibdate = "Sat Jul 16 11:25:06 MDT 2‰’
@Article{Hsu:1994:CPF,
author = "ChauYun Hsu and Jui Chi Yao",
title = "Comparative performance of fast cosine transform with
fixedpoint roundoff error analysis",
journal = jIEEETRANSSIGPROC,
volume = "42",
number = "5",
pages = "12561259",
month = may,
year = "1994",
CODEN = "ITPRED",
ISSN = "1053587X (print), 19410476 (electronic)",
ISSNL = "1053587X",
b†Œ+
@Article{Hu:1991:ERC,
author = "X. Hu and R. G. Harber and S. C. Bass",
title = "Expanding the Range of Convergence of the {CORDIC}
Algorithm",
journal = jIEEETRANSCOMPUT,
volume = "40",
number = "1",
pages = "1321",
month = jan,
year = "1991",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.67316",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Thu Sep 08 00:50:12 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
} ìˆ:u
@Article{Hsu:1988:CVA,
author = "I. S. Hsu and T. K. Truong and L. J. Deutsch and I. S.
Reed",
title = "A comparison of {VLSI} architecture of finite field
multipliers using dual, normal, or standard bases",
journal = jIEEETRANSCOMPUT,
volume = "37",
number = "6",
pages = "735739",
month = jun,
year = "1988",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10. ¿†Œ3
@Article{Howell:1970:SLE,
author = "Jo Ann Howell and Robert T. Gregory",
title = "Solving linear equations using residue arithmetic 
{Algorithm II}",
journal = jBIT,
volume = "10",
pages = "2337",
year = "1970",
CODEN = "BITTEL, NBITAB",
ISSN = "00063835 (print), 15729125 (electronic)",
ISSNL = "00063835",
MRclass = "65.35",
MRnumber = "MR0261777 (41 \#6389)",
MRreviewer = "J. Legras",
bibdate = "Thu Nov 8 14:50:19 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journalURL = "http://link.springer.com/journal/10543",
}ò†*ŒU
@Article{Howell:1969:ASLb,
author = "Jo Ann Howell and Robert T. Gregory",
title = "An algorithm for solving linear algebraic equations
using residue arithmetic. {II}",
journal = jBIT,
volume = "9",
pages = "324337",
year = "1969",
CODEN = "BITTEL, NBITAB",
ISSN = "00063835 (print), 15729125 (electronic)",
ISSNL = "00063835",
MRclass = "65.35",
MRnumber = "MR0261776 (41 \#6388b)",
MRreviewer = "J. Legras",
bibdate = "Thu Nov 8 14:50:18 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journalURL = "http://link.springer.com/journal/10543",
}Å
÷‹b{Z #9157;K;[1%ŒUarticlefparith.bibKogbetliantz:1958:CANbE. G. KogbetliantzComputation of Arcsin $N$ for $ 0 < N < 1 $ Using an Electronic ComputerjIBMJRD23218222jul71958IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Thu Sep 1 10:16:10 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:16:10 ???IBM Journal of Research and Developmentacknjhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520E. G. KogbetliantzComputation of Arcsin {$N$} for $ 0 < {N} < 1 $ Using an Electronic Computer
@Article{Kogbetliantz:1958:CANb,
author = "E. G. Kogbetliantz",
title = "Computation of Arcsin {$N$} for $ 0 < {N} < 1 $ Using
an Electronic Computer",
journal = jIBMJRD,
volume = "2",
number = "3",
pages = "218222",
month = jul,
year = "1958",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Thu Sep 1 10:16:10 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}ŒzZ #91557;K;[1AŒmarticlefparith.bibKogbetliantz:1958:CANaE. G. KogbetliantzComputation of Arctan $N$ for $  infty < N < + infty $ Using an Electronic ComputerjIBMJRD214353jan11958IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Thu Sep 1 10:16:10 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:16:10 ???IBM Journal of Research and Developmentacknjhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520E. G. KogbetliantzComputation of Arctan {$N$} for $  \infty < {N} < + \infty $ Using an Electronic Computer
@Article{Kogbetliantz:1958:CANa,
author = "E. G. Kogbetliantz",
title = "Computation of Arctan {$N$} for $  \infty < {N} < +
\infty $ Using an Electronic Computer",
journal = jIBMJRD,
volume = "2",
number = "1",
pages = "4353",
month = jan,
year = "1958",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Thu Sep 1 10:16:10 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}rce = "http://www.math.utah.edu/pub/bibnet/authors/m/metropolisnicholas.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
abstract = "The usual floating point arithmetic makes error
analysis difficult. This paper describes an alternative
system which offers a means of analyzing floating point
calculations more effectively and which also possesses
certain advantages from an equipment standpoint.",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}
••‡u}U #3+[;7;m;]+[‰articlefparith.bibRobertson:1958:NCDaJ. E. RobertsonA new class of digital division methodsjIRETRANSELECCOMPUTEC738892sep91958IRELAO03679950 OR 03679950Thu Apr 2 08:38:35 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib1998.04.02 08:38:35 ???IRE Transactions on Electronic ComputersacksfoJ. E. RobertsonA new class of digital division methods
@Article{Robertson:1958:NCDa,
author = "J. E. Robertson",
title = "A new class of digital division methods",
journal = jIRETRANSELECCOMPUT,
volume = "EC7",
number = "3",
pages = "8892",
month = sep,
year = "1958",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Thu Apr 2 08:38:35 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acksfo # " and " # acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}’pX#3QW;a7=‚o;„]M„QW’}articlefparith.bibMetropolis:1958:SDCN. Metropolis and R. L. AshenhurstSignificant Digit Computer ArithmeticjIRETRANSELECCOMPUTEC742652671958IRELAOhttp://dx.doi.org/10.1109/TEC.1958.522265703679950 OR 03679950Wed Feb 14 19:23:38 2007http://www.math.utah.edu/pub/bibnet/authors/m/metropolisnicholas.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2007.02.14 19:23:38 ???The usual floating point arithmetic makes error analysis difficult. This paper describes an alternative system which offers a means of analyzing floating point calculations more effectively and which also possesses certain advantages from an equipment standpoint.IRE Transactions on Electronic ComputersCited in cite Sterbenz:1974:FPC.acknhfbThe usual floating point arithmetic makes error analysis difficult. This paper describes an alternative system which offers a means of analyzing floating point calculations more effectively and which also possesses certain advantages from an equipment standpoint.N. Metropolis and R. L. AshenhurstSignificant Digit Computer Arithmetic
@Article{Metropolis:1958:SDC,
author = "N. Metropolis and R. L. Ashenhurst",
title = "Significant Digit Computer Arithmetic",
journal = jIRETRANSELECCOMPUT,
volume = "EC7",
number = "4",
pages = "265267",
month = "????",
year = "1958",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1958.5222657",
ISSN = "03679950",
bibdate = "Wed Feb 14 19:23:38 2007",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/metropolisnicholas.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
abstract = "The usual floating point arithmetic makes error
analysis difficult. This paper describes an alternative
system which offers a means of analyzing floating point
calculations more effectively and which also possesses
certain advantages from an equipment standpoint.",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}
Þ
6ÞŒUY #+)=;a7E‚;])=yarticlefparith.bibSchmid:1958:TFQHermann SchmidA Transistorized FourQuadrant TimeDivision Multiplier with an Accuracy of 0.1 Per CentjIRETRANSELECCOMPUTEC714147mar31958IRELAOhttp://dx.doi.org/10.1109/TEC.1958.522209403679950 OR 03679950Thu Jul 14 15:56:43 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 15:56:43 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5222094IRE Transactions on Electronic ComputersacknhfbHermann SchmidA Transistorized FourQuadrant TimeDivision Multiplier with an Accuracy of 0.1 Per Cent
@Article{Schmid:1958:TFQ,
author = "Hermann Schmid",
title = "A Transistorized FourQuadrant TimeDivision
Multiplier with an Accuracy of 0.1 Per Cent",
journal = jIRETRANSELECCOMPUT,
volume = "EC7",
number = "1",
pages = "4147",
month = mar,
year = "1958",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1958.5222094",
ISSN = "03679950",
bibdate = "Thu Jul 14 15:56:43 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5222094",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}‹G~W #31[;a7E‚;]1[ articlefparith.bibRobertson:1958:NCDbJames E. RobertsonA New Class of Digital Division MethodsjIRETRANSELECCOMPUTEC73218222sep91958IRELAOhttp://dx.doi.org/10.1109/TEC.1958.522257903679950 OR 03679950Thu Jul 14 15:56:43 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 15:56:43 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5222579IRE Transactions on Electronic ComputersacknhfbJames E. RobertsonA New Class of Digital Division Methods
@Article{Robertson:1958:NCDb,
author = "James E. Robertson",
title = "A New Class of Digital Division Methods",
journal = jIRETRANSELECCOMPUT,
volume = "EC7",
number = "3",
pages = "218222",
month = sep,
year = "1958",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1958.5222579",
ISSN = "03679950",
bibdate = "Thu Jul 14 15:56:43 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5222579",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}/cacm/cacm1.html#Sisson58;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "As more emphasis is placed on improving the accuracy
of data fed into automatic computing systems, more
emphasis will be placed on redundancy checking of
predictable fields within the input. Two systems (at
least) of checking a field of decimal digits have been
proposed. In both of these it is assumed that the field
to be checked is all numeric and that the redundancy
must be of only one digit.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "decimal floatingpoint arithmetic",
oldlabel = "Sisson58",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sisson58",
}€
ÂÂ–:Y #++U57Ek;†'?Oc†'+U–carticlefparith.bibSisson:1958:IDRRoger L. SissonAn Improved Decimal Redundancy CheckjCACM151012may51958CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Mon Jan 22 07:22:12 MST 2001http://dblp.unitrier.de/db/journals/cacm/cacm1.html#Sisson58; http://www.math.utah.edu/pub/tex/bib/fparith.bib2001.01.22 07:22:12 MSTAs more emphasis is placed on improving the accuracy of data fed into automatic computing systems, more emphasis will be placed on redundancy checking of predictable fields within the input. Two systems (at least) of checking a field of decimal digits have been proposed. In both of these it is assumed that the field to be checked is all numeric and that the redundancy must be of only one digit.Communications of the ACMdecimal floatingpoint arithmeticacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79As more emphasis is placed on improving the accuracy of data fed into automatic computing systems, more emphasis will be placed on redundancy checking of predictable fields within the input. Two systems (at least) of checking a field of decimal digits have been proposed. In both of these it is assumed that the field to be checked is all numeric and that the redundancy must be of only one digit.Roger L. SissonAn Improved Decimal Redundancy Check
@Article{Sisson:1958:IDR,
author = "Roger L. Sisson",
title = "An Improved Decimal Redundancy Check",
journal = jCACM,
volume = "1",
number = "5",
pages = "1012",
month = may,
year = "1958",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 22 07:22:12 MST 2001",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm1.html#Sisson58;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "As more emphasis is placed on improving the accuracy
of data fed into automatic computing systems, more
emphasis will be placed on redundancy checking of
predictable fields within the input. Two systems (at
least) of checking a field of decimal digits have been
proposed. In both of these it is assumed that the field
to be checked is all numeric and that the redundancy
must be of only one digit.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "decimal floatingpoint arithmetic",
oldlabel = "Sisson58",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sisson58",
}
i;i‹NW #)#I57E‚;?c#I}articlefparith.bibWadey:1958:TSRW. G. WadeyTwo SquareRoot ApproximationsjCACM1111314nov111958CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Wed Jul 14 15:48:22 MDT 2004http://dblp.unitrier.de/db/journals/cacm/cacm1.html#Wadey58; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/fparith.bib2004.07.14 15:48:22 MDTCommunications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79W. G. WadeyTwo SquareRoot Approximations
@Article{Wadey:1958:TSR,
author = "W. G. Wadey",
title = "Two SquareRoot Approximations",
journal = jCACM,
volume = "1",
number = "11",
pages = "1314",
month = nov,
year = "1958",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Wed Jul 14 15:48:22 MDT 2004",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm1.html#Wadey58;
http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Wadey58",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Wadey58",
}‰AW #+%C77;m;y%Šcarticlefparith.bibTocher:1958:TMDK. D. TocherTechniques of Multiplication and Division for Automatic Binary ComputersjQUARTJMECHAPPLIEDMATH1133643841958QJMMAV00335614 OR 0033561400335614 OR 00335614Thu Apr 2 08:38:35 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib1998.04.02 08:38:35 ???Quarterly Journal of Mechanics and Applied MathematicsacksfoK. D. TocherTechniques of Multiplication and Division for Automatic Binary Computers
@Article{Tocher:1958:TMD,
author = "K. D. Tocher",
title = "Techniques of Multiplication and Division for
Automatic Binary Computers",
journal = jQUARTJMECHAPPLIEDMATH,
volume = "11",
number = "3",
pages = "364384",
month = "????",
year = "1958",
CODEN = "QJMMAV",
ISSN = "00335614",
ISSNL = "00335614",
bibdate = "Thu Apr 2 08:38:35 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acksfo # " and " # acknhfb,
fjournal = "Quarterly Journal of Mechanics and Applied
Mathematics",
}
ä
> Oä„ˆ[
@Article{Wilson:1988:FPS,
author = "Pete Wilson",
title = "FloatingPoint Survival Kit",
journal = jBYTE,
volume = "13",
number = "3",
pages = "217217",
month = mar,
year = "1988",
CODEN = "BYTEDJ",
ISSN = "03605280 (print), 10827838 (electronic)",
ISSNL = "03605280",
bibdate = "Thu Oct 31 18:51:38 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "BYTE Magazine",
}b‹z—u
@Article{Wilson:1970:OSA,
author = "M. Wayne Wilson",
title = "Optimal Starting Approximations for Generating Square
Root for Slow or No Divide",
journal = jCACM,
volume = "13",
number = "9",
pages = "559560",
month = sep,
year = "1970",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "65.50",
MRnumber = &†K
@Article{Wilson:1961:ARB,
author = "J. B. Wilson and R. S. Ledley",
title = "An Algorithm for Rapid Binary Division",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "4",
pages = "662670",
month = dec,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219271",
ISSN = "03679950",
bibdate = "Thu Jul 14 14:45:04 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219271",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}ÉˆI‘
@Article{Williamson:1985:NAB,
author = "D. Williamson and S. Sridharan and P. McCrea",
title = "A new approach for block floatingpoint arithmetic in
recursive filters",
journal = jIEEETRANSCIRCUITSSYST,
volume = "32",
number = "7",
pages = "719722",
month = jul,
year = "1985",
CODEN = "ICSYBT",
ISSN = "00984094 (print), 15581276 (electronic)",
ISSNL = "009840QŠ ”
@Article{Williams:1996:TMF,
author = "K. B. Williams",
title = "Testing Math Functions: {When} requirements are tight,
we must carefully examine all potential sources of
error. {Make} sure your math library isn't the weak
link in the chain",
journal = jCCCUJ,
volume = "14",
number = "12",
pages = "4954, 5865",
month = dec,
year = "1996",
CODEN = "CC…Q‹#
@Article{Williams:1995:SBA,
author = "T. Williams and N. Patkar and G. Shen",
title = "{SPARC64}: a 64b 64activeinstruction
outoforderexecution {MCM} processor",
journal = jIEEEJSOLIDSTATECIRCUITS,
volume = "30",
number = "11",
pages = "12151226",
month = nov,
year = "1995",
CODEN = "IJSCBC",
ISSN = "00189200 (print), 1558173X (electronic)",
ISSNL = "00189200",
bibdate = "Thu Apr 2 08:38:35 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acksfo # " and " # acknhfb,
fjournal = "IEEE Journal of SolidState Circuits",
}î",
MRreviewer = "H. H. Goldstine",
bibdate = "Fri Dec 08 13:06:24 1995",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/metropolisnicholas.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
ZMnumber = "0121.12102",
abstract = "Algorithms for floating point computer arithmetic are
described, in which fractional parts are not subject to
the usual normalization convention. These algorithms
give results in a form which furnishes some indication
of their degree of precision. An analysis of onestage
error propagation is developed for each operation; a
suggested statistical model for longrun error
propagation is also set forth.",
acknowledgement = acknhfb,
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}ƒ
Õæ
k’æ£L“¦
@Article{Colberg:2009:HAS,
author = "Peter H. Colberg and Felix H{\"o}fling",
title = "Highly accelerated simulations of glassy dynamics
using {GPUs}: caveats on limited floatingpoint
precision",
journal = "arXiv.org",
volume = "??",
number = "??",
pages = "112",
day = "20",
month = dec,
year = "2009",
CODEN = "????",
ISSN = "????",
ISSNL = ”ÎO
@Article{Coleman:2000:AEL,
author = "J. N. Coleman and E. I. Chester and C. I. Softley and
J. Kadlec",
title = "Arithmetic on the {European Logarithmic
ˆ
@Article{Colberg:2011:HAS,
author = "Peter H. Colberg and Felix H{\"o}fling",
title = "Highly accelerated simulations of glassy dynamics
using {GPUs}: Caveats on limited floatingpoint
precision",
journal = jCOMPPHYSCOMM,
volume = "182",
number = "5",
pages = "11201129",
month = may,
year = "2011",
CODEN = "CPHCBZ",
DOI = "http://dx.doi.org/10.1016/j.cpc.á…8Šq
@Article{Col:2002:ALC,
author = "MarieAndr{\'e}e JacobDa Col",
title = "About local configurations in arithmetic planes",
journal = jTHEORCOMPSCI,
volume = "283",
number = "1",
pages = "183201",
month = jun,
year = "2002",
CODEN = "TCSCDI",
ISSN = "03043975 (print), 18792294 (electronic)",
ISSNL = "03043975",
bibdate = "Wed Nov 20 18:08:57 MST 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Theoretical Computer Science",
journalURL = "http://www.sciencedirect.com/science/journal/03043975",
}ˆ†.Œ]
@Article{Cole:1993:SAA,
author = "T. J. Cole",
title = "Statistical Algorithms: {Algorithm AS 281}: Scaling
and Rounding Regression Coefficients to Integers",
journal = jAPPLSTAT,
volume = "42",
number = "1",
pages = "261268",
year = "1993",
CODEN = "APSTAG",
ISSN = "00359254 (print), 14679876 (electronic)",
ISSNL = "00359254",
bibdate = "Sat Apr 21 10:26:43 MDT 2001",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
URL = "http://lib.stat.cmu.edu/apstat/281",
acknowledgement = acknhfb,
fjournal = "Applied Statistics",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)14679876/issues",
}.•ª
@Article{Cohen:1983:CCP,
author = "Marty S. Cohen and T. E. Hull and V. Carl Hamacher",
title = "{CADAC}: a ControlledPrecision Decimal Arithmetic
Unit",
journal = jIEEETRANSCOMPUT,
volume = "C32",
number = "4",
pages = "370377",
month = apr,
year = "1983",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1983.1676238",
ISSN = "00189340 (print), 1557995”…Š'
@Article{Cohen:1976:EFD,
author = "Daniel I. A. Cohen",
title = "An explanation of the first digit phenomenon",
journal = jJCOMBTHEORYA,
volume = "20",
number = "3",
pages = "367370",
month = may,
year = "1976",
CODEN = "JCBTA7",
ISSN = "00973165",
ISSNL = "00973165",
bibdate = "Thu Feb 15 16:29:51 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Journal of Combinatorial Theory. Series A",
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
}^X0lK>
y1Xê‹g—O
@Article{Birman:1990:DWS,
author = "Mark Birman and Allen Samuels and George Chu and Chuk
Ting and Larry Hu and John McLeod and John Barnes",
title = "Developing the {WTL3170\slash 3171 Sparc}
FloatingPoint Coprocessors",
journal = jIEEEMICRO,
volume = "10",
number = "1",
pages = "5564",
month = feb,
year = "1990",
CODEN = "IEMIDZ",
DOI = "http://dx.doi.o2Ëž¼[
@Article{Benz:2012:DPA,
author = "Florian Benz and Andreas Hildebrandt and Sebastian
Hack",
title = "A dynamic program analysis to find floatingpoint
accuracy problems",
journal = jSIGPLAN,
volume = "47",
number = "6",
pages = "453462",
month = jun,
year = "2012",
CODEN = "SINODQ",
DOI = "http://dx.doi.org/10.1145/2345156.2254118",
ISSN = "03621q‘‹ –A
@Article{Bertossi:2000:RNS,
author = "A. A. Bertossi and A. Mei",
title = "A residue number system on reconfigurable mesh with
applications to prefix sums and approximate string
matching",
journal = jIEEETRANSPARDISTSYS,
volume = "11",
number = "11",
pages = "11861199",
month = nov,
year = "2000",
CODEN = "ITDSEO",
DOI = "http://dx.doi.org/10.1109/71.88+ë†B
@Article{Bickerstaff:1995:PRA,
author = "K'Andrea C. Bickerstaff and Michael J. Schulte and
Earl E. {Swartzlander, Jr.}",
title = "Parallel reduced area multipliers",
journal = jJVLSISIGNALPROC,
volume = "9",
number = "3",
pages = "181191",
month = apr,
year = "1995",
CODEN = "JVSPED",
DOI = "http://dx.doi.org/10.1007/BF02407084",
ISSN = "09225773 (print), 1573109X (electronic)",
ISSNL = "09225773",
bibdate = "Mon Mar 05 08:29:38 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://springerlink.metapress.com/content/761m0225754r4440/fulltext.pdf",
acknowledgement = acknhfb,
fjournal = "Journal of VLSI Signal Processing",
}st‡xq
@Article{Beuchat:2008:AGM,
author = "J.L. Beuchat and J.M. Muller",
title = "Automatic Generation of Modular Multipliers for {FPGA}
Applications",
journal = jIEEETRANSCOMPUT,
volume = "57",
number = "12",
pages = "16001613",
month = dec,
year = "2008",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2008.102",
ISSN = "00189340 (print), 15579956 (electréK‡Ž
@Article{Belanovic:2002:LPF,
author = "Pavle Belanovic and Miriam Leeser",
title = "A Library of Parameterized FloatingPoint Modules and
Their Use",
journal = jLECTNOTESCOMPSCI,
volume = "2438",
pages = "657666",
year = "2002",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t2438.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/2438/24380657.htm;
http://link.springerny.com/link/service/series/0558/papers/2438/24380657.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}
00—LY#3eY577+={;†3q!e†3eY—articlefparith.bibAshenhurst:1959:UFPRobert L. Ashenhurst and Nicholas MetropolisUnnormalized Floating Point ArithmeticjJACM63415428jul71959JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 0004541168.00MR0105833 (21 \#4568)H. H. GoldstineFri Dec 08 13:06:24 1995http://www.math.utah.edu/pub/bibnet/authors/m/metropolisnicholas.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib1995.12.08 13:06:24 ???Algorithms for floating point computer arithmetic are described, in which fractional parts are not subject to the usual normalization convention. These algorithms give results in a form which furnishes some indication of their degree of precision. An analysis of onestage error propagation is developed for each operation; a suggested statistical model for longrun error propagation is also set forth.Journal of the Association for Computing Machinery0121.12102acknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J401Algorithms for floating point computer arithmetic are described, in which fractional parts are not subject to the usual normalization convention. These algorithms give results in a form which furnishes some indication of their degree of precision. An analysis of onestage error propagation is developed for each operation; a suggested statistical model for longrun error propagation is also set forth.Robert L. Ashenhurst and Nicholas MetropolisUnnormalized Floating Point Arithmetic
@Article{Ashenhurst:1959:UFP,
author = "Robert L. Ashenhurst and Nicholas Metropolis",
title = "Unnormalized Floating Point Arithmetic",
journal = jJACM,
volume = "6",
number = "3",
pages = "415428",
month = jul,
year = "1959",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
MRclass = "68.00",
MRnumber = "MR0105833 (21 \#4568)",
MRreviewer = "H. H. Goldstine",
bibdate = "Fri Dec 08 13:06:24 1995",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/metropolisnicholas.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
ZMnumber = "0121.12102",
abstract = "Algorithms for floating point computer arithmetic are
described, in which fractional parts are not subject to
the usual normalization convention. These algorithms
give results in a form which furnishes some indication
of their degree of precision. An analysis of onestage
error propagation is developed for each operation; a
suggested statistical model for longrun error
propagation is also set forth.",
acknowledgement = acknhfb,
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
} bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Buchholz59;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "decimal floatingpoint arithmetic",
oldlabel = "Buchholz59",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Buchholz59",
xxnote = "Check author first name: article has W. Buchholz; I
think it should be Werner, not Wilfried.",
}„
ð÷ðŒW #'c57E‚;?c1cŽ!articlefparith.bibCarr:1959:EAFJohn W. Carr IIIError Analysis in Floating Point ArithmeticjCACM251015may51959CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Wed Jul 14 15:48:23 MDT 2004http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Carr59a; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/fparith.bib2004.07.14 15:48:23 MDTCommunications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79John W. {Carr III}Error Analysis in Floating Point Arithmetic
@Article{Carr:1959:EAF,
author = "John W. {Carr III}",
title = "Error Analysis in Floating Point Arithmetic",
journal = jCACM,
volume = "2",
number = "5",
pages = "1015",
month = may,
year = "1959",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Wed Jul 14 15:48:23 MDT 2004",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Carr59a;
http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Carr59a",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Carr59a",
}ŽY #//57Eo;?Oc/‘ articlefparith.bibBuchholz:1959:FFCWilfried BuchholzFingers or Fists? (The Choice of Decimal or Binary Representation)jCACM2123111959CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Mon Jan 22 06:28:45 MST 2001http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Buchholz59; http://www.math.utah.edu/pub/tex/bib/fparith.bib2001.01.22 06:28:45 MSTCommunications of the ACMdecimal floatingpoint arithmeticacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Wilfried BuchholzFingers or Fists? (The Choice of Decimal or Binary Representation)
@Article{Buchholz:1959:FFC,
author = "Wilfried Buchholz",
title = "Fingers or Fists? (The Choice of Decimal or Binary
Representation)",
journal = jCACM,
volume = "2",
number = "12",
pages = "311",
month = "????",
year = "1959",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 22 06:28:45 MST 2001",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Buchholz59;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "decimal floatingpoint arithmetic",
oldlabel = "Buchholz59",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Buchholz59",
xxnote = "Check author first name: article has W. Buchholz; I
think it should be Werner, not Wilfried.",
}
0ˆ*U #'U;7=m;]O'Y‰?articlefparith.bibDaggett:1959:DBCD. H. DaggettDecimalBinary Conversions in CORDICjIRETRANSELECCOMPUTEC85335339sep91959IRELAO03679950 OR 03679950Thu Sep 08 08:14:00 1994http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.08 08:14:00 ???IRE Transactions on Electronic Computersdecimal floatingpoint arithmeticacknjD. H. DaggettDecimalBinary Conversions in {CORDIC}
@Article{Daggett:1959:DBC,
author = "D. H. Daggett",
title = "DecimalBinary Conversions in {CORDIC}",
journal = jIRETRANSELECCOMPUT,
volume = "EC8",
number = "5",
pages = "335339",
month = sep,
year = "1959",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Thu Sep 08 08:14:00 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IRE Transactions on Electronic Computers",
keywords = "decimal floatingpoint arithmetic",
}LW %#%ym9'!=%;!‚;{1my!9Ž[incollectionfparith.bibCarr:1959:PCJohn W. Carr IIIEugene M. Grabbe and Simon Ramo and Dean E. WooldridgeHandbook of Automation, Computation, and ControlProgramming and CodingpubWILEYpubWILEY:adr10151959TJ213 .G72Fri Aug 20 08:41:16 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib; z3950.loc.gov:7090/Voyager2010.08.20 08:41:16 ???Chapter 2.19581961: Volume 1. Control fundamentals. Volume 2. Computers and data processing. Volume 3. Systems and components. Cited in cite Sterbenz:1974:FPC.automation; mathematics; computers; operations researchacknhfbJohn W. {Carr III}Handbook of Automation, Computation, and ControlEugene M. Grabbe and Simon Ramo and Dean E. WooldridgeChapter 2.Programming and Coding
@InCollection{Carr:1959:PC,
author = "John W. {Carr III}",
editor = "Eugene M. Grabbe and Simon Ramo and Dean E.
Wooldridge",
booktitle = "Handbook of Automation, Computation, and Control",
title = "Programming and Coding",
publisher = pubWILEY,
address = pubWILEY:adr,
year = "1959",
LCCN = "TJ213 .G72",
bibdate = "Fri Aug 20 08:41:16 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
z3950.loc.gov:7090/Voyager",
note = "Chapter 2.",
acknowledgement = acknhfb,
bookpages = "????",
remark = "19581961: Volume 1. Control fundamentals. Volume 2.
Computers and data processing. Volume 3. Systems and
components. Cited in \cite{Sterbenz:1974:FPC}.",
subject = "automation; mathematics; computers; operations
research",
}
 ²¡æ‡!ŽE
@Article{Freeman:1954:TSA,
author = "H. Freeman and E. Parsons",
title = "TimeSharing Analog Multiplier ({TSAM})",
journal = jTRANSIREPROFGROUPELECCOMPUT,
volume ‡_?
@Article{Fried:1989:ONC,
author = "S. Fried",
title = "Optimizing numeric coprocessing",
journal = jBYTE,
volume = "14",
number = "11",
pages = "221224",
month = "????",
year = "1989",
CODEN = "BYTEDJ",
ISSN = "03605280 (print), 10827838 (electronic)",
ISSNL = "03605280",
bibdate = "Thu Sep 12 17:47:21 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
classification = "C5230 (Digital arithmetic methods); C5470
(Performance evaluation and testing)",
fjournal = "BYTE Magazine",
keywords = "Addition; Compiler optimizations; CPU code;
Floatingpoint operations; Multiplication; Numeric
coprocessing; Optimisation; Weitek 3167",
thesaurus = "Computer testing; Digital arithmetic; Performance
evaluation; Satellite computers",
}˜…9Šs
@Article{Frey:2010:ABC,
author = "Gerhard Frey",
title = "The Arithmetic Behind Cryptography",
journal = jNAMS,
volume = "57",
number = "3",
pages = "366374",
month = mar,
year = "2010",
CODEN = "AMNOAN",
ISSN = "00029920 (print), 10889477 (electronic)",
ISSNL = "00029920",
bibdate = "Mon Feb 22 15:35:29 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.ams.org/notices/201003/",
acknowledgement = acknhfb,
fjournal = "Notices of the American Mathematical Society",
journalURL = "http://www.ams.org/notices/",
}R„ˆ
@Article{Freiman:1967:CDU,
author = "C. V. Freiman and others",
title = "Composite Division Unit",
journal = jIBMTDB,
volume = "9",
number = "8",
pages = "994995",
month = jan,
year = "1967",
CODEN = "IBMTAA",
ISSN = "00188689",
bibdate = "Tue Jan 08 22:40:53 2008",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IBM Technical Disclosure Bulletin",
}z…H‹
@Article{Freiman:1961:SAC,
author = "C. V. Freiman",
title = "Statistical analysis of certain binary division
algorithms",
journal = jIREPROC,
volume = "49",
number = "1",
pages = "91103",
month = jan,
year = "1961",
bibdate = "Mon Sep 16 16:12:21 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acksfo # " and " # acknhfb,
fjournal = "IRE Proceedings",
xxnote = "Check author name: I have found this paper cited both
as Freiman and as Frieman?? Hennessy and Patterson
\cite{Hennessy:2002:CAQ} have Freiman.",
}¶‡Ž
@Article{Freeman:1967:CMS,
author = "Herbert Freeman",
title = "Calculation of Mean Shift for a Binary Multiplier
Using $2$, $3$, or $4$ Bits at a Time",
journal = jIEEETRANSELECCOMPUT,
volume = "EC16",
number = "6",
pages = "864866",
month = dec,
year = "1967",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1967.264752",
ISSN = "03677508",
bibdate = "Wed Jul 13 21:15:06 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4039205",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Electronic Computers",
}y
ß Vßs W #/1]'O577E…I;#1!C%1]“Aarticlefparith.bibForsythe:1959:RNRGeorge E. ForsytheReprint of a Note on RoundingOff ErrorsjSIAMREVIEW1166671959SIREADhttp://dx.doi.org/10.1137/100101100361445 (print), 10957200 (electronic) OR 00361445 (print), 10957200 (electronic)00361445 OR 0036144565.00MR0099119 (20 \#5563)Thu Mar 27 09:04:24 MDT 2014http://epubs.siam.org/toc/siread/1/1; http://www.math.utah.edu/pub/bibnet/authors/f/forsythegeorgeelmer.bib; http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg2ed.bib; http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/siamreview.bib2014.03.27 09:04:24 MDTSIAM Reviewnumerical analysis0168.14002acknhfbhttp://epubs.siam.org/sirevJanuary 1959George E. ForsytheReprint of a Note on RoundingOff Errors
@Article{Forsythe:1959:RNR,
author = "George E. Forsythe",
title = "Reprint of a Note on RoundingOff Errors",
journal = jSIAMREVIEW,
volume = "1",
number = "1",
pages = "6667",
month = "????",
year = "1959",
CODEN = "SIREAD",
DOI = "http://dx.doi.org/10.1137/1001011",
ISSN = "00361445 (print), 10957200 (electronic)",
ISSNL = "00361445",
MRclass = "65.00",
MRnumber = "MR0099119 (20 \#5563)",
bibdate = "Thu Mar 27 09:04:24 MDT 2014",
bibsource = "http://epubs.siam.org/toc/siread/1/1;
http://www.math.utah.edu/pub/bibnet/authors/f/forsythegeorgeelmer.bib;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg2ed.bib;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/siamreview.bib",
ZMnumber = "0168.14002",
acknowledgement = acknhfb,
fjournal = "SIAM Review",
journalURL = "http://epubs.siam.org/sirev",
keywords = "numerical analysis",
onlinedate = "January 1959",
}&Y#+I!57E‚;?cI!)articlefparith.bibErcoli:1959:BADPaolo Ercoli and Roberto VaccaBinary Arithmetic for Discretely Variable Word Length in a Serial ComputerjCACM241315apr41959CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Wed Jul 14 15:48:22 MDT 2004http://dblp.unitrier.de/db/journals/cacm/cacm2.html#ErcoliV59; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/fparith.bib2004.07.14 15:48:22 MDTCommunications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Paolo Ercoli and Roberto VaccaBinary Arithmetic for Discretely Variable Word Length in a Serial Computer
@Article{Ercoli:1959:BAD,
author = "Paolo Ercoli and Roberto Vacca",
title = "Binary Arithmetic for Discretely Variable Word Length
in a Serial Computer",
journal = jCACM,
volume = "2",
number = "4",
pages = "1315",
month = apr,
year = "1959",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Wed Jul 14 15:48:22 MDT 2004",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm2.html#ErcoliV59;
http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "ErcoliV59",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ErcoliV59",
}number = "MR0099119 (20 \#5563)",
bibdate = "Thu Mar 27 09:04:24 MDT 2014",
bibsource = "http://epubs.siam.org/toc/siread/1/1;
http://www.math.utah.edu/pub/bibnet/authors/f/forsythegeorgeelmer.bib;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg2ed.bib;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/siamreview.bib",
ZMnumber = "0168.14002",
acknowledgement = acknhfb,
fjournal = "SIAM Review",
journalURL = "http://epubs.siam.org/sirev",
keywords = "numerical analysis",
onlinedate = "January 1959",
}‰
S æS‹W #+?;a7E‚;]?Œaarticlefparith.bibGarner:1959:RNSHarvey L. GarnerThe Residue Number SystemjIRETRANSELECCOMPUTEC82140147jun61959IRELAOhttp://dx.doi.org/10.1109/TEC.1959.521951503679950 OR 03679950Thu Jul 14 15:56:44 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 15:56:44 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219515IRE Transactions on Electronic ComputersacknhfbHarvey L. GarnerThe Residue Number System
@Article{Garner:1959:RNS,
author = "Harvey L. Garner",
title = "The Residue Number System",
journal = jIRETRANSELECCOMPUT,
volume = "EC8",
number = "2",
pages = "140147",
month = jun,
year = "1959",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1959.5219515",
ISSN = "03679950",
bibdate = "Thu Jul 14 15:56:44 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219515",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}Œ
Y #+;a7E‚;]Oarticlefparith.bibGarner:1959:RMSHarvey L. GarnerA Ring Model for the Study of Multiplication for Complement CodesjIRETRANSELECCOMPUTEC812530mar31959IRELAOhttp://dx.doi.org/10.1109/TEC.1959.522275703679950 OR 03679950Thu Jul 14 15:56:44 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 15:56:44 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5222757IRE Transactions on Electronic ComputersacknhfbHarvey L. GarnerA Ring Model for the Study of Multiplication for Complement Codes
@Article{Garner:1959:RMS,
author = "Harvey L. Garner",
title = "A Ring Model for the Study of Multiplication for
Complement Codes",
journal = jIRETRANSELECCOMPUT,
volume = "EC8",
number = "1",
pages = "2530",
month = mar,
year = "1959",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1959.5222757",
ISSN = "03679950",
bibdate = "Thu Jul 14 15:56:44 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5222757",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
Œ
Y '#''‚U=m;M''‚UŒinproceedingsfparith.bibHenrici:1959:TESPeter HenriciProceedings of the International Conference on Information Processing, UNESCOTheoretical and Experimental Studies on the Accumulation of Error in the Numerical Solution of Initial Value Problems for Systems of Ordinary Differential Equations36431959Fri Aug 20 09:11:32 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.08.20 09:11:32 ???Cited in cite Sterbenz:1974:FPC.acknhfbPeter HenriciProceedings of the International Conference on Information Processing, UNESCOTheoretical and Experimental Studies on the Accumulation of Error in the Numerical Solution of Initial Value Problems for Systems of Ordinary Differential Equations
@InProceedings{Henrici:1959:TES,
author = "Peter Henrici",
editor = "????",
booktitle = "Proceedings of the International Conference on
Information Processing, UNESCO",
title = "Theoretical and Experimental Studies on the
Accumulation of Error in the Numerical Solution of
Initial Value Problems for Systems of Ordinary
Differential Equations",
publisher = "????",
address = "????",
pages = "3643",
year = "1959",
LCCN = "????",
bibdate = "Fri Aug 20 09:11:32 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}‰eY'#'A7'%=m;A7‰einproceedingsfparith.bibGray:1959:NFPH. L. Gray and C. HarrisonProceedings of the Eastern Joint Computer Conference, Boston, MA, December 13, 1959Normalized floatingpoint arithmetic with an index of significance16pubAFIPSpubAFIPS:adr2442481959TK7885.A1 J6Tue Oct 09 09:43:31 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.10.09 09:43:31 ???acknhfbH. L. Gray and C. HarrisonProceedings of the Eastern Joint Computer Conference, Boston, MA, December 13, 1959Normalized floatingpoint arithmetic with an index of significance
@InProceedings{Gray:1959:NFP,
author = "H. L. Gray and C. Harrison",
booktitle = "Proceedings of the Eastern Joint Computer Conference,
Boston, MA, December 13, 1959",
title = "Normalized floatingpoint arithmetic with an index of
significance",
volume = "16",
publisher = pubAFIPS,
address = pubAFIPS:adr,
pages = "244248",
year = "1959",
LCCN = "TK7885.A1 J6",
bibdate = "Tue Oct 09 09:43:31 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}
“ à“ŒIY #)+1;a7E‚;]+1q
articlefparith.bibLucal:1959:AODHarold M. LucalArithmetic Operations for Digital Computers Using a Modified Reflected Binary CodejIRETRANSELECCOMPUTEC84449458dec121959IRELAOhttp://dx.doi.org/10.1109/TEC.1959.522205703679950 OR 03679950Thu Jul 14 15:56:45 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 15:56:45 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5222057IRE Transactions on Electronic ComputersacknhfbHarold M. LucalArithmetic Operations for Digital Computers Using a Modified Reflected Binary Code
@Article{Lucal:1959:AOD,
author = "Harold M. Lucal",
title = "Arithmetic Operations for Digital Computers Using a
Modified Reflected Binary Code",
journal = jIRETRANSELECCOMPUT,
volume = "EC8",
number = "4",
pages = "449458",
month = dec,
year = "1959",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1959.5222057",
ISSN = "03679950",
bibdate = "Thu Jul 14 15:56:45 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5222057",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}ŒZ #71=57;K;[1QŒarticlefparith.bibKogbetliantz:1959:CSCE. G. KogbetliantzComputation of $ sin N $, $ cos N $, and $M$ th Root of $N$ Using an Electronic ComputerjIBMJRD32147152apr41959IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Thu Sep 1 10:15:56 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:15:56 ???IBM Journal of Research and Developmentacknjhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520E. G. KogbetliantzComputation of $ \sin {N} $, $ \cos {N} $, and {$M$ th} Root of {$N$} Using an Electronic Computer
@Article{Kogbetliantz:1959:CSC,
author = "E. G. Kogbetliantz",
title = "Computation of $ \sin {N} $, $ \cos {N} $, and {$M$
th} Root of {$N$} Using an Electronic Computer",
journal = jIBMJRD,
volume = "3",
number = "2",
pages = "147152",
month = apr,
year = "1959",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Thu Sep 1 10:15:56 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
" â"„x‰q
@Article{Payne:1986:PTF,
author = "Mary H. Payne",
title = "Proposal for the transfer of floating point data",
joˆ2e
@Article{Pearce:2007:MLH,
author = "Roman Pearce and Michael Monagan",
title = "A {Maple} library for high performance sparse
–¬
@Article{Pence:2010:OCF,
author = "W. D. Pence and R. L. White and R. Seaman",
title = "Optimal Compression of Floatingpoint Astronomical
Images Without Significant Loss of Information",
journal = "arXiv.org",
volume = "??",
number = "??",
pages = "????",
day = "7",
month = jul,
year = "2010",
CODEN = "????",
ISSN = "????",
ISSNL = "????",
bibdate = {‰’
@Article{Pei:1984:CAD,
author = "SooChang Pei and KuoChih Ho",
title = "Comments on {``Adaptive digital control implemented
using residue number systems''}",
journal = jIEEETRANSAUTOMATCONTR,
volume = "29",
number = "9",
pages = "863863",
month = sep,
year = "1984",
CODEN = "IETAA9",
DOI = "http://dx.doi.org/10.1109/TC.1984.1676355",
ISSN = "00189286",
ISSk‡U+
@Article{Pedram:2014:AAF,
author = "Ardavan Pedram and Andreas Gerstlauer and Robert A.
van de Geijn",
title = "Algorithm, Architecture, and FloatingPoint Unit
Codesign of a Matrix Factorization Accelerator",
journal = jIEEETRANSCOMPUT,
volume = "63",
number = "8",
pages = "18541867",
month = aug,
year = "2014",
CODEN = "ITCOB4",
DOI = "http://doi.ieeecomputersociety.org/10.1109/TC.2014.2315627",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Mon Aug 25 08:24:32 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}¹„>ˆ}
@Article{Pedersen:1980:HBM,
author = "P. W. Pedersen",
title = "Hvordan beregner man kvadratroden? \toenglish {How do
you calculate the square root?} \endtoenglish",
journal = "Elektronik (Denmark)",
volume = "??",
number = "4",
pages = "1821",
month = apr,
year = "1980",
bibdate = "Fri Sep 16 16:30:41 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
}¹ˆ2e
@Article{Pearce:2007:MLH,
author = "Roman Pearce and Michael Monagan",
title = "A {Maple} library for high performance sparse
polynomial arithmetic",
journal = jACMCOMMCOMPALGEBRA,
volume = "41",
number = "3",
pages = "110111",
month = sep,
year = "2007",
CODEN = "????",
DOI = "http://doi.acm.org/10.1145/1358190.1358203",
ISSN = "19322232 (print), 19322240 (eª“¦
@Article{Payne:1990:PLCb,
author = "M. Payne and C. Schaffert and B. Wichmann",
title = "Proposal for a language compatible arithmetic
standard",
journal = jSIGPLAN,
volume = "25",
number = "1",
pages = "5986",
month = jan,
year = "1990",
CODEN = "SINODQ",
ISSN = "03621340 (print), 15232867 (print), 15581160
(electronic)",
ISSNL = "03621340",
š
/ å/‡2W #+Y=m;'ˆ
articlefparith.bibPawlak:1959:EDCZ. PawlakAn electronic digital computer based on the `$  2 $' system,Bull. Acad. Pol. Sci., Ser. Sci. Tech.77137221959Thu Nov 06 05:58:31 2014http://www.math.utah.edu/pub/tex/bib/fparith.bib2014.11.06 05:58:31 ???negative baseacknhfbZ. PawlakAn electronic digital computer based on the `$  2 $' system,
@Article{Pawlak:1959:EDC,
author = "Z. Pawlak",
title = "An electronic digital computer based on the `$  2 $'
system,",
journal = "Bull. Acad. Pol. Sci., Ser. Sci. Tech.",
volume = "7",
number = "??",
pages = "713722",
month = "????",
year = "1959",
bibdate = "Thu Nov 06 05:58:31 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "negative base",
}ŒY #+#57;u;1Me#9articlefparith.bibMuller:1959:CMGMervin E. MullerA Comparison of Methods for Generating Normal Deviates on Digital ComputersjJACM63376383jul71959JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Tue Nov 1 09:33:26 1994ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.11.01 09:33:26 ???Journal of the ACMCited in cite Sterbenz:1974:FPC.acknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J401Mervin E. MullerA Comparison of Methods for Generating Normal Deviates on Digital Computers
@Article{Muller:1959:CMG,
author = "Mervin E. Muller",
title = "A Comparison of Methods for Generating Normal Deviates
on Digital Computers",
journal = jJACM,
volume = "6",
number = "3",
pages = "376383",
month = jul,
year = "1959",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Tue Nov 1 09:33:26 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
descriptors = "RVG",
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}
¿ ¿‹>W #1[;a7E‚;][articlefparith.bibRothstein:1959:RBNJerome RothsteinResidues of Binary Numbers Modulo ThreejIRETRANSELECCOMPUTEC82229229jun61959IRELAOhttp://dx.doi.org/10.1109/TEC.1959.521952903679950 OR 03679950Thu Jul 14 15:56:45 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 15:56:45 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219529IRE Transactions on Electronic ComputersacknhfbJerome RothsteinResidues of Binary Numbers Modulo Three
@Article{Rothstein:1959:RBN,
author = "Jerome Rothstein",
title = "Residues of Binary Numbers Modulo Three",
journal = jIRETRANSELECCOMPUT,
volume = "EC8",
number = "2",
pages = "229229",
month = jun,
year = "1959",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1959.5219529",
ISSN = "03679950",
bibdate = "Thu Jul 14 15:56:45 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219529",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}Œ{Y #/M;a7E‚;]MŽarticlefparith.bibPfeiffer:1959:FQMPaul E. PfeifferA FourQuadrant Multiplier Using Triangular Waves, Diodes, Resistors, and Operational AmplifiersjIRETRANSELECCOMPUTEC82222227jun61959IRELAOhttp://dx.doi.org/10.1109/TEC.1959.521952603679950 OR 03679950Thu Jul 14 15:56:45 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 15:56:45 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219526IRE Transactions on Electronic ComputersacknhfbPaul E. PfeifferA FourQuadrant Multiplier Using Triangular Waves, Diodes, Resistors, and Operational Amplifiers
@Article{Pfeiffer:1959:FQM,
author = "Paul E. Pfeiffer",
title = "A FourQuadrant Multiplier Using Triangular Waves,
Diodes, Resistors, and Operational Amplifiers",
journal = jIRETRANSELECCOMPUT,
volume = "EC8",
number = "2",
pages = "222227",
month = jun,
year = "1959",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1959.5219526",
ISSN = "03679950",
bibdate = "Thu Jul 14 15:56:45 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219526",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}source = "http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Sarafyan59;
http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See comments \cite{Traub:1960:CNM}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Sarafyan59",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sarafyan59",
}”
ŽY #//'57E‚};?c/+!
articlefparith.bibSheridan:1959:ATCPeter B. SheridanThe Arithmetic Translator Compiler of the IBM FORTRAN Automatic Coding SystemjCACM22921feb21959CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Wed Jul 14 15:48:22 MDT 2004http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Sheridan59; http://ei.cs.vt.edu/~cs4304/bibliography.html; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/fparith.bib2004.07.14 15:48:22 MDTCommunications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Peter B. SheridanThe Arithmetic Translator Compiler of the {IBM FORTRAN Automatic Coding System}
@Article{Sheridan:1959:ATC,
author = "Peter B. Sheridan",
title = "The Arithmetic Translator Compiler of the {IBM FORTRAN
Automatic Coding System}",
journal = jCACM,
volume = "2",
number = "2",
pages = "921",
month = feb,
year = "1959",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Wed Jul 14 15:48:22 MDT 2004",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Sheridan59;
http://ei.cs.vt.edu/~cs4304/bibliography.html;
http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Sheridan59",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sheridan59",
}dY #/)57E‚;O?c)Suarticlefparith.bibSarafyan:1959:NMCDiran SarafyanA New Method of Computation of Square Roots Without Using DivisionjCACM2112324nov111959CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Wed Jul 14 15:48:24 MDT 2004http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Sarafyan59; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/fparith.bib2004.07.14 15:48:24 MDTSee comments cite Traub:1960:CNM.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Diran SarafyanSee comments \cite{Traub:1960:CNM}.A New Method of Computation of Square Roots Without Using Division
@Article{Sarafyan:1959:NMC,
author = "Diran Sarafyan",
title = "A New Method of Computation of Square Roots Without
Using Division",
journal = jCACM,
volume = "2",
number = "11",
pages = "2324",
month = nov,
year = "1959",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Wed Jul 14 15:48:24 MDT 2004",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Sarafyan59;
http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See comments \cite{Traub:1960:CNM}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Sarafyan59",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sarafyan59",
}T 2004",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Sheridan59;
http://ei.cs.vt.edu/~cs4304/bibliography.html;
http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Sheridan59",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sheridan59",
}•
. .kY #)57E‚K;?Oc)articlefparith.bibTaranto:1959:BCFDonald TarantoBinary Conversion, with Fixed Decimal Precision, of a Decimal FractionjCACM272727jul71959CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Mon Jan 22 07:25:37 MST 2001ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Taranto59; http://www.math.utah.edu/pub/tex/bib/fparith.bib2001.01.22 07:25:37 MSTCommunications of the ACMdecimal floatingpoint arithmeticacknjhttp://portal.acm.org/browse_dl.cfm?idx=J79Donald TarantoBinary Conversion, with Fixed Decimal Precision, of a Decimal Fraction
@Article{Taranto:1959:BCF,
author = "Donald Taranto",
title = "Binary Conversion, with Fixed Decimal Precision, of a
Decimal Fraction",
journal = jCACM,
volume = "2",
number = "7",
pages = "2727",
month = jul,
year = "1959",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 22 07:25:37 MST 2001",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Taranto59;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "decimal floatingpoint arithmetic",
oldlabel = "Taranto59",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Taranto59",
}_X #/#g[57Em;‚E5O#g!articlefparith.bibStrachey:1959:TSRC. StracheyOn taking the square root of a complex numberjCOMPJ228989jul71959CMPJA6http://dx.doi.org/10.1093/comjnl/2.2.8900104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Fri Sep 29 08:55:11 MDT 2000http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_02/2000.09.29 08:55:11 MDThttp://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_02/020089.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_02/tiff/89.tifThe Computer Journalacknhfbhttp://comjnl.oxfordjournals.org/C. StracheyOn taking the square root of a complex number
@Article{Strachey:1959:TSR,
author = "C. Strachey",
title = "On taking the square root of a complex number",
journal = jCOMPJ,
volume = "2",
number = "2",
pages = "8989",
month = jul,
year = "1959",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/2.2.89",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Fri Sep 29 08:55:11 MDT 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_02/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_02/020089.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_02/tiff/89.tif",
acknowledgement = acknhfb,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}ibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://dblp.unitrier.de/db/journals/cacm/cacm2.html#Taranto59;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "decimal floatingpoint arithmetic",
oldlabel = "Taranto59",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Taranto59",
}—
8¨8’lX #'g57E‚;‡'5O'g”karticlefparith.bibWensley:1959:CNAJ. H. WensleyA Class of NonAnalytical Iterative ProcessesjCOMPJ14163167jan11959CMPJA600104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Fri Sep 29 08:55:07 MDT 2000Compiler/semantics.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/2000.09.29 08:55:07 MDThttp://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/010163.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/163.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/164.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/165.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/166.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/167.tifThe Computer Journalacknhfbhttp://comjnl.oxfordjournals.org/J. H. WensleyA Class of NonAnalytical Iterative Processes
@Article{Wensley:1959:CNA,
author = "J. H. Wensley",
title = "A Class of NonAnalytical Iterative Processes",
journal = jCOMPJ,
volume = "1",
number = "4",
pages = "163167",
month = jan,
year = "1959",
CODEN = "CMPJA6",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Fri Sep 29 08:55:07 MDT 2000",
bibsource = "Compiler/semantics.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/010163.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/163.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/164.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/165.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/166.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/167.tif",
acknowledgement = acknhfb,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}ˆTV #+%e;7;K;]%i‰]articlefparith.bibVolder:1959:CTCJ. E. VolderThe CORDIC Trigonometric Computing TechniquejIRETRANSELECCOMPUTEC85330334sep91959IRELAO03679950 OR 03679950Thu Sep 1 10:15:31 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:15:31 ???IRE Transactions on Electronic ComputersacknjJ. E. VolderThe {CORDIC} Trigonometric Computing Technique
@Article{Volder:1959:CTC,
author = "J. E. Volder",
title = "The {CORDIC} Trigonometric Computing Technique",
journal = jIRETRANSELECCOMPUT,
volume = "EC8",
number = "5",
pages = "330334",
month = sep,
year = "1959",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Thu Sep 1 10:15:31 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IRE Transactions on Electronic Computers",
} http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/010163.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/163.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/164.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/165.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/166.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_04/tiff/167.tif",
acknowledgement = acknhfb,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}™
âf
R
àLú<fˆ&M
@MastersThesis{Hoyt:1992:MFP,
author = "Brian S. Hoyt",
title = "The {Macintosh} floating point arithmetic
visualization system",
type = "Thesis ({M.S.Electrical Engineering„z‰u
@MastersThesis{Ho:1995:FPI,
author = "Lei Ho",
title = "Floating point implementation for {Motorola HC6811C}:
{GNU C} crosscompiler",
type = "{Master}'s Thesis",
school = "Department of Electrical Engineering, Ryerson
Polytechnic University",
address = "Toronto, Ontario, Canada",
year = "1995",
bibdate = "Mon Apr 18 06:29:41 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
xxnote = "Check thesis type?? Ryerson library catalog does not
specify.",
}ŸA
@MastersThesis{Ho„ˆ
@MastersThesis{Hix:1997:CTV,
author = "Robert W. Hix",
title = "A comparison of two {VHDL} design environments for
{FPGA}based computer arithmetic",
type = "Thesis ({M.S.})",
school = "Tennessee Technological University",
address = "Cookeville, TN, USA",
pages = "x + 301",
year = "1997",
bibdate = "Mon Mar 05 14:38:08 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}
ÅHm
@MastersThesis{Holler:1993:IFP,
author = "Paul T. Holler"ƒn‡]
@MastersThesis{Hirn:1999:GBI,
author = "Ulrich Hirn",
title = "{Groebner} bases implementation using modular and
floating point arithmetic",
type = "{Dipl.Arb.}",
school = "Technische Universit{\"a}t Graz",
address = "Graz, Austria",
pages = "87",
year = "1999",
bibdate = "Thu May 09 09:37:46 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}Ê…"ŠE
@MastersThesis{Ho:1988:ADI,
author = "Naven Chuen Wing Ho",
title = "Analysis and design of an instantaneous floating point
amplifier",
type = "Thesis ({M.S.})",
school = "Dept. of Electrical Engineering, Cullen College of
Engineering, University of Houston",
address = "Houston, TX, USA",
pages = "xv + 185",
year = "1988",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "Amplifiers (Electronics); Seismic waves  Data
processing.",
}„p‰a
@MastersThesis{Helsley:1995:SZL,
author = "Harold David Helsley",
title = "A study of zeroinput limit cycles in floatingpoint
digital signal processors",
type = "Thesis ({M.S.})",
school = "University of Tennessee, Knoxville",
address = "Knoxville, TN, USA",
pages = "vii + 65",
year = "1995",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "Limit cycles.; Signal processing  Digital
techniques.",
}š…,ŠY
@MastersThesis{Helminen:1988:AFP,
author = "Brenda K. Helminen",
title = "An analysis of the floating point and communication
performance of the {FPS} {TSeries} hypercube",
type = "Thesis ({M.S.})",
school = "Michigan Technological University",
address = "Houghton, MI, USA",
pages = "viii + 69",
year = "1988",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "Michigan Technological University.  Theses
({M.S.}).; MTU Computer Science.  Thesis ({M.S.}).",
}
aûaY #3'57Eƒ;Qo'ŽSarticlefparith.bibBockstaele:1960:NFAP. BockstaeleNotes on the First Arithmetics Printed in Dutch and EnglishjISIS513315321sep91960ISISA400211753 (print), 15456994 (electronic) OR 00211753 (print), 15456994 (electronic)00211753 OR 00211753Tue Jul 30 21:28:03 MDT 2013http://www.jstor.org/action/showPublication?journalCode=isis; http://www.jstor.org/stable/i302265; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/isis1960.bib2013.07.30 21:28:03 MDThttp://www.jstor.org/stable/226510Isisacknhfbhttp://www.jstor.org/page/journal/isis/about.htmlP. BockstaeleNotes on the First Arithmetics Printed in {Dutch} and {English}
@Article{Bockstaele:1960:NFA,
author = "P. Bockstaele",
title = "Notes on the First Arithmetics Printed in {Dutch} and
{English}",
journal = jISIS,
volume = "51",
number = "3",
pages = "315321",
month = sep,
year = "1960",
CODEN = "ISISA4",
ISSN = "00211753 (print), 15456994 (electronic)",
ISSNL = "00211753",
bibdate = "Tue Jul 30 21:28:03 MDT 2013",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/i302265;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/isis1960.bib",
URL = "http://www.jstor.org/stable/226510",
acknowledgement = acknhfb,
fjournal = "Isis",
journalURL = "http://www.jstor.org/page/journal/isis/about.html",
}ˆW '#)/E3=Em;/ˆ!mastersthesisfparith.bibYoung:1959:SSMJohn Mackay YoungA study of some methods of numerical integration using floating point arithmeticThesis (M.S. in Mathematics)Texas A.&M. CollegeCollege Station, TX, USA501959Sat Feb 24 15:01:45 MST 1996http://www.math.utah.edu/pub/tex/bib/fparith.bib1996.02.24 15:01:45 MSTacknhfbJohn Mackay YoungA study of some methods of numerical integration using floating point arithmetic
@MastersThesis{Young:1959:SSM,
author = "John Mackay Young",
title = "A study of some methods of numerical integration using
floating point arithmetic",
type = "Thesis ({M.S. in Mathematics})",
school = "Texas A.\&M. College",
address = "College Station, TX, USA",
pages = "50",
year = "1959",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}´ç÷S
ƒ2çÁF…T‹)
@Article{Guizzo:2005:IRS,
author = "E. Guizzo",
title = "{IBM} reclaims supercomputer lead",
journal = jIEEESPECTRUM,
volume = "42",
number = "2",
pages = "1516",
month = feb,
year = "2005",
CODEN = "IEESAM",
DOI = "http://dx.doi.org/10.1109/MSPEC.2005.1389501",
ISSN = "00189235 (print), 19399340 (electronic)",
ISSNL = "00189235",
bibdate = "Thu Sep 01 16:25:09 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Spectrum",
keywords = "70 Tflops; floatingpoint arithmetic; IBM Glue
Gene/L",
}PÁ‡ti
@Article{Gupta:1996:AAG,
author = "S. Gupta and J. Rajski and J. Tyszer",
title = "Arithmetic additive generators of pseudoexhaustive
test patterns",
journal = jIEEETRANSCOMPUT,
volume = "45",
number = "8",
pages = "939949",
month = aug,
year = "1996",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.536236",
ISSN = "00189340 (print), 15579956 (electroni¨
F~…I‹
@Article{Gueron:1999:FFP,
author = "Shay Gueron",
title = "Flying in a floating (point) world",
Ì„K‰
@Article{Gu:1990:TIT,
author = "Li Zhen Gu and Xing Yuan Chen",
title = "Tabledriven implementation of the trigonometric
functions using {IEEE} floating point operations.
({Chinese})",
journal = "J. Tsinghua Univ.",
volume = "30",
number = "3",
pages = "3138",
year = "1990",
MRclass = "65D20 (6504)",
MRnumber = "92a:65070",
bibdate = "Fri Dec 8 08:24:13 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
} =¶ƒJ‡
@Article{Grosse:1987:UCB,
author = "Eric Grosse and Cleve Moler",
title = "Underflow can be Harmful",
journal = jSIAMNEWS,
volume = "20",
number = "6",
pages = "1",
year = "1987",
ISSN = "00361437",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/g/grosseeric.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
fjournal = "SIAM News",
}ƒ`‘9¢s
@Article{Green:1973:NTF,
author = "D. H. Green and R. G. Kelsch",
title = "Nonlinear Ternary Feedback Shift Registers",
journal = jCOMPJ,
volume = "16",
number = "4",
pages = "360367",
month = nov,
year = "1973",
CODEN = "CMPJA6",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Fri Sep 29 08:52:16 MDT 2000",
bibsource = "Compendex datÄÇ…4Ši
@Article{Grassmann:1989:PAR,
author = "Winfried K. Grassmann",
title = "A probabilistic analysis of rounding errors of
floating point numbers. Eighteenth ‹–?
@Article{Grehan:1988:BBL,
author = "R. Grehan and T. Thompson",
title = "{Borland} beefs up its languages",
journal = jBYTE,
volume = "13",
number = "10",
pages = "151154",
month = oct,
year = "1988",
CODEN = "BYTEDJ",
ISSN = "03605280 (print), 10827838 (electronic)",
ISSNL = "03605280",
bibdate = "Thu Sep 12 17:54:09 MDT 1996",
bibsource = "http://www.math.utah.edu/p ¹
# Þ#‹7W #'%e;a7E‚;]%eŒ{articlefparith.bibCroy:1960:IADJohn E. CroyImproved Arrangement of a Decimal MultiplierjIRETRANSELECCOMPUTEC92263263jun61960IRELAOhttp://dx.doi.org/10.1109/TEC.1960.521983003679950 OR 03679950Thu Jul 14 15:34:11 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 15:34:11 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219830IRE Transactions on Electronic ComputersacknhfbJohn E. CroyImproved Arrangement of a Decimal Multiplier
@Article{Croy:1960:IAD,
author = "John E. Croy",
title = "Improved Arrangement of a Decimal Multiplier",
journal = jIRETRANSELECCOMPUT,
volume = "EC9",
number = "2",
pages = "263263",
month = jun,
year = "1960",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1960.5219830",
ISSN = "03679950",
bibdate = "Thu Jul 14 15:34:11 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219830",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}ŒY #));a7E‚;])Uarticlefparith.bibBrown:1960:EDCDavid T. BrownError Detecting and Correcting Binary Codes for Arithmetic OperationsjIRETRANSELECCOMPUTEC93333337sep91960IRELAOhttp://dx.doi.org/10.1109/TEC.1960.521985503679950 OR 03679950Thu Jul 14 15:34:12 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 15:34:12 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219855IRE Transactions on Electronic ComputersacknhfbDavid T. BrownError Detecting and Correcting Binary Codes for Arithmetic Operations
@Article{Brown:1960:EDC,
author = "David T. Brown",
title = "Error Detecting and Correcting Binary Codes for
Arithmetic Operations",
journal = jIRETRANSELECCOMPUT,
volume = "EC9",
number = "3",
pages = "333337",
month = sep,
year = "1960",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1960.5219855",
ISSN = "03679950",
bibdate = "Thu Jul 14 15:34:12 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219855",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
ž"
3Dž‘¢)
@Article{DeDinechin:2008:OPF,
author = "Florent {De Dinechin} and Christoph Quirin Lauter",
title = "Optimizing polynomials for floatingpoint
implementation",
journal = "arXiv.org",
volume = "??",
number = "??",
pages = "112",
day = "4",
month = mar,
year = "2008",
CODEN = "????",
ISSN = "????",
ISSNL = "????",
bibdate = "Wed Sep 30 12:43:49 MDT 20”¨!
@Article{DeDinechin:2008:CFP,
author = "Florent {De Dinechin} and Christoph Quirin Lauter and
Guillaume Melquiond",
title = "Certifying floatingpoint implementations using
{Gappa}",
journal = "arXiv.org",
volume = "??",
number = "??",
pages = "????",
day = "3",
month = jan,
year = "2008",
CODEN = "????",
ISSN = "????",
ISSNL = "????",
bÿ‡F
@Article{De:2013:FIM,
author = "Anindya De and Piyush P. Kurur and Chandan Saha and
Ramprasad Saptharishi",
title = "Fast Integer Multiplication Using Modular Arithmetic",
journal = jSIAMJCOMPUT,
volume = "42",
number = "2",
pages = "685699",
month = "????",
year = "2013",
CODEN = "SMJCAT",
DOI = "http://dx.doi.org/10.1137/100811167",
ISSN = "00975397 (print), 10957111 (electronic)",
ISSNL = "00975397",
bibdate = "Tue Feb 11 17:21:19 MST 2014",
bibsource = "http://epubs.siam.org/sambin/dbq/toclist/SICOMP/42/2;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
acknowledgement = acknhfb,
fjournal = "SIAM Journal on Computing",
journalURL = "http://epubs.siam.org/sicomp",
onlinedate = "January 2013",
}]‡y
@Article{De:1994:FPA,
author = "M. De and B. P. Sinha",
title = "Fast parallel algorithm for ternary multiplication
using multivalued {$ I^2 L $} technology",
journal = jIEEETRANSCOMPUT,
volume = "43",
number = "5",
pages = "603607",
month = may,
year = "1994",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.280807",
ISSN = "00189340 (print), 15579956 (e×‘r£e
@Article{Dawson:1992:RLS,
author = "Jeffrey Dawson and Mary Payne and Craig Schaffert",
title = "The Role of {LIA1} in Software Portability",
journal = jSIGNUM,
volume = "27",
number = "4",
pages = "912",
month = oct,
year = "1992",
CODEN = "SNEWD6",
ISSN = "01635778 (print), 15580237 (electronic)",
ISSNL = "01635778",
bibdate = "Tue Apr 12 07:50:22 MDT 2005",
bibsource
‹m—[
@Article{Davis:1991:CC,
author = "Warren Davis and Kan Yabumoto",
title = "A coprocessor for a coprocessor?",
journal = jDDJ,
volume = "16",
number = "5",
pages = "1628, 8488",
month = may,
year = "1991",
CODEN = "DDJOEB",
ISSN = "1044789X",
bibdate = "Tue Sep 10 09:11:02 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
http://www.math.utah.e"Œ˜
@Article{Davis:1983:HSD,
author = "George R. Davis and Thomas M. King",
title = "A HighSpeed Digital Divider",
journal = jIEEETRANSINSTRUMMEAS,
volume = "IM32",
number = "2",
pages = "309312",
month = jun,
year = "1983",
CODEN = "IEIMAO",
DOI = "http://dx.doi.org/10.1109/TIM.1983.4315069",
ISSN = "00189456 (print), 15579662 (electronic)",
ISSNL = "00189456",
bibš
È £ÈWW #)!57Eƒ1;?c!articlefparith.bibGurzi:1960:HSMFred GurziA HighSpeed Multiplication Process for Digital ComputersjCACM34241245apr41960CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Fri Nov 25 18:19:26 MST 2005http://dblp.unitrier.de/db/journals/cacm/cacm3.html#Gurzi60; http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.11.25 18:19:26 MSTCommunications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Fred GurziA HighSpeed Multiplication Process for Digital Computers
@Article{Gurzi:1960:HSM,
author = "Fred Gurzi",
title = "A HighSpeed Multiplication Process for Digital
Computers",
journal = jCACM,
volume = "3",
number = "4",
pages = "241245",
month = apr,
year = "1960",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 25 18:19:26 MST 2005",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm3.html#Gurzi60;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Gurzi60",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gurzi60",
}ŒYY #+%57E‚5;??c%Ccarticlefparith.bibErcoli:1960:LEEPaolo ErcoliLetter to the Editor: Errors Due to Overflow in Arithmetic OperationsjCACM312A9A9dec121960CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Fri Nov 25 18:19:29 MST 2005http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.11.25 18:19:29 MSTSee cite Ercoli:1957:EDO.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Paolo ErcoliSee \cite{Ercoli:1957:EDO}.Letter to the {Editor}: {Errors} Due to Overflow in Arithmetic Operations
@Article{Ercoli:1960:LEE,
author = "Paolo Ercoli",
title = "Letter to the {Editor}: {Errors} Due to Overflow in
Arithmetic Operations",
journal = jCACM,
volume = "3",
number = "12",
pages = "A9A9",
month = dec,
year = "1960",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 25 18:19:29 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Ercoli:1957:EDO}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}tp://dblp.unitrier.de/db/journals/cacm/cacm3.html#Gurzi60;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Gurzi60",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gurzi60",
}Ÿ
‹x X !#+%m%1Em;m9%mŒktechreportfparith.bibJensen:1960:CIFB. A. JensenCoding instructions for floating point trigonometric, inverse trigonometric hyperbolic and exponential functionsGroup report30G0009Massachusetts Institute of Technology, Lincoln LaboratoryLexington, MA, USA71960Sat Feb 24 15:01:45 MST 1996http://www.math.utah.edu/pub/tex/bib/fparith.bib1996.02.24 15:01:45 MSTTrigonometrical functions  Computer programs.Cover title. ``Millstone Hill Radar Station.'' ``1 November 1960.'' Air Force ContractacknhfbB. A. JensenCoding instructions for floating point trigonometric, inverse trigonometric hyperbolic and exponential functions
@TechReport{Jensen:1960:CIF,
author = "B. A. Jensen",
title = "Coding instructions for floating point trigonometric,
inverse trigonometric hyperbolic and exponential
functions",
type = "Group report",
number = "30G0009",
institution = "Massachusetts Institute of Technology, Lincoln
Laboratory",
address = "Lexington, MA, USA",
pages = "7",
year = "1960",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "Trigonometrical functions  Computer programs.",
remark = "Cover title. ``Millstone Hill Radar Station.'' ``1
November 1960.'' Air Force Contract",
}i Nov 25 18:19:26 MST 2005",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm3.html#Knuth60;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
MathSciNet database",
note = "Errata, {\sl Commun\i\ca\tions of the ACM\/ \bf 4}
(August 1961), 355 \cite{Knuth:1961:EIN}. See
\cite{Nadler:1961:DSR} for extension to division and
square root.",
abstract = "For centuries the decimal number system reigned
supreme, except, perhaps, among the Mayan Indians,
until the advent of digital computers brought the
binary and octal systems into the limelight. This paper
introduces another number system which may prove useful
for manipulating complex numbers on machines.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Knuth60",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Knuth60",
ZMreviewer = "C. B. Haselgrove",
}¡
(Jq9JÀ¯Ñ˜°!
@Article{Jaffar:1992:AMC,
author = "Joxan Jaffar and Peter J. Stuckey and Spiro Michaylov
and Roland H. C. Yap",
title = "An abstract machine for {CLP$ (\mathcal {R}) $}",
journal = jSIGPLAN,
volume = "27",
number = "7",
pages = "128139",
month = jul,
year = "1992",
CODEN = "SINODQ",
ISBN = "0897914759",
ISBN13 = "9780897914758",
ISSN = "03621340 (p
3Œ9˜s
@Article{Jacobson:1992:ETF,
author = "David Jacobson",
title = "Engineer's Toolbox: Floating Point in {Mathematica}",
journal = jMATHEMATICAJ,
volume = "2",
number = "3",
pages = "4246",
month = "Summer",
year = "1992",
CODEN = "????",
ISSN = "10475974 (print), 10971610 (electronic)",
ISSNL = "10475974",
bibdate = "Sat Nov 6 13:33:40 MDT 2010",
bibsource = "http://ww
1©K
@Article{Ito:1996:SRI,
author = "Masayuki Ito and Naofumi Takagi and Shuzo Yajima",
title = "Square rooting by iterative multiplyadditions",
jŠ/”_
@Article{Jager:2008:DAD,
author = "Hendrik Jager and Pierre Liardet",
title = "Distributions arithm{\'e}tiques des d{\'e}nominateurs
de convergents de fractions continues. ({French})
[Arithmetic distributions of the denominators of
continued fractions]",
journal = "Proceedings of the Koninklijke Nederlandse Akademie
van Wetenschappen, Series A, Indagationes
mathematicae",
N›
@Article{Jaffer:2013:EAR,
author = "Aubrey Jaffer",
title = "Easy Accurate Reading and Writing of FloatingPoint
Numbers",
journal = "arXiv.org",
volume = "??",
number = "??",
pages = "17",
day = "28",
month = oct,
year = "2013",
CODEN = "????",
ISSN = "????",
ISSNL = "????",
MRclass = "65G04",
bibdate = "Wed Sep 30 12:43:49 MDT 2015",
bibs ‡@
@Article{Jager:1939:AAD,
author = "Robert Jager and Boyd C. Patterson",
title = "The Artificial Arithmetick in Decimals of {Robert
Jager} ({London}, 1651)",
journal = jISIS,
volume = "31",
number = "1",
pages = "2531",
month = nov,
year = "1939",
CODEN = "ISISA4",
ISSN = "00211753 (print), 15456994 (electronic)",
ISSNL = "00211753",
bibdate = "Tue Jul 30 21:26:49 MDT 2013",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/i302217;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/isis1930.bib",
URL = "http://www.jstor.org/stable/226014",
acknowledgement = acknhfb,
fjournal = "Isis",
journalURL = "http://www.jstor.org/page/journal/isis/about.html",
}!‡
Ž
@Article{Jacobsohn:1973:CDA,
author = "David H. Jacobsohn",
title = "A Combinatoric Division Algorithm for FixedInteger
Divisors",
journal = jIEEETRANSCOMPUT,
volume = "C22",
number = "6",
pages = "608610",
month = jun,
year = "1973",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1973.5009114",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Fri Nov 09 19:18:24 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.acsellab.com/arithmetic/arith2/papers/ARITH2_Jacobsohn.pdf",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "ARITH2",
}˜
€€š![ #)+A57Eƒ[;‚7„q?c„q+‚WAœarticlefparith.bibKnuth:1960:INSDonald E. KnuthAn Imaginary Number SystemjCACM34245247apr41960CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 0001078265.9923\#B554C. B. HaselgroveFri Nov 25 18:19:26 MST 2005http://dblp.unitrier.de/db/journals/cacm/cacm3.html#Knuth60; http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib; MathSciNet database2005.11.25 18:19:26 MSTErrata, sl Communications of the ACM bf 4 (August 1961), 355 cite Knuth:1961:EIN. See cite Nadler:1961:DSR for extension to division and square root.For centuries the decimal number system reigned supreme, except, perhaps, among the Mayan Indians, until the advent of digital computers brought the binary and octal systems into the limelight. This paper introduces another number system which may prove useful for manipulating complex numbers on machines.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79For centuries the decimal number system reigned supreme, except, perhaps, among the Mayan Indians, until the advent of digital computers brought the binary and octal systems into the limelight. This paper introduces another number system which may prove useful for manipulating complex numbers on machines.Donald E. KnuthErrata, {\sl Commun\i\ca\tions of the ACM\/ \bf 4} (August 1961), 355 \cite{Knuth:1961:EIN}. See \cite{Nadler:1961:DSR} for extension to division and square root.An Imaginary Number System
@Article{Knuth:1960:INS,
author = "Donald E. Knuth",
title = "An Imaginary Number System",
journal = jCACM,
volume = "3",
number = "4",
pages = "245247",
month = apr,
year = "1960",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "65.99",
MRnumber = "23\#B554",
MRreviewer = "C. B. Haselgrove",
bibdate = "Fri Nov 25 18:19:26 MST 2005",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm3.html#Knuth60;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
MathSciNet database",
note = "Errata, {\sl Commun\i\ca\tions of the ACM\/ \bf 4}
(August 1961), 355 \cite{Knuth:1961:EIN}. See
\cite{Nadler:1961:DSR} for extension to division and
square root.",
abstract = "For centuries the decimal number system reigned
supreme, except, perhaps, among the Mayan Indians,
until the advent of digital computers brought the
binary and octal systems into the limelight. This paper
introduces another number system which may prove useful
for manipulating complex numbers on machines.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Knuth60",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Knuth60",
ZMreviewer = "C. B. Haselgrove",
}
g
–2g‡G$W #+Y=m;'ˆ'articlefparith.bibPawlak:1960:ODCZ. PawlakThe organization of a digital computer based on the `$  2 $' systemBull. Acad. Pol. Sci., Ser. Tech. Sci.82532581960Thu Nov 06 06:00:08 2014http://www.math.utah.edu/pub/tex/bib/fparith.bib2014.11.06 06:00:08 ???negative baseacknhfbZ. PawlakThe organization of a digital computer based on the `$  2 $' system
@Article{Pawlak:1960:ODC,
author = "Z. Pawlak",
title = "The organization of a digital computer based on the `$
 2 $' system",
journal = "Bull. Acad. Pol. Sci., Ser. Tech. Sci.",
volume = "8",
number = "??",
pages = "253258",
month = "????",
year = "1960",
bibdate = "Thu Nov 06 06:00:08 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "negative base",
}Š`#Y #++9'57E
;A=+9‹Iarticlefparith.bibLowan:1960:PREbArnold N. LowanOn the Propagation of RoundOff Errors in the Numerical Treatment of the Wave EquationjMATHCOMPUT1471223228jul71960MCMPAF00255718 (print), 10886842 (electronic) OR 00255718 (print), 10886842 (electronic)00255718 OR 00255718Tue Oct 13 08:06:19 MDT 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.13 08:06:19 MDTMathematics of Computationacknhfbhttp://www.ams.org/mcom/Arnold N. LowanOn the Propagation of RoundOff Errors in the Numerical Treatment of the Wave Equation
@Article{Lowan:1960:PREb,
author = "Arnold N. Lowan",
title = "On the Propagation of RoundOff Errors in the
Numerical Treatment of the Wave Equation",
journal = jMATHCOMPUT,
volume = "14",
number = "71",
pages = "223228",
month = jul,
year = "1960",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Tue Oct 13 08:06:19 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "Mathematics of Computation",
journalURL = "http://www.ams.org/mcom/",
}Šf"Y #++='57E
;A=+=‹Marticlefparith.bibLowan:1960:PREaArnold N. LowanOn the Propagation of RoundOff Errors in the Numerical Integration of the Heat EquationjMATHCOMPUT1470139146apr41960MCMPAF00255718 (print), 10886842 (electronic) OR 00255718 (print), 10886842 (electronic)00255718 OR 00255718Tue Oct 13 08:06:19 MDT 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.13 08:06:19 MDTMathematics of Computationacknhfbhttp://www.ams.org/mcom/Arnold N. LowanOn the Propagation of RoundOff Errors in the Numerical Integration of the Heat Equation
@Article{Lowan:1960:PREa,
author = "Arnold N. Lowan",
title = "On the Propagation of RoundOff Errors in the
Numerical Integration of the Heat Equation",
journal = jMATHCOMPUT,
volume = "14",
number = "70",
pages = "139146",
month = apr,
year = "1960",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Tue Oct 13 08:06:19 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "Mathematics of Computation",
journalURL = "http://www.ams.org/mcom/",
}
"
,#4„ˆ%
@Article{Smith:1994:SFT,
author = "William Smith",
title = "A Short FloatingPoint Type in {C++}",
journal = jCUJ,
volume = "12",
number = "1",
pages = "23??",
month = jan,
year = "1994",
ISSN = "08989788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "C Users Journal",
}@“¦1
@Article{Smith:1994:PAT,
author = "James E. Smith and Shlomo Weiss",
title = "{PowerPC 601} and {Alpha 21064}: a Tale of Two
{RISCs}",
journal = jCOMPUTER,
volume = "27",
number = "6",
pages = "4658",
month = jun,
year = "1994",
CODEN = "CPTRB4",
ISSN = "00189162 (print), 15580814 (electronic)",
ISSNL = "00189162",
bibdate = "Mon Feb 3 07:28:57 MST 1997",
€„ˆ/
@Article{Smith:1993:WDF,
author = "William Smith",
title = "Windows, {DLLs}, and Floating Point Types",
journal = jCUJ,
volume = "11",
number = "9",
pages = "21??",
month = sep,
year = "1993",
ISSN = "08989788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "C Users Journal",
}¥ˆ
@Article{Smith:1995:FTC,
author = "J. C. Smith and F. J. Taylor",
title = "A faulttolerant {CEQRNS} processing element for
linear systolic array {DSP} applications",
journal = jIEEETRANSCOMPUT,
volume = "44",
number = "9",
pages = "11211130",
month = sep,
year = "1995",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.464390",
ISSN = "00189340 (print), 15Y‘u£k
@Article{Smith:1995:CFA,
author = "Roger Alan Smith",
title = "A ContinuedFraction Analysis of Trigonometric
Argument Reduction",
journal = jIEEETRANSCOMPUT,
volume = "44",
number = "11",
pages = "13481351",
month = nov,
year = "1995",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.475133",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = V„ˆ
@Article{Smith:1993:VFP,
author = "William Smith",
title = "Varying FloatingPoint Precision",
journal = jCUJ,
volume = "11",
number = "7",
pages = "87??",
month = jul,
year = "1993",
ISSN = "08989788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "C Users Journal",
}¤Œj™U
@Article{Smith:1993:PFC,
author = "Ross Smith and Gerald Sobelman and George Luk and
Koichi Suda and Jeff Bracken",
title = "A Programmable FloatingPoint Cell for Systolic Signal
Processing",
journal = jJVLSISIGNALPROC,
volume = "5",
number = "1",
pages = "7584",
month = jan,
year = "1993",
CODEN = "JVSPED",
DOI = "http://dx.doi.org/10.1007/BF01880273",‹ŠJ•
@Article{Smith:1992:FPR,
author = "L. Montgomery Smith and B. W. Bomar and R. D. Joseph
and G. C. J. Yang",
title = "FloatingPoint Roundoff Noise Analysis of SecondOrder
StateSpace Digital Filter Structures",
journal = jIEEETRANSCIRCUITSSYST2,
volume = "39",
number = "2",
pages = "9098",
month = feb,
year = "1992",
CODEN = "ICSPE5",
DOI = "http://dx.
•
e e‰&V #)o57;m;?co‰warticlefparith.bibPerry:1960:CBFC. PerryConversion between floating point representationsjCACM32702741960CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782352.68.0022\#8714Fri Dec 8 08:24:14 1995http://www.math.utah.edu/pub/tex/bib/fparith.bib1995.12.08 08:24:14 ???Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79C. PerryConversion between floating point representations
@Article{Perry:1960:CBF,
author = "C. Perry",
title = "Conversion between floating point representations",
journal = jCACM,
volume = "3",
year = "1960",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "352.68.00",
MRnumber = "22\#8714",
bibdate = "Fri Dec 8 08:24:14 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}x%Y#+I‚;'57Ek;A=I‚QŽGarticlefparith.bibPerlin:1960:HPCI. E. Perlin and J. R. GarrettHigh Precision Calculation of $ operatorname Arcsin x $, $ operatorname Arccos x $, and $ operatorname Arctan x $ (in Technical Notes and Short Papers)jMATHCOMPUT1471270274jul71960MCMPAF00255718 (print), 10886842 (electronic) OR 00255718 (print), 10886842 (electronic)00255718 OR 00255718Tue Oct 13 08:06:19 MDT 1998ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.13 08:06:19 MDTMathematics of Computationacknjhttp://www.ams.org/mcom/I. E. Perlin and J. R. GarrettHigh Precision Calculation of $ \operatorname {Arcsin} x $, $ \operatorname {Arccos} x $, and $ \operatorname {Arctan} x $ (in {Technical Notes and Short Papers})
@Article{Perlin:1960:HPC,
author = "I. E. Perlin and J. R. Garrett",
title = "High Precision Calculation of $ \operatorname {Arcsin}
x $, $ \operatorname {Arccos} x $, and $ \operatorname
{Arctan} x $ (in {Technical Notes and Short Papers})",
journal = jMATHCOMPUT,
volume = "14",
number = "71",
pages = "270274",
month = jul,
year = "1960",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Tue Oct 13 08:06:19 MDT 1998",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR
database",
acknowledgement = acknj # " and " # acknhfb,
fjournal = "Mathematics of Computation",
journalURL = "http://www.ams.org/mcom/",
}
¬
÷Z¬*)Y #/)57E‚5;?Mc)articlefparith.bibSarafyan:1960:DCSDiran SarafyanDivisionless computation of square roots through continued squaringjCACM35319321may51960CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 0001078265.0022\#8639Fri Nov 25 18:19:26 MST 2005http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.11.25 18:19:26 MSTCommunications of the ACM$sqrt (x)$; elementary functionsacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Diran SarafyanDivisionless computation of square roots through continued squaring
@Article{Sarafyan:1960:DCS,
author = "Diran Sarafyan",
title = "Divisionless computation of square roots through
continued squaring",
journal = jCACM,
volume = "3",
number = "5",
pages = "319321",
month = may,
year = "1960",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "65.00",
MRnumber = "22\#8639",
bibdate = "Fri Nov 25 18:19:26 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "$\sqrt(x)$; elementary functions",
ZMreviewer = "M. Lotkin",
}…(U %#3//#=m;//…;Nincollectionfparith.bibReitwiesner:1960:BAG. W. ReitwiesnerBinary arithmeticAlt:1960:AC2313081960Sat May 18 14:36:56 2002http://www.math.utah.edu/pub/tex/bib/fparith.bib2002.05.18 14:36:56 ???acknhfbG. W. ReitwiesnerBinary arithmetic
@InCollection{Reitwiesner:1960:BA,
author = "G. W. Reitwiesner",
title = "Binary arithmetic",
crossref = "Alt:1960:AC",
pages = "231308",
year = "1960",
bibdate = "Sat May 18 14:36:56 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}Š'W#'AG57;K;?cAG‹articlefparith.bibPope:1960:MPAD. A. Pope and M. L. SteinMultiple Precision ArithmeticjCACM312652654dec121960CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Thu Sep 1 10:15:08 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:15:08 ???Communications of the ACMacknjhttp://portal.acm.org/browse_dl.cfm?idx=J79D. A. Pope and M. L. SteinMultiple Precision Arithmetic
@Article{Pope:1960:MPA,
author = "D. A. Pope and M. L. Stein",
title = "Multiple Precision Arithmetic",
journal = jCACM,
volume = "3",
number = "12",
pages = "652654",
month = dec,
year = "1960",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu Sep 1 10:15:08 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
Š ½Š†/+U #/#I#=m;;#I‡articlefparith.bibSklansky:1960:CSAJ. SklanskyConditional Sum Addition LogicjTRANSIREEC92226230jun61960Fri Nov 09 19:17:08 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.11.09 19:17:08 ???Transactions of the IREacknhfbJ. SklanskyConditional Sum Addition Logic
@Article{Sklansky:1960:CSA,
author = "J. Sklansky",
title = "Conditional Sum Addition Logic",
journal = jTRANSIRE,
volume = "EC9",
number = "2",
pages = "226230",
month = jun,
year = "1960",
bibdate = "Fri Nov 09 19:17:08 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Transactions of the IRE",
}Œ?*Y #+'57E‚5;?ac'karticlefparith.bibSilver:1960:LERRoland SilverLetter to the Editor: Rounding in FloatingPoint ArithmeticjCACM312A9A9dec121960CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Fri Nov 25 18:19:29 MST 2005http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.11.25 18:19:29 MSTCommunications of the ACMfloatingpoint arithmetic; rounding errorsacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Roland SilverLetter to the {Editor}: Rounding in FloatingPoint Arithmetic
@Article{Silver:1960:LER,
author = "Roland Silver",
title = "Letter to the {Editor}: Rounding in FloatingPoint
Arithmetic",
journal = jCACM,
volume = "3",
number = "12",
pages = "A9A9",
month = dec,
year = "1960",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 25 18:19:29 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "floatingpoint arithmetic; rounding errors",
}
Ž
ò` xŽ„v‰m
@MastersThesis{Thirumalaiswamy:1992:DSB,
author = "Vijayashree Thirumalaiswamy",
title = "Design and simulation of bitserial floating point
arithmetic coprocessor",
type = "Thesis ({M.S.})",
school = "University of Texas at El Paso",
address = "El Paso, TX, USA",
pages = "xii + 113",
year = "1992",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "Array processors  Design.; Floatingpoint
arithmetic.",
}
û„p‰a
@MastersThesis{Tesnow:1985:IDS,
author = "Kurt Alan Tesnow",
title = "Implementation of the digital simulation of a
synchronous machine using a floatingpoint processor",
type = "Thesis ({M.S.})",
school = "Department of Electrical Engineering and Applied
Physics, Case Western Reserve University",
address = "Cleveland, OH 44106, USA",
pages = "vii + 255",
year = "1985",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}ý… Š
@MastersThesis{Tan:1996:MPF,
author = "Kien Beng Tan",
title = "A micropower, floating point analogtodigital
converter",
type = "Thesis ({M.S.})",
school = "Department of Electrical Engineering, University of
California, Los Angeles",
address = "Los Angeles, CA, USA",
pages = "????",
year = "1996",
bibdate = "Thu Oct 24 14:19:35 MDT 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "dissertations, academic  UCLA  Electrical
Engineering",
}
Š„[‰7
@MastersThesis{Sweo:1964:SFP,
author = "David Ernest Sweo",
title = "A study of floating point arithmetic with the residue
number system",
type = "Thesis ({M.S.})",
school = "UCLA  Engineering",
address = "Los Angeles, CA, USA",
pages = "89",
year = "1964",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "Congruences and residues.; Electronic digital
computers  Programming.",
}…Š!
@MastersThesis{Sippel:1982:FRI,
author = "Timothy N. Sippel",
title = "Floating {RISCS}: implementation and analysis of
floating point on {RISC} {I}",
type = "Electrical Engineering and Computer Sciences Master of
Science Report",
school = "University of California, Dept. of Electrical
Engineering and Computer Sciences",
address = "Berkeley, CA, USA",
pages = "various",
year = "1982",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}ˆ„ˆ
@MastersThesis{Simmons:1977:SRA,
author = "David Michael Simmons",
title = "Signaltonoise ration analysis of block floating
point {FFTS}",
type = "Electrical Engineering Thesis ({M.S.})",
school = "University of MissouriRolla",
address = "Rolla, MO, USA",
pages = "114",
year = "1977",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}Ä = "Fri Nov 25 18:19:25 MST 2005",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm3.html#Traub60;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Sarafyan:1959:NMC}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Traub60",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Traub60",
}¬
((T,Y #)#S57Eƒ1;C?c#GW‘karticlefparith.bibTraub:1960:CNMJ. F. TraubComments on a recent paper [``A New Method of Computation of Square Roots Without Using Division'']jCACM328686feb21960CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Fri Nov 25 18:19:25 MST 2005http://dblp.unitrier.de/db/journals/cacm/cacm3.html#Traub60; http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.11.25 18:19:25 MSTSee cite Sarafyan:1959:NMC.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79J. F. TraubSee \cite{Sarafyan:1959:NMC}.Comments on a recent paper [{``A New Method of Computation of Square Roots Without Using Division''}]
@Article{Traub:1960:CNM,
author = "J. F. Traub",
title = "Comments on a recent paper [{``A New Method of
Computation of Square Roots Without Using
Division''}]",
journal = jCACM,
volume = "3",
number = "2",
pages = "8686",
month = feb,
year = "1960",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 25 18:19:25 MST 2005",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm3.html#Traub60;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Sarafyan:1959:NMC}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Traub60",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Traub60",
}rce = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Three types of floatingpoint arithmetics with error
control are discussed and compared with conventional
floatingpoint arithmetic. General multiplication and
division shift criteria are derived (for any base) for
Metropolisstyle arithmetics. The limitations and most
suitable range of application for each arithmetic are
discussed.",
acknowledgement = acknhfb,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
reviewer = "C. B. Haselgrove",
xxmonth = "none",
xxnumber = "none",
}
h,h‹@.W #1+e!577=;7U+eŒmarticlefparith.bibWilkinson:1960:EAFJ. H. WilkinsonError Analysis of FloatingPoint ComputationjNUMMATH2319340dec121960NUMMA70029599X (print), 09453245 (electronic) OR 0029599X (print), 09453245 (electronic)0029599X OR 0029599X65.00MR0116477 (22 \#7264)C. B. HaselgroveFri May 14 17:18:08 2010http://www.math.utah.edu/pub/bibnet/authors/w/wilkinsonjameshardy.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.05.14 17:18:08 ???Numerische Mathematikacknhfbhttp://link.springer.com/journal/211J. H. WilkinsonError Analysis of FloatingPoint Computation
@Article{Wilkinson:1960:EAF,
author = "J. H. Wilkinson",
title = "Error Analysis of FloatingPoint Computation",
journal = jNUMMATH,
volume = "2",
pages = "319340",
month = dec,
year = "1960",
CODEN = "NUMMA7",
ISSN = "0029599X (print), 09453245 (electronic)",
ISSNL = "0029599X",
MRclass = "65.00",
MRnumber = "MR0116477 (22 \#7264)",
MRreviewer = "C. B. Haselgrove",
bibdate = "Fri May 14 17:18:08 2010",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/w/wilkinsonjameshardy.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Numerische Mathematik",
journalURL = "http://link.springer.com/journal/211",
}“PX #'#A57'=m;…)1Me…)#A”
articlefparith.bibWadey:1960:FAW. G. WadeyFloatingPoint ArithmeticsjJACM72129139apr41960JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 0004541165.00 (68.00)22\#6090Fri Dec 08 14:44:46 1995http://www.math.utah.edu/pub/tex/bib/fparith.bib1995.12.08 14:44:46 ???Three types of floatingpoint arithmetics with error control are discussed and compared with conventional floatingpoint arithmetic. General multiplication and division shift criteria are derived (for any base) for Metropolisstyle arithmetics. The limitations and most suitable range of application for each arithmetic are discussed.Journal of the ACMCited in cite Sterbenz:1974:FPC.acknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J401C. B. HaselgroveThree types of floatingpoint arithmetics with error control are discussed and compared with conventional floatingpoint arithmetic. General multiplication and division shift criteria are derived (for any base) for Metropolisstyle arithmetics. The limitations and most suitable range of application for each arithmetic are discussed.W. G. WadeyFloatingPoint Arithmetics
@Article{Wadey:1960:FA,
author = "W. G. Wadey",
title = "FloatingPoint Arithmetics",
journal = jJACM,
volume = "7",
number = "2",
pages = "129139",
month = apr,
year = "1960",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
MRclass = "65.00 (68.00)",
MRnumber = "22\#6090",
bibdate = "Fri Dec 08 14:44:46 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Three types of floatingpoint arithmetics with error
control are discussed and compared with conventional
floatingpoint arithmetic. General multiplication and
division shift criteria are derived (for any base) for
Metropolisstyle arithmetics. The limitations and most
suitable range of application for each arithmetic are
discussed.",
acknowledgement = acknhfb,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
reviewer = "C. B. Haselgrove",
xxmonth = "none",
xxnumber = "none",
}nt), 15729125 (electronic)",
ISSNL = "00063835",
bibdate = "Wed Jan 4 18:52:07 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=1&issue=3;
http://www.math.utah.edu/pub/tex/bib/bit.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Garwick:1961:AFP,Garwick:1961:RAF}.",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=1&issue=3&spage=220",
acknowledgement = acknhfb,
journalURL = "http://link.springer.com/journal/10543",
keywords = "floatingpoint accuracy; floatingpoint arithmetic",
xxpages = "220221??",
}¯
z+z‡0U !#1==E[=m;M=ˆ techreportfparith.bibAnonymous:1961:MCMAnonymousModern Computing MethodsNotes on Applied Science16National Physical LaboratoryHer Majesty's Stationery Office, London2202221961Fri Aug 20 10:05:25 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.08.20 10:05:25 ???Cited in cite Sterbenz:1974:FPC.acknhfbAnonymousModern Computing Methods
@TechReport{Anonymous:1961:MCM,
author = "Anonymous",
title = "Modern Computing Methods",
type = "Notes on Applied Science",
number = "16",
institution = "National Physical Laboratory",
address = "Her Majesty's Stationery Office, London",
year = "1961",
bibdate = "Fri Aug 20 10:05:25 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}‘Q/Z#)C#I)U57C‚;cKqYCg’{articlefparith.bibAmble:1961:AFPO. Amble and Jan V. GarwickOn the Accuracy of Floating Point Computers [BIT bf 1(2), 1961, pp. 8788]jNORDISKTIDSKRINFORMBEHAND13220222sep91961BITTEL, NBITABhttp://dx.doi.org/10.1007/BF0193343400063835 (print), 15729125 (electronic) OR 00063835 (print), 15729125 (electronic)00063835 OR 00063835Wed Jan 4 18:52:07 MST 2006http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=1&issue=3; http://www.math.utah.edu/pub/tex/bib/bit.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2006.01.04 18:52:07 MSTSee cite Garwick:1961:AFP,Garwick:1961:RAF.http://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=1&issue=3&spage=220floatingpoint accuracy; floatingpoint arithmeticacknhfbhttp://link.springer.com/journal/10543O. Amble and Jan V. GarwickSee \cite{Garwick:1961:AFP,Garwick:1961:RAF}.On the Accuracy of Floating Point Computers {[BIT {\bf 1}(2), 1961, pp. 8788]}
@Article{Amble:1961:AFP,
author = "O. Amble and Jan V. Garwick",
title = "On the Accuracy of Floating Point Computers {[BIT {\bf
1}(2), 1961, pp. 8788]}",
journal = jNORDISKTIDSKRINFORMBEHAND,
volume = "1",
number = "3",
pages = "220222",
month = sep,
year = "1961",
CODEN = "BITTEL, NBITAB",
DOI = "http://dx.doi.org/10.1007/BF01933434",
ISSN = "00063835 (print), 15729125 (electronic)",
ISSNL = "00063835",
bibdate = "Wed Jan 4 18:52:07 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=1&issue=3;
http://www.math.utah.edu/pub/tex/bib/bit.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Garwick:1961:AFP,Garwick:1961:RAF}.",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=1&issue=3&spage=220",
acknowledgement = acknhfb,
journalURL = "http://link.springer.com/journal/10543",
keywords = "floatingpoint accuracy; floatingpoint arithmetic",
xxpages = "220221??",
}
p
³…€fp…t‹i
@Article{ChaitinChatelin:1996:FPA,
author = "F. ChaitinChatelin",
title = "Is Finite Precision Arithmetic Useful For Physics?",
journal = jJUCS,
volume = "2",
number = "5",
pages = "380??",
day = "28",
month = may,
year = "1996",
CODEN = "????",
ISSN = "09486968",
ISSNL = "09486968",
bibdate = "Wed May 28 19:32:35 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.jucs.org/is_finite_precision_arithmetic_useful_for_physics",
acknowledgement = acknhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journalURL = "http://www.jucs.org/jucs",
}
„ˆ1
@Article{Chai:1991:MCF,
author = "P. Chai and T. Chuk and Y. H. Fong and L. Hu and K. Ng
and J. Prabhu and A. Quek and A. Samuels and J. Yeun",
title = "A 120 {MFLOPS CMOS} FloatingPoint Processor",
crossref = "IEEE:1991:PIC",
pages = "15.1/14",
year = "1991",
bibdate = "Wed Sep 7 22:32:42 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
} ¸†Œ
@Article{Chabert:2009:PEA,
author = "Gilles Chabert and Luc Jaulin",
title = "A Priori Error Analysis and Spring Arithmetic",
journal = jSIAMJSCICOMP,
volume = "31",
number = "3",
pages = "22142230",
month = "????",
year = "2009",
CODEN = "SJOCE3",
DOI = "",
ISSN = "10648275 (print), 10957197 (electronic)",
ISSNL = "10648275",
bibdate = "Wed May 19 10:44:16 MDT 2010",
bibsource = "http://epubs.siam.org/sambin/dbq/toc/SISC/31/3;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "SIAM Journal on Scientific Computing",
journalURL = "http://epubs.siam.org/sisc",
}ï„,ˆ[
@Article{Cesareo:1946:RI,
author = "O. Cesareo",
title = "The Relay Interpolator",
journal = jBELLLABSRECORD,
volume = "23",
number = "??",
pages = "457460",
year = "1946",
CODEN = "BLRCAB",
ISSN = "00058564",
bibdate = "Wed Oct 13 11:31:47 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 6.2]{Randell:1982:ODC}.",
acknowledgement = acknhfb,
fjournal = "Bell Laboratories Record",
}0†\9
@Article{Ceruzzi:1981:ECK,
author = "Paul E. Ceruzzi",
title = "The Early Computers of {Konrad Zuse}, 1935 to 1945",
journal = jANNHISTCOMPUT,
volume = "3",
number = "3",
pages = "241262",
month = jul # "\slash " # sep,
year = "1981",
CODEN = "AHCOE5",
ISSN = "01641239",
bibdate = "Fri Nov 1 15:29:18 MST 2002",
bibsource = "http://www.computer.org/annals/an1981/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://dlib.computer.org/an/books/an1981/pdf/a3241.pdf;
http://www.computer.org/annals/an1981/a3241abs.htm",
acknowledgement = acknhfb,
fjournal = "Annals of the History of Computing",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5488650",
}ëŠN•
@Article{Celarier:1991:AML,
author = "Donald A. Celarier and Donald W. Sando",
title = "An {Ada} math library for realtime avionics",
journal = jSIGADALETTERS,
volume = "11",
number = "7",
pages = "274284",
month = "Fall",
year = "1991",
CODEN = "AALEE5",
ISSN = "10943641 (print), 15579476 (electronic)",
ISSNL = "10943641",
bibdate = "Sat Aug 9 09:05:43 MDT 2003",
bibs6ã]Aæãóyg†
Œ
@Article{Baker:1976:SFB,
author = "P. W. Baker",
title = "Suggestion for a fast binary sine\slash cosine
generator",
journal = jIEEETRAB„M‰
@Article{Anonymous:1993:FPe,
author = "Anonymous",
title = "Floating Point",
journal = jCOMPUTAIDEDENG,
volume = "12",
number = "11",
pages = "42??",
month = nov,
year = "1993",
CODEN = "CCAEDJ",
ISSN = "07333536",
ISSNL = "07333536",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Cost Benefits CAD/CAM.",
acknowledgement = acknhfb,
fjournal = "Computeraided engineering: CAE",
}Cƒn‡]
@Article{Ashton:1989:AFP,
author = "C. Ashton",
)†ti
@Article{Avizienis:1973:AAE,
author = "Algirdas Avi{\v{z}}ienis",
title = "Arithmetic Algorithms for ErrorCoded Operands",
journal = jIEEETRANSCOMPUT,
volume = "C22",
number = "6",
pages = "567572",
month = jun,
year = "1973",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1973.5009108",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Fri Nov 09 19:18:24 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.acsellab.com/arithmetic/arith2/papers/ARITH2_Avizienis.pdf",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "ARITH2",
}‡g—"®E
@Article{Arnold:1992:AFI,
author = "M. G. Arnold and T. A. Bailey and J. R. Cowles and M.
D. Winkel",
title = "Applying features of {IEEE 754} to sign\slash
logarithm arithmetic",
journal = jIEEETRANSCOMPUT,
volume = "41",
number = "8",
pages = "10401050",
month = aug,
year = "1992",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.156547",
ISSN = õ†U+
@Article{Ambikairajah:1980:TPM,
author = "E. Ambikairajah and M. J. Carey",
title = "Technique for Performing Multiplication on a 16bit
Microprocessor Using an Extension of {Booth}'s
Algorithm",
journal = jELECTLETTERS,
volume = "16",
number = "2",
pages = "5354",
month = jan,
year = "1980",
CODEN = "ELLEAK",
ISSN = "00135194 (print), 1350911X (electronic)",
ISSNL = "00135194",
bibdate = "Thu Sep 1 10:15:07 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Electronics Letters",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}z‡9Žs
@Article{Akbarpour:2002:FCS,
author = "Behzad Akbarpour and Abdelkader Dekdouk and
Sofi{\`e}ne Tahar",
title = "Formalization of Cadence {SPW} FixedPoint Arithmetic
in {HOL}",
journal = jLECTNOTESCOMPSCI,
volume = "2335",
pages = "185??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Tue Sep 10 19:09:38 MDT 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t2335.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/2335/23350185.htm;
http://link.springerny.com/link/service/series/0558/papers/2335/23350185.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}r);ÊP
C;u†C
@Article{Brent:1978:u‡iS
@Article{Cantor:1962:LEF,
author = "D. Cantor and G. Estrin and R. Turn",
title = "Logarithmic and Exponential Function Evaluation in a
Variable Structure±‡hQ
@Article{Brosnan:1988:MED,
author = "T. J. Brosnan and N. R. {Strader II}",
title = "Modular error detection for bitserial
multiplication",
journal = jIEEETRANSCOMPUT,
volume = "37",
number = "9",
pages = "10431052",
month = sep,
year = "1988",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.2255",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Sat Jul 9 08:33:28 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=2255",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}ó'…Š9
@Article{Buell:1989:MIA,
author = "D. Buell and R. Ward",
title = "A Multiprecise Integer Arithmetic Package",
journal = jJSUPERCOMPUTING,
volume = "3",
number = "??",
pages = "89107",
month = "????",
year = "198sˆA‘
@Article{Baran:1989:MST,
author = "N. Baran",
title = "The {Mac SE} takes off",
journal = jBYTE,
volume = "14",
number = "2",
pages = "113116",
month = feb,
year = "1989",
CODEN = "BYTEDJ",
ISSN = "03605280 (print), 10827838 (electronic)",
ISSNL = "03605280",
bibdate = "Thu Sep 12 17:54:09 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
ac
A³…K‹
@Article{Brakefield:1972:OFP,
author = "James C. Brakefield",
title = "An optimal floating point format",
journal = jCOMPARCHNEWS,
volume = "1",
number = "4",
pages = "1617",
month = oct,
year = "1972",
CODEN = "CANED2",
ISSN = "01635964 (print), 19435851 (electronic)",
ISSNL = "01635964",
bibdate = "Fri May 12 09:41:08 MDT 2006",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}Q}Œc™G
@Article{Blevins:1990:BHI,
author = "D. W. Blevins and E. W. Davis and R. A. Heaton and J.
H. Feif",
title = "{BLITZEN}: a Highly Integrated Massively Parallel
Machine",
journal = jJPARDISTCOMP,
volume = "8",
number = "2",
pages = "150160",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "07437315 (print), 10960848 (electronic)",
ISSNL = "4…s‹g
@Article{Becker:2000:JST,
author = "Pete Becker",
title = "The Journeyman's Shop: Trap Handlers, Sticky Bits, and
FloatingPoint Comparisons",
journal = jCCCUJ,
volume = "18",
number = "12",
pages = "54??",
month = dec,
year = "2000",
CODEN = "CCUJEX",
ISSN = "10752838",
bibdate = "Tue May 14 18:09:29 MDT 2002",
bibsource = "http://www.cuj.com/articles/2000/0012/0012toc.htm?topic=articles;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Pete wraps up his series on practical floatingpoint
math.",
acknowledgement = acknhfb,
fjournal = "C/C++ Users Journal",
}6
Ë ËŒ11Y #11
;a7E‚;]=
iarticlefparith.bibAvizienis:1961:SDNAlgirdas AvizienisSignedDigit Number Representations for Fast Parallel ArithmeticjIRETRANSELECCOMPUTEC103389400sep91961IRELAOhttp://dx.doi.org/10.1109/TEC.1961.521922703679950 OR 03679950Thu Jul 14 14:45:04 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 14:45:04 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219227IRE Transactions on Electronic ComputersacknhfbAlgirdas Avi{\v{z}}ienisSignedDigit Number Representations for Fast Parallel Arithmetic
@Article{Avizienis:1961:SDN,
author = "Algirdas Avi{\v{z}}ienis",
title = "SignedDigit Number Representations for Fast Parallel
Arithmetic",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "3",
pages = "389400",
month = sep,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219227",
ISSN = "03679950",
bibdate = "Thu Jul 14 14:45:04 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219227",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}T 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219154",
abstract = "A system design for a digital correlator based on the
application of the residue number system for
computation is presented. Areas of investigation
include sampling, analogtoresidue conversion, logical
design of the arithmetic units, residuetoanalog
conversion, and modes of operation of the proposed
digital correlator. The advantages of speed of
computation and simplicity of logic due to the use of a
residue number system are shown to result in a
significantly faster and simpler system than if a
conventional number system were used. The resulting
digital correlator is designed for megacycle sampling
and computation with a 0.1 per cent system precision.",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}²
MM/2Y #+5{;a7E‚;Š=]Š=5{›7articlefparith.bibCheney:1961:DCBPhilip Warren CheneyA Digital Correlator Based on the Residue Number SystemjIRETRANSELECCOMPUTEC1016370mar31961IRELAOhttp://dx.doi.org/10.1109/TEC.1961.521915403679950 OR 03679950Thu Jul 14 14:45:02 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 14:45:02 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219154A system design for a digital correlator based on the application of the residue number system for computation is presented. Areas of investigation include sampling, analogtoresidue conversion, logical design of the arithmetic units, residuetoanalog conversion, and modes of operation of the proposed digital correlator. The advantages of speed of computation and simplicity of logic due to the use of a residue number system are shown to result in a significantly faster and simpler system than if a conventional number system were used. The resulting digital correlator is designed for megacycle sampling and computation with a 0.1 per cent system precision.IRE Transactions on Electronic ComputersacknhfbA system design for a digital correlator based on the application of the residue number system for computation is presented. Areas of investigation include sampling, analogtoresidue conversion, logical design of the arithmetic units, residuetoanalog conversion, and modes of operation of the proposed digital correlator. The advantages of speed of computation and simplicity of logic due to the use of a residue number system are shown to result in a significantly faster and simpler system than if a conventional number system were used. The resulting digital correlator is designed for megacycle sampling and computation with a 0.1 per cent system precision.Philip Warren CheneyA Digital Correlator Based on the Residue Number System
@Article{Cheney:1961:DCB,
author = "Philip Warren Cheney",
title = "A Digital Correlator Based on the Residue Number
System",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "1",
pages = "6370",
month = mar,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219154",
ISSN = "03679950",
bibdate = "Thu Jul 14 14:45:02 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219154",
abstract = "A system design for a digital correlator based on the
application of the residue number system for
computation is presented. Areas of investigation
include sampling, analogtoresidue conversion, logical
design of the arithmetic units, residuetoanalog
conversion, and modes of operation of the proposed
digital correlator. The advantages of speed of
computation and simplicity of logic due to the use of a
residue number system are shown to result in a
significantly faster and simpler system than if a
conventional number system were used. The resulting
digital correlator is designed for megacycle sampling
and computation with a 0.1 per cent system precision.",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
[[‰!3V #/)c57=m;?c)cŠarticlefparith.bibClarkson:1961:DMIW. K. ClarksonA Divisionless Method of Integer ConversionjCACM47315316jul71961CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Thu Sep 08 08:14:59 1994http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.08 08:14:59 ???Communications of the ACMacknjhttp://portal.acm.org/browse_dl.cfm?idx=J79W. K. ClarksonA Divisionless Method of Integer Conversion
@Article{Clarkson:1961:DMI,
author = "W. K. Clarkson",
title = "A Divisionless Method of Integer Conversion",
journal = jCACM,
volume = "4",
number = "7",
pages = "315316",
month = jul,
year = "1961",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu Sep 08 08:14:59 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
} 03 14:07:44 2005",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Since computers have means to detect overflow on
addition or subtraction, this can be used in a multiple
precision additionsubtraction subroutine to obviate a
sign analysis. Consider all integers in the computer to
be expressed ``radix t'', that is, in the form $ a =
a_0 + a_1 t + \cdots + a_n t^n $ where $ a_i $ are of
like sign and have magnitudes less than $t$. $t$ is a
positive integer determined by the word length of the
computer. Consider the expression $ c = a \pm b = (a_0
\pm b_0) + (a_1 \pm b_1)t + \cdots + (a_n \pm b_n)t^n$.
Here $ a_i \pm b_i$ may exceed the storage capacity of
one word or may have a sign different from $c$.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}´
''U4Y #%I[]57=ƒ;Š?cŠI[›Warticlefparith.bibCox:1961:NMPAlbert G. Cox and H. A. LutherA Note on Multiple Precision ArithmeticjCACM48353353aug81961CACMA2http://doi.acm.org/10.1145/366678.36669300010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Sat Dec 03 14:07:44 2005ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.12.03 14:07:44 ???Since computers have means to detect overflow on addition or subtraction, this can be used in a multiple precision additionsubtraction subroutine to obviate a sign analysis. Consider all integers in the computer to be expressed ``radix t'', that is, in the form $ a = a_0 + a_1 t + cdots + a_n t^n $ where $ a_i $ are of like sign and have magnitudes less than $t$. $t$ is a positive integer determined by the word length of the computer. Consider the expression $ c = a pm b = (a_0 pm b_0) + (a_1 pm b_1)t + cdots + (a_n pm b_n)t^n$. Here $ a_i pm b_i$ may exceed the storage capacity of one word or may have a sign different from $c$.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Since computers have means to detect overflow on addition or subtraction, this can be used in a multiple precision additionsubtraction subroutine to obviate a sign analysis. Consider all integers in the computer to be expressed ``radix t'', that is, in the form $ a = a_0 + a_1 t + \cdots + a_n t^n $ where $ a_i $ are of like sign and have magnitudes less than $t$. $t$ is a positive integer determined by the word length of the computer. Consider the expression $ c = a \pm b = (a_0 \pm b_0) + (a_1 \pm b_1)t + \cdots + (a_n \pm b_n)t^n$. Here $ a_i \pm b_i$ may exceed the storage capacity of one word or may have a sign different from $c$.Albert G. Cox and H. A. LutherA Note on Multiple Precision Arithmetic
@Article{Cox:1961:NMP,
author = "Albert G. Cox and H. A. Luther",
title = "A Note on Multiple Precision Arithmetic",
journal = jCACM,
volume = "4",
number = "8",
pages = "353353",
month = aug,
year = "1961",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/366678.366693",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sat Dec 03 14:07:44 2005",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Since computers have means to detect overflow on
addition or subtraction, this can be used in a multiple
precision additionsubtraction subroutine to obviate a
sign analysis. Consider all integers in the computer to
be expressed ``radix t'', that is, in the form $ a =
a_0 + a_1 t + \cdots + a_n t^n $ where $ a_i $ are of
like sign and have magnitudes less than $t$. $t$ is a
positive integer determined by the word length of the
computer. Consider the expression $ c = a \pm b = (a_0
\pm b_0) + (a_1 \pm b_1)t + \cdots + (a_n \pm b_n)t^n$.
Here $ a_i \pm b_i$ may exceed the storage capacity of
one word or may have a sign different from $c$.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
{ˆ[6W #'!=m;+'‹
articlefparith.bibFreiman:1961:SACC. V. FreimanStatistical analysis of certain binary division algorithmsjIREPROC49191103jan11961Mon Sep 16 16:12:21 2002http://www.math.utah.edu/pub/tex/bib/fparith.bib2002.09.16 16:12:21 ???IRE ProceedingsacksfoC. V. FreimanStatistical analysis of certain binary division algorithms
@Article{Freiman:1961:SAC,
author = "C. V. Freiman",
title = "Statistical analysis of certain binary division
algorithms",
journal = jIREPROC,
volume = "49",
number = "1",
pages = "91103",
month = jan,
year = "1961",
bibdate = "Mon Sep 16 16:12:21 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acksfo # " and " # acknhfb,
fjournal = "IRE Proceedings",
xxnote = "Check author name: I have found this paper cited both
as Freiman and as Frieman?? Hennessy and Patterson
\cite{Hennessy:2002:CAQ} have Freiman.",
}5Y #'%];a7E‚;]%]Žarticlefparith.bibCroy:1961:RTMJohn E. CroyRapid Technique of Manual or Machine BinarytoDecimal Integer Conversion Using Decimal Radix ArithmeticjIRETRANSELECCOMPUTEC104777777dec121961IRELAOhttp://dx.doi.org/10.1109/TEC.1961.521928603679950 OR 03679950Thu Jul 14 14:45:05 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 14:45:05 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219286IRE Transactions on Electronic ComputersacknhfbJohn E. CroyRapid Technique of Manual or Machine BinarytoDecimal Integer Conversion Using Decimal Radix Arithmetic
@Article{Croy:1961:RTM,
author = "John E. Croy",
title = "Rapid Technique of Manual or Machine BinarytoDecimal
Integer Conversion Using Decimal Radix Arithmetic",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "4",
pages = "777777",
month = dec,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219286",
ISSN = "03679950",
bibdate = "Thu Jul 14 14:45:05 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219286",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}ÿd
Ïâïeÿ_*„8ˆq
@Article{Boettner:1987:QA,
author = "H. B{\"o}ttner",
title = "{QuadratwurzelAlgorithmus} \toenglish {SquareRoot
Algorithms} \endtoenglish",
journal = jMC,
volume = ü†`A
@Article{Bouvier:2014:DFB,
author = "Cyril Bouvier and Paul Zimmermann",
title = "DivisionFree BinarytoDecimal Conversion",
journal = jIEEETRANSCOMPUT,
volume = "63",
number = "8",
pages = "18951901",
month = aug,
year = "2014",
CODEN = "ITCOB4",
DOI = "http://doi.ieeecomputersociety.org/10.1109/TC.2014.2315621",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Mon Aug 25 08:24:32 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}›ú…Š
@Article{Bomar:1995:RNA,
author = "B. W. Bomar and L. M. Smith and R. D. Joseph",
title = "Roundoff Noise Analysis of StateSpace Digital Filters
Implemented on FloatingPoint Digital Signal
Processors",
journal = "Proceedings  IEEE International Symposium on Circuits
and Systems",
volume = "??",
number = "3",
pages = "III2023",
year = "1995",
ISSN = "02714310",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}v¾w¡o
@Article{Boldo:2008:EFC,
author = "Sylvie Boldo and Guillaume Melquiond",
title = "Emulation of a {FMA} and Correctly Rounded Sums:
Proved Algorithms Using Rounding to Odd",
journal = jIEEETRANSCOMPUT,
volume = "57",
number = "4",
pages = "462471",
month = apr,
year = "2008",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2007.70819",
ISSN = "00189340 (pë1…g‹O
@Article{Bohlender:1982:ROA,
author = "G. Bohlender and K. Gr{\"u}ner and J. Wolff {von
Gudenberg}",
title = "{Realisierung einer optimalen Arithmetik} \toenglish
{Realization of Optimal Arithmetic} \endtoenglish",
journal = jELEKRECHENANLAGEN,
volume = "24",
number = "2",
pages = "6872",
month = apr,
year = "1982",
CODEN = "ELRAA4",
ISSN = "00135720",
bibdate = "Sat Feb 10 12:41:07 1996",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Elektronische Rechenanlagen",
}W*„8ˆq
@Article{Boettner:1987:QA,
author = "H. B{\"o}ttner",
title = "{QuadratwurzelAlgorithmus} \toenglish {SquareRoot
Algorithms} \endtoenglish",
journal = jMC,
volume = "5",
pages = "58",
year = "1987",
ISSN = "07204442",
bibdate = "Fri Sep 16 16:30:41 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "MC: Die MikrocomputerZeitschrift",
}j‘¢7
@Article{Blum:1996:RPD,
author = "Manuel Blum and H. Wasserman",
title = "Reflections on the {Pentium} Division Bug",
journal = jIEEETRANSCOMPUT,
volume = "45",
number = "4",
pages = "385393",
month = apr,
year = "1996",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.494097",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = ~ibdate = "Thu Nov 18 09:27:06 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://deepblue.lib.umich.edu/bitstream/2027.42/5023/4/bac2784.0001.001.txt",
abstract = "The purpose of the research performed under this
contract was to investigate the feasibility of residue
number systems in their applications to digital
computers. The problems of such an application are the
ones of magnitude determination, sign determination,
overflow, scaling, and division. These problems are not
independent, but are found to be quite interrelated. A
theoretical treatment of residue number systems is
given which lays the foundation for a unified study of
the complete problem. Treatments of an organizational
nature are given which deal with multiplication,
division, and scaling. The matter of correlating the
theoretical and organizational studies to physical
realizations involving networks is treated also. The
question of whether the residue number system can be
successfully applied to general purpose computers is
still an open one. Their application to special purpose
machines is considered both feasible and practical.",
acknowledgement = acknhfb,
remark = "This report represents the results of research
performed by the group at The University of Michigan
under the direction of Professor H. L. Garner.
Concurrently, research on the same subject was being
conducted at Harvard University under the direction of
Professor Howard Aiken, and at the Lockheed Missile
System Division under the direction of Dr. Richard
Tanaka. There was a considerable exchange of
information among the above groups during the course of
the research effort. The efforts attained exhibit
little overlap, rather they are complementary. A
portion of this report was extracted from the doctoral
dissertation of D. P. Rozenberg. His work was supported
by this contract, and led to the Ph.D..",
}·His work was supported by this contract, and led to the Ph.D..acknhfbThe purpose of the research performed under this contract was to investigate the feasibility of residue number systems in their applications to digital computers. The problems of such an application are the ones of magnitude determination, sign determination, overflow, scaling, and division. These problems are not independent, but are found to be quite interrelated. A theoretical treatment of residue number systems is given which lays the foundation for a unified study of the complete problem. Treatments of an organizational nature are given which deal with multiplication, division, and scaling. The matter of correlating the theoretical and organizational studies to physical realizations involving networks is treated also. The question of whether the residue number system can be successfully applied to general purpose computers is still an open one. Their application to special purpose machines is considered both feasible and practical.H. L. Garner and R. F. Arnold and B. C. Benson and C. G. Brockus and R. J. Gonzalez and D. P. RozenbergResidue number systems for computers
@TechReport{Garner:1961:RNS,
author = "H. L. Garner and R. F. Arnold and B. C. Benson and C.
G. Brockus and R. J. Gonzalez and D. P. Rozenberg",
title = "Residue number systems for computers",
type = "{ASD} Technical Report",
number = "61483",
institution = "Electronic Technology Laboratory, The University of
Michigan",
address = "Ann Arbor, MI, USA",
month = oct,
year = "1961",
bibdate = "Thu Nov 18 09:27:06 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://deepblue.lib.umich.edu/bitstream/2027.42/5023/4/bac2784.0001.001.txt",
abstract = "The purpose of the research performed under this
contract was to investigate the feasibility of residue
number systems in their applications to digital
computers. The problems of such an application are the
ones of magnitude determination, sign determination,
overflow, scaling, and division. These problems are not
independent, but are found to be quite interrelated. A
theoretical treatment of residue number systems is
given which lays the foundation for a unified study of
the complete problem. Treatments of an organizational
nature are given which deal with multiplication,
division, and scaling. The matter of correlating the
theoretical and organizational studies to physical
realizations involving networks is treated also. The
question of whether the residue number system can be
successfully applied to general purpose computers is
still an open one. Their application to special purpose
machines is considered both feasible and practical.",
acknowledgement = acknhfb,
remark = "This report represents the results of research
performed by the group at The University of Michigan
under the direction of Professor H. L. Garner.
Concurrently, research on the same subject was being
conducted at Harvard University under the direction of
Professor Howard Aiken, and at the Lockheed Missile
System Division under the direction of Dr. Richard
Tanaka. There was a considerable exchange of
information among the above groups during the course of
the research effort. The efforts attained exhibit
little overlap, rather they are complementary. A
portion of this report was extracted from the doctoral
dissertation of D. P. Rozenberg. His work was supported
by this contract, and led to the Ph.D..",
}
°g7\!#+[U51=m;#Žy‹Žy[Uw
techreportfparith.bibGarner:1961:RNSH. L. Garner and R. F. Arnold and B. C. Benson and C. G. Brockus and R. J. Gonzalez and D. P. RozenbergResidue number systems for computersASD Technical Report61483Electronic Technology Laboratory, The University of MichiganAnn Arbor, MI, USA91103oct101961Thu Nov 18 09:27:06 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.11.18 09:27:06 ???http://deepblue.lib.umich.edu/bitstream/2027.42/5023/4/bac2784.0001.001.txtThe purpose of the research performed under this contract was to investigate the feasibility of residue number systems in their applications to digital computers. The problems of such an application are the ones of magnitude determination, sign determination, overflow, scaling, and division. These problems are not independent, but are found to be quite interrelated. A theoretical treatment of residue number systems is given which lays the foundation for a unified study of the complete problem. Treatments of an organizational nature are given which deal with multiplication, division, and scaling. The matter of correlating the theoretical and organizational studies to physical realizations involving networks is treated also. The question of whether the residue number system can be successfully applied to general purpose computers is still an open one. Their application to special purpose machines is considered both feasible and practical.This report represents the results of research performed by the group at The University of Michigan under the direction of Professor H. L. Garner. Concurrently, research on the same subject was being conducted at Harvard University under the direction of Professor Howard Aiken, and at the Lockheed Missile System Division under the direction of Dr. Richard Tanaka. There was a considerable exchange of information among the above groups during the course of the research effort. The efforts attained exhibit little overlap, rather they are complementary. A portion of this report was extracted from the doctoral dissertation of D. P. Rozenberg. µ= "Wed Jan 4 18:52:07 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=1&issue=2;
http://www.math.utah.edu/pub/tex/bib/bit.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See also comment and reply
\cite{Amble:1961:AFP,Garwick:1961:RAF}.",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=1&issue=2&spage=87",
acknowledgement = acknhfb,
journalURL = "http://link.springer.com/journal/10543",
keywords = "floatingpoint accuracy; floatingpoint arithmetic",
}¸
¨9Y #'AI)57=I;_qY'cK[articlefparith.bibGarwick:1961:RAFJ. V. GarwickReply to ``On the Accuracy of Floating Point Computers'' [BIT bf 1(3), 1961, pp. 220221]jNORDISKTIDSKRINFORMBEHAND132222221961BITTEL, NBITAB00063835 (print), 15729125 (electronic) OR 00063835 (print), 15729125 (electronic)00063835 OR 00063835Mon Nov 16 14:36:22 1998http://www.math.utah.edu/pub/tex/bib/bit.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib1998.11.16 14:36:22 ???See cite Garwick:1961:AFP,Amble:1961:AFP.floatingpoint accuracy; floatingpoint arithmeticacknhfbhttp://link.springer.com/journal/10543J. V. GarwickSee \cite{Garwick:1961:AFP,Amble:1961:AFP}.Reply to {``On the Accuracy of Floating Point Computers'' [BIT {\bf 1}(3), 1961, pp. 220221]}
@Article{Garwick:1961:RAF,
author = "J. V. Garwick",
title = "Reply to {``On the Accuracy of Floating Point
Computers'' [BIT {\bf 1}(3), 1961, pp. 220221]}",
journal = jNORDISKTIDSKRINFORMBEHAND,
volume = "1",
number = "3",
pages = "222222",
year = "1961",
CODEN = "BITTEL, NBITAB",
ISSN = "00063835 (print), 15729125 (electronic)",
ISSNL = "00063835",
bibdate = "Mon Nov 16 14:36:22 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/bit.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Garwick:1961:AFP,Amble:1961:AFP}.",
acknowledgement = acknhfb,
journalURL = "http://link.springer.com/journal/10543",
keywords = "floatingpoint accuracy; floatingpoint arithmetic",
}T8Z #)]I)U57C‚;
IqY)]‘{articlefparith.bibGarwick:1961:AFPJan V. GarwickThe Accuracy of Floating Point ComputersjNORDISKTIDSKRINFORMBEHAND128788jun61961BITTEL, NBITABhttp://dx.doi.org/10.1007/BF0193922100063835 (print), 15729125 (electronic) OR 00063835 (print), 15729125 (electronic)00063835 OR 00063835Wed Jan 4 18:52:07 MST 2006http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=1&issue=2; http://www.math.utah.edu/pub/tex/bib/bit.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2006.01.04 18:52:07 MSTSee also comment and reply cite Amble:1961:AFP,Garwick:1961:RAF.http://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=1&issue=2&spage=87floatingpoint accuracy; floatingpoint arithmeticacknhfbhttp://link.springer.com/journal/10543Jan V. GarwickSee also comment and reply \cite{Amble:1961:AFP,Garwick:1961:RAF}.The Accuracy of Floating Point Computers
@Article{Garwick:1961:AFP,
author = "Jan V. Garwick",
title = "The Accuracy of Floating Point Computers",
journal = jNORDISKTIDSKRINFORMBEHAND,
volume = "1",
number = "2",
pages = "8788",
month = jun,
year = "1961",
CODEN = "BITTEL, NBITAB",
DOI = "http://dx.doi.org/10.1007/BF01939221",
ISSN = "00063835 (print), 15729125 (electronic)",
ISSNL = "00063835",
bibdate = "Wed Jan 4 18:52:07 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=1&issue=2;
http://www.math.utah.edu/pub/tex/bib/bit.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See also comment and reply
\cite{Amble:1961:AFP,Garwick:1961:RAF}.",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=1&issue=2&spage=87",
acknowledgement = acknhfb,
journalURL = "http://link.springer.com/journal/10543",
keywords = "floatingpoint accuracy; floatingpoint arithmetic",
}
bs
6GXQsb
@Article{Han:2009:ICS,
author = "DongGuk Han and Dooho Choi and Howon Kim",
title = "Improved Computation of Square Roots in Specific
Finite Fields",
journal = jIEEETRANSCOMPUT,
volume = "58",
number = "2",
pages = "188196",
month = feb,
year = "2009",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2008.201",
ISSN = "00189340 (print), 15579956 (electroÅï'
@Article{Hannington:1976:FPM,
author = "G. Hannington and D. G. Whitehead",
title = "A FloatingPoint Multiplexed {DDA} System",
journal = jIEEETRANSCOMPUT,
volume = "C25",
number = "11",
pages = "10741077",
month = nov,
year = "1976",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1976.1674557",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "0018Ü„ˆ
@Article{Hamza:1991:MBD,
author = "K. M. Hamza and M. A. H. AbdulKarim",
title = "Microprocessor Based Direct Square Root Extractor",
journal = "Modelling",
volume = "34",
number = "1",
pages = "4548",
month = "????",
year = "1991",
bibdate = "Thu Sep 1 10:15:42 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
} åŒ(˜Q
@Article{Hamming:1970:DN,
author = "R. W. Hamming",
title = "On the Distribution of Numbers",
journal = jBELLSYSTTECHJ,
volume = "49",
number = "8",
pages = "16091625",
month = oct,
year = "1970",
CODEN = "BSTJAN",
ISSN = "00058580",
bibdate = "Tue Nov 9 11:15:55 MST 2010",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://bstj.belllabs.com/÷Ž1œc
@Article{Hamming:1965:NLB,
author = "R. W. Hamming and W. L. Mammel",
title = "A Note on the Location of the Binary Point in a
Computing Machine",
journal = jIEEETRANSELECCOMPUT,
volume = "EC14",
number = "2",
pages = "260261",
month = apr,
year = "1965",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1965.264258",
ISSN = "03677508",
bibdate = *‡Y3
@Article{Hammersley:1969:NAP,
author = "P. Hammersley",
title = "Note on {Algorithm 34}: Procedures for the Basic
Arithmetical Operations in MultiLength Working",
journal = jCOMPJ,
volume = "12",
number = "1",
pages = "102103",
month = feb,
year = "1969",
CODEN = "CMPJA6",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Fri Sep 29 08:51:33 MDT 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_01/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_01/tiff/102.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_01/tiff/103.tif",
acknowledgement = acknhfb,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}Â‰!’C
@Article{Hammer:1965:BRBa,
author = "Preston C. Hammer",
title = "Book Review: {{\booktitle{Experimental Arithmetic,
High Speed Computing and Mathematics}} by N. C.
Metropolis; A. H. Taub; John Todd; C. B. Tompkins}",
journal = jTECHNOMETRICS,
volume = "7",
number = "1",
pages = "8282",
month = feb,
year = "1965",
CODEN = "TCMTA2",
DOI = "http://dx.doi.org/(.bib",
abstract = "Error checking codes based on residues have the
advantage over paritybased codes of monitoring
arithmetic as well as transmission operations. Codes
may be devised to detect bursttype errors, to correct
single errors in a binary arithmetic operation, to
correct burst errors and finally to correct any
singledigit error in a decimal operation.",
acknowledgement = acknhfb,
keywords = "decimal arithmetic",
}º
Q5Q‹`;W#+A_;a7E‚;]A_articlefparith.bibKettel:1961:AAME. Kettel and W. SchneiderAn Accurate Analog Multiplier and DividerjIRETRANSELECCOMPUTEC102269272jun61961IRELAOhttp://dx.doi.org/10.1109/TEC.1961.521919803679950 OR 03679950Thu Jul 14 14:45:03 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 14:45:03 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219198IRE Transactions on Electronic ComputersacknhfbE. Kettel and W. SchneiderAn Accurate Analog Multiplier and Divider
@Article{Kettel:1961:AAM,
author = "E. Kettel and W. Schneider",
title = "An Accurate Analog Multiplier and Divider",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "2",
pages = "269272",
month = jun,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219198",
ISSN = "03679950",
bibdate = "Thu Jul 14 14:45:03 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219198",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}‘G:W '#1+oQ#]=m;…?1…?+sQinproceedingsfparith.bibHenderson:1961:RCED. S. HendersonProceedings of the 1961 16th ACM national meetingResidue class error checking codespubACMpubACM:adr132.101132.1041961http://doi.acm.org/10.1145/800029.808563Thu Aug 07 19:04:58 2008http://www.math.utah.edu/pub/tex/bib/fparith.bib2008.08.07 19:04:58 ???Error checking codes based on residues have the advantage over paritybased codes of monitoring arithmetic as well as transmission operations. Codes may be devised to detect bursttype errors, to correct single errors in a binary arithmetic operation, to correct burst errors and finally to correct any singledigit error in a decimal operation.decimal arithmeticacknhfbError checking codes based on residues have the advantage over paritybased codes of monitoring arithmetic as well as transmission operations. Codes may be devised to detect bursttype errors, to correct single errors in a binary arithmetic operation, to correct burst errors and finally to correct any singledigit error in a decimal operation.D. S. Henderson{Proceedings of the 1961 16th ACM national meeting}Residue class error checking codes
@InProceedings{Henderson:1961:RCE,
author = "D. S. Henderson",
booktitle = "{Proceedings of the 1961 16th ACM national meeting}",
title = "Residue class error checking codes",
publisher = pubACM,
address = pubACM:adr,
pages = "132.101132.104",
year = "1961",
DOI = "http://doi.acm.org/10.1145/800029.808563",
bibdate = "Thu Aug 07 19:04:58 2008",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Error checking codes based on residues have the
advantage over paritybased codes of monitoring
arithmetic as well as transmission operations. Codes
may be devised to detect bursttype errors, to correct
single errors in a binary arithmetic operation, to
correct burst errors and finally to correct any
singledigit error in a decimal operation.",
acknowledgement = acknhfb,
keywords = "decimal arithmetic",
}
µ
µ‹T=W#EO;a7E‚;]ESarticlefparith.bibKovatch:1961:HEAG. Kovatch and W. E. MeserveThe HallEffect Analog MultiplierjIRETRANSELECCOMPUTEC103512515sep91961IRELAOhttp://dx.doi.org/10.1109/TEC.1961.521924003679950 OR 03679950Thu Jul 14 14:45:04 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 14:45:04 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219240IRE Transactions on Electronic ComputersacknhfbG. Kovatch and W. E. MeserveThe {HallEffect} Analog Multiplier
@Article{Kovatch:1961:HEA,
author = "G. Kovatch and W. E. Meserve",
title = "The {HallEffect} Analog Multiplier",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "3",
pages = "512515",
month = sep,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219240",
ISSN = "03679950",
bibdate = "Thu Jul 14 14:45:04 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219240",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}ŠoY#+9#;a7E‚;]9#uarticlefparith.bibLehman:1961:STHM. Lehman and N. BurlaSkip Techniques for HighSpeed CarryPropagation in Binary Arithmetic UnitsjIRETRANSELECCOMPUTEC104691698dec121961IRELAOhttp://dx.doi.org/10.1109/TEC.1961.521927403679950 OR 03679950Thu Jul 14 14:45:04 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 14:45:04 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219274IRE Transactions on Electronic ComputersacknhfbM. Lehman and N. BurlaSkip Techniques for HighSpeed CarryPropagation in Binary Arithmetic Units
@Article{Lehman:1961:STH,
author = "M. Lehman and N. Burla",
title = "Skip Techniques for HighSpeed CarryPropagation in
Binary Arithmetic Units",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "4",
pages = "691698",
month = dec,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219274",
ISSN = "03679950",
bibdate = "Thu Jul 14 14:45:04 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219274",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}date = "Fri Nov 25 18:19:32 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Knuth:1960:INS}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "$\sqrt(x)$; elementary functions",
ZMreviewer = "C. B. Haselgrove",
}À
7
Þïªz7„A‰
@Article{Robertson:1958:NCDa,
author = "J. E. Robertson",
title = "A new class of digital division methods",
journal = jIRETRANSELECCOMPUT,
volume = "EC7",
number = "3",
pages = "8892",
month = sep,
year = "1958",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Thu Apr 2 08:38:35 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acksfo # " and " # acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}}„.ˆ_
@Article{Robertson:1956:NCD,
author = "J. E. Robertson",
title = "A new class of digital division methods",
journal = jIRETRANSELECCOMPUT,
volume = "EC5",
number = "??",
pages = "6573",
month = jun,
year = "1956",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Fri Nov 09 19:14:45 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}`†C
@Article{Robertson:1955:TCM,
author = "J. E. Robertson",
title = "Two's Complement Multiplication in Binary Parallel
Digital Computers",
journal = jIRETRANSELECCOMPUT,
volume = "EC4",
number = "3",
pages = "118119",
month = sep,
year = "1955",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/IRETELC.1955.5407911",
ISSN = "03679950",
bibdate = "Thu Jun 30 15:10:39 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5407911",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}[›,¶Y
@Article{Robertazzi:1988:BOF,
author = "T. G. Robertazzi and S. C. Schwartz",
title = "Best ``Ordering'' for FloatingPoint Addition",
journal = jTOMS,
volume = "14",
number = "1",
pages = "101110",
month = mar,
year = "1988",
CODEN = "ACMSCU",
DOI = "http://doi.acm.org/10.1145/42288.42343",
ISSN = "00983500 (print), 15577295 (electronic)",
ISSNL = "00983500",
MRclas
…Š[
@Article{Rjabko:1977:AHM,
author = "B. Ja. Rjabko",
title = "An analogue of {Haffmen}'s method for the optimal
summation of floating point numbers. ({Russian})",
journal = "Diskret. Analiz",
volume = "30",
pages = "3845, 77",
year = "1977",
MRclass = "68C05 (68E99)",
MRnumber = "80c:68023",
bibdate = "Fri Dec 8 08:24:14 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
language = "Russian",
reviewer = "Vladimir Sleinikov",
xxjournal = "Metody Diskret. Anal. v Reshenii Kombinatornykh
Zadach",
}Â„q‰c
@Article{Rix:1982:UQA,
author = "P. Rix",
title = "{Universeller Quad\rat\wurz\elAl\go\rith\mus}
\toenglish {Universal Square Root Algorithms}
\endtoenglish",
journal = jELECTRONIK,
volume = "23",
pages = "8182",
year = "1982",
CODEN = "EKRKAR",
ISSN = "00135658",
bibdate = "Fri Sep 16 16:30:41 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Elektronik",
}€
@Y #+' 57E‚5;=?Mc'A qarticlefparith.bibNadler:1961:DSRMorton NadlerDivision and square root in the quaterimaginary number systemjCACM44192193apr41961CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 0001078265.9923\#B555Fri Nov 25 18:19:32 MST 2005http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.11.25 18:19:32 MSTSee cite Knuth:1960:INS.Communications of the ACM$sqrt (x)$; elementary functionsacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Morton NadlerSee \cite{Knuth:1960:INS}.Division and square root in the quaterimaginary number system
@Article{Nadler:1961:DSR,
author = "Morton Nadler",
title = "Division and square root in the quaterimaginary
number system",
journal = jCACM,
volume = "4",
number = "4",
pages = "192193",
month = apr,
year = "1961",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "65.99",
MRnumber = "23\#B555",
bibdate = "Fri Nov 25 18:19:32 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Knuth:1960:INS}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "$\sqrt(x)$; elementary functions",
ZMreviewer = "C. B. Haselgrove",
}/links.jstor.org/sici?sici=00034851%28196112%2932%3A4%3C1223%3AOTDOFS%3E2.0.CO%3B2T",
abstract = "It has been noticed by astute observers that well used
tables of logarithms are invariably dirtier at the
front than at the back. Upon reflection one is led to
inquire whether there are more physical constants with
low order first significant digits than high. Actual
counts by Benford [2] show that not only is this the
case but that it seems to be an empirical truth that
whenever one has a large body of physical data,
Farmer's Almanac, Census Reports, Chemical Rubber
Handbook, etc., the proportion of these data with first
significant digit $n$ or less is approximately $
\log_{10}(n + 1) $. Any reader formerly unaware of this
``peculiarity'' will find an actual sampling experiment
wondrously tantalizing. Thus, for example,
approximately $ 0.7 $ of the physical constants in the
Chemical Rubber Handbook begin with $4$ or less ($
\log_{10}(4 + 1) = 0.699 $ ). This is to be contrasted
with the widespread intuitive evaluation $ 4 / 9 $
ths.",
acknowledgement = acknhfb,
fjournal = "Annals of Mathematical Statistics",
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
remark = "From p. 1223: ``\ldots{} the proportion of these data
with first significant digit $n$ or less is
approximately $ \log_{10}(n + 1) $.''\par
\ldots{} ``The only distribution for first significant
digits which is invariant under scale change of the
underlying distribution is $ \log_{10}(n + 1) $.
Contrary to suspicion this is a nontrivial
mathematical result, for the variable $n$ is
discrete.''.\par
From p. 1230: ``The foregoing results bear on questions
of roundoff in computing machines. Since $ d(u v) = u
d v + v d u $, the error resulting from multiplying two
rounded numbers will be governed primarily by the first
significant digits of the two numbers being multiplied.
Now the distribution of first significant digits,
favoring as it does low order digits, tends to produce
less error than would be the case if first significant
digits were uniform as has sometimes been
assumed.''\par
Cited in \cite{Sterbenz:1974:FPC}.",
}Ástants with low order first significant digits than high. Actual counts by Benford [2] show that not only is this the case but that it seems to be an empirical truth that whenever one has a large body of physical data, Farmer's Almanac, Census Reports, Chemical Rubber Handbook, etc., the proportion of these data with first significant digit $n$ or less is approximately $ \log_{10}(n + 1) $. Any reader formerly unaware of this ``peculiarity'' will find an actual sampling experiment wondrously tantalizing. Thus, for example, approximately $ 0.7 $ of the physical constants in the Chemical Rubber Handbook begin with $4$ or less ($ \log_{10}(4 + 1) = 0.699 $ ). This is to be contrasted with the widespread intuitive evaluation $ 4 / 9 $ ths.Roger S. PinkhamOn the Distribution of First Significant Digits
@Article{Pinkham:1961:DFS,
author = "Roger S. Pinkham",
title = "On the Distribution of First Significant Digits",
journal = jANNMATHSTAT,
volume = "32",
number = "4",
pages = "12231230",
month = dec,
year = "1961",
CODEN = "AASTAD",
ISSN = "00034851",
bibdate = "Thu Feb 15 15:07:57 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://links.jstor.org/sici?sici=00034851%28196112%2932%3A4%3C1223%3AOTDOFS%3E2.0.CO%3B2T",
abstract = "It has been noticed by astute observers that well used
tables of logarithms are invariably dirtier at the
front than at the back. Upon reflection one is led to
inquire whether there are more physical constants with
low order first significant digits than high. Actual
counts by Benford [2] show that not only is this the
case but that it seems to be an empirical truth that
whenever one has a large body of physical data,
Farmer's Almanac, Census Reports, Chemical Rubber
Handbook, etc., the proportion of these data with first
significant digit $n$ or less is approximately $
\log_{10}(n + 1) $. Any reader formerly unaware of this
``peculiarity'' will find an actual sampling experiment
wondrously tantalizing. Thus, for example,
approximately $ 0.7 $ of the physical constants in the
Chemical Rubber Handbook begin with $4$ or less ($
\log_{10}(4 + 1) = 0.699 $ ). This is to be contrasted
with the widespread intuitive evaluation $ 4 / 9 $
ths.",
acknowledgement = acknhfb,
fjournal = "Annals of Mathematical Statistics",
keywords = "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
remark = "From p. 1223: ``\ldots{} the proportion of these data
with first significant digit $n$ or less is
approximately $ \log_{10}(n + 1) $.''\par
\ldots{} ``The only distribution for first significant
digits which is invariant under scale change of the
underlying distribution is $ \log_{10}(n + 1) $.
Contrary to suspicion this is a nontrivial
mathematical result, for the variable $n$ is
discrete.''.\par
From p. 1230: ``The foregoing results bear on questions
of roundoff in computing machines. Since $ d(u v) = u
d v + v d u $, the error resulting from multiplying two
rounded numbers will be governed primarily by the first
significant digits of the two numbers being multiplied.
Now the distribution of first significant digits,
favoring as it does low order digits, tends to produce
less error than would be the case if first significant
digits were uniform as has sometimes been
assumed.''\par
Cited in \cite{Sterbenz:1974:FPC}.",
}
f×fˆmBV #3'C57=m;?c'C‰uarticlefparith.bibRabinowitz:1961:MPDP. RabinowitzMultiplePrecision DivisionjCACM429898feb21961CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Thu Sep 08 00:29:25 1994http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.08 00:29:25 ???Communications of the ACMacknjhttp://portal.acm.org/browse_dl.cfm?idx=J79P. RabinowitzMultiplePrecision Division
@Article{Rabinowitz:1961:MPD,
author = "P. Rabinowitz",
title = "MultiplePrecision Division",
journal = jCACM,
volume = "4",
number = "2",
pages = "9898",
month = feb,
year = "1961",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu Sep 08 00:29:25 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}´AY #k+!7=m;CŽmOsŽ7Žuk³5articlefparith.bibPinkham:1961:DFSRoger S. PinkhamOn the Distribution of First Significant DigitsjANNMATHSTAT32412231230dec121961AASTAD00034851 OR 00034851Thu Feb 15 15:07:57 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.02.15 15:07:57 ???http://links.jstor.org/sici?sici=00034851%28196112%2932%3A4%3C1223%3AOTDOFS%3E2.0.CO%3B2TIt has been noticed by astute observers that well used tables of logarithms are invariably dirtier at the front than at the back. Upon reflection one is led to inquire whether there are more physical constants with low order first significant digits than high. Actual counts by Benford [2] show that not only is this the case but that it seems to be an empirical truth that whenever one has a large body of physical data, Farmer's Almanac, Census Reports, Chemical Rubber Handbook, etc., the proportion of these data with first significant digit $n$ or less is approximately $ log _10(n + 1) $. Any reader formerly unaware of this ``peculiarity'' will find an actual sampling experiment wondrously tantalizing. Thus, for example, approximately $ 0.7 $ of the physical constants in the Chemical Rubber Handbook begin with $4$ or less ($ log _10(4 + 1) = 0.699 $ ). This is to be contrasted with the widespread intuitive evaluation $ 4 / 9 $ ths.Annals of Mathematical StatisticsBenford's Law; Law of Anomalous Numbers; Zipf's LawFrom p. 1223: ``ldots the proportion of these data with first significant digit $n$ or less is approximately $ log _10(n + 1) $.''par ldots ``The only distribution for first significant digits which is invariant under scale change of the underlying distribution is $ log _10(n + 1) $. Contrary to suspicion this is a nontrivial mathematical result, for the variable $n$ is discrete.''.par From p. 1230: ``The foregoing results bear on questions of roundoff in computing machines. Since $ d(u v) = u d v + v d u $, the error resulting from multiplying two rounded numbers will be governed primarily by the first significant digits of the two numbers being multiplied. Now the distribution of first significant digits, favoring as it does low order digits, tends to produce less error than would be the case if first significant digits were uniform as has sometimes been assumed.''par Cited in cite Sterbenz:1974:FPC.acknhfbIt has been noticed by astute observers that well used tables of logarithms are invariably dirtier at the front than at the back. Upon reflection one is led to inquire whether there are more physical conÃ
U
U‹+DY #1)'57Ek;A=)ŒM articlefparith.bibSpielberg:1961:ECFKurt SpielbergEfficient Continued Fraction Approximations To Elementary FunctionsjMATHCOMPUT1576409417oct101961MCMPAF00255718 (print), 10886842 (electronic) OR 00255718 (print), 10886842 (electronic)00255718 OR 00255718Tue Oct 13 08:06:19 MDT 1998ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.13 08:06:19 MDTMathematics of Computationacknjhttp://www.ams.org/mcom/Kurt SpielbergEfficient Continued Fraction Approximations To Elementary Functions
@Article{Spielberg:1961:ECF,
author = "Kurt Spielberg",
title = "Efficient Continued Fraction Approximations To
Elementary Functions",
journal = jMATHCOMPUT,
volume = "15",
number = "76",
pages = "409417",
month = oct,
year = "1961",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Tue Oct 13 08:06:19 MDT 1998",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR
database",
acknowledgement = acknj # " and " # acknhfb,
fjournal = "Mathematics of Computation",
journalURL = "http://www.ams.org/mcom/",
}‹xCW #){;a7E‚;]){?articlefparith.bibSaltman:1961:RCTRoy G. SaltmanReducing Computing Time for Synchronous Binary DivisionjIRETRANSELECCOMPUTEC102169174jun61961IRELAOhttp://dx.doi.org/10.1109/TEC.1961.521918603679950 OR 03679950Thu Jul 14 14:45:03 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 14:45:03 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219186IRE Transactions on Electronic ComputersacknhfbRoy G. SaltmanReducing Computing Time for Synchronous Binary Division
@Article{Saltman:1961:RCT,
author = "Roy G. Saltman",
title = "Reducing Computing Time for Synchronous Binary
Division",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "2",
pages = "169174",
month = jun,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219186",
ISSN = "03679950",
bibdate = "Thu Jul 14 14:45:03 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219186",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
n
Áò
‘;L]n˜t±i
@Book{Deschamps:2009:HIF,
author = "JeanPierre Deschamps and Jos{\'e} Luis Ima{\~n}a and
Gustavo D. Sutter",
title = "Hardware implementation of finitefield arithmetic",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
pages = "xiii + 347",
year = "2009",
ISBN = "0071545816 (hardcover)",
ISBN13 = "9780071545815 (hardcover)",
LCCN = "TK7895.E42 D466 2009",
bibdate = ›y
@Book{Deschamps:2006:SAC,
author = "JeanPierre Deschamps and G{\'e}ry Jean Antoine Bioul
and Gustavo D. Sutter",
title = "Synthesis of arithmetic circuits: {FPGA}, {ASIC}, and
embedded systems",
publisher = pubWILEY,
address = pubWILEY:adr,
pages = "xix + 556",
year = "2006",
ISBN = "0471687839 (hardcover)",
ISBN13 = "9780471687832 (hardcover)",
LCCN = "TK7895.AxV»
@Book{DeSautels:1982:ALP,
author = "Edouard J. DeSautels",
title = "Assembly language programming for {PDP11} and
{LSI11} computers: an introduction to computer
organization",
publisher = "William C. Brown Co. Publ.",
address = "Dubuque, IA",
pages = "574",
year = "1982",
ISBN = "0697081648",
ISBN13 = "9780697081643",
bibdate = "Sat Nov 9 08:26:18 MST 2002",
bibso6„T‰)
@Book{Dalhquist:1974:NM,
author = "Germund Dalhquist and {\AA}ke Bj{\"o}rck and Ned
Anderson",
title = "Numerical Methods",
publisher = pubPH,
address = pubPH:adr,
pages = "xviii + 573",
year = "1974",
ISBN = "0136273157",
ISBN13 = "9780136273158",
LCCN = "QA297 .D131 1969",
bibdate = "Tue Dec 14 22:44:59 1993",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
series = "PrenticeHall Series in Automatic Computation",
acknowledgement = acknhfb,
}Ý‚_…?
@Book{DEC:1992:AAH,
author = "Digital Equipment Corporation",
title = "{Alpha} Architecture Handbook",
publisher = pubDP,
address = pubDP:adr,
year = "1992",
bibdate = "Mon Jan 18 15:08:40 1993",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}
…ƒM‡
@Book{DEC:1977:VAH,
author = "{Digital Equipment Corporation}",
title = "{VAX11}\slash 780 Architecture Handbook",
publisher = pubDP,
address = pubDP:adr,
pages = "328",
year = "1977",
LCCN = "QA76.8 .V12D5 B 2 829 348",
bibdate = "Thu Sep 15 18:50:55 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
xxISBN = "(none)",
}œ„=ˆ{
@Book{DEC:1976:DHM,
author = "{Digital Equipment Corporation}",
title = "{DECsystem}10\slash 20 Hardware Manual",
publisher = pubDP,
address = pubDP:adr,
edition = "Fourth",
pages = "various",
month = mar,
year = "1976",
bibdate = "Fri Dec 08 13:03:19 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Also published as Stanford Artificial Intelligence
Laboratory Operating Note 75, November 1976.",
acknowledgement = acknhfb,
}`
’
FX #'!O%1%=m;†M!†MSEbookfparith.bibTaub:1961:JNCA. H. TaubJohn von Neumann: Collected WorkspubPERGAMONpubPERGAMON:adr??? (vol. 1), 568 (vol. 2), 574 (vol. 3), 516 (vol. 4), ??? (vol. 5), ??? (vol. 6)1961  1963Wed Jun 01 16:58:29 2005http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.06.01 16:58:29 ???Six volumes. Volume I: Logic, Theory of Sets and Quantum Mechanics (1961); Volume II: Operators, Ergodic Theory and Almost Periodic Functions in a Group (1961); Volume III: Rings of Operators (1961); Volume IV: Continuous Geometry and Other Topics (1962); Volume V: Design of Computers, Theory of Automata and Numerical Analysis (1963); Volume VI: Theory of Games, Astrophysics, Hydrodynamics and Meteorology (1963).acknhfbA. H. TaubSix volumes. Volume I: Logic, Theory of Sets and Quantum Mechanics (1961); Volume II: Operators, Ergodic Theory and Almost Periodic Functions in a Group (1961); Volume III: Rings of Operators (1961); Volume IV: Continuous Geometry and Other Topics (1962); Volume V: Design of Computers, Theory of Automata and Numerical Analysis (1963); Volume VI: Theory of Games, Astrophysics, Hydrodynamics and Meteorology (1963).{John von Neumann}: Collected Works
@Book{Taub:1961:JNC,
editor = "A. H. Taub",
title = "{John von Neumann}: Collected Works",
publisher = pubPERGAMON,
address = pubPERGAMON:adr,
pages = "??? (vol. 1), 568 (vol. 2), 574 (vol. 3), 516 (vol.
4), ??? (vol. 5), ??? (vol. 6)",
year = "19611963",
LCCN = "????",
bibdate = "Wed Jun 01 16:58:29 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Six volumes. Volume I: Logic, Theory of Sets and
Quantum Mechanics (1961); Volume II: Operators, Ergodic
Theory and Almost Periodic Functions in a Group (1961);
Volume III: Rings of Operators (1961); Volume IV:
Continuous Geometry and Other Topics (1962); Volume V:
Design of Computers, Theory of Automata and Numerical
Analysis (1963); Volume VI: Theory of Games,
Astrophysics, Hydrodynamics and Meteorology (1963).",
acknowledgement = acknhfb,
}‹\EY #1%[57=K;1e%[ŒGarticlefparith.bibSpielberg:1961:RPSK. SpielbergRepresentation of Power Series in Terms of Polynomials, Rational Approximations and Continued FractionsjJACM84613627oct101961JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Sat Dec 09 14:01:44 1995ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1995.12.09 14:01:44 ???Journal of the ACMacknjhttp://portal.acm.org/browse_dl.cfm?idx=J401K. SpielbergRepresentation of Power Series in Terms of Polynomials, Rational Approximations and Continued Fractions
@Article{Spielberg:1961:RPS,
author = "K. Spielberg",
title = "Representation of Power Series in Terms of
Polynomials, Rational Approximations and Continued
Fractions",
journal = jJACM,
volume = "8",
number = "4",
pages = "613627",
month = oct,
year = "1961",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Sat Dec 09 14:01:44 1995",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}x volumes. Volume I: Logic, Theory of Sets and
Quantum Mechanics (1961); Volume II: Operators, Ergodic
Theory and Almost Periodic Functions in a Group (1961);
Volume III: Rings of Operators (1961); Volume IV:
Continuous Geometry and Other Topics (1962); Volume V:
Design of Computers, Theory of Automata and Numerical
Analysis (1963); Volume VI: Theory of Games,
Astrophysics, Hydrodynamics and Meteorology (1963).",
acknowledgement = acknhfb,
}Æ
‰
‰ŠsGY #75'57E
;A=;5‹Warticlefparith.bibThacher:1961:ISRHenry C. Thacher, Jr.Iterated Square Root Expansions for the Inverse Cosine and Inverse Hyperbolic CosinejMATHCOMPUT1576399403oct101961MCMPAF00255718 (print), 10886842 (electronic) OR 00255718 (print), 10886842 (electronic)00255718 OR 00255718Tue Oct 13 08:06:19 MDT 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.13 08:06:19 MDTMathematics of Computationacknhfbhttp://www.ams.org/mcom/Henry C. {Thacher, Jr.}Iterated Square Root Expansions for the Inverse Cosine and Inverse Hyperbolic Cosine
@Article{Thacher:1961:ISR,
author = "Henry C. {Thacher, Jr.}",
title = "Iterated Square Root Expansions for the Inverse Cosine
and Inverse Hyperbolic Cosine",
journal = jMATHCOMPUT,
volume = "15",
number = "76",
pages = "399403",
month = oct,
year = "1961",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Tue Oct 13 08:06:19 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "Mathematics of Computation",
journalURL = "http://www.ams.org/mcom/",
}tex/bib/fparith.bib",
abstract = "Based on the results of a third survey, the
engineering and programming characteristics of two
hundred twentytwo different electronic digital
computing systems are given. The data are presented
from the point of view of application, numerical and
arithmetic characteristics, input, output and storage
systems, construction and checking features, power,
space, weight, and site preparation and personnel
requirements, production records, cost and rental
rates, sale and lease policy, reliability, operating
experience, and time availability, engineering
modifications and improvements and other related
topics. An analysis of the survey data, fifteen
comparative tables, a discussion of trends, a revised
bibliography, and a complete glossary of computer
engineering and programming terminology are included.",
acknowledgement = ackmfc # " and " # acknhfb,
}È
rr
HY !#')KM=m;Œ]Œ])™atechreportfparith.bibWeik:1961:TSDMartin H. WeikA Third Survey of Domestic Electronic Digital Computing SystemsReport1115Ballistic Research LaboratoriesAberdeen Proving Ground, MD, USA1131mar31961Fri Nov 28 19:37:51 2003http://www.math.utah.edu/pub/tex/bib/fparith.bib2003.11.28 19:37:51 ???Based on the results of a third survey, the engineering and programming characteristics of two hundred twentytwo different electronic digital computing systems are given. The data are presented from the point of view of application, numerical and arithmetic characteristics, input, output and storage systems, construction and checking features, power, space, weight, and site preparation and personnel requirements, production records, cost and rental rates, sale and lease policy, reliability, operating experience, and time availability, engineering modifications and improvements and other related topics. An analysis of the survey data, fifteen comparative tables, a discussion of trends, a revised bibliography, and a complete glossary of computer engineering and programming terminology are included.ackmfcBased on the results of a third survey, the engineering and programming characteristics of two hundred twentytwo different electronic digital computing systems are given. The data are presented from the point of view of application, numerical and arithmetic characteristics, input, output and storage systems, construction and checking features, power, space, weight, and site preparation and personnel requirements, production records, cost and rental rates, sale and lease policy, reliability, operating experience, and time availability, engineering modifications and improvements and other related topics. An analysis of the survey data, fifteen comparative tables, a discussion of trends, a revised bibliography, and a complete glossary of computer engineering and programming terminology are included.Martin H. WeikA Third Survey of Domestic Electronic Digital Computing Systems
@TechReport{Weik:1961:TSD,
author = "Martin H. Weik",
title = "A Third Survey of Domestic Electronic Digital
Computing Systems",
type = "Report",
number = "1115",
institution = "Ballistic Research Laboratories",
address = "Aberdeen Proving Ground, MD, USA",
pages = "1131",
month = mar,
year = "1961",
bibdate = "Fri Nov 28 19:37:51 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Based on the results of a third survey, the
engineering and programming characteristics of two
hundred twentytwo different electronic digital
computing systems are given. The data are presented
from the point of view of application, numerical and
arithmetic characteristics, input, output and storage
systems, construction and checking features, power,
space, weight, and site preparation and personnel
requirements, production records, cost and rental
rates, sale and lease policy, reliability, operating
experience, and time availability, engineering
modifications and improvements and other related
topics. An analysis of the survey data, fifteen
comparative tables, a discussion of trends, a revised
bibliography, and a complete glossary of computer
engineering and programming terminology are included.",
acknowledgement = ackmfc # " and " # acknhfb,
}
H·‰!LV %#/)+c=+3%=%;M)g+=Šincollectionfparith.bibCampbell:1962:FPOS. G. CampbellWerner BuchholzPlanning a Computer System: Project StretchFloatingPoint OperationpubMCGRAWHILLpubMCGRAWHILL:adr921211962QA76.8.I2 I5Wed Feb 14 17:24:27 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib; z3950.loc.gov:7090/Voyager2007.02.14 17:24:27 ???IBM 7030 (Computer); IBM Stretchacknhfb322S. G. CampbellPlanning a Computer System: {Project Stretch}Werner BuchholzFloatingPoint Operation
@InCollection{Campbell:1962:FPO,
author = "S. G. Campbell",
editor = "Werner Buchholz",
booktitle = "Planning a Computer System: {Project Stretch}",
title = "FloatingPoint Operation",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
pages = "92121",
year = "1962",
LCCN = "QA76.8.I2 I5",
bibdate = "Wed Feb 14 17:24:27 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = acknhfb,
bookpages = "322",
subject = "IBM 7030 (Computer); IBM Stretch",
}älK\ #/+c+3!Eƒ{;{µC7ñ%+{g‚”eSbookfparith.bibBuchholz:1962:PCSWerner BuchholzPlanning a computer system: Project StretchpubMCGRAWHILLpubMCGRAWHILL:adrxvii + 32219621876Fri Nov 19 10:02:31 MST 2010http://www.math.utah.edu/pub/bibnet/authors/t/tukeyjohnw.bib; http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; library.ox.ac.uk:210/ADVANCE2010.11.19 10:02:31 MSTThis important book is the primary description of the influential IBM 7030 Stretch computer, written by its architÒ…OJU '#3M)=m;Q…cinproceedingsfparith.bibAshenhurst:1962:MIAR. L. AshenhurstThe Maniac III Arithmetic SystemAFIPS:1962:APS1922021962Wed Feb 14 17:14:21 2007http://www.math.utah.edu/pub/tex/bib/fparith.bib2007.02.14 17:14:21 ???acknhfbR. L. AshenhurstThe {Maniac III} Arithmetic System
@InProceedings{Ashenhurst:1962:MIA,
author = "R. L. Ashenhurst",
title = "The {Maniac III} Arithmetic System",
crossref = "AFIPS:1962:APS",
pages = "192202",
year = "1962",
bibdate = "Wed Feb 14 17:14:21 2007",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}‹aIW#+GY;a7E‚;]GY articlefparith.bibWilson:1961:ARBJ. B. Wilson and R. S. LedleyAn Algorithm for Rapid Binary DivisionjIRETRANSELECCOMPUTEC104662670dec121961IRELAOhttp://dx.doi.org/10.1109/TEC.1961.521927103679950 OR 03679950Thu Jul 14 14:45:04 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 14:45:04 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219271IRE Transactions on Electronic ComputersacknhfbJ. B. Wilson and R. S. LedleyAn Algorithm for Rapid Binary Division
@Article{Wilson:1961:ARB,
author = "J. B. Wilson and R. S. Ledley",
title = "An Algorithm for Rapid Binary Division",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "4",
pages = "662670",
month = dec,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219271",
ISSN = "03679950",
bibdate = "Thu Jul 14 14:45:04 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219271",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}Î
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
library.ox.ac.uk:210/ADVANCE",
note = "This important book is the primary description of the
influential IBM 7030 Stretch computer, written by its
architects.",
URL = "http://edthelen.org/comphist/IBM7030PlanningMcJones.pdf",
acknowledgement = acknhfb,
remark = "The text of the book is in the public domain, with the
permission of the author in 2003.
See \cite{MacKenzie:1991:IAL} for a remark about the
noisy mode for floatingpoint arithmetic in the IBM
7030 Stretch. That mode is first mentioned on page 25
of this book, and described in detail on page 102,
which states:
``By definition of ordinary normalized FLP operations,
numbers are frequently extended on the right by
attaching zeros. During addition the ndigit operand
that is not preshifted is extended with n zeros, so as
to provide the extra positions to which the preshifted
operand can be added. Any operand or result that is
shifted left to be normalized requires a corresponding
number of zeros to be shifted in at the right. Both
sets of zeros tend to produce numbers smaller in
absolute value than they would have been if more digits
had been carried. In the noisy mode these numbers are
simply extended with 1 s instead of zeros (1 s in a
binary machine, 9s in a decimal machine). So all
numbers tend to be too large in absolute value. The
true value, if there had been no significance loss,
should lie between these two extremes. Hence, two runs,
one made without and one made with the noisy mode,
should show differences in result that indicate which
digits may have been affected by significance loss.
The principal weakness of the noisymode procedure is
that it requires two runs for the same problem. A much
less important weakness is that the loss of
significance cannot be guaranteed to show up  it
merely has a very high probability of showing up 
whereas builtin significance checks can be made
slightly pessimistic, so that actual significance loss
will not be greater than indicated. On the other hand,
little extra hardware and no extra storage are required
for the noisymode approach. Furthermore, significance
loss is relatively rare, so that running a problem
twice when Significance loss is suspected does not pose
a serious problem. What is serious is the possibility
of unsuspected significance loss.
In discussions of significance two points are often
overlooked. The first of these is trivial: the best way
of ensuring significant results is to use an adequate
number of fraction digits. The second is almost equally
mundane: for a given procedure, normalized FLP
arithmetic will ordinarily produce the greatest
precision possible for the number of fraction digits
used. Normalized FLP arithmetic has been criticized
with respect to significance loss, because such loss is
not indicated by the creation of leading zeros, as it
is with fixedpoint arithmetic. In other words, the
contention is not that normalized FLP arithmetic is
more prone to significance loss than equivalent
Ï fixedpoint arithmetic, which would be untrue, but that
an equivalent indication of such loss is not provided.
Loss of significance, however, is also a serious
problem in fixedpoint arithmetic; multiplication and
division do not handle it at all correctly by means of
leading zeros. (In particular, fixedpoint
multiplication may lead to serious or even total
significance loss, which would not have occurred with
normalized FLP arithmetic: and although leading zeros
in addition and subtraction of fixedpoint operands do
give correct significance indications, the use of other
operations and of builtin scaling loops frequently
destroys entirely the leadingzeros method of counting
significance.)''",
subject = "Computer architecture",
tableofcontents = "Foreword v \\
Preface vii \\
1. Project Stretch 1 \\
[by W. Buchholz] \\
2. Architectural Philosophy 5 \\
[by F. P. Brooks, Jr.] \\
2.1. The Two Objectives of Project Stretch 5 \\
2.2. Resources 6 \\
2.3. Guiding Principles 7 \\
2.4. Contemporary Trends in Computer Architecture 10
\\
2.5. Hindsight 15 \\
3. System Summary of IBM 7030 17 \\
[by W. Buchholz] \\
3.1. System Organization 17 \\
3.2. Memory Units 17 \\
3.3. Index Memory 19 \\
3.4. Special Registers 19 \\
3.5. Input and Output Facilities 19 \\
3.6. Highspeed Disk Units 20 \\
3.7. Central Processing Unit 20 \\
3.8. Instruction Controls 21 \\
3.9. Indexarithmetic Unit 21 \\
3.10. Instruction Lookahead 21 \\
3.11. Arithmetic Unit 22 \\
3.12. Instruction Set 24 \\
3.13. Data Arithmetic 24 \\
3.14. Radixconversion Operations 27 \\
3.15. Connective Operations 27 \\
3.16. Indexarithmetic Operations 27 \\
3.17. Branching Operations 28 \\
3.18. Transmission Operations 28 \\
3.19. InputOutput Operations 29 \\
3.20. New Features 29 \\
3.21. Performance 32 \\
4. Natural Data Units 33 \\
[by G. P. Blaauw, F. P. Brooks, Jr., and W. Buchholz]
\\
4.1. Lengths and Structures of Natural Data Units 33
\\
4.2. Procedures for Specifying Natural Data Units 36
\\
4.3. Data Hierarchies 39 \\
4.4. Classes of Operations 40 \\
5. Choosing a Number Base 42 \\
[by W. Buchholz] \\
5.1. Introduction 42 \\
5.2. Information Content 45 \\
5.3. Arithmetic Speed 49 \\
5.4. Numerical Data 50 \\
5.5. Nonnumerical Data 51 \\
5.6. Addresses 52 \\
5.7. Transformation 53 \\
5.8. Partitioning of Memory 54 \\
5.9. Program Interpretation 56 \\
5.10. Other Number Bases 58 \\
5.11. Conclusion 58 \\
6. Character Set 60 \\
[by R. W. Bemer and W. Buchholz] \\
6.1. Introduction 60 \\
6.2. Size of Set 62 \\
6.3. Subsets 62 \\
6.4. Expansion of Set 63 \\
6.5. Code 63 \\
6.6. Parity Bit 66 \\
6.7. Sequence 66 \\
6.8. Blank 67 \\
6.9. Decimal Digits 68 \\
6.10. Typewriter Keyboard 68 \Ð\
6.11. Adjacency 69 \\
6.12. Uniqueness 69 \\
6.13. Signs 70 \\
6.14. Taperecording Convention 71 \\
6.15. Cardpunching Convention 71 \\
6.16. List of 7030 Character Set 72 \\
7. Variablefieldlength Operation 75 \\
[by G. P. Blaauw, F. P. Brooks, Jr., and W. Buchholz]
\\
7.1. Introduction 75 \\
7.2. Addressing of Variablefieldlength Data 76 \\
7.3. Field Length 77 \\
7.4. Byte Size 78 \\
7.5. Universal Accumulator 79 \\
7.6. Accumulator Operand 79 \\
7.7. Binary and Decimal Arithmetic 80 \\
7.8. Integer Arithmetic 81 \\
7.9. Numerical Signs 82 \\
7.10. Indicators 84 \\
7.11. Arithmetical Operations 85 \\
7.12. Radixconversion Operation 87 \\
7.13. Logical Connectives of Two Variables 87 \\
7.14. Connective Operations 89 \\
8. Floatingpoint Operation 92 \\
[by S. G. Campbell] \\
General Discussion \\
8.1. Problems of Fixedpoint Arithmetic 92 \\
8.2. Floatingpoint Arithmetic 94 \\
8.3. Normalization 97 \\
8.4. Floatingpoint Singularities 98 \\
8.5. Range and Precision 99 \\
8.6. Roundoff Error 100 \\
8.7. Significance Checks 101 \\
8.8. Forms of Floatingpoint Arithmetic 103 \\
8.9. Structure of Floatingpoint Data 104 \\
Floatingpoint Features of the 7030 \\
8.10. Floatingpoint Instruction Format 106 \\
8.11. Floatingpoint Data Formats 106 \\
8.12. Singular Floatingpoint Numbers 108 \\
8.13. Indicators 112 \\
8.14. Universal Accumulator 113 \\
8.15. Fraction Arithmetic 114 \\
8.16. Floatingpointarithmetic Operations 114 \\
8.17. Fixedpoint Arithmetic Using Unnormalized \\
Floatingpoint Operations 118 \\
8.18. Special Functions and Forms of Arithmetic 119 \\
8.19. Multipleprecision Arithmetic 119 \\
8.20. General Remarks 121 \\
9. Instruction Formats 122 \\
[by W. Buchholz] \\
9.1. Introduction 122 \\
9.2. Earlier Instruction Languages 122 \\
9.3. Evolution of the Singleaddress Instruction 124
\\
9.4. Implied Addresses 125 \\
9.5. Basic 7030 Instruction Formats 126 \\
9.6. Instruction Efficiency 127 \\
9.7. The Simplicity of Complexity 131 \\
9.8. Relationship to Automatic Programming Languages
132 \\
10. Instruction Sequencing 133 \\
[by F. P. Brooks, Jr.] \\
10.1. Modes of Instruction Sequencing 133 \\
10.2. Instruction Counter 134 \\
10.3. Unconditional Branching 135 \\
10.4. Conditional Branching 136 \\
10.5. Programinterrupt System 136 \\
10.6. Components of the Programinterrupt System 137
\\
10.7. Examples of Programinterrupt Techniques 140 \\
10.8. Execute Instructions 146 \\
10.9. Execute Operations in the 7030 148 \\
11. Indexing 150 \\
[by G. P. Blaauw] \\
11.1. Introduction 150 \\
11.2. Indexing Functions 151 \\
11.3. Instruction Format for Indexing 155 \\
11.4. Incrementing 157 \\
11.5. Counting 159 \\
11.6. Advancing by One 161 \\
Ñ 11.7. Progressive Indexing 161 \\
11.8. Data Transmission 162 \\
11.9. Data Ordering 163 \\
11.10. Refilling 165 \\
11.11. Indirect Addressing and Indirect Indexing 167
\\
11.12. Indexing Applications 169 \\
11.13. Recordhandling Applications 172 \\
11.14. File Maintenance 175 \\
11.15. Subroutine Control 177 \\
11.16. Conclusion 178 \\
12. InputOutput Control 179 \\
[by W. Buchholz] \\
12.1. A Generalized Approach to Connecting \\
InputOutput and External Storage 179 \\
12.2. InputOutput Instructions 180 \\
12.3. Defining the Memory Area 181 \\
12.4. Writing and Reading 182 \\
12.5. Controlling and Locating 183 \\
12.6. An Alternative Approach 184 \\
12.7. Program Interruptions 184 \\
12.8. Buffering 180 \\
12.9. Interface 188 \\
12.10. Operator Control of InputOutput Units 190 \\
13. Multiprogramming 192 \\
[by E. F. Codd, E. S. Lowry, E. McDonough, and C. A.
Scalzi] \\
13.1. Introduction 192 \\
13.2. Multiprogramming Requirements 193 \\
13.3. 7030 Features that Assist Multiprogramming 195
\\
13.4. Programmed Logic 197 \\
13.5. Concluding Remarks 200 \\
13.6. References 201 \\
14. The Central Processing Unit 202 \\
[by E. Bloch] \\
14.1. Concurrent System Operation 202 \\
14.2. Concurrency within the Central Processing Unit
204 \\
14.3. Data Flow 204 \\
14.4. Arithmetic Unit 208 \\
14.5. Checking 216 \\
14.6. Component Count 216 \\
14.7. Performance 217 \\
14.8. Circuits 218 \\
14.9. Packaging 223 \\
15. The Lookahead Unit 228 \\
[by R. S. Balance, J. Cocke, and H. G. Kolsky] \\
15.1. General Description 228 \\
15.2. Timingsimulation Program 230 \\
15.3. Description of the Lookahead Unit 238 \\
15.4. Forwarding 240 \\
15.5. Counter Sequences 241 \\
15.6. Recovery after Interrupt 246 \\
15.7. A Lookback at the Lookahead 247 \\
16. The Exchange 248 \\
[by W. Buchholz] \\
16.1. General Description 248 \\
16.2. Starting a WRITE or READ Operation 250 \\
16.3. Data Transfer during Writing 250 \\
16.4. Data Transfer during Reading 251 \\
16.5. Terminating a WRITE or READ Operation 252 \\
16.6. Multiple Operations 252 \\
16.7. CONTROL and LOCATE Operations 252 \\
16.8. Interrogating the Control Word 253 \\
16.9. Forced Termination 253 \\
17. A Nonarithmetical System Extension 254 \\
[by S. G. Campbell, P.S. Herwitz, and J. H. Pomerene]
\\
17.1. Nonarithmetical Processing 254 \\
17.2. The Setup Mode 258 \\
17.3. Bytesequence Formation 259 \\
17.4. Pattern Selection 260 \\
17.5. Transformation Facilities 261 \\
17.6. Statistical Aids 263 \\
17.7. The BYTEBYBYTE Instruction 263 \\
17.8. Monitoring for Special Conditions 264 \\
17.9. Instruction Set 265 \\
17.10. Collating Operations 266 \\
17.11. Table Lookup Operations 267 \\
17.12. Example 267 \\
Appendix A. Summary Data 273 \\
A.1. List of the Larger IBM Storedprogram Computers
273 \\
A.2. Instruction Formats 275 \\
A.3. List of Registers and Special Addresses 276 \\
A.4. Summary of Operations and Modifiers 277 \\
A.5. Summary of Indicators 287 \\
Appendix B. Programming Examples 292 \\
Notation 292 \\
B.1. Polynomial Evaluation 295 \\
B.2. Cuberoot Extraction 296 \\
B.3. Matrix Multiplication 298 \\
B.4. Conversion of Decimal Numbers to a \\
Floatingpoint Normalized Vector 299 \\
B.5. Editing a Typed Message 301 \\
B.6. Transposition of a Large Bit Matrix 303 \\
Index 305",
}ËÓects.http://edthelen.org/comphist/IBM7030PlanningMcJones.pdfThe text of the book is in the public domain, with the permission of the author in 2003. See cite MacKenzie:1991:IAL for a remark about the noisy mode for floatingpoint arithmetic in the IBM 7030 Stretch. That mode is first mentioned on page 25 of this book, and described in detail on page 102, which states: ``By definition of ordinary normalized FLP operations, numbers are frequently extended on the right by attaching zeros. During addition the ndigit operand that is not preshifted is extended with n zeros, so as to provide the extra positions to which the preshifted operand can be added. Any operand or result that is shifted left to be normalized requires a corresponding number of zeros to be shifted in at the right. Both sets of zeros tend to produce numbers smaller in absolute value than they would have been if more digits had been carried. In the noisy mode these numbers are simply extended with 1 s instead of zeros (1 s in a binary machine, 9s in a decimal machine). So all numbers tend to be too large in absolute value. The true value, if there had been no significance loss, should lie between these two extremes. Hence, two runs, one made without and one made with the noisy mode, should show differences in result that indicate which digits may have been affected by significance loss. The principal weakness of the noisymode procedure is that it requires two runs for the same problem. A much less important weakness is that the loss of significance cannot be guaranteed to show up  it merely has a very high probability of showing up  whereas builtin significance checks can be made slightly pessimistic, so that actual significance loss will not be greater than indicated. On the other hand, little extra hardware and no extra storage are required for the noisymode approach. Furthermore, significance loss is relatively rare, so that running a problem twice when Significance loss is suspected does not pose a serious problem. What is serious is the possibility of unsuspected significance loss. In discussions of significance two points are often overlooked. The first of these is trivial: the best way of ensuring significant results is to use an adequate number of fraction digits. The second is almost equally mundane: for a given procedure, normalized FLP arithmetic will ordinarily produce the greatest precision possible for the number of fraction digits used. Normalized FLP arithmetic has been criticized with respect to significance loss, because such loss is not indicated by the creation of leading zeros, as it is with fixedpoint arithmetic. In other words, the contention is not that normalized FLP arithmetic is more prone to significance loss than equivalent fixedpoint arithmetic, which would be untrue, but that an equivalent indication of such loss is not provided. Loss of significance, however, is also a serious problem in fixedpoint arithmetic; multiplication and division do not handle it at all correctly by means of leading zeros. (In particular, fixedpoint multiplication may lead to serious or even total significance loss, which would not have occurred with normalized FLP arithmetic: and although leading zeros in addition and subtraction of fixedpoint operands do give correct significance indications, the use of other operations and of builtin scaling loops frequently destroys entirely the leadingzeros method of counting significance.)''Computer architectureForeword v Preface vii 1. Project Stretch 1 [by W. Buchholz] 2. Architectural Philosophy 5 [by F. P. Brooks, Jr.] 2.1. The Two Objectives of Project Stretch 5 2.2. Resources 6 2.3. Guiding Principles 7 2.4. Contemporary Trends in Computer Architecture 10 2.5. Hindsight 15 3. System Summary of IBM 7030 17 [by W. Buchholz] 3.1. System Organization 17 3.2. Memory Units 17 3.3. Index Memory 19 3.4. Special Registers 19 3.5. Input and Output Facilities 19 3.6. Highspeed Disk Units 20 3.7. Central Processing Unit 20 3.8. Instruction Controls 21 3.9. Indexarithmetic Unit 21 3.10. InstrÔuction Lookahead 21 3.11. Arithmetic Unit 22 3.12. Instruction Set 24 3.13. Data Arithmetic 24 3.14. Radixconversion Operations 27 3.15. Connective Operations 27 3.16. Indexarithmetic Operations 27 3.17. Branching Operations 28 3.18. Transmission Operations 28 3.19. InputOutput Operations 29 3.20. New Features 29 3.21. Performance 32 4. Natural Data Units 33 [by G. P. Blaauw, F. P. Brooks, Jr., and W. Buchholz] 4.1. Lengths and Structures of Natural Data Units 33 4.2. Procedures for Specifying Natural Data Units 36 4.3. Data Hierarchies 39 4.4. Classes of Operations 40 5. Choosing a Number Base 42 [by W. Buchholz] 5.1. Introduction 42 5.2. Information Content 45 5.3. Arithmetic Speed 49 5.4. Numerical Data 50 5.5. Nonnumerical Data 51 5.6. Addresses 52 5.7. Transformation 53 5.8. Partitioning of Memory 54 5.9. Program Interpretation 56 5.10. Other Number Bases 58 5.11. Conclusion 58 6. Character Set 60 [by R. W. Bemer and W. Buchholz] 6.1. Introduction 60 6.2. Size of Set 62 6.3. Subsets 62 6.4. Expansion of Set 63 6.5. Code 63 6.6. Parity Bit 66 6.7. Sequence 66 6.8. Blank 67 6.9. Decimal Digits 68 6.10. Typewriter Keyboard 68 6.11. Adjacency 69 6.12. Uniqueness 69 6.13. Signs 70 6.14. Taperecording Convention 71 6.15. Cardpunching Convention 71 6.16. List of 7030 Character Set 72 7. Variablefieldlength Operation 75 [by G. P. Blaauw, F. P. Brooks, Jr., and W. Buchholz] 7.1. Introduction 75 7.2. Addressing of Variablefieldlength Data 76 7.3. Field Length 77 7.4. Byte Size 78 7.5. Universal Accumulator 79 7.6. Accumulator Operand 79 7.7. Binary and Decimal Arithmetic 80 7.8. Integer Arithmetic 81 7.9. Numerical Signs 82 7.10. Indicators 84 7.11. Arithmetical Operations 85 7.12. Radixconversion Operation 87 7.13. Logical Connectives of Two Variables 87 7.14. Connective Operations 89 8. Floatingpoint Operation 92 [by S. G. Campbell] General Discussion 8.1. Problems of Fixedpoint Arithmetic 92 8.2. Floatingpoint Arithmetic 94 8.3. Normalization 97 8.4. Floatingpoint Singularities 98 8.5. Range and Precision 99 8.6. Roundoff Error 100 8.7. Significance Checks 101 8.8. Forms of Floatingpoint Arithmetic 103 8.9. Structure of Floatingpoint Data 104 Floatingpoint Features of the 7030 8.10. Floatingpoint Instruction Format 106 8.11. Floatingpoint Data Formats 106 8.12. Singular Floatingpoint Numbers 108 8.13. Indicators 112 8.14. Universal Accumulator 113 8.15. Fraction Arithmetic 114 8.16. Floatingpointarithmetic Operations 114 8.17. Fixedpoint Arithmetic Using Unnormalized Floatingpoint Operations 118 8.18. Special Functions and Forms of Arithmetic 119 8.19. Multipleprecision Arithmetic 119 8.20. General Remarks 121 9. Instruction Formats 122 [by W. Buchholz] 9.1. Introduction 122 9.2. Earlier Instruction Languages 122 9.3. Evolution of the Singleaddress Instruction 124 9.4. Implied Addresses 125 9.5. Basic 7030 Instruction Formats 126 9.6. Instruction Efficiency 127 9.7. The Simplicity of Complexity 131 9.8. Relationship to Automatic Programming Languages 132 10. Instruction Sequencing 133 [by F. P. Brooks, Jr.] 10.1. Modes of Instruction Sequencing 133 10.2. Instruction Counter 134 10.3. Unconditional Branching 135 10.4. Conditional Branching 136 10.5. Programinterrupt System 136 10.6. Components of the Programinterrupt System 137 10.7. Examples of Programinterrupt Techniques 140 10.8. Execute Instructions 146 10.9. Execute Operations in the 7030 148 11. Indexing 150 [by G. P. Blaauw] 11.1. Introduction 150 11.2. Indexing Functions 151 11.3. Instruction Format for Indexing 155 11.4. Incrementing 157 11.5. Counting 159 11.6. Advancing by One 161 11.7. Progressive Indexing 161 11.8. Data Transmission 162 11.9. Data Ordering 163 11.10. Refilling 165 11.11. Indirect Addressing and Indirect Indexing 167 11.12. Indexing Applications 169 11.13. Recordhandling Applications 172 11.14. File Maintenance 175 11.15. Subroutine Control 177 11.16. Conclusion 178 12. InputOutput Control 179 [by W. Buchholz] 12.1. A Generalized Approach to Connecting InputOutput and External Storage 179 12.2. InputOutput ÕInstructions 180 12.3. Defining the Memory Area 181 12.4. Writing and Reading 182 12.5. Controlling and Locating 183 12.6. An Alternative Approach 184 12.7. Program Interruptions 184 12.8. Buffering 180 12.9. Interface 188 12.10. Operator Control of InputOutput Units 190 13. Multiprogramming 192 [by E. F. Codd, E. S. Lowry, E. McDonough, and C. A. Scalzi] 13.1. Introduction 192 13.2. Multiprogramming Requirements 193 13.3. 7030 Features that Assist Multiprogramming 195 13.4. Programmed Logic 197 13.5. Concluding Remarks 200 13.6. References 201 14. The Central Processing Unit 202 [by E. Bloch] 14.1. Concurrent System Operation 202 14.2. Concurrency within the Central Processing Unit 204 14.3. Data Flow 204 14.4. Arithmetic Unit 208 14.5. Checking 216 14.6. Component Count 216 14.7. Performance 217 14.8. Circuits 218 14.9. Packaging 223 15. The Lookahead Unit 228 [by R. S. Balance, J. Cocke, and H. G. Kolsky] 15.1. General Description 228 15.2. Timingsimulation Program 230 15.3. Description of the Lookahead Unit 238 15.4. Forwarding 240 15.5. Counter Sequences 241 15.6. Recovery after Interrupt 246 15.7. A Lookback at the Lookahead 247 16. The Exchange 248 [by W. Buchholz] 16.1. General Description 248 16.2. Starting a WRITE or READ Operation 250 16.3. Data Transfer during Writing 250 16.4. Data Transfer during Reading 251 16.5. Terminating a WRITE or READ Operation 252 16.6. Multiple Operations 252 16.7. CONTROL and LOCATE Operations 252 16.8. Interrogating the Control Word 253 16.9. Forced Termination 253 17. A Nonarithmetical System Extension 254 [by S. G. Campbell, P.S. Herwitz, and J. H. Pomerene] 17.1. Nonarithmetical Processing 254 17.2. The Setup Mode 258 17.3. Bytesequence Formation 259 17.4. Pattern Selection 260 17.5. Transformation Facilities 261 17.6. Statistical Aids 263 17.7. The BYTEBYBYTE Instruction 263 17.8. Monitoring for Special Conditions 264 17.9. Instruction Set 265 17.10. Collating Operations 266 17.11. Table Lookup Operations 267 17.12. Example 267 Appendix A. Summary Data 273 A.1. List of the Larger IBM Storedprogram Computers 273 A.2. Instruction Formats 275 A.3. List of Registers and Special Addresses 276 A.4. Summary of Operations and Modifiers 277 A.5. Summary of Indicators 287 Appendix B. Programming Examples 292 Notation 292 B.1. Polynomial Evaluation 295 B.2. Cuberoot Extraction 296 B.3. Matrix Multiplication 298 B.4. Conversion of Decimal Numbers to a Floatingpoint Normalized Vector 299 B.5. Editing a Typed Message 301 B.6. Transposition of a Large Bit Matrix 303 Index 305acknhfbWerner BuchholzThis important book is the primary description of the influential IBM 7030 Stretch computer, written by its architects.Planning a computer system: {Project Stretch}
@Book{Buchholz:1962:PCS,
editor = "Werner Buchholz",
title = "Planning a computer system: {Project Stretch}",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
pages = "xvii + 322",
year = "1962",
LCCN = "1876",
bibdate = "Fri Nov 19 10:02:31 MST 2010",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/t/tukeyjohnw.bib;
http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
library.ox.ac.uk:210/ADVANCE",
note = "This important book is the primary description of the
influential IBM 7030 Stretch computer, written by its
architects.",
URL = "http://edthelen.org/comphist/IBM7030PlanningMcJones.pdf",
acknowledgement = acknhfb,
remark = "The text of the book is in the public domain, with the
permission of the author in 2003.
See \cite{MacKenzie:1991:IAL} for a remark about the
noisy mode for floatingpoint arithmetic in the IBM
7030 Stretch. That mode is first mentioned on page 25
of this book, and described in detailÖ on page 102,
which states:
``By definition of ordinary normalized FLP operations,
numbers are frequently extended on the right by
attaching zeros. During addition the ndigit operand
that is not preshifted is extended with n zeros, so as
to provide the extra positions to which the preshifted
operand can be added. Any operand or result that is
shifted left to be normalized requires a corresponding
number of zeros to be shifted in at the right. Both
sets of zeros tend to produce numbers smaller in
absolute value than they would have been if more digits
had been carried. In the noisy mode these numbers are
simply extended with 1 s instead of zeros (1 s in a
binary machine, 9s in a decimal machine). So all
numbers tend to be too large in absolute value. The
true value, if there had been no significance loss,
should lie between these two extremes. Hence, two runs,
one made without and one made with the noisy mode,
should show differences in result that indicate which
digits may have been affected by significance loss.
The principal weakness of the noisymode procedure is
that it requires two runs for the same problem. A much
less important weakness is that the loss of
significance cannot be guaranteed to show up  it
merely has a very high probability of showing up 
whereas builtin significance checks can be made
slightly pessimistic, so that actual significance loss
will not be greater than indicated. On the other hand,
little extra hardware and no extra storage are required
for the noisymode approach. Furthermore, significance
loss is relatively rare, so that running a problem
twice when Significance loss is suspected does not pose
a serious problem. What is serious is the possibility
of unsuspected significance loss.
In discussions of significance two points are often
overlooked. The first of these is trivial: the best way
of ensuring significant results is to use an adequate
number of fraction digits. The second is almost equally
mundane: for a given procedure, normalized FLP
arithmetic will ordinarily produce the greatest
precision possible for the number of fraction digits
used. Normalized FLP arithmetic has been criticized
with respect to significance loss, because such loss is
not indicated by the creation of leading zeros, as it
is with fixedpoint arithmetic. In other words, the
contention is not that normalized FLP arithmetic is
more prone to significance loss than equivalent
fixedpoint arithmetic, which would be untrue, but that
an equivalent indication of such loss is not provided.
Loss of significance, however, is also a serious
problem in fixedpoint arithmetic; multiplication and
division do not handle it at all correctly by means of
leading zeros. (In particular, fixedpoint
multiplication may lead to serious or even total
significance loss, which would not have occurred with
normalized FLP arithmetic: and although leading zeros
in addition and subtraction of fixedpoint operands do
give correct significance indications, the use of other
operations and of builtin scaling loops frequently
dest×roys entirely the leadingzeros method of counting
significance.)''",
subject = "Computer architecture",
tableofcontents = "Foreword v \\
Preface vii \\
1. Project Stretch 1 \\
[by W. Buchholz] \\
2. Architectural Philosophy 5 \\
[by F. P. Brooks, Jr.] \\
2.1. The Two Objectives of Project Stretch 5 \\
2.2. Resources 6 \\
2.3. Guiding Principles 7 \\
2.4. Contemporary Trends in Computer Architecture 10
\\
2.5. Hindsight 15 \\
3. System Summary of IBM 7030 17 \\
[by W. Buchholz] \\
3.1. System Organization 17 \\
3.2. Memory Units 17 \\
3.3. Index Memory 19 \\
3.4. Special Registers 19 \\
3.5. Input and Output Facilities 19 \\
3.6. Highspeed Disk Units 20 \\
3.7. Central Processing Unit 20 \\
3.8. Instruction Controls 21 \\
3.9. Indexarithmetic Unit 21 \\
3.10. Instruction Lookahead 21 \\
3.11. Arithmetic Unit 22 \\
3.12. Instruction Set 24 \\
3.13. Data Arithmetic 24 \\
3.14. Radixconversion Operations 27 \\
3.15. Connective Operations 27 \\
3.16. Indexarithmetic Operations 27 \\
3.17. Branching Operations 28 \\
3.18. Transmission Operations 28 \\
3.19. InputOutput Operations 29 \\
3.20. New Features 29 \\
3.21. Performance 32 \\
4. Natural Data Units 33 \\
[by G. P. Blaauw, F. P. Brooks, Jr., and W. Buchholz]
\\
4.1. Lengths and Structures of Natural Data Units 33
\\
4.2. Procedures for Specifying Natural Data Units 36
\\
4.3. Data Hierarchies 39 \\
4.4. Classes of Operations 40 \\
5. Choosing a Number Base 42 \\
[by W. Buchholz] \\
5.1. Introduction 42 \\
5.2. Information Content 45 \\
5.3. Arithmetic Speed 49 \\
5.4. Numerical Data 50 \\
5.5. Nonnumerical Data 51 \\
5.6. Addresses 52 \\
5.7. Transformation 53 \\
5.8. Partitioning of Memory 54 \\
5.9. Program Interpretation 56 \\
5.10. Other Number Bases 58 \\
5.11. Conclusion 58 \\
6. Character Set 60 \\
[by R. W. Bemer and W. Buchholz] \\
6.1. Introduction 60 \\
6.2. Size of Set 62 \\
6.3. Subsets 62 \\
6.4. Expansion of Set 63 \\
6.5. Code 63 \\
6.6. Parity Bit 66 \\
6.7. Sequence 66 \\
6.8. Blank 67 \\
6.9. Decimal Digits 68 \\
6.10. Typewriter Keyboard 68 \\
6.11. Adjacency 69 \\
6.12. Uniqueness 69 \\
6.13. Signs 70 \\
6.14. Taperecording Convention 71 \\
6.15. Cardpunching Convention 71 \\
6.16. List of 7030 Character Set 72 \\
7. Variablefieldlength Operation 75 \\
[by G. P. Blaauw, F. P. Brooks, Jr., and W. Buchholz]
\\
7.1. Introduction 75 \\
7.2. Addressing of Variablefieldlength Data 76 \\
7.3. Field Length 77 \\
7.4. Byte Size 78 \\
7.5. Universal Accumulator 79 \\
7.6. Accumulator Operand 79 \\
7.7. Binary and Decimal Arithmetic 80 \\
7.8. Integer Arithmetic 81 \\
7.9. Numerical SiØgns 82 \\
7.10. Indicators 84 \\
7.11. Arithmetical Operations 85 \\
7.12. Radixconversion Operation 87 \\
7.13. Logical Connectives of Two Variables 87 \\
7.14. Connective Operations 89 \\
8. Floatingpoint Operation 92 \\
[by S. G. Campbell] \\
General Discussion \\
8.1. Problems of Fixedpoint Arithmetic 92 \\
8.2. Floatingpoint Arithmetic 94 \\
8.3. Normalization 97 \\
8.4. Floatingpoint Singularities 98 \\
8.5. Range and Precision 99 \\
8.6. Roundoff Error 100 \\
8.7. Significance Checks 101 \\
8.8. Forms of Floatingpoint Arithmetic 103 \\
8.9. Structure of Floatingpoint Data 104 \\
Floatingpoint Features of the 7030 \\
8.10. Floatingpoint Instruction Format 106 \\
8.11. Floatingpoint Data Formats 106 \\
8.12. Singular Floatingpoint Numbers 108 \\
8.13. Indicators 112 \\
8.14. Universal Accumulator 113 \\
8.15. Fraction Arithmetic 114 \\
8.16. Floatingpointarithmetic Operations 114 \\
8.17. Fixedpoint Arithmetic Using Unnormalized \\
Floatingpoint Operations 118 \\
8.18. Special Functions and Forms of Arithmetic 119 \\
8.19. Multipleprecision Arithmetic 119 \\
8.20. General Remarks 121 \\
9. Instruction Formats 122 \\
[by W. Buchholz] \\
9.1. Introduction 122 \\
9.2. Earlier Instruction Languages 122 \\
9.3. Evolution of the Singleaddress Instruction 124
\\
9.4. Implied Addresses 125 \\
9.5. Basic 7030 Instruction Formats 126 \\
9.6. Instruction Efficiency 127 \\
9.7. The Simplicity of Complexity 131 \\
9.8. Relationship to Automatic Programming Languages
132 \\
10. Instruction Sequencing 133 \\
[by F. P. Brooks, Jr.] \\
10.1. Modes of Instruction Sequencing 133 \\
10.2. Instruction Counter 134 \\
10.3. Unconditional Branching 135 \\
10.4. Conditional Branching 136 \\
10.5. Programinterrupt System 136 \\
10.6. Components of the Programinterrupt System 137
\\
10.7. Examples of Programinterrupt Techniques 140 \\
10.8. Execute Instructions 146 \\
10.9. Execute Operations in the 7030 148 \\
11. Indexing 150 \\
[by G. P. Blaauw] \\
11.1. Introduction 150 \\
11.2. Indexing Functions 151 \\
11.3. Instruction Format for Indexing 155 \\
11.4. Incrementing 157 \\
11.5. Counting 159 \\
11.6. Advancing by One 161 \\
11.7. Progressive Indexing 161 \\
11.8. Data Transmission 162 \\
11.9. Data Ordering 163 \\
11.10. Refilling 165 \\
11.11. Indirect Addressing and Indirect Indexing 167
\\
11.12. Indexing Applications 169 \\
11.13. Recordhandling Applications 172 \\
11.14. File Maintenance 175 \\
11.15. Subroutine Control 177 \\
11.16. Conclusion 178 \\
12. InputOutput Control 179 \\
[by W. Buchholz] \\
12.1. A Generalized Approach to Connecting \\
InputOutput and External Storage 179 \\
12.2. InputOutput Instructions 180 \\
12.3. Defining the Memory Area 181 \\
12.4. Writing and Reading 182 \\
12.5. Controlling and Locating 183 \\
12.6. An Alternative Approach 184 \\
12.7. Program Interruptions 184 \\
12.8. Buffering 180 \\
12.9. Interface 188 \\
12.10. Operator Control of InputOutput Units 190 \\
13. Multiprogramming 192 \\
[by E. F. Codd, E. S. Lowry, E. McDonough, and C. A.
Scalzi] \\
13.1. Introduction 192 \\
13.2. Multiprogramming Requirements 193 \\
13.3. 7030 Features that Assist Multiprogramming 195
\\
13.4. Programmed Logic 197 \\
13.5. Concluding Remarks 200 \\
13.6. References 201 \\
14. The Central Processing Unit 202 \\
[by E. Bloch] \\
14.1. Concurrent System Operation 202 \\
14.2. Concurrency within the Central Processing Unit
204 \\
14.3. Data Flow 204 \\
14.4. Arithmetic Unit 208 \\
14.5. Checking 216 \\
14.6. Component Count 216 \\
14.7. Performance 217 \\
14.8. Circuits 218 \\
14.9. Packaging 223 \\
15. The Lookahead Unit 228 \\
[by R. S. Balance, J. Cocke, and H. G. Kolsky] \\
15.1. General Description 228 \\
15.2. Timingsimulation Program 230 \\
15.3. Description of the Lookahead Unit 238 \\
15.4. Forwarding 240 \\
15.5. Counter Sequences 241 \\
15.6. Recovery after Interrupt 246 \\
15.7. A Lookback at the Lookahead 247 \\
16. The Exchange 248 \\
[by W. Buchholz] \\
16.1. General Description 248 \\
16.2. Starting a WRITE or READ Operation 250 \\
16.3. Data Transfer during Writing 250 \\
16.4. Data Transfer during Reading 251 \\
16.5. Terminating a WRITE or READ Operation 252 \\
16.6. Multiple Operations 252 \\
16.7. CONTROL and LOCATE Operations 252 \\
16.8. Interrogating the Control Word 253 \\
16.9. Forced Termination 253 \\
17. A Nonarithmetical System Extension 254 \\
[by S. G. Campbell, P.S. Herwitz, and J. H. Pomerene]
\\
17.1. Nonarithmetical Processing 254 \\
17.2. The Setup Mode 258 \\
17.3. Bytesequence Formation 259 \\
17.4. Pattern Selection 260 \\
17.5. Transformation Facilities 261 \\
17.6. Statistical Aids 263 \\
17.7. The BYTEBYBYTE Instruction 263 \\
17.8. Monitoring for Special Conditions 264 \\
17.9. Instruction Set 265 \\
17.10. Collating Operations 266 \\
17.11. Table Lookup Operations 267 \\
17.12. Example 267 \\
Appendix A. Summary Data 273 \\
A.1. List of the Larger IBM Storedprogram Computers
273 \\
A.2. Instruction Formats 275 \\
A.3. List of Registers and Special Addresses 276 \\
A.4. Summary of Operations and Modifiers 277 \\
A.5. Summary of Indicators 287 \\
Appendix B. Programming Examples 292 \\
Notation 292 \\
B.1. Polynomial Evaluation 295 \\
B.2. Cuberoot Extraction 296 \\
B.3. Matrix Multiplication 298 \\
B.4. Conversion of Decimal Numbers to a \\
Floatingpoint Normalized Vector 299 \\
B.5. Editing a Typed Message 301 \\
B.6. Transposition of a Large Bit Matrix 303 \\
Index 305",
}
æßæuNZ !#/#1+Em;‚Yy/#1#techreportfparith.bibDescloux:1962:REFJ. DesclouxRemarks on errors in first order iterative processes with floatingpoint computersUniversity of Illinois Graduate College, Digital Computer LaboratoryUrbana, IL, USA71962Sat Feb 24 15:01:45 MST 1996http://www.math.utah.edu/pub/tex/bib/fparith.bib1996.02.24 15:01:45 MSTReport / University of Illinois, Digital Computer Laboratory; no. 113 Report (University of Illinois (UrbanaChampaign campus). Digital Computer Laboratory); no. 113.Electronic digital computers.; Numerical calculations.Supported by: National Science Foundation under grant G16489. ``March 22, 1962.''acknhfbJ. DesclouxRemarks on errors in first order iterative processes with floatingpoint computers
@TechReport{Descloux:1962:REF,
author = "J. Descloux",
title = "Remarks on errors in first order iterative processes
with floatingpoint computers",
institution = "University of Illinois Graduate College, Digital
Computer Laboratory",
address = "Urbana, IL, USA",
pages = "7",
year = "1962",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
series = "Report / University of Illinois, Digital Computer
Laboratory; no. 113 Report (University of Illinois
(UrbanaChampaign campus). Digital Computer
Laboratory); no. 113.",
acknowledgement = acknhfb,
keywords = "Electronic digital computers.; Numerical
calculations.",
remark = "Supported by: National Science Foundation under grant
G16489. ``March 22, 1962.''",
}ŽMY#+S=;a7E‚y;]S=S
articlefparith.bibCantor:1962:LEFD. Cantor and G. Estrin and R. TurnLogarithmic and Exponential Function Evaluation in a Variable Structure Digital ComputerjIRETRANSELECCOMPUTEC112155164apr41962IRELAOhttp://dx.doi.org/10.1109/TEC.1962.521934803679950 OR 03679950Thu Jul 14 09:11:49 MDT 2011ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 09:11:49 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219348IRE Transactions on Electronic ComputersacknjD. Cantor and G. Estrin and R. TurnLogarithmic and Exponential Function Evaluation in a Variable Structure Digital Computer
@Article{Cantor:1962:LEF,
author = "D. Cantor and G. Estrin and R. Turn",
title = "Logarithmic and Exponential Function Evaluation in a
Variable Structure Digital Computer",
journal = jIRETRANSELECCOMPUT,
volume = "EC11",
number = "2",
pages = "155164",
month = apr,
year = "1962",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1962.5219348",
ISSN = "03679950",
bibdate = "Thu Jul 14 09:11:49 MDT 2011",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219348",
acknowledgement = acknj # "\slash " # acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
‹sOW#/Ee;a7E‚;]Ee%articlefparith.bibFischler:1962:TRAM. A. Fischler and E. A. PoeThreshold Realization of Arithmetic CircuitsjIRETRANSELECCOMPUTEC112287288apr41962IRELAOhttp://dx.doi.org/10.1109/TEC.1962.521936603679950 OR 03679950Thu Jul 14 09:11:50 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 09:11:50 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219366IRE Transactions on Electronic ComputersacknhfbM. A. Fischler and E. A. PoeThreshold Realization of Arithmetic Circuits
@Article{Fischler:1962:TRA,
author = "M. A. Fischler and E. A. Poe",
title = "Threshold Realization of Arithmetic Circuits",
journal = jIRETRANSELECCOMPUT,
volume = "EC11",
number = "2",
pages = "287288",
month = apr,
year = "1962",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1962.5219366",
ISSN = "03679950",
bibdate = "Thu Jul 14 09:11:50 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219366",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}6",
bibdate = "Fri Dec 8 08:24:14 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Algorithmic languages, such as ALGOL, make provision
for two types of numbers, real and integer, which are
usually implemented on the computer by means of
floatingpoint and fixedpoint numbers respectively.
The concepts real and integer, however, are taken from
mathematics, where the set of integers forms a proper
subset of the set of real numbers. In implementation a
real problem is posed by the fact that the set of
fixedpoint numbers is not a proper subset of the set
of floatingpoint numbers; this problem becomes very
apparent in attempts to implement ALGOL 60.
Furthermore, the {\em one\/} mathematical operation of
addition is implemented in the machine by one of {\em
two\/} machine operations, fixedpoint addition or
floatingpoint addition.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
reviewer = "R. L. Ashenhurst",
}Ð
¤¤žXPZ #'!%57;m;‹c?c‹w!%œarticlefparith.bibGrau:1962:FNRA. A. GrauOn a floatingpoint number representation for use with algorithmic languagesjCACM53160161mar31962CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 0001078268.0026\#4506Fri Dec 8 08:24:14 1995http://www.math.utah.edu/pub/tex/bib/fparith.bib1995.12.08 08:24:14 ???Algorithmic languages, such as ALGOL, make provision for two types of numbers, real and integer, which are usually implemented on the computer by means of floatingpoint and fixedpoint numbers respectively. The concepts real and integer, however, are taken from mathematics, where the set of integers forms a proper subset of the set of real numbers. In implementation a real problem is posed by the fact that the set of fixedpoint numbers is not a proper subset of the set of floatingpoint numbers; this problem becomes very apparent in attempts to implement ALGOL 60. Furthermore, the em one mathematical operation of addition is implemented in the machine by one of em two machine operations, fixedpoint addition or floatingpoint addition.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79R. L. AshenhurstAlgorithmic languages, such as ALGOL, make provision for two types of numbers, real and integer, which are usually implemented on the computer by means of floatingpoint and fixedpoint numbers respectively. The concepts real and integer, however, are taken from mathematics, where the set of integers forms a proper subset of the set of real numbers. In implementation a real problem is posed by the fact that the set of fixedpoint numbers is not a proper subset of the set of floatingpoint numbers; this problem becomes very apparent in attempts to implement ALGOL 60. Furthermore, the {\em one\/} mathematical operation of addition is implemented in the machine by one of {\em two\/} machine operations, fixedpoint addition or floatingpoint addition.A. A. GrauOn a floatingpoint number representation for use with algorithmic languages
@Article{Grau:1962:FNR,
author = "A. A. Grau",
title = "On a floatingpoint number representation for use with
algorithmic languages",
journal = jCACM,
volume = "5",
number = "3",
pages = "160161",
month = mar,
year = "1962",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "68.00",
MRnumber = "26\#4506",
bibdate = "Fri Dec 8 08:24:14 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Algorithmic languages, such as ALGOL, make provision
for two types of numbers, real and integer, which are
usually implemented on the computer by means of
floatingpoint and fixedpoint numbers respectively.
The concepts real and integer, however, are taken from
mathematics, where the set of integers forms a proper
subset of the set of real numbers. In implementation a
real problem is posed by the fact that the set of
fixedpoint numbers is not a proper subset of the set
of floatingpoint numbers; this problem becomes very
apparent in attempts to implement ALGOL 60.
Furthermore, the {\em one\/} mathematical operation of
addition is implemented in the machine by one of {\em
two\/} machine operations, fixedpoint addition or
floatingpoint addition.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
reviewer = "R. L. Ashenhurst",
}
ª §ª‰yRV #Ii+3!E%;uMmIiŠibookfparith.bibHamming:1962:NMSR. W. (Richard Wesley) HammingNumerical methods for scientists and engineerspubMCGRAWHILLpubMCGRAWHILL:adr4111962QA297 .H28Fri Aug 20 09:12:08 MDT 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib; z3950.loc.gov:7090/Voyager2010.08.20 09:12:08 MDTInternational series in pure and applied mathematicsCited in cite Sterbenz:1974:FPC.Numerical analysis; Electronic digital computersacknhfbR. W. (Richard Wesley) HammingNumerical methods for scientists and engineers
@Book{Hamming:1962:NMS,
author = "R. W. (Richard Wesley) Hamming",
title = "Numerical methods for scientists and engineers",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
pages = "411",
year = "1962",
LCCN = "QA297 .H28",
bibdate = "Fri Aug 20 09:12:08 MDT 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
z3950.loc.gov:7090/Voyager",
series = "International series in pure and applied mathematics",
acknowledgement = acknhfb,
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
subject = "Numerical analysis; Electronic digital computers",
}ŒUQY #+5;a7E‚;]5{
articlefparith.bibGuffin:1962:CSLRonald M. GuffinA Computer for Solving Linear Simultaneous Equations Using the Residue Number SystemjIRETRANSELECCOMPUTEC112164173apr41962IRELAOhttp://dx.doi.org/10.1109/TEC.1962.521934903679950 OR 03679950Thu Jul 14 09:11:49 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 09:11:49 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219349IRE Transactions on Electronic ComputersacknhfbRonald M. GuffinA Computer for Solving Linear Simultaneous Equations Using the Residue Number System
@Article{Guffin:1962:CSL,
author = "Ronald M. Guffin",
title = "A Computer for Solving Linear Simultaneous Equations
Using the Residue Number System",
journal = jIRETRANSELECCOMPUT,
volume = "EC11",
number = "2",
pages = "164173",
month = apr,
year = "1962",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1962.5219349",
ISSN = "03679950",
bibdate = "Thu Jul 14 09:11:49 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219349",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
ª
¡ª‡sTU#1?m7=m;A?mˆcarticlefparith.bibKaratsuba:1962:MMNA. Karatsuba and Y. OfmanMultiplication of multidigit numbers on automatajDOKLAKADNAUK1452932941962DANKAS00023264 OR 00023264Tue Jul 05 10:35:11 2005http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.07.05 10:35:11 ???Doklady Akademii nauk SSSRacknhfbA. Karatsuba and Y. OfmanMultiplication of multidigit numbers on automata
@Article{Karatsuba:1962:MMN,
author = "A. Karatsuba and Y. Ofman",
title = "Multiplication of multidigit numbers on automata",
journal = jDOKLAKADNAUK,
volume = "145",
number = "??",
pages = "293294",
month = "????",
year = "1962",
CODEN = "DANKAS",
ISSN = "00023264",
bibdate = "Tue Jul 05 10:35:11 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Doklady Akademii nauk SSSR",
}Š[SV#)Ec7=m;OO‚Eg‹{articlefparith.bibJones:1962:FPFF. B. Jones and A. W. WymoreFloating Point Feature on the IBM Type 1620jIBMTDB05624346may51962IBMTAA00188689 OR 00188689Fri Nov 28 11:26:02 2003http://www.math.utah.edu/pub/tex/bib/fparith.bib2003.11.28 11:26:02 ???IBM Technical Disclosure Bulletindecimal floatingpoint arithmeticThe IBM 1620 normalized variableprecision arithmetic provides up to 100 decimal digits with an exponent range of $ pm 99 $.acknhfbF. B. Jones and A. W. WymoreFloating Point Feature on the {IBM Type 1620}
@Article{Jones:1962:FPF,
author = "F. B. Jones and A. W. Wymore",
title = "Floating Point Feature on the {IBM Type 1620}",
journal = jIBMTDB,
volume = "0562",
pages = "4346",
month = may,
year = "1962",
CODEN = "IBMTAA",
ISSN = "00188689",
bibdate = "Fri Nov 28 11:26:02 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "IBM Technical Disclosure Bulletin",
keywords = "decimal floatingpoint arithmetic",
remark = "The IBM 1620 normalized variableprecision arithmetic
provides up to 100 decimal digits with an exponent
range of $ \pm 99 $.",
}
_UW#'g;a75%E‚;]gCarticlefparith.bibKeir:1962:DODY. A. Keir and P. W. Cheney and M. TannenbaumDivision and overflow detection in residue number systemsjIRETRANSELECCOMPUTEC114501507aug81962IRELAOhttp://dx.doi.org/10.1109/TEC.1962.521938903679950 OR 0367995068.00MR0150990 (27 \#976)N. H. ChoksyThu Jul 14 09:11:51 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 09:11:51 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219389IRE Transactions on Electronic ComputersacknhfbY. A. Keir and P. W. Cheney and M. TannenbaumDivision and overflow detection in residue number systems
@Article{Keir:1962:DOD,
author = "Y. A. Keir and P. W. Cheney and M. Tannenbaum",
title = "Division and overflow detection in residue number
systems",
journal = jIRETRANSELECCOMPUT,
volume = "EC11",
number = "4",
pages = "501507",
month = aug,
year = "1962",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1962.5219389",
ISSN = "03679950",
MRclass = "68.00",
MRnumber = "MR0150990 (27 \#976)",
MRreviewer = "N. H. Choksy",
bibdate = "Thu Jul 14 09:11:51 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219389",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}umber = "27 #970",
bibdate = "Thu Dec 08 11:11:03 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
MathSciNet database",
note = "See letter \cite{Knuth:1963:LEE}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
remark = "The author that Motzkin (1962) showed that Horner's
rule for polynomial evaluation may not be optimal, and
develops the idea further for arbitrary polynomials,
but also observes that the coefficients of the revised
polynomials may be difficult to find. He also asks
about, but does not answer, the question of error
analysis of the various methods.",
}Ö
fˆ"³ˆwÄÕf‡vm
@Article{Krishnamˆ
@Article{Kornerup:1977:UNR,
author wŸo
@Article{Koren:2000:GEI,
author = "Israel Koren and Peter Kornerup",
title = "{Guest Editors}' Introduction: Special Issue on
Computer Arithmetic",
journal = jIEEETRANSCOMPUT,
volume = "49",
number = "7",
pages = "625627",
month = jul,
year = "2000",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2000.863030",
ISSN = "00189340 (print), 15579956 (electroŠ•
@Article{Korn:1982:EDF,
author = "G. A. Korn",
title = "{EARLY DESIRE}: a floatingpoint equation language
simulation system for minicomputers and
microcomputers",
journal = jSIMULATION,
volume = "38",
number = "5",
pages = "151159",
month = may,
year = "1982",
CODEN = "SIMUA2",
ISSN = "00375497 (print), 17413133 (electronic)",
ISSNL = "00375497"Rou
@Article{Kornerup:1990:ARB,
author = "Peter Kornerup and David W. Matula",
title = "An ŒO™
@Article{Kornerup:1983:FPR,
author = "Peter Kornerup and David W. Matula",
title = "Finite precision rational arithmetic: An arithmetic
unit",
journal = jIEEETRANSCOMPUT,
volume = "C32",
number = "4",
pages = "378388",
month = apr,
year = "1983",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1983.1676239",
ISSN = "00189340 (print), 15579956 (electroniÈˆ
@Article{Kornerup:1977:UNR,
author = "P. Kornerup and B. D. Shriver",
title = "A Unified Numeric Representation Arithmetic Unit and
Its Language Support",
journal = jIEEETRANSCOMPUT,
volume = "C26",
number = "7",
pages = "651659",
month = jul,
year = "1977",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1977.1674898",
ISSN = "00189340 (print), 1557995+†m[
@Article{Koren:1990:EEF,
author = "I. Koren and O. Zinaty",
title = "Evaluating Elementary Functions in a Numerical
Coprocessor Based on Rational Approximations",
journal = jIEEETRANSCOMPUT,
volume = "C39",
number = "8",
pages = "10301037",
month = aug,
year = "1990",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.57042",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Thu Sep 1 10:15:30 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
} N‰“
@Article{Koren:1981:CPN,
author = "I. Koren and Y. Maliniak",
title = "On Classes of Positive, Negative, and Imaginary Radix
Number Systems",
journal = jIEEETRANSCOMPUT,
volume = "30",
number = "5",
pages = "212317",
month = may,
year = "1981",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1981.1675788",
ISSN = "00189340 (print), 15579956 (electronic)"ÓŠ4”i
@Article{Korn:1984:ISD,
author = "G. A. Korn",
title = "Interactive simulation with a directexecuting,
floatingpoint equation language",
journal = jSYSANAMODELSIM,
volume = "1",
number = "1",
pages = "4554",
year = "1984",
CODEN = "SAMSEC",
ISSN = "02329298",
ISSNL = "02329298",
bibdate = "Sat Nov 9 08:26:18 MST 2002",
bibsource = "ACM Computing Archive CDZ
ÔÔ–(VX #)+W]57'=„K;K?…Ec+OW™%articlefparith.bibKnuth:1962:EPCDonald E. KnuthEvaluation of polynomials by computerjCACM512595599dec121962CACMA2http://doi.acm.org/10.1145/355580.36907400010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 0001078268.00 (12.00)27 #970Thu Dec 08 11:11:03 2005http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib; MathSciNet database2005.12.08 11:11:03 ???See letter cite Knuth:1963:LEE.Communications of the ACMThe author that Motzkin (1962) showed that Horner's rule for polynomial evaluation may not be optimal, and develops the idea further for arbitrary polynomials, but also observes that the coefficients of the revised polynomials may be difficult to find. He also asks about, but does not answer, the question of error analysis of the various methods.acknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Donald E. KnuthSee letter \cite{Knuth:1963:LEE}.Evaluation of polynomials by computer
@Article{Knuth:1962:EPC,
author = "Donald E. Knuth",
title = "Evaluation of polynomials by computer",
journal = jCACM,
volume = "5",
number = "12",
pages = "595599",
month = dec,
year = "1962",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/355580.369074",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "68.00 (12.00)",
MRnumber = "27 #970",
bibdate = "Thu Dec 08 11:11:03 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
MathSciNet database",
note = "See letter \cite{Knuth:1963:LEE}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
remark = "The author that Motzkin (1962) showed that Horner's
rule for polynomial evaluation may not be optimal, and
develops the idea further for arbitrary polynomials,
but also observes that the coefficients of the revised
polynomials may be difficult to find. He also asks
about, but does not answer, the question of error
analysis of the various methods.",
}
`
š…`Š!YX #1+A;7=a;]+I‹ articlefparith.bibMacSorley:1962:RBAO. L. MacSorleyReview: booktitle An Algorithm for Rapid Binary Division, by J. B. Wilson and R. S. LedleyjIRETRANSELECCOMPUTEC113420420jun61962IRELAO03679950 OR 03679950Sat Jul 16 20:52:08 2011http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.16 20:52:08 ???IRE Transactions on Electronic ComputersacknhfbO. L. MacSorleyReview: \booktitle{An Algorithm for Rapid Binary Division}, by {J. B. Wilson and R. S. Ledley}
@Article{MacSorley:1962:RBA,
author = "O. L. MacSorley",
title = "Review: \booktitle{An Algorithm for Rapid Binary
Division}, by {J. B. Wilson and R. S. Ledley}",
journal = jIRETRANSELECCOMPUT,
volume = "EC11",
number = "3",
pages = "420420",
month = jun,
year = "1962",
CODEN = "IRELAO",
ISSN = "03679950",
bibdate = "Sat Jul 16 20:52:08 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}ŠXV #)#o57=m;?Oc#o‹/articlefparith.bibLynch:1962:WBDW. C. LynchOn a WiredIn BinarytoDecimal Conversion SchemejCACM53159159mar31962CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Fri Nov 28 18:21:41 2003http://www.math.utah.edu/pub/tex/bib/fparith.bib2003.11.28 18:21:41 ???Communications of the ACMdecimal floatingpoint arithmeticackmfchttp://portal.acm.org/browse_dl.cfm?idx=J79W. C. LynchOn a WiredIn BinarytoDecimal Conversion Scheme
@Article{Lynch:1962:WBD,
author = "W. C. Lynch",
title = "On a WiredIn BinarytoDecimal Conversion Scheme",
journal = jCACM,
volume = "5",
number = "3",
pages = "159159",
month = mar,
year = "1962",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 28 18:21:41 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ackmfc # " and " # acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "decimal floatingpoint arithmetic",
}ŠbWX #'!57=m;?Oc!‹yarticlefparith.bibLake:1962:LEHG. T. LakeLetter to the Editor: Hardware Conversion of Decimal and Binary NumbersjCACM59468469sep91962CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Fri Nov 28 18:16:30 2003http://www.math.utah.edu/pub/tex/bib/fparith.bib2003.11.28 18:16:30 ???Communications of the ACMdecimal floatingpoint arithmeticackmfchttp://portal.acm.org/browse_dl.cfm?idx=J79G. T. LakeLetter to the Editor: Hardware Conversion of Decimal and Binary Numbers
@Article{Lake:1962:LEH,
author = "G. T. Lake",
title = "Letter to the Editor: Hardware Conversion of Decimal
and Binary Numbers",
journal = jCACM,
volume = "5",
number = "9",
pages = "468469",
month = sep,
year = "1962",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 28 18:16:30 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ackmfc # " and " # acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "decimal floatingpoint arithmetic",
}
`,,xVg
E†2Œe
@Article{Li:2009:FAT,
author = "Xin Li and Marc Moreno Maza and {\'E}ric Schost",
title = "Fast arithmetic for triangular sets: From theory to
practice",
journal = jJSYMBOLICCOMP,
volume = "44",
number = "7",
pages = "891907",
month = jul,
year = "2009",
CODEN = "JSYCEH",
ISSN = "07477171 (print), 1095855X (electronic)",
ISSNL = "07477171",
bibdate = "Wed Aug 25 20:13:19 MDT 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.sciencedirect.com/science/journal/07477171",
acknowledgement = acknhfb,
fjournal = "Journal of Symbolic Computation",
journalURL = "http://www.sciencedirect.com/science/journal/07477171",
}"
@Article{Li:2008:MLB,
author = "Xin Li and Marc Moreno Maza and Raqeeb Rasheed and
{\'E}ric Schost",
title = "The {\tt modpn} library: bringing fast polynomial
arithmetic into {MAPLE}",
journal = jACMCOMMCOMPALG‡m[
@Article{Li:2012:ENE,
author = "Wenbin Li and Sven Simon and Steffen Kie{\ss}",
title = "On the estimation of numerical error bounds in linear
algebra based on discrete stochastic arithmetic",
journal = jAPPLNUMMATH,
volume = "62",
number = "5",
pages = "536555",
month = may,
year = "2012",
CODEN = "ANMAEL",
DOI = "http://dx.doi.org/10.1016/j.apnum.2012.01.001",
ISSN = ›ŠW•/
@Article{Liew:2006:SRR,
author = "T. H. Liew and LieLiang Yang and L. Hanzo",
title = "Systematic redundant residue number system codes:
analytical upper bound and iterative decoding
performance over {AWGN} and {Rayleigh} channels",
journal = jIEEETRANSCOMM,
volume = "54",
number = "6",
pages = "10061016",
month = jun,
year = "2006",
CODEN = "IECMBT",
DOI = ±ˆ;
@Article{Liedel:2012:SDC,
author = "Manuel Liedel",
title = "Secure Distributed Computation of the Square Root and
Applications",
journal = jLECTNOTESCOMPSCI,
volume = "7232",
pages = "277288",
year = "2012",
CODEN = "LNCSD9",
DOI = "http://dx.doi.org/10.1007/9783642291012_19",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = œ‡J
@Article{Ligomenides:1977:SSF,
author = "P. A. Ligomenides",
title = "The SkipandSet FastDivision Algorithm",
journal = jIEEETRANSCOMPUT,
volume = "C26",
number = "10",
pages = "10301032",
month = oct,
year = "1977",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1977.1674740",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Wed Jul 13 10:17:27 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1674740",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}¶ˆo‘_
@Article{Lien:1987:RCI,
author = "B. Lien and G. Tang",
title = "Reversed {Chebyshev} implementation of {McClellan}
transform and its roundoff error",
journal = jIEEETRANSACOUSTSPEECH,
volume = "35",
number = "10",
pages = "14351439",
month = oct,
year = "1987",
CODEN = "IETABA",
ISSN = "00963518",
bibdate = "Sat Jul 16 11:25:06 MDT 2005",
bibsource = "http:/ "
uŠm[X #'s57;K;['s‹karticlefparith.bibMeggitt:1962:PDPJ. E. MeggittPseudo Division and Pseudo Multiplication ProcessesjIBMJRD62210226apr41962IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Thu Sep 1 10:15:31 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:15:31 ???IBM Journal of Research and Developmentacknjhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520J. E. MeggittPseudo Division and Pseudo Multiplication Processes
@Article{Meggitt:1962:PDP,
author = "J. E. Meggitt",
title = "Pseudo Division and Pseudo Multiplication Processes",
journal = jIBMJRD,
volume = "6",
number = "2",
pages = "210226",
month = apr,
year = "1962",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Thu Sep 1 10:15:31 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}‹ZW #'#;'O57E‚#;#C#;Œgarticlefparith.bibMcGee:1962:BMW. C. McGeeA Binary MultiplicationjSIAMREVIEW432562561962SIREADhttp://dx.doi.org/10.1137/100406600361445 (print), 10957200 (electronic) OR 00361445 (print), 10957200 (electronic)00361445 OR 00361445Thu Mar 27 09:04:54 MDT 2014http://epubs.siam.org/toc/siread/4/3; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/siamreview.bib2014.03.27 09:04:54 MDTSIAM Reviewacknhfbhttp://epubs.siam.org/sirevJuly 1962W. C. McGeeA Binary Multiplication
@Article{McGee:1962:BM,
author = "W. C. McGee",
title = "A Binary Multiplication",
journal = jSIAMREVIEW,
volume = "4",
number = "3",
pages = "256256",
month = "????",
year = "1962",
CODEN = "SIREAD",
DOI = "http://dx.doi.org/10.1137/1004066",
ISSN = "00361445 (print), 10957200 (electronic)",
ISSNL = "00361445",
bibdate = "Thu Mar 27 09:04:54 MDT 2014",
bibsource = "http://epubs.siam.org/toc/siread/4/3;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/siamreview.bib",
acknowledgement = acknhfb,
fjournal = "SIAM Review",
journalURL = "http://epubs.siam.org/sirev",
onlinedate = "July 1962",
}
Rrr›i
…u‹k
@Article{Meggitt:1962:PDP,
author = "J. E. Meggitt",
title = "Pseudo Division and Pseudo Multiplication Processes",
journal = jIBMJRD,
volume = "6",
number = "2",
pages = "210226",
month = apr,
year = "1962",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Thu Sep 1 10:15:31 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}Û†0Œa
@Article{Meissner:1995:EAD,
author = "Loren P. Meissner",
title = "From the {Editor}: Allocatable Dummy Argument Arrays;
How Should {Fortran Standards} Describe Arithmetic? Are
External Procedures Obsolete?; When are Local Variables
Initialized in {F77} and {F90}?",
journal = jFORTRANFORUM,
volume = "14",
number = "3",
pages = "13",
month = sep,
year = "1995",
CODEN = "????",
ISSN = "10617264 (print), 19311311 (electronic)",
ISSNL = "10617264",
bibdate = "Thu Feb 07 06:54:12 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "ACM Fortran Forum",
issue = "43",
}¹‡5Žk
@Article{Meier:1993:EMC,
author = "Willi Meier and Othmar Staffelbach",
title = "Efficient Multiplication on Certain Nonsupersingular
Elliptic Curves",
journal = jLECTNOTESCOMPSCI,
volume = "740",
pages = "333344",
year = "1993",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Tue Feb 5 11:48:51 MST 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t0740.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/0740/07400333.htm;
http://link.springerny.com/link/service/series/0558/papers/0740/07400333.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
keywords = "CRYPTO; cryptology",
}w/{
@Article{Menzel:1967:AUA,
author = ‡Ž
@Article{Meloni:2015:EDB,
author = "N. Meloni and M. A. Hasan",
title = "Efficient Double Bases for Scalar Multiplication",
journal = jIEEETRANSCOMPUT,
volume = "64",
number = "8",
pages = "22042212",
month = aug,
year = "2015",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2014.2360539",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Tue Aug 11 08:24:23 MDT 2015",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "doublebase number system; elliptic curve",
}øŠV•
@Article{Meinardus:1980:OPN,
author = "G{\"u}nter Meinardus and G. D. Taylor",
title = "Optimal Partitioning of {Newton}'s Method for
Calculating Roots",
journal = jMATHCOMPUT,
volume = "35",
number = "152",
pages = "12211230",
month = oct,
year = "1980",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
MRclass = "65^V{çV ¦³6Ì…Z‹5
@Article{Kanner:1965:NBC,
author = "Herbert Kanner",
title = "Number Base Conversion in Significant Digit
Arithmetic",
journal = jJACM,
volume = "12",
number = "2",
pages = "242246",
month = apr,
year = "1965",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Thu Nov 03 08:47:50 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
},F„w‰o
@Article{Kawabata:1984:SFP,
author = "Hugh M. Kawabata",
title = "{Savage} Floating Point Benchmark in {Fortran} in
{16BST}",
journal = jDDJ,
volume = "9",
number = "1",
pages = "83??",
month = jan,
year = "1984",
CODEN = "DDJOEB",
ISSN = "1044789X",
bibdate = "Mon Sep 2 09:09:39 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}H›]›;
@Article{Karp:1997:HPD,
author = "Alan H. Karp and Peter Markstein",
title = "HighPrecision Division and Square Root",
journal = jTOMS,
volume = "23",
number = "4",
pages = "561589",
month = dec,
year = "1997",
CODEN = "ACMSCU",
DOI = "http://doi.acm.org/10.1145/279232.279237",
ISSN = "00983500 (print), 15577295 (electronic)",
ISSNL = "00983500",
bibdate = "ThuW
œ†;Œw
@Article{Kapur:2000:UIP,
author = "Deepak Kapur and Mahadevan Subramaniam",
title = "Using an induction prover for verifying arithmetic
circuits",
journal = jINTJSOFTWTOOLSTECHNOLTRANSFER,
volume = "3",
number = "1",
pages = "3265",
month = sep,
year = "2000",
CODEN = "????",
ISSN = "14332779 (print), 14332787 (electronic)",
ISSNL = "14332779",
bibdate = "Tue Nov 23 15:01:40 MST 2004",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=14332779;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "International Journal on Software Tools for Technology
Transfer: STTT",
}rô†Œ'
@Article{Kan:1973:CEA,
author = "E. Kan and J. Aggarwal",
title = "Correction to {``Error Analysis of Digital Filters
Employing FloatingPoint Arithmetic''}",
journal = jIEEETRANSCIRCUITSSYST,
volume = "20",
number = "5",
pages = "617618",
month = sep,
year = "1973",
CODEN = "ICSYBT",
ISSN = "00984094 (print), 15581276 (electronic)",
ISSNL = "00984094",
bibdate = "Sat Jul 16 08:40:53 MDT 2005",
bibsource = "http://ieeexplore.ieee.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Kan:1971:EAD}.",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Circuits and Systems",
}š
Ï äÏŒ]Y #/;a7E‚;]Oarticlefparith.bibMitchell:1962:CMDJohn N. MitchellComputer Multiplication and Division Using Binary LogarithmsjIRETRANSELECCOMPUTEC114512517aug81962IRELAOhttp://dx.doi.org/10.1109/TEC.1962.521939103679950 OR 03679950Thu Jul 14 09:11:51 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 09:11:51 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219391IRE Transactions on Electronic ComputersacknhfbJohn N. MitchellComputer Multiplication and Division Using Binary Logarithms
@Article{Mitchell:1962:CMD,
author = "John N. Mitchell",
title = "Computer Multiplication and Division Using Binary
Logarithms",
journal = jIRETRANSELECCOMPUT,
volume = "EC11",
number = "4",
pages = "512517",
month = aug,
year = "1962",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1962.5219391",
ISSN = "03679950",
bibdate = "Thu Jul 14 09:11:51 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219391",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}Œ\Y #)%;a7E‚;]%Qarticlefparith.bibMetze:1962:CBDGernot MetzeA Class of Binary Divisions Yielding Minimally Represented QuotientsjIRETRANSELECCOMPUTEC116761764dec121962IRELAOhttp://dx.doi.org/10.1109/TEC.1962.521946003679950 OR 03679950Thu Jul 14 09:11:53 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 09:11:53 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219460IRE Transactions on Electronic ComputersacknhfbGernot MetzeA Class of Binary Divisions Yielding Minimally Represented Quotients
@Article{Metze:1962:CBD,
author = "Gernot Metze",
title = "A Class of Binary Divisions Yielding Minimally
Represented Quotients",
journal = jIRETRANSELECCOMPUT,
volume = "EC11",
number = "6",
pages = "761764",
month = dec,
year = "1962",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1962.5219460",
ISSN = "03679950",
bibdate = "Thu Jul 14 09:11:53 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219460",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
wû
ˆ*Rû.‡Ž)
@Article{Spira:1973:CTA,
author = "Philip M. Spira",
title = "Computation Times†Œ[
@Article{Spielberg:1962:PCF,
author = "Kurt Spielberg",
title = "Polynomial and ContinuedFraction Approximations for
Logarithmic Functions",
journal = jMATHCOMPUT,
volume = "16",
number = "78",
pages = "205217",
month = apr,
year = "1962",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Tue Oct 13 08:06:19 MDT 1998",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR
database",
acknowledgement = acknj # " and " # acknhfb,
fjournal = "Mathematics of Computation",
journalURL = "http://www.ams.org/mcom/",
}á†&ŒM
@Article{Spielberg:1961:ECF,
author = "Kurt Spielberg",
title = "Efficient Continued Fraction Approximations To
Elementary Functions",
journal = jMATHCOMPUT,
volume = "15",
number = "76",
pages = "409417",
month = oct,
year = "1961",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Tue Oct 13 08:06:19 MDT 1998",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR
database",
acknowledgement = acknj # " and " # acknhfb,
fjournal = "Mathematics of Computation",
journalURL = "http://www.ams.org/mcom/",
}Ä†#ŒG
@Article{Spielberg:1961:RPS,
author = "K. Spielberg",
title = "Representation of Power Series in Terms of
Polynomials, Rational Approximations and Continued
Fractions",
journal = jJACM,
volume = "8",
number = "4",
pages = "613627",
month = oct,
year = "1961",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Sat Dec 09 14:01:44 1995",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Journal of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}Å·1
@Article{Spielberg:1966:CEU,
author = "K. Spielberg",
title = "Computation of $ e^x $ with the use of large tables",
journal = jIBMSYSJ,
volume = „X‰1
@Article{Spielberg:1966:CEU,
author = "K. Spielberg",
title = "Computation of $ e^x $ with the use of large tables",
journal = jIBMSYSJ,
volume = "5",
number = "2",
pages = "102114",
year = "1966",
CODEN = "IBMSA7",
ISSN = "00188670",
bibdate = "Thu Sep 15 18:43:03 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IBM Systems Journal",
xxmonth = "(none)",
}f„v‰m
@Article{Speiser:1983:SFP,
author = "Jeffrey Speiser",
title = "{Savage} Floating Point Benchmark in {PASCAL} in
{16BST}",
journal = jDDJ,
volume = "8",
number = "11",
pages = "112??",
month = nov,
year = "1983",
CODEN = "DDJOEB",
ISSN = "1044789X",
bibdate = "Mon Sep 2 09:09:39 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
é öéŠ _W#)W_'57E
;A=[aŠyarticlefparith.bibShanks:1962:CDDaniel Shanks and John W. Wrench, Jr.Calculation of $ pi $ to 100,000 DecimalsjMATHCOMPUT16777699jan11962MCMPAF00255718 (print), 10886842 (electronic) OR 00255718 (print), 10886842 (electronic)00255718 OR 00255718Tue Oct 13 08:06:19 MDT 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.13 08:06:19 MDTMathematics of Computationacknhfbhttp://www.ams.org/mcom/Daniel Shanks and John W. {Wrench, Jr.}Calculation of $ \pi $ to 100,000 Decimals
@Article{Shanks:1962:CD,
author = "Daniel Shanks and John W. {Wrench, Jr.}",
title = "Calculation of $ \pi $ to 100,000 Decimals",
journal = jMATHCOMPUT,
volume = "16",
number = "77",
pages = "7699",
month = jan,
year = "1962",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Tue Oct 13 08:06:19 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "Mathematics of Computation",
journalURL = "http://www.ams.org/mcom/",
}Œ^W #+/;a7E‚;]/Garticlefparith.bibRozier:1962:DBCCharles P. RozierDecimaltoBinary Conversion Using Octal Radix ArithmeticjIRETRANSELECCOMPUTEC115708709oct101962IRELAOhttp://dx.doi.org/10.1109/TEC.1962.521943603679950 OR 03679950Thu Jul 14 09:11:52 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 09:11:52 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219436IRE Transactions on Electronic ComputersacknhfbCharles P. RozierDecimaltoBinary Conversion Using Octal Radix Arithmetic
@Article{Rozier:1962:DBC,
author = "Charles P. Rozier",
title = "DecimaltoBinary Conversion Using Octal Radix
Arithmetic",
journal = jIRETRANSELECCOMPUT,
volume = "EC11",
number = "5",
pages = "708709",
month = oct,
year = "1962",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1962.5219436",
ISSN = "03679950",
bibdate = "Thu Jul 14 09:11:52 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219436",
acknowledgement = acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
}
\
\‹?aY #1)!'57Ek;A=)!Œ[
articlefparith.bibSpielberg:1962:PCFKurt SpielbergPolynomial and ContinuedFraction Approximations for Logarithmic FunctionsjMATHCOMPUT1678205217apr41962MCMPAF00255718 (print), 10886842 (electronic) OR 00255718 (print), 10886842 (electronic)00255718 OR 00255718Tue Oct 13 08:06:19 MDT 1998ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.13 08:06:19 MDTMathematics of Computationacknjhttp://www.ams.org/mcom/Kurt SpielbergPolynomial and ContinuedFraction Approximations for Logarithmic Functions
@Article{Spielberg:1962:PCF,
author = "Kurt Spielberg",
title = "Polynomial and ContinuedFraction Approximations for
Logarithmic Functions",
journal = jMATHCOMPUT,
volume = "16",
number = "78",
pages = "205217",
month = apr,
year = "1962",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Tue Oct 13 08:06:19 MDT 1998",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR
database",
acknowledgement = acknj # " and " # acknhfb,
fjournal = "Mathematics of Computation",
journalURL = "http://www.ams.org/mcom/",
}‹]`W #++K[57E‚5;?c+Sarticlefparith.bibSmith:1962:ACDaRobert L. SmithAlgorithm 116: Complex DivisionjCACM58435435aug81962CACMA2http://dx.doi.org/10.1145/368637.36866100010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Fri Nov 25 18:19:40 MST 2005http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.11.25 18:19:40 MSTCommunications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Robert L. Smith{Algorithm 116}: {Complex} Division
@Article{Smith:1962:ACDa,
author = "Robert L. Smith",
title = "{Algorithm 116}: {Complex} Division",
journal = jCACM,
volume = "5",
number = "8",
pages = "435435",
month = aug,
year = "1962",
CODEN = "CACMA2",
DOI = "http://dx.doi.org/10.1145/368637.368661",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 25 18:19:40 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
} "00063835",
bibdate = "Wed Jan 4 18:52:07 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=2&issue=4;
http://www.math.utah.edu/pub/tex/bib/bit.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=2&issue=4&spage=232",
acknowledgement = acknhfb,
journalURL = "http://link.springer.com/journal/10543",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}â
»Ž»OcY %#'!E‚s3A=m;)I!1ƒincollectionfparith.bibZuse:1962:EREK. ZuseW. HoffmanDigitale InformationswandlerEntwicklungslinien einer RechengerateEntwicklung von der Mechanik zur Elektronik. (German) [Lines of development of computing equipment development from mechanics to electronics]Vieweg & Sohn, GmbHBraunschweig, West Germany5085321962Wed Oct 13 11:23:04 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib2010.10.13 11:23:04 ???Reprinted in cite [ 4.3]Randell:1982:ODC. Translated by Mr. and Mrs. P. Jones.GermanacknhfbK. Zuse{Digitale Informationswandler}W. HoffmanReprinted in \cite[\S 4.3]{Randell:1982:ODC}. Translated by Mr. and Mrs. P. Jones.{Entwicklungslinien einer Rechenger{\"a}teEntwicklung von der Mechanik zur Elektronik}. ({German}) [Lines of development of computing equipment development from mechanics to electronics]
@InCollection{Zuse:1962:ERE,
author = "K. Zuse",
editor = "W. Hoffman",
booktitle = "{Digitale Informationswandler}",
title = "{Entwicklungslinien einer Rechenger{\"a}teEntwicklung
von der Mechanik zur Elektronik}. ({German}) [Lines of
development of computing equipment development from
mechanics to electronics]",
publisher = "Vieweg \& Sohn, GmbH",
address = "Braunschweig, West Germany",
pages = "508532",
year = "1962",
bibdate = "Wed Oct 13 11:23:04 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Reprinted in \cite[\S 4.3]{Randell:1982:ODC}.
Translated by Mr. and Mrs. P. Jones.",
acknowledgement = acknhfb,
language = "German",
}ŽnbX #'wI)U57C‚;KMY{=articlefparith.bibWynn:1962:AAPP. WynnAn Arsenal of ALGOL Procedures for Complex ArithmeticjNORDISKTIDSKRINFORMBEHAND24232255dec121962BITTEL, NBITABhttp://dx.doi.org/10.1007/BF0194017100063835 (print), 15729125 (electronic) OR 00063835 (print), 15729125 (electronic)00063835 OR 00063835Wed Jan 4 18:52:07 MST 2006http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=2&issue=4; http://www.math.utah.edu/pub/tex/bib/bit.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2006.01.04 18:52:07 MSThttp://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=2&issue=4&spage=232Cited in cite Sterbenz:1974:FPC.acknhfbhttp://link.springer.com/journal/10543P. WynnAn Arsenal of {ALGOL} Procedures for Complex Arithmetic
@Article{Wynn:1962:AAP,
author = "P. Wynn",
title = "An Arsenal of {ALGOL} Procedures for Complex
Arithmetic",
journal = jNORDISKTIDSKRINFORMBEHAND,
volume = "2",
number = "4",
pages = "232255",
month = dec,
year = "1962",
CODEN = "BITTEL, NBITAB",
DOI = "http://dx.doi.org/10.1007/BF01940171",
ISSN = "00063835 (print), 15729125 (electronic)",
ISSNL = "00063835",
bibdate = "Wed Jan 4 18:52:07 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=2&issue=4;
http://www.math.utah.edu/pub/tex/bib/bit.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=2&issue=4&spage=232",
acknowledgement = acknhfb,
journalURL = "http://link.springer.com/journal/10543",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}
i ¿iŠReW#/iQ!57=K;7UiU‹Oarticlefparith.bibClenshaw:1963:ASFC. W. Clenshaw and G. F. Miller and M. WoodgerAlgorithms for Special Functions IjNUMMATH44034191963NUMMA70029599X (print), 09453245 (electronic) OR 0029599X (print), 09453245 (electronic)0029599X OR 0029599XFri Sep 16 10:21:31 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.16 10:21:31 ???Numerische Mathematikacknjhttp://link.springer.com/journal/211C. W. Clenshaw and G. F. Miller and M. WoodgerAlgorithms for Special Functions {I}
@Article{Clenshaw:1963:ASF,
author = "C. W. Clenshaw and G. F. Miller and M. Woodger",
title = "Algorithms for Special Functions {I}",
journal = jNUMMATH,
volume = "4",
pages = "403419",
year = "1963",
CODEN = "NUMMA7",
ISSN = "0029599X (print), 09453245 (electronic)",
ISSNL = "0029599X",
bibdate = "Fri Sep 16 10:21:31 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Numerische Mathematik",
journalURL = "http://link.springer.com/journal/211",
xxmonth = "(none)",
xxnumber = "(none)",
}Œ=dY #)#57E‚5;?cc#iarticlefparith.bibBemer:1963:NRTR. W. BemerA Note on Range Transformations for Square Root and LogarithmjCACM66306307jun61963CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Fri Nov 25 18:19:47 MST 2005http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.11.25 18:19:47 MSTCommunications of the ACM$log (x)$; $sqrt (x)$; elementary functionsacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79R. W. BemerA Note on Range Transformations for Square Root and Logarithm
@Article{Bemer:1963:NRT,
author = "R. W. Bemer",
title = "A Note on Range Transformations for Square Root and
Logarithm",
journal = jCACM,
volume = "6",
number = "6",
pages = "306307",
month = jun,
year = "1963",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 25 18:19:47 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "$\log(x)$; $\sqrt(x)$; elementary functions",
}

‰XgW #/#s'57E
;A=#sŠY
articlefparith.bibDescloux:1963:NREJ. DesclouxNote on the RoundOff Errors in Iterative ProcessesjMATHCOMPUT17811827jan11963MCMPAF00255718 (print), 10886842 (electronic) OR 00255718 (print), 10886842 (electronic)00255718 OR 00255718Tue Oct 13 08:06:19 MDT 1998http://www.math.utah.edu/pub/tex/bib/fparith.bib; JSTOR database1998.10.13 08:06:19 MDTMathematics of Computationacknhfbhttp://www.ams.org/mcom/J. DesclouxNote on the RoundOff Errors in Iterative Processes
@Article{Descloux:1963:NRE,
author = "J. Descloux",
title = "Note on the RoundOff Errors in Iterative Processes",
journal = jMATHCOMPUT,
volume = "17",
number = "81",
pages = "1827",
month = jan,
year = "1963",
CODEN = "MCMPAF",
ISSN = "00255718 (print), 10886842 (electronic)",
ISSNL = "00255718",
bibdate = "Tue Oct 13 08:06:19 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
JSTOR database",
acknowledgement = acknhfb,
fjournal = "Mathematics of Computation",
journalURL = "http://www.ams.org/mcom/",
}‹sfW#'?m=a7E‚;_?m# articlefparith.bibDaly:1963:HSAW. G. Daly and J. F. KruyA HighSpeed Arithmetic Unit Using Tunnel DiodesjIEEETRANSELECCOMPUTEC125503511oct101963IEECA8http://dx.doi.org/10.1109/PGEC.1963.26364403677508 OR 03677508Thu Jul 14 08:10:42 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 08:10:42 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037964IEEE Transactions on Electronic ComputersacknhfbW. G. Daly and J. F. KruyA HighSpeed Arithmetic Unit Using Tunnel Diodes
@Article{Daly:1963:HSA,
author = "W. G. Daly and J. F. Kruy",
title = "A HighSpeed Arithmetic Unit Using Tunnel Diodes",
journal = jIEEETRANSELECCOMPUT,
volume = "EC12",
number = "5",
pages = "503511",
month = oct,
year = "1963",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1963.263644",
ISSN = "03677508",
bibdate = "Thu Jul 14 08:10:42 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037964",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Electronic Computers",
}
áQ
bs„•á‰’1
@Article{Demmel:1984:URN,
author = "James Demmel",
title = "Underflow and the reliability of numerical software",
journal = jSIAMJSCISTATCO‡2Že
@Article{Deiters:1965:ODD,
author = "Robert M. Deiters",
title = "Optimum Design of a Diode Squarer by Applying the
Criterion of Square Root of the Integral of Per Cent
Error Squared",
journal = jIEEETRANSELECCOMPUT,
volume = "EC14",
number = "3",
pages = "456463",
month = jun,
year = "1965",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1965.264153",
ISSN = "03677508",
bibdate = "Thu Jul 14 06:26:34 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4038465",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Electronic Computers",
} Šo•_
@Article{Defour:2004:PSM,
author = "David Defour and Guillaume Hanrot and Vincent
Lef{\`e}vre and JeanMichel Muller and Nathalie Revol
and Paul Zimmermann",
title = "Proposal for a Standardization of Mathematical
Function Implementation in FloatingPoint Arithmetic",
journal = jNUMERALGORITHMS,
volume = "37",
number = "14",
pages = "367375",
month = dec,
year = €Še•K
@Article{Debnath:1978:MOD,
author = "R. C. Debnath and D. A. Pucknell",
title = "On multiplicative overflow detection in residue number
system",
journal = jELECTLETTERS,
volume = "14",
number = "5",
pages = "129130",
month = "????",
year = "1978",
CODEN = "ELLEAK",
DOI = "http://dx.doi.org/10.1049/el:19780088",
ISSN = "00135194 (print), 1350911X (electronic)",
ˆ9
@Article{Debnath:1978:EMO,
author = "R. C. Debnath and D. A. Pucknell",
title = "Erratum: On multiplicative overflow detection in
residue number system",
journal = jELECTLETTERS,
volume = "14",
number = "12",
pages = "385",
day = "8",
month = jun,
year = "1978",
CODEN = "ELLEAK",
DOI = "http://dx.doi.org/10.1049/el:19780260",
ISSN = "00135194 (print), 1zˆK‘
@Article{DeVaal:1980:SZI,
author = "C. {De Vaal} and R. Nouta",
title = "On the suppression of zeroinput parasitic
oscillations in floating point wave digital filters",
journal = jIEEETRANSCIRCUITSSYST,
volume = "27",
number = "2",
pages = "144145",
month = feb,
year = "1980",
CODEN = "ICSYBT",
ISSN = "00984094 (print), 15581276 (electronic)",
ISSNL = "009840?ƒ>†}
@Article{DeRegt:1967:NRA,
author = "M. P. DeRegt",
title = "Negative radix arithmetic",
journal = "Computer Design",
volume = "6",
number = "??",
pages = "5263",
month = may,
year = "1967",
bibdate = "Thu Nov 06 06:07:24 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
keywords = "negative base",
}s‡xq
@Article{DeMori:1972:PSS,
author = "R. {De Mori} and A. Serra",
title = "A Parallel Structure for SignedNumber Multiplication
and Addition",
journal = jIEEETRANSCOMPUT,
volume = "C21",
number = "12",
pages = "14531454",
month = dec,
year = "1972",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1972.223525",
ISSN = "00189340 (print), 15579956 (electrow
º Ÿº‰aiW #+%K57;K;?c%KŠuarticlefparith.bibEisman:1963:PERS. H. EismanPolynomial Evaluation RevisitedjCACM67384385jul71963CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Thu Sep 1 10:15:41 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:15:41 ???Communications of the ACMacknjhttp://portal.acm.org/browse_dl.cfm?idx=J79S. H. EismanPolynomial Evaluation Revisited
@Article{Eisman:1963:PER,
author = "S. H. Eisman",
title = "Polynomial Evaluation Revisited",
journal = jCACM,
volume = "6",
number = "7",
pages = "384385",
month = jul,
year = "1963",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu Sep 1 10:15:41 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}Œ]hW #13}=a7E‚;_G3}Ž3articlefparith.bibDietmeyer:1963:CPNDonald L. DietmeyerConversion from Positive to Negative and Imaginary RadixjIEEETRANSELECCOMPUTEC1212022feb21963IEECA8http://dx.doi.org/10.1109/PGEC.1963.26339103677508 OR 03677508Thu Jul 14 08:10:36 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 08:10:36 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037765IEEE Transactions on Electronic Computersimaginary base; negative baseacknhfbDonald L. DietmeyerConversion from Positive to Negative and Imaginary Radix
@Article{Dietmeyer:1963:CPN,
author = "Donald L. Dietmeyer",
title = "Conversion from Positive to Negative and Imaginary
Radix",
journal = jIEEETRANSELECCOMPUT,
volume = "EC12",
number = "1",
pages = "2022",
month = feb,
year = "1963",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1963.263391",
ISSN = "03677508",
bibdate = "Thu Jul 14 08:10:36 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037765",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Electronic Computers",
keywords = "imaginary base; negative base",
}
Ö
ÄwÖ‹lW#)7ƒ[=m;!7ƒ‹articlefparith.bibGeier:1963:ACDA. Geier and I. SturzThe approximate calculation of a definite integral with automatic choice of integration steps (intervals). The program for the computer $ rm MECIPTI $ in a floating point regime. (Romanian)An. Univ. Timisoara Ser. Sti. Mat.Fiz.1133139196368.0030\#3588Fri Dec 08 13:52:47 1995http://www.math.utah.edu/pub/tex/bib/fparith.bib1995.12.08 13:52:47 ???acknhfbR. N. GossA. Geier and I. SturzThe approximate calculation of a definite integral with automatic choice of integration steps (intervals). The program for the computer {$ {\rm MECIPTI} $} in a floating point regime. (Romanian)
@Article{Geier:1963:ACD,
author = "A. Geier and I. Sturz",
title = "The approximate calculation of a definite integral
with automatic choice of integration steps (intervals).
The program for the computer {$ {\rm MECIPTI} $} in a
floating point regime. (Romanian)",
journal = "An. Univ. Timi{\c{s}}oara Ser. {\c{S}}ti. Mat.Fiz.",
volume = "1",
pages = "133139",
year = "1963",
MRclass = "68.00",
MRnumber = "30\#3588",
bibdate = "Fri Dec 08 13:52:47 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
reviewer = "R. N. Goss",
}†IkV #+M!#;K;M‡ùbookfparith.bibFlores:1963:LCAI. FloresThe Logic of Computer ArithmeticpubPHpubPH:adrxii + 4931963QA76.5 .F46Thu Sep 1 10:12:51 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.01 10:12:51 ???acknjI. FloresThe Logic of Computer Arithmetic
@Book{Flores:1963:LCA,
author = "I. Flores",
title = "The Logic of Computer Arithmetic",
publisher = pubPH,
address = pubPH:adr,
pages = "xii + 493",
year = "1963",
LCCN = "QA76.5 .F46",
bibdate = "Thu Sep 1 10:12:51 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
}Š8jY #%57=K;5O‹Karticlefparith.bibEve:1963:SAIJ. EveStarting approximation for the iterative calculation of square rootsjCOMPJ62742761963CMPJA600104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Thu Sep 15 18:37:30 1994ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip; http://www.math.utah.edu/pub/tex/bib/fparith.bib1994.09.15 18:37:30 ???The Computer Journalacknjhttp://comjnl.oxfordjournals.org/J. EveStarting approximation for the iterative calculation of square roots
@Article{Eve:1963:SAI,
author = "J. Eve",
title = "Starting approximation for the iterative calculation
of square roots",
journal = jCOMPJ,
volume = "6",
pages = "274276",
year = "1963",
CODEN = "CMPJA6",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Thu Sep 15 18:37:30 1994",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
xxmonth = "(none)",
xxnumber = "(none)",
}
÷d¡
Ý `Ù¨q÷„x‰q
@Book{IBM:1994:OA,
author = "{IBM Corporation}",
title = "The {PowerPC} Architecture: a Specification for a New
Family of {RISC} Processors",
publisher = pubMORGANKAUFMANN,
address = pubMORGANKAUFMANN:adr,
edition = "Second",
pages = "xxxi + 518",
year = "1994",
ISBN = "1558603166",
ISBN13 = "9781558603165",
LCCN = "QA76.8.P67 P68 1994",
bibdate = "Wed Jul 6 14:15:23 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
price = "US\$49.95",
acknowledgement = acknhfb,
}ý„5ˆk
@Book{IBM:1994:IRS,
editor = "Steve White and John Reysa",
title = "{IBM RISC} System\slash 6000 Technology: Volume {II}",
publisher = pubIBM,
address = pubIBM:adr,
year = "1994",
bibdate = "Fri Mar 18 10:25:19 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "A partial draft is available via anonymous ftp to
\pathibminet.awdpa.ibm.com in the PostScript file
\path/pub/rs6kpapers/techbook.ps.",
acknowledgement = acknhfb,
}ü„/ˆ_
@Book{IBM:1993:IPA,
author = "{IBM Corporation}",
title = "The {IBM PowerPC} Architecture: a New Family of {RISC}
Processors",
publisher = pubMORGANKAUFMANN,
address = pubMORGANKAUFMANN:adr,
year = "1993",
ISBN = "1558603166",
ISBN13 = "9781558603165",
LCCN = "QA76.8.P67P68 1994",
bibdate = "Sat Oct 15 12:26:00 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
price = "US\$49.95",
acknowledgement = acknhfb,
}Tƒ†
@Book{IBM:1990:IRS,
editor = "Mamata Misra",
title = "{IBM RISC System\slash 6000 Technology, publication
SA23261900}",
publisher = pubIBM,
address = pubIBM:adr,
year = "1990",
bibdate = "Wed Sep 14 23:02:26 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
} E‚{…w
@Book{IBM:1986:IRP,
author = "{IBM}",
title = "{IBM RT} Personal Computer Technology, publication
{SA231057}",
publisher = pubIBM,
address = pubIBM:adr,
year = "1986",
bibdate = "Sat Oct 28 08:16:44 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}+ƒB‡
@Book{IBM:1976:ISP,
author = "{IBM Corporation}",
title = "{IBM System}\slash 370: Principles of Operation:
Systems",
publisher = pubIBM,
address = pubIBM:adr,
pages = "326",
year = "1976",
LCCN = "QA76.8.I122 I57 1976",
bibdate = "Fri Sep 16 16:30:13 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}lƒA‡
@Book{IBM:1968:ISP,
author = "{IBM Corporation}",
title = "{IBM System}\slash 360 Principles of Operation",
publisher = pubIBM,
address = pubIBM:adr,
edition = "Eighth",
pages = "175",
year = "1968",
LCCN = "QA76.8.I12 I59 1968",
bibdate = "Wed Sep 14 23:12:39 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}žƒ†7
@Book{IBM:1953:POT,
author = "{IBM Corporation}",
title = "Principles of Operation: Type 701 and Associated
Equipment",
publisher = pubIBM,
address = pubIBM:adr,
pages = "103",
year = "1953",
bibdate = "Wed Sep 14 23:17:49 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
}M
ˆˆ"
3fw†Œ'
@Article{Kan:1973:CEA,
author = "E. Kan and J. Aggarwal",
title = "Correction to {``Error Analysis of Digital Filters
Employing FloatingPoint Arithmetic''}",
journal = jIEEETRANSCIRCUITSSYST,
volume = "20",
number = "5",
paˆ*U
@Article{Kalla:2010:PIN,
author = "Ron Kalla and Balaram Sinharoy and William J. Starke
and Michael Floyd",
title = "{Power7}: {IBM}'s NextGeneration Server Processor",
journal = jIEEEMICRO,
volume = "30",
number = "2",
pages = "715",
month = mar # "\slash " # apr,
year = "2010",
CODEN = "IEMIDZ",
DOI = "http://www.computer.org/portal/web/csdl/doi/10.1109/MM.2010.38",
INˆf‘M
@Article{Kan:1971:EAD,
author = "E. Kan and J. Aggarwal",
title = "Error analysis of digital filter employing
floatingpoint arithmetic",
journal = jIEEETRANSCIRCUITSSYST,
volume = "18",
number = "6",
pages = "678686",
month = nov,
year = "1971",
CODEN = "ICSYBT",
ISSN = "00984094 (print), 15581276 (electronic)",
ISSNL = "00984094",
bibdate = "Sat Jul 1D‡K
@Article{Kamal:1972:HSM,
author = "A. A. Kamal and M. A. N. Ghannam",
title = "HighSpeed Multiplication Systems",
journal = jIEEETRANSCOMPUT,
volume = "C21",
number = "9",
pages = "10171021",
month = sep,
year = "1972",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1972.5009082",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Tue Jul 12 18:58:46 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5009082",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}aˆY‘3
@Article{Kalliojarvi:1996:REB,
author = "K. Kalliojarvi and J. Astola",
title = "Roundoff errors in blockfloatingpoint systems",
journal = jIEEETRANSSIGPROC,
volume = "44",
number = "4",
pages = "783790",
month = apr,
year = "1996",
CODEN = "ITPRED",
ISSN = "1053587X (print), 19410476 (electronic)",
ISSNL = "1053587X",
bibdate = "Sat Jul 16 08:40:52 MDT 2005",
bibsoÃ‰ ’
@Article{Kalliojarvi:1994:RCW,
author = "K. Kalliojarvi and J. Astola",
title = "Required coefficient word length in floatingpoint and
logarithmic digital filters",
journal = jIEEESIGNALPROCESSLETT,
volume = "1",
number = "3",
pages = "5254",
month = mar,
year = "1994",
CODEN = "ISPLEM",
ISSN = "10709908 (print), 15582361 (electronic)",
ISSNL = "10709908",
%‹W—/
@Article{Kaliski:1995:MIA,
author = "Burton S. {Kaliski, Jr.}",
title = "The {Montgomery} inverse and its applications",
journal = jIEEETRANSCOMPUT,
volume = "44",
number = "8",
pages = "10641065",
month = aug,
year = "1995",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.403725",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate :19:45 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "The 7090 at NYU has been modified to include a
``Significance Mode'' of operation which is intended to
facilitate the identification of significant bits in
the results of floatingpoint arithmetic operations.
The manner in which floatingpoint arithmetic is
handled in this mode is discussed. Several numerical
experiments using this mode are described and
comparisons are made with the ordinary ``normalized
mode.'' Examples include power series evaluation,
linear equations solution, determinant evaluation and
matrix inversion.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}í
™wmY #1'g[57E‚5;ˆ1?cˆ1'g˜Marticlefparith.bibGoldstein:1963:SADMax GoldsteinSignificance arithmetic on a digital computerjCACM63111117mar31963CACMA2http://dx.doi.org/10.1145/366274.36633900010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Fri Nov 25 18:19:45 MST 2005http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.11.25 18:19:45 MSTThe 7090 at NYU has been modified to include a ``Significance Mode'' of operation which is intended to facilitate the identification of significant bits in the results of floatingpoint arithmetic operations. The manner in which floatingpoint arithmetic is handled in this mode is discussed. Several numerical experiments using this mode are described and comparisons are made with the ordinary ``normalized mode.'' Examples include power series evaluation, linear equations solution, determinant evaluation and matrix inversion.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79The 7090 at NYU has been modified to include a ``Significance Mode'' of operation which is intended to facilitate the identification of significant bits in the results of floatingpoint arithmetic operations. The manner in which floatingpoint arithmetic is handled in this mode is discussed. Several numerical experiments using this mode are described and comparisons are made with the ordinary ``normalized mode.'' Examples include power series evaluation, linear equations solution, determinant evaluation and matrix inversion.Max GoldsteinSignificance arithmetic on a digital computer
@Article{Goldstein:1963:SAD,
author = "Max Goldstein",
title = "Significance arithmetic on a digital computer",
journal = jCACM,
volume = "6",
number = "3",
pages = "111117",
month = mar,
year = "1963",
CODEN = "CACMA2",
DOI = "http://dx.doi.org/10.1145/366274.366339",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 25 18:19:45 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "The 7090 at NYU has been modified to include a
``Significance Mode'' of operation which is intended to
facilitate the identification of significant bits in
the results of floatingpoint arithmetic operations.
The manner in which floatingpoint arithmetic is
handled in this mode is discussed. Several numerical
experiments using this mode are described and
comparisons are made with the ordinary ``normalized
mode.'' Examples include power series evaluation,
linear equations solution, determinant evaluation and
matrix inversion.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
ë ëŒ1oY #93=a7E‚;_3iarticlefparith.bibKrishnamurthy:1963:CMDE. V. KrishnamurthyOn Computer Multiplication and Division Using Binary LogarithmsjIEEETRANSELECCOMPUTEC123319320jun61963IEECA8http://dx.doi.org/10.1109/PGEC.1963.26357203677508 OR 03677508Thu Jul 14 08:10:39 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 08:10:39 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037874IEEE Transactions on Electronic ComputersacknhfbE. V. KrishnamurthyOn Computer Multiplication and Division Using Binary Logarithms
@Article{Krishnamurthy:1963:CMD,
author = "E. V. Krishnamurthy",
title = "On Computer Multiplication and Division Using Binary
Logarithms",
journal = jIEEETRANSELECCOMPUT,
volume = "EC12",
number = "3",
pages = "319320",
month = jun,
year = "1963",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1963.263572",
ISSN = "03677508",
bibdate = "Thu Jul 14 08:10:39 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037874",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Electronic Computers",
}‰\nY #)+5=S;=+AŠ+articlefparith.bibKnuth:1963:LEEDonald E. KnuthLetter to the Editor: Evaluation of polynomials by computerjCACM625151feb21963CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)Tue Dec 26 16:31:38 1995http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib1995.12.26 16:31:38 ???See cite Knuth:1962:EPC.acknhfbDonald E. KnuthSee \cite{Knuth:1962:EPC}.Letter to the {Editor}: {Evaluation} of polynomials by computer
@Article{Knuth:1963:LEE,
author = "Donald E. Knuth",
title = "Letter to the {Editor}: {Evaluation} of polynomials by
computer",
journal = jCACM,
volume = "6",
number = "2",
pages = "5151",
month = feb,
year = "1963",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
bibdate = "Tue Dec 26 16:31:38 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "See \cite{Knuth:1962:EPC}.",
acknowledgement = acknhfb,
}
ê ÖêhqY #+%=a7E‚U;ƒ__%‘marticlefparith.bibLehmer:1963:RDOD. H. LehmerR6317 Division and Overflow Detection in Residue Number SystemsjIEEETRANSELECCOMPUTEC1213637feb21963IEECA8http://dx.doi.org/10.1109/PGEC.1963.26349303677508 OR 03677508Thu Jul 14 08:10:36 MDT 2011http://ieeexplore.ieee.org/; http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 08:10:36 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037786; http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4037753; http://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=4037754IEEE Transactions on Electronic Computersresidue arithmetic; residue number systemacknhfbD. H. Lehmer{R6317} Division and Overflow Detection in Residue Number Systems
@Article{Lehmer:1963:RDO,
author = "D. H. Lehmer",
title = "{R6317} Division and Overflow Detection in Residue
Number Systems",
journal = jIEEETRANSELECCOMPUT,
volume = "EC12",
number = "1",
pages = "3637",
month = feb,
year = "1963",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1963.263493",
ISSN = "03677508",
bibdate = "Thu Jul 14 08:10:36 MDT 2011",
bibsource = "http://ieeexplore.ieee.org/;
http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037786;
http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4037753;
http://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=4037754",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Electronic Computers",
keywords = "residue arithmetic; residue number system",
}Œ&pY #+!=a7E‚;_!]articlefparith.bibLehman:1963:MABM. LehmanThe Minimization of Assimilations in Binary CarryStorage Arithmetic UnitsjIEEETRANSELECCOMPUTEC124409410aug81963IEECA8http://dx.doi.org/10.1109/PGEC.1963.26347903677508 OR 03677508Thu Jul 14 08:10:40 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 08:10:40 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037921IEEE Transactions on Electronic ComputersacknhfbM. LehmanThe Minimization of Assimilations in Binary CarryStorage Arithmetic Units
@Article{Lehman:1963:MAB,
author = "M. Lehman",
title = "The Minimization of Assimilations in Binary
CarryStorage Arithmetic Units",
journal = jIEEETRANSELECCOMPUT,
volume = "EC12",
number = "4",
pages = "409410",
month = aug,
year = "1963",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1963.263479",
ISSN = "03677508",
bibdate = "Thu Jul 14 08:10:40 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037921",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Electronic Computers",
}36 MDT 2011",
bibsource = "http://ieeexplore.ieee.org/;
http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037786;
http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4037753;
http://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=4037754",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Electronic Computers",
keywords = "residue arithmetic; residue number system",
}ñ
c crY#1Y#'O57E‚#;#C%Y#Ž7 articlefparith.bibLindamood:1963:MCOGeorge E. Lindamood and George ShapiroMagnitude Comparison and Overflow Detection in Modular Arithmetic ComputersjSIAMREVIEW543423501963SIREADhttp://dx.doi.org/10.1137/100509500361445 (print), 10957200 (electronic) OR 00361445 (print), 10957200 (electronic)00361445 OR 00361445Thu Mar 27 09:05:07 MDT 2014http://epubs.siam.org/toc/siread/5/4; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/siamreview.bib2014.03.27 09:05:07 MDTSIAM Reviewacknhfbhttp://epubs.siam.org/sirevOctober 1963George E. Lindamood and George ShapiroMagnitude Comparison and Overflow Detection in Modular Arithmetic Computers
@Article{Lindamood:1963:MCO,
author = "George E. Lindamood and George Shapiro",
title = "Magnitude Comparison and Overflow Detection in Modular
Arithmetic Computers",
journal = jSIAMREVIEW,
volume = "5",
number = "4",
pages = "342350",
month = "????",
year = "1963",
CODEN = "SIREAD",
DOI = "http://dx.doi.org/10.1137/1005095",
ISSN = "00361445 (print), 10957200 (electronic)",
ISSNL = "00361445",
bibdate = "Thu Mar 27 09:05:07 MDT 2014",
bibsource = "http://epubs.siam.org/toc/siread/5/4;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/siamreview.bib",
acknowledgement = acknhfb,
fjournal = "SIAM Review",
journalURL = "http://epubs.siam.org/sirev",
onlinedate = "October 1963",
}.263592",
ISSN = "03677508",
bibdate = "Thu Jul 14 08:10:44 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/bibnet/authors/m/metropolisnicholas.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4038037",
ZMnumber = "0124.07910",
abstract = "A particular set of unnormalized arithmetic operations
termed ``basic'' are described, in the context of the
University of Chicago Maniac III Computer. Each basic
operation involves three operand words and generates
two result words, all in unnormalized floating point
format. The use of these operations in the
implementation of multiprecision arithmetic is
explained; in particular, it is demonstrated that
multiprecision division can be effected in a
nontentative manner with their aid.",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Electronic Computers",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}ó
ËËœ1sZ#3Qw=97Eƒ);‡a_M!‡aQw›s articlefparith.bibMetropolis:1963:BOUN. Metropolis and R. L. AshenhurstBasic Operations in an Unnormalized Arithmetic SystemjIEEETRANSELECCOMPUTEC126896904dec121963IEECA8http://dx.doi.org/10.1109/PGEC.1963.263593; http://dx.doi.org/10.1109/PGEC.1963.26359203677508 OR 03677508Thu Jul 14 08:10:44 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/bibnet/authors/m/metropolisnicholas.bib; http://www.math.utah.edu/pub/tex/bib/fparith.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2011.07.14 08:10:44 MDThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4038037A particular set of unnormalized arithmetic operations termed ``basic'' are described, in the context of the University of Chicago Maniac III Computer. Each basic operation involves three operand words and generates two result words, all in unnormalized floating point format. The use of these operations in the implementation of multiprecision arithmetic is explained; in particular, it is demonstrated that multiprecision division can be effected in a nontentative manner with their aid.IEEE Transactions on Electronic ComputersCited in cite Sterbenz:1974:FPC.0124.07910acknhfbA particular set of unnormalized arithmetic operations termed ``basic'' are described, in the context of the University of Chicago Maniac III Computer. Each basic operation involves three operand words and generates two result words, all in unnormalized floating point format. The use of these operations in the implementation of multiprecision arithmetic is explained; in particular, it is demonstrated that multiprecision division can be effected in a nontentative manner with their aid.N. Metropolis and R. L. AshenhurstBasic Operations in an Unnormalized Arithmetic System
@Article{Metropolis:1963:BOU,
author = "N. Metropolis and R. L. Ashenhurst",
title = "Basic Operations in an Unnormalized Arithmetic
System",
journal = jIEEETRANSELECCOMPUT,
volume = "EC12",
number = "6",
pages = "896904",
month = dec,
year = "1963",
CODEN = "IEECA8",
DOI = "http://dx.doi.org/10.1109/PGEC.1963.263593;
http://dx.doi.org/10.1109/PGEC.1963.263592",
ISSN = "03677508",
bibdate = "Thu Jul 14 08:10:44 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/bibnet/authors/m/metropolisnicholas.bib;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4038037",
ZMnumber = "0124.07910",
abstract = "A particular set of unnormalized arithmetic operations
termed ``basic'' are described, in the context of the
University of Chicago Maniac III Computer. Each basic
operation involves three operand words and generates
two result words, all in unnormalized floating point
format. The use of these operations in the
implementation of multiprecision arithmetic is
explained; in particular, it is demonstrated that
multiprecision division can be effected in a
nontentative manner with their aid.",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Electronic Computers",
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
}
#
ò#KuW#)E{#57E';;E{‘articlefparith.bibStern:1963:CSRT. E. Stern and R. M. LernerA circuit for the square root of the sum of the squaresjPROCIEEE514593596apr41963IEEPAD00189219 (print), 15582256 (electronic) OR 00189219 (print), 15582256 (electronic)00189219 OR 00189219Sat Jul 16 15:28:13 MDT 2005http://ieeexplore.ieee.org/; http://www.math.utah.edu/pub/tex/bib/fparith.bib2005.07.16 15:28:13 MDTProceedings of the IEEEacknhfbhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5T. E. Stern and R. M. LernerA circuit for the square root of the sum of the squares
@Article{Stern:1963:CSR,
author = "T. E. Stern and R. M. Lerner",
title = "A circuit for the square root of the sum of the
squares",
journal = jPROCIEEE,
volume = "51",
number = "4",
pages = "593596",
month = apr,
year = "1963",
CODEN = "IEEPAD",
ISSN = "00189219 (print), 15582256 (electronic)",
ISSNL = "00189219",
bibdate = "Sat Jul 16 15:28:13 MDT 2005",
bibsource = "http://ieeexplore.ieee.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Proceedings of the IEEE",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
summary = "A piecewiselinear network can produce an output
proportional to the square root of the sum of the
squares of a set of input voltages, using resistors and
diodes alone. The required relationship between
voltages can be represented by a multi \ldots{}",
}Š
tV#'o]+3)E%;mM;o]‹bookfparith.bibMood:1963:ITSAlexander McFarlane Mood and Franklin A. GraybillIntroduction to the theory of statisticspubMCGRAWHILLpubMCGRAWHILL:adrSecond4431963HA29 .M75 1963Fri Aug 20 10:02:03 MDT 2010http://www.math.utah.edu/pub/tex/bib/fparith.bib; z3950.loc.gov:7090/Voyager2010.08.20 10:02:03 MDTMcGrawHill series in probability and statisticsCited in cite Sterbenz:1974:FPC.Mathematical statisticsacknhfbAlexander McFarlane Mood and Franklin A. GraybillIntroduction to the theory of statistics
@Book{Mood:1963:ITS,
author = "Alexander McFarlane Mood and Franklin A. Graybill",
title = "Introduction to the theory of statistics",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
edition = "Second",
pages = "443",
year = "1963",
LCCN = "HA29 .M75 1963",
bibdate = "Fri Aug 20 10:02:03 MDT 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
z3950.loc.gov:7090/Voyager",
series = "McGrawHill series in probability and statistics",
acknowledgement = acknhfb,
remark = "Cited in \cite{Sterbenz:1974:FPC}.",
subject = "Mathematical statistics",
},
bibsource = "http://ieeexplore.ieee.org/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknhfb,
fjournal = "Proceedings of the IEEE",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
summary = "A piecewiselinear network can produce an output
proportional to the square root of the sum of the
squares of a set of input voltages, using resistors and
diodes alone. The required relationship between
voltages can be represented by a multi \ldots{}",
}õp 29 08:55:45 MDT 2000",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_06/Issue_01/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_06/Issue_01/060062.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_06/Issue_01/tiff/62.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_06/Issue_01/tiff/63.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_06/Issue_01/tiff/64.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_06/Issue_01/tiff/65.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_06/Issue_01/tiff/66.tif",
acknowledgement = acknhfb # " and " # acknj,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}ö
ÊÈ_ÈNp"†Œ
@Article{Timmermann:1992:LLT,
author = "D. Timmermann and H. Hahn and B. J. Hosticka",
title = "Low Latency Time {CORDIC} Algorithms",
journal = jIEEETRANSCOMPUT,
volume = "41",
number = "8",
pages = "10101015",
month = aug,
year = "1992",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/12.156543",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Thu Sep 08 00:52:02 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
ü^¦a
@Article{Thun:1986:RNS,
author = "R. Thun",
title = "On residue number system decoding",
journal = "Acoustics, Speech, and Signal Proce‘8¢q
@Article{Timmermann:1994:CFV,
author = "D. Timmermann and B. Rix and H. Hahn and B. J.
Hosticka",
title = "A {CMOS} floatingpoint vectorarithmetic unit",
journal = jIEEEJSOLIDSTATECIRCUITS,
volume = "29",
number = "5",
pages = "634639",
month = may,
year = "1994",
CODEN = "IJSCBC",
ISSN = "00189200 (print), 1558173X (electronic)",
ISSNL = "00189200",
bibdˆˆ[
@Article{Tienari:1970:SMR,
author = "Martti Tienari",
title = "A Statistical Model of Roundoff Error for Varying
Length FloatingPoint Arithmetic",
journal = jBIT,
volume = "10",
number = "3",
pages = "355365",
month = sep,
year = "1970",
CODEN = "BITTEL, NBITAB",
DOI = "http://dx.doi.org/10.1007/BF01934204",
ISSN = "00063835 (print), 15729125 (electronic)",
I†Œ
@Article{Timmermann:1993:GFR,
author = "D. Timmermann and B. Rix and B. Hosticka",
title = "{Gleitkommaprozessor f{\"u}r rechenintensive
Echtzeitanwendungen} \toenglish {Floatingpoint
Processor for Computationally Intensive RealTime Use}
\endtoenglish",
journal = jELECTRONIK,
volume = "20",
number = "??",
pages = "142146",
month = "????",
year = "1993",
CODEN = "EKRKAR",
ISSN = "00135658",
bibdate = "Fri Dec 08 13:05:00 1995",
bibsource = "ftp://garbo.uwasa.fi/pc/docsoft/fpbibl18.zip;
http://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = acknj,
fjournal = "Elektronik",
}¬Äc
@Article{Tocher:1958:TMD,
author = "K. D. Tocher",
title = "Techniques of Multiplication and Division for
Automatic Binary Computers",
journal = jQˆx‘q
@Article{Tisseur:2001:NMF,
author = "Fran{\c{c}}oise Tisseur",
title = "{Newton}'s Method in Floating Point Arithmetic and
Iterative Refinement of Generalized Eigenvalue
Problems",
journal = jSIAMJMATANAAPPL,
volume = "22",
number = "4",
pages = "10381057",
month = "????",
year = "2001",
CODEN = "SJMAEL",
DOI = "http://dx.doi.org/10.1137/S08954798993598™‰’#
@Article{Timme