SU1298743A1 - Random process generator - Google Patents

Abstract

The invention relates to computing and can be used in the simulation of various structurally complex objects, taking into account the effect on them of random interrelated external factors. The aim of the invention is to extend the functionality of the generator by forming a random process with a given correlation coefficient. The generator contains a sensor 1 Poisson pulse sequences, an element OR 2, a group of 3 counters, an encoder 4, registers 5 and 11 of memory, a counter 6, a generator of 7 pulses, a group of 8 adders, a decoder 9, a group of 10 And elements, a group of 12 registers .-The generator allows the formation of streams of correlation: dependent events with a controlled correlation coefficient. 2 Il. & (L

Description

The invention relates to computing and can be used in the simulation of various structurally complex objects, taking into account the influence on them of random interrelated external factors, in the construction of stochastic computing and modeling devices, as well as in the construction of automated test complexes.

The purpose of the invention is the expansion of the functional capabilities of the generator due to the formation of a random process with a given correlation coefficient.

FIG. 1 shows a functional diagram of a random process generator; in fig. 2 - illustrations of the organization of groups of elements And,

The generator contains a sensor 1 Poisson pulse sequences, an element OR 2, a group of 3 counters, an encoder 4, a register 5 of memory, a counter 6, a generator of 7 pulses, a group of 8 adders, a deshi (1) a rator 9, a group of 10 elements AND, a register eleven

memory group 12 memory registers.

Consider the operation of the generator, starting from the time when the output of one of the counters of group 3 is for an overflow signal, indicating the end of the previous random test.

This signal forms a unitary number for that counter of group 3, - the cat. It worked in this test. This unitary code is converted by encoder 4 into a position code and stored in memory register 5. The non-zero state of the memory register 5 causes the formation of a signal at the output of the OR 2 element. The signal records the modified control codes from the outputs of the adders of group 8, and prepares the initial state for the next test.

When the input of the entry of the counters of group 3 is a single signal, the state of the counters tracks the state of the information inputs and does not change with the counting pulses, and thus, after removing the signal of the entry, the state of the counters of group 3 corresponds to the value of the control codes modified bridges from the value entered in memory register 5. Modification of the control codes stored in the memory registers of group 12 is carried out

adding to the control code, which determines the probability of forming the code, equal to the value recorded in memory register 5, proportional to the correlation coefficient between adjacent values of the random variable being generated. For this, the code stored in register 11 is fed through AND elements of group 10 only to an adder with a number equal to the code in memory register 5. At the first inputs of the remaining adders, zero is applied. At the same time, counter 6, counting pulses from pulse generator 7, converts the code received from memory register 5 into a time interval. When the contents of counter 6 become zero, an output pulse is generated, which resets the memory register 5 to zero, which is 5

)

0

five

It leads to the establishment of a zero level on the B1 1 input of the element I.GSH 2 and the resolution of conducting a new random test, as a result of which the Poisson impulse flows from the output of the sensor 1 arrive at the counting inputs of the corresponding counters. Each random flow pulse increases the content of the associated counter by one until one of the counters overflows. A random test of this ends and the unitary code is fed to the encoder, and the process of forming a random value is repeated.

The source data for the calculation of the control codes is the probability distribution (P, Pj, ..., P) and the correlation coefficient g

The codes entered in the memory registers of group 12 are calculated according to the following Lorg-gule:

 Zi (1)

R

 (1Д U and

TO

So; , is the control code of the i-ro memory register of group 12; counter size of group 3;

minimum probability from the set of probabilities

p ,, p ,, ..., rl.

The code written to register 11 is calculated using the following formula:

KKK

( one)

where k

- code written in register 11.

Claims (1)

Formula of the invention A random process generator containing a group of memory registers is a sensor of Poisson sequences of pulse bones, the outputs of which are connected to the counting inputs of the same-name counters of the group, the overflow outputs of which are connected to the same inputs of the encoder, the output of which is connected to the input of the first memory register, the input of which is connected to the overflow output of the counter, which is the output of the random process generator, the rich input of the counter is connected to the output of the pulse generator, the inputs of the counters of the group are connected and connected to the output of the element OR, the inputs of which are connected to the outputs E. Papp P fut.Z Compiled by I. Stolov Mover Tehred M. Khodanych Order 890/51 Circulation 673 Subscription VNIIPI USSR State Committee for inventions and discoveries 113035, Moscow, Zh-35, Raushsk nab., 4/5 Production and printing company, Uzhgorod, st. Project, 4 8743 first register four memory 5 About adders 5 characterized in that, in order to extend the functionality by forming a random process with a given correlation coefficient, the generator contains a second memory register, a group of adders, a group of elements, whose outputs are connected to the first inputs the groups whose outputs are connected to the information inputs of the corresponding group counters, the second inputs of the group adders are connected to the outputs of the group's memory registers, the first inputs of the AND elements of the group are connected to the output of the second memory register, the second inputs of the AND elements of the group are combined and connected to the corresponding outputs Proofreader A. Ilyin