Abstract:
This invention purposes a reduced-width low-error multiplier that can be used in the DSP (Digital Signal Processing) approach of digital communication system. We derive a binary compensation vector to compensate the error caused by the reduction of area without any hardware overhead. We also implement the compensation structure in Array and Booth multiplier to reduce hardware complexity.

Description:
FIELD OF THE INVENTION  
         [0001]    This invention reveals a reduced-width multiplier that has small errors. It can be used in processing digital signals of a communication system usch as timing recovery circuit, carrier recovery circuit and FIR filter.  
         BACKGROUND OF THE INVENTION  
         [0002]    In the face of the recent fast progress in communication, computation methods have become more complicated. The demand for multipliers is escalating, and efficient multiplier design is deemed important. A currently important topic is how to design a multiplier characterized by low power and area-saving, while meeting the requirements of the integrated circuit design and its applications.  
           [0003]    The operation of a multiplier is basically the expansion of a multiplicand ( 104 ), according to the value of a multiplicator ( 100 ), resulting in a parallelogram as shown in FIG. 1. The construction involves several steps. Expand a multiplicand ( 104 ) in accordance with a multiplicator ( 100 ), arrange them by positional weight, and finally add up all the values found in the summation row to produce a product ( 105 ). The summation row includes two parts, i.e. the sum of low bits (LP,  101 ), and the sum of high bits (MP,  102 ). If a multiplicand X has a bit length of m, and a multiplicator Y has a bit length of n, then the product PD will have (m+n) bits. As regards the application of digital communication, the bit number (m+n−p) required by a product is not necessarily (m+n), but some where in between max(m,n) and (m+n), depends on area, computation speed and performance required by the system, such as signal-to-noise ratio (SNR), bit error ratio (BER), etc. In general, we take the first (m+n−p) bits which are the most significant bits. As illustrated in FIG. 1, we take p=n. Error arises between the value we get by taking (m+n−p) bits and the value resulted from taking (m+n) bits.  
           [0004]    Therefore, this invention is to solve a problem, that is, how to save area while reduce error? As far as the (m+n−p) bits we need, this invention uses the first (m+n−p) bits while assigning 0 directly to the lower P bits without any computation, when it comes to Integer fixed-point; or it simply takes the first (m+n−p) bits generated by this invention, when Fractional fixed-point is involved.  
         DESCRIPTION OF THE PRIOR ART  
         [0005]    Amongst existing integrated circuit designs, Array and Booth multipliers are commonly used when it comes to fast computation. As regards signal processing in digital communication, the bit length of a product term is reduced and determined in response to the SNR required by the system. When the bit number of the product is decreased, the computation required is also reduced. At present, there are four types of technology in this regard. FIGS.  2  to  5  illustrate the four methods, using an example of 5×5 with product of six bit integers (m=n=5, p=4).  
           [0006]    [0006]FIG. 2 illustrates method  1  said Rounded Method. Calculation is done on all product terms ( 202 ) up to (m+n) bits. After that, the results between the PD (m+n−1)  bits and the PD p  bits are reserved. This is also known as Truncated Method. An alternative is to round off the PD (p−1)  term of the result, and add it to the preceding term, and is then called Rounded Method. This method is generally adopted by most systems. Complete computation followed by truncation will yield a result, and the error between the result and the original product will be smaller. However, truncating a great amount of product terms which have undergone all the computation, means not only a waste of computation time, but also a waste of the hardware area of computation.  
           [0007]    [0007]FIG. 3 illustrates method  2  said involves truncation followed by computation. Unlike method  1 , this method involves truncating the bit number of a multiplicand and a multiplicator, so as to conform with the requirement of the system regarding the bit number of product ( 302 ). After truncation, the multiplicand and the multiplicator will undergo computation in a traditional multiplier. For example, if both the multiplicator ( 100 ) and the multiplicand ( 104 ) consists of five bits respectively, while the system requires six bits, they will be truncated to three bits respectively. In other words, a 5×5 multiplier is reduced to a 3×3 multiplier, in order to decrease the area. The drawback of this method is that, the bits of a multiplicator and a multiplicand are truncated before computation, leading to the removal of those multiplicators or multiplicands located in relatively higher weighting positions, such as X 1 Y 4 , X 4 Y 1  . . . ( 301 ) and therefore yielding a great error.  
           [0008]    [0008]FIG. 4 illustrates method  3  said involves compensation with a fixed value. In view of the error derived from truncating operation units of relatively low bits, the product is compensated with a fixed value. In this computation, the value to be removed is always found behind the bit of the product term to be removed. The fixed value of compensation is a result of the statistics conducted on the bit number of multiplicator ( 100 )s and multiplicand ( 104 )s. Good examples of this kind are found in the content of U.S. Pat. No. 4,598,382 and Kidambi, S. S. et al. (IEEE Transactions on Circuits and Systems II, Vol. 43, No. 2, pp. 90˜95, 1996). Its underlying theory is that, a certain bit length always yields a certain error, hence it figures out a product ( 403 ) by adding in a fixed value. The example in FIG. 4 uses a fixed compensation value ( 402 ) of 1. The error produced in this method is smaller than that in method  2 , which involves truncation prior to compensation. This method also reduces computation and hardware area. However, due to a fixed compensation value that is independent of the multiplicand or multiplicator is added to the product, the error may still be large. For instance, if both the multiplicator and the multiplicand are 0, then the product shall be zero. However, this method will still compensate the product with a fixed value. Thus, although the average error of this method will be smaller than that produced by truncation followed by computation, but considerable errors still exist in the product for some cases.  
           [0009]    [0009]FIG. 5 illustrates method  4  said involves compensation with an adaptive value. Jou, J. M. et al. (IEEE Transactions on Circuits and Systems II, Vol. 46, No. 6, pp. 836˜842, 1999) figured out a compensation method that the value added to the product term depends on the distribution of the input signals of the multiplicator ( 100 ) and the multiplicand ( 104 ). This method yields an average error or an individual error much smaller than that of method  3  (compensation of fixed value). Nevertheless, Jou, J. M. et al. did not completely take into account of the distribution of input signals and the distribution of the intended compensation, leading to the surplus of hardware area in the compensating circuit as well as unnecessary power consumption.  
           [0010]    This invention keeps all the merits of the above circuits and creates an innovative compensating circuit. It reduces not only power consumption due to the reduction of computation and hardware, but also generates a post-compensation product with error smaller than that found in the design of Jou, J. M. et al.  
         SUMMARY OF THE INVENTION  
         [0011]    This invention reveals a reduced-width low-error multiplier that generates small errors and allows reduction of bit length. It can be used in processing digital signals of a communication system, resulting in a great decrease in the complexity of the circuit of a multiplier.  
           [0012]    This invention also reveals a kind of innovative compensation vector signal, for compensating the errors made as a result of saving area. It applies the idea to Array and Booth multiplier, and reveals a hardware structure that is more area-saving. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0013]    Table 1: The coding method of Booth multiplier  
         [0014]    Table 2: The probability distribution of α n−1 =β−1, β or β+1, with different bit numbers (n)  
         [0015]    Table 3: Evaluation of performance of Array multiplier  
         [0016]    Table 4: Evaluation of performance of Booth multiplier  
         [0017]    [0017]FIG. 1: Operation of multiplication  
         [0018]    [0018]FIG. 2: Diagrammatic illustration of method  1   
         [0019]    [0019]FIG. 3: Diagrammatic illustration of method  2   
         [0020]    [0020]FIG. 4: Diagrammatic illustration of method  3 .  
         [0021]    [0021]FIG. 5: Diagrammatic illustration of method  4 .  
         [0022]    [0022]FIG. 6: Diagrammatic illustration of the operation of reduced-width multiplier in this invention  
         [0023]    [0023]FIG. 7: P1(x I y j ) and the regression curve taken, when n=8  
         [0024]    [0024]FIG. 8: The acquired Array multiplier of 5×5 to 5  
         [0025]    [0025]FIG. 9: The reduced-width Array multiplier and its compensation circuit in this invention (5×5→5)  
         [0026]    [0026]FIG. 10: J. M. Jou Array multiplier and its compensation circuit (5×5 to 5)  
         [0027]    [0027]FIG. 11: An example of reduced-width Array multiplier with 8×8 to 10  
         [0028]    [0028]FIG. 12: Diagrammatic illustration of the Booth multiplication of 8×8 to 16 of the two&#39;s complement system.  
         [0029]    [0029]FIG. 13: Summand operation of the acquired Booth multiplication of 8×8 to 8  
         [0030]    [0030]FIG. 14: Diagrammatic illustration of reduced-width Booth multiplication operation and its compensation terms in 8×8 to 8  
         [0031]    [0031]FIG. 15: The method of operation of summand when the bit number is n+1  
         [0032]    [0032]FIG. 16: An example of the circuit of the summand row processing unit of the reduced-width Booth multiplier  
         [0033]    [0033]FIG. 17: An example of the circuit of the summand processing unit of the Booth multiplier of n+1 bits 
     
    
     REFERENCE NUMBER OF THE ATTACHED DRAWINGS  
       [0034]    [0034] 100  . . . multiplicator(100)  
         [0035]    [0035] 101  . . . the summand of low bits (LP)  
         [0036]    [0036] 102  . . . the summand of high bits (MP)  
         [0037]    [0037] 104  . . . multiplicand ( 104 )  
         [0038]    [0038] 105  . . . product ( 105 )  
         [0039]    [0039] 202  . . . the product arises from method  1   
         [0040]    [0040] 301  . . . the operation removed  
         [0041]    [0041] 401  . . . the operand of low bits to be removed  
         [0042]    [0042] 402  . . . fixed compensation  
         [0043]    [0043] 501  . . . the compensation number relevant to a removed portion  
         [0044]    [0044] 601  . . . the removed portion of lower part of summand  
         [0045]    [0045] 603  . . . the product of a reduced-width, lower-error multiplication  
         [0046]    [0046] 604  . . . the reserved portion of higher part of summand  
         [0047]    [0047] 701  . . . Full-Adder (FA)  
         [0048]    [0048] 702  . . . Half-Adder (HA)  
         [0049]    [0049] 703  . . . the proposed compensation terms and circuit for minimizing error  
         [0050]    [0050] 704  . . . the AND-OR(AO) gate used in method  4   
         [0051]    [0051] 705  . . . the AND used in method  4   
         [0052]    [0052] 801  . . . the value of a complete product  
         [0053]    [0053] 802  . . . the product acquired by method  1   
         [0054]    [0054] 806  . . . the product acquired by this invention  
         [0055]    [0055] 901  . . . coder  
         [0056]    [0056] 902  . . . scaler  
         [0057]    [0057] 903  . . . the operation of the summand  
         [0058]    [0058] 904  . . . the compensation number relevant to the removed part.  
         [0059]    [0059] 1001  . . . the portion of lower bits intended for removal  
         [0060]    [0060] 1002  . . . summand row with non-truncated operation and higher bits  
         [0061]    [0061] 1003  . . . compensation number relevant to the removed part  
       DETAILED DESCRIPTION OF THE INVENTION  
       [0062]    This invention Reduced-Width Low-Error Multiplier reveals a kind of multiplication operation and basic structure that yields small errors and permits reduction of product terms. It can be applied to the design of multipliers for processing digital signals of a communication system.  
         [0063]    If a multiplicand X ( 104 ), has a bit length of m and is denoted by X m-1  . . . X i  . . . X 0 , and a multiplicator Y ( 100 ), has a bit length of n and is denoted by Y n−1  . . . Y j  . . . Y 0 , then the product PD ( 105 ) , will have (m+n) bits and is denoted by PD m+n−1  . . . PD n  . . . PD 0  where i is the ith bit of a multiplicand X and j is the jth bit of a multiplicator Y.  
         [0064]    As regards a reduced-width multiplier operation, as illustrated in FIG. 6, a multiplicand X ( 104 ), has a bit length of m, and a multiplicator Y ( 100 ), has a bit length of n, and the product term PD ( 105 ), needs a bit number of (m+n−p) where p is the bit length of the product term to be removed. This invention will remove the operation that involves the bit number less than required, such as the lower portion (LP,  601 ) of the summand as indicated in FIG. 6. In the example of FIG. 6, we take p=n. This invention makes proper compensation in accordance with the values of a multiplicator ( 100 ) and a multiplicand ( 104 ). The compensation signal ( 602 ) is β, which is the sum of x i y j , when i+j=p−1.  
       β   =         ∑       i   +   j     =     p   -   1                x   i          y   j         =         x     p   -   1            y   0       +       x     p   -   2            y   1       +   …              +       x   1          y     p   -   2         +       x   0          y     p   -   1                                   
 
         [0065]    Add the value of β to the vertical column found at the end of the right-hand side of the higher part of summand ( 604 ). The consequence of the addition is the formation of a multiplication operation that yields a reduced-width multiplier with small error. This new reduced-width low-error error multiplier has the following merits:  
         [0066]    1. It directly eliminates the operation of the least significant bits of product ( 601 ), so that less hardware will be required for the computation, and the computation will be faster.  
         [0067]    2. The amplitude of the compensation signals ( 602 ) of the errors varies with the multiplicator and multiplicand.  
         [0068]    3. The number (P) of product terms to be reduced may vary, and it requires no new structural design.  
         [0069]    The multiplication operation method designed by this invention can be applied to Array multipliers and Booth multipliers, as well as all the operation methods compatible with this invention, so that it gives rise to a structure providing feasible functions of the same effect.  
         [0070]    [0070]FIGS. 9 and 14 illustrates how reduced-width low-error multiplication is applied to Array and Booth multiplier respectively. FIG. 8 shows an conventional Array multiplier of 5×5 to 5 which includes Full-Adder (FA, 701), Half-Adder (HA, 702) array and AND gate. Full-Adder takes three input bits of the same weight ad generates a sum and carry bits. Half-Adder takes two input bits of the same weight ad generates a sum and carry bits. AND gates are used to generate x i y j . Full-Adder (FA,  701 ) and Half-Adder (HA,  702 ) array work together to add up the values of the summand. In FIG. 8, the dotted line indicates the operation that will be removed by this invention.  
         [0071]    [0071]FIG. 9 illustrates the circuits characterized by reduced-width low-error array multiplier of this invention. The circuit includes Full-Adder ( 701 ), AND gate and a compensating circuit ( 703 ). The compensation signal is β, which is the sum of x i y j  when i+j=p−1.  
       β   =         ∑       i   +   j     =     p   -   1                x   i          y   j         =         x     p   -   1            y   0       +       x     p   -   2            y   1       +   …              +       x   1          y     p   -   2         +       x   0          y     p   -   1                                   
 
         [0072]    A new array structure to implement the reduced-width low-error multiplier can be created by adding these compensation vectors to one of the Full-Adder that located in the rightmost column. In FIG. 9, the bits outlined by the dotted line ( 703 ) is a compensation vector introduced by this invention. These bits have weight like that of P 4  and equals x 4 y 0 +x 3 y 1 +x 2 y 2 +x 1 y 3 +x 0 y 4 . The distinguishing features of the invention are that it does not require any other circuit, but only needs to add the value of β directly to one of the existing Full-Adder.  
         [0073]    A generally acquired Booth multiplier includes Booth Coder ( 901 ), a scaler ( 902 ) and summand processing unit. FIG. 12 shows a 8×8 to 16 Booth multiplier. In order to speed up operation and decrease the number row in summand, every three multiplicator bits (Y j+1 , Y j , Y j−1 ) are grouped as an unit to generate an addition row. The two successive units will overlap one bit. Table 1 shows the rule of grouping multiplicator bits. A multiplication by two is done by moving all the data leftward by one bit. Coder does the coding operation. Shifting and complement operations are done by scaler. In Booth multiplier, the number of row in summand can be reduced by 50% due to the coding operation. Take 8×8 to 16 as an example, it decodes a multiplicand (8 bits) according to a multiplicator (8 bits) and gets four rows ( 903 ); each row is different from the previous row in the way that the data of the former is moved leftward by two bits with respect to that of the latter. Users can acquire these four rows with whatever circuit they consider suitable, though the choice usually depends on the required operation speed.  
         [0074]    This invention reduced-width low-error Booth multiplier includes Booth coders, scalers, Full-Adder and Half-Adder array, and compensating circuit. It is characterized by the coding of Booth coders and the shifting and complement operation with a scaler. The coding reduces the number of summand by 50%. Full-Adder takes three input bits of the same weight and generates a sum and carry bits. Half-Adder takes two input bits of the same weight ad generates a sum and carry bits. The compensation signal is β, which is the bit of the (p−1)th vertical column of the original summand. Full-Adder and Half-Adder array work together to add up the values of the summand. β is added to the vertical column found at the end of the right-hand side of the reserved summand.  
         [0075]    [0075]FIG. 14 illustrates an example about the summand processing unit of the reduced-width, low-error Booth multiplier with 8×8 to 8. This invention will remove the operation that involves bit number less than required ( 1001 ) as shown in FIG. 13. However, this invention makes proper compensation in accordance with the values of the multiplicator and the multiplicand. The compensation signal is β, which is 
         β=S 1     —     7   +S   2     —     5   +S   3     —     3   +S   4     —     1   
         [0076]    β is added directly to the vertical column at the end of the right hand side of the reserved summand. Then the summation of the value of β and the reserved portion of the high part of the summand ( 1002 ) form the multiplication operation that yields small error and allows the reduction of bit length.  
         [0077]    The summand processing unit of the of this reduced-width 8×8 to 8 Booth multiplier works like the Array multiplier does, that is, it includes Full-Adder (FA,  701 ) and Half-Adder (HA,  702 ) array, and compensating circuit ( 1003 ). The overall circuit is illustrated in FIG. 16. Full-Adder takes three input bits of the same weight and generates a sum and carry bits. Half-Adder takes two input bits of the same weight and generates a sum and carry bits. Full-Adder (FA,  701 ) and Half-Adder (HA,  702 ) array work together to add up the values of the summand. In FIG. 16, the bit outlined ( 1003 ) by the dotted line is the compensation vector introduced by this invention. Its original positional weight is 
         β= S   1     —     7   +S   2     —     5   +S   3     —     3   +S   4     —     1 . 
         [0078]    β is added to one of the inputs of Full-Adders that are located in the rightmost column. The merit of this structure is that, no extra circuits are required to implement the compensation signal. This is one of the features of this invention.  
       Technical Content and Characteristics  
       [0079]    Equation 1 below represents the formula of a general multiplier. In equation 1, X denotes a multiplicand ( 104 ), Y a multiplicator ( 100 ) and PD a product term ( 105 ).  
             PD   =     XY   =         ∑     i   =   0       m   +   n   -   1              PD   i          2   i         =       (       ∑     i   =   0       m   -   1              X   i          2   i         )                     (       ∑     i   =   0       n   -   1              Y   i          2   i         )                   (Equation  1)                               
 
         [0080]    In this invention, the result of a product is divided into two parts, i.e. the sum of high bits (MP, 102 ) and the sum of low bits (LP, 101 ), while p denotes the number of bit that is to be truncated in the final product ( 105 ). Hence, equation 1 can be re-written as equation 2 and the operations are shown in FIG. 1. In FIG. 1, it is assumed that p is equal to the number (n) of multiplicands.  
             PD   =       MP   +   LP     =         ∑     i   =   p       m   +   n   -   1              PD   i          2   i         +       ∑     i   =   0       p   -   1              PD   i          2   i                     (equation  2)                               
 
         [0081]    In this invention, it is intended that the operation of the summand of low bits (LP, 101 ) should be removed, and the operation of the summand of high bits (MP, 102 ) remain intact. However, the removal of the summand of low bits (LP) operation will lead to a result quite different from the real product ( 105 ) value. By deduction, it is found that the carry from the summand of low bits (LP) to the sum of high bits (MP) is α p−1 . Therefore, we need a compensation amounts which equals α p−1 . According to FIG. 1,  
               α     p   -   1       =     ⌊               1   2          (         x     p   -   1            y   0       +       x     p   -   2            y   1       +   …              +       x   0          y     p   -   1           )       +                   1   4          (         x     p   -   2            y   0       +   …              +       x   0          y     p   -   2           )       +                   1   8          (         x     p   -   3            y   0       +   …              +       x   0          y     p   -   3           )       +   …              +       1     2     p   -   1              (         x   1          y   0       +       x   0          y   1         )               ⌋             (equation  3)                               
 
         [0082]    if we define β as the sum of x i y j  when i+j=p−1, then  
       β   =         ∑       i   +   j     =     p   -   1                x   i          y   j         =         x     p   -   1            y   0       +       x     p   -   2            y   1       +   …              +       x   1          y     p   -   2         +       x   0          y     p   -   1                                   
 
         [0083]    We get equation 4, by dividing the value of α p−1  into two parts, i.e. β and the remaining portion (λ).  
               α     p   -   1       =       ⌊               1   2          (         x     p   -   1            y   0       +   …              +       x   0          y     p   -   1           )       +                   1   4          (         x     p   -   2            y   0       +   …              +       x   0          y     p   -   2           )       +                 1     2     p   -   1              (         x   1          y   0       +       x   0          y   1         )             ⌋     =     ⌊         1   2        β     +   λ     ⌋               (equation  4)                               
 
         [0084]    Jou, J. M. et al. reported a equation of fixed-width method of m=n=p. However, no restriction (i.e. m=n=p) is imposed on the m, n, p of equations 1˜4.  
         [0085]    Given a fixed β value, the number of 1 in the multiplicator or the multiplicand is as follows:  
         [0086]    2β: C( β   n )*C( 0   n-β )*2 0    
         [0087]    2β+1: C( β   n )*C( 1   n-β )*2 1    
         [0088]    2β+2: C( β   n )*C( 2   n-β )*2 2    
         [0089]    2β+(n−β): C( β   n )*C( n-β   n−β)* 2 (n-β)    
         [0090]    Given a fixed β value, the maximum number of bits equal to 1 amongst the bits of a multiplicator (X, 100) or a multiplicand (Y, 104 ), falls between 2β and (n+β). However, the distribution probability between 2β and (n+β) is not uniform.  
         [0091]    Take m=n=p as an example, and also define that, the probability of yielding a product of 1 after the multiplication of x i y j  (the product of one bit of a multiplicator and one bit of a multiplicand) is P 1 (x i y j ).  
                 P   !          (       x   i          y   j       )       =       [         ∑     i   =   0       (     n   -   β     )            (         i   !              (     n   -   β   -   i     )     !       2   i              ·     (       2      β     +   i     )         )             (       ∑     i   =   0       (     n   -   β     )              i   !              (     n   -   β   -   i     )     !       2   i           )     ·   2        n       ]     2             (equation  5)                               
 
         [0092]    In this invention, we employ regression Line analytical method. Take n=8 as an example, the P 1 (x i y j ) and regression curves are shown in FIG. 7. When n=8, 16, 32 &amp; 64, the value of β/n+0.0712 will be the nearest curve to P 1 (x i y j ). If P 1 (x i y j ) is approximated as β/n+0.0712, then we can deduce that λ is  
               λ   =         (           β           n         +   0.0712     )     *     (           n           2         -   1     )       =           β           2         +     0.03556      n     -         β           n         -   0.07112         )           (equation  6)                               
 
         [0093]    The operation described in equation 4 is to directly truncate the product terms., If, in this invention, improvement is made by rounding off the product term, then α p−1  will be expressed in a completely new way as shown in equation 7.  
                     α     n   -   1       =                ⌊       β   2     +   λ   +   0.5     ⌋                 ≅                ⌊       β   2     +     β   2     +     0.03556      n     -     β   n     -   0.07112   +   0.5     ⌋                 =                β   +     ⌊       -     β   n       +     0.03556      n     +   0.42888     ⌋                     (equation  7)                               
 
         [0094]    In the frequently used number of n (4˜16),  
       [       -     β   n       +     0.03556      n     +   0.42888     ]                         
 
         [0095]    can be −1, 0 or +1, depends on the input. Table 2 shows the distribution of the probability of α n−1 =β−1, β or β+1, where n is the bit number of a multiplicator and a multiplicand. This invention reveals that, the greater the value of n, the closer will α n−1 , approximate β. For this reason, this invention can deduce a new compensation vector signal α n−1 =β. The deduction process and the concept of the whole method remain the same, whether p is equal to n or not. In the case of m×n to m+n−p, the operation of product and the value of compensation vector (a dotted line,  602 ) are as shown in FIG. 6.  
         [0096]    It is quite easy to fulfill this innovative compensation signal. FIG. 8 shows an conventional Array multiplier of a 5×5 multiplier; and the dotted line in FIG. 8 indicates the operation to be removed by this invention. The dotted line ( 703 ) in FIG. 9 encloses the circuit for the intended compensation vector of this invention. Adding this compensation vector to the non-truncated portion will give rise to a new array structure, also known as reduced-width Array multiplier. The merit of this structure is that, no other circuits are required to implement the compensation signal. FIG. 10 illustrates the method proposed by Jou, J. M. et al, in which an extra vertical column consists of AND-OR (AO) and AND gate circuit is added. The Array multiplier depicted in FIG. 6 and FIG. 8 applies to the number system with Sign/Un-sign Magnitude. Similar structure is found in the Array multiplieroperated under the two&#39;s complement system.  
         [0097]    Take the 8×8 to 10 (P=6) multiplier, which is depicted in FIG. 11, as an example to illustrate the result of the operation of the known four methods and our invention. As shown in FIG. 11, a 8×8 will generate eight rows of numbers. However, for the purpose of simplicity, the number of rows is reduced to five, by setting the first four numbers of a multiplicator or a multiplicand as 0. As a result, product ( 801 ) represents the product of a complete multiplication; product  2  ( 802 ) is resulted from method  1 , i.e. round-off; product  3  ( 803 ) is the results of method  2 , i.e. truncation followed by computation; product  4  ( 804 ) arises from method  3 , i.e. compensation with fixed value; product  5  ( 805 ) is a result of method  4 , i.e. compensation with adaptive value; while product  6  ( 806 ) is created with this invention. Adding the value of PD (p−1)  to PD p  is exactly what is done by the compensating circuit described in this invention.  
         [0098]    [0098]FIG. 12 illustrates the 8×8 Booth multiplication under the operation of two&#39;s complement system. We use it to explain the usage of this innovative invention and the application of its compensation signal in Booth multiplier. The coder ( 901 ) and the scaler ( 902 ) operate in a way similar to the way they work in conventional Booth multiplier. FIG. 13 shows the summand processing unit of the 8×8 Booth multiplier. FIG. 14 depicts the reduced-width low-error 8×8 to 8 Booth multiplier described in this invention. The result of the simulation performed in FIG. 9 and FIG. 14 will be discussed in details in the following section. In fact, after being processed by a coder ( 901 ), Booth can reduce the amount of numbers for addition from. 8 to. 4. The principle of the mechanism of its summand processing unit is similar to that of the traditional multiplication as shown in FIG. 1.  
       Evaluation of Performance  
       [0099]    Table 3 contains an evaluation of the errors of the reduced-width low-error Array multiplier and that presented by Jou, J. M. et al in 1999. As illustrated in Table 3, when the multiplicand and the multiplicator of a multiplier is 4, 6, 8, 10, 12, 14 or 16, the evaluation of all the possible input signals for average error (ε ave ), the maximum error (ε max ) and the signal-to-noise ratio (SNR) is performed in the way as follows:  
           ɛ   ave          (   %   )       =           average_error               2     2      n       -   1           ×   100      %                 ɛ   max          (   %   )       =           max_error               2     2      n       -   1           ×   100      %               SNR        (   dB   )       =     10                 log        {           E        [       (     real                 product                 term     )     2     ]                 E        {       [       real                 product     -     the                 product                 of                 this                 invention       ]     2     }             }                             
 
         [0100]    where max_error denotes the maximum error between the real product and the product of this invention for all input. average_error is calculated by the following equation  
         (         ∑     i   =   o       2     2      n              real                 product       -     the                 product                 of                 this                 invention       )     /       2     2      n       .                           
 
         [0101]    The average error, maximum error and signal-to-noise ratio of this invention are all better than the results of Jou, J. M. et al. As also explained in the report of Jou, J. M. et al., their results are better than the results obtained by other methods. Hence, the performance of this method surpasses that of any known method. As far as speed and the complexity of circuit are concerned, this invention uses one column of AND-OR(AO) less than that of Jou, J. M. et al. Thus this invetion has smaller area and faster operation speed.  
         [0102]    We implement the 16×16 to 16 reduced-width Array multiplier by using the standard cell library provided by Avant! Cooperation. The results show that the SNR is 90.55 dB, and the number of logical gates is reduced by 48% as compared to the conventional Array multiplier.  
         [0103]    Table 4 shows a comparison of the operation of n×n to n Booth multiplier when a multiplicator and a multiplicand is 4, 6, 8, 10, 12, 14 or 16 respectively. The architecture used in the reduced-width Booth multiplier is like that shown in FIG. 14 and FIG. 16 shows the detailed circuit for the operation of summand.  
         [0104]    In Table 4, the left hand side shows the data of this invention. The data on the right hand side of Table 4 is the results of (n+1) method. In this method, one more column ((n−1)th) of bits in the summand is taken like that shown in FIG. 15 for 8×8 to 9 case. The detail array structure for the operation of summand is shown in FIG. 17.  
         [0105]    According to Table 4, there is an increase of 3 dB (n&gt;8) and a 8% reduction of logical gate number in this method as compared to the result of (n+1) method in the instance of 16×16 to 16.  
         [0106]    The improvement is even more striking, i.e. a 46% reduction of logical gate number, and a SNR of 76.64 dB, as compared to the result of the original Booth multiplier. Therefore, the design of the multiplier in this invention is excellent.  
         [0107]    To sum up, the Invention has the features of creativity, novelty and innovativity. Although the Invention uses just a few better preparation examples disclosed as above, its application will not be limited to them. Anyone who is familiar with the said technique is able to amend and/or apply the said technique partially or totally without going beyond the invention&#39;s spirit and coverage. Thus, the protection coverage of the invention is determined by the descriptions stated in the application of patents.  
                                     TABLE 1                           The coding method of Booth multiplier                Y j+1     Y j     Y j−1     Action                       0   0   0   No           0   0   1   Add to multiplicand           0   1   0   Add to multiplicand           0   1   1   Add to 2×multiplicand           1   0   0   Subtract from 2×multiplicand           1   0   1   Subtract from multiplicand           1   1   0   Subtract from multiplicand           1   1   1   No                      
 
         [0108]    [0108]                                                                     TABLE 2                           The probability distribution curve of α n−1  = β−1, β or β+1, with       different bit numbers (n)                α n−1              n   β−1   β   β+1   Average                    4   5.078E−2   9.496E−1   0   β−0.050       6   3.760E−2   9.624E−1   0   β−0.038       8   4.227E−3   9.958E−1   0   β−0.004       10   4.158E−4   9.956E−1   0   β−4.0E−3       12   2.205E−6   1   0   β−2.2E−6       14   1.602E−7   1   0   β−1.6E−7       16   2.328E−10   1   0   β                    
         [0109]    [0109]                                                                                                         TABLE 3                           Evaluation of the performance of Array multiplier                ∈ ave ( %)       ∈ max ( %)         SNR (dB)                    this   Jou, J. M.   this   Jou, J. M.   this   Jou, J. M.       N   invention   et al.   invention   et al.   invention   et al.                    4   2.03E−2   2.83e−2   3.34e−2   8.23e−2   21.33   18.75       6   5.89e−3   9.10e−3   2.17e−2   2.61e−2   32.95   29.65       8   1.62e−3   2.60e−3   6.73e−3   7.86e−3   41.96   38.40       10   4.35e−4   7.03e−4   2.01e−3   2.29e−3   55.80   52.20       12   1.14e−4   1.80e−4   5.83e−4   6.54e−4   67.41   63.31       14   4.28e−5   6.01e−5   1.62e−4   2.15e−4   78.22   75.13       16   9.10e−6   2.48e−5   5.15e−5   5.49e−5   90.55   87.60                    
         [0110]    [0110]                                                                                                         TABLE 4                           Evaluation of the performance of Booth multiplier                ∈ ave  (%)       ∈ max  (%)       SNR (dB)                    this       this       this           N   invention   (N+1)bits   invention   (N+1)bits   invention   (N+1)bits                    4   1.83E−02   1.36E−02   5.86E−02   4.30E−02   1.11E+01   1.32E+01       6   5.67E−03   6.22E−03   2.08E−02   1.83E−02   2.14E+01   2.10E+01       8   1.63E−03   2.28E−03   6.76E−03   6.52E−03   3.22E+01   3.02E+01       10   4.55E−04   7.52E−04   2.08E−03   2.12E−03   4.33E+01   4.00E+01       12   1.24E−04   2.34E−04   6.18E−04   6.51E−04   5.35E+01   5.04E+01       14   3.29E−06   6.68E−05   1.79E−04   1.93E−04   6.40E+01   6.13E+01       16   8.72E−08   1.91E−05   5.18E−05   5.74E−05   7.66E+01   7.30E+01