Non-restoring fixed-point divider apparatus

Abstract: A fixed-point divider apparatus and method, based on a 64-bit non-restoring architecture, are disclosed. The divider apparatus includes three 67-bit adders, coupled in parallel with one another for performing add or subtract functions, each adder being precharged during a first clock phase and executing selected functions during a second clock phase, which both occur during a single clock cycle. The first adder is connected to a first and second multiplexor, for selecting respective first and second operands. A third multiplexor, coupled to the second adder, is used to select a first operand for the second adder. Fourth and fifth multiplexors, which are coupled to the third adder, are used to select a respective first and second operand for the third adder. An adder operand select logic is coupled to the adders and the multiplexors for selecting whether to perform the add or subtract functions and for selecting which operands the multiplexors are to feed to their respective adders. An operand selection circuit is further added, which is coupled to the multiplexors and the adder operand select logic. The divider apparatus further comprising a remain quotient determination circuit coupled to the adders, and used for determining when a divide operation has been completed, what the divide result is, and whether there is a remainder quotient.

Description: BACKGROUND OF THE INVENTION 1. Technical Field: The present invention relates generally to data processing systems and more specifically to data processing systems providing fixed-point arithmetic operations. More specifically still, the present invention relates to a data processing system having a fixed-point divider that is non-restoring and that divides its cycle time half for the adder logic and the other half for the remaining logic. 2. Description of the Related Art: A conventional basic binary dividing apparatus generates a quotient bit by bit while the divisor is added to, or subtracted from a dividend, or a partial remainder repeatedly in accordance with the non-restoring algorithm. There is an improved apparatus which is capable of generating a plurality of quotient bits in one cycle. This apparatus is designed to shift a partial remainder, add or subtract a suitable multiple of a divisor to or from the shifted partial remainder, and, based on the resultant partial remainder, estimate a plurality of quotient bits while determining the shift length of the partial remainder in preparation for the subsequent operation. Unfortunately, this type of dividing apparatus bases its shift length upon the result of each addition or subtraction, which makes it difficult to reduce the cycle time. EP-A-0 450 754 discloses a high speed divider for a data processing system operating on floating point arithmetics. The apparatus performs the division of a first operand by a second operand by iteratively producing a series of partial remainders and predicted quotient bits. The divider has a pair of parallel quotient registers for storing a quotient prediction for output and for storing the quotient prediction minus one for correcting erroneous quotient predictions before output. With this type of apparatus it is also difficult to reduce the cycle time. The publication of 1990, Morgan Kaufmann Publishers, Inc. "Computers architecture: a quantitive approach " by David A. Patterson and al, pages A3 to A6 discloses a non-restoring division algorithm wherein a couple of registers are storing the remainder and the quotient of the division forming a remainder quotient. The document FR-A-2637707 discloses a dividing circuit for calculating a quotient of K m-ary digits in K machine cycles. In this document, for dividing a dividend of a first plurality of m-ary digits by a divisor of a second plurality of m-ary digits to provide a certain number K of m-ary quotient digits, where m represents 2N, a shift register comprises a most significant part, first and second higher parts for the second plurality less one of m-ary digits and one m-ary digit, and a least significant stage and holds an instantaneous content which is used as a current content during a last part of a preceding one of two consecutive machine cycles and is first a concatenation of an m-ary zero digit and the dividend m-ary digits. A carry save adder tree calculates a set of zeroth to (m-1)-th algebraic sums of a part of the current content held in the most significant and the first and the second higher parts minus zero through (m-1) times the divisor, respectively, plus a carry from a previous machine cycle. The sums are used in deciding a partial quotient of one m-ary digit and a sum datum of the second plurality of m-ary digits. In a leading part of a succeeding one of the consecutive machine cycles, the partial quotient and the sum datum are stored in the least significant stage and the most significant and the first higher parts. After lapse of K machine cycles, the shift register is loaded with an eventual quotient in its stages other than the most significant and the first and the second higher parts. Accordingly, what is needed is a fixed-point divider apparatus that is capable of generating multiple quotient bits in a single cycle while dividing the processing time equally between the adder portion and the remaining logic within the divider apparatus. SUMMARY OF THE INVENTION It is therefore one object of the present invention to provide a data processing system. It is another object of the present invention to a provide data processing system providing fixed-point arithmetic operations. It is yet another object of the present invention to provide a data processing system having a fixed-point divider that is non-restoring and that divides its cycle time half for the adder logic and the other half for the remaining logic. A fixed-point divider method and apparatus are defined in independent claims 1 and 4, respectively. A fixed-point divider apparatus and method, based on a 64-bit non-restoring architecture, are disclosed. The divider apparatus includes three 67-bit adders, coupled in parallel with one another for performing add or subtract functions, each adder being precharged during a first clock phase and executing selected functions during a second clock phase, which both occur during a single clock cycle. The first adder is connected to a first and second multiplexor, for selecting respective first and second operands. A third multiplexor, coupled to the second adder, is used to select a first operand for the second adder. Fourth and fifth multiplexors, which are coupled to the third adder, are used to select a respective first and second operands for the third adder. An adder operand select logic is coupled to the adders and the multiplexors for selecting whether to perform the add or subtract functions and for selecting which operands the multiplexors are to feed to their respective adders. An operand selection circuit is further added, which is coupled to the multiplexors and the adder operand select logic, and is used to control the adder's operation during the second phase of a clock cycle. The divider apparatus further comprises a remain quotient determination circuit coupled to the adders, and used for determining when a divide operation has been completed, what the divide result is, and whether there is a remainder quotient increment. The adders are selected such that the first adder generates an output remain plus or minus quotient 3x the divisor, the second adder generates an output remain quotient plus or minus twice the divisor, and the third adder generates an output remain quotient plus or minus the divisor. Each clock cycle operates at about 6 nanoseconds, thus meaning each clock phase is about 3 nanoseconds long. The adders, being 67-bit adders, are capable of handling 64-bit and 32-bit operations. The apparatus is designed so that two timing paths are formed, the first for determining a next divider operation and for generating a select signal for each multiplexor, which data path is performed within a half-clock cycle. The second data path is formed for sending signed bites from the adders, for determining which results from the adders is the correct result, for generating a quotient bit, and a next set of operands for the next divider operation. Like the first data path, the second data path results are generated within a half-clock cycle. The method is designed to operate on a divider apparatus substantially similar to that previously described. The first step, occurring during a first phase of a clock cycle, delivers first and second operands to the operand selection circuit. This allows the adders to be precharged with these operands. During the second phase of the clock cycle, the adders perform their evaluation operation and the results are examined to determine the next adder operation to be performed. Significantly, the logic functions of determining the adder results, selecting a proper adder result, checking the signage, selecting an appropriate adder for the next adder operation, generating a 2-bit quotient, are all intended to be performed during a first phase of the designated clock cycle. The actual evaluation of the operands during the adder operation is always performed during the second phase of a clock cycle. This results in a more efficient divider apparatus design than would otherwise be possible if the adder evaluation occurred at any time during the first or second phases of the particular clock cycle. Further embodiments of the invention are specified in the appended dependent claims. The The above as well as additional objects, features, and advantages of the present invention will become apparent in the following detailed written description. BRIEF DESCRIPTION OF THE DRAWINGS The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself however, as well as a preferred mode of use, further objects and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein: Figure 1 is a block diagram of a fixed-point divider unit; Figure 2 is a block diagram of the operands selection block circuit shown in Figure 1 ; Figure 3 is a block diagram of the adder block circuit shown in Figure 1 ; Figure 4 is a block diagram of the remain quotient determination block circuit shown in Figure 1 . DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT With reference now to the figures and in particular with reference to Figure 1 , a block diagram of a fixed-point divider processor 10 is illustrated. A register 12 is provided and is connected to a Reservation Station, which issues instructions from a buffer to register 12 , which then sends the instructions to the various blocks within fixed-point divider 10 . Register 12 further comprises a first latch 14 and a second latch 16 (L1 and L2, respectively). Register 12 operates in two phases; latch 14 is controlled by a clock C1, which establishes the second phase, and latch 16 is controlled by a clock C2, which establishes the first phase or phase 1. Register 12 feeds a first operand OPA and second operand OPB to an operands selection block 18 , which is more fully depicted in Figure 2 and more fully described below. A first cycle, sign, and op_64 inputs are also sent from register 12 to operands selection block 18 . Operands selection block 18 determines whether the divide operation is either signed or unsigned, or has 64 bits or 32 bits, and whether there is a divide overflow because of the denominator being zero. Once the first and second operands have been processed, they are sent to adder block 20 , along with a remainder quotient signal from a separate clock cycle. Adder block 20 performs the arithmetic functions of divide and is more fully illustrated in Figure 3 , and more fully described below. The results from adder block 20 are fed to register 120 where the results are fed to remain quotient determination block 22 via lines sum1, sum2, and sum3. Remain quotient determination block 22 is used to determine any remainder quotients based on any of the three sum results from sum line sum1, sum2, and sum3. A select signal line 21 is further connected to adder block 20 for selecting various multiplexors and adder functions within adder block 20 . Remain quotient determination block 22 further includes a remainder quotient r_q line. A quotient increment quot_inc line and a zero_remainder line connect to register 120 for providing additional information with respect to any remainder quotient, quotient incrementation, and zero_remainder or completion signal. In Figure 2 , a block diagram of the operand selection block 18 is illustrated for fixed-point divider 10 . Operand A (op_A) and operand B (op_B) feed to unsigned extension blocks 22 and 26 , respectively, and to signed extension blocks 24 and 28 , respectively. The pair of extension blocks 22 and 24 feed to a first four-to-one multiplexor while the extension blocks 26 and 28 feed to a second four-to-one multiplexor 32 . The MUX selects for both multiplexor 30 and 32 are controlled by and/or logic 34 , which determines the signal to be multiplexed based upon the inputs of the signed line and the operand 64 (op_64) assertion signal. Since the divider can handle either 64-bit or 32-bit operations, the operand 64 line determines whether a 64-bit or a 32-bit operation is to be performed. The signed line determines whether an unsigned or a signed operation is to be performed. The output from multiplexor 30 feeds directly to adder block 20 of Figure 3 and also to a 1-bit multiplexor 42 , which has an additional input from the a_daq0 line, which keeps track of the sign bit of op_a (divident) during the entire divide operation. Multiplexor 42 is controlled by a first cycle line (first_cycle), which also controls single-multiplexor 44 . Multiplexor 44 receives the op_64 signal and the op_64q (a latched op_64 signal), which is active upon subsequent cycles after the first load operation. Operand B feeds directly to adder block 20 , which is shown in Figure 3 , and to a 67-bit multiplexor 46 , which also receives a 1 x divisor (divis_1q) signal, which keeps track of the 1x divisor during the entire divide operation. Multiplexor 46 is further controlled by first cycle signal. An additional 67-bit multiplexor 48 is used to select between a sum3 line and a 3 x divisor (divis_3q) signal, which keep track of 3x divisor during the entire divide operation. Multiplexor 48 is controlled by the second clock cycle or second_cycle line. Multiplexor 44 then feeds to the op_64_in line which feeds back to a register that feeds to op_64_q. Multiplexor 42 has an output signal A_da0, which feeds to a register to store the sign of a_daa (a_daq0). Multiplexor 46 has an output signal divis_1_in, which feeds to register 120 to store the 1x divisor (divis_1q). Multiplexor 48 has an output signal divis_3_in, which feed to register to store the 3x divisor (divis_3q). Operands selection block 18 further includes a divide/zero detect logic 36 . Divide overflow logic 36 receives operands A and operands B and determines whether the divide operation would be impossible with the denominator being zero. Additional input signals include op_64 and first_cycle, which are needed to determine it is 64-bit/32-bit overflow at first cycle. The output from block 36 feeds to adder block 20 . Adder block 20 is more fully depicted in the block diagram of Figure 3 . Adder block 20 has an adder operands select logic 50 , which receives the div_ov and the do_add signal, for determining the next addition or subtraction operation to be performed at the next cycle and for determining the operands to feed into the adders. From the adder operands select logic 50 , a select signal for a multiplexor line 21 feeds to three adders in adder block 20 . Two additional output signals include do_subxq, which determines whether addition or subtraction should be performed by the adders, and a busy, ready, finish, and increment line, for indicating when the divider is busy, ready, finished, or should be incremented in the remainder quotient determination block. The busy, read, finish, increment line feeds to register 120 , which is then further fed to Reservation Station. Adder block 20 receives many input signals from operand selection block 18 through an assorted number of multiplexors 54 , 56 , 58 , 60 , and 62 . Multiplexor 54 determines the first operand of adder 64 . Multiplexor 56 determines the second operand of adder 64 . Multiplexor 58 determines the first operand of adder 66 . Multiplexor 60 determines the first operand of adder 68 and Multiplexor 62 determines the second operand of adder 68 . Multiplexors 54 and 56 connect to adder 64. Multiplexor 58 is connected to adder 66 , which also receives an input signal from r_q line. Multiplexors 60 and 62 are further connected to adder 68 . Adders 64 , 66 , and 68 are 67-bit adders that work in parallel during the divide operation. Each adder 64 , 66 , and 68 is controlled from a signal from the adder operands select logic 50 . The outputs from adders 64 , 66 , and 68 are then fed to register 120 through latch 140 . Adder 64 generates an output remain_quotient having plus or minus 3 times the divisor. Adder 66 generates a remain_quotient plus or minus 2 times the divisor. Adder 68 outputs a remain_quotient plus or minus the divisor. These three outputs are further sent to zero detect and sum selector circuit logic 70 , which also looks at the sign bit of either sum1, sum2 or sum3. Zero detect and sum selector circuit 70 further selects whether to do an add function or a subtraction function for the next operation and whether that function should involve sum1, sum2, or sum3. These signals are outputted through second latch 160 . The adder outputs sum3, sum2 and sum1 are further connected to remain quotient determination block 22 illustrated in Figure 4 . Figure 4 more fully depicts a block diagram of the remain quotient determination block 22 . Block 22 includes a quotient generator 72 that looks at the sign bit of either sum1, sum2, or sum3 as well as the divis_1q0 input from operand selection block 18 . Two three-by-one multiplexors 74 and 76 are also provided. Multiplexor 74 selects from either sum1, sum2, or sum3 based on the select_sum1, sum2 or sum3 from selector block 70 . Multiplexor 76 selects from lines zero sum1, 2, or 3 based upon the select line of select_sum1, 2 or 3. The output signal of MUX 76 is connected to a zero remainder calculation circuit 78 , which looks at the zero sum signal, the zero remainder (z_remainderq), and the remainder quotient (r_q). The outputs from circuit 78 , zero_d and zero_e are then fed to multiplexor 80 , which selects either signal for feedback as either z_remainder signal to circuit 78 to register 120 or to quotient correction circuit 90 . A sign extension circuit 82, which sign extends a_daa from 67 bit to 131 bit, inputs line signal A_daa and outputs A_da to multiplexor 86. Various other signals such as r_qq, quot, p_remainder, and sum1, connect to multiplexor 86, which has an output further connected to register 120 . This output is the remainder quotient or r_q. The control of multiplexor 86 is performed by remainder quotient selector logic 88 , which bases its select remainder quotient 1, 2, 3, or 4 (sel_rq1,2,3,4) based upon the inputs of finishq, quot_incq, and second_cycle. Quot_incq is the product of quotient correction circuit 90 , which used inputs a_daq0, divis_1q, and finish to determine whether to increment the quotient by 1 at the last cycle. The fixed-point divider circuit 10 is able to generate two (2) quotient bits in a cycle with the adders in the divider only taking a half-cycle. In the preferred embodiment, a cycle time is six (6) nanoseconds (ns), which means there is three (3) nanoseconds dedicated to the adder phase and three nanoseconds dedicated to the remaining logic steps necessary in performing the fixed-point divide operation. The 6 nanosecond cycle time for the 2-bit per cycle divider is accomplished by using three 67-bit adders working in parallel. These adders are precharged during the first phase of the clock cycle, and evaluate during the second phase of the cycle. For optimal operation, the adders operate during the second phase of the cycle so as to reduce the number of potentially necessary registers from six down to three 67-bit registers. The adders precharge during the first phase, which allows the remaining logic in divider circuit 10 to be performed. Referring back to Figure 1 , during a sample Operation, data from the Reservation Station (operands A and B) are delivered to operand selection block 18 at the beginning of the first cycle. During this first cycle, the operand selection block 18 determines whether the operands are signed or unsigned, or 64bit or 32bit operations. This opera is completed within 3 nanoseconds, before the rising edge of clock Cl. This information is represented by the block A in Figure 2 . The operand selection block 18 uses a static zero and -1 detector so that it need not be triggered by the clock C1, thus saving a halfcycle of time from precharging. An example of a typical divide operation is shown in Table 1. CYCLE PHASE 1 PHASE 2 1 Sign Extension. Calculate 3 x divisor. 2 r_q+/-1D;r_q+/- 2D;r_q+/-3D; 3 2 bit quotient (first 2 bits) r_q+/-ID; r_q+/- 2D;r_q+/-3D; Do_ add or subtract for next cycle. 4 2 bit quotient. Do-add or subtract for next cycle. r_q+/-1D; r_q+/1 2D;r_q+/-3D · · · · · · · · · · · · 34 2 bit quotient (32nd 2 bits quotient need increment or not. 35 Generate mux_sel for quotient increment r-q=r_q+1 (if quotient need increment) 36 Result The most critical timing pass during an operation require that all data must arrive at their respective MUXs before adders 64 , 66 , and 68 of adder block 20 before the rising edge of clock C1. The data arrives at points A, F, and G before 3 nanoseconds. One of the critical paths is that by which the results from the three adders follows which includes determining the next operation (addition or subtraction), then generating the select signals for the multiplexors in front of adders 64 , 66 , and 68 . The next most critical path is when the signed bits are taken from the results of the three adders, then determining which results from adders should be the correct results, then generating a 2-bit quotient, and then finally generating the operands for the next addition operations. Each path must be finished within a half-cycle or three nanoseconds. Referring back to Figure 2 , the most critical part of both of the critical paths is implemented by dynamic circuits where select_sum1 (2,3) is a one-stage domino circuit and the do_add circuit is a two-stage domino circuit. These dynamic circuits are precharged while the adders are in the evaluation phase and then these circuits are evaluated when the adders are precharged. The results from adders 64 , 66 , and 68 are then fed to second latch 160 which is transparent so as not to violate the rules under the level sensitive scan design (LSSD) format. The operation for performing the select_sum1, 2, 3 requires about 0.4-0.5 nanoseconds and the do_add operation takes approximately 0.8-0.9 nanoseconds. Thus, the first critical path then becomes 0.9 nanoseconds for do_add in the adder block 20 and latch 16 transparent latch, and an RLM (three levels of gates at worst, i.e., inv., nand, and inv) in three nanoseconds. The second critical path then, is the 0.4 nanosecond for the select_sum1 in the adder block plus a 3-to-1 multiplexor 74 followed by a 5-to-1 multiplexor 86 in the remain quotient determination block 22 of Figure 4 , and the generate remain quotient for the operands for the next addition or subtraction. Both critical paths are both well below the three nanosecond restriction for optimal operation time. The divider is designed for high performance fast clock central processing units, such as, for example, the PowerPC family of high performance microprocessing units. This circuit makes use of three custom-designed blocks. The first custom block is the static zero detector in the data path used in the operand selection block 18. The second block is a dynamic zero detector for determining the adders results in adder block 20 . The third custom block is a second dynamic block connected to the first dynamic block for generating the do_add, sel_sum1, sel_sum2, sel_sum3 operations in the adder block 20 . Since only the three custom blocks are used, the remaining functions are readily available from off-the-shelf type designs. The most distinguished advantage of this architecture is that it partitions the operations needed for the divide function into different function blocks and different phases so that the most critical path is greatly simplified and its delay minimized. Significantly, the most critical path is a dynamic block (do_add) + transparent latch + inv + nand + inv in one-half cycle, which is a simple and efficient solution to meeting the timing requirements. Thus this architecture is suitable for fast clock rates.

