The problem of designing efficient multioperand modular adders ts approached. A carry-save adder tree is used allowing a response time lower than values in the literature, without restrictions regarding modules. Moreover it is shown that a structure such as the proposed one is suitable for evaluating X mod m within a logarithmic time.
Designing multioperand modular adders
ALIA, GIUSEPPE;
1996-01-01
Abstract
The problem of designing efficient multioperand modular adders ts approached. A carry-save adder tree is used allowing a response time lower than values in the literature, without restrictions regarding modules. Moreover it is shown that a structure such as the proposed one is suitable for evaluating X mod m within a logarithmic time.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.
