PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Barsi F. Mod m arithmetic in binary systems. In: Information Processing Letters, vol. 40 (6) pp. 303 - 309. Elsevier, 1991.
 
 
Abstract
(English)
Even if tbe most common approach to mod m arithmetic is based on look-up tables, tbe use of binary systems is valid in those situations, such as large-moduil residue arithmetic or conversion processes, where a memory approach is not viable. A general approach to the problem of performing mod m computations in binary systems is presented. The proposed solution proves useful in various applications, such as converting binary integers to residue notation and mod m addition or multiplication. Examples are given together with possible VLSI implementations.
Subject Computational Complexity
computer architecture
modular arithmetic
residue arithmetic
VLSI complexity


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional