A Booth-like modulo operator

In this paper, a Booth-like modulo algorithm is proposed. A hardware architecture that implements the proposed algorithm is also suggested. The proposed algorithm can calculate the modulo of positive and negative numbers in a varying number of clock cycles that is always less than or equal to the nu...

Full description

Saved in:
Bibliographic Details
Published in2015 IEEE 58th International Midwest Symposium on Circuits and Systems (MWSCAS) pp. 1 - 4
Main Authors Hassan, Firas, Magalini, Joao Lucas, de Campos Pentea, Victor, Carletta, Joan E.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2015
Subjects
Adders
Clocks
Encryption
Logic gates
Online AccessGet full text

Cover

More Information
Summary:In this paper, a Booth-like modulo algorithm is proposed. A hardware architecture that implements the proposed algorithm is also suggested. The proposed algorithm can calculate the modulo of positive and negative numbers in a varying number of clock cycles that is always less than or equal to the number of clock cycles used by traditional techniques such as binary dividers. Hardware simulation results on randomly generated 32-bit data show that the highest average number of clock cycles is less than 14.
ISSN:1548-3746
1558-3899
DOI:10.1109/MWSCAS.2015.7282082