2005 | OriginalPaper | Chapter
A Deterministic Approach to Balancedness and Run Quantification in Pseudorandom Pattern Generators
Authors : Amparo Fúster-Sabater, Pino Caballero-Gil
Published in: Advances in Informatics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.