On implementing the CRT in residue arithmetic

Abstract

Fast and efficient implementation of a residue number to integer converters will be required to design fast residue number systems. This paper addresses the question of hardware implementation and presents several distinctly different supporting archi- tectures. Both designs are analyzed and compared in terms of their speed-complexity tradeoffs.

Keywords:

• Residue arithmetic
• parallel processing
• Chinese remainder theorem (CRT)

C.R. Categories:

• Parallel processing
• modula (residue) arithmetic
• numbering systems
• computer arithmetic