Fast parallel-prefix modulo 2(n)+1 adders
Modulo 2(n) + 1 adders find great applicability in several applications including RNS implementations and cryptography. In this paper, we present two novel architectures for designing modulo 2(n) + 1 adders, based on parallel-prefix carry computation units. The first architecture utilizes a fast carry increment stage, whereas the second is a totally parallel-prefix solution. CMOS implementations reveal the superiority of the resulting adders against previously reported solutions in terms of implementation area and execution latency.
rns binary adders modulo 2(n)+1 arithmetic parallel-prefix adders