High speed digital parallel multiplier

Abstract: A plurality of multiplicand bit transmission lines (a₀ , a₁ , ...) and a plurality of multiplier bit transmission lines (b₀ , b₁ , ...) or their decoding signal transmission lines (Bj) are arranged in a two-dimensional plane, and partial product generators (P) are arranged at their intersections. A plurality of rows of first multi-input adders (3W, 4W,...) are arranged at predetermined numbers of rows, and at least one row of second multi-input adders (4W, 6W,...) are arranged at predetermined numbers of the first multi-input adders. A basic cell (6D₃ , ...) is formed by a predetermined number of partial product generators and one first multi-input adder, and the basic cells are repetitively arranged to obtain a rectangular configuration.

Description: The present invention relates to a multiplier, and more particularly, to a high speed digital parallel multiplier, which is, for example, used as a multiplier block in an integer calculating unit (IU) or a floating-point calculating unit (FPU) incorporated into a microprocessor or a digital signal processor (DSP). In general, in order to carry out multiplication of an M-bit operand (multiplicand) and an N-bit operand (multiplier) both in a binary form, each of the multiplicand bits is multiplied by each bit of the multiplier to generate a partial product bit at each logical bit position. As a result, a plurality of partial product bits appear at the same logical bit positions, so they are compressed to a final pair of sum and carry bits by way of multi-stage multi-input adders at each logical bit position. Finally, the final pair is input to a carry-propagate adder (CPA) to obtain a product bit at each logical bit position. For this purpose, multi-input adders and partial product (bit) generators are arranged in a two-dimensional plane. As methods of arrangement of adders, there are two methods; a carry save adder array (CSA) method and a Wallace tree method. The CSA method processes bits one by one to supply three signals to a v-th stage three-input adder (a one-bit full adder):- one partial product bit, a carry signal from a (v-1)-th stage adder located at a one-bit lower bit position, and a sum signal from a (v-1)-th stage adder located at the same bit position as the v-th stage adder. This is similar to a manual calculation method, where the layout thereof corresponds to the logic and is regular, and therefore, the design of layouts is easy. However, in the CSA method, since the execution time depends upon the number of bits of the multiplier, it is difficult to achieve high speed operation. On the other hand, in the Wallace tree method, three partial product bit signals are supplied to a first stage one-bit full adder which is called a three-input Wallace tree circuit "3W", the sum signal generated is input to a second stage full adder at the same bit position, and the carry signal is input to a second stage full adder at one-bit higher bit position. Thus each of a second or a higher stage multi-input adder accepts a plurality of sum and carry signals from the lower stage multi-input adders, to compress them to a pair of sum and carry signals at that stage. In the Wallace tree method, although the speed of operation is high, the input-output relationships between the v-th stage adder and the (v-1)-th one are different at each logical bit position. WO-A-9000773 discloses an M x N-bit multiplier comprising: M multiplicand bit transmission lines arranged obliquely (or step-wise linearly) to a first direction; N multiplier bit transmission lines arranged along a second direction perpendicular to the first direction; and (M+N) x N partial product generators, each provided at one intersection (i,j) between i-th virtual lines along said first direction, i-th column, and j-th multiplier bit transmission lines, j-th row, to generate a partial product bit Pr,j at the (r+j)-th logical bit position. R(=2) rows of (M+N) first stage S-input adders are provided, where N/S ≤ R ≤ N/S+2, each of the adder rows being arranged between every S partial product generator rows, as well as additional rows of v-th stage multi-input adders, each adder being arranged adjacently to a (v-1)-th adder in a column and compressing pairs of sum and carry signals from (v-1)-th stage multi-input adders all located in the i-th and (i-1)-th columns, no sum signal coming from a (v-1)-th adder located in a different column from the v-th stage multi-input adders. Each of the highest stage multi-input adders produces a final pair of sum and carry signals for generating a product bit at each bit position, the highest stage number geing dependent on the number of R. The second to the highest stage multi-input adders in addition to sets of S partial product generators and the first stage S-input adders are all located in the i-th column forming one basic cell, and each first stage adder in the cell compresses S partial product bits from generators inside the cell, to generate a pair of a sum signal Si,j and a carry signal Ci,j at the (i+j)-th logical bit position. All the highest stage multi-input adders in the same cell also generate sum and carry signal pairs at each stage at the (i+j)-th logical bit position. M+N basic cells are arranged in a matrix to form a full array of partial product generators and Wallace tree adders in accordance with the (M+N) x N partial product generator array and the multi-input adder rows, each set of S generators in a basic cell in the i-th column processing a different set of multiplicand bit signals, to make a layout configuration of said array of said multiplier approximately rectangular by inserting dummy sets of S generators and a first stage multi-input adder. Finally, a carry propagate adder CPA is provided to generate product bits from final pairs of sum and carry signals at each bit position. In the layout of another prior art high-speed multiplier, the arrangement of the adder is a parallelogram similar to a lozenge which creates empty areas, i.e., useless areas, thus reducing the integration density of the multiplier. In the layout approach described in WO-A-9000773, the empty area is filled by dummy partial product generators and multi-input adders to make the shape of the multiplier rectangular. Although this approach removes empty areas, it requires a large amount of dummy circuits and the area thus laid out remains large. In order to save this kind of dummy area in a high-speed multiplier layout, a new layout scheme is necessary, which will be described later with reference to the present invention. A multiplier whose arrangement is rectangular with no dummy circuits has already been suggested (see: JP-A-55-105732), which will be later explained. This multiplier, however, is based on the carry save adder array, so the speed of operation is far slower than those multipliers based on the Wallace tree method, if N is large. Therefore, it is not suitable for a high speed multiplier with a wide bit width, which is increasingly in demand. An object of the present invention is to provide a multiplier which is easy to lay out with a high degree of integration and high speed operation without introducing a large amount of dummy circuit units. According to a first embodiment of the present invention, there is provided an MxN-bit multiplier comprising: M multiplicand bit transmission lines arranged along a first direction; N multiplier bit transmission lines arranged along a second direction perpendicular to the first direction; MxN partial product generators, each provided at an intersection (i,j) between said i-th multiplicand bit transmission line, i-th column, and said j-th multiplier bit transmission line, j-th row, to generate a partial product bit P r,j at the r+j'+th logical bit position; R rows of M first stage S-input multi-input adders, where N/S ≤ R ≤ N/S+2, each of said adder rows being arranged between every S partial product generator rows; said S partial product generators and said first stage S-input adders being located adjacently in the i-th column forming one basic cell and at least one partial product generator in the cell processing the i-th multiplicand bit, and said adder in the cell compressing S partial product bits from generators inside or outside the cell, to generate a pair of sum signal S p,q and a carry signal C p,q at the p+q'th logical bit position; at least one row of higher stage multi-input adders, each v-th stage adder, v ≥ 2, being arranged adjacently to a v-1'+th stage adder in a column and compressing pairs of sum and carry signals from v-1'+th stage multi-input adders, at least one input sum signal coming from a v-1'+th stage adder located in a different column from said v-th stage adder, each of the highest (v mx -th) stage multi-input adders producing a final pair of sum and carry signals for generating a product bit at each bit, the number of said stages (v mx ) being dependent on the number R; MxR basic cells arranged in a matrix to form a main array of partial product generators and divided Wallace tree adders in accordance with said MxN partial product generator array and said multi-input adder rows, each set of S generators in a basic cell in the i-th column processing the same set of multiplicand bit signals including the i-th signal, to make a layout configuration of said array of said multiplier approximately rectangular, said matrix including all the necessary partial product generators in said expanded matrix for obtaining the complete set of product bits; and a carry-propagate adder to generate the product bits from said final pairs of sum and carry signals at each bit. According to a second embodiment of the present invention, there is provided an MxN bit multiplier comprising: M multiplicand bit transmission lines arranged along a first direction; N1 sets of transmission lines for the k-th order modified Booth decoding signals corresponding to N multiplier bits, arranged along a second direction perpendicular to the first direction, where N/k ≤ N1 ≤ N/k + 1; MxN1 partial product generators, each provided at one intersection (i,j) between said i-th multiplicand bit transmission line, i-th column, and said j-th set of transmission lines, j-th row, to generate a partial product bit P r,j at the r+j-th logical bit position; R rows of M first stage S-input multi-input adders, where N1/S ≤ R ≤ N1/S+2, each of said adder rows being arranged between every S partial product generator rows; said S partial product generators and said first stage S-input adders being located adjacently in the i-th column forming one basic cell and at least one partial product generator in the cell processing the i-th multiplicand bit, and said adder in the cell compressing S partial product bits from generators inside or outside the cell, to generate a pair of a sum signal S p,q and a carry signal C p,q at the p+q-th logical bit position; at least one row of higher stage multi-input adders, each v-th stage adder, v ≥ 2, being arranged adjacently to a v-1+th stage adder in a column and compressing pairs of sum and carry signals from v-1'+th stage multi-input adders, at least one input sum signal coming from a v-1'th stage adder located in a different column from said v-th stage adder, each of the highest (V mx -th) stage multi-input adders producing a final pair of sum and carry signals for generating a product bit at each bit, the number of said stages (V mx ) being dependent on the number R; MxR basic cells arranged in a matrix to form a main array of partial product generators and divided Wallace tree adders in accordance with said MxN1 partial product generator array and said multi-input adder rows, each set of S generators in a basic cell in the i-th column processing the same set of multiplicand bit signals including the i-th signal, to make a layout configuration of said array of said multiplier approximately rectangular, said matrix including all the necessary partial product generators in said expanded matrix for obtaining the complete set of product bits; and a carry-propagate adder to generate the product bits from said final pairs of sum and carry signals at each bit. In both of the above embodiments of the present invention, the laid out configuration of the main array of the multiplier is rectangular and there is no empty area or extra dummy circuit area in spite of implementing a high-speed multiplier based on the Wallace tree method. This means a compact high-speed multiplier with a high integration density can be realized, based on the present invention. Furthermore, the main array is constructed by repetitive placement of basic cells of the same kind. For a better understanding of the invention, and to show how the same may be carried into effect, reference will now be made, purely by way of example, to the accompanying drawings in which: Fig. 1 is a diagram illustrating a prior art multiplication process; Fig. 2 is a block circuit diagram of an 8-input Wallace tree circuit; Fig. 3 is a logic circuit diagram of a 3-input Wallace tree circuit (a full adder); Fig. 4 is a block circuit diagram of an example of 4-input Wallace tree circuit; Fig. 5 is a logic circuit diagram of another example of 4-input Wallace tree circuit; Fig. 6 is a schematic block circuit diagram illustrating a prior art multiplier using a 2nd-order modified Booth algorithm; Fig. 7 is a block circuit diagram illustrating a prior art 22 x 22 bit multiplier using a 2nd-order modified Booth algorithm; Fig. 8 is a partial detailed block circuit diagram of the circuit of Fig. 7; Figs. 9A and 9B are block circuit diagrams of the block 3D of Fig. 7; Fig. 10 is a block circuit diagram of the partial product generator P of Figs. 8, and 9B; Fig. 11A is a block circuit diagram of the 2nd-order modified Booth decoder; Fig. 11B is a logic circuit diagram of the 2nd-order modified Booth decoder; Fig. 12A is a block circuit diagram illustrating another prior art multiplier using a 2nd-order modified Booth algorithm; Fig. 12B is a logic circuit diagram of the partial product generator P with a full adder of Fig. 12A; Fig. 13A is a diagram illustrating 8 x 8 bit multiplication using a 2nd-order modified Booth algorithm; Fig. 13B is a block circuit diagram illustrating a Wallace tree configuration realizing an adder array for the multiplication of Fig. 13A; Fig. 14 is a block circuit diagram of an 18-input Wallace tree circuit; Figs. 15A and 15B are block circuit diagrams for explaining the principle of the present invention; Fig. 16 is a block circuit diagram illustrating an embodiment of the multiplier according to the present invention; Fig. 17 is a detailed block circuit diagram of the block 6D 3 of Fig. 16; Fig. 18 is a diagram of the symbols of the block 6D 3 of Fig. 16; Fig. 19 is a block circuit diagram of the block 6D 3L of Fig. 16; Fig. 20 is a block circuit diagram of the block 6D 4H of Fig. 16; Fig. 21A is a diagram of the symbols of the block P h of Fig.16; Fig. 21B is a logic circuit diagram of the block P h of Fig. 16; Fig. 22A is a diagram of the symbols of the 2-input Wallace tree circuit 2W of Fig. 16; Fig. 22B is a logic circuit diagram of the 2-input Wallace Tree circuit 2W of Fig. 16. Fig. 23 is a block circuit diagram of the block 6E 3A of Fig. 16; Fig. 24 is a block circuit diagram of the block 4W 3 of Fig. 16; Fig. 25 is a block circuit diagram of the block 4W 4H of Fig. 16; Fig. 26 is a block circuit diagram of the block 12G of Fig. 16; Fig. 27 is a block circuit diagram of the block 12F of Fig. 16; Fig. 28 is a block circuit diagram of the block 7D 3 . Figs. 29 and 30 are block circuit diagrams of modifications of the block 3D of Fig. 17; Fig. 31 is a block circuit diagram of a modification of the block 3D' or 3D" of Fig. 29 or 30; Figs. 32 and 33 are block circuit diagrams of multipliers combining a plurality of the blocks of Figs. 29 and 30; Fig. 34 is a block circuit diagram of a pipeline vector processing unit to which the present invention is applied; and Fig. 35 is a block circuit diagram of the multiplier circuit of Fig. 34. In Fig. 1, which illustrates a previously tried 8 x 8 bit multiplication process, a multiplicand X is designated by a 0 to a 7 , and a multiplier Y is designated by b 0 to b 7 . Here, X and Y are represented by a complement based on 2, and their most significant bits (MSB) a 7 and b 7 are sign bits. First, a partial product PP j (j = 0 - 7) is obtained multiplying X (a 7 , a 6 , ..., a 0 ) by b j (j = 0 - 7). Then, a final product X·Y is obtained by accumulating partial products PP 0 , PP 1 , ..., and PP 7 . In this case, each sum Z i (i = 0 - 14) for one bit is calculated, and the sums Z i (i = 0 - 14) are accumulated. As illustrated in Fig. 1, in order to calculate sum Z i , an 8-bit input adder, i.e., an 8-input Wallace tree circuit "8W" as illustrated in Fig. 2 is required. This 8-input Wallace tree circuit 8W has six full adder circuits "3W" as illustrated in Fig. 3. Therefore, if the processing time of the full adder (3-input Wallace tree circuit) 3W is τ, the processing time of 8-input Wallace tree circuit 8W is 4τ. In Fig. 2, note that references C IN (1, 1), C IN (1, 2), ... designate carry-in signals from the lower bit position, and references C OUT (1, 1), C OUT (1, 2), ... designate carry-out signals to the higher bit position. Contrary to the above, recently a multi-input adder circuit is divided into units of 4 inputs, so as to repeat the operation of a 4-input Wallace tree circuit "4W" as illustrated in Fig. 4, thus constituting a digital parallel multiplier. In this case, when the multiplier is made of a large scale integrated circuit (LSI), a complex circuit such as an 8-input Wallace tree circuit 8W or other multi-input Wallace tree circuit with more inputs is unnecessary, and the logic and layout of the multiplier is carried out by a relatively simple configuration, thereby reducing the number of design steps. Note that, if the 4-input Wallace tree circuit 4W is constructed as illustrated in Fig. 5, an 8-input adding process can be 3τ, thereby increasing the speed of the operation of the entire multiplier. In order to increase the operation speed of the entire multiplier, a modified Booth algorithm has been suggested as illustrated in Fig. 6, which uses a 2nd-order modified Booth algorithm. In Fig. 6, references PP 0 , PP 1 , PP 2 , and PP 3 designate partial product generators; B 0 , B 1 , B 2 , and B 3 designate 2nd-order Booth (Y) decoders; and AA designates an adder array. Each of the partial product generators PP 0 , PP 1 , PP 2 , and PP 3 generate 0, ±X, ±2X in response to the outputs of the Y decoders B 0 , B 1 , B 2 , and B 3 , respectively. The resultant outputs of the partial product generators PP 0 , PP 1 , PP 2 , and PP 3 are added together at the adder array AA. According to the Modified Booth algorithm, the number of partial product generators is reduced (see Fig. 1), thereby increasing the speed of the addition operation. An actual 22 x 22 bit multiplier using a 2nd-order modified Booth algorithm is illustrated in Fig. 7. In Fig. 7, references REGX and REGY designate a multiplicand register for storing a multiplicand X defined by bits a 0 to a 21 , and a multiplier register for storing a multiplier Y defined by bits b 0 to b 21 . Reference "3D" designates a block formed by three partial product generators P and a 3-input Wallace tree circuit 3W as illustrated in Fig. 8, and "5D" designates a block formed by three partial product generators P, 3-input Wallace tree circuit 3W and a 4-input Wallace tree circuit 4W, as illustrated in Fig. 8. Note that the 3-input Wallace tree circuit 3W and the 4-input Wallace tree circuit 4W of the block 5D serve as a 5-input adder. Also, the block 3D is illustrated in Figs. 9A and 9B, and the partial product generator P is illustrated in Fig. 10. Also, the Y decoder B j of Fig. 7, which is called a 2nd-order Booth decoder, is illustrated in Figs. 11A and 11B. Returning to Fig. 7, CPA designates a carry propagation adder. As illustrated in Fig. 7, the entire multiplier is parallelogrammic, not rectangular, to create an empty area E 1 on the right bottom and an empty area E 2 on the left top, i.e., useless areas where circuit elements cannot be arranged are generated, thereby reducing the integration density of the entire multiplier. In order to avoid this, a convolution method is usually carried out, i.e., the circuit located at the bottom of the empty area E 2 is inserted into the empty area E 1 , to make the entire multiplier rectangular. Another method to remove the empty areas like E 1 and E 2 in Fig. 7 is described in WO-A-9000773, where the empty areas are filled with dummy partial product generators and multi-input adders. The layout of such a multiplier is easy since all the rows consist of a basic cell comprised of two 3D and 5D pairs and a 4W in a case corresponding to that shown in Fig. 7. However, about double the number of 3D and 5D blocks are necessary as compared with the layout in Fig. 7, and the occupied area of such a multiplier remains large. Another approach to achieve high density of the multiplier blocks is illustrated in Figure 12A as a modification of Fig. 6 (see: Japanese Unexamined Patent Publication (Kokai) No. 55-105732). In Fig. 12A, partial product generators P are connected by the carry save method. Correction terms are inputted as V DD to some basic cells, so that partial product generators for sign transmission are unnecessary to simplify the multiplier. Note that Fig. 12 illustrates one basic cell (P) composed of the partial product generators and a full adder in Fig. 12B. In Fig. 12A, although the integration density of the entire multiplier can be improved by using iterative array of basic cells, the speed of the operation is low because of its CSA array structure. Note that the number of adders through which signals pass between the multiplicand register and the adder CPA is 4 at maximum. On the other hand, if the adder array AA of Fig. 6 is constructed by a Wallace tree configuration, the Wallace tree configuration carries out an addition operation as illustrated in Fig. 13A where an 8 x 8 bit multiplication using a 2nd-order modified Booth algorithm is shown. In Fig. 13A, references Z 0 to Z 8 designate partial products, S 0 to S 3 designate correction terms for negative numbers, and "1" designates a correction term for signs. A final product X·Y is represented by Z 0 to Z 14 , and the maximum significant bit Z 14 designates a sign. In this case, the number of inputs to a Wallace tree circuit is 5 at maximum, and therefore, a Wallace tree configuration as illustrated in Fig. 13B is adopted. That is, a 5-input adder is realized by a 6-input Wallace tree circuit 6W where one input is fixed at "0". By using such a Wallace tree configuration, the number of adders through which signals pass between the multiplicand register and the adder CPA is 3 at maximum, thereby improving the speed of the operation, as compared with the multiplier of Fig. 12A. In the above-mentioned Wallace tree configuration, however, the circuit is not regular, and therefore, it is difficult to design. Particularly, when designing a multiplier for multi-bit data of 8 x 8 bits or more, the impact of the above-mentioned problem is large. For example, as illustrated in Fig. 14, an 18-input Wallace tree circuit 18W has a large number of connections between full adders (3-input Wallace tree circuit 3W) and partial product generators which generate input signals to the 18A in addition to other connections C IN (1, 1), C IN (1, 2), ..., C OUT (1, 1), C OUT (1, 2), .... between the 18-input Wallace tree circuits 18W. Note that C IN (1, 1), C IN (1, 2), ... designate carry-in signals from the lower bit position, and C OUT (1, 1), C OUT (1, 2), ... designate carry-out signals for the higher bit position. In the prior art described in US-A-4752905, Wallace tree adder stages, which may be either based on the Booth algorithm or not, are replaced by a combination of the carry save adder array type and the Wallace tree type. By introducing the carry save adder type in the Wallace tree stages, the complexity of the input-output relationships between the v-th stage adders and the (v-1)-th stage ones is reduced, which leads to a simpler wiring among the adders. However, the speed becomes slower, and this approach is not feasible for multipliers of a pure Wallace tree type to which the present invention relates. In an embodiment of the present invention, instead of a multi-input Wallace tree circuit such as the 18-input Wallace tree circuit 18W of Fig. 14, partial product generators including the 18-input Wallace tree circuit 18W of Fig. 14 are replaced by a block 18D formed by two blocks 9D and a 4-input Wallace tree circuit 4W, as illustrated in Fig. 15A. Note that the block 9D is formed by three blocks 3D and a 6-input Wallace tree circuit 6W, as illustrated in Fig. 15B, and that in the present invention, use is made of the repetition of small scale circuits, to simplify the layout of the multiplier, and also to increase the speed of operation. The first embodiment of the multiplier according to the present invention, is an M-bit X N-bit multiplier utilizing a bit-by-bit multiplication method without Booth decoding, the divided Wallace tree configuration, and no sign bit expansion to the most significant bit of the product in positive binary numbers. The detail is omitted and only the conditions to realize this kind of multiplier are described in detail. Fig. 16 illustrates the second embodiment of the multiplier according to the present invention, that is, a 22-bit X 22-bit multiplier utilizing the modified second order Booth algorithm, and the divided Wallace tree configuration. The multiplier is formed by blocks 6D 3 , 6D 3L , 6D 4H , 6E 3B , 6E 3C , 6E 3L , 6E 4H , 4W 3 , 12G, 12F, and a carry propagate adder (CPA). Note that references B 0 to B 20 designate the decoding signal sets from the second order Booth decoders corresponding to the multiplier bits b 0 ∼ b 21 . Hereinafter, the details of the multiplier of Fig. 16 will be explained with reference to Figs. 17 through 27. In Fig. 17, which is a detailed block circuit diagram of the block 6D 3 in Fig. 16, 6D blocks in three columns, i.e., three bits of the multiplicand, are illustrated. Two rows of basic cells 3D's and a row of a 4W block are arranged in this block 6D. The basic cell 3D consists of three partial product generators and a first stage 3-input adder 3W located in the same column as referred to in the figure. The 4W in the lowest row is a second stage 4-input adder. The 3D(i,j) in an upper row in the i-th column generates a sum signal S i,j and a carry signal C i,j at the (i+j)-th logical bit position as output signals of a first stage adder 3W. All the three output signals, i.e. partial product bit signals, from the partial product generators in 3D(i,j) are input to the first stage adder 3W in the same basic cell as the generators. The 3D(i,j+6) in a lower row in the i-th column generates a sum signal S i,j+6 and a carry signal C i,j+6 at the (i+j+6)-th logical bit position as output signals of a first stage adder 3W. As the two basic cells, 3D(i,j) and 3D(i,j+6) in the i-th column, generate signals at different logical bit positions, the sum signals thus generated are input to the second stage 4-input adders in different columns from each other. The sum signal S i,j generated in 3D(i,j) is input to a second stage adder 4W in the (i-3)-th column, and the sum signal S i,j+6 generated in 3D(i,j+6) is input to a second stage adder in the (i+3)-th column. The same is true for the carry signals. The above-mentioned layout scheme of the divided Wallace tree method is quite different from the layout in the prior art. For instance, in Fig. 8, the sum signal S i,j generated in 3D(i,j) in the upper row of the i-th column is input to a second stage adder 4W in the same column, and the sum signal S i-6,j+6 generated in 3D(i-6,j+6) in the lower row of the i-th column is input to a second stage adder also in the same column. Thus all the basic cells in the i-th column generate such signals which are input to the second stage adder in the i-th column. The same is true for the carry signals. In the layout scheme embodying the present invention, at least one partial product generator in each basic cell in the i-th column processes the i-th multiplicated bit signal to generate a partial product bit P i,j if the generator is in the j-th column. As the two basic cells in the same column cannot occupy the same row, this means that the partial product generators in the i-th column which process the i-th multiplicand bit, generate product bits mutually different at the logical bit position, and this results in generating sum and carry signal pairs in mutually different logical bit positions by the first stage adders in the basic cells in the same column. Thus the wiring scheme is a little complicated, but the layout rule that at least one partial product generator in the basic cell in the i-th column processes the i-th multiplicand bit (this is the reason why the multiplicand bit transmission lines have to be arranged along a first direction, i.e. a column direction), ensures that the main array of basic cells does not expand up to (M+N) columns, but is limited to M plus a few columns. On the contrary, in the prior art shown in Fig. 7 and in WO-A-9000773, rows of cell arrays of (M+N) columns are required, though the wiring scheme between the v-th and (v-1)-th stage adders is simpler than that of the present invention. In these cases, the multiplicand bit transmission lines do not have to be arranged along a first direction (in a column direction), because only one partial product generator in the i-th column (in the uppermost row) processes the i-th multiplicand bit, and no other partial product generators in the i-th column process the i-th multiplicand bit, as is seen from Fig. 7 and Fig. 8. The simplicity of the connections between different stage adders is obtained at the cost of larger area associated with a cell array, almost double the area compared with the present invention in the case of M=N. The wiring scheme based on the present invention is not too complex, because the basic cells are arranged regularly based on a simple rule in a two-dimensional plane. A repetitive set of wiring patterns will suffice for connections between the v-th multi-input adders and the (v-1)-th ones. For instance, the wiring of a sum signal from the first stage 3-input adder 3W in a basic cell 3D in the uppermost row is done by lengthening the signal line by 3 bit positions horizontally toward a lower multiplicand bit position, and then it is drawn vertically to the input terminal of a second stage 4-input adder 4W located in the lowest row in Fig. 17. The carry signal line from the same basic cell is lengthened horizontally by 2 bit positions toward a lower multiplicand bit position and then it is drawn vertically to connect to an input terminal of a 4W located at one bit higher position. The sum signal line from a basic cell in the middle row in the figure is lengthened horizontally by 3 bit positions toward a higher multiplicand bit position and then it is drawn vertically to the input terminal of a second stage 4-input adder 4W located in the lowest row in Fig. 17. The carry signal line from the same basic cell is lengthened horizontally by 3 bit positions toward a higher multiplicand bit position and then it is drawn vertically to connect to an input terminal of a 4W located at one bit higher position. Thus the sum and carry signal lines of two basic cells located adjacently in the same column are extended in mutually opposite horizontal directions to minimize wiring area and length, which may make it possible to draw the lines over the basic cells and to save extra wiring space. The wiring in this case can be done with repetitive wiring patterns in every 3-bit column unit. A similar wiring scheme is adopted for connecting other stage adders. The wiring in this case can be done with repetitive wiring patterns in units of 6-bit columns. A compact layout, therefore, may be possible even in the presence of wiring lines to connect between different stage adders. The block 6D 3 * is a modification of the block 6D 3 . That is, in the block 6D 3 *, two signals a i-6 and a i-7 supplied to the partial product generators P located on the right side of the block 6D 3 are fixed at "0". In Fig. 19, which is a detailed block circuit diagram of the block 6D 3L of Fig. 16, this block 6D 3L is used for processing the least significant bit. In Fig. 19, a modification is added to the block 6D 3 of Fig. 17, to add +1 to the addition result when a decoding result by a 2nd-order Booth decoder is negative. In Fig. 20, which is a detailed block circuit diagram of the block 6D 4H of Fig. 16, this block 6D 4H is used for processing the most significant bit. In Fig. 20, a modification is added to the block 6D 3 of Fig. 17, to process a sign in accordance with a decoding result by a 2nd-order Booth decoder. Note that a block P h is represented by Fig. 21A and is constructed as shown in Fig. 21B. Also, a 2-input Wallace tree circuit 2W is represented by Fig. 22A and is constructed as shown in Fig. 22B. Note that there are a few basic cells whose number S is smaller than that of other basic cells in the same row. It depends on the number of partial product bits to be processed in the basic cell, as seen in the two leftmost columns in Fig. 20. That is to say, in the 23rd and the 24th columns, only two partial product generators have to be processed, so the first stage adders are two-input adders 2W, and not 3-input adders. In these columns, there are spaces where no partial product generator is assigned at the intersection of the row and the column, and so these spaces are filled with partial product generators moved from the higher bit column. In the basic cells located in the uppermost row in Fig. 20, such generators are those which produce P 21,j+4 and P 22,j+4 . BY adopting this scheme, the necessary number of columns to include all the partial product generators for producing the full product bits is reduced, and the occupied area of the multiplier becomes smaller by the reduced number. The number of inputs to the second stage adder 3W in the 24th column is reduced from four to three, as only one first stage adder exists at this logical bit position. In Fig. 23, which is a detailed block circuit diagram of the block 6E 3A of Fig. 16, one of the inputs of the lower side Wallace tree circuit 3W of this block is "0" or "1", not the output signal of a partial product generator. That is, because, when adding a decoding result of Booth decoder, a correction process is carried out without extending each decoding output bit to the most significant bit (i.e., 42-th bit) of the product, and therefore, this correction is carried out for the addition of bits higher than the second bit. In order to carry out a correction calculation, block 6E 3A , is modified to obtain the block 6E 3B . That is, one input of the lower side Wallace tree circuit 3W located between a i and a i-2 is "0", and one input of the lower side Wallace tree circuit 3W located at the bit a i-1 is "1". Also, the 6E 3A block, is modified to obtain the block 6E 3C . That is, one input of the lower side Wallace tree circuit 3W located between a i and a i-2 is "1", and one input of the lower side Wallace tree circuit 3W located at the bit a i-1 is "0". The 6E 3B and 6E 3C blocks are alternately arranged. Note that, although one of the inputs of the right upper side Wallace tree circuit 3W is "0", in the block 6E 3A , output signals from partial product generators are allocated to the Wallace tree circuits 3W in the blocks 6E 3B and 6E 3C . The block 6E 3L is obtained by modifying the block 6E 3A in the same way as in the modification of the block 6D 3 to the 6D 3L block. Also, the block 6E 4H is obtained by modifying the block 6E 3A in the same way as in the modification of the block 6D 3 to the block 6D 4H . In Fig. 24, which is a detailed circuit diagram of the block 4W 3 of Fig. 16, the block 4W 3 is constructed by three 4-input Wallace tree circuits 4W as illustrated in Fig. 4 or 5. In Fig. 25, which is a detailed circuit diagram of the block 4W 4H of Fig. 16, the block 4W 4H is constructed by three 4-input Wallace tree circuits 4W as illustrated in Fig. 4 or 5, and one 3-input Wallace tree circuit 3W as illustrated in Fig. 3. In Fig. 26, which is a detailed circuit diagram of the block 12G of Fig. 16, the block 12G is constructed by 2-input Wallace tree circuits 2W as illustrated in Figs. 22A and 22B, and 3-input Wallace tree circuit 3W as illustrated in Fig. 3. In Fig. 27, which is a detailed circuit diagram of the block 12F of Fig. 16, the block 12F is constructed by only connections between the blocks. In Fig. 16, CPA designates an adder of the carry propagation type which carries out an addition operation for sum signals and carry signals from the Wallace tree circuits such as 4W 3 in each bit, and obtains a final output. Note that all the partial product generators are arranged in a 25(=M+3) x 11(=N1=N/k with k=2) basic cell array and 4(=R=N1/S+1 with S=3) rows of first stage 3-input adders, two rows of second stage 4-input adders and a row of third stage 4-input adders are arranged in a matrix of the 22(=M)-bit x 22(=N)-bit multiplier. Furthermore, one partial product generator, the one in the uppermost row, in the basic cell in the i-th column processes the i-th multiplicand bit, at least one sum signal to the v-th stage adder comes from a (v-1)-th stage adder located in a different column from the v-th one, where v=2 and 3, and each set of 3(=S) generators in a basic cell in the i-th column processes the same set of multiplicand bit signals including the i-th, as can be seen in 6D and 6E blocks in the i-th column. Thus, in the above-mentioned embodiment, most of a multiplier can be laid out only by arranging the blocks 6D 3 , 6E 3A , and 4W 3 and their modified blocks with superpositioned connections, and a correspondence between a logic and a layout is set up in each block. As a result, the design is remarkably easy, as compared with the prior art. Therefore, the layout result does not include redundant areas, so as to increase the integrated density. Also, since a multi-input adder is divided into 4-input Wallace tree circuits 4W having a high speed, it thereby increases the speed of the operation. Note that, in the above-mentioned embodiment, although the multi-input adder processes every three bits, the present invention is not limited thereto. For example, in the case of addition for 28 bits, as illustrated in Fig. 28, the inputs are first divided into 3-input and 4-input groups in a 7D 3 block, and then output signals from these groups are added in the blocks 4W. Then, 28-bit addition by a Wallace tree configuration is carried out for each bit by using four 7D 3 blocks and three 4W blocks. In case of 32 inputs, 4-input addition blocks are repetitively used. In Figs. 29 and 30, which are modifications of the block 3D of Fig. 17 and the like, each block 3D' or 3D" is also formed by three partial product generators P and a 3-input Wallace tree circuit 3W. Although the 3-input Wallace tree circuit 3W of the block 3D of Fig. 17 or the like receives three product signals from the three partial product generators P within the same block 3D, the 3-input Wallace tree circuit 3W of the block 3D' or 3D" of Fig. 29 or 30 receives two product signals from the other blocks 3D' or 3D" as well as one product signal from the same block. For this purpose, the same multiplicand bit is supplied to inputs of all the partial product generators P of one block 3D' or 3D". The circuits of Figs. 29 and 30 will be explained in detail below. In the block 3D' of Fig. 29, a product signal of the upper located partial product generator P is supplied to the 3-input adder 3W of a block separated by two bits (= 2 k-1 where k is the order of the modified Booth algorithm,) in the right direction from the block 3D'. Also, a product signal of the middle located partial product generator P is supplied to the 3-input adder 3W of the same block 3D'. Further, a product signal of the lower located partial product generator P is supplied to the 3-input adder 3W of a block separated by two bits (= 2 k-1 ) in the left direction from the block 3D'. In other words, a product signal of a block separated by two bits in the left direction and a product signal of a block separated by two bits in the right direction as well as a product signal of the same block 3D' are supplied to the 3-input adder 3W of the block 3D'. Similarly, in the block 3D" of Fig. 30, a product signal of the upper located partial product generator P is supplied to the 3-input adder 3W of a block separated by four bits (= 2 k ) in the right direction from the block 3D". Also, a product signal of the middle located partial product generator P is supplied to the 3-input adder 3W of a block separated by two bits (2 k-1 ) in the right direction from the block 3D". Further, a product signal of the lower located partial product generator P is supplied to the 3-input adder 3W of the same block 3D". In other words, a product signal of a block separated by four bits (= 2 k ) in the left direction and a product signal of a block separated by two bits (= 2 k-1 ) in the left direction as well as a product signal of the same block 3D" are supplied to the 3-input adder 3W of the block 3D". Similarly, in a block 3D"' (not shown), a product signal of the lower located partial product generator P is supplied to the 3-input adder 3W of a block separated by four bits (= 2 k ) in the left direction from the block 3D"'. Also, a product signal of the middle located partial product generator P is supplied to the 3-input adder 3W of a block separated by two bits (= 2 k-1 ) in the direction from the block 3D"'. Further, a product signal of the lower located partial product generator P is supplied to the 3-input adder 3W of the same block 3D"'. In other words, a product signal of a block separated by four bits (= 2 k ) in the right direction and a product signal of a block separated by two bits in the right direction as well as a product signal of the same block 3D"' are supplied to the 3-input adder of the block 3D"'. The blocks 3D' and 3D" of Figs. 29 and 30 are applied to a block formed by four partial product generators and a 4-input Wallace tree circuit (adder) as illustrated in Fig. 31. In a block 4D of Fig. 31, a product signal of the first partial product generator P is supplied to the 4-input adder 4W of a block separated by three bits (= 3 x 2 k-2 ) in the right direction from the block 4D. Also, a product signal of the second partial product generator P is supplied to the 4-input adder 4W of a block separated by one bit (2 k-2 ) in the right direction from the block 4D. Further, a product signal of the third partial product generator P is supplied to the 4-input adder 4W of a block separated by one bit (= 2 k-1) in the left direction from the block 4D. Further, a product signal of the fourth partial product generator P is supplied to the 4-input adder 4W of a block separated by three bits (= 3 x 2 k-2 ) in the left direction from the block 4D. In other words, a product signal of a block separated by three bits in the left direction, a product signal of a block separated by one bit in the left direction a product signal of a block separated by one bit in the right direction, and a product signal of a block separated by three bits in the right direction are supplied to the 4-input adder 4W of the block 4D. Fig. 32 shows a multiplier formed by three rows of the blocks 3D' of Fig. 29. A sum signal of the upper block 3D' is shifted by 6 bits in the right direction, and is supplied to the corresponding 6-input Wallace tree circuit 6W, and a carry-out signal of the upper block 3D' is shifted by 5 bits in the right direction, and is supplied to the corresponding 6-input Wallace tree circuit 6W. Also, a sum signal of the middle block 3D' is not shifted, and is supplied to the corresponding 6-input Wallace tree circuit 6W, and a carry-out signal of the middle block 3D' is shifted by 1 bit in the left direction, and is supplied to the corresponding 6-input Wallace tree circuit 6W. Further, a sum signal of the lower block 3D' is shifted by 6 bits in the left direction, and is supplied to the corresponding 6-input Wallace tree circuit 6W, and a carry-out signal of the lower block 3D' is shifted by 7 bits in the left direction, and is supplied to the corresponding 6-input Wallace tree circuit 6W. Similarly, three rows of the blocks 3D" of Fig. 30 are combined to form a multiplier as illustrated in Fig. 33. That is, in Fig. 33, a sum signal of the upper block 3D" is shifted by 12 bits in the right direction, and is supplied to the corresponding 6-input Wallace tree circuit 6W, and a carry-out signal of the upper block 3D' is shifted by 11 bits in the right direction, and is supplied to the corresponding 6-input Wallace tree circuit 6W. Also, a sum signal of the middle block 3D" is shifted by 6 bits in the right direction, and is supplied to the corresponding 6-input Wallace tree circuit 6W, and a carry-out signal of the middle block 3D" is shifted by 5 bits in the right direction, and is supplied to the corresponding 6-input Wallace tree circuit 6W. Further, a sum signal of the lower block 3D" is not shifted, and is supplied to the corresponding 6-input Wallace tree circuit 6W, and a carry-out signal of the lower block 3D" is shifted by 1 bit in the left direction, and is supplied to the corresponding 6-input Wallace tree circuit 6W. In Figs. 32 and 33, all the blocks are the same, but it is possible to combine different types of blocks. For example, the block 3D" of Fig. 33 can be replaced with the block 3D' of Fig. 29. In this case, the sum signals of the upper, middle, and lower blocks 3D' are shifted by 10, 4, and 0 bits, respectively in the right direction, and the carry-out signals of the upper, middle, and lower blocks 3D' are 9, 3 bits in the right direction, and 1 bit in the left direction, respectively. Also, in Figs. 32 and 33, if the block 4D of Fig. 31 is used, a sum signal of an upper block is shifted by 16 bits in the right direction, and is supplied to the corresponding 6-input adder 6W. Also, a carry-out signal is shifted by 15 bits in the right direction and is supplied to the corresponding 6-input adder 6W. The same thing applies to the other blocks. In the above-mentioned embodiment, although the use of a 2nd order modified Booth algorithm is a premise, a higher-order modified Booth algorithm such as a three-bit Booth algorithm, or a method for directly multiplying a multiplier with a multiplicand can be applied. As explained above, according to the present invention, the layout of the entire multiplier can be a rectangle to increase the density of integration and to increase the speed of operation. Also, since the correspondence between logic and layout is easy, the design of multipliers can be easily made. Note that the multiplier according to the present invention can be manufactured by one integrated circuit (IC) chip. The multiplier according to the present invention can be used advantageously in a multiplication block of an integer calculating unit (IU) or a floating-point calculating unit (FPU) incorporated in a microprocessor or a digital signal processing unit (DSP). If a multiplier is large due to the small integration density, it is impossible to incorporate all of such a multiplier into the above-mentioned units. For example, in order to carry out a 54 x 54 bit multiplication, a 54 x 27 bit multiplier for a multiplication of a mantissa is incorporated into the unit, to repeat the operation of the multiplier twice. As a result, the multiplication time is twice as long as addition time or subtraction time. In this regard, since the multiplier according to the present invention is of a rectangular configuration having a regular arrangement including connections, to have a high density of integration. The multiplier according to the present invention can be optimized for such a 54 x 54 bit multiplier so that the multiplication time is the same as the addition time or the subtraction time. For example, the multiplier according to the present invention is applied to a pipeline vector processor unit as illustrated in Fig. 34. In Fig. 34, the pipeline vector processor unit is connected between an external memory 3401 and a central processing unit (CPU) or the integer calculation unit (IU) 3409. The pipeline vector processor includes a pipeline load unit 3402, a pipeline store unit 3403, a bus 3404, a vector register/scalar register 3405, addition calculation blocks 3406 and 3407, and a control unit 3408. The calculation block 3406 includes an addition/subtraction circuit (ADD) and a shift circuit (SFT), and the calculation block 3407 includes a multiplier circuit (MPY) and a division circuit (DIV). When a multiplication is carried out, a vector multiplication instruction is supplied from the CPU 3409 to the control unit 3408. In this case, operand data (multiplicands and multipliers) required for such a multiplication is fetched by a load instruction of the CPU 3409 from the external memory 3401 and is stored via the pipeline load unit 3402 in the vector register of the vector unit/scalar unit 3405. Upon detection of such data being stored in the vector register, the control unit 3408 operates the multiplier circuit (MPY) via multiplexers MUX, so that a multiplication result is again stored in the vector register. In this state, upon receipt of a store instruction of the CPU 3409, the control unit 3408 moves the multiplication result from the vector register via the pipeline store unit 3403 to the external memory 3401. Note that, if the capacity of the vector register is large, a calculation such as multiplication can be carried out without fetching from the external memory 3401, to increase the speed of operation. The multiplier circuit of Fig. 34 is illustrated in more detail in Fig. 35. In Fig. 35, 3501 and 3502 designate registers for receiving operand 1 and operand 2, respectively, 3503 a sign/exponent alignment, 3504 an adder, 35 a subtracter, 3506 an incrementer, 3507 an overflow detector, 3508 a mantissa alignment, 3509 a Booth decoder, 3510 a Booth selector and Wallace tree circuit, 3511 a carry propagation adder (CPA), 3512 a normalizing/rounding circuit, 3513 a sign register, and 3514 a register. The present invention relates to the Booth selector and Wallace tree configuration 3510.

