Designing multioperand modular adders

摘要

The problem of designing efficient multioperand modular adders is 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|/sub m/ within a logarithmic time.