Generating Binary Sequences for Stochastic Computing


Jeavons, P., Cohen, D. and Shawe-Taylor, J. (1994) Generating Binary Sequences for Stochastic Computing IEEE Transactions on Information Theory, 40, (3), pp. 716-720.

Download

[img] PDF GeneratingBinarySequencesForStochasticComputing.pdf - Other
Download (429kB)

Description/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

Item Type: Article
ISSNs: 0018-9448 (print)
Organisations: Electronics & Computer Science
ePrint ID: 259810
Date :
Date Event
November 1994Published
Date Deposited: 23 Aug 2004
Last Modified: 17 Apr 2017 22:23
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/259810

Actions (login required)

View Item View Item