JPH0573270A - Flag generation circuit for adder - Google Patents

Abstract

PURPOSE:To execute the flag generation and the discrimination of the condi tional branch at a high speed with the addition of small number of circuits. CONSTITUTION:An (n)-digit input adder is provided with a PG generation circuit 5 generating the carry generation function for each digit of input, carry propagation function, and NAND for each digit, a carry forecasting circuit 6 generating a carry flag by taking the carry generation function for each digit, carry propagation function, and the carry 15 to the lowest digit as input, and a zero detection circuit 7 inputting an internal signal 21 to be generated by the carry forecasting circuit 6, the NAND for each digit, and the carry 15 to the lowest digit. Accordingly, the high-speed flag generation and the judgment of the conditional branch can be performed with the addition of few circuits by using the internal signal of the carry forecasting circuit, the processing ability of the computer is improved.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a flag generation circuit in a 2-input adder, and more particularly to a circuit for generating a zero flag and determining a conditional branch at high speed by using an internal signal of a carry lookahead circuit. ..

[0002]

2. Description of the Related Art For example, in the case of an instruction sequence in which an addition instruction is followed by a conditional branch instruction that makes a branch decision using a flag that reflects the addition result, not only is the speed of the adder increased for high-speed processing. It is also necessary to speed up the generation of each flag and the branch determination based on the generated flag. The zero flag is the most delayed of these flags. In such high speed processing, it is becoming more and more important to generate the zero flag of the adder at high speed.

As a method for generating a zero flag in a high-speed adder, there is, for example, Japanese Patent Laid-Open No. 55-87243. This method generates, for each digit, an intermediate result of addition that detects that the addend and the augend are both zero at the time of addition and that the subtraction and the dividend are equal at the time of subtraction. This is to obtain the zero flag at high speed by taking the product.

[0004]

However, the above-mentioned conventional method has a problem that it cannot handle the case where the carry is added because the carry input to the least significant digit is not taken into consideration.

In view of the above problems, the present invention provides a flag generating circuit for a binary adder capable of generating the zero flag of the adder at a time earlier than the time when the addition output of the adder is determined. ..

[0006]

In order to solve the above-mentioned problems, the flag generation circuit of the adder of the present invention is an n-digit 2-input adder, which has a carry generation function and a carry propagation function for each input digit. A PG generating circuit for generating a NAND operation for each digit, a carry look-ahead circuit for generating a carry flag by inputting the carry generating function, the carry propagating function, and the carry to the least significant digit for each digit. A zero detection circuit, which is an internal signal generated by the carry look-ahead circuit, represented by (Equation 1), the above-mentioned NOT-OR for each digit, and the carry to the least significant digit is provided. It is a thing.

[0007]

In the n-digit adder, the carry flag Cn-1
Is calculated by (Equation 2).

[0008]

[Equation 2]

However, Gi is a carry generation function, and Pi is a carry propagation function, which are represented by (Equation 3) and are generated by the PG generation circuit.

[0010]

[Equation 3]

C-1 is a carry to the least significant digit. Here, Pi · Gi is the logical product of Pi and Gi
+ Gi is the logical sum of Pi and Gi, ai (i = 0 to n-
2) indicates the i-th digit of the augend, and bi (i = 0 to n-2) indicates the i-th digit of the addend. This carry flag Cn-1 is generated at high speed by using a carry look-ahead circuit.

Further, the zero flag is 1 when the addition outputs are all zero, and is therefore obtained by (Equation 4).

[0013]

[Equation 4]

However, Si (i = 0 to n-1) represents the addition output of the i-th digit, and XSi represents the logical negation of Si.

Here, when the carry flag expression and the zero flag expression are compared, there is a match in the logic underlined. Further, XPi · XGi (i = 0 to n in the formula of the zero flag)
The term of -2) is easily obtained as in (Equation 5).

[0016]

[Equation 5]

According to the present invention, with the above-mentioned configuration, the logical negation of each digit of the input of the 2-input adder and the coincident logical part are generated by using the internal signal of the carry look-ahead circuit to generate a zero flag, which is small. As the carry flag increases, the zero flag can be generated at a high speed similarly to the carry flag.

[0018]

【Example】

(Embodiment 1) Hereinafter, a zero flag generation circuit according to an embodiment of the present invention will be described with reference to the drawings. The same numerals and characters in the drawings used in the following description denote the same elements throughout the drawings.

FIG. 1 is a block diagram of a zero flag generation circuit according to an embodiment of the present invention. In FIG. 1, 1-a and 1-b are input control units, 2 is a two-input binary adder with a carry look-ahead circuit, and an operation output from the input control units 1-a and 1-b is given to each input. Data A13,
Operation data B14 and carry 15 to the least significant digit are given. Also, as outputs, a binary addition output S16, a zero flag 17 and a carry flag 18 reflecting the calculation result are output. 3 is PSR (Processor Status Register) 3
Therefore, the zero flag 17 and the carry flag 18 are input and held. 4 is a carry control circuit, PS
The carry 19 output from R3 and the operation control line 10 are input. The addition / subtraction operation mode is controlled by the operation control line 10 input to the input control unit 1-b and the carry control unit 4, and at the time of subtraction, the input data B (subtraction) 12 and the carry 19 are inverted (1's complement). Then, it is given to the adder 2. The input control unit 1-a receives the input data A regardless of addition / subtraction.
11 is output as operation data A13 and given to the adder 2. Reference numeral 5 denotes a PG generation circuit, which receives the operation data A13 and the operation data B14 as input and carries out a carry generation function G for each digit.
A function Zi which is the logical sum of i and the carry propagation function Pi and two inputs is generated and output as the PG output function 20. 6 is a carry look-ahead circuit, 7 is a zero detection circuit,
The PG output function 20 and the carry 15 output from the PG generation circuit 5 are input respectively. The zero detection circuit 7 also receives the internal signal 21 of the carry look-ahead circuit 6. The zero detection circuit 7 generates the zero flag 17, and the carry look-ahead circuit 6 generates the carry flag 18, and outputs the carry flag 18 to the PSR 3.

The operation of FIG. 1 will be described below. The description here will be given by taking a 4-bit adder (n = 4) as an example. In the adder 2, the carry flag 18 (= C3) at the time of addition is given by (Equation 6).

[0021]

[Equation 6]

Here, Gi is a carry generation function, and Pi is a carry propagation function, which can be obtained by (Equation 3).

C-1 is a carry 15 to the least significant digit. However, ai and bi are data of each bit of the operation data A13 and operation data B14, ai.bi is the logical product of ai and bi, and ai + bi is the logical sum of ai and bi,
ai xor bi represents the exclusive OR of ai and bi.

At the time of subtraction, the input data B (decrement) 12 and the carry (borrow) 19 are inverted (1's complement) and given to the adder 2, so that the carry (borrow) flag is obtained at the same time as the addition (expression 6). 18 can be obtained. This addition / subtraction control is performed by the arithmetic control line 10. Therefore, in the following description, the case of addition will be described.

The zero flag 17 can be expressed as shown in (Equation 7) using the carry generation function Gi and the carry propagation function Pi of each bit.

[0026]

[Equation 7]

Attention is now paid to the third item of the carry flag (Equation 6) and the zero flag 17 (Equation 7). The third item of (Equation 6), that is, G1 · P3 · P2, indicates that a carry occurs at the first digit and propagates to the upper digit, and the third item of (Equation 7), that is, G1 · P3 · P2 x
G0 and XP0 are 0th when there is no carry to the least significant digit.
It is shown that both the two inputs of the digit are zero and a carry occurs at the first digit and propagates to the upper digit, so that the operation result becomes zero. Further, comparing (Equation 6) and (Equation 7), it can be seen that the underlined logics of the respective terms match.
Also, in (Equation 7), the terms other than the underlined parts XGi and XPi
(I = 0 to 2) may be obtained by a two-input NOR operation as in (Equation 5), and can be easily obtained in the PG generation circuit similarly to Pi and Gi.

The underlined logic is expressed by (Equation 8)

[0029]

[Equation 8]

Is put, and the NOR of each digit Xai.Xbi
If is set to Zi, then the (equation 7) of the zero flag becomes (equation 9).

[0031]

[Equation 9]

Next, carry flag 18 and zero flag 17
A circuit for generating will be described with reference to FIG. Figure 2
FIG. 3 is a block diagram showing a configuration of an adder 2 for explaining generation of a zero flag. The PG generation circuit 5 calculates the operation data A1.
3. With the operation data B14 as input, a carry generation function Gi for each digit, a carry propagation function Pi, and a function Zi which is the logical NOT sum of the digits are generated and output as the PG output function 20. The carry look-ahead circuit 6 inputs the carry generation function Gi and the carry propagation function Pi of the carry 15 to the least significant digit and the PG output function 20, and carries the carry flag 18 and the internal signal 21 (U, V, W, BP.C). ^-1 ) is output.
Reference numeral 7 denotes a zero flag generation circuit, which carries the carry 15 to the least significant digit and the internal signal 21 and P output from the carry look-ahead circuit 6.
XP3 obtained by logically negating the carry propagation function P3 which is a part of the PG output function 20 output from the G generation circuit 5 and the above-mentioned function Zi (i = 0 to 2) are input and the zero flag 17 is output.

The logic of the underlined portion of the zero flag (Equation 7) is represented by the internal signals 21 (U, V, W, BP.
If it is obtained using C ⁻¹ ), the zero flag 17 can be generated at high speed like the carry flag 18 with a small increase in the circuit amount.

As described above, according to this embodiment, the generation of the zero flag 17 can be obtained by increasing the number of gate passage stages by one stage at most from the carry flag 18 as shown in FIG.

In FIGS. 1 and 2, the carry look-ahead circuit 4 is provided.
The bit adder has been described, but the case of addition with a long word length will be described with reference to FIGS. 3 and 4. FIG. 3 is a multi-word length addition in which the carry generated by the carry look-ahead circuit of the lower digit side adder is connected to the carry input of the upper digit side adder to propagate the carry between the adders by the ripple carry method. FIG. 4 is a block diagram of a multi-word length adder using a two-stage block carry look-ahead method.

First, FIG. 3 will be described. The carry generation in each adder is performed by a carry look-ahead circuit. The carry propagation between the adders is carried out in the ripple carry system by connecting the carry output Co of the lower digit side adder to the carry input Cin of the upper digit side adder. Further, the zero detection output Zo is output from the lower digit side adder together with the carry output Co, and the zero detection input Zin of the upper digit side adder is output.
Has been entered in. By taking the logical product of the expression of the zero flag (Equation 7) and the zero detection input Zin input from the lower digit side,
The zero detection output at each adder is obtained. (Equation 10) shows a logical expression of the zero detection output in the least significant digit adder. In this way, even in the addition with a long word length, the zero flag can be generated at high speed with the same number of gate passage stages as the carry flag.

[0037]

[Equation 10]

However, Zin of the least significant digit adder is always 1
Is input and the zero detection output of the most significant digit adder is the zero flag 1
It becomes 7.

Next, in the two-stage block carry look-ahead system shown in FIG. 4, the case where the number of digits of each block is 4 bits and the block is divided into 4 blocks to form a 16-bit adder will be described. In FIG. 4, the PG generation circuit 5
The PG output function 20 generated in (4) is output to the block PG generation circuit 8. In the block PG generation circuit 8, the block carry generation function BGi, the block carry propagation function BPi, the function BZi indicating that the two inputs of the block are both zero, and the two inputs of the block are both not zero and the operation result in the block is A function BYi indicating zero is generated and output to the zero detection circuit 7 and the block carry look-ahead circuit 9 as the block PG output function 22. A block carry look-ahead circuit 9 generates carries C3, C7, C11 and carry flag 18 from the block PG output function 22 and carry Cin15. Reference numeral 7 is a zero detection circuit, which generates and outputs a zero flag 17 from the block PG output function 22 and the carry Cin15.

The block carry generation function BG0 and the block carry propagation function BP0 of the least significant block are (Equation 11), and the block carry generation function BGi (i = 1 to 3) and the block carry propagation function BP of the other blocks.
The same logical expression can be obtained for i (i = 1 to 3).

[0041]

[Equation 11]

The carry flag is calculated by (Equation 12).

[0043]

[Equation 12]

Similarly, the equation (Equation 9) representing the zero flag in the least significant block is given by (Equation 13)

[0045]

[Equation 13]

The function B of the lowest block is transformed as follows.
Z0 and function BY0 (Equation 14)

[0047]

[Equation 14]

When the expression is put, the expression of the zero flag becomes (Equation 15).

[0049]

[Equation 15]

Also here, BYi (i = 0 to 3) is the internal signal U when the block carry generation function BGi is generated,
By using V, W, and the like, generation can be performed at high speed with a small increase in the circuit amount.

That is, this method can be applied to an adder having a long word length, and a high-speed zero flag can be generated with a small increase in the circuit amount.

(Embodiment 2) Here, a circuit for rapidly determining whether or not a branch condition in a conditional branch instruction is satisfied will be described. (Table 1) shows the branching conditions and their judgment logical expressions. "Branch on Less or Equal, Unsigned" uses the zero flag, which takes longer to generate than other flags, in the case of conditional branch determination.
(Hereinafter called BLEU) and "Branch on Less or Equal"
Is.

Here, a circuit for executing the BLEU judgment at high speed will be described with reference to FIG. In FIG. 5, 23
Is a branch determination circuit, which is an internal signal 21 (U, V, W, BP.C-1) of the carry look-ahead circuit 6, an internal signal 24 of the zero detection circuit 7 and a G3 which is a part of the PG generation function 20. It inputs and outputs the branch determination result BLEU25. The branch determination of BLEU can be performed by taking the logical sum of the carry flag and the zero flag as shown in (Table 1). When the logical sum of the zero flag (Equation 7) and the carry flag (Equation 6) is taken, (Equation 1
6).

[0054]

[Equation 16]

It becomes The branch determination circuit 23 implements the logic of the equation (16). The branch determination circuit 23 inputs the internal signals U, V, W, BP · C-1 of the carry look-ahead circuit 6, the internal signal 24 of the zero detection circuit 7 and the carry generation function G3 of the most significant digit ( The logic of Expression 16) is realized. Here, the underlined logic of (Equation 16) can be realized by the internal signal 24 of the zero detection circuit 7. That is, the addition result is determined by using the internal signals U, V, W, and BP · C-1 of the carry look-ahead circuit 6 to determine whether or not the branch condition BLEU is satisfied in parallel with the carry flag and the zero flag. The branch can be judged quickly. In the first embodiment, an adder,
Although the divided blocks have been described by taking 4-bit ones as an example, the number of digits may be an adder or a block other than 4-bit. Needless to say, it is possible to mix adders and blocks having different numbers of digits in order to realize a multi-word length adder.

[0056]

[Table 1]

[0057]

As described above, the present invention includes a PG generating circuit for generating a carry generating function, a carry propagating function, and a NOR operation for each digit in an n-digit 2-input adder. A carry look-ahead circuit that inputs a carry generation function, a carry propagation function, and a carry to the least significant digit for each digit to generate a carry flag, and an internal signal generated by the carry look-ahead circuit (Equation 1). By providing a zero detection circuit that receives as inputs the logical signal shown by the above, the NOR of each digit, and the carry to the least significant digit,
By using the internal signal of the carry look-ahead circuit, it is possible to generate flags at high speed by adding a small number of circuits and to speed up branch determination, so that the processing performance of the computer can be improved.

[Brief description of drawings]

FIG. 1 is a block diagram of a zero flag generation circuit according to a first embodiment of the present invention.

FIG. 2 is a block diagram showing a configuration of an adder for explaining generation of a zero flag in the embodiment.

FIG. 3 is a block diagram of an adder in which carry propagation between adders in the embodiment is performed by a ripple carry method.

FIG. 4 is a block diagram of an adder using a two-stage block carry look-ahead system in the same embodiment.

FIG. 5 is a block diagram of a circuit for executing BLEU judgment at high speed.

[Explanation of symbols]

 1-a input control unit 1-b input control unit 2 2 input binary adder 3 PSR 4 carry control unit 5 PG generation circuit 6 carry look-ahead circuit 7 zero detection circuit

Claims (4)

[Claims] 1. An n-digit 2-input adder, a PG generating circuit for generating a carry generating function, a carry propagating function, and a NOR operation for each digit of each input digit, and a carry generating for each digit. A carry look-ahead circuit that inputs a function, carry propagator, and carry to the least significant digit, and a carry look-ahead circuit, and an internal signal that is generated by the carry look-ahead circuit. A flag generation circuit for an adder, comprising: a logic signal represented by (Equation 1); a zero detection circuit which receives the NOR of each digit and a carry to the least significant digit as inputs. 2. The zero detection circuit according to claim 1, further comprising at least two adders, wherein the zero detection output generated by the zero detection circuit of the lower digit side adder is input to the zero detection circuit of the higher digit side adder. A flag generation circuit for an adder, characterized in that the adders are connected in series. 3. The carry generation function, the carry propagation function, and the digits for each digit generated by the PG generation circuit, wherein the adder is divided into a plurality of blocks to form a multiword length adder. Each of the two inputs of the block and the two of the block are obtained by logically ANDing the negative carry of each digit with the negative carry of each input as well as the block carry generation function and the block carry propagation function. A block PG generation circuit for generating a function indicating that the inputs are not both zero and the operation result in the block is zero, the block carry generation function, the block carry propagation function, and the carry to the least significant digit are input. And the block carry look-ahead circuit, which indicates that both the block carry propagation function and the two inputs to the block are zero, and the two inputs of the block are not zero. Flag generation circuit of the adder, characterized in that a zero detection circuit for inputting a carry to the function and the least significant digit indicating that One block calculation result at is zero. 4. The branch determination circuit according to claim 1, further comprising a logic signal represented by (Equation 1), a logical NOT sum for each digit, and a carry to the least significant digit. A flag generation circuit of a featured adder.