ALGEBRAIC THEORY OF FLIP-FLOP SEQUENCE GENERATORS.

Abstract

The problem of constructing linear shift registers with a minimum number of adders has provoked interesting research on the theory of trinomials over the field with two elements. Each adder which can be eliminated significantly increases the speed at which the sequence can be generated, and linear shift registers corresponding to trinomials have only one adder. In this report a class of sequence generators is described employing J-K flip-flops in place of the usual delay elements, and which require no adders or additional gating. J-K flip-flops operate at a speed comparable to that of delay elements. If n is the number of flip-flops, then for n = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 15, 17, and 18 a sequence of period 2 to the nth power-1 can be generated. This sequence is linear and has the well-known randomness and correlation properties. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1968
Accession Number
AD0838251

Entities

People

  • A. V. Pratt
  • R. C. Burton
  • W. O. Alltop

Organizations

  • Naval Air Weapons Station China Lake

Tags

DTIC Thesaurus Topics

  • Generators
  • Sequences
  • Shift Registers

Readers

  • Computer Programming and Software Development.