{"title":"智能嵌入式系统的高速SRT分频器","authors":"Bhavana Mehta, Jonti Talukdar, S. Gajjar","doi":"10.1109/ICSOFTCOMP.2017.8280077","DOIUrl":null,"url":null,"abstract":"Increasing development in embedded system, VLSI and processor design have given rise to increased demands from the system in terms of power, speed, area, throughput etcetera. Most of the sophisticated embedded system applications consist of processors; which now need an arithmetic unit with the ability to execute complex division operations with maximum efficiency. Hence the speed of the arithmetic unit is critically dependent on division operation. Most of the dividers use the SRT division algorithm for division. In IoT and other embedded applications typically radix 2 and radix 4 division algorithms are used. The proposed algorithm lies on parallel execution of various steps so as to reduce time critical path, use fuzzy logic to solve the overlap problem in quotient selection; hence reducing maximum delay and increasing the accuracy. Every logical circuit has a maximum delay on which the timing of the circuit is dependent and the path, causing the maximum delay is known as the critical path. Our approach uses the previous SRT algorithm methods to make a highly parallel pipelined design and use Mamdani model to determine a solution to the overlapping problem to reduce the overall execution time of radix 4 SRT division on 64 bits double precision floating point numbers to 281ns. The design is made using Bluespec System Verilog, synthesized and simulated using Vivado v.2016.1 and implemented on Xilinx VirtexUltraScale FPGA board.","PeriodicalId":118765,"journal":{"name":"2017 International Conference on Soft Computing and its Engineering Applications (icSoftComp)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"High speed SRT divider for intelligent embedded system\",\"authors\":\"Bhavana Mehta, Jonti Talukdar, S. Gajjar\",\"doi\":\"10.1109/ICSOFTCOMP.2017.8280077\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Increasing development in embedded system, VLSI and processor design have given rise to increased demands from the system in terms of power, speed, area, throughput etcetera. Most of the sophisticated embedded system applications consist of processors; which now need an arithmetic unit with the ability to execute complex division operations with maximum efficiency. Hence the speed of the arithmetic unit is critically dependent on division operation. Most of the dividers use the SRT division algorithm for division. In IoT and other embedded applications typically radix 2 and radix 4 division algorithms are used. The proposed algorithm lies on parallel execution of various steps so as to reduce time critical path, use fuzzy logic to solve the overlap problem in quotient selection; hence reducing maximum delay and increasing the accuracy. Every logical circuit has a maximum delay on which the timing of the circuit is dependent and the path, causing the maximum delay is known as the critical path. Our approach uses the previous SRT algorithm methods to make a highly parallel pipelined design and use Mamdani model to determine a solution to the overlapping problem to reduce the overall execution time of radix 4 SRT division on 64 bits double precision floating point numbers to 281ns. The design is made using Bluespec System Verilog, synthesized and simulated using Vivado v.2016.1 and implemented on Xilinx VirtexUltraScale FPGA board.\",\"PeriodicalId\":118765,\"journal\":{\"name\":\"2017 International Conference on Soft Computing and its Engineering Applications (icSoftComp)\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Soft Computing and its Engineering Applications (icSoftComp)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSOFTCOMP.2017.8280077\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Soft Computing and its Engineering Applications (icSoftComp)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSOFTCOMP.2017.8280077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
摘要
随着嵌入式系统、超大规模集成电路和处理器设计的不断发展,对系统在功率、速度、面积、吞吐量等方面提出了越来越高的要求。大多数复杂的嵌入式系统应用程序由处理器组成;现在需要一个能够以最高效率执行复杂除法运算的算术单元。因此,算术单元的速度严重依赖于除法运算。大多数除法使用SRT除法算法进行除法。在物联网和其他嵌入式应用中,通常使用基数2和基数4除法算法。该算法通过并行执行各步骤以减少时间关键路径,利用模糊逻辑解决商选择中的重叠问题;因此减少了最大延迟,提高了精度。每个逻辑电路都有一个最大延迟,电路的时序依赖于此,导致最大延迟的路径称为关键路径。我们的方法使用之前的SRT算法方法进行高度并行的流水线设计,并使用Mamdani模型确定重叠问题的解决方案,从而将64位双精度浮点数上的基数4 SRT除法的总执行时间减少到281ns。本设计采用Bluespec System Verilog进行设计,使用Vivado v.2016.1进行综合仿真,并在Xilinx VirtexUltraScale FPGA板上实现。
High speed SRT divider for intelligent embedded system
Increasing development in embedded system, VLSI and processor design have given rise to increased demands from the system in terms of power, speed, area, throughput etcetera. Most of the sophisticated embedded system applications consist of processors; which now need an arithmetic unit with the ability to execute complex division operations with maximum efficiency. Hence the speed of the arithmetic unit is critically dependent on division operation. Most of the dividers use the SRT division algorithm for division. In IoT and other embedded applications typically radix 2 and radix 4 division algorithms are used. The proposed algorithm lies on parallel execution of various steps so as to reduce time critical path, use fuzzy logic to solve the overlap problem in quotient selection; hence reducing maximum delay and increasing the accuracy. Every logical circuit has a maximum delay on which the timing of the circuit is dependent and the path, causing the maximum delay is known as the critical path. Our approach uses the previous SRT algorithm methods to make a highly parallel pipelined design and use Mamdani model to determine a solution to the overlapping problem to reduce the overall execution time of radix 4 SRT division on 64 bits double precision floating point numbers to 281ns. The design is made using Bluespec System Verilog, synthesized and simulated using Vivado v.2016.1 and implemented on Xilinx VirtexUltraScale FPGA board.