Laplace transformation for determining the linear equivalence of the periodic sequence

Abstract EN

The research presents a proposed method with an algorithm written in Mat lab language to determine the linear equivalence of the pseudo-random periodic sequences mathematically by using the Laplace transform.

The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any periodic sequences produced from linear or nonlinear key generators.

The procedure can be used comparatively greater computational ease and efficiency.

The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Laplace transform are more accurate than those of (BM) method for computing the linear equivalence (L) of the sequence of period (p) when (L) is greater than (p / 2).

Some examples are given for consolidating the accuracy of the results of this proposed method.