### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 5359-5369 |

Number of pages | 11 |

Journal | Indian Journal of Science and Technology |

Volume | 6 |

Issue number | 10 |

Publication status | Published - Oct 2013 |

### Fingerprint

### Keywords

- Lfsr
- M-Sequence
- Matlab
- Mersenne numbers
- Prime factors
- Primitive polynomial

### ASJC Scopus subject areas

- General

### Cite this

*Indian Journal of Science and Technology*,

*6*(10), 5359-5369.

**Computing and listing of number of possible m-sequence generators of order n.** / Ahmad, A.; Al-Busaidi, S. S.; Maashri, A. Al; Awadalla, M.; Rizvi, M. A K; Mohanan, N.

Research output: Contribution to journal › Article

*Indian Journal of Science and Technology*, vol. 6, no. 10, pp. 5359-5369.

}

TY - JOUR

T1 - Computing and listing of number of possible m-sequence generators of order n

AU - Ahmad, A.

AU - Al-Busaidi, S. S.

AU - Maashri, A. Al

AU - Awadalla, M.

AU - Rizvi, M. A K

AU - Mohanan, N.

PY - 2013/10

Y1 - 2013/10

N2 - 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.

AB - 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.

KW - Lfsr

KW - M-Sequence

KW - Matlab

KW - Mersenne numbers

KW - Prime factors

KW - Primitive polynomial

UR - http://www.scopus.com/inward/record.url?scp=84886786063&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84886786063&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84886786063

VL - 6

SP - 5359

EP - 5369

JO - Indian Journal of Science and Technology

JF - Indian Journal of Science and Technology

SN - 0974-6846

IS - 10

ER -