Generating binary sequences for stochastic computing

Author

Jeavons, P. ; Cohen, D.A. ; Shawe-Taylor, J.

Author_Institution

Dept. of Comput. Sci., London Univ., UK

Volume

40

Issue

3

fYear

1994

fDate

5/1/1994 12:00:00 AM

Firstpage

716

Lastpage

720

Abstract

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

Keywords

binary sequences; digital arithmetic; neural nets; stochastic processes; binary notation; digital techniques; elementary sequences; general recursive construction; input sequences; statistically independent binary sequences; stochastic computing; Binary sequences; Circuit testing; Computer networks; Neural network hardware; Neural networks; Notice of Violation; Random number generation; Random sequences; Shift registers; Stochastic processes;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.335883

Filename

335883