使用部分表查找实现级别索引算法

1987 IEEE 8th Symposium on Computer Arithmetic (ARITH) Pub Date : 1987-05-18 DOI:10.1109/ARITH.1987.6158709

F. Olver, P. Turner

{"title":"使用部分表查找实现级别索引算法","authors":"F. Olver, P. Turner","doi":"10.1109/ARITH.1987.6158709","DOIUrl":null,"url":null,"abstract":"This paper is concerned with finding fast efficient algorithms for performing level-index arithmetic. The approach used combines the advantages of parallel processing with the use of table look-up. The latter is used only for short words and the result is a potential implementation with ℓi operation times comparable with floating-point long multiplications.","PeriodicalId":424620,"journal":{"name":"1987 IEEE 8th Symposium on Computer Arithmetic (ARITH)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Implementation of level-index arithmetic using partial table look-up\",\"authors\":\"F. Olver, P. Turner\",\"doi\":\"10.1109/ARITH.1987.6158709\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is concerned with finding fast efficient algorithms for performing level-index arithmetic. The approach used combines the advantages of parallel processing with the use of table look-up. The latter is used only for short words and the result is a potential implementation with ℓi operation times comparable with floating-point long multiplications.\",\"PeriodicalId\":424620,\"journal\":{\"name\":\"1987 IEEE 8th Symposium on Computer Arithmetic (ARITH)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1987 IEEE 8th Symposium on Computer Arithmetic (ARITH)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1987.6158709\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1987 IEEE 8th Symposium on Computer Arithmetic (ARITH)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1987.6158709","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 19

摘要

本文的目的是寻找快速有效的算法来执行水平索引算法。所使用的方法结合了并行处理和表查找的优点。后者仅用于较短的单词，其结果是一个潜在的实现，其运算时间可与浮点长乘法相媲美。

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

查看原文本刊更多论文

Implementation of level-index arithmetic using partial table look-up

This paper is concerned with finding fast efficient algorithms for performing level-index arithmetic. The approach used combines the advantages of parallel processing with the use of table look-up. The latter is used only for short words and the result is a potential implementation with ℓi operation times comparable with floating-point long multiplications.

求助全文

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

来源期刊

1987 IEEE 8th Symposium on Computer Arithmetic (ARITH)

自引率

0.00%

发文量