I. A chronological listing of references giving full citation details. References to abstracts or reviews are included selectively where these are especially interesting or throw light on rather inaccessible publications. All publications are in English unless otherwise indicated. The spelling of 'pseudorandom' has been standardized. II. A classified listing by subject matter of the citations in part I. III. An author index. Multiple authors are included.

A third classified bibliography on random number generation and testing

Techniques are presented for randomly generating bits. A seed is inverted and a non repeating portion of the resulting digits from the inversion are retained. The inverted seed is then raised to a power to acquire another non repeating portion or additional digits. This process is repeated for a desired number of iterations. The resulting digits are then selectively combined to generate a stream of randomly generated bits with an infinite period.

Techniques for random bit generation

A pseudorandom number sequence generator comprises a bidirectional shift register arranged to be loaded with a multi-bit sequence. The shift register is responsive to an ith clock pulse and an ith direction control bit for shifting the multi-bit sequence in one of two directions, delivering an ith output bit and receiving an ith input bit. The multi-bit sequence successively defines one of nodes of an Eulerian graph connected by branches. A feedback circuit is connected to the shift register for converting a set of input data to a set of output data. The input data comprises a multi-bit sequence stored in the shift register in response to an (i+1)th clock pulse, the ith output bit and the ith direction control bit and the output data comprises an (i+1)th input bit and an (i+1)th direction control bit. The output data is supplied to the shift register so that multi-bit sequences produced by the shift register move around the graph following every branch exactly once, and outputting the (i+1)th input bit to form a pseudorandom number sequence.

PN sequence generator with bidirectional shift register and Eulerian-graph feedback circuit

To test the frequency response of a magnetotelluric (MT) receiver, a broadband source, especially white noise is more efficient and intuitive than single frequency signals. In view of the absence of an appropriate source generator for MT receiver indoor testing, we designed a broadband signal generator based on a pseudo-random binary sequence (PRBS). Firstly, we divided the whole MT band into two segments to avoid data redundancy and simplify calculation in data processing and designed a generator composed of several modules: a clock module, a PRBS logic module, and a voltage level conversion module. We conducted a detailed analysis of the optimal parameter selection methods for each module, and key parameters including clock frequency, order, the primitive polynomial and the original states of the linear registers were determined. The generator provides four-channel PRBS signals with two effective bandwidths of 5 × 10−4–714 Hz and 0.1 Hz–14 kHz which are broad enough to cover the frequency range for different MT methods. These four-channel signals were used to simulate two modes of sources (xy and yx) with strong auto-correlation and weak cross-correlation. The power spectral density is quite stable in the whole passband. The new generator is characterized by broadband output in low-frequency bands, low power consumption, simple operation and reliable performance. Indoor and field tests indicated that the generator can provide an analog MT source and is a practical tool for MT receiver indoor testing.

/pdf/broadband-signal-generator-for-the-approximation-of-a-29hbw49mqu.pdf

Broadband signal generator for the approximation of a magnetotelluric source for indoor testing

A digital hardware implementation of a linear congruential sequence generator using shift and add techniques of multiplication is described. The sequence is of long period, low serial correlation and is rectangularly distributed. The method has certain advantages over conventional feedback shift register techniques.

/pdf/proposal-for-a-digital-pseudorandom-number-generator-1tp2do9c9o.pdf

Proposal for a digital pseudorandom number generator

A new pseudo-random generator for decimal numbers is presented. A sequence of decimal digits is obtained by combining a binary and a quinary maximal-length sequence generated by feedback shift-register circuits. The autocorrelation sequence (ACS) of the resulting decimal sequence is calculated; it shows that linear dependencies are extremely small. Finally, guidelines are developed for choosing feedback polynomials which yield low cross correlation between various sequences of decimal digits.

Weinrichter

Papers

Pseudo-Random Number Generator Based on Binary and Quinary Maximal-Length Sequences