Search All Articles

Search by:
An RNS Comparator via Dynamic Range Partitioning: The Case of {2^n - 1, 2^n, 2^(n+1) -1}
Implementation of Efficient Modulo 2n+1 Squarer for {2n-1, 2n, 2n+1} Based Residue Number System
Efficient Modular Binary Signed-Digit Multiplier for the moduli set {(2^n) -1, 2^n, (2^n) +1}
A Modulo (2^n)+1 Multiplier with Faithful Representation of Residues
An Efficient OHR Subtractor Circuit
A One-Step Modulo 2^n+1 Adder Based on Double-lsb Representation of Residues