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 Graycode avoids this problem

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 Graycode avoids this problem

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 7VE

See similar textbooks

Similar questions

A(n) _____ operation transforms a 0 bit value to 1 and a 1 bit value to 0.
Data represented in ________ is transmitted accurately between computer equipment from different manufacturers if each computer’s CPU represents real numbers by using an IEEE standard notation.
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)
A 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.)
A 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.
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).
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.
A 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.
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 Y
The bitstring 1011110 and 0100001 were subjected to XAND. What is the result?
Given 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 situation
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.