Generic design of Chinese remaindering schemes

Details Generic design of Chinese remaindering schemes Generic design of Chinese remaindering schemes

2010-01-23

arxiv.org/abs/1001.4150v1

Computer Science

Symbolic Computation

Scientific paper

We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a radix ladder, for the intermediate storage and computations. Our design is structured into three main modules: a black box residue computation in charge of computing each residue; a Chinese remaindering controller in charge of launching the computation and of the termination decision; an integer builder in charge of the reconstruction computation. We then show that this design enables many different forms of Chinese remaindering (e.g. deterministic, early terminated, distributed, etc.), easy comparisons between these forms and e.g. user-transparent parallelism at different parallel grains.

Affiliated with

Also associated with

No associations

Rating

Generic design of Chinese remaindering schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generic design of Chinese remaindering schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generic design of Chinese remaindering schemes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-514958