Parallel computation of residue number system

Autor:	Chin-Chen Chang, Y.P. Lai, Y.T. Kuo
Rok vydání:	2006
Předmět:	Modular arithmetic Computer science Computation Parallel algorithm ComputerApplications_COMPUTERSINOTHERSYSTEMS Topology (electrical circuits) Ring network Algorithm design Parallel computing Residue number system Chinese remainder theorem Computer Science::Other
Zdroj:	2006 International Conference on Computing & Informatics.
DOI:	10.1109/icoci.2006.5276434
Popis:	Chinese remainder theorem (CRT), an old and famous theorem, is widely used in many modern computer applications. The computation of CRT contains many similar operations which can be implemented concurrently. Here, a parallel algorithm implemented on the ring topology is proposed to parallelize almost all the computations in CRT and J-conditions in this paper. Some recently proposed modular arithmetic operations are stated and employed to accelerate the computation.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::9adbb899b37dd7d9daf96c6f8754b136 https://doi.org/10.1109/icoci.2006.5276434 Zobrazit plný text záznamu