The project comprises of two main components. The first component aims at devising efficient Parity Check Matrix and Generator Matrix pairs in line with the Consultative Committee for Space Data Systems (CCSDS) guidelines. These pairs are intended for utilization in spacecraft communications, where they are expected to offer high reliability even in low signal-to-noise ratio (SNR) communication channels. The second component involves implementing the Sum-Product algorithm, also known as the Belief Propagation algorithm, and presenting a simple numerical example to demonstrate its functionality. Furthermore, the Sum-Product algorithm is employed to decode a message that has been encoded using the Generator Matrix specified in the CCSDS standards.

References

[1] R.G. Gallager, ”Low-Density Parity-Check Codes”

[2] D.J.C. MacKay, ”Information Theory, Inference, and Learning Algo- rithm

[3] CCSDS GREEN BOOK 130.1-G-3 "TM SYNCHRONIZATION AND CHANNEL CODING—SUMMARYOF CONCEPTAND RATIONALE"

[4] CCSDS BLUE BOOK CCSDS 131.0-B-4 "TM SYNCHRONIZATION AND CHANNEL CODING"

[5] Alex Balatsoukas-Stimming, Telecommunications Laboratory, "Decoding of LDPC codes using the Sum�Product algorithm for the AWGN channel with BPSK modulation", Presentation Slides