Seamlessly Pipelined Shift-and-Add Circuits Based on Precise Delay Analysis and Its Applications

Tso-Bing Juang, Ying-Ren Lee
{"title":"Seamlessly Pipelined Shift-and-Add Circuits Based on Precise Delay Analysis and Its Applications","authors":"Tso-Bing Juang, Ying-Ren Lee","doi":"10.1109/ISVLSI.2016.49","DOIUrl":null,"url":null,"abstract":"Shift-add/subtract circuits constitute the basic building blocks of several frequently used complex arithmetic units such as multiple constant multipliers, exponentiation circuits, fast division circuits, CORDIC rotators, logarithmic and residue number conversation units, etc. Fine-grained pipelined designs of these arithmetic units have strong potential to improve the power-performance-reliability profile of several compute-intensive and constraint-driven applications like digital signal processing, cryptography, and communication. Efficient pipelining of these circuits therefore requires precise analysis of propagation delay of its basic blocks like shift-add/subtract circuits and connected shift-add arrays. Moreover, careful pipelining of shift-add/subtract circuits has strong potential to enhance the throughput of complex arithmetic units where they are embodied. In this paper, we derive seamlessly pipelined shift-add/subtract circuits to achieve a desired critical path delay based on the throughput requirement of the embodying arithmetic units and application environment. We aim at providing a brief demonstration of how the pipelined shift-add/subtract circuits could used to enhance the performance and reduce power consumption of some typical constraint-driven computations. It has been observed that shift-add based logarithmic/antilogarithmic converters achieve area-efficient and high-performance inter-conversion between binary numbers and logarithmic numbers with low approximation errors to be used efficiently for logarithmic number system (LNS)-based computations. In this paper, we show that the use of seamlessly pipelined shift-adds/subtract circuits provide remarkable improvement of logarithmic/antilogarithmic converters over the conventional ones, and can be used in the LNS-based computing system to boost the performance and reduce the overall energy consumption. We have also shown how throughput rate of high-precision exponentiation circuits can be enhanced by seamlessly pipelined shift-add circuits for cryptographic applications.","PeriodicalId":140647,"journal":{"name":"2016 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVLSI.2016.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Shift-add/subtract circuits constitute the basic building blocks of several frequently used complex arithmetic units such as multiple constant multipliers, exponentiation circuits, fast division circuits, CORDIC rotators, logarithmic and residue number conversation units, etc. Fine-grained pipelined designs of these arithmetic units have strong potential to improve the power-performance-reliability profile of several compute-intensive and constraint-driven applications like digital signal processing, cryptography, and communication. Efficient pipelining of these circuits therefore requires precise analysis of propagation delay of its basic blocks like shift-add/subtract circuits and connected shift-add arrays. Moreover, careful pipelining of shift-add/subtract circuits has strong potential to enhance the throughput of complex arithmetic units where they are embodied. In this paper, we derive seamlessly pipelined shift-add/subtract circuits to achieve a desired critical path delay based on the throughput requirement of the embodying arithmetic units and application environment. We aim at providing a brief demonstration of how the pipelined shift-add/subtract circuits could used to enhance the performance and reduce power consumption of some typical constraint-driven computations. It has been observed that shift-add based logarithmic/antilogarithmic converters achieve area-efficient and high-performance inter-conversion between binary numbers and logarithmic numbers with low approximation errors to be used efficiently for logarithmic number system (LNS)-based computations. In this paper, we show that the use of seamlessly pipelined shift-adds/subtract circuits provide remarkable improvement of logarithmic/antilogarithmic converters over the conventional ones, and can be used in the LNS-based computing system to boost the performance and reduce the overall energy consumption. We have also shown how throughput rate of high-precision exponentiation circuits can be enhanced by seamlessly pipelined shift-add circuits for cryptographic applications.
基于精确延迟分析的无缝流水线移加电路及其应用
移位加减电路构成了几种常用的复杂算术单元的基本构件,如多常数乘法器、幂运算电路、快速除法电路、CORDIC旋转器、对数和余数会话单元等。这些算术单元的细粒度流水线设计具有强大的潜力,可以改善一些计算密集型和约束驱动的应用程序(如数字信号处理、密码学和通信)的功率-性能-可靠性配置文件。因此,这些电路的高效流水线需要精确分析其基本块(如移位加/减电路和连接的移位加阵列)的传播延迟。此外,移位加/减法电路的谨慎流水线化具有强大的潜力,可以提高包含它们的复杂算术单元的吞吐量。在本文中,我们根据具体运算单元的吞吐量要求和应用环境,推导了无缝流水线的移位加/减电路,以实现所需的关键路径延迟。我们的目标是提供一个简短的演示,说明如何使用流水线移位加/减电路来提高性能并降低一些典型的约束驱动计算的功耗。已经观察到基于移位加的对数/反对数转换器实现了二进制数和对数数之间的面积高效和高性能的相互转换,具有低近似误差,可以有效地用于基于对数系统(LNS)的计算。在本文中,我们证明了无缝流水线移位加/减电路的使用比传统的对数/反对数转换器提供了显着的改进,并且可以用于基于lns的计算系统中,以提高性能并降低总体能耗。我们还展示了高精度幂运算电路的吞吐率是如何通过无缝流水线的移位加电路来提高的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信