Efficient Conversion of Random Sequences into Equiprobable and Independent Sequences

We consider the problem of efficient conversion of sequences generated by an arbitrary Bernoulli source into sequences of independent and equiprobable symbols. This problem was previously considered by J. von Neumann, P. Elias, etc. For the proposed method based on the Elias algorithm, the memory used and the time required for processing one symbol is exponentially smaller than for previously known algorithms.