Design of Low-Density Parity-Check (LDPC) Codes for Deep-Space Applications
نویسندگان
چکیده
This article summarizes a comparison of numerous low-density parity-check (LDPC) codes using a set of metrics relevant to deep-space communications. These metrics are the error-correcting capability of the code, the computational complexity of the decoder, the architectural complexities of the encoder and decoder, and the ease of generating a family of structurally related codes at different code rates and block lengths. Based on these metrics, we select a family of LDPC codes that is a good candidate for inclusion in a new Consultative Committee for Space Data Systems (CCSDS) telemetry channel coding standard for deep-space applications.
منابع مشابه
Low-Density Parity-Check Codes for the Gilbert-Elliott Channel
In this paper, we review recent developments concerning the application of lowdensity parity-check (LDPC) codes to the Gilbert-Elliott (GE) channel. Firstly, we discuss the analysis of LDPC estimation-decoding in these channels using density evolution. We show that the required conditions of density evolution are satisfied in the GE channel, and that analysis demonstrates that large potential g...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملLow-Density Parity-Check Code Design Techniques to Simplify Encoding
The NASA proposal for the Consultative Committee for Space Data Systems (CCSDS) experimental specification CCSDS 131.1-O-2 [1] describes a set of low-density parity-check (LDPC) codes for nearEarth and deep-space applications. That experimental specification describes two kinds of codes. The second one is a set of accumulate–repeat–4–jagged–accumulate (AR4JA) codes, which have characteristics p...
متن کاملParity-Check Matrix Extension to Lower the Error Floors of Irregular LDPC Codes
Trapping sets have been identified as one of the main factors causing error floors of low-density parity-check (LDPC) codes at high SNR values. By adding several new rows to the original parity-check matrix, a novel method is proposed to eliminate small trapping sets in the LDPC code’s Tanner graph. Based on this parity-check matrix extension, we design new codes with low error floors from the ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004