Consider the following proposal to deskew a skewed bitstream from a TRNG. Consider the bitstream to be a sequence of groups ot n bits for some n > 2. Take the first n bits, and output the parity of those n bits as the first bit in a deskewed bitstream. Then take the n bits starting with the next bit, and use this to get the second bit in an allegedly deskewed bitstream. To give you an example, consider the following bitstream of length 10 in which n=3:
Original bitstream: 0011101011
First 7 bits of output “deskewed” bitstream (each bit is the parity of the emboldened, italicized, underlined bits):
Bitstream
Output bit
0011101011
1
0011101011
0
0011101011
1
0011101011
0
0011101011
0
0011101011