Overflow Condition For BCD Arithmetic

Question

How overflow can be detected in BCD Arithmetic?

Comments

Correct me if I misinterpreted your ques. You want to build a circuit that would be able to detect the overflow in BCD addition i.e., if the result coming is either of 1010,1011,1100,1101,1110,1111?

---

Like, if we add 0999(i.e, 0000 1001 1001 1001) which has 3 digits and a sign digit to 0999(itself), we should get 01998 which cannot be represented with 3 digits and a sign bit.

I have an answer, let me know if you think the same. Overflow is detected in BCD addition, if the left-most digit i.e, the sign digit is not 0 or 9 after completion of the addition.