Modular multiplier

Abstract

The invention discloses a modular multiplier, which comprises (n+1)-bit binary multiplier, an n-bit inverter array, an n-bit CSA compressor array, a first n-bit binary adder, a 1-bit full adder, a 5-bit adder, a first 1-bit inverter, a second 1-bit inverter, a third 1-bit inverter, a second n-bit binary adder and a third n-bit binary adder. According to a modular (2n+3) multiplier, the result of binary multiplication serves as an operation number and is reprocessed, so that repeated correction of the traditional modular (2n+3) multiplier is changed into one-step correction, the resource consumption of the modular (2n+3) multiplier is greatly reduced, and the operation speed is improved.

Description

technical field [0001] The invention belongs to the field of computers and integrated circuits, and in particular relates to the design of a high-speed multiplier. Background technique [0002] Before introducing the multiplier, first explain the Residue Number Systems (RNS, Residue Number Systems). The remainder system RNS is a numerical representation system that describes numbers through the remainder of a set of pairwise coprime remainder bases. by {m 1 ,m 2 ,...,m L} composed of L remainder bases, integer X, 0≤X<M, where M=m 1 ×m 2 ×…×m L , there is a unique representation in the RNS system as X={x 1 ,x 2 ,...,x L}, in Denotes X for modulo m i remainder of . To operate on two operands in the remainder system, the operator is Θ, which can be defined as: [0003] {z 1 ,z 2 ,…,z L}={x 1 ,x 2 ,...,x L}Θ{y 1 ,y 2 ,...,y L},in Here Θ can be modular addition, modular subtraction or modular multiplication. In a remainder system these arithmetic op...

AI Technical Summary

Problems solved by technology

[0006] The purpose of the invention is in order to solve the existing mold-oriented (2 n +3) The multiplier consumes resources and the speed is low. A modular multiplier is proposed

Images