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}
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.