An arrays of O's and l's has the u v horizontal window property if every nonzero view is seen once when a u v window is moved horizontally across the array. We study the problem of constructing an array which, for a given m, has the u x v horizontal window property for all factorizations rn uv. Using maximal linear shift register sequences for the rows we are able to construct such arrays of si...

In this correspondence we determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result of this correspondence shows that Legendre sequences are quite good from the linear complexity viewpoint.

In this paper, scan and ring schemes of the pseudo-ring memory self-testing are investigated. Both schemes are based on emulation of the linear or nonlinear feedback shift register by memory itself. Peculiarities of the pseudo-ring schemes implementation for multi-port and embedded memories, and for register file are described. It is shown that only small additional logic is required and allows...

The paper examines a simple conceptual modification of the operation unit of a RISC processor. We propose to substitute a part of the conventional general purpose register file by a shift register for all operation results. The presented approach allows to reduce the instruction size for a great deal of instructions and so the instruction stream, and it is also a promising approach to make the ...

Anewsoftware-baseddtestvectorcompressionn technique is proposedd for usingg ann embeddedd processor too test the other components of aa system-on-a-chipp (SOC). The tester transfers compressedd test dataa too the processor's on-chipp memory, andd the processor executes aa small program whichh decompresses the dataa andd applies it too the scann chains of eachh core-under-test. The proposedd dec...

An algorithm is given for the reconstruction of the initial state of a key–stream generator (KSG) consisting of a short linear feedback shift register (length ≤ 30), whose clock is controlled by an algebraically simple internal KSG. The algorithm is based on the fact that the expected number of possible LFSR initial states exponentially decreases with the length of the known part of the output ...

Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plausible approach to prove it in the general case. This conjecture is about the number of primitive σ-LFSRs of a given order over a finite field, and it generalizes a known formula for the number of primitive LFSRs, which...

Let s = (s 1 ; s 2 ; : : : ; s n) be a sequence of characters where s i 2 Z p for 1 i n. One measure of the complexity of the sequence s is the length of the shortest feedback shift register that will generate s, which is known as the maximum order complexity of s 17, 18]. We provide a proof that the expected length of the shortest feedback register to generate a sequence of length n is less th...

In testing certain systems, checking for burst errors is important. This is due to the fact that errors are confined to a certain number of bits. If signature analysis is used to test a circuit then the testing capabilities depend on the polynomial that defines the linear feedback shift register (LFSR) used in the test. In this paper we show that the LFSR that is suitable for checking for burst...