The features of long delay, great error rate and packet loss, asymmetric bandwidth between uplink and downlink and links easily interrupted in deep space communication determine the technology of encoding and decoding is a difficult issue. The basic conception and features of fountain codes are introduced, and the question of all-selected, degree distribution and the decoding algorithm of fountain codes and the performance of decoding algorithms of LDPC are analyzed. On the basis of these analyses, the concatenated codes of LDPC codes as inner codes and fountain codes as outer codes are proposed to use in deep space communication. The result of the concatenated codes having good performance and comparatively simple decoding complexity is obtained by analyzing its performance. The concatenated codes can satisfy the transmission requirements and have great potential applications in deep space communication.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Research on Fountain Codes in Deep Space Communication


    Contributors:
    Yao, Wending (author) / Chen, Lijia (author) / Li, Hui (author) / Xu, Hongguang (author)


    Publication date :

    2008-05-01


    Size :

    512955 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Caching at the edge with Fountain Codes

    Recayte, Estefania / Lazaro Blasco, Francisco / Liva, Gianluigi | German Aerospace Center (DLR) | 2018

    Free access

    Communication method for guiding landing assisting of helicopter based on grading fountain codes

    ZHAO TAIFEI / LIU XUE / WANG YU et al. | European Patent Office | 2015

    Free access


    Weight-Adaptive Analog Fountain Codes toward Massive Machine Type Communications

    Zhang, Ke / Jiao, Jian / Li, Lianqin et al. | IEEE | 2019


    Turbo Codes and Turbo Decoders for Deep Space Communication

    Dolinar, S. / Divsalar, D. / Pollara, F. et al. | NTRS | 1999