A 4 bit number , ABCD is a palindrome when A is equal to D and B is equal to C . Draw a circuit to check whether a given 4 bit number is a palindrome or not. Use only 2:1 multiplexers.Do not use any gate. assume complemented inputs are available. I tried but could get circuit using minimum 7 multiplexers .But this circuit is possible using less number of multiplexers. Please can anybody tell how ?
Take the 2-minute tour
×
Electrical Engineering Stack Exchange is a question and answer site for electronics and electrical engineering professionals, students, and enthusiasts. It's 100% free, no registration required.
|
It's been 17 hours now, and I can't tell whether the OP is still interested in this question and its answer, but I'm going to throw out some relevant points without actually giving the final answer. A 2:1 multiplexer implements the equation Y = S'A + SB, which means that it contains an inverter, two AND gates and an OR gate. This actually makes it a fairly "universal" logic element, and in fact, at least one family of FPGAs uses this concept as its basic building block. A 2:1 multiplexer can implement a 2-input AND, a 2-input OR or a 1-input NOT directly, and if the complements of the logic inputs are available, it can also do NAND, NOR, XOR and XNOR. Finally, testing whether two bits are equal is the same as the XNOR operation. |
|||||||||
|