Self-timed shared division and square-root implementation using full redundant signed digit numbers

Young-Sang Lee, Jun-Woo Kang, L. Kim, Seung-Ho Hwang
{"title":"Self-timed shared division and square-root implementation using full redundant signed digit numbers","authors":"Young-Sang Lee, Jun-Woo Kang, L. Kim, Seung-Ho Hwang","doi":"10.1109/ICVC.1999.820995","DOIUrl":null,"url":null,"abstract":"A radix-2 square root implementation for self-timed dividers using redundant signed-digit (RSD) adders is presented. In this method, two self-timed RSD adder stages are used for each result bit selection. A very efficient and simple result bit selection logic compared to the previous designs is implemented by using double self-timed ring stages. The F-term in the RSD format is easily applied to two self-time substages. F-term generation is overlapped with a partial remainder calculation and result-bit selection. This makes the hardware implementation of the F-term generation much easier and less time-constraint. No additional time delay is included in the square-root arithmetic. From the SPICE simulation at 35/spl deg/C and under MOSIS 1.2 /spl mu/m design rule, the speed of this design is estimated to be 124 ns for 54 bit square-root and division calculation.","PeriodicalId":13415,"journal":{"name":"ICVC '99. 6th International Conference on VLSI and CAD (Cat. No.99EX361)","volume":"1 1","pages":"541-544"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICVC '99. 6th International Conference on VLSI and CAD (Cat. No.99EX361)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICVC.1999.820995","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A radix-2 square root implementation for self-timed dividers using redundant signed-digit (RSD) adders is presented. In this method, two self-timed RSD adder stages are used for each result bit selection. A very efficient and simple result bit selection logic compared to the previous designs is implemented by using double self-timed ring stages. The F-term in the RSD format is easily applied to two self-time substages. F-term generation is overlapped with a partial remainder calculation and result-bit selection. This makes the hardware implementation of the F-term generation much easier and less time-constraint. No additional time delay is included in the square-root arithmetic. From the SPICE simulation at 35/spl deg/C and under MOSIS 1.2 /spl mu/m design rule, the speed of this design is estimated to be 124 ns for 54 bit square-root and division calculation.
使用完全冗余有符号数字的自定时共享除法和平方根实现
提出了一种使用冗余带符号数加法器的自定时除法器的根-2平方根实现。在这种方法中,两个自定时RSD加法器阶段用于每个结果位选择。与以前的设计相比,通过使用双自定时环级实现了非常有效和简单的结果位选择逻辑。RSD格式中的f项很容易应用于两个自时子阶段。f项生成与部分余数计算和结果位选择重叠。这使得f项生成的硬件实现更容易,时间限制更少。在平方根算法中不包含额外的时间延迟。根据35/spl度/C和MOSIS 1.2 /spl mu/m设计规则下的SPICE模拟,该设计对于54位平方根和除法计算的速度估计为124 ns。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信