论文信息 - Generating binary sequences for stochastic computing

Generating binary sequences for stochastic computing

The paper describes techniques for constructing statistically independent binary sequences with prescribed ratios of zeros and ones. The first construction is a general recursive construction, which forms the sequences from a class of "elementary" sequences. The second construction is a special construction which can be used when the ratio of ones to zeros is expressed in binary notation. The second construction is shown to be optimal in terms of the numbers of input sequences required to construct the desired sequence. The paper concludes with a discussion of how to generate independent "elementary" sequences using simple digital techniques. >

[1] John Shawe-Taylor,et al. A Device for Generating Binary Sequences for Stochastic Computing , 1993 .

[2] Max Stanford Tomlinson,et al. A digital neural network architecture for VLSI , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[3] Brian R. Gaines,et al. Stochastic Computing Systems , 1969 .

[4] S. Wolfram. Random sequence generation by cellular automata , 1986 .

[5] Andrew Chi-Chih Yao,et al. The complexity of nonuniform random number generation , 1976 .

[6] P. Mars,et al. Stochastic computing and reinforcement neural networks , 1989 .

[7] John Shawe-Taylor,et al. Probabilistic Bit Stream Neural Chip: Theory , 1991 .

[8] John A. Waicukauski,et al. A Method for Generating Weighted Random Test Patterns , 1989, IBM J. Res. Dev..

[9] John Shawe-Taylor,et al. Probabilistic Bit Stream Neural Chip: Implementation , 1991 .

[10] Hans-Joachim Wunderlich,et al. TESTCHIP: a chip for weighted random pattern generation, evaluation, and test control , 1991 .