By Topic

A ultra fast Euclidean division algorithm for prime memory systems

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

1 Author(s)
de Dinechin, B.D. ; CEA, Centre d'Etudes de Limeil-Valenton, France

A fast way of computing quotients and remainders by numbers belonging to the class 2n ± 1 has been presented, and the related hardware implementations described. The main interest of this technique lies in its applications to address skewing and address mapping in parallel memory systems. Although the proposed implementations are based on two input adders, the basic principles can be extended in a straigthforward manner to three input adders, allowing even faster modular reduction / division circuits to be assembled.

Published in:

Supercomputing, 1991. Supercomputing '91. Proceedings of the 1991 ACM/IEEE Conference on

Date of Conference:

18-22 Nov. 1991