English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 13043640      Online Users : 237
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/5043

    Title: An Improvement of the High-Speed Division Algorithm for Residue Number System
    Authors: Jen-Ho Yang(楊仁和);Chien-Yuan Chen(陳建源);Chih-Hung Wang(王智弘)
    Contributors: Department of Information Engineering, I-Shou University
    Keywords: Residue Number System;Parallel and Carry-free Arithmetic;Division
    Date: 2002-05-16
    Issue Date: 2009-12-08 15:38:25 (UTC+8)
    Publisher: 亞洲大學
    Abstract: Residue Number System (RNS) has computational advantages for very large integer arithmetic because of its nature of parallel, carry free, and high-speed arithmetic. However, overflow detection, sign detection,relative-magnitude detection, and division in RNS are very difficult problems. In 1995, Hiasat and Zohdy proposed a high-speed division algorithm for RNS. Their algorithm computes the temporal quotient according to the highest powers in dividend and divisor. However, the temporal quotient is underestimated. In this paper, we improve Hiasat and Zohdy’s division algorithm in RNS by additionally dealing with the highest two bits of dividend and divisor. Our improvement reduces the number of execution rounds by 25%.
    Relation: 第十二屆全國資訊安全會議 273-276
    Appears in Collections:[行動商務與多媒體應用學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    310904400-5043.doc39KbMicrosoft Word189View/Open

    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback