Digital Fundamentals (11th Edition)
11th Edition
ISBN: 9780132737968
Author: Thomas L. Floyd
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 2, Problem 55P
In a certain application a 4-bit binary sequence cycles from 1111 to 0000 periodically. There are four bit changes, and because of circuit delays, these changes may not occur at the same instant. For example, if the LSB changes first, the number will appear as 1110 during the transition from 1111 to 0000 and may be misinterpreted by the system. Illustrate how the Gray code avoids this problem.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
In ___________ there is always a transition at the middle of the bit, but the bit values are determined at the beginning of the bit. If the next bit is 0, there is a transition; if the next bit is 1, there is none.
a.
Manchester
b.
differential Manchester
c.
both (a) and (b)
d.
neither (a) nor (b)
In the steps of “Append the padding bits” in SHA-512 system (shown in Figure 1), the message is padded so that its length is congruent to 896 mod 1024 or (length ≅ 896 mod 1024). State the value of the following padding field is the message length is:
a) 1919
b) 1920
c) 2942
You have been hired by a company to design a circuit to encrypt passwords. Assumepasswords are 3 bits in size and that the encrypted password is the original password inverted(0's become 1's and 1's become 0's) and then add 3 (modulo 8 as we only have 3 bits). Forexample if the password is 000, we invert it to give us 111. We then add 3 (7 + 3 = 10 mod8 = 2) which makes the encrypted password 010. Design and build a sequential circuit (usingthe procedure from your notes) using 3 T flip-flops to perform the above function. You needto show the State Table, K-maps and draw the sequential circuit.
Chapter 2 Solutions
Digital Fundamentals (11th Edition)
Ch. 2.1 - Prob. 1CUCh. 2.1 - Prob. 2CUCh. 2.2 - Prob. 1CUCh. 2.2 - Prob. 2CUCh. 2.2 - Prob. 3CUCh. 2.3 - Prob. 1CUCh. 2.3 - Prob. 2CUCh. 2.4 - Prob. 1CUCh. 2.4 - Prob. 2CUCh. 2.4 - Prob. 3CU
Ch. 2.5 - Prob. 1CUCh. 2.5 - Prob. 2CUCh. 2.6 - Prob. 1CUCh. 2.6 - Prob. 2CUCh. 2.6 - Prob. 3CUCh. 2.6 - Prob. 4CUCh. 2.7 - Prob. 1CUCh. 2.7 - Prob. 2CUCh. 2.7 - Prob. 3CUCh. 2.7 - What is the sign of the product when two negative...Ch. 2.7 - Prob. 5CUCh. 2.7 - What is the sign of the quotient when a positive...Ch. 2.7 - Prob. 7CUCh. 2.8 - Prob. 1CUCh. 2.8 - Prob. 2CUCh. 2.8 - Prob. 3CUCh. 2.8 - Prob. 4CUCh. 2.8 - Prob. 5CUCh. 2.8 - Prob. 6CUCh. 2.9 - Prob. 1CUCh. 2.9 - Prob. 2CUCh. 2.9 - Prob. 3CUCh. 2.9 - Prob. 4CUCh. 2.10 - What is the binary weight of each 1 in the...Ch. 2.10 - Convert the following decimal numbers to BCD 6 15...Ch. 2.10 - Prob. 3CUCh. 2.10 - Prob. 4CUCh. 2.11 - Prob. 1CUCh. 2.11 - Prob. 2CUCh. 2.11 - Prob. 3CUCh. 2.12 - Prob. 1CUCh. 2.12 - Prob. 2CUCh. 2.12 - Prob. 3CUCh. 2.12 - Prob. 4CUCh. 2.12 - Prob. 5CUCh. 2 - The decimal number system is a weighted system...Ch. 2 - Prob. 2TFQCh. 2 - Prob. 3TFQCh. 2 - Prob. 4TFQCh. 2 - Prob. 5TFQCh. 2 - Prob. 6TFQCh. 2 - Prob. 7TFQCh. 2 - The hexadecimal number system has 16 characters,...Ch. 2 - BCD stands for binary coded decimalCh. 2 - Prob. 10TFQCh. 2 - Prob. 11TFQCh. 2 - Prob. 12TFQCh. 2 - Prob. 1STCh. 2 - Prob. 2STCh. 2 - Prob. 3STCh. 2 - The decimal number 17 is equal to the binary...Ch. 2 - The decimal number 175 is equal to the binary...Ch. 2 - Prob. 6STCh. 2 - Prob. 7STCh. 2 - Prob. 8STCh. 2 - Prob. 9STCh. 2 - Prob. 10STCh. 2 - Prob. 11STCh. 2 - Prob. 12STCh. 2 - Prob. 13STCh. 2 - Prob. 14STCh. 2 - Prob. 15STCh. 2 - Prob. 16STCh. 2 - Prob. 17STCh. 2 - Prob. 18STCh. 2 - Prob. 19STCh. 2 - Prob. 20STCh. 2 - Prob. 1PCh. 2 - Prob. 2PCh. 2 - Prob. 3PCh. 2 - How high can you count with four decimal digits?Ch. 2 - Prob. 5PCh. 2 - Prob. 6PCh. 2 - Prob. 7PCh. 2 - What is the highest decimal number that can be...Ch. 2 - Prob. 9PCh. 2 - Prob. 10PCh. 2 - Prob. 11PCh. 2 - Prob. 12PCh. 2 - Prob. 13PCh. 2 - Prob. 14PCh. 2 - Prob. 15PCh. 2 - Prob. 16PCh. 2 - Prob. 17PCh. 2 - Prob. 18PCh. 2 - Prob. 19PCh. 2 - Prob. 20PCh. 2 - Prob. 21PCh. 2 - Prob. 22PCh. 2 - Prob. 23PCh. 2 - Prob. 24PCh. 2 - Prob. 25PCh. 2 - Prob. 26PCh. 2 - Prob. 27PCh. 2 - Prob. 28PCh. 2 - Prob. 29PCh. 2 - Prob. 30PCh. 2 - Prob. 31PCh. 2 - Prob. 32PCh. 2 - Prob. 33PCh. 2 - Prob. 34PCh. 2 - Prob. 35PCh. 2 - Prob. 36PCh. 2 - Prob. 37PCh. 2 - Prob. 38PCh. 2 - Convert each hexadecimal number to decimal: 2316...Ch. 2 - Prob. 40PCh. 2 - Prob. 41PCh. 2 - Prob. 42PCh. 2 - Prob. 43PCh. 2 - Prob. 44PCh. 2 - Prob. 45PCh. 2 - Prob. 46PCh. 2 - Prob. 47PCh. 2 - Prob. 48PCh. 2 - Convert the following decimal numbers to BCD: 104...Ch. 2 - Prob. 50PCh. 2 - Convert each of the BCD numbers to decimal...Ch. 2 - Prob. 52PCh. 2 - Prob. 53PCh. 2 - Prob. 54PCh. 2 - In a certain application a 4-bit binary sequence...Ch. 2 - Prob. 56PCh. 2 - Prob. 57PCh. 2 - Prob. 58PCh. 2 - Prob. 59PCh. 2 - Prob. 60PCh. 2 - Prob. 61PCh. 2 - Prob. 62PCh. 2 - Prob. 63PCh. 2 - Prob. 64PCh. 2 - Prob. 65PCh. 2 - Prob. 66PCh. 2 - Prob. 67PCh. 2 - Prob. 68PCh. 2 - Prob. 69P
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
What is a parameterized constructor?
Starting out with Visual C# (4th Edition)
What will the following program segment display? int add0n = 0, subTotal = 0; while (add0n 5) { add0n++ if (ad...
Starting Out with C++: Early Objects
Write a program that acts as a simple printing calculator. The program should allow the user to type in express...
Programming in C
Write a for loop that repeats seven times, asking the user to enter a number. The loop should also calculate th...
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
What does the phrase calling a function mean?
Starting Out with Python (4th Edition)
(Multiples of 2 with an Infinite Loop) Write a program that keeps printing the multiples of the integer 2, name...
C How to Program (8th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- a. Compute for the data efficiency of transmitting if the data format is a General Synchronous Data Frame. b. For an asynchronous data transmission (wherein 1 byte of data is accompanied by a specific number of auxiliary bits), how many start and stop bits are there if the data efficiency in transmitting is ? The number of start bits is equal to the number of stop bits.arrow_forwardA block of bits with n rows and k columns uses horizontal and vertical parity bits for error detection. Suppose that exactly 4 bits are inverted due to transmission errors. Drive a mathematical expression of n and k for the total number of different cases where these 4 error bits will be undetected. Show each important step of your derivation. (Hint: the error bits will be undetected if all the parity bits computed from the block remain unchanged.)arrow_forwardGiven are the following codewords for an error control coding scheme data 000 011 100 codeword 00011000 00000111 10101000 . a.What is the minimum Hamming distance? b. What is the coding rate for this scheme? c. what raw data rate would be required if we need a throughput of 6 Mpbs? d. in a different situation, the number of data bits to transfer is 5, and the minimum hamming distance is dmin=5. find the maximum coding rate for this situationarrow_forward
- We are provided an FP prototype labeled: IEEE 754-2015 of 15 bits similar to IEEE 754, where the exponent has size 6 bits and fraction has size 8 bits, and 1 MSB for the sign. No guard or round bits are assumed. What is the bias of the system? Find the smallest and largest number that can be represented. Find the new representation of the decimal number you worked with earlier (e.g., the 0.012).arrow_forwardTake the 127-bit binary BCH code with a 6-bit target distance and the 128-bit binary field extension F 128. How large is the code, and is there a minimum distance you can guarantee?arrow_forwardA repetition code is an [n, 1] Code in which the n - 1 parity bits are repetitions of the information bit. Is this repetition code a linear code ? What is the minimum distance of the code ?please given step by step solution.arrow_forward
- Based on hamming code (7 , 4) . Given the code 0 1 1 1 1 0 0, if we redid the parity bit generation and all three were wrong, then which data bit was transmitted incorrectly? (d1, d2, d3 or d4?)arrow_forward1. One way of detecting errors is to transmit data as a block of n rows of k bits per row and add parity bits to each row and each column (for this problem k is >=5). The bit in the lower-right corner is a parity bit that checks its row and its column. This scheme will detect burst errors of length 5? (A) TRUE (B) FALSE 2. According to Shannon, if the amount of Signal is increased on a transmission medium, everything else constant, the expected theoretical bitrate would (A) increase (B) decrease (C) remain the same (D) cannot determine 3. In nonpersistent CSMA, if a transmitter ready to transmit senses the channel is busy, the transmitter waits a random amount of time, and senses the line again. If it’s still busy it repeats the process, otherwise it transmits the data. (A) True (B) Falsearrow_forwardA Gray code is a sequence of binary numbers with the property that no more than 1 bit changes in going from one element of the sequence to another. For example, here is a 3-bit binary Gray code: 000, 001, 011, 010, 110, 111, 101, and 100. Using three D flip-flops and a PLA, construct a 3-bit Gray code counter that has two inputs: reset, which sets the counter to 000, and inc, which makes the counter go to the next value in the sequence. Note that the code is cyclic, so that the value after 100 in the sequence is 000.arrow_forward
- For the FSM below, assume to start from state S0 and to use the indicated encoding. The following sequence of inputs are going to be selected one after the other at times t0, t1, t2, t3, and t4. Use the FSM to indicate the next state bits and output Y after each time point. t0 -> AB=00 t1 -> AB=10 t2 -> AB=11 t3 -> AB=11 t4 -> AB=01 Indicate your answer using 3 bits for each time point. For example, if AB=10 at time t0, your answer would be 101, where the first two bits are for the next state (10 -> S2) and the third bit is for the output value Yarrow_forwardAbout error control:a. Write down the bit series of the polynomial x10 + x7 + x4 + 1 b. If there is a message M = 110010 and the remaining bit of division in CRC Technique is R =001, what is the shape of the transmitted bit series if SCS-4 . is usedbits ?arrow_forwardPerform the following logical operations, assuming a nine-bit cell:a) 010 1100 AND 110 1010N =Z = b) 0 0000 1111 AND 1 0111 0101N =Z =c) 0 1001 0011 OR 1 0111 0101N =Z =d) 0 0000 1111 OR 1 0111 0101N =Z =e) 0 1001 0011 XOR 1 0111 0101N =Z =f) 0 0000 1111 XOR 1 0111 0101N =Z =arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Boolean Algebra - Digital Logic and Logic Families - Industrial Electronics; Author: Ekeeda;https://www.youtube.com/watch?v=u7XnJos-_Hs;License: Standard YouTube License, CC-BY
Boolean Algebra 1 – The Laws of Boolean Algebra; Author: Computer Science;https://www.youtube.com/watch?v=EPJf4owqwdA;License: Standard Youtube License