I'm reading through the "Logic Design" chapter in Givone's Digitial Principles and Design and this is one of the problems at the end of the chapter. I read the section on comparators thoroughly, but still do not understand how to do this problem.
Essentially, the end goal is to design a 1-bit comparator that can be cascaded into a larger network in order to determine if 2 n-bit numbers are equal.
How do I even approach this problem?
What's primarily tripping me up is the "n-bit number" restriction. Does this mean my network should be able to handle two numbers of infinite length? or does it mean that the 1-bit comparator I design should be able to function if it's put into a cascaded network containing n of them?
Any pointers would be greatly appreciated.