Evaluation of Frame Synchronization Efficiency for Non-Separable Factorial Codes Depending on Synchronization Parameters

Abstract

This paper aims at implementing the principles of establishing frame synchronism for non-separable factorial codes, as well as applying the operation of interleaving fragments received from the communication channel to increase the efficiency of finding permutation boundaries. We apply the algorithm for establishing frame synchronism with parameters defined for the upper limit of the communication channel bit error probability P0_max = 0,495 for environments with a bit error probability P0 ≤ 0,495. The parameters of the algorithm for establishing frame synchronism with the upper limit of the communication channel bit error probability P0_max = 0,4 are determined. The efficiency of using the interleaving operation of fragments received from the communication channel is evaluated. The efficiency of implementing algorithms for establishing frame synchronism with parameters determined for the upper limit of the communication channel bit error probability P0_max ≤ 0,495 and P0_max = 0,4 is compared, for environments with a bit error probability P0 ≤ 0,4. We give recommendations for selecting the synchronization algorithm parameters for communication channels where the bit error probability upper limit P0 ≤ 0,4 is known, and for channels where this value is variable. These recommendations can be used to improve the efficiency of algorithms for establishing frame synchronism when designing telecommunication systems with non-separable data factorial coding in conditions of natural or artificially created high-level communication channel noise.