Bandwidth efficient CCSDS coding standard proposals

The basic concatenated coding system for the space telemetry channel consists of a Reed-Solomon (RS) outer code, a symbol interleaver/deinterleaver, and a bandwidth efficient trellis inner code. A block diagram of this configuration is shown. The system may operate with or without the outer code and interleaver. In this recommendation, the outer code remains the (255,223) RS code over GF(2 exp 8) with an error correcting capability of t = 16 eight bit symbols. This code's excellent performance and the existence of fast, cost effective, decoders justify its continued use. The purpose of the interleaver/deinterleaver is to distribute burst errors out of the inner decoder over multiple codewords of the outer code. This utilizes the error correcting capability of the outer code more efficiently and reduces the probability of an RS decoder failure. Since the space telemetry channel is not considered bursty, the required interleaving depth is primarily a function of the inner decoding method. A diagram of an interleaver with depth 4 that is compatible with the (255,223) RS code is shown. Specific interleaver requirements are discussed after the inner code recommendations

Iterative carrier synchronization in the absence of distributed pilots for low SNR applications

We consider the advanced modulation and coding schemes used in CCSDS (Consultative Committee for Space Data Systems) standards for deep space telemetry and telecommand. They are based on a powerful turbo or low-density parity check (LDPC) outer code and binary modulation formats that, for those schemes foreseen to be employed at the lowest baud rates, may contain an unsuppressed carrier to help synchronization. In this paper, we face the problem of carrier phase synchronization for these modulation and coding schemes

Tight Upper and Lower Bounds to the Information Rate of the Phase Noise Channel

Numerical upper and lower bounds to the information rate transferred through the additive white Gaussian noise channel affected by discrete-time multiplicative autoregressive moving-average (ARMA) phase noise are proposed in the paper. The state space of the ARMA model being multidimensional, the problem cannot be approached by the conventional trellis-based methods that assume a first-order model for phase noise and quantization of the phase space, because the number of state of the trellis would be enormous. The proposed lower and upper bounds are based on particle filtering and Kalman filtering. Simulation results show that the upper and lower bounds are so close to each other that we can claim of having numerically computed the actual information rate of the multiplicative ARMA phase noise channel, at least in the cases studied in the paper. Moreover, the lower bound, which is virtually capacity-achieving, is obtained by demodulation of the incoming signal based on a Kalman filter aided by past data. Thus we can claim of having found the virtually optimal demodulator for the multiplicative phase noise channel, at least for the cases considered in the paper.Comment: 5 pages, 2 figures. Accepted for presentation at ISIT 201

Bandwidth efficient coding: Theoretical limits and real achievements. Error control techniques for satellite and space communications

In his seminal 1948 paper 'The Mathematical Theory of Communication,' Claude E. Shannon derived the 'channel coding theorem' which has an explicit upper bound, called the channel capacity, on the rate at which 'information' could be transmitted reliably on a given communication channel. Shannon's result was an existence theorem and did not give specific codes to achieve the bound. Some skeptics have claimed that the dramatic performance improvements predicted by Shannon are not achievable in practice. The advances made in the area of coded modulation in the past decade have made communications engineers optimistic about the possibility of achieving or at least coming close to channel capacity. Here we consider the possibility in the light of current research results

Constellation Optimization in the Presence of Strong Phase Noise

In this paper, we address the problem of optimizing signal constellations for strong phase noise. The problem is investigated by considering three optimization formulations, which provide an analytical framework for constellation design. In the first formulation, we seek to design constellations that minimize the symbol error probability (SEP) for an approximate ML detector in the presence of phase noise. In the second formulation, we optimize constellations in terms of mutual information (MI) for the effective discrete channel consisting of phase noise, additive white Gaussian noise, and the approximate ML detector. To this end, we derive the MI of this discrete channel. Finally, we optimize constellations in terms of the MI for the phase noise channel. We give two analytical characterizations of the MI of this channel, which are shown to be accurate for a wide range of signal-to-noise ratios and phase noise variances. For each formulation, we present a detailed analysis of the optimal constellations and their performance in the presence of strong phase noise. We show that the optimal constellations significantly outperform conventional constellations and those proposed in the literature in terms of SEP, error floors, and MI.Comment: 10 page, 10 figures, Accepted to IEEE Trans. Commu

Techniques of detection, estimation and coding for fading channels

The thesis describes techniques of detection, coding and estimation, for use in high speed serial modems operating over fading channels such as HF radio and land mobile radio links. The performance of the various systems that employ the above techniques are obtained via computer simulation tests. A review of the characteristics of HF radio channels is first presented, leading to the development of an appropriate channel model which imposes Rayleigh fading on the transmitted signal. Detection processes for a 4.8 kbit/s HF radio modem are then discussed, the emphasis, here, being on variants of the maximum likelihood detector that is implemented by the Viterbi algorithm. The performance of these detectors are compared with that of a nonlinear equalizer operating under the same conditions, and the detector which offers the best compromise between performance and complexity is chosen for further tests. Forward error correction, in the form of trellis coded modulation, is next introduced. An appropriate 8-PSK coded modulation scheme is discussed, and its operation over the above mentioned HF radio modem is evaluated. Performance comparisons are made of the coded and uncoded systems. Channel estimation techniques for fast fading channels akin to cellular land mobile radio links, are next discussed. A suitable model for a fast fading channel is developed, and some novel estimators are tested over this channel. Computer simulation tests are also used to study the feasibility of the simultaneous transmission of two 4-level QAM signals occupying the same frequency band, when each of these signals are transmitted at 24 kbit/s over two independently fading channels, to a single receiver. A novel combined detector/estimator is developed for this purpose. Finally, the performance of the complete 4.8 kbit/s HF radio modem is obtained, when all the functions of detection, estimation and prefiltering are present, where the prefilter and associated processor use a recently developed technique for the adjustment of its tap gains and for the estimation of the minimum phase sampled impulse response