Computing and Listing of Number of Possible m-Sequence Generators of Order n

Design of maximal length sequence (m-sequence) generators of order n has many controlling parameters. In the design process of the generators it is essential to ensure that the generator characteristic polynomial corresponds to a primitive polynomial. The complexity of the search problem of primitive polynomials of order n grows as n increases and hence restricts the listing of all parameters of m-sequence generators of order n. This paper presents a computational procedure to determine the number of possible generators of order n. The paper provides a list of all possible m-sequence generators for up to n = 100.

[1]  A. Ahmad,et al.  On locking conditions in m-sequence generators for the use in digital watermarking , 2009, 2009 Proceeding of International Conference on Methods and Models in Computer Science (ICM2CS).

[3]  Afaq Ahmad,et al.  Better PN Generators for CDMA Application - A Verilog-HDL Implementation Approach , 2012 .

[4]  N. K. Nanda,et al.  Are primitive polynomials always best in signature analysis? , 1990, IEEE Design & Test of Computers.

[5]  N. K. Nanda,et al.  The use of irreducible characteristic polynomials in an LFSR based testing of digital circuits , 1989, Fourth IEEE Region 10 International Conference TENCON.

[6]  A. Ahmad,et al.  How to design an effective Serial Input Shift Register (SISR) for data compression process of Built-In Self-Test methodology , 2009, 2009 4th International Design and Test Workshop (IDT).

[7]  Afaq Ahmad,et al.  Design of a Pseudo-Random Binary Code Generator via a Developed Simulation Model , 2012 .

[8]  Ali Al-Lawati,et al.  Realization of a Simplified Controllability Computation Procedure: a MATLAB- SIMULINK Based Tool , 2003 .

[9]  Afaq Ahmad,et al.  STUDY AND IMPLEMENTATION OF PROPERTIES OF m-SEQUENCE IN MATLAB- SIMULINK - A PASS / FAIL TEST TOOL FOR DESIGNS OF RANDOM GENERATORS , 2001 .

[10]  Jovan Dj. Golic.  Cryptanalysis of three mutually clock-controlled stop/go shift registers , 2000, IEEE Trans. Inf. Theory.

[11]  Afaq Ahmad,et al.  Development of Digital Logic Design Teaching Tool Using MATLAB & SIMULINK , 2013 .

[12]  Afaq Ahmad.  Investigation of some quite interesting divisibility situations in a signature analyzer implementation , 2011 .

[13]  M. J. Al-Mushrafi,et al.  Design and study of a strong crypto-system model for e-Commerce , 2002 .

[14]  A. Ahmad,et al.  A Simulation Experiment on a Built-In Self Test Equipped with Pseudorandom Test Pattern Generator and Multi-Input Shift Register (MISR) , 2010, VLSIC 2010.

[15]  Sayyid Samir Al-Busaidi,et al.  Adding Pseudo-Random Test Sequence Generator in the Test Simulator for DFT Approach , 2012 .

[16]  Hai-Wen Chen,et al.  Nonlinear analysis of biological systems using short M-sequences and sparse-stimulation techniques , 1996, Annals of Biomedical Engineering.

[17]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[18]  Afaq Ahmad,et al.  Development of Verification Tool for Minimal Boolean Equation , 2014 .

[19]  A. Ahmad.  Achievement of higher testability goals through the modification of shift registers in LFSR-based testing , 1997 .

[20]  Tariq Jamil,et al.  An investigation into the application of linear feedback shift registers for steganography , 2002, Proceedings IEEE SoutheastCon 2002 (Cat. No.02CH37283).

[21]  Afaq Ahmad,et al.  Mobile and Wireless Communications , 2003, IFIP — The International Federation for Information Processing.

[22]  Afaq Ahmad,et al.  Development of a Strong Stream Ciphering Technique Using Non-Linear Fuzzy Logic Selector , 2002, PWC.

[23]  Ayaz Ahmad,et al.  Critical role of primitive polynomials in an LFSR based testing technique , 1988 .

[24]  Afaq Ahmad,et al.  An efficient method to determine linear feedback connections in shift registers that generate maximal length pseudo-random up and down binary sequences , 1997 .

[25]  Manuel Blum,et al.  A Simple Unpredictable Pseudo-Random Number Generator , 1986, SIAM J. Comput..