a) The truth table for a 1-bit comparator:
A | B | G | E | L |
0 | 0 | 0 | 1 | 0 |
0 | 1 | 0 | 0 | 1 |
1 | 0 | 1 | 0 | 0 |
1 | 1 | 0 | 1 | 0 |
(b) Implementation of G, E, L circuits using NAND and NOT gates:
Using above truth table and K-Map, G=AB' , E=A XNOR B, L=A'B
(c) Construction of 4 bit equality checker using 1 bit comparator as building block:
Suppose, two 4 bit binary number A=A3A2A1A0 and B=B3B2B1B0 and E is equlity output of A and B.
A=B only if E=E3E2E1E0 where Ei is equality output of Ai and Bi .
Here is the implementation of 4 bit equality checker:
A comparator circuit has two 1-bit inputs A and B and three 1-bit outputs G (greater),...
Following the circuit specification below: Comparator: A 3-bit comparator has six inputs A= A2A1A0 and B= B2B1B0, and one output: L. The comparator is a ‘less than’, meaning the output is ‘1’ is A<B. Using your method of choice, find the Boolean expression for the output of the comparator; Draw the logic circuit of the 3-bit comparator Available gates (no other gates can be used than the 5 listed below): 2-input NAND 2-input NOR 2-input AND 2-input OR Inverter
2 A comparator circuit has two 2-bit inputs, A(0,1) and B(0,1) [4 total inputs], and three 1-bit outputs, G (A greater than B), E (equal), and L (A less than B) (hint: Compare two bits against two bits, for example if inputs are 0010, then B is greater than A). Write the logic equation for each output, and draw the logic diagram for each output using 8 to 1 Multiplexers (3). Inputs Outputs F1 F2 F3 A1 AO B1 BOAB...
Design a circuit with three inputs (A, B, C) and two outputs (F1, F2). The first output F1 is 1 when the binary input is 2, 3, 4, 7, otherwise the first output F1 is logic 0. The second output F2 is 1 when the input variables have more l's than 0's. The output is 0 otherwise. Input/ Output ABC F1 F2 000 001 010 011 100 101 a. Derive the truth-table for F1 and F2 as a function of...
A Y = A ® B 1 1 1 0 0 1 1 1 Apply the idea of the truth table above and design a 3-bit comparator using XOR or XNOR gates of your choice. The design should be able to determine the equality between two 3-bit words. An LED should be turned ON only when every bit in "Word A" matches every corresponding bit in "Word B". Otherwise, the LED has to be OFF. Hint for I/O port Definitions:...
A Y = A+ B 1 1 1 1 1 1 Apply the idea of the truth table above and design a 3-bit comparator using XOR or XNOR gates of your choice. The design should be able to determine the equality between two 3-bit words. An LED should be turned ON only when every bit in "Word A" matches every corresponding bit in "Word B". Otherwise, the LED has to be OFF Hint for I/O port Definitions: Port Name MSB...
Design a circuit with three inputs (A, B, C) and two outputs (F1, F2). The first output F1 is logic 1 if the number of l’s in the binary number is less than the number of O's, otherwise F1 is logic 0. The second output F2 is 1 if the binary input is 2, 4, 5, 6,7 otherwise the second output F2 is logic 0. a. Derive the truth-table for F1 and F2 as a function of the 3 inputs....
A Y = A ® B 0 1 1 1 0 1 1 1 Apply the idea of the truth table above and design a 3-bit comparator using XOR or XNOR gates of your choice. The design should be able to determine the equality between two 3-bit words. An LED should be turned ON only when every bit in "Word A" matches every corresponding bit in "Word B".Otherwise, the LED has to be OFF Hint for I/O port Definitions: MSB...
A Y = A ® B 1 1 1 1 1 Apply the idea of the truth table above and design a 3-bit comparator using XOR or XNOR gates of your choice. The design should be able to determine the equality between two 3-bit words. An LED should be turned ON only when every bit in "Word A" matches every corresponding bit in "Word B". Otherwise, the LED has to be OFF Hint for I/O port Definitions: Port Name Direction...
Design a combinational circuit with three inputs, x , y, and z, and three outputs, A, B , and C . When the binary input is 0, 1, 2, or 3, the binary output is one greater than the input. When the binary input is 4, 5, 6, or 7, the binary output is two less than the input. 1) Truth table 2) Logic circuit 3) Boolean function of A using minterms ( use Boolean algebra) 4) Boolean function of...
Digital Systems Part 1 Implement a 1-bit comparator as shown in the figure below using a 2x4 decoder. The comparator compares two bits A and B and produces three outputs Eq = 1 when A-B.G=1 when A > B, and L=1 when A<B. Your circuit must have the same inputs and outputs shown in the figure A B EN 1-bit Comparator Eq G L A = B A > B A<B