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), 716-720.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Download (419Kb) |
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 |
| Divisions: | Faculty of Physical Sciences and Engineering > Electronics and Computer Science |
| Item ID: | 259810 |
| Date Deposited: | 23 Aug 2004 |
| Last Modified: | 01 Mar 2012 11:03 |
| Contributors: | Jeavons, P. (Author) Cohen, D. (Author) Shawe-Taylor, J. (Author) |
| Date: | November 1994 |
| Status: | Published |
| Further Information: | Google Scholar |
| ISI Citation Count: | 9 |
| URI: | http://eprints.soton.ac.uk/id/eprint/259810 |
Actions (login required)
 |
View Item |
