Title page for etd-0628114-155538


[Back to Results | New Search]

URN etd-0628114-155538
Author Yu-Shan Cheng
Author's Email Address No Public.
Statistics This thesis had been viewed 5577 times. Download 919 times.
Department Computer Science and Engineering
Year 2013
Semester 2
Degree Master
Type of Document
Language English
Title Parity Detection for Some Three-Modulus Residue Number System
Date of Defense 2014-06-12
Page Count 34
Keyword
  • parity detection technique
  • residue number system
  • Abstract The residue number system (RNS) can be applied to cryptography, image processing, digital filtering, parallel computation, and cloud computing. It represents a large integer using a set of smaller integers, so it has property of carry-free and parallel, and high-speed in addition, subtraction, and multiplication. However, the other RNS operations, such as number comparison, division, overflow detection, and sign detection is very difficult and needs significant amounts of time. With the parity detection technique, we can improve these operations to be efficiently.
     In this paper, we provide a parity detection method basic on residue number system using three-moduli set {2p-1,2p+1,2p^2-1}, where p is a positive integer. Given RNS representation of X = (x_1,x_2,x_3 ) based on the three-moduli set where x_1= X mod 2p-1, x_2= X mod 2p+1, x_3= X mod 2p^2-1. The parity of X is equals to the result of (x_1 + x_2 + x_3 + G(d)) mod 2 (0 means even, 1 means odd) where d=2p(x_2-x_1)+(2x_3-x_1-x_2), G(d)=1, if d < 2m_3 or d < 0; otherwise, G(d)=0.
    Advisory Committee
  • Chia-Mei Chen - chair
  • Chih-Hung Wang - co-chair
  • Chun-I Fan - co-chair
  • D. J. Guan - advisor
  • Files
  • etd-0628114-155538.pdf
  • indicate access worldwide
    Date of Submission 2014-07-28

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys