Lei Li, Jianhao Hu, Ao Siyuan
Abstract
(2n-1) is one of the most commonly used moduli in Residue Number Systems.In the paper we propose a novel Booth encoding architecture.Based on the proposed booth encoding architecture,we can design high speed and high-efficient modulo(2n-1) multipliers,which are the fastest among all known modulo(2n-1) multipliers.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
(2n-1) is one of the most commonly used moduli in Residue Number Systems.In the paper we propose a novel Booth encoding architecture.Based on the proposed booth encoding architecture,we can design high speed and high-efficient modulo(2n-1) multipliers,which are the fastest among all known modulo(2n-1) multipliers.
Key concepts: Modulo, Computer science, Residue number system, Modulo operation, Architecture, Arithmetic, Encoding (memory), Parallel computing