Abstract: The study of the length of pseudo-random binary sequences generated by Linear- Feedback Shift Registers (LFSRs) plays an important role in the design approaches of built-in self- test, cryptosystems, and other applications. However, certain LFSR structures might not be appropriate in some situations. Given that determining the length of generated pseudo-random binary sequence is a complex task, therefore, before using an LFSR structure, it is essential to investigate the length and the properties of the sequence. This paper investigates some conditions and LFSR’s structures, which restrict the pseudo-random binary sequences’ generation to a certain fixed length. The outcomes of this paper are presented in the form of theorems, simulations, and analyses. We believe that these outcomes are of great importance to the designers of built-in self-test equipment, cryptosystems, and other applications such as radar, CDMA, error correction, and Monte Carlo simulation. Keywords: LFSR, Pseudo-random binary sequence, Seed, Feedback connection, Periodicity, Exclusive OR.

Abstract: The study of the length of pseudo-random binary sequences generated by Linear- Feedback Shift Registers (LFSRs) plays an important role in the design approaches of built-in self- test, cryptosystems, and other applications. However, certain LFSR structures might not be appropriate in so...