A new method for converting numbers from a residue system to a binary notation is proposed which is based upon an original formulation of the Chinese Remainder Theorem. To prove its effectiveness in VLSI implementations a converter is presented and evaluated following a general VLSI model of computation. The proposed structure compares favourably with preceding results presented in the literature; in particular, the time which is required to perform conversion is O(log s), with s representing the total number of input bits.
A Fully Parallel Algorithm for Residue to Binary Conversion
BARSI, Ferruccio;PINOTTI, Maria Cristina
1994
Abstract
A new method for converting numbers from a residue system to a binary notation is proposed which is based upon an original formulation of the Chinese Remainder Theorem. To prove its effectiveness in VLSI implementations a converter is presented and evaluated following a general VLSI model of computation. The proposed structure compares favourably with preceding results presented in the literature; in particular, the time which is required to perform conversion is O(log s), with s representing the total number of input bits.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
