Fountain code compiling method based on deep space communication environment

Abstract

The invention provides a fountain code compiling method based on deep space communication environment. The method comprises the following steps of: A) dividing information bits to be transmitted to form a plurality of original information groups; B) performing fountain coding on the original information groups to form code groups; C, performing concatenated error correction coding on the code groups, and transmitting the code groups to a receiver by using a deep space channel; D, performing concatenated error correction decoding to recover the code groups; and E, after enough code groups are obtained, performing fountain decoding to recover all the original information groups. In the method, partial randomness in a conventional fountain coding process is limited for the characteristics of the deep space channel so as to effectively reduce coding redundancy overhead and directively solve the problems of limitations to the transmission power and memory space of fountain codes in a deep space environment on the premise of not changing original degree distribution.

Description

Technical field [0001] The invention relates to a fountain code compilation method, in particular to a fountain code compilation method based on a deep space communication environment. Background technique [0002] Deep space communication has the characteristics of extended propagation time, large link attenuation, asymmetric information transmission, and easy link interruption. Constructing suitable for deep space environment, low coding and decoding complexity, and channel coding approaching Shannon limit has always been an important research content of deep space communication. [0003] In recent years, the use of digital fountain coding to improve transmission reliability has become a research hotspot. Fountain codes evolved from LDPC codes and Tornado codes, and are a sparse graph coding with a deleted channel as the background. Compared with the traditional packet loss retransmission, fountain coding does not require a feedback channel, only the forward link. The sender ran...

AI Technical Summary

Problems solved by technology

Therefore, BP decoding is a suboptimal decoding algorithm. Although it reduces the complexity, it also loses a certain decoding success rate, which is not conducive to the deep space communication environment with high channel bit error rate and large propagation delay. Efficient and accurate reception of important scientific data

[0009] For deep space communication systems with

Images