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

Fingerprint

Generator
Computing
Primitive Polynomial
Search Problems
Characteristic polynomial
Design Process

Keywords

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

ASJC Scopus subject areas

  • General

Cite this

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.

In: Indian Journal of Science and Technology, Vol. 6, No. 10, 10.2013, p. 5359-5369.

Research output: Contribution to journalArticle

@article{f7b87bdcd8dd42acad1f3476541e21b7,
title = "Computing and listing of number of possible m-sequence generators of order n",
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.",
keywords = "Lfsr, M-Sequence, Matlab, Mersenne numbers, Prime factors, Primitive polynomial",
author = "A. Ahmad and Al-Busaidi, {S. S.} and Maashri, {A. Al} and M. Awadalla and Rizvi, {M. A K} and N. Mohanan",
year = "2013",
month = "10",
language = "English",
volume = "6",
pages = "5359--5369",
journal = "Indian Journal of Science and Technology",
issn = "0974-6846",
publisher = "Indian Society for Education and Environment",
number = "10",

}

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

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 -