Claims: A method of performing a fixed-point divide operation in a fixed-point divider apparatus (10) having a plurality of adders (64, 66, 68) coupled in parallel, a plurality of multiplexors, (54, 55, 58, 60, 62) coupled to said plurality of adders, an adder operand select logic (50) for generating control signals for said multiplexers (54, 56, 58, 60, 62) and said plurality of adders (64, 66, 68), an operand selection circuit (18) for determining the operands to be supplied to said multiplexers, coupled to said adder operand select logic (50) and a remain quotient determination logic (22) for determining the remainder quotient and quotient digits, coupled to said plurality of adders (64, 66, 68), comprising the following steps: 1) during a first phase of a clock cycle having a first and a second phase, each phase being a half cycle long, delivering the dividend (op_a) and divisor (op_b) to said selection block (18), and generating a plurality of divisor multiples, said selection block providing operands to said multiplexers, 2) during said first phase, precharging said plurality of adders (64, 66, 68) with operands which are selected among the operands from said selection block and a remainder quotient (r_q), 3) during said second phase, performing an adder operation on said operands, which operation yields a plurality of adder results (Sum1, Sum2 and Sum3) which are the potential partial remainders, each representing one (r_q) of the selected operands from said multiplexers plus or minus a divisor multiple, 4) during a subsequent first phase of a further clock cycle, selecting a correct result (figure 4-86) as the remainder quotient (r_q) from said adder results, and generating a multi-bit quotient (figure 4-quot(O:1), 72) based on the signs (sum1(0), sum2(0), sum3(0)) of said adder results and of said divisor (divis_1q0), and determining (50) for each of said plurality of adders if the next adder operation is an addition or substraction (figure 3-do_add, RLM2, do_subxq), and generating control signals (21) for said multiplexors (54, 56, 58, 60, 62) to select the operands for said plurality of adders (64, 66, 68) for performing said next adder operation whereby a next set of operands based on said selected correct result for said next adder operation is generated, and 5) during a subsequent second phase of a clock cycle, performing said next adder operation yielding another plurality of adder results (Sum1, Sum2 and Sum3), and 6) carrying out steps 2 to 5 until the division process is completed. The method according to claim 1 further comprising the step of during said first phase, determining the sign of said first and second operands and the length of said first and second operands; The method according to claim 1 or claim 2 further comprising the step of during said first clock phase, determining whether said operation is a divide by zero operation. A fixed-point divider apparatus (10) carrying out the method according to claim 1 comprising: first (64), second (66), and third (68) adders, coupled in parallel one with another, for performing add or subtract functions, each adder being precharged during a first clock phase of a clock cycle and executing one of said functions during a second clock phase of the same clock cycle; first (54) and second (56) multiplexors, coupled to said first adder (64), for selecting during the first phase of a clock cycle a respective first operand and a second operand for said first adder (64); a third multiplexor (58), coupled to said second adder (66), for selecting during the first phase of a clock cycle a first operand for said second adder (66); fourth (60) and fifth (62) multiplexors, coupled to said third adder (68), for selecting during the first phase of a clock cycle a respective first operand and a second operand for said third adder (68); an adder operand select logic (50), coupled to said first (64), second (66), and third (68) adders and said multiplexors (54, 56, 58, 60, 62), for selecting during the first phase of a clock cycle whether to perform the add or subtract function and which operands said first (54), second (56), third (58), fourth (60) and fifth (62) multiplexors feed to said first (64), second (66) and third (68) adders; and a remain quotient determination circuit (22), coupled to said first (64), second (66) and third (68) adders, for determining during the first phase of a clock cycle when a divide operation has been completed, what the divide result is and whether there is a remainder quotient increment. The apparatus according to claim 4 wherein said first adder (64) generates an output remain quotient plus or minus three times the divisor, said second adder (66) generates an output remain quotient plus or minus two times the divisor, and said third adder (68) generates an output remain quotient plus or minus the divisor. The apparatus according to claim 4 or claim 5 wherein said operand selection circuit (18) determines whether said operands are signed or unsigned. The apparatus according to any one of claims 4 to 6 wherein said operand selection circuit (18) determines whether said function is a divide by zero operation. The apparatus according to any one of claims 4 to 7 wherein said remain quotient determination circuit (22) generates a next divider operation signal and a select signal for each of said first (54), second (56), third (58), fourth (60) and fifth (62) multiplexors, which said next divider operation is performed within a half-clock cycle. The apparatus according to any one of claims 4 to 8 wherein said remain quotient determination circuit (22) receives signed bits from said first (64), second (66) and third (68) adders, determines which of said signed bits constitutes a correct result, and generates a quotient bit and a next set of operands for the next divider operation, all within a half-clock cycle. The apparatus according to any one of the preceding claims 4 to 9 wherein said clock cycle is about 6 nanoseconds and each said first and second clock phases are about 3 nanoseconds. The apparatus according to any one of the preceding claims 4 to 10 wherein said first (64), second (66) and third (68) adders are 67-bit adders capable of handling 64-bit and 32-bit operations.

Inventors: TSAY ALBERT SUAN-WEI, TSAY, ALBERT SUAN-WEI
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1995
Main classification: G06F7
IPC codes: G06F7