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.
Following the circuit specification below: Comparator: A 3-bit comparator has six inputs A= A2A1A0 and B=...
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
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 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...
Assume that a and b are 3-bit inputs (let a be a2a1a0 and b be b2b1b0). (a) Determine the Boolean expression (in terms of a2,a1,a0, b2,b1 and b0) for the relational operation a>b (b) Assume that b is a constant and that b = "101". Determine the Boolean expression again. (c) Assume that a is a constant and that a = "101". Determine the Boolean expression again.
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...
Problem 4 Design the static complementary CMOS implementation of a 2-bit comparator circuit, where we have two inputs A and B (each is 2-bit wide) and the output 0 if A > B and output 1 if A B. Design the circuit for minimum delay (assuming a stage effort of 4) and driving a load of 10 fF. As part of the design you need to determine the width of all transistors You can use the following transistor parameters for...
3.4.1 Build and simulate the comparator circuit shown in Figure 3, in Multisim. The inputs A3, A2, A1, 40 act as the first 4-bit binary number, and B3, B2, B1, BO act as the second 4-bit binary number. Run your circuit for different setting of the inputs as in Table 3 and observe how the output Xchecks if the numbers are equal or not. Note: connect the eight inputs of this circuit to an 8-input DIP switch as shown in...
Design 2-bit comparator using 1-bit comparators. Draw the circuit using a block diagram for the unit comparator and any additional gates. Include logic such as: A=B when (A0=B0 && A1=B1) A>B when (A1>B1 or A1=B1 && A0>B0), etc.
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
Problem 1:
consider the following circuit with 4 inputs A, B, c, D, and 3 outputs F, G, H. Each input/output is connected to an input/output port. 3-input OR gate Figure 1 a) Determine the Boolean algebra equations relating each input to each output of the circuit. b) Create the truth tables corresponding to the equations obtained above. There should be one truth table per equation c) Produce the Karnaugh maps corresponding to the truth tables d) Determine simplified Boolean...