Abstract:
An arithmetic processor cable of performing successive multiplication operations at high speeds is described in which the resultant product, internally represented as a carry-save or signed-digit expression, may be directly input in that form as the multiplier for the next successive multiplication operation. Additionally, a multiplier recoder circuit is provided which recodes the binary multiplier, in the form of a carry-save or signed-digit expression into a radix 4 signed-digit number, in order to further increase the operating speed.

Description:
This is a continuation-in-part of application Ser. No. 066,817 filed June 25, 1987 entitled &#34;Arithmetic Processor Using Redundant Signed Digit Arithmetic&#34;, application Ser. No. 070,565 filed July 7, 1987 entitled &#34;Arithmetic Processor and Divider Using Redundant Signed Digit Arithmetic&#34;, application Ser. No. 074,892 filed July 17, 1987 entitled &#34;Arithmetic Processor and Divider Using Redundant Signed Digit Arithmetic&#34;, application Ser. No. 074,97I filed July 17, 1987 entitled &#34;Arithmetic Processor and Multiplier Using Redundant Signed Digit Arithmetic&#34;, and application Ser. No. 086,967 filed Aug. 18, 1987 entitled &#34;Adder Circuitry Utilizing Redundant Signed Digit Operands&#34;, the disclosures of which are incorporated herein by reference. 
    
    
     BACKGROUND OF THE INVENTION 
     This invention relates to an arithmetic processor, and more particularly to an arithmetic processor particularly suitable for repeated high speed execution of arithmetic operations. 
     A conventional high speed multiplier has been described, for example, in pages 76 to 90 of Nikkei Electronics, May 29, 1978. In a binary array multiplier or a multiplier using a Wallace tree, partial products are summed up by using a carry save adder to obtain a product represented in a carry save expression (two binary numbers), and the product is converted into an ordinary binary number by using a carry look ahead adder or the like. In these multipliers, the amount of hardware is decreased and the computation speed is increased by reducing the number of partial products by one-half by converting the multipliers into the radix 4 signed-digit numbers consisting of elements of -2, -1, 0, 1, 2 by the 2-bit Booth method. 
     A high speed binary multiplier using a redundant binary addition tree is discussed in pages 683 to 690 of Trans. of IECE Japan, Vol. J66-D, No. 6 (1983). In this multiplier, a redundant binary expression consisting of elements -1, 0, 1 (that is, a signed digit expression) is used in the arithmetic operation. In n-bit multiplication, n partial products are regarded as redundant binary numbers, and are added, two by two, in the redundant binary number system in a twin tree form, and the product determined by converting the redundant binary expression into an ordinary binary expression. In the redundant binary number system, addition of two numbers can be done in a constant time, regardless of the number of digits involved in the arithmetic operation, without carry propagation. Therefore, in the multiplier using the redundant binary addition tree, an n-bit multiplication can be accomplished at a high speed in computation time O (log n). The computation speed is as fast as that of the high speed multiplier using the Wallace tree, being considerably higher than that of the conventional array multiplier. In addition, the circuit structure is as regular as that of the array multiplier, and the layout is simpler than the layout of the multiplier using the Wallace tree. 
     The method of realizing division and extraction of the square roots using an arithmetic processor possessing a redundant binary multiplier is discussed in pages 45 to 50 of Report of IECE Japan, AL85-90 (March 1986). In this method, it is necessary to multiply redundant binary members mutually in the multiplier. When the multiplier is configured to multiply redundant binary numbers, the quantity of hardware increases, compared with the multiplier for mutual binary numbers. 
     SUMMARY OF THE INVENTION 
     It is a primary object of this invention to provide an arithmetic processor capable of performing repeated arithmetic operations at high speed, by receiving, as the input to the arithmetic operation for the next stage, the internal expression such as carry save expression and redundant binary expression which are outputs of the arithmetic operation of multiplication, etc. 
     In particular, in the multiplier or arithmetic processor capable of both multiplication and addition, this invention provides an arithmetic processor capable of recoding the output result as multiplier, directly in the carry save expression or signed digit expression which are outputs of addition of the arithmetic operation. 
     The above objects are achieved by: (1) an arithmetic processor for determining the result of arithmetic operations, such as multiplication, by using plural numbers (such as carry save expression) or a signed digit expression (such as a redundant binary expression), comprising a plurality of memory means for storing these plural numbers or signed digit numbers and a means of generating inputs to the arithmetic operation directly from the plural numbers or signed digit numbers stored in said plurality of memory means, wherein the plural numbers or signed digit numbers which are outputs of the arithmetic operation are held in said plurality of memory means; or by (2) a multiplier recoder circuit for feeding the plural numbers or signed digit numbers as multipliers in multiplication, by the steps of composing a set of the plural numbers or signed digit numbers corresponding to a certain number of consecutive digits of the multiplier, expressing the multiplier by a group of such sets determining the intermediate result for each set, determining the intermediate carry for each set, and generating the digits of the multiplier recoded from said intermediate result for each set and said intermediate carry from the set at the next-lower-order position of the set. 
     Those and other objects and features of the invention will be more fully explained below with reference to the following drawings. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a block diagram showing one embodiment of the multiplier of this invention; 
     FIG. 2 is a block diagram of the multiplier recoder circuit of the multiplier of FIG. 1; 
     FIG. 3 is a table of the determination rule of intermediate carry and intermediate result when recoding; 
     FIG. 4 is a block diagram of a multiplier-added which is a second embodiment of this invention; 
     FIG. 5 is a block diagram of a second embodiment of a multiplier in accordance with this invention; 
     FIG. 6 is a block diagram of the multiplier recoding circuit of FIG. 5; 
     FIGS. 7 and 8 are tables showing rules for determining the intermediate carry at the time of recoding; 
     FIGS. 9 and 10 are tables showing the rules for determining the intermediate result at the time of recoding; and 
     FIG. 11 is a circuit diagram showing a cell for addition in a redundant adder. 
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     In the prior art, no consideration is given to the high speed operation corresponding to application of repeated multiplications, such an polynomial computations, where the result of multiplication (that is, the product) in the previous stage is used as the multiplier of multiplication for the next stage. In that operation, the product must be once converted into a binary expression from the internal expression such as the carry save expression and signed digit expression, and further converted into a radix 4 signed-digit number. Therefore, when the number of digits involved in the multiplication increases, it takes a longer time to convert from the internal expression, such as carry save expression and signed digit expression, into the binary expression. Furthermore, when the number of repetitions of multiplication increases, the computation time increases. 
     For example, in a multiplication using redundant binary numbers in internal addition and subtraction, by recoding the multipliers into radix 4 signed-digit numbers (quaternary numbers consisting of -2, -1, 0, 1, 2) following the 2-bit Booth method, the number of partial products is reduced to about half, and the calculation speed is increased while the quantity of hardware is decreased. However, this applies only to multiplication of binary numbers. No consideration is paid to multiplication using redundant binary numbers at least in either multiplier or multiplicand. When realizing multiplication using redundant binary numbers as combinational circuitry, if the number of digits of operation increases: (1) the operation delay time is greater as compared with multiplication of binary numbers only; (2) the gate count is very large and the circuit composition is complicated; and (3) it is hard to incorporate the arithmetic processor on one LSI chip. 
     Therefore, in accordance with one aspect of the invention, in multiplication, the multiplier (in the signed digit expression or the carry save expression) is divided into groups of 2 digits each, and the intermediate carry C i  (C i  being any one of -1, 0, 1, or 0, 1, 2) of the recoded multiplier in each group is generated, while simultaneously, the intermediate result S i  (S i  being any one of -2, -1, 0, 1, 2, or -3, -2, -1, 0, 1) of the recoded multiplier in each group is generated. Next, in each group, the intermediate result S i  of the group and the intermediate carry C i-1  from the next-lower group are summed, and the digit B i  (B i  being any one of -2, -1, 0, 1, 2) of the recoded multiplier is generated, so that the number of partial products may be reduced to half. As a result, the number of cells for addition can be decreased to about half, the calculation speed may be increased and the amount of hardware can be reduced. 
     FIG. 1 is a block diagram showing an embodiment of a multiplier of this invention. In this embodiment, a carry save adder is used for addition of partial products and the multiplier has a circuit for recoding the multiplier from a carry save expression (two binary numbers) into a radix 4 signed-digit number consisting of -2, -1, 0, 1, 2. 
     The multiplier of FIG. 1 includes a multiplier recoder circuit 1, partial product generation and addition circuit 2, adder 3, multiplexers 4, 5, and registers 10, 11, 12 and 13. Reference numerals 21, 22, 23, 24, 25, 26, 27, 28, 31, 32, 33 and 34 represent, respectively, n-bit signals. In this embodiment, for simplicity&#39;s sake and by way of example, n is selected so as to prevent overflow of digits and a rounding process is omitted. Specifically, reference numerals 21 and 24 represent complement binary numbers denoting multiplicand, reference numeral 22 represents a multiplier, reference numeral 31 represents an intermediate result, reference numeral 32 represents a product carry number, and reference numerals 33 and 34 represent final products. Reference numeral 29 represents a radix 4 signed-digit number expressing the recoded multiplier. Reference numeral 23 represents an n-bit signal constantly representing 0. Each block will now be explained. 
     The partial product generator and addition circuit 2 calculates the partial product of the digit and multiplicand 24 in each digit of the recoded multiplier 29 and sums the partial products corresponding to all digits to determine the product in the carry save expression. That operation results in the product intermediate result 31 and product carry numbers 32. In the generation of the partial product, each digit of the recoded multiplier 29 doubles the multiplicand and reverses the plus and minus signs according to any value of -2, -1, 0, 1, 2. The multiplicand can be doubled by shifting each digit of the multiplicand one bit to the left, and the plus and minus signs may be reversed by finding the 2&#39;s complement of the multiplicand. Furthermore, addition of partial products may be readily implemented by a Wallace tree or an array using the carry save adder. 
     The adder 3 converts the product from the carry save expression (the product intermediate result 31 and product carry number 32) to an ordinary binary expression. That is, by adding the product intermediate result 31 and product carry number 32, the final product 33 in the binary expression is determined. This may be readily implemented by a carry look ahead adder which is well known in the art. 
     Multiplexers 4 and 5 select the multiplier of the multiplication of the next stage, selecting either the multiplier 22 from outside, or the carry save expression 31 and 32 to express the product of multiplication of the previous stage. Since multiplier 22 is usually a binary number, one input signal 23 to the multiplexer 5 is 0 for the sake of convenience. Input signals 22 and 23 to multiplexers 4, 5 may be interchanged with input signal 22 applied to multiplexer 5 and input signal 23 applied to multiplexer 4. 
     Registers 10, 11, 12 and 13 are n-bit memories for respectively storing binary numbers expressing the multiplicand 21, intermediate result 25, and carry number 26 in carry save expression of multiplier and final product 33. Register 10 may be omitted if the input signal to the multiplication can be synchronized by some other method. 
     FIG. 2 is a schematic block diagram of a basic cell of the multiplier recoder circuit 1. As shown in FIG. 2, the basic cell multiplier recoder circuit 1 includes an intermediate carry generator 101, intermediate result generator 102, and recoded multiplier generator 103. Both intermediate carry generator 101 and intermediate result generator 102 receive the (2j+1)-th order position x 2j+1  111, the 2j-th order position x 2j  112, and the (2j-1)-th order position x 2j-1  113 (which appear on line 27, FIG. 1), expressing the intermediate result in the multiplier carry save expression, and the (2j+1)-th order position Y 2j+  1 121, the 2j-th order position Y 2j  122, and the (2j-1)-th order position Y 2j-1  123 (which appears on line 28, FIG. 1), expressing the carry number in the multiplier carry save expression, and delivers intermediate carry C j  , 131, and intermediate result S j , 132, at the j-th digit respectively. The recoded multiplier generator 103 receives the intermediate result S j , 132, at the j-th digit and the intermediate carry, C j-1 , 133 from the (j-1)-th digit, and delivers the j-th digit, R j , 141 of the recoded multiplier. That is, recoding is done in two steps. 
     More specifically, in the first step, two numerals, on signal lines 27 and 28, in the multiplier carry save expression are divided into groups of two digits each (which correspond to groups of three digits wherein the least significant digit of each 3-digit group is the same as the most significant digit of the next lower order 3-digit group), and the intermediate carry C j , 131, and intermediate result S j , 132, are determined from two digits of the group x 2j+1 , 111, x 2j , 112, and Y 2j+1 , 121, Y 2j , 122, and the higher order digits of the next lower order group x 2j-1 , 113 and Y 2j-1 , 123. 
     In the second step, the j-th digit R j , 141 of the recoded multiplier is determined from the intermediate result S j , 132 of the group and the intermediate carry C j-1 , 133 of the next lower group. However, x 2j+1 , 111, x 2j , 112, x 2j-1 , 113, Y 2j+1 , 121, Y 2j , 122 and Y 2j-1 , 123 are respectively one-bit signals expressed as either 0 or 1. The intermediate carries C j , 131 and C j-1 , 133 are both signals expressed as either 0, 1 or 2. The intermediate result S j , 132 is a signal expressed as any one of -3, -2, -1, 0, 1, and the recoded multiplier R j , 141 is a signal expressed as any one of -2, -1, 0, 1, 2. 
     Each block in FIG. 2 will now be described in greater detail. 
     The intermediate carry generator 101 and intermediate result generator 102 are the circuits for generating the intermediate carry C j , 131 and intermediate result S j , 132, in accordance with the rules shown in FIG. 3, from the arithmetic sums x 2j+1  +Y 2j+1&#39; , x 2j  +Y 2j&#39; , and x 2j-1  +Y 2j-1  of, respectively, the (2j+1)-th order position, the 2j-th order position, and the (2j-1)-th order position of the two numerals 27 and 28, in which + is an arithmetic operator representing addition. 
     The recoded multiplier generator 103 is a circuit for generating the j-th digit of the recoded multiplier by adding the intermediate result S j  and the intermediate carry C j-1  from the next-lower order position, that is, by performing an arithmetic sum S j  +C j-1 . However, the recoded multiplier R j   is any one of -2, -1, 0, 1, 2. The rule in FIG. 3 is an example of determining the intermediate carry C j  and intermediate result S j , which is determined so that the intermediate carry C j-1  from the lower digit is not 0 if the intermediate result S j  is -3, or that the intermediate carry C j-1  from the lower digit is not 2 if the intermediate result S j  is 1. 
     For example, when signed digit numerals R j , C j , S j  are expressed by 2&#39;s complement binary numerals of 3 bits, intermediate carry generator 101, intermediate result generator 102, and recoded multiplier generator 103 may be easily designed. However, since intermediate carry C j  is always nonnegative, it may be expressed by a 2-bit signal omitting the sign bit. 
     In this embodiment, the multiplier carry save expression is divided into groups of 2 digits each, that is, the (2j+1)-th order position and the 2j-th order position. It is also possible to divide the multiplier carry save expression into two groups of two digits consisting of the 2j-th order position and the (2j-1)-th order position. The recoder circuit 1 has a fundamental circuit as shown in FIG. 2 for each one of such groups, and generates one digit for the recoded multiplier R j . 
     In this embodiment, an arithmetic unit for performing multiplications repeatedly was explained. However, it is also possible to perform multiplications and additions repeatedly by inserting carry save adders to the product intermediate result 31 and the product carry number 32 in FIG. 1, and adding the product carry save expression and other binary numeral, and delivering the result in a carry save expression. Hence, it is possible to execute a polynomial calculation such as: 
     
         ((((y.sub.1 ×x.sub.1 +a.sub.1)×x.sub.2 +a.sub.2)×x.sub.3 +a.sub.3)×x.sub.4 +a.sub.4) . . . . . . 
    
     at a high speed. FIG. 4 is a block diagram of a system for carrying out this function in which the like elements of FIG. 1 are indicated by the same reference numerals. In FIG. 4, block 6 is an adder such as carry save adder (CSA), and reference numeral 30 is an n-bit binary signal expressing a binary numeral which is an addend. 
     According to the embodiment of the invention shown in FIG. 4, as compared with a conventional multiplier using a carry save adder, conversion from the product carry save expression to an ordinary binary expression is omitted when performing repeated multiplications, so that the operation time proportional to the number of digits of arithmetic operation or proportional to its logarithm, can be shortened by every number of repetitions. 
     FIG. 5 illustrates another embodiment of the invention using a multiplier and redundant binary numerals for internal addition and subtraction. The multiplier of FIG. 5 includes a multiplier recoder circuit 100, a partial product generator 110, a tree structure of redundant adders 120, and a redundant binary-binary converter 130, in which at least the multiplier is a redundant binary numeral. 
     The multiplier recoder circuit 100 is a circuit for dividing a multiplier which is a redundant binary numeral into groups of 2 digits each (which correspond to groups of three digits wherein the least significant digit of each 3-digit group is the same as the most significant digit of the next lower order 3-digit group), and recoding the multiplier of each group into a radix 4 signed digit number. Therefore, each digit of the recoded multiplier output of multiplier 100 is any one of -2, -1, 0, 1, 2. Since a binary number may be regarded as a special redundant binary number, this circuit may be used if the multiplier is a binary number. 
     The partial product generator 110 is a circuit for doubling the multiplicand and inverting the plus and minus signs, depending on the value of the digits of the recoded multiplier, in each digit of the multiplier recoded by the multiplier recoder circuit 100. Doubling of the multiplicand can be effected by shifting each digit of the multiplicand one position to the left. The plus and minus signs can be inverted by inverting the signs in each digit of the multiplicand. That is, when a digit of the multiplicand is 1, that digit is changed to -1, and when it is -1, it is changed to 1. When the multiplicand is a binary number expressed in 2&#39;s complement, the plus and minus signs can be inverted by taking the 2&#39;s complement. Hence, partial product generator 110 can be realized by conventional circuitry. 
     The redundant binary-binary converter 130 is a circuit for converting a redundant binary number obtained as a product into a binary number, and it too may be realized by conventional carry look ahead adder or the like. 
     The multiplier recoder circuit 100 is further described by reference to FIG. 6 which shows that multiplier recoder circuit 100 includes intermediate carry generator 501, intermediate result generator 502, and a recoded multiplier generator 503. The intermediate carry generator 501 and intermediate result generator 502 both receive the (2j+1)-th order position x 2j+1 , 511, the 2j-th order position x 2j , 512, and the (2j-1)-th order position x 2j-1 , 513 of the multiplier, and deliver the intermediate carry C j , 521 and intermediate result S j , 522 at the j-th order position, respectively. The recoded multiplier generator 503 receives the intermediate result S j , 522 at the j-th order position and the intermediate carry C j-1 , 523 from the (j-1)-th order position, and delivers the j-th digit B j , 531 of the recoded multiplier. Thus, the multiplier is recoded in two steps. In the first step, the multiplier (a redundant binary number) is divided into groups of two digits each (which correspond to groups of three digits wherein the least significant digit of each 3-digit group is the same as the most significant digit of the next lower 3-digit order group), and the intermediate carry C j , 521, and intermediate result S j , 522, are determined from the two digits of the group, x 2j+1 , 511, x 2j  512, and the upper digit x 2j-1 , 513 of the next lower group. In the second step, from the intermediate result S j , 522, of that group and the intermediate carry C j-1 , 523, from the next lower group, the j-th digit B j , 531, of the recoded multiplier is determined. The (2j+1)-th digit x 2j+1 , 511, the 2j-th digit x 2j , 512, and the (2j-1)-th digit x 2j-1 , 513 of the multiplier are signals expressed as any one -1, 0, 1, and the intermediate carry C j , 521, of the j-th order position and the intermediate carry C j-1 , 523, from the (j-1)-th order position are also signals expressed as any one of -1, 0, 1. However, the intermediate result S j , 522, of the j-th order position and the j-th digit B j , 531, of the recoded multiplier are signals expressed as any one of -2, -1, 0, 1, 2. Each block will now be described in greater detail. 
     Intermediate carry generator 501 is a circuit for: (i) determining the intermediate carry C j , 521, from the 2j-th digit x 2j , 512, and the (2j+1)-th digit x 2j+1 , 511 of the multiplier, according to the rules shown in FIG. 7, when the (2j-1)-th digit x 2j-1 , 513 of the multiplier is -1; or (ii) determining the intermediate carry C j , 521, from the 2j-th digit x 2j , 512, and the (2j+1)-th digit x 2j+1 , 511 of the multiplier, according to the rules shown in FIG. 8, when the (2j-1)-th digit x 2j-1 , 513, of the multiplier is either 0 or 1. 
     For example, signed digit numerals x i  and C j  are binary-coded as follows. One digit x i  of a multiplier is expressed in a 2-bit binary signal x i+  x i-  as shown in Table 1, 
     
                       TABLE 1______________________________________x.sub.i        x.sub.i+                 x.sub.i-______________________________________-1             0      10              0      01              1      0______________________________________ 
    
     the intermediate carry C j  is similarly expressed in a 2-bit binary signal C j+  C j-  as in Table 1. The intermediate carry generator 501 may be conventionally designed as 
     
         C.sub.j.sup.+ =x.sub.2j+1+ •x.sub.2j+ +x.sub.2j+1+ •x.sub.2j- •x.sub.2j-1-, 
    
     
         C.sub.j.sup.- =x.sub.2j+1- •x.sub.2j- +x.sub.2j+1- •x.sub.2j+ •x.sub.2j-1-. 
    
     The intermediate result generator 502 is a circuit for: (i) determining the intermediate result S j , 522, from the (2j+1)-th digit x 2j+1 , 511, and the 2j-th digit x 2j , 512, according to the rules shown in FIG. 9, when the (2j-1)-th digit x 2j-1 , 513 of the multiplier is -1; or (ii) determining the intermediate result S j , 522 from the (2j+1)-th digit x 2j+1 , 511, and the 2j-th digit x 2j , 512 of the multiplier, according to the rules shown in FIG. 10, when the (2j-1)-th digit xx 2j-1 , 513 of the multiplier is either 0 or 1. 
     For example, when the digit x i  of the multiplier is expressed in a 2-bit binary signal x i+  x i-  as shown in Table 1 and the intermediate result S j  is a 3-bit binary signal S j-  S j2  S j1  as shown in Table 2 below, the intermediate result generator 502 may be conventionally designed as follows: ##EQU1## 
     
                       TABLE 2______________________________________S.sub.j S.sub.j-       S.sub.j2                         S.sub.jl______________________________________-2      1              1      0-1      1              0      10       0              0      01       0              0      12       0              1      0______________________________________ 
    
     On the other hand, the recoded multiplier generator 503 is a circuit for generating the j-th digit of the recoded multiplier, by adding up the j-th order position intermediate result S j , 522 and the intermediate carry C j-1 , 523, from the next lower order position, that is, the (j-1)-th order position, or by performing the arithmetic sum, S j  +C j-1 . 
     For example, when the intermediate carry C j  and intermediate result S j  are binary-coded as shown above and the digit B j  of the recoded multiplier is expressed as a 3-bit binary signal B j-  B j2  B j1 , the same as the intermediate result S j , as in Table 2, the recoded multiplier generator 503 may be conventionally designed as follows: ##EQU2## where • denotes AND, ⊕ means OR, ⊕ stands for EX-OR, and  --  is an operator expressing logical negation. 
     In this embodiment, the multiplier is divided into two grouped of two digits each (which correspond to groups of three digits wherein the least significant digit of each 3-digit group is the same as the most significant digit of the next lower order 3-digit group), that is, the (2j+1)-th digit, x 2j+1 , and the 2j-th digit, x 2j , but it is also possible to divide this into groups consisting of two digits, that is, the 2j-th digit, x 2j , and the (2j-1)th digit, x 2j-1 . The multiplier recoder circuit 100 has the fundamental circuit shown in FIG. 6 for each of such groups. 
     Finally, the redundant adder 120 is explained below. The addition rule for the redundant adder 120 is shown in Table 3. 
     
                                           TABLE 3__________________________________________________________________________Augend    Addend         Next lower order position                      Carry                          IntermediateType    (X.sub.i)    (y.sub.i)         (x.sub.i - 1, y.sub.i- 1)                      (C.sub.i)                          sum (S.sub.i)__________________________________________________________________________&lt;1&gt; 1    1    --           1   0&lt;2&gt; 1    0    Both are nonnegative                      1   -1    0    1    At least one is negative                      0   1&lt;3&gt; 0    0    --           0   0&lt;4&gt; 1    -1    -1   1&lt;5&gt; 0    -1   Both are nonnegative                      0   -1    -1   0    At least one is negative                      -1  1&lt;6&gt; -1   -1   --           -1  0__________________________________________________________________________ 
    
     The addition at the i-th order position is determined by the following logical expressions: ##EQU3## 
     FIG. 11 is a schematic circuit diagram showing an adder cell for implementing the redundant adder 120. This is an example of realizing an adder cell by NOR/OR logic. 
     Gates 611 through 623 are NOR/OR circuits, in which signals X i+ , 602, and X i- , 603, are 2-bit signals expressing the i-th digit, x i , of redundant binary number of augend, x i+  601 is a signal to express the logical negation of x 1+ , 602, Y i+ , 605 and Y i- , 606 are 2-bit signals expressing the i-th order position Y i  or redundant binary numeral of addend, and Y i+ , 604, is a signal to express the logical negation of Y i+ , 605. Signal P i , 631, is a signal which establishes whether both augend x i  and addend Y i  at the i-th order position are nonnegative or not, and P i-1 , 633, is a signal which establishes whether both augend x i-1  and addend Y i-1  at the (i-1)-th order position are nonnegative or not. Signals P i , 632, P i-1 , 634, express the logical negation of P i , 631 and P i-1 , 633, respectively. Furthermore, u i , 635 and u i , 636 are respectively the signal relating to the intermediate carry at the i-th order position and the signal to express its logical negation; u i-1 , 637 and u i-1 , 638 are individually the signal relating to the intermediate carry from the (i-1)-th order position and the signal to express its logical negation; z i+ , 642 and z i- , 643 are 2-bit signals expressing the i-th order position z i  of the result of addition, and z i+ , 641 is a signal to express the logical negation of z i+ , 642. 
     While the circuit of FIG. 11 is implemented in NOR/OR logic bearing ECL circuit in mind, it is possible to implement this circuit by employing other technologies (e.g., CMOS, NMOS, TTL, IIL) or higher-radix logic. 
     In this embodiment, as compared with the conventional multiplier having redundant binary number as its multiplier, the number of partial products is reduced to about half. 
     In this invention, since the output result of arithmetic operation of arithmetic processor can be directly fed into the operation of the next stage, and it is not necessary to convert the arithmetic operation results from the internal expression to an external expression such as binary expression, repeated operations of multiplication, or consecutive operations of addition and subtraction or multiplication can be executed at high speed. 
     While the invention has been explained by reference to specific examples, it is understood that modifications can be made thereto which would come within the spirit and scope of the invention set forth in the appended claims.