Pseudo-Random Sequences with a Priori Distribution
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.
KeywordsSpan Tree Truth Table Shift Register Periodic Sequence Cyclic Shift
Unable to display preview. Download preview PDF.
- 1.de Bruijn, N. G., A combinatorial problem, Pros. Neder. Akad. Wetensch, 49, 1946.Google Scholar
- 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.Golomb, S. W., Shift Register Sequences, Aegean Park Press, Laguna Hills, 1982.Google Scholar