English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 58317/91854 (63%)
造訪人次 : 14018287      線上人數 : 149
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/52819


    題名: Carry-Free Radix-2 Subtractive Division Algorithm and Implementation of the Divider
    作者: 江正雄;Chiang, Jen-shiun;Chung, Hung-da;Tsai, Min-hsiu
    貢獻者: 淡江大學電機工程學系
    關鍵詞: Divider;radix-2;quotient bit;partial remainder;carry propagation delay;high speed;Svobota-Tung division algorithm;signed digit;prescaling;table look-up;on-the-fly conversion
    日期: 2000-12-01
    上傳時間: 2010-12-01 10:35:32 (UTC+8)
    出版者: 淡江大學
    摘要: A carry-free subtractive division algorithm is proposed in this paper. In the conventional subtractive divider, adders are used to find both quotient bit and partial remainder. Carries are usually generated in the addition operation, and it may take time to finish the operation, therefore, the carry propagation delay usually is a bottleneck of the conventional subtractive divider. In this paper, a carry-free scheme is proposed by using signed bit representation to represent both quotient and partial remainder. During the arithmetic operation, a special technique is used to decide the quotient bit, and the new partial remainder can be found further by a table lookup-like method. The signed bit format of the quotient can be converted by on-the-fly conversion to the binary representation. Based on this algorithm a 32-b/32-b divider is designed and implemented, and the simulation shows that the divider works well.
    關聯: 淡江理工學刊=Tamkang journal of science and engineering3(4),頁249-255
    DOI: 10.6180/jase.2000.3.4.03
    顯示於類別:[電機工程學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    1560-6686_3-4-3.pdf149KbAdobe PDF323檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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