This is an old revision of the document!


Von-Neumann Debiasing

Given the set of binary digits:

\begin{eqnarray*}
B &=& \{ k | k \in \{ 0, 1 \} \} \\
\end{eqnarray*}

and $S$ a sequence of arbitrary binary digits:

\begin{eqnarray*}
S &=& {\huge\bullet_{i=1}^{n}} k_{i},k_{i} \in B,n \ge 2
\end{eqnarray*}

Let $r_{i}$ be a debiased random binary number such that:

\begin{equation}
r_{i} = 
\begin{cases}
0 & k_{i-1} = 0,k_{i} = 1  \\
1 & k_{i-1} = 1,k_{i} = 0
\end{cases}
\end{equation}

The following table shows the possible outcomes for the random binary digit $r_{i}$:

$k_{i-1}$ $k_{i}$ $r_{i}$
0 0 discard
0 1 0
1 0 1
1 1 discard

Index


fuss/computer_science.1633582800.txt.gz ยท Last modified: 2021/10/07 05:00 by office

Access website using Tor Access website using i2p Wizardry and Steamworks PGP Key


For the contact, copyright, license, warranty and privacy terms for the usage of this website please see the contact, license, privacy, copyright.