Hi all,
Wasn't sure exactly where to post this, but it seems more on level with the calibre of discussion here than elsewhere on the site.
Okay, so I'm building some simple adder/subtractor circuits in a lab, and one of the involved functions involved was the Sum(A,B,Cin) where Cin is the carry in and A and B are the two given input bits, and you get Sum=(A xor B) xor C = Ʃm(1,2,4,7). All would seem well in the world, except when I simulated this in PSpice, I got a hazard between minterms 1 and 2.
My guess is that this is being caused by a race hazard (moving from minterm 1 to minterm 2 is a diagonal on a KMap), but I'm unsure of how to 'fix' this problem, as this function's KMap gives very little to work with in terms of redundancies.
Any help would be greatly appreciated.
Wasn't sure exactly where to post this, but it seems more on level with the calibre of discussion here than elsewhere on the site.
Okay, so I'm building some simple adder/subtractor circuits in a lab, and one of the involved functions involved was the Sum(A,B,Cin) where Cin is the carry in and A and B are the two given input bits, and you get Sum=(A xor B) xor C = Ʃm(1,2,4,7). All would seem well in the world, except when I simulated this in PSpice, I got a hazard between minterms 1 and 2.
My guess is that this is being caused by a race hazard (moving from minterm 1 to minterm 2 is a diagonal on a KMap), but I'm unsure of how to 'fix' this problem, as this function's KMap gives very little to work with in terms of redundancies.
Any help would be greatly appreciated.