Over several years, RNS applications were limited to addition, subtraction and multiplication with results expected within a predetermined range because of the absence an explicit information on number magnitude in the residue representation. Hybrid notations have been proposed to overcome this obstacle. In this paper, an architecture for adding overflow checking is presented which is based Residue Systems Magnitude Index (RNS with MI) and its area-time complexity is evaluated. It is shown that considerable execution time reduction may result for a wide class of applications at cost of a slight increase of area occupancy as compared with binary realizations.
A VLSI architecture for RNS with MI adders
1989
Abstract
Over several years, RNS applications were limited to addition, subtraction and multiplication with results expected within a predetermined range because of the absence an explicit information on number magnitude in the residue representation. Hybrid notations have been proposed to overcome this obstacle. In this paper, an architecture for adding overflow checking is presented which is based Residue Systems Magnitude Index (RNS with MI) and its area-time complexity is evaluated. It is shown that considerable execution time reduction may result for a wide class of applications at cost of a slight increase of area occupancy as compared with binary realizations.| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_418165-doc_147581.pdf
accesso aperto
Descrizione: A VLSI architecture for RNS with MI adders
Dimensione
1.47 MB
Formato
Adobe PDF
|
1.47 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


