Skip to main content

Digital Logic · Logic minimization and hazards

Even parity on a bit string means that the total number of 1s, counting an appended…

Problem

Digital Logic practice problem

Even parity on a bit string means that the total number of 11s, counting an appended parity bit, is even. The even-parity bit of an nn-bit data word DD is thereforePE(D)=dn−1⊕dn−2⊕⋯⊕d0.PE(D)=d_{n-1}\oplus d_{n-2}\oplus\cdots\oplus d_0.An even-parity checker on an (n+1)(n+1)-bit received string DD concatenated with PEPE outputs E=PE(D)⊕PEreceivedE=PE(D)\oplus PE_{\mathrm{received}}; E=1E=1 signals a parity error.

Let the 8-bit data word be D=11010010D=11010010.

(a) Compute PE(D)PE(D). Write the 9-bit transmitted string with the parity bit on the left of the data (the MSB of the 9-bit string).

(b) A single-bit inversion corrupts data bit d3d_3 (counting d0d_0 as the LSB of DD) and leaves the parity bit unchanged. Compute the checker output EE.

(c) Two inversions corrupt d3d_3 and d6d_6, parity bit unchanged. Compute EE. State whether the checker is reliable for double errors.

(d) Realise PE(D)PE(D) as a balanced tree of two-input XOR gates (four XORs in the first rank, two in the second, one in the third). If each XOR has delay 3 ns3\,\mathrm{ns} and all eight data bits arrive at t=0t=0, compute the delay until PE(D)PE(D) is settled.

Hint

Hint

Even-parity bit is the XOR of the data bits, which is 00 iff the data already has even weight.

Check your work

Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.

The answer check and full solution for this problem come with ProofAnvil Practice membership ($19 USD monthly). See membership. Or start with the free Digital Logic sample problem: Try the free sample problem.

More Digital Logic practice problems

Back to Digital Logic

An original ProofAnvil practice problem, written for this course. ProofAnvil is a practice course, not a homework-answer service.