1. The minimal function that can detect a "divisible by 3" 8421 BCD code digit (representation D8D4D2D1) is given by
Ask Your Doubts Here
Comments
By: guest on 02 Jun 2017 12.56 am
Now the problem can be solved using k-map method. The function can be expressed as Σm(0, 3, 6, 9) + d(10, 11, 12, 13, 14, 15) ∴ K-map is ∴ The function is D 8D 4D 2D 1 + D 4D2D1 + D4D2D 1 + D8D1 .