### 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 language | English |
---|---|

Pages (from-to) | 33-39 |

Number of pages | 7 |

Journal | Computers and Electrical Engineering |

Volume | 23 |

Issue number | 1 |

Publication status | Published - Jan 1997 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Control and Systems Engineering
- Electrical and Electronic Engineering