[图书][B] Residue number systems: theory and implementation
AR Omondi, AB Premkumar - 2007 - books.google.com
Residue number systems (RNSs) and arithmetic are useful for several reasons. First, a great
deal of computing now takes place in embedded processors, such as those found in mobile …
deal of computing now takes place in embedded processors, such as those found in mobile …
Number systems for deep neural network architectures: a survey
Deep neural networks (DNNs) have become an enabling component for a myriad of artificial
intelligence applications. DNNs have shown sometimes superior performance, even …
intelligence applications. DNNs have shown sometimes superior performance, even …
Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications
G Bertoni, J Guajardo, S Kumar, G Orlando… - Topics in Cryptology …, 2003 - Springer
Recently, there has been a lot of interest on cryptographic applications based on fields GF
(pm), for p> 2. This contribution presents GF (pm) multipliers architectures, where p is odd …
(pm), for p> 2. This contribution presents GF (pm) multipliers architectures, where p is odd …
Efficient hardware implementation of finite fields with applications to cryptography
The paper presents a survey of most common hardware architectures for finite field
arithmetic especially suitable for cryptographic applications. We discuss architectures for …
arithmetic especially suitable for cryptographic applications. We discuss architectures for …
RNS representations with redundant residues
B Parhami - Conference Record of Thirty-Fifth Asilomar …, 2001 - ieeexplore.ieee.org
Residue number system (RNS) representations that contain redundant moduli have been
extensively studied with regard to their error checking properties. A second form of …
extensively studied with regard to their error checking properties. A second form of …
A Suggestion for a Fast Residue Multiplier for a Family of Moduli of the Form (2n − (2p ± 1))
AA Hiasat - The Computer Journal, 2004 - ieeexplore.ieee.org
The family of moduli that has the form (2 n−(2 p±1)) is considered in this paper. A suggestion
for a fast residue multiplier for this family of moduli is introduced. The multiplication algorithm …
for a fast residue multiplier for this family of moduli is introduced. The multiplication algorithm …
A reconfigurable multi-modulus modulo multiplier
This paper presents a novel architecture for a multi-modulus reconfigurable modulo
multiplier with moduli selectable from the set {2 n-1, 2 n, 2 n+ l}. The efficient unification of …
multiplier with moduli selectable from the set {2 n-1, 2 n, 2 n+ l}. The efficient unification of …
RNS Arithmetic Units for Modulo {2^ n+-k}
Recently new Residue Number Systems (RNS) moduli sets have been proposed in order to
increase the dynamic range and reduce the width of channels, therefore, reducing the …
increase the dynamic range and reduce the width of channels, therefore, reducing the …
A novel architecture and a systematic graph-based optimization methodology for modulo multiplication
G Dimitrakopoulos, V Paliouras - IEEE Transactions on Circuits …, 2004 - ieeexplore.ieee.org
A novel hardware algorithm, a VLSI architecture, and an optimization methodology for
residue multipliers are introduced in this paper. The proposed design approach identifies …
residue multipliers are introduced in this paper. The proposed design approach identifies …
A low-power Booth multiplier using novel data partition method
J Park, S Kim, YS Lee - Proceedings of 2004 IEEE Asia-Pacific …, 2004 - ieeexplore.ieee.org
The Booth algorithm has a characteristic that the Booth algorithm produces the Booth
encoded products with a value of zero when input data stream have sequentially equal …
encoded products with a value of zero when input data stream have sequentially equal …