This short paper introduces the basic concepts of Stochastic Computing (SC), and presents additions to a remote lab with reconfigurable logic to allow testing SC circuits. Recently, SC has been revisited and evaluated as a possible way of performing approximate probabilistic computations for artificial perception systems. New modules allow the generation of pseudo-random numbers, given a seed k...

Siegenthaler has shown how cross-correlation techniques can be applied to identify pseudo random generators consisting of linear feedback shift registers and a scrambling function 171. These techniques may allow to attack one register in such a generator at a time. The original algorithm needs O(R2'N) operations to identify one register. ( r denotes the length of the register examined, R the nu...

Abstract A new approach to optimize a configurable twodimensional (2-D) linear feedback shift registers (LFSR) for both embedded and random test pattern generation in built-in self-test (BIST) is proposed. This configurable 2-D LFSR based test pattern generator generates: 1) a deterministic sequence of test patterns for random-pattern-resistant faults, and then 2) random patterns for random-pat...

We propose a construction of de Bruijn sequences by the cycle joining method from linear feedback shift registers (LFSRs) with arbitrary characteristic polynomial f(x). We study in detail the cycle structure of the set Ω(f(x)) that contains all sequences produced by a specific LFSR on distinct inputs and provide an efficient way to find a state of each cycle. Our structural results lead to an e...

Many stream ciphers use irregular clocking to introduce nonlinearity to the keystream. We present three distinguishers on irregularly clocked linear feedback shift registers. The general idea used is to find suitable linear combinations of keystream bits, here called samples, that are drawn from a biased distribution. We describe how to place windows around the estimated positions around member...

In this paper we interpret the Berlekamp-Massey algorithm (BMA) for synthesis of linear feedback shift register (LFSR) as an algorithm computing Pade approximants for Laurent series over arbitrary field. This interpretation of the BMA is based on a iterated procedure for computing of the sequence of polynomials orthogonal to some sequence of polynomial spaces with scalar product depending on th...

Maximal-length binary sequences have been known for a long time. They have many interesting properties, one of them is that when taken in blocks of n consecutive positions they form 2 − 1 different codes in a closed circular sequence. This property can be used for measuring absolute angular positions as the circle can be divided in as many parts as different codes can be retrieved. This paper d...

It is shown in this paper that the iterative algorithm introduced by Berlekamp for decoding BCH codes actually provides a general solution to the problem of synthesizing the shortest linear feedback shift register capable of generating a prescribed finite sequence of digits. The shit-register approach leads to a simple proof of the validity of the algorithm as well as providing additional insig...

Signature analysis is an important compact method in digital testing. Applying this method, a test response sequence of a device under test is compressed by a linear feedback shift register (LFSR, for short). Masking occurs if a faulty device yields the same signature as the corresponding good device. Due to the linearity of any LFSR, this happens if and only if the 'error sequence' which is ob...

An efficient low power built-in self-test methodology based on linear feedback shift register reseeding is proposed. This new method divides each test cube into several blocks and encodes that cube into a new test cube. In the new encoded test cube, the nontransitional blocks which no specified bits is included or only one kind of specified bit (1 or 0) is encoded into only one bit (1, 0, or X)...