Parallel computational algorithms for generalized Chinese remainder theorem

Recently, the residue number system (RNS) has been intensively studied. The Chinese remainder theorem (CRT) is a solution to the conversion problem of a number to RNS with a general moduli set. This paper introduces the generalized CRT (GCRT) with parallel algorithms used for the conversion. The GCRT differs from the CRT because it has the advantage of having more applications than does the CRT. The GCRT, however, has a disadvantage in computational performance. To remedy this shortcoming, this paper proposes algorithms that calculate concurrently for some non-related program fragments of GCRT computation. These proposed algorithms also allow the GCRT to compute more efficiently.