# Box–Muller transform

The **Box–Muller transform** (by George Edward Pelham Box and Mervin Edgar Muller 1958)^{[1]} is a pseudo-random number sampling method for generating pairs of independent, standard, normally distributed (zero expectation, unit variance) random numbers, given a source of uniformly distributed random numbers.

It is commonly expressed in two forms. The basic form as given by Box and Muller takes two samples from the uniform distribution on the interval (0, 1] and maps them to two standard, normally distributed samples. The polar form takes two samples from a different interval, [−1, +1], and maps them to two normally distributed samples without the use of sine or cosine functions.

The Box–Muller transform was developed as a more computationally efficient alternative to the inverse transform sampling method.^{[2]} The Ziggurat algorithm gives an even more efficient method{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B=
{{#invoke:Category handler|main}}{{#invoke:Category handler|main}}^{[citation needed]}
}}.

## Contents

## Basic form

Suppose *U*_{1} and *U*_{2} are independent random variables that are uniformly distributed in the interval (0, 1]. Let

and

Then *Z*_{0} and *Z*_{1} are independent random variables with a standard normal distribution.

The derivation^{[3]} is based on the fact that, in a two-dimensional Cartesian system where X and Y coordinates are described by two independent and normally distributed random variables, the random variables for *R*^{2} and Θ (shown above) in the corresponding polar coordinates are also independent and can be expressed as

and

Because *R*^{2} is the square of the norm of the standard bivariate normal variable (X, Y), it has the chi-squared distribution with two degrees of freedom. In the special case of two degrees of freedom, the chi-squared distribution coincides with the exponential distribution, and the equation for *R*^{2} above is a simple way of generating the required exponential variate.

## Polar form

{{#invoke:main|main}}

The polar form was first proposed by J. Bell^{[4]} and then modified by R. Knop.^{[5]} While several different versions of the polar method have been described, the version of R. Knop will be described here because it is the most widely used, in part due to its inclusion in Numerical Recipes.

Given *u* and *v*, independent and uniformly distributed in the closed interval [−1, +1], set *s* = *R*^{2} = *u*^{2} + *v*^{2}. (Clearly Template:Nobr If *s* = 0 or *s* ≥ 1, throw *u* and *v* away and try another pair (*u*, *v*). Because *u* and *v* are uniformly distributed and because only points within the unit circle have been admitted, the values of *s* will be uniformly distributed in the open interval (0, 1), too. The latter can be seen by calculating the cumulative distribution function for *s* in the interval (0, 1). This is the area of a circle with radius , divided by . From this we find the probability density function to have the constant value 1 on the interval (0, 1). Equally so, the angle θ divided by is uniformly distributed in the interval [0, 1) and independent of *s*.

We now identify the value of *s* with that of *U*_{1} and with that of *U*_{2} in the basic form. As shown in the figure, the values of and in the basic form can be replaced with the ratios and , respectively. The advantage is that calculating the trigonometric functions directly can be avoided. This is helpful when trigonometric functions are more expensive to compute than the single division that replaces each one.

Just as the basic form produces two standard normal deviates, so does this alternate calculation.

and

## Contrasting the two forms

The polar method differs from the basic method in that it is a type of rejection sampling. It throws away some generated random numbers, but it is typically faster than the basic method because it is simpler to compute (provided that the random number generator is relatively fast) and is more numerically robust.^{[6]} It avoids the use of trigonometric functions, which are comparatively expensive in many computing environments{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B=
{{#invoke:Category handler|main}}{{#invoke:Category handler|main}}^{[citation needed]}
}}. It throws away 1 − π/4 ≈ 21.46% of the total input uniformly distributed random number pairs generated, i.e. throws away 4/π − 1 ≈ 27.32% uniformly distributed random number pairs per Gaussian random number pair generated, requiring 4/π ≈ 1.2732 input random numbers per output random number.

The basic form requires two multiplications, 1/2 logarithm, 1/2 square root, and one trigonometric function for each normal variate.^{[7]} On some processors, the cosine and sine of the same argument can be calculated in parallel using a single instruction. Notably for Intel-based machines, one can use the fsincos assembler instruction or the expi instruction (usually available from C as an intrinsic function), to calculate complex

and just separate the real and imaginary parts.

The polar form requires 3/2 multiplications, 1/2 logarithm, 1/2 square root, and 1/2 division for each normal variate. The effect is to replace one multiplication and one trigonometric function with a single division.

## Tails truncation

When a computer is used to produce a uniform random variable it will inevitably have some inaccuracies because there is a lower bound on how close numbers can be to 0. For 32 bit computer the smallest number that can be generated is . When and are equal to this the Box–Muller transform produces a normal random variable equal to This means that the algorithm will not produce random variables more than 6.66 standard deviations from the mean. This corresponds to a proportion of lost due to the truncation.

## Implementation

A simple implementation in C++ using the variance. If the noise is generated without the variance, the multiplication by the variance in the implementation below can simply be removed.

```
#define TWO_PI 6.2831853071795864769252866
double generateGaussianNoise(const double &variance)
{
static bool haveSpare = false;
static double rand1, rand2;
if(haveSpare)
{
haveSpare = false;
return sqrt(variance * rand1) * sin(rand2);
}
haveSpare = true;
rand1 = rand() / ((double) RAND_MAX);
if(rand1 < 1e-100) rand1 = 1e-100;
rand1 = -2 * log(rand1);
rand2 = (rand() / ((double) RAND_MAX)) * TWO_PI;
return sqrt(variance * rand1) * cos(rand2);
}
```

## See also

- Inverse transform sampling
- Marsaglia polar method, similar transform to Box-Muller, which uses Cartesian coordinates, instead of polar coordinates

## References

- ↑ G. E. P. Box and Mervin E. Muller,
*A Note on the Generation of Random Normal Deviates*, The Annals of Mathematical Statistics (1958), Vol. 29, No. 2 pp. 610–611 - ↑ Kloeden and Platen,
*Numerical Solutions of Stochastic Differential Equations*, pp. 11–12 - ↑ Sheldon Ross,
*A First Course in Probability*, (2002), pp. 279–81 - ↑ J. Bell: 'Algorithm 334: Normal random deviates', Communications of the ACM, vol. 11, No. 7. 1968
- ↑ R. Knopp: 'Remark on algorithm 334 [G5]: normal random deviates', Communications of the ACM, vol. 12, No. 5. 1969
- ↑ Everett F. Carter, Jr.,
*The Generation and Application of Random Numbers*, Forth Dimensions (1994), Vol. 16, No. 1 & 2. - ↑ Note that the evaluation of 2
*πU*_{1}is counted as a single multiplication because the value of 2*π*can be computed in advance and used repeatedly.