You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: docs/articles_en/documentation/openvino-ir-format/operation-sets/operation-specs/generation/random-uniform-8.rst
+7-6
Original file line number
Diff line number
Diff line change
@@ -42,7 +42,7 @@ The result of Philox is calculated by applying a fixed number of *key* and *coun
42
42
This implementation uses 4x32_10 version of Philox algorithm, where number of rounds = 10.
43
43
44
44
Suppose we have *n* which determines *n*-th 4 elements of random sequence.
45
-
In each round *key*, *counter* and *n* are splitted to pairs of uint32 values:
45
+
In each round *key*, *counter* and *n* are split to pairs of uint32 values:
46
46
47
47
.. math::
48
48
@@ -220,7 +220,8 @@ Example 3. *RandomUniform* output with ``global_seed`` = 80, ``op_seed`` = 100,
220
220
221
221
Mersenne-Twister Algorithm Explanation:
222
222
223
-
Link to the original paper Mersenne Twister: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator <https://dl.acm.org/doi/10.1145/272991.272995>__.
223
+
|Link to the original paper Mersenne Twister:
224
+
|`Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator <https://dl.acm.org/doi/10.1145/272991.272995>`__.
224
225
225
226
The Mersenne-Twister algorithm generates random numbers by initializing a state array with a seed and then iterating through a series of transformations.
226
227
Suppose we have n which determines the n-th element of the random sequence.
@@ -250,11 +251,11 @@ Whenever all state values are 'used', a new state array is generated recursively
250
251
251
252
.. math::
252
253
253
-
current_state = state[i]
254
-
next_state = state[i+1] if i+1 <= 623 else state[0]
255
-
next_m_state = state[i+m] if i+m <= 623 else state[i+m-623]
254
+
current\_state = state[i]
255
+
next\_state = state[i+1] if i+1 <= 623 else state[0]
256
+
next\_m_state = state[i+m] if i+m <= 623 else state[i+m-623]
0 commit comments