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

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةمراجعة النظراء

5 اقتباسات (Scopus)

ملخص

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.

اللغة الأصليةEnglish
الصفحات (من إلى)5359-5369
عدد الصفحات11
دوريةIndian Journal of Science and Technology
مستوى الصوت6
رقم الإصدار10
حالة النشرPublished - أكتوبر 2013

ASJC Scopus subject areas

  • ???subjectarea.asjc.1000???

بصمة

أدرس بدقة موضوعات البحث “Computing and listing of number of possible m-sequence generators of order n'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا