Cart (Loading....) | Create Account
Close category search window
 

Parallel computation of residue number system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chang, C.-C. ; Dept. of Inf. Eng. & Comput. Sci., Feng Chia Univ., Taichung, Taiwan ; Kuo, Y.T. ; Lai, Y.P.

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.

Published in:

Computing & Informatics, 2006. ICOCI '06. International Conference on

Date of Conference:

6-8 June 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.