联机除法装置的设计

Proceedings of 9th Symposium on Computer Arithmetic Pub Date : 1989-09-06 DOI:10.1109/ARITH.1989.72808

P. Tu, M. Ercegovac

{"title":"联机除法装置的设计","authors":"P. Tu, M. Ercegovac","doi":"10.1109/ARITH.1989.72808","DOIUrl":null,"url":null,"abstract":"A gate array implementation of a radix-2 floating-point online division algorithm is presented. The design requires 111 equivalent gates per bit and has a cycle time of 24 ns. For 8-b exponent and 24-b mantissa, the design requires 2497 equivalent gates and can fit on an LSI Logic LL9320P chip with a utilization factor 78%.<<ETX>>","PeriodicalId":305909,"journal":{"name":"Proceedings of 9th Symposium on Computer Arithmetic","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Design of on-line division unit\",\"authors\":\"P. Tu, M. Ercegovac\",\"doi\":\"10.1109/ARITH.1989.72808\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A gate array implementation of a radix-2 floating-point online division algorithm is presented. The design requires 111 equivalent gates per bit and has a cycle time of 24 ns. For 8-b exponent and 24-b mantissa, the design requires 2497 equivalent gates and can fit on an LSI Logic LL9320P chip with a utilization factor 78%.<<ETX>>\",\"PeriodicalId\":305909,\"journal\":{\"name\":\"Proceedings of 9th Symposium on Computer Arithmetic\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 9th Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1989.72808\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 9th Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1989.72808","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

提出了一种基于门阵列的基数-2浮点在线除法算法。该设计要求每比特111个等效门，周期时间为24 ns。对于8b指数和24b尾数，该设计需要2497个等效门，可以在利用率为78%的LSI Logic LL9320P芯片上安装

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

查看原文本刊更多论文

Design of on-line division unit

A gate array implementation of a radix-2 floating-point online division algorithm is presented. The design requires 111 equivalent gates per bit and has a cycle time of 24 ns. For 8-b exponent and 24-b mantissa, the design requires 2497 equivalent gates and can fit on an LSI Logic LL9320P chip with a utilization factor 78%.<>

求助全文

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

来源期刊

Proceedings of 9th Symposium on Computer Arithmetic

CiteScore

2.40

自引率

0.00%

发文量