Claims: An MxN-bit multiplier comprising: M multiplicand bit transmission lines arranged (a 0 ,a 1 ,...) along a first direction (X); N multiplier bit transmission lines (b 0 ,b 1 ,...) arranged along a second direction (Y)) perpendicular to the first direction; MxN partial product generators (P), each provided at an intersection (i,j) between said i-th multiplicand bit transmission line, i-th column, and said j-th multiplier bit transmission line, j-th row, to generate a partial product bit P r,j at the r+j'+th logical bit position; R rows of M first stage S-input multi-input adders (4W), where N/S ≤ R ≤ N/S+2, each of said adder rows being arranged between every S partial product generator rows; said S partial product generators and said first stage S-input adders being located adjacently in the i-th column forming one basic cell and at least one partial product generator in the cell processing the i-th multiplicand bit, and said adder in the cell compressing S partial product bits from generators inside or outside the cell, to generate a pair of sum signal S p,q and a carry signal C p,q at the p+q'+th logical bit position; at least one row of higher stage multi-input adders (4W,6W), each v-th stage adder, v ≥ 2, being arranged adjacently to a v-1'+th stage adder in a column and compressing pairs of sum and carry signals from v-1'+th stage multi-input adders, at least one input sum signal coming from a v-1'+th stage adder located in a different column from said v-th stage adder, each of the highest (v mx -th) stage multi-input adders producing a final pair of sum and carry signals for generating a product bit at each bit, the number of said stages (v mx ) being dependent on the number R; MxR basic cells arranged in a matrix to form a main array of partial product generators (P) and divided Wallace tree adders (2W,3W,4W) in accordance with said MxN partial product generator array and said multi-input adder rows, each set of S generators in a basic cell in the i-th column processing the same set of multiplicand bit signals including the i-th signal, to make a layout configuration of said array of said multiplier approximately rectangular, said matrix including all the necessary partial product generators (P) in said expanded matrix for obtaining the complete set of product bits; and a carry-propagate adder (CPA) to generate the product bits from said final pairs of sum and carry signals at each bit. An MxN bit multiplier comprising: M multiplicand bit transmission lines (a 0 ,a 1 ,...) arranged along a first direction (X); N1 sets of transmission lines (Bj) for the k-th order modified Booth decoding signals corresponding to N multiplier bits, arranged along a second direction (Y) perpendicular to the first direction, where N/k ≤ N1 ≤ N/k + 1; MxN1 partial product generators (P), each provided at one intersection (i,j) between said i-th multiplicand bit transmission line, i-th column, and said j-th set of transmission lines, j-th row, to generate a partial product bit P r,j at the r+j'+th logical bit position; R rows of M first stage S-input multi-input adders (4W), where N1/S ≤ R ≤ N1/S+2, each of said adder rows being arranged between every S partial product generator rows; said S partial product generators (P) and said first stage S-input adders (4W) being located adjacently in the i-th column forming one basic cell and at least one partial product generator in the cell processing the i-th multiplicand bit, and said adder in the cell compressing S partial product bits from generators inside or outside the cell, to generate a pair of a sum signal S p,q and a carry signal C p,q at the p+q'+th logical bit position; at least one row of higher stage multi-input adders (4W,6W), each v-th stage adder, v ≥ 2, being arranged adjacently to a v-1'+th stage adder in a column and compressing pairs of sum and carry signals from v-1+th stage multi-input adders, at least one input sum signal coming from a v-1'th stage adder located in a different column from said v-th stage adder, each of the highest (V mx -th) stage multi-input adders producing a final pair of sum and carry signals for generating a product bit at each bit, the number of said stages (V mx ) being dependent on the number R; MxR basic cells arranged in a matrix to form a main array of partial product generators (P) and divided Wallace tree adders (2W,3W,4W) in accordance with said MxN1 partial product generator array and said multi-input adder rows, each set of S generators in a basic cell in the i-th column processing the same set of multiplicand bit signals including the i-th signal, to make a layout configuration of said array of said multiplier approximately rectangular, said matrix including all the necessary partial product generators (P) in said expanded matrix for obtaining the complete set of product bits; and a carry-propagate adder (CPA) to generate the product bits from said final pairs of sum and carry signals at each bit. A multiplier as set forth in claim 1 or 2, wherein at least one basic cell has a number S smaller than that of other basic cells in the same row, depending on the number of partial product bits to be processed in the basic cell. A multiplier as set forth in any of claims 1 to 3, wherein all the S partial product generators (P) in each basic cell in the i-th column process the i-th multiplicand bit signal, and S partial product bit signals thus generated, P i,j1 , P i,j2 ..., P i,js , are input to respectively different first stage S-input adders in the same row. A multiplier as set forth in any of claims 1 to 4, wherein only one partial product bit signal, P i,j in the j-th row, is input to the first stage S-input adder (4W) in the same basic cell, to generate a signal pair of S i,j and C i,j at the i+j'-th logical bit position. A multiplier as set forth in claim 1 or 2, wherein only one of the S partial product generators (P) in each basic cell in the i-th column processes the i-th multiplicand bit signal to generate P i,j when said one partial product generator is in the j-th row, and the other S-1 partial product generators process the i-1'+th, the i-2'+th, the i-3'+th ..., and the i-(S-1)'th signals, respectively, whereby all S partial product bit signals thus generated, P i,j1 , P i-1,j+1 , ..., P i-S+1,j+S-1 , are input to the first stage S-input adders (4W) in the same basic cell, to generate a signal pair of S i,j and C i,j at the i+j'th logical bit position. A multiplier as set forth in claim 2, wherein only one of the S partial product generators (P) in each basic cell in the i-th column processes the i-th multiplicand bit signal to generate P i,j when said one partial product generator is in the j-th row and the other S-1 partial product generators process the i-k'+ th, the i-2k'+th, the i-3k'+th, ..., and the i-(S-1)k'+th signals, respectively, whereby all S partial product bit signals thus generated, P i,j , P i-k,j+k , ..., P i-k·S+k,j+k·S-k , are input to the first stage S-input adders in the same basic cell, to generate a signal pair of S i,j and C i,j at the i+j'+th logical bit position. A multiplier as set forth in any preceding claim, wherein one sum signal to the v-th stage multi-input adder (4W) in the il-th column comes from the v-i'+th stage multi-input adder in the i2-th column, and another input signal to the same v-th stage adder comes from the v-1'+th stage adder in the i3-th column, where i1 ≥ 0,i2>i1+1 and i3<i1-1. A multiplier as set forth in claim 8, wherein the following relationships among i1, i2 and i3 hold for the v-th and the v-1'-th stage multi-input adders (4W,6W) in said array; i2 = i1 + i0, i3 = i1 - i0, and i0>1. A multiplier as set forth in claim 9, wherein said value of i0 is dependent on v and i0 is larger for a larger v value. A multiplier as set forth in claim 1 or 2, modified in that some of said basic cells comprise less than S partial product generators and a corresponding multi-input adder so as to reduce the necessary number of columns to include all the partial product generators for producing the complete set of product bits, output signals of the two types of basic cells being input to one of said v-th stage multi-input adders (4W,6W) to thereby generate signals of the corresponding bit position.

Inventors: GOTO GENSUKE, GOTO, GENSUKE
Applicants: FUJITSU LTD, FUJITSU LIMITED
Application year: 1991
Main classification: G06F7
IPC codes: G06F7