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).
A comparator circuit has two 2-bit inputs, A(0,1) and B(0,1) [4 total inputs], and three 1-bit...
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...
A comparator circuit has two 1-bit inputs A and B and three 1-bit outputs G (greater), E (equal), and L (less than). That is, G is 1 if A > B (0 otherwise), E is 1 if A == B (0 otherwise), and L is 1 if A < B (0 otherwise). a. Draw the truth table for a 1-bit comparator (the table has 2 inputs and 3 outputs). b. Implement G, E, and L circuits using only...
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
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
Design the following finite state machine (FSM). It has two 1-bit inputs (in1 and in2) and two 1-bit outputs (out1 and out2). The first output (out1) bit should be equal to one if, on both of the last two cycles, in1 and in2 were EQUAL to each other; otherwise, out1 should equal zero. The second output (out2) should be equal to 1 if, on the last cycle, in1 and in2 were NOT EQUAL to each other; otherwise, out2 should equal...
design a 4 bit comparator that compares two numbers of 4 bits. the output should be < > or =. however you're only limited to using multiplexers or full adders. any help on how to draw this will be appreciated
1. a. Design and implement a 2 bit comparator circuit using CMOS transistors(Greater than,less than, equal to or reverse). b. Draw the mask layout with Ln = Lp= 0.6 μm, Wn= 4.8 μm and Wp= 7.8 μm using 0.6 μm technology. Also simulate the design using microwind tool and verify the outputs.
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....
1. a. Design and implement a 2 bit comparator circuit using CMOS transistors(Greater than,less than, equal to or reverse). b. Draw the mask layout with Ln = Lp= 0.6 μm, Wn= 4.8 μm and Wp= 7.8 μm using 0.6 μm technology. Also simulate the design using microwind tool and verify the outputs.
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