English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 58317/91854 (63%)
造访人次 : 14017539      在线人数 : 95
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/60812

    题名: A Radix-4 New Svota-Tung Divider with Constant Timing Complexity for Precsaling
    作者: 江正雄;Chiang, Jen-shiun;Tsai, Min-show
    贡献者: 淡江大學電機工程學系
    关键词: computer arithmetic;floating-point division;new Svoboda-Tung;division;prescaling;radix-4;signed digit number system;Svoboda-Tung division
    日期: 2003-01
    上传时间: 2011-10-15 00:55:09 (UTC+8)
    摘要: A new floating-point division architecture that complies with the IEEE 754-1985 standard is proposed in this paper. This architecture is based on the New Svoboda-Tung (NST) division algorithm and the radix-4 MROR (maximally redundant maximally recoded) signed digit number system. In NST division, the divisor and dividend must be prescaled. We summarize a general systematic method to accomplish the prescaling, and we also propose a hardware scheme such that the timing complexity is constant regardless of the bit length of the divisor. For the divider implementation, a new MROR signed digit adder with carry free characteristic is proposed for addition and subtraction, and this adder can improve the cycle time significantly. A 32-b/32-b radix-4 divider is thus designed in Verilog HDL; the simulation results show that this architecture is implementable using currently available libraries. The hardware complexity and performance of this divider is competitive with conventional SRT dividers.
    關聯: Kluwer Journal of VLSI Signal Processing 33(1/2), pp.117-124
    DOI: 10.1023/A:1021150020008
    显示于类别:[電機工程學系暨研究所] 期刊論文


    档案 大小格式浏览次数



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