1 Nov
2010
1 Nov
'10
6:41 p.m.
On 2010 Nov 1, at 4:00 PM, Chuck Guzis wrote:
Tony wanted to see what the minimum in
combinatorial logic would be. To date, I've not seen a solution that
doesn't use decoders or demuxes, just AND OR and NOT elements.
Anyone care to give that a crack and see what the optimal case is
using SSI TTL--say, nothing more complex than a 7486?
Well, a starting point could be to replace the 74154 in the 1-of-16
decoder solution with 4 inverters and 16 4-in nands (9 packages),
plus the 4 packages remaining of that solution to do the segment
selection, gives 13 packages. Optimisation anyone?