Digital adder/accumulator

Abstract: A digital adder circuit for adding binary numbers is comprised of a plurality of adders for adding the binary numbers divided at predetermined bits each, a carry calculator for calculating carry data to a higher bit of the predetermined bit on the basis of added results of the plurality of adders, and a carry corrector for adding the carry data to the added results of the plurality of adders within the predetermined bits. Further, an accumulator is provided to accumulate a plurality of binary numbers sequentially supplied thereto. This accumulator is comprised of more than two adders of a plurality of bits, a delay register for delaying each of outputs and each of carry outputs of the more than two adders of the plurality of bits by a predetermined time, the binary numbers sequentially supplied thereto and a delayed output of the delay register being sequentially added by the more than two adders of the plurality of bits, and a carry corrector supplied with an accumulated result expressed as redundant by each of outputs of the more than two adders of the plurality of bits and carry outputs and for correcting each of the outputs by each of the carry outputs to generate an accumulated added result having no redundancy. Thus, the digital adder circuit and the accumulator can perform calculation operation at high speed without increasing the circuit scales thereof so much.

Description: The present invention generally relates to adding circuits and, more particularly, to an adding circuit for adding binary numbers and an accumulator for adding binary numbers sequentially supplied thereto in an accumulation fashion wherein high speed addition and accumulation can be executed without increasing the circuit scale thereof too much. As an adding circuit for adding binary numbers (a n-1 , ... a 1 , a 0 ) and (b n-1 , ... b 1 , b 0 ) of n bits ( n is an integer larger than 2) to provide binary numbers (c n , ... c 1 , c 0 ) of (n + 1) bits, the most popular adding circuit is formed of one half adder and (n - 1) full adders. Fig. 1 shows an example of such prior-art adding circuit, wherein n = 16. As shown in Fig. 1, this adding circuit is comprised of a half adder 1 and full adders 2. In this popular adding circuit, when carry data of the half adder of least significant bit (LSB) is gradually propagated to the full adders of most significant bit (MSB) to first provide accurate calculated results. Therefore, t assumes a calculation time of one full adder. Then, all calculation time T 1 for adding binary number of n bits is expressed by the following equation (1): T 1 ≒ n t Accordingly, if n is increased too much, a lot of calculation time is required depending on the calculation purpose. In order to realize the high speed addition, an adding circuit of carry select adder system is proposed. Fig. 2 shows an example of the previously-proposed carry select adder type adding circuit in which n = 16, by way of example. As shown in Fig. 2, carry look ahead circuits 3A to 3D of 4 bits are connected in cascade to calculate beforehand only carry data at high speed. Adders 4A to 4D of 4 bits are provided to perform the addition assuming that carry data from less significant bits are "0", whereas adders 5B to 5D of 4 bits are provided to perform the addition assuming that carry data from less significant bits are "1". Multiplexer circuits 6B to 6D are employed as switching circuits. The adder 4A adds 0'th to 3rd binary numbers (a 3 ... a 0 and b 3 ... b 0 ) of two binary numbers, the adder 4B adds binary numbers of 4th to 7th bits (a 7 ... a 4 and b 7 ... b 4 ) assuming that carry data from less than 3 bits are "0", and the adder 5B adds binary numbers of 4th to 7th bits assuming that the carry data from less than 3 bits are "1". By selecting the added result of the adder 4B or 5B by using the multiplexer 6B in response to whether the carry data from the carry look ahead circuit 3A is "0" or "1", the added result of binary numbers of 4th to 7th bits (c 7 ... c 4 ) can be obtained accurately. In the same fashion, added results (c 15 to c 8 ) of 8th to 15th bits of the binary numbers can be obtained accurately, and a value c 16 of 16th bit can be obtained as carry data of the carry look ahead circuit 3D of the most significant bit. Accordingly, a total calculation time required to perform the addition of binary numbers in the example of Fig. 2 becomes substantially equal to the calculation time of the 4-bit adder 4B or 5B. In the adding circuit of the carry select adder system, assuming that the calculation time of one carry look ahead circuit 3A, 3B and so on is selected to be t which is the calculation time of one 1-bit full adder and that k carry look ahead circuits, i.e., k m-bit adders are utilized, then a total calculation time T 2 required to add binary numbers of n (= km where m is an integer) bits is expressed as: T 2 ≒ kt (in the case of k ≥ m) or T 2 ≒ mt (in the case of k < m) It is to be appreciated from the foregoing equations (2A) and (2B) that, as compared with the case of the standard adding circuit (see equation (1)), this can perform the calculation at speed as high as m times to k times. In the adding circuit of the carry select adder system, a circuit block 7D assumes a circuit formed of, for example, the adding circuits 4D and 5D and the multiplexer 6D. Then, an adding circuit which modifies the circuit block 7D is proposed as shown in Fig. 3. The technical report (Vol. 89, No. 4, PP. 37 to 44) of the Institute of Electronics, Informations and Communication Engineers describes this type of adding circuit. Referring to Fig. 3, the 4-bit adding circuit 5D (see Fig. 2) for adding binary numbers is replaced with an adding circuit 8D for adding 1 to a binary number of 4 bits. This adding circuit 8D is interposed between the output port of the adder 4D and one input port of the multiplexer 6D. In that case, the calculation time at the adder 8D is added so that a total calculation time T 3 is expressed as: T 3 ≒ kt (in the case of k ≥ 2m) or T 3 ≒ 2mt (in the case of k < 2m) Although the calculation speed of the adding circuit of the carry select adder type can be increased as described above, this adding circuit needs the addition of the multiplexers 6B to 6D, which unavoidably makes the circuit scale large. Further, if the circuit block of the example shown in Fig. 3 is employed, then the calculation speed is decreased to be substantially one half as compared with the original carry select adder type. In that case, however, the adding circuit 5D is replaced with the adding circuit 8D, which provides a reduced circuit scale. Even this circuit needs the multiplexers 6B to 6D, and there remains the substantial disadvantage that the circuit scale is very large. Fig. 4 shows an arrangement of a prior-art accumulator which accumulatively adds (i.e., accumulates) numbers x (x n-1 ... x 1 , x 0 ) of less than n bits sequentially supplied thereto to obtain a sum s (s n-1 ...s 1 , s 0 ) of n bits. With reference to Fig. 4, an n-bit adder 201 is constructed by connecting a single 1-bit half adder 202 0 and (n - 1) 1-bit full adders 202 1 to 202 n-1 . Delay registers 203 0 to 203 n-1 are shown to have clear terminals CLR and clock terminals CK. Sum outputs of the adders 202 0 to 202 n-1 are respectively supplied to input terminals of the registers 203 0 to 203 n-1 , data x 0 to x n-1 of respective carries of numbers x are respectively supplied to one input terminals of the adders 202 0 to 202 n-1 , and delayed outputs of the registers 203 0 to 203 n-1 are supplied to the other input terminals of the adders 202 0 to 202 n-1 , respectively. When the accumulative addition is carried out by the accumulator in the example of Fig. 4, a reset signal R is supplied to the clear terminals CLR of the registers 203 0 to 203 n-1 to reset the output data of these registers 203 0 to 203 n-1 to zero. Then, the number x supplied to the n-nit adder 201 is updated at a predetermined cycle and a clock pulse 1 of this predetermined cycle is supplied to the clock terminals CK of the registers 203 0 to 203 n-1 . Thus, the output of the n-bit adder 201 provides data S 0 to S n-1 of respective carries of the sum s of n bits. In that case, the carry output from the n'th bit which is the most significant bit of the n-bit adder 201 to the (n + 1) bits can be neglected. In the n-bit adder 201, however, the accurate sum output is not obtained until the carry output of the half adder 202 0 propagates up to the full adder 202 n-1 . There is then the substantial disadvantage that, when the value n is increased, then the calculation speed is decreased. Assuming that T is the calculation time of the one 1-bit half adder or full adder, then a calculation time required by the accumulator of the example in Fig. 4 to perform one calculation is expressed as nearly nT. Japanese Patent Laid-Open publication under number JP-A-64-86271 describes another accumulator wherein regardless of the increase of the value n , a calculation time thereof is always substantially equal to the calculation time T of the single 1-bit full adder. This previously-proposed accumulator cannot avoid such a disadvantage that the circuit scale thereof still remains large. Further, it is frequently observed that the calculation speed is not always increased to the extent of the single 1-bit full adder. The article by Ekroot & Long on pages 578-580 of IEEE journal of Solid-State circuits, Vol 23, No.2, April 1988, discloses, inter alia, an accumulator composed of eight 2-bit adders. A pipelined-carry arrangement is used, wherein the carry output from one 2-bit adder is delayed so as to added in the next most significant 2-bit adder, one clock cycle later. Thus successive pairs of bits of any given one of the numbers to be accumulated are fed over four successive clock periods to the four MSB 2-bit adders. A synchronised parallel output is produced by delaying the bit sum outputs by pipelined registers of staggered lengths decreasing towards the MSB 2-bit adder. JP-A-1,086,271 discloses a 1-bit accumulator comprising 1-bit adders supplied with a bit of the number to be added. The bit sum output of the 1-bit adder is delayed in a registered and supplied back to the 1-bit adder to be added to the corresponding bit of the next successively supplied number. The carry output, of the 1-bit order is supplied to a 1-bit adder of next-higher order. The delayed bit sum and carry outputs pass through a second register and then a carry adding circuit. According to the present invention, there is provided an accumulator for accumulating a plurality of binary numbers sequentially supplied thereto, comprising: at least three adders each for adding two plural-bit operands represented by parallel bits supplied thereto and having a carry output and, for each of the plural bits, a bit sum output, each said binary numher being sequentially supplied to said adders by having the bits thereof distributed in contiguous groups to respective ones of said adders as their first operands, whereby the adders add bit groups of different orders; delay registers for delaying the bit sum output and the carry output of each of said at least three adders by a predetermined time to be added to the next sequentially supplied binary number by the delayed bit sum outputs of each adder being supplied back to that adder as the respective bits of the second operand to be added to the bit group of same order from said next binary number, and by the delayed carry outputs being supplied as a carry input to the adder arranged to add the bit groups of next higher order; and a carry corrector supplied with the accumulated result represented redundantly by the combination of the bit sum outputs and the carry outputs of all of said at least three adders and arranged to correct said bit sum outputs by said carry outputs to generate an accumulated added result having no redundancy. The present invention can provide an accumulator in which an accumulative addition can be performed at a necessary calculation speed dependent on the usage without increasing the circuit scale too much. The preceding and other features and advantages of the present invention will be apparent in the following detailed description of preferred embodiments when read in conjunction with the accompanying drawings, in which like reference numerals are used to identify the same or similar parts in the several circuits. In the drawings:- Fig. 1 is a schematic block diagram showing an example of a standard adding circuit of the prior art; Fig. 2 is a schematic block diagram showing in prior-art adding circuit of a carry select adder system; Fig. 3 is a schematic block diagram showing a modified example of the conventional carry select adder system adding circuit shown in Fig. 2; Fig. 4 is a schematic block diagram showing an example of a conventional accumulator; Fig. 5 is a block diagram showing an adding circuit which does not fall within the scope of the present invention, but is useful for understanding it; Fig. 6 is a schematic block diagram showing a block of the adding circuit of Fig. 5; Fig. 7 is a schematic block diagram showing another example of the block of the adding circuit shown in Fig. 5; Fig. 8 is a schematic diagram used to explain an operation of the adding circuit of Fig. 5; Fig. 9 is a schematic block diagram showing another adding circuit which does not fall within the scope of the present invention; Fig. 10 is a schematic block diagram showing an accumulator which is an embodiment of the present invention; Figs. 11A to 11E are schematic representations used to explain an operation of the embodiment shown in Fig. 10; and Fig. 12 is a schematic block diagram showing another embodiment of the present invention which is a generalisation of the accumulator shown in Fig. 10 An adding circuit which does not fall within the scope of the present invention, but is useful for understanding it, will be described with reference to Figs. 5 to 8. In this embodiment, the present invention to applied to an adding circuit which obtains a binary number (c 16 , c 15 ... c 0 ) of 17 bits by adding two binary numbers (a 16 ... a 0 ) and (b 15 ... b 0 ) of 16 bits. Fig. 5 is a block diagram which shows the adding circuit. With reference to Fig. 5, 4-bit adders 9A to 9D are provided to add two binary numbers of 4 bits. The binary numbers of 16 bits are divided to provide binary numbers of 4 bits each and binary numbers (a 3 ... a 0 ) and (b 3 ... b 0 ) of less significant 4 bits are added by the adder 9A. The binary numbers (a 7 ... a 4 ) and (b 7 ... b 4 ) of the next 4 bits are added by the adder 9B. The binary numbers (a 11 ... a 8 ) and (b 11 ... b 8 ) of the next 4 bits are added by the adder 9C. Finally, binary numbers (a 15 ... a 12 ) and (b 15 ... b 12 ) of the more significant 4 bits are added by the adder 9D. The added outputs of 4 bits excepting the carry data of the adder 9A is provided as the less significant 4 bits (c 3 ... c 0 ) of finally obtained added result, while carry data e 4 , e 8 , e 12 , e 16 are generated from carry output terminals CA of the adders 9A to 9D, respectively. The carry data e 4 of the adder 9A and the added results (d 7 ... d 4 ) of 4 bits from the adder 9B are supplied to input terminals of 5-input AND circuit 10B, and output data of this AND circuit 10B and the carry data e 8 of the adder 9B are supplied to input terminals of an OR circuit 11B. Accurate carry data E 8 to the 8th bit (which will be described later), which is the output data of the OR circuit llB and added results (d 11 ... d 8 ) of 4 bits from the adder 9C are supplied to input terminals of a 5-input AND circuit 10C. Output data of this AND circuit 10C and carry data e 12 of the adder 9C are supplied to an OR circuit 11C. Accurate carry data E 12 to the 12th bit, which is the output data from the OR circuit 11C, and added results (d 15 ... d 12 ) of 4 bits from the adder 9D are supplied to input terminals of a 5-input AND circuit 10D, and output data from the AND circuit 10D and carry data e 16 of the adder 9D are supplied to input terminals of OR circuit 11D. Output data E 16 of this OR circuit 11D is provided as 16th bit value c 16 of final added result. Therefore, the circuit groups (10B, 11b), (10C, 11C) and (10D, 11D) can be regarded as carry computers (or calculators) 13B, 13C and 13D, respectively. As illustrated in Fig. 5, adders 12B to 12D are provided to add binary numbers of 1 bit to binary numbers of 4 bits to obtain binary number of 4 bits. These adders 12B to 12D are referred hereinafter as "A4 blocks" in the following description. These A4 blocks 12B to 12D do not calculate carry data for 4th bit. The A4 block 12B adds the carry data e 4 to the added results (d 7 ... d 4 ) of the adder 9B, the A4 block 12C adds the accurate carry data E 8 to the added results (d 11 to d 8 ), and the A4 block 12D adds the accurate carry data E 12 to the added results (d 15 ... d 12 ) of the adder 9D. The added results of 12 bits of these A4 blocks 12B to 12D are obtained as 12-bit values (c 15 ... c 4 ) of finally added results. Fig. 6 shows an example of the A4 block 12B (see Fig. 5). Referring to Fig. 6, half adders 14A to 14D are provided, wherein an intermediate added result d 4 and carry data e 4 are supplied to different input terminals of the half adder 14A, respectively, intermediate added results d 5 to d 7 are supplied to one input terminals of the half adders 14B to 14D, respectively, and carry data from the half adders 14A, 14B and 14C are supplied to the other input terminals of the half adders 14B, 14C and 14D, respectively. The added results of these half adders 14A to 14D are obtained as final added results (c 7 ... c 4 ). In that case, assuming that a calculation time of one half adder is represented by t , a total calculation time required by the A4 block 12B in the example of Fig. 6 to obtain an accurate value is substantially 4t. Fig. 7 shows another example of the A4 block 12B, in which reference numerals 15A to 15D designate exclusive-OR circuits, 16 a 2-input AND circuit, 17 a 3-input AND circuit and 18 a 4-input AND circuit, respectively. As shown in Fig. 7, the intermediate added result d 4 and carry data e 4 are supplied to different input terminals of the exclusive-OR circuit 15A, different input terminals of the AND circuit 16, different input terminals of the AND circuit 17 and to different input terminals of the AND circuit 18. Output data of the AND circuit 16 is supplied to one input terminal of the exclusive-OR circuit 15B, while the intermediate added result d 5 is supplied to the other input terminal of the exclusive-OR circuit 15B, a third input terminal of the AND circuit 17 and to a third input terminal of the AND circuit 18. Further, output data from the AND circuit 17 is supplied to one input terminal of the exclusive-OR circuit 15C, and the intermediate added result d 6 is supplied to the other input terminal of the exclusive-OR circuit 15C and to a fourth input terminal of the AND circuit 18. Output data from the AND circuit 18 and the intermediate added result d 7 are supplied to different input terminals of the exclusive-OR circuit 15D, respectively. Output data from these exclusive-OR circuits 15A to 15D are obtained as final added results (c 7 to c 4 ). The addition in which binary numbers (d 7 ... d 4 ) of 4 bits can be added with the carry data e 4 of one bit in the example of Fig. 7 will be described in detail. Only when (d 4 , e 4 ) = (1, 0) or (d 4 , e 4 ) = (0, 1), the value c 4 becomes "1" so that the output data of the exclusive-OR circuit 15A becomes the value c 4 , accurately. Further, assuming that f 1 represents carry data from 0'th bit to 1st bit, then f 1 becomes "1" only when (d 4 , e 4 ) = (1, 1), while the value c 5 becomes "1" only when (d 5 , f 1 ) = (1, 0) or (d 5 , f 1 ) = (0, 1). Thus, the output data from the exclusive-OR circuit 15B takes the value c 5 , accurately. Similarly, assuming that f 2 represents carry data to the 2nd bit and that f3 represents carry data to the 3rd bit, then f 2 becomes "1" only when (d 5 , d 4 , e 4 ) = (1, 1, 1) and f 3 becomes "1" only when (d 6 , d 5 , d 4 , e 4 ) = (1, 1, 1, 1). Therefore, the output data from the exclusive-OR circuits 15C and 15D, respectively take values c 6 and c 7 , accurately. The example of Fig. 7 shows the circuit which performs the addition in a so-called table fashion. According to this circuit arrangement, the total calculation time can be reduced to about a calculation time of one fall adder. While in the above-mentioned example, the carry data to the 8th, 12th and 16th are not calculated in the respective A4 blocks 12B, 12C and 12D, these carry data are calculated by the carry computers (or calculator) 13B, 13C and 13D, respectively. A calculation in which accurate carry data E 8 to the 8th bit is obtained by the carry computer 13B will be described first. The carry data E 8 becomes "1" only when carry data e 8 of 4-bit adder 9B is "1" or when carry data e 4 of the less significant 4-bit adder 9A and the added result (d 7 ... d 4 ) of the adder 9B suffice (d 7 , d 6 , d 5 , d 4 , e 4 ) = (1, 1, 1, 1, 1). Accordingly, the carry computer 13B, formed by the combination of the 5-input AND circuit 10B and the OR circuit 11B, can derive accurate carry data E 8 to the 8th bit. Further, the accurate carry data E 12 to the 12th bit becomes "1" only when carry data e 12 of the adder 9C is "1" or when carry data E 8 to 8th bit and added result (d 11 ... d 8 ) of the adder 9C suffice (d 11 , d 10 , d 9 , d 8 , E 8 = (1, 1, 1, 1, 1). Therefore, accurate carry data E 12 to 12th bit can be obtained by the carry computer 13C which is formed by the combination of the 5-input AND circuit 10C and the OR circuit 11C. Similarly, accurate carry data E 16 to 16th bit can be obtained by the carry computer 13D which is formed by the combination of the 5-input AND circuit 10D and the OR circuit 11D. An operation in which two binary numbers can be added in the example of Fig. 5 will be summarized with reference to Fig. 8. Initially, two binary numbers are divided into 4 sections of 4 bits and additions are performed for these 4 sections of 4 bits in steps 101 to 104. Then, carry data e 4 obtained in step 101 directly becomes accurate carry data to 4th bit (at step 105), and accurate carry data E 8 to 8th bit is calculated (in step 106) from the carry data e 4 and added result of 5 bits obtained in step 102. Accurate carry data E 12 to 12th bit is calculated (in step 107) from the carry data E 8 and added result of 5 bits obtained in step 103, and accurate carry data E 16 to 16th bit is obtained (in step 108) from the carry data E 12 and added result of 5 bits obtained at step 104. Finally, less significant 4 bits of the added result in step 101 directly become less significant 4 bits (c 3 ... c 0 ) of added result finally obtained (in step 109). Then, data of 4 bits (c 7 ... c 4 ) is obtained (in step 110) by adding the carry data e 4 to the less significant 4 bits of the added result at step 102. Data of 4 bits (c 11 ... c 8 ) are obtained (in step 111) by adding the carry data E 8 to less significant 4 bits of the added result in step 103, and data of 4 bits (c 15 ... c 12 ) are obtained (in step 112) by adding the carry data E 12 to less significant 4 bits of the added result in step 104. The carry data E 16 becomes data c 16 which is finally provided as the most significant bit (MSB) (in step 113). Let us now evaluate a total calculation time T x of the example shown in Fig. 5, in which two input data assume binary numbers of n bits and the addition is performed under the condition that these input data are divided by m bits each. That is, n = km (k is an integer) is established and the adders 9A to 9D are replaced with k m-bit adders. In that case, the calculation times of the carry computers 13B, 13C and the like are approximately the same as the calculation time t of one 1-bit full adder so that, when the circuilt similar to that of the example of Fig. 7 is employed as the A4 blocks 12B, 12C or the like, the calculation times of the A4 blocks 12B, 12C or the like become substantially t . Thus, the total calculation time T x is expressed as: T x ≒ {m + (k - 2) + 1} t = (m + k - 1) t Thus, the total calculation time T x in this example can be considerably reduced as compared with the total calculation time T 1 (equation (1)) of the prior-art example shown in Fig. 1. However, this calculation time T x is slightly longer as compared with the total calculation time T 2 (equation (2A) or (2B)) of the carry select adder system of the prior-art example shown in Fig. 2. When the circuit in the example of Fig. 6 is employed as the A4 blocks 12B, 12C or the like, the total calculation time T x is provided as a value which results from adding m t to the equation (4). The circuit scale of the example of Fig. 5 is made smaller than that of the carry select adder system because the circuit shown in Fig. 5 does not employ the multiplexer. Further, while the carry computers 13B, 13C and so on are supplied with only data of (m + 1) bits, the carry look ahead circuits 3A, 3B and the like in the example of Fig. 2 are supplied with data of (2m + 1) bits, the circuit scale of the carry computers 13B, 13c and the like can be reduced to substantially 1/2 as compared with that of the carry look ahead circuits 3A, 3B and the like. From this standpoint, there is then the advantage that the overall circuit scale can be made small. Another adding circuit which does not fall within the scope of the present invention will be described with reference to Fig. 9. In this adding circuit, the present invention is applied to an adding circuit which produces a binary number of 10 bits (c 9 , c 8 ...c 0 ) by adding two binary numbers of 9 bits (a 8 ...a 0 ) and (b 8 ...b 0 ). In this adding circuit, input data of 9 bits are divided to provide 4 bits, 2 bits and 3 bits from the least significant bit (LSB). In Fig. 9, reference numeral 19 designates a 4-bit adder, 20 a 2-bit adder and 21 a 3-bit adder, respectively. These adders 19, 20 and 21 perform the additions of binary numbers which are divided into 4 bits, 2 bits and 3 bits, respectively. Carry data e 4 of the adder 19 and an added result of less significant 2 bits of the adder 20 are supplied to different input terminals of a 3-input AND circuit 22, respectively, and output data of this 3-input AND circuit 22 and carry data e 6 of the adder 20 are supplied to an OR circuit 24A, from which there is derived accurate carry data E 6 to the 6th bit. Then, accurate carry data E 8 to the 9th bit is calculated from the carry data E 6 , an added result of less significant 3 bits of the adder 21 and carry data e 9 of the adder 21. Further, in Fig. 9, reference numeral 25 designates an adder (A2 block) which adds data e 4 of 1 bit to the binary numbers of 2 bits and reference numeral 26 designates an adder (A3 block) which adds data E 6 of 1 bit to the binary numbers of 3 bits. An added result of less significant 4 bits of the adder 19, an added result of 2 bits of the A2 block 25 and an added result of 3 bits of the A3 block become final added results (c 8 ... c 0 ) and the carry data E 9 directly becomes a value c 9 of final 9th bit. The operation and effects of the example of Fig. 9 are the same as those of the example of Fig. 5 and therefore need not be described. An accumulator which is a first embodiment of the present invention will be described with reference to Figs. 10 and 11. In this embodiment, the present invention is applied to an accumulator circuit which produces a sum s (S 8 ... S 1 , S 0 ) of 9 bits by accumulating numbers x (X 8 ... X 1 , X 0 ) of less than 9 bits which are sequentially supplied thereto. Fig. 10 shows an accumulator of this embodiment. Referring to Fig. 10, three 3-bit adders 204A to 204C are formed of three 1-bit full adders, delay registers 203 0 to 203 8 and 205A to 205B are provided, each of which has clear and clock terminals, and data holding registers 206 0 to 206 8 and 207A and 207B are provided, each of which has a clock terminal (each of these registers is represented by reference letter R in Fig. 10 for simplicity). Further, there is shown a 6-bit adder 208 which is comprised of six 1-bit full adders. In this embodiment, 0 is supplied to carry input terminal CI of the 3-bit adder 204A, and data x 0 (LSB) to x 2 of less significant 3 bits of the number x to be added are respectively supplied to one input terminals of the first bit input terminal b 0 to the third bit input terminal b 2 of the 3-bit adder 204A. Sum output of 3 bits therefrom are respectively supplied through the delay registers 203 0 to 203 2 to the other input terminals of the first bit input terminal b 0 to the third bit input terminal b 2 of the 3-bit adder 204A. A carry output to 4th bit produced at the carry output terminal CO of the delay register 204A is supplied through the delay register 205A to the carry input terminal CI of the 3-bit adder 204B. Data x 3 to x 5 of 3 bits of the number x to be added are respectively supplied to one input terminals of the first bit input terminal to the third input terminal of the 3-bit adder 204B, and sum outputs of 3 bits therefrom are respectively supplied through the delay registers 203 3 to 203 5 to the other input terminals of the first bit input terminal to the third bit input terminal. A carry output to 4th bit (7th bit as the numbers x) is supplied through the delay register 205B to the carry input terminal CI of the 3-bit adder 204C. Simultaneously, data of more significant 3 bits x 6 to x 8 of the numbers x to be added are respectively supplied to one input terminals of the first to the third input terminals of the 3-bit adder 204C and sum outputs of 3 bits therefrom are respectively supplied through the delay registers 203 6 to 203 8 to the other input terminals of the first to third input terminals of the 3-bit adder 204C, while its carry output terminal CO being opened. Sum outputs of 3 bits from the 3-bit adder 204A are accumulated by the data holding registers 206 0 to 206 2 and provided as less significant 3 bits s 0 to s 2 of the sum s. A carry output of the 3-bit adder 204A is supplied through the data holding register 207A to one input terminal of the first bit b 0 input terminal of the 6-bit adder 208 and 0 is supplied to the carry input terminal CI and one input terminals of the second bit b 1 and third bit b 2 input terminals of the 6-bit adder 208. The sum outputs of 3 bits from the 3-bit adder 204B are respectively supplied through the data holding registers 206 3 to 206 5 to the other input terminals of the first bit b 0 to third bit b 2 input terminals of the 6-bit adder 208. A carry output of the 3-bit adder 204B is supplied through the data holding register 207B to one input terminal of the fourth bit b 3 input terminal of the 6-bit adder 208, and 0 is supplied to one input terminals of the fifth bit b 4 and sixth bit b 5 input terminals of the 6-bit adder 208. Sum outputs of 3 bits from the 3-bit adder 204C are respectively supplied through the data holding registers 206 6 to 206 8 to the other input terminals of the fourth bit b 3 to sixth bit b 5 input terminals of the 6-bit adder 208, and a carry output terminal CO of the 6-bit adder 208 is opened. Sum outputs of 6 bits from the 6-bit adder 208 become more significant 6 bits S 3 to S 8 of the sum s which is the accumulated result. An operation of this accumulator will be described with reference to Figs. 11A to 11E. In that case, the numbers x to be sequentially supplied are represented n numbers (n is an integer larger than 2) of x 1 to x n and the bit arrangement of the number x i (i = 1 to n) is expressed by (x n8 (MSB) to x n1 , x n0 (LSB)). Further, the numbers x 1 to x n are sequentially supplied at a predetermined cycle and a cycle of a clock pulse  1 supplied to the delay registers 203 0 to 203 8 , 205A and 205B is made coincident with the former predetermined cycle. Also, a clock pulse  2 supplied to the data holding registers 206 0 to 206 8 and 207A and 207B occurs only when the sum s of the numbers x 1 to x n is finally generated in the expression of ordinary 9 bits. In this embodiment, 0 is set as delay outputs of the delay registers 203 0 to 203 8 , 205A and 205B by a reset pulse R for initialization and the numbers x 1 (x 18 ... x 10 ) added during the first cycle are supplied thereto. The resultant added results are the numbers x 1 (Fig. 11A), whereby the numbers x 1 are generated as the sum outputs of the 3-bit adders 204A to 204C and two carry outputs are both 0. When the clock  1 is generated, the sum outputs and the carry outputs (i.e., accummulated results of the previous time) of the 3-bit adders 204A to 204C are respectively fed through the delay registers 203 0 to 203 8 , 205A and 205B to the input sides of the 3-bit adders 204A to 204C and approximately and simultaneously numbers x 2 (x 28 ... x 20 ) added during the second cycle are supplied to the input sides of the 3-bit adders 204A to 204C, whereby outputs (s 28 ... s 20 ), c 23 and c 26 are obtained as sum outputs of the 3-bit adders 204A to 204C, a carry output to the third bit and a carry output to the sixth bit. The expression of the accumulated result of the sum outputs (s 28 ... s 20 ) and the carry outputs c 23 and c 26 is what might be called a redundancy expression. Since the above-mentioned redundancy expression is employed in this embodiment, when the numbers of 9 bits are added, it is not necessary to await that the carry output propagates from the first bit to the ninth bit gradually. Then, the carry output c 23 to the fourth bit and carry output c 26 to the seventh bit are added altogether during the next third cycle. Accordingly, assuming that T represents the calculation time of the 1-bit full adder, then the calculation time required by the accumulator of this embodiment to add data of 9 bits is equal to calculation times 3T of the 3-bit adders 204A to 204C. Therefore, according to this embodiment, there is the substantial advantage that the calculation time can be reduced to 1/3 as compared with the example of Fig. 4. Further, as the circuits necessary for accumulation itself in this embodiment, only the registers 205A and 205B are additionally provided as compared with the example of Fig. 4. There is then the advantage that the circuit scale of this embodiment is made not so large. During the third cycle, in response to the clock pulse 1 excited, the sum outputs (s 28 ... s 20 ) and the carry outputs c 23 and c 26 are fed through the delay registers 203 0 to 203 8 and 205A and 205B back to the input sides of the 3-bit adders 204A to 204C and simultaneously numbers x 3 (xs 38 ... x 30 ) of the third cycle are supplied to the input sides of these 3-bit adders 204A to 204C, thereby generating sum outputs (s 38 ... S 30 ), a carry output c 33 to the fourth bit and a carry output c 36 to the seventh bit as shown in Fig. 11C. Similarly, during the fourth cycle, sum outputs (s 48 ... s 40 ) and carry outputs c 43 and c 46 are obtained as shown in Fig. 11D, and during an n'th cycle, outputs (s n8 ... s n0 ) and c n3 and c n6 are obtained as sum outputs of the 3-bit adders 204A to 204C, a carry output to the fourth bit and a carry output to the seventh bit, respectively. These sum outputs and carry outpputs are redundant expressions of accumulated results of the numbers x 1 to x n of n number and can be employed in actual practice without modification. However, in order to facilitate the succeeding processing, according to this embodiment, such redundant expressions are converted into the expressions of ordinary 9 bits. More specifically, the clock pulse 2 is generated at the completion of the addition of n cycles thereby to hold the sum outputs (s n8 ... s n0 ) and the carry outputs c n3 and c n6 in the data holding registers 206 0 to 206 8 and 207A and 207B. Then, the sum outputs and the carry outputs are added as shown in Fig. 11E, thereby obtaining the sum s (s 8 ... s 1 , s 0 ) of 9 bits as the accumulated result of the ordinary expression. In that case, the addition of the less significant 3 bits is executed by outputting the less significant 3 bits (s n2 , s n1 , s n0 ) of the Sum outputs (s n8 ... s n0 ) directly, whereas the addition of the more significant 6 bits is executed by the 6-bit adder 208. As described above, according to this embodiment, since the accumulated result of the redundant expression is returned to the ordinary expression, the succeeding processing can be made with ease. The accumulator in the example of Fig. 10 may be generalized as shown in Fig. 12, and this type of accumulator will be described with reference to Fig. 12. In Fic. 12, reference numerals 209 0 to 209 p-1 designate r-bit adders (p and r are integers larger than 2), 203 0 to 203 pr-1 , 205 to 205 p-2 designate delay registers, 2060 to 206 pr-1 and 207 to 207 p-2 designate data holding registers and 210 designates a pr-bit adder. The aforenoted respective circuits are connected similarly to those of the example of Fig. 10. According to the example shown in Fig. 12, sums s (s pr-1 ... s 1 , s 0 ) of pr bits are obtained by accumulating numbers x (xp r-1 ... x 1 , x 0 ) of less than pr bits. In that case, the sums s are expressed as redundant by the sum outputs of the r-bit adders 209 0 to 209 p-1 and the carry outputs. In the example of Fig. 12, the addition of the pr bits is executed at r bits each. If the accumulated result, for example, is obtained in the form of sums of (pr ± 1) bits, any one of these r-bit adders 209 0 to 209 p-1 may be replaced with an adder of (r ± 1) bits. Further, since a calculation time required by the accumulator of the example of Fig. 12 to add the pr bits one time is substantially equal to individual calculation times rT of the r-bit adders 209 0 to 209 p-1 , there is then the advantage that calculation times necessary for various purposes can be obtained by adjusting the value of r. Furthermore, although the addition of a (p - 1) r-bit adder 210 needs a calculation time of (p - 1) rT, it is to be eppreciated that the total calculation time is hardly affected by the calculation time in the (p - 1) r-bit adder 210 because only the addition in the (p - 1) r-bit adder 210 is performed after n (n >> 1) accumulations are executed. Having described preferred embodiments of the invention with reference to the accompanying drawings, it is to be understood that the invention is not limited to those precise embodiments and that various changes and modifications thereof could be effected by one skilled in the art without departing from the scope of the invention as defined in the appended claims.

