An efficient method to determine linear feedback connections in shift registers that generate maximal length pseudo-random up and down binary sequences

A. Ahmad, A. M. Elabdalla

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

Based upon the mathematical characterization of linear feedback shift registers, an efficient algorithm for designing a maximal length pseudorandom binary sequence generator is postulated. The proposed algorithm is not only computationally cost effective in relation to existing algorithms, but also yields the knowledge of feedback connections corresponding to the reciprocal of each nth order primitive polynomial itself. This makes the algorithm a further, more effective tool for an LFSR based testing of digital circuits.

Original languageEnglish
Pages (from-to)33-39
Number of pages7
JournalComputers and Electrical Engineering
Volume23
Issue number1
Publication statusPublished - Jan 1997

Fingerprint

Binary sequences
Shift registers
Feedback
Digital circuits
Polynomials
Testing
Costs

Keywords

  • Maximal length sequences
  • Shift registers
  • Testing of digital circuits

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

@article{7517832b4bb84bf08cf37f14a759b022,
title = "An efficient method to determine linear feedback connections in shift registers that generate maximal length pseudo-random up and down binary sequences",
abstract = "Based upon the mathematical characterization of linear feedback shift registers, an efficient algorithm for designing a maximal length pseudorandom binary sequence generator is postulated. The proposed algorithm is not only computationally cost effective in relation to existing algorithms, but also yields the knowledge of feedback connections corresponding to the reciprocal of each nth order primitive polynomial itself. This makes the algorithm a further, more effective tool for an LFSR based testing of digital circuits.",
keywords = "Maximal length sequences, Shift registers, Testing of digital circuits",
author = "A. Ahmad and Elabdalla, {A. M.}",
year = "1997",
month = "1",
language = "English",
volume = "23",
pages = "33--39",
journal = "Computers and Electrical Engineering",
issn = "0045-7906",
publisher = "Elsevier Limited",
number = "1",

}

TY - JOUR

T1 - An efficient method to determine linear feedback connections in shift registers that generate maximal length pseudo-random up and down binary sequences

AU - Ahmad, A.

AU - Elabdalla, A. M.

PY - 1997/1

Y1 - 1997/1

N2 - Based upon the mathematical characterization of linear feedback shift registers, an efficient algorithm for designing a maximal length pseudorandom binary sequence generator is postulated. The proposed algorithm is not only computationally cost effective in relation to existing algorithms, but also yields the knowledge of feedback connections corresponding to the reciprocal of each nth order primitive polynomial itself. This makes the algorithm a further, more effective tool for an LFSR based testing of digital circuits.

AB - Based upon the mathematical characterization of linear feedback shift registers, an efficient algorithm for designing a maximal length pseudorandom binary sequence generator is postulated. The proposed algorithm is not only computationally cost effective in relation to existing algorithms, but also yields the knowledge of feedback connections corresponding to the reciprocal of each nth order primitive polynomial itself. This makes the algorithm a further, more effective tool for an LFSR based testing of digital circuits.

KW - Maximal length sequences

KW - Shift registers

KW - Testing of digital circuits

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

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

M3 - Article

VL - 23

SP - 33

EP - 39

JO - Computers and Electrical Engineering

JF - Computers and Electrical Engineering

SN - 0045-7906

IS - 1

ER -