A Deterministic Approach to Balancedness and Run Quantification in Pseudorandom Pattern Generators
- Cite this paper as:
- Fúster-Sabater A., Caballero-Gil P. (2005) A Deterministic Approach to Balancedness and Run Quantification in Pseudorandom Pattern Generators. In: Bozanis P., Houstis E.N. (eds) Advances in Informatics. PCI 2005. Lecture Notes in Computer Science, vol 3746. Springer, Berlin, Heidelberg
An easy method of computing the number of 1’s and 0’s (balancedness) as well as the number of runs (run quantification) in the sequence obtained from a LFSR-based pseudorandom patter generator has been developed. The procedure is a deterministic alternative to the traditional application of statistical tests. The computation method allows one to check deviation of balancedness and run distribution goodness from standard values. As a straight consequence of the above procedure, simple rules to design pattern generators with adequate pseudorandomness properties are also derived.
KeywordsDeterministic approach pattern generator algorithm cryptography
Unable to display preview. Download preview PDF.