A Simple Computational Model for Acceptance/Rejection of Binary Sequence Generators

TL;DR

This paper introduces a straightforward binary computational model that deterministically assesses the balancedness of sequences generated by LFSR-combinational generators, offering an alternative to probabilistic methods for evaluating their quality.

Contribution

The paper presents a novel binary logic-based model for evaluating balancedness in binary sequence generators, providing a deterministic and simple alternative to existing probabilistic approaches.

Findings

The model effectively computes the balancedness degree using only logic operations.

It offers a deterministic method for acceptance/rejection of binary sequence generators.

The approach simplifies the evaluation process compared to probabilistic methods.

Abstract

A simple binary model to compute the degree of balancedness in the output sequence of LFSR-combinational generators has been developed. The computational method is based exclusively on the handling of binary strings by means of logic operations. The proposed model can serve as a deterministic alternative to existing probabilistic methods for checking balancedness in binary sequence generators. The procedure here described can be devised as a first selective criterium for acceptance/rejection of this type of generators.