Modular (2<n>-3) multiplier

Abstract

The invention belongs to the field of computers and integrated circuits and discloses a modular (2<n>-3) multiplier, which specifically comprises an n-bit binary multiplier (1), an n-bit carry save adder (CSA) compressor array (2), an n-bit binary adder (3) with carry input, a two-bit adder (4), a first n-bit binary adder (5) and a second n-bit binary adder (6). The modular (2<n>-3) multiplier reprocesses by using a result of binary multiplication as an operation number P, so multi-time modification of the conventional modular (2<n>-3) multiplier is changed into one-time modification, consumed resources of the modular (2<n>-3) multiplier are greatly reduced, and the operation speed of the modular (2<n>-3) multiplier 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 expression 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 has low speed. A modulo (2^n-3) multiplier is proposed

Images