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  and N  Mohanan

doi:10.17485/ijst/2013/v6i10.3

Article

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

VIEWS 668
PDF 366

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2013/v6i10.3

Year: 2013, Volume: 6, Issue: 10, Pages: 1-11

Original Article

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

A. Ahmad^1*, S. S. Al-Busaidi¹ , A. Al Maashri¹ , M. Awadalla¹ , M. A. K. Rizvi² and N. Mohanan²

¹Faculty, Department of Electrical and Computer Engineering, [email protected]
[email protected]
[email protected]
[email protected]
²M.Sc. Engineering Student, Department of Electrical and Computer Engineering, College of Engineering, [email protected]
[email protected]
*Author For Correspondence
A. Ahmad
Faculty, Department of Electrical and Computer Engineering,
Email:[email protected]

This work is licensed under a Creative Commons Attribution 4.0 International License.

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: m-Sequence, LFSR, Primitive Polynomial, Prime Factors, Mersenne Numbers, MATLAB.