Claims: An accumulator for accumulating a plurality of binary numbers (x) sequentially supplied thereto, comprising: at least three adders (204; 209) each for adding two plural-bit operands represented by parallel bits supplied thereto and having a carry output and, for each of the plural bits, a bit sum output, each said binary number being sequentially supplied to said adders (204; 209) by having the bits thereof distributed in contiguous groups to respective ones of said adders (204: 209) as their first operands, whereby the adders (204; 201) add bit groups of different orders; delay registers (203, 205) for delaying the bit sum output and the carry output of each of said at least three adders (204; 209) by a predetermined time to be added to the next sequentially supplied binary number (x) by the delayed bit sum outputs of each adder (204; 209) being supplied back to that adder (204; 209) as the respective bits of the second operand to be added to the bit group of same order from said next binary number (x), and by the delayed carry outputs being supplied as a carry input to the adder (204; 209) arranged to add the bit groups of next higher order; and a carry corrector (208; 210) supplied with the accumulated result represented redundantly by the combination of the bit sum outputs and the carry outputs of all of said at least three adders (204; 209) and arranged to correct said bit sum outputs by said carry outputs to generate an accumulated added result having no redundancy. An accumulator according to claim 1, wherein said carry corrector comprises a multiple-bit adder (208; 210) for adding two multiple-bit operands represented by parallel bits supplied thereto, bit-sum outputs of said at least three adders being supplied thereto as the first one of said multiple-bit operands, and the carry outputs of said at least three adders, interspaced by zero bits, being supplied thereto as the second one of said multiple-bit operands. An accumulator according to either one of claims 2 or 3, comprising data holding registers (206,207) for supplying the bit sum output and the carry output of each of said at least three adders to the carry corrector when the data holding registers (206, 207) are supplied with a clock pluse ( 2 ).

Inventors: OKI MITSUHARU, YAMAZAKI TAKAO, OKI, MITSUHARU, YAMAZAKI, TAKAO
Applicants: SONY CORP, SONY CORPORATION
Application year: 1990
Main classification: G06F7
IPC codes: G06F7