# explain in details as I provided you with answers

**Question description**

Another approach to deskewing is to consider the bit stream as a sequence of

non-overlapping groups of n bits each and output the parity of each group.That is,

if a group contains an odd number of ones, the output is 1; otherwise the output

is 0.

a. Express this operation in terms of a basic Boolean function.

**THE ANSWER IS the input bits s1,s2, ....,sn and the output bits o as o = s1 + s2, .... sn **

b. Assume that the probability of a 1 is 0.5 δ. If each group consists of 2 bits, what is the probability of an output of 1?

**THE ANSWER IS 0.5- 2δ^2**

c. If each group consists of 4 bits, what is the probability of an output of 1? **THE ANSWER IS 0.5- 8δ^4**

d. Generalize the result to find the probability of an output of 1 for input groups of

n bits. The limit as n goes to infinity is 0.5

## Tutor Answer

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors