The University of Southampton
University of Southampton Institutional Repository

Generating Binary Sequences for Stochastic Computing

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
0018-9448
716-720
Jeavons, P.
bf271c75-e9a7-413c-8bd5-3f5d3ead0de1
Cohen, D.
a7633443-d42d-4db7-93a2-f7173d01a71d
Shawe-Taylor, J.
c32d0ee4-b422-491f-8c28-78663851d6db
Jeavons, P.
bf271c75-e9a7-413c-8bd5-3f5d3ead0de1
Cohen, D.
a7633443-d42d-4db7-93a2-f7173d01a71d
Shawe-Taylor, J.
c32d0ee4-b422-491f-8c28-78663851d6db

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

Record type: Article

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

Text
GeneratingBinarySequencesForStochasticComputing.pdf - Other
Download (429kB)

More information

Published date: November 1994
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 259810
URI: http://eprints.soton.ac.uk/id/eprint/259810
ISSN: 0018-9448
PURE UUID: 738d9da1-5b6b-4de9-affc-bd00a4324441

Catalogue record

Date deposited: 23 Aug 2004
Last modified: 14 Mar 2024 06:28

Export record

Contributors

Author: P. Jeavons
Author: D. Cohen
Author: J. Shawe-Taylor

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×