Investigating some special sequence lengths generated in an external exclusive-NOR type LFSR

Authors:
Afaq Ahmad;Ahmed Al-Maashri
Affiliations:
Department of Electrical and Computer Engineering, College of Engineering, Sultan Qaboos University, P.O. Box 33, Al-Khod, Muscat 123, Oman;Department of Electrical and Computer Engineering, College of Engineering, Sultan Qaboos University, P.O. Box 33, Al-Khod, Muscat 123, Oman
Venue:
Computers and Electrical Engineering
Year:
2008

Citing 12
Cited 2

VLSI Testing

Computer - IEEE Centennial: the state of computing
Built-in test for VLSI: pseudorandom techniques

Built-in test for VLSI: pseudorandom techniques
Design considerations for parallel pseudorandom pattern generators

Journal of Electronic Testing: Theory and Applications
Shift Register Sequences

Shift Register Sequences
Are Primitive Polynomials Always Best in Signature Analysis?

IEEE Design & Test
Design and study of a strong crypto-system model for e-Commerce

ICCC '02 Proceedings of the 15th international conference on Computer communication
Achieving high encoding efficiency with partial dynamic LFSR reseeding

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Built-In Self-Test Techniques

IEEE Design & Test
Pseudonoise sequences based on algebraic feedback shift registers

IEEE Transactions on Information Theory
RP-SYN: synthesis of random pattern testable circuits with test point insertion

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Bounds and analysis of aliasing errors in linear feedback shift registers

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Increasing encoding efficiency of LFSR reseeding-based test compression

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Encryption System with Variable Number of Registers

Computers and Electrical Engineering
Investigation of some quite interesting divisibility situations in a signature analyzer implementation

WSEAS Transactions on Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The study of the length of Pseudo-Random Binary Sequences (PRBS) generated by Linear Feedback Shift Registers (LFSRs) play an important role in design approaches of Built-In Self Test (BIST), cryptosystems, and other applications. It is not taken to be granted that primitive characteristic polynomials always generate maximal length PRBSs. This paper investigates many such conditions where LFSR structures restrict the PRBS generation to a certain fixed length. This study will surely help the designers of the BIST equipments and cryptosystems. The outcome of this paper is presented in the forms of theorems, simulations, and analyses which strongly supports the findings.