TM SYNCHRONIZATION AND CHANNEL CODING—SUMMARY OF CONCEPT AND RATIONALEWithin the AR4JA family, the selected block lengths are k=1024, k=4096, and k=16384. Thethree values k={1024,4096,∞} are about uniformly spaced by 0.6 dB on the sphere-packingbound at WER=10 -8 , and reducing the last value from ∞ to 16384 makes the largest blocksize practical at a cost of about 0.3 dB. By choosing to keep k constant among familymembers, rather than n, the spacecraft’s command and data handling system can generatedata frames without knowledge of the code rate. To simplify implementation, the code ratesare exact ratios of small integers, and the choices of k are powers of two. Code C2 has rate0.87451 and size (n=8160, k=7136), which is exactly four times that of the (255,223) Reed-Solomon code.The selected codes are systematic. A low-complexity encoding method is described inreference [41]. The parity check matrices have plenty of structure to facilitate decoderimplementation (reference [42]). The AR4JA codes have irregular degree distributions,because this improves performance by about 0.5 dB at rate 1/2, compared to a regular (3,6)code (reference [44]). As the code rate increases towards unity, the performanceimprovement of an irregular degree distribution becomes small (reference [43]).8.2 APPLICATIONS OF LDPC CODESWhen designing a communications link, selection of the error correcting code requires atrade-off of several parameters. Dominant parameters typically include power efficiency,code rate (a high code rate may be required to meet a bandwidth constraint with the availablemodulations), and the block length (shorter blocks reduce latency on low data-rate links, andreduce encoder and decoder complexity). The trade-off between power efficiency andspectral efficiency for several <strong>CCSDS</strong> codes is shown in figure 8-1. The horizontal axis isthe familiar E b /N 0 , and the vertical axis shows spectral efficiency in Hz-sec/bit, the reciprocalof the potentially more familiar unit of bits/sec/Hz. It may be noted that both axes arelogarithmic. Turbo codes of block lengths k=8920 and k=1784 are shown in green, the tenLDPC codes are shown in red, and the (7,1/2) convolutional and (255,223) Reed-Solomoncodes are shown in blue, both alone and concatenated. When these codes are concatenated,performance improves with greater interleaving depth; shown are I = 1 and 5 codewords, andthe theoretical limit I = ∞. Performance is plotted at a BER of 10 -6 , and only theconvolutional (7,1/2) point moves significantly at other error rates.<strong>CCSDS</strong> 130.1-G-2 Page 8-2 November 2012
TM SYNCHRONIZATION AND CHANNEL CODING—SUMMARY OF CONCEPT AND RATIONALEFigure 8-1: Power Efficiency versus Spectral Efficiency for Several <strong>CCSDS</strong> CodesWhen power is extremely constrained, one must choose a code from the left side of the figureand accept the corresponding bandwidth expansion. Conversely, when bandwidth isconstrained, one must choose from the points towards the bottom of the figure, at the cost ofincreased energy per bit. Turbo codes are good choices for power-constrained links, andLDPC codes serve well when bandwidth is constrained, typically for higher data-rate links.It may be noted that the Reed-Solomon and convolutional codes are out-performed in bothmetrics by LDPC codes.Also shown in figure 8-1 is the capacity limit on a binary-input AWGN channel, and theunconstrained AWGN channel capacity (Reference [47]). The region between these capacitylimits becomes available with the use of higher order modulations, as shown in figure 8-2.To the extent possible with available equipment, the use of a higher order modulation may bea more practical means for saving bandwidth than the use of a code with rate much above0.8. For the QPSK and 16-APSK modulations, performance results are shown only for thelongest block length at each code rate. While 8-PSK data are also omitted for clarity, theycan be interpolated from the QPSK and 16-APSK results.<strong>CCSDS</strong> 130.1-G-2 Page 8-3 November 2012