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)


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
Issue number1
Publication statusPublished - Jan 1997



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

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this