GENERATION OF GAUSSIAN WHITE NOISE 239
They showed that for p = 624, by taking A and B appropriately, the gen-
erated series has a period of length 2
19937
−1 and are distributed uni-
formly on the 623 dimensional space.
Different from these families of pseudo-random numbers that are
generated in software using certain algorithm s, hardware for generat-
ing physical (hardware) random numbers has a lso been developed. Such
hardware can be used whe n more precise random numbers are ne ces-
sary in a simulation, because random numbers generated in this way are
supposed to be free from any cycles or correlations.
16.2 Generatio n of Gaussian White Noise
A realization of G a ussian white noise is obtained by generating a se-
quence of random numbers that follows a normal distribution, na mely,
normal random numbers. The Box-Muller transform (Box and Muller
(1958)) for generating normal random numbers is well known. This
method applies the fact that, given two ind e pendent uniform random
numbers U
1
and U
2
on [0,1],
X
1
=
p
−2 lo gU
1
cos2
π
U
2
,
X
2
=
p
−2 lo gU
1
sin2
π
U
2
(16.6)
indepen dently follow the standard normal distribution N(0,1).
In practice, however, Marsaglia’s algorithm that follows c a n avoid
the explicit evaluation of sine and cosine functions a nd thus can generate
normal random numbers more efficiently.
1. Generate the uniform random numbers U
1
and U
2
.
2. Put V
1
= 2U
1
−1 and V
2
= 2U
2
−1.
3. Put S
2
= V
2
1
+V
2
2
.
4. Return to Step (1), if S
2
≥ 1.
5. Put X
1
= V
1
q
−2 logS
S
and X
2
= V
2
q
−2 logS
S
.
Figure 16.1 (a) shows 200 uniform random numbers generated by
the multiplicative congruence method of (16.1 ) with the initial value
I
0
= 1990103011. On the other hand, plo t (b) shows n ormal random
numbers (white noise) obtained with Ma rsaglia’s algo rithm using these
unifor m random numbers. Plot (c) depicts the histogram and the sample
autocorrelation function computed from those random numbers, whe re
the histogram looks somewhat different from the density of the normal