3d multiplicative turbo code

This article investigates three-dimensional multiplicative turbo codes, their functionality, and blind identification methods. Although various methods have been proposed for the blind identification of block codes, no method has been proposed for the blind identification of 3D multiplicative turbo codes. To address this issue, a new method based on the blind recognition methods of block codes has been presented. Since 3D multiplicative turbo codes are composed of three block codes and two matrix displacements, this study investigates current methods of blind recognition of block codes, matrix displacements, and their use in diagnosing turbo-multiplicative codes. For this purpose, two GCD blind identification methods have been examined, and the matrix order has been used for blind identification of channel coding. Most blind identification methods of multiplicative turbo code parameters are based on the GCD method in the channel without delay. In this article, the method of blind recognition of multiplicative turbo codes is presented. Then, assuming channel delay by the RREF method, the amount of delay is estimated and, after its removal, the GCD method is used. The analysis and simulation results based on GCD and RREF are presented, and the evaluation results show that the GCD algorithm can correctly identify the multiplicative turbo code with an error probability of 10-7 or less. Therefore, the performance of this algorithm based on BER is very favorable, and its use in practical and real-time systems is appropriate