Search All Articles

Search by:
An RNS Comparator via Dynamic Range Partitioning: The Case of {2^n - 1, 2^n, 2^(n+1) -1}
Zeinab Torabi • Armin Belghadr
Keywords: Computer Arithmetic • Residue Number System • Difficult Operations • Dynamic Range Partitioning • Comparison
Implementation of Efficient Modulo 2n+1 Squarer for {2n-1, 2n, 2n+1} Based Residue Number System
Horialsadat Hossein Sajedi • Keivan Navi • Ali Jalali
Keywords: Modulo Squarer • Multiplier • Residue Arithmetic • Residue Number System
Efficient Modular Binary Signed-Digit Multiplier for the moduli set {(2^n) -1, 2^n, (2^n) +1}
Maryam Saremi • Somayeh Timarchi
Keywords: Digital Computer Arithmetic • Residue Number System (RNS) • Binary Signed-Digit (BSD) Number Representation • Carry Free Addition • Modular Multiplier
A Modulo (2^n)+1 Multiplier with Faithful Representation of Residues
Ghassem Jaberipur • Hanieh Alavi • Saeed Nejati
Keywords: Modular Multiplier • Residue Number System • Double-Lsb Encoding
An Efficient OHR Subtractor Circuit
Mansoureh Labafniya • Mohammad Eshghi
Keywords: One Hot • Modular Subtract • Residue Number System • Arithmetic Operation
A One-Step Modulo 2^n+1 Adder Based on Double-lsb Representation of Residues
Ghassem Jaberipur
Keywords: Residue number system • Modulo 2^n+1 addition • Double-lsb representation • Diminished-1 number representation • Parallel prefix adders • Generic adders
About Journal
Editorial Board
Guide For Authors
Submit Your Manuscript
Latest Issue
Past Issues
© Copyright - The CSI Journal on Computer Science and Engineering
Produced by Intelligent Information Solutions Center