1. polar method was originally suggested by Box, G. E. P., and Muller, M. E., in "A Note on the Generation of Random Normal Deviates;The;Annals of Mathematical Statistics,1958
2. generator is described in Lewis, P. A. W., Goodman, A. S., and Miller, M. M. A pseudo-random number generator for the System/360;This;IBM Systems Journal,1969
3. For example let U be a four-bit word b0b1b2b3. The first bit b0 could be isolated by U0=⌊U÷2*3 so the bit string 0b1b2b3 is U-(U0 × 2*3). For example let U be a four-bit word b0b1b2b3. The first bit b0 could be isolated by U0=⌊U÷2*3 so the bit string 0b1b2b3 is U-(U0 × 2*3).
4. Acccording to Knuth (see page 113 of the book cited in reference 1) both the polar and rectangle-wedge-tail methods "give essentially perfect accuracy". However "Teichroew's method is only approximate although in most applications its accuracy (an error bounded by 2 × 10-4 when |R|≤1) is quite satisfactory". Acccording to Knuth (see page 113 of the book cited in reference 1) both the polar and rectangle-wedge-tail methods "give essentially perfect accuracy". However "Teichroew's method is only approximate although in most applications its accuracy (an error bounded by 2 × 10-4 when |R|≤1) is quite satisfactory".