• Home
  • moduli set {2n-1
    • List of Articles moduli set {2n-1

      • Open Access Article

        1 - Provide Efficient and Speed Method for Detecting Overflow in Module Set {2^n-1 ,2^n,2^n+1}
        Marzieh Sadat Amir shakermi Mehdi Hossein zadeh ALI Astaneh Asl
        Nowadays, due to advances in technology and information technology fast processing of data is a growing need. Residue Number System is an unconventional and non-Weighted System that parallel computing on remainders of dividing number on several modules is performed. The More
        Nowadays, due to advances in technology and information technology fast processing of data is a growing need. Residue Number System is an unconventional and non-Weighted System that parallel computing on remainders of dividing number on several modules is performed. The computations are performed cause to increase the speed of computing and reduce the power consumption. One of the problems in this system is published overflow that due to the modular operations and nature of non-weighting numbers. In order to solve this problem in many cases using to binary number system converter and convert the number to the weighted numbers to comparison and overflow detection is necessary. In this article, the novel methods to improve the detection of overflow in moduli set {2n-1, 2n, 2n+1} without doing a full comparison and need the reverse convert process. Also The proposed method is compared with previous approaches, in addition to fewer hardware components, the delay is very low. Manuscript profile