浮点除法加融合体系结构的设计与实现

Kuldeep Pande, A. Parkhi, S. Jaykar, A. Peshattiwar
{"title":"浮点除法加融合体系结构的设计与实现","authors":"Kuldeep Pande, A. Parkhi, S. Jaykar, A. Peshattiwar","doi":"10.1109/CSNT.2015.179","DOIUrl":null,"url":null,"abstract":"Many Floating Point operations have been acknowledged to be useful for many real time graphic and multimedia application as well as DSP processors. Many Digital Signal Processing algorithms use Floating point arithmetic, which requires millions of calculations per second to be performed. For such stringent requirements, design of fast, precise and efficient circuits is the goal. This brief presents a dedicated unit for the combined operation of floating-point (FP) division followed byaddition/subtraction -- the divide -- add fused (DAF). The goal of this unit is to increase the performance and the accuracy of applications where this combined operation is frequent, such as the interval Newton's method or the polynomial approximation. The proposed DAF unit presents a similar architecture to the FP multiply accumulateunits. The main difference is represented by the divider, which is implemented using digit-recurrence algorithms. An important design trade off regarding DAFis represented by the number of required quotient bits. We present the impact of the adopted number of quotient bits on accuracy, cost, and performance. We show that the proposed implementations have better accuracy with respect to the solution based on two distinct units: an FP divider and an FP adder. This implementation is suitable for lower latency, accuracy and best cost-performance trade off. The proposed unit is synthesized for4vfx60ff672-12 Xilinx Spartan-6 FPGA.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Design and Implementation of Floating Point Divide-Add Fused Architecture\",\"authors\":\"Kuldeep Pande, A. Parkhi, S. Jaykar, A. Peshattiwar\",\"doi\":\"10.1109/CSNT.2015.179\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many Floating Point operations have been acknowledged to be useful for many real time graphic and multimedia application as well as DSP processors. Many Digital Signal Processing algorithms use Floating point arithmetic, which requires millions of calculations per second to be performed. For such stringent requirements, design of fast, precise and efficient circuits is the goal. This brief presents a dedicated unit for the combined operation of floating-point (FP) division followed byaddition/subtraction -- the divide -- add fused (DAF). The goal of this unit is to increase the performance and the accuracy of applications where this combined operation is frequent, such as the interval Newton's method or the polynomial approximation. The proposed DAF unit presents a similar architecture to the FP multiply accumulateunits. The main difference is represented by the divider, which is implemented using digit-recurrence algorithms. An important design trade off regarding DAFis represented by the number of required quotient bits. We present the impact of the adopted number of quotient bits on accuracy, cost, and performance. We show that the proposed implementations have better accuracy with respect to the solution based on two distinct units: an FP divider and an FP adder. This implementation is suitable for lower latency, accuracy and best cost-performance trade off. The proposed unit is synthesized for4vfx60ff672-12 Xilinx Spartan-6 FPGA.\",\"PeriodicalId\":334733,\"journal\":{\"name\":\"2015 Fifth International Conference on Communication Systems and Network Technologies\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Fifth International Conference on Communication Systems and Network Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSNT.2015.179\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Fifth International Conference on Communication Systems and Network Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNT.2015.179","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

许多浮点运算已被公认为对许多实时图形和多媒体应用程序以及DSP处理器非常有用。许多数字信号处理算法使用浮点运算,这需要每秒执行数百万次计算。对于这样严格的要求,设计快速、精确、高效的电路是目标。本文介绍了一种用于浮点(FP)除法和加减法联合操作的专用单元——除法加融合(DAF)。本单元的目标是提高频繁使用这种组合操作的应用程序的性能和准确性,例如区间牛顿方法或多项式近似。所提出的DAF单元呈现出与FP乘法累加单元相似的体系结构。主要的区别是由除法表示的,它是用数字递归算法实现的。关于dafi的一个重要的设计权衡是由所需商位的数量表示的。我们提出了采用的商位数对精度、成本和性能的影响。我们表明,所提出的实现相对于基于两个不同单元的解决方案具有更好的准确性:一个FP除法器和一个FP加法器。这种实现适合于较低的延迟、准确性和最佳的性价比权衡。该单元是在4vfx60ff672-12 Xilinx Spartan-6 FPGA上合成的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design and Implementation of Floating Point Divide-Add Fused Architecture
Many Floating Point operations have been acknowledged to be useful for many real time graphic and multimedia application as well as DSP processors. Many Digital Signal Processing algorithms use Floating point arithmetic, which requires millions of calculations per second to be performed. For such stringent requirements, design of fast, precise and efficient circuits is the goal. This brief presents a dedicated unit for the combined operation of floating-point (FP) division followed byaddition/subtraction -- the divide -- add fused (DAF). The goal of this unit is to increase the performance and the accuracy of applications where this combined operation is frequent, such as the interval Newton's method or the polynomial approximation. The proposed DAF unit presents a similar architecture to the FP multiply accumulateunits. The main difference is represented by the divider, which is implemented using digit-recurrence algorithms. An important design trade off regarding DAFis represented by the number of required quotient bits. We present the impact of the adopted number of quotient bits on accuracy, cost, and performance. We show that the proposed implementations have better accuracy with respect to the solution based on two distinct units: an FP divider and an FP adder. This implementation is suitable for lower latency, accuracy and best cost-performance trade off. The proposed unit is synthesized for4vfx60ff672-12 Xilinx Spartan-6 FPGA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信