BCD-specific techniques
“Add-and-correct” method
Detecting sums >9 (logic for
𝐾
=
𝐶
4
+
𝑆
3
(
𝑆
2
+
𝑆
1
)
K=C
4
+S
3
(S
2
+S
1
))
Conditionally adding 6 (0110₂) to correct a raw binary sum into a valid BCD digit
Ripple-carry chaining
How the carry-out from one digit drives the next BCD-digit adder
Timing & hazard considerations
Propagation delays through adders and gates
Glitches when gating the correction signal