Systolic normalization of rational numbers

The authors present a systolic algorithm for normalization of rational numbers which is scalable to arbitrary length operands, and they discuss the possibility of implementing it within a rational arithmetic coprocessor for the use of computer algebra systems. A preliminary estimation shows that the performance for 32 bit operands is comparable to that of a fast RISC processor, but for long operands (e.g., 50 words) a significant speed-up (50 times) can be achieved.<
>