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

A. Ahmad, S. S. Al-Busaidi, A. Al Maashri, M. Awadalla, M. A K Rizvi, N. Mohanan

Research output: Contribution to journalArticle

5 Citations (Scopus)

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 languageEnglish
Pages (from-to)5359-5369
Number of pages11
JournalIndian Journal of Science and Technology
Volume6
Issue number10
Publication statusPublished - Oct 2013

Keywords

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

ASJC Scopus subject areas

  • General

Fingerprint Dive into the research topics of 'Computing and listing of number of possible m-sequence generators of order n'. Together they form a unique fingerprint.

  • Cite this