PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Barsi F. Residue arithmetic in binary systems. Progetto finalizzato materiali e dispositivi per l'elettronica a stato solido. Internal note IEI-B4-37, 1988.
 
 
Abstract
(English)
A natural approach to the problem of performing mod m computations in a binary system is presented and a solution is suggested which is based upon a straightforward relation between the residues of a same integer X with respect to different moduli. The proposed solution proves fruitful in various applications, such as converting binary integers to residue notation and mod m addition or multiplication. Even if the most usual implementation approach for mod m processors is based on look-up tables, the use of a binary number system keeps its validity those situations, such as large-moduli residue arithmetic or conversion processes, where a memory approach is not viable. Moreover, VLSI area-time complexity aspects are considered for the presented applications and constructive proofs are given showing that the complexities of mod m and binary addition/multiplication structures coincide.
Subject Addition
Binary number system
Conversion
Multiplication
Residue Number Systems
VLSI design
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