You have been hired by a company to design a circuit to encrypt passwords. Assume passwords are 3 bits in size and that the encrypted password is the original password plus 2 and then invert the bits (0's become l's and l's become O's). For example if the password is 000, we add 2 to give us 010, and then invert the bits, which gives the encrypted password as 101. Design and build a sequential circuit (using the procedure from your notes) using 3 T flip-flops to perform the above function. You need to show the State Table, K-maps and draw the sequential circuit.

You have been hired by a company to design a circuit to encrypt passwords. Assume passwords are 3 bits in size and that the encrypted password is the original password plus 2 and then invert the bits (0's become l's and l's become O's). For example if the password is 000, we add 2 to give us 010, and then invert the bits, which gives the encrypted password as 101. Design and build a sequential circuit (using the procedure from your notes) using 3 T flip-flops to perform the above function. You need to show the State Table, K-maps and draw the sequential circuit.

Introductory Circuit Analysis (13th Edition)

13th Edition

ISBN:9780133923605

Author:Robert L. Boylestad

Publisher:Robert L. Boylestad

Chapter1: Introduction

Section: Chapter Questions

Problem 1P: Visit your local library (at school or home) and describe the extent to which it provides literature...

See similar textbooks

Similar questions

I want to perform addition of the following two binary numbers A and B using a combination of Full adders and Half adders. A3 A2 A1 A0 + B3 B2 B1 B0 where A0 and B0 are LSBS and A3 and B3 are MSBS. Then to add which pair of bits would you use a Half Adder? O a. A1 and B1 O b. A3 and B3 Oc. A2 and B2 O d. A0 and BO
In a 4-bit system, what are the carry and overflow flags of the following operations: a. 0100 +0010 b. 0100+0110 C. 1100 + 1110 d. 11001010
- Explain the difference between binary and BCD using a decimal value 8. - Draw the truth table of the below MUX. For the multiplexer in the figure below, determine the output for the following input states: A=1, B=1, C=1, D=0, So=0, S1=0. Explain your answer. A MUX B 4 to 1 si so -Explain an application of DMUX?
b. Complete the following two operations. Compute the result for -3810 – 8610 using 8-bit 2's | Compute the result for -3810 – 8610 using 8-bit 1's complement operation. Verify if the result is correct. complement operation. Verify if the result is correct. If not, explain why. If not, explain why.
Convert the decimal number (-25) into signed binary number using the 1's complement form method. a) 000110 A7 b) 100110 c) 100111 d) 111001
1. For 8-bit binary numbers: a. Compute 125-75 using 2's complement to represent negative numbers. Indicate if there is overflow. b. Compute -55-73 using 2's complement to represent negative numbers. Indicate if there is overflow.
Convert the BCD NUMBER 0010 0000 0001 0011 . 0110 1000 0111 0101 to BINARY number showing the steps
56.) Derive the truth table of a decimal-to-binary priority encoder. There are 10 inputs I, through I, and outputs A, through A, and V. Input I, has the highest priority. 37.) (a) Design an 8-to-1-line multiplexer using a 3-to-8-line decoder and an 8 X 2 AND-OR. 5-52. Perform the indicated subtraction with the following unsigned binary numbers by taking the 2s complement of the subtrahend: (a) 11010 – 10001 - (b) 11110 1110 (c) 1111110 - 1111110 (d) 101001 – 101 Time: 616 minutes at 11:59pm Points 25 Questions 13 WARNIN AY 7:36 W
7. Assume you are using a binary adder that stores maximum 6 bits. Illustrate how you would add the following two numbers: (-15) + 28
What is the minimum number of bits required to store the result of the operation (-6410 - 6410) if the result is to be encoded using 2's complement? 7 bits 10 bits 6 bits 8 bits 9 bits
11- Represent the decimal number 6,248 in (a) BCD, Convert decimal +49 and +29 to binary, using the signed 2's complement representation and enough digits to accommodate the numbers. Then perform the binary equivalent of (+29) + (-49), (-29) + (+49), and (-29) + (-49). Convert the answers back to decimal and verify that they are correct.
Create the gray code representation of the following binary numbers. 10101 ii) 01001 iii) 10110 iv) 00111 v) 00101