定斜线有理算法的可行性分析

1978 IEEE 4th Symposium onomputer Arithmetic (ARITH) Pub Date : 1978-10-01 DOI:10.1109/ARITH.1978.6155784

Peter Kornerup, D. Matula

{"title":"定斜线有理算法的可行性分析","authors":"Peter Kornerup, D. Matula","doi":"10.1109/ARITH.1978.6155784","DOIUrl":null,"url":null,"abstract":"An investigation of the feasibility of a finite precision approximate rational arithmetic based on fixed-slash representation of rational numbers is presented. Worst-case and average-case complexity analyses of the involved rounding algorithm (an extended shift-subtract gcd algorithm) are presented. The results are applied to a proposed hardware realization of a fixed-slash arithmetic unit.","PeriodicalId":443215,"journal":{"name":"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A feasibility analysis of fixed-slash rational arithmetic\",\"authors\":\"Peter Kornerup, D. Matula\",\"doi\":\"10.1109/ARITH.1978.6155784\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An investigation of the feasibility of a finite precision approximate rational arithmetic based on fixed-slash representation of rational numbers is presented. Worst-case and average-case complexity analyses of the involved rounding algorithm (an extended shift-subtract gcd algorithm) are presented. The results are applied to a proposed hardware realization of a fixed-slash arithmetic unit.\",\"PeriodicalId\":443215,\"journal\":{\"name\":\"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1978.6155784\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1978.6155784","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

研究了基于有理数固定斜线表示的有限精度近似有理数算法的可行性。给出了所涉及的舍入算法(一种扩展的移位-减去gcd算法)的最坏情况和平均情况复杂度分析。这些结果被应用到一个固定斜线算术单元的硬件实现中。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A feasibility analysis of fixed-slash rational arithmetic

An investigation of the feasibility of a finite precision approximate rational arithmetic based on fixed-slash representation of rational numbers is presented. Worst-case and average-case complexity analyses of the involved rounding algorithm (an extended shift-subtract gcd algorithm) are presented. The results are applied to a proposed hardware realization of a fixed-slash arithmetic unit.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)

自引率

0.00%

发文量