Principles of Recursive Residue Number System Computation

A.L., STEMPKOVSKY and D.V., TELPUKHOV, and E.S., BALAKA and R.A., SOLOVYEV and T.Y., ISAEVA and V.M., AMERBAEV (2014) Principles of Recursive Residue Number System Computation. In: International Conference on Advances In Computing, Electronics and Electrical Technology CEET 2014, 02 - 03 August, 2014, Kuala Lumpur, Malaysia.

[img]
Preview
Text
20150609_053134.pdf - Published Version

Download (744kB) | Preview
Official URL: https://www.seekdl.org/conferences/paper/details/3...

Abstract

New method is proposed which is based on the idea of expressing system of residue numbers of traditional Residue Number System (RNS) using lower dimension system of sub-moduli. This new recursive data representation allows eliminating some of the known drawbacks of RNS arithmetic. Despite the constraints imposed on moduli sets, the proposed method provides speed gain, as experiments show, and it can be used in parallel high speed computing devices.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Residue Number System, Residue arithmetic, Chinese Remainder Theorem
Depositing User: Mr. John Steve
Date Deposited: 27 May 2019 12:13
Last Modified: 27 May 2019 12:13
URI: http://publications.theired.org/id/eprint/2808

Actions (login required)

View Item View Item