Exact output rate of Peres's algorithm for random number generation

Authors:
Sung-Il Pae
Affiliations:
Hongik University, Seoul, Republic of Korea
Venue:
Information Processing Letters
Year:
2013

Citing 4
Cited 0

Introduction to algorithms

Introduction to algorithms
Optimal random number generation from a biased coin

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast and efficient construction of an unbiased random sequence

IEEE Transactions on Information Theory
Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

An exact computation of the output rate of Peres@?s algorithm is reported. The algorithm, recursively defined, converts independent flips of a biased coin into unbiased coin flips at rates that approach the information-theoretic upper bound, as the input size and the recursion depth tend to infinity. However, only the limiting rate with respect to the input size is known for each recursion depth. We compute the exact output rate for each fixed-length input and compare it with another asymptotically optimal method by Elias.