Advertisement

Pseudo-Random Sequences with a Priori Distribution

  • Joshua H. Rabinowitz
Part of the International Centre for Mechanical Sciences book series (CISM, volume 279)

Abstract

This paper introduces a hypergraph-theoretic technique for the synthesis of sequences with prescribed distributions. A positive n-distribution is an assignment of a positive integer to each n-letter word with letters chosen from some fixed finite alphabet. A distribution is atomic if it always assigns the same integer to words that are cyclic shifts of each other. A periodic sequence of letters from the alphabet is said to realize a given distribution if the distribution assigns to each word its frequency of occurrence in a single period of the sequence. Given a positive atomic redistribution, we construct a hypergraph, the subgraphs of which correspond to a family of modified nonlinear feedback shift registers. Each shift register in a family corresponding to a spanning hypertree of the hypergraph will generate a sequence realizing the given distribution.

Keywords

Span Tree Truth Table Shift Register Periodic Sequence Cyclic Shift 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    de Bruijn, N. G., A combinatorial problem, Pros. Neder. Akad. Wetensch, 49, 1946.Google Scholar
  2. 2.
    Fredricksen, H., A survey of full length nonlinear shift register cycle algorithms, SIAM Review, 24, 195, 1982.MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    von Aardenne-Ehrenfest, T. and de Bruijn, N.G., Circuits and trees in ordered linear graphs, Simon Steven, 28, 203, 1951.MATHGoogle Scholar
  4. 4.
    Rabinowitz, J. H., de Bruijn sequences and hypergraphs over finite alphabets, Proceedings of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium,Utilitas Math., Winnipeg, to appear.Google Scholar
  5. 5.
    Golomb, S. W., Shift Register Sequences, Aegean Park Press, Laguna Hills, 1982.Google Scholar
  6. 6.
    Berge, C., Graphs and Hypergraphs, North-Holland, Amsterdam-London, 1973.MATHGoogle Scholar

Copyright information

© Springer-Verlag Wien 1983

Authors and Affiliations

  • Joshua H. Rabinowitz
    • 1
  1. 1.The MITRE CorporationBedfordUSA

Personalised recommendations