Research on Parallel Algorithms of Uncertain Combinational Coding

In this era of rapid development of information science and technology, data coding technology has been widely used in multimedia, computer, communication and other fields. Non-deterministic combined coding is further explored in deterministic combined coding. It is a kind of lossless coding. In combinatorial mathematics, the operation of the combination number calculates the ordinal number of the sequence to be coded. On the basis of the deterministic combination coding, the adjacent identical elements are eliminated and processed separately, which reduces the length of the ordinal number. At the same time, the reference sequence is encoded to further save space. However, the ordinal calculation of the non-deterministic combination coding is still a complicated process, and the coding speed is still slow. This article uses openMP technology to parallelize the ordinal calculation part of the non-deterministic combination coding. The running time of coded ordinal on the eight-core CPU is 23.38% of the original, which is 4.28 times optimized, and the overall coding time efficiency of the 17 segmented file instances has been improved about 2.94 times. It indicates the effectiveness of the parallel strategy in this article. Finally, this article analyzes the experimental results.