How do I develop a minimal NOR circuit that detects overflow by examining the sign bits of two addends (A and B) and their sum (S)?(adsbygoogle = window.adsbygoogle || []).push({});

Doesn't this depend on how long the addends A and B are? Is there anyway I can generalize the result to n bit addends?

or perhaps I can just designate one input as 'the carry in', compare the MSB of the two addends and go from there?

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Question about NOR gates and overflow

**Physics Forums | Science Articles, Homework Help, Discussion**