US 5,862,065 A · Method and circuit for fast generation of zero flag condition code in a microprocessor-based computer

Abstract

An adder circuit in parallel with a zero flag generation circuit. In a preferred embodiment, an arithmetic logic unit (ALU) circuit in a microprocessor based computer system includes an adder circuit preferably adapted to receive first and second operands. The preferred adder circuit is further adapted to produce a result equal to the sum of the first and second operands. The ALU circuit further includes a zero flag generation circuit. The zero flag generation circuit is adapted to receive the first and second operands in parallel with the adder circuit and to produce a zero flag signal in response to the operands. The zero flag signal is indicative of whether the sum of the operands is equal to zero. In one embodiment, the zero flag generation circuit includes N half adders in parallel wherein each adder receives a bit from the first operand and a corresponding bit from the second operand. Each half adder produces a sum bit and a carry bit in response to the inputs. Preferably, the zero flag generation circuit further includes N-1 Exclusive OR (EXOR) gates. Each of the N-1 EXOR gates receives one bit of the N sum bits and a corresponding bit of the N carry bits as inputs. The N-1 outputs from the EXOR gates, together with an inverted least significant sum bit, are routed to a logic circuit. The logic circuit functions as an AND gate, producing an output signal indicative of whether each input signal is equal to 1.

Claims1

Dependent claims

An arithmetic logic unit circuit, comprising:

an adder circuit adapted to receive a first operand and a second operand and to produce an output indicative of a sum of said first second operands;
and
a zero flag generation circuit adapted to receive said first and second operands in parallel with said adder circuit and to produce a zero flag signal in response thereto, wherein said zero flag signal is indicative of whether the sum of said first and second operands is equal to zero, wherein said zero flag generation circuit comprises:
an inverter stage coupled to receive and complement said first and second operands, wherein each said first and second operands comprise N bits;
a half-adder stage coupled to receive the outputs of said first and second inverters, wherein said half-adder stage outputs N sum bits and N-1 carry bits, wherein no carry bit is output for the most significant corresponding bit pair of said first and second operands;
an EXOR stage coupled to receive N-1 of said N sum bits and to receive said N-1 carry bits, wherein said EXOR stage EXORs each N-1 sum bit to the corresponding N-1 carry bit and produces N-1 bits of an N bit word;
an inverter coupled to receive the least significant bit of said N sum bits and output the least significant bit of said N bit word;
and
a logic stage coupled to receive said N bit word and adapted to produce a one bit signal indicative of whether each bit of said N bit word is set.

6 more elements

Dependencies are inferred from the claim text.

Method and circuit for fast generation of zero flag condition code in a microprocessor-based computer

Life of this patent

Method and circuit for fast generation of zero flag condition code in a microprocessor-based computer

Life of this patent

Abstract

Claims1