Coding - A tool for the digital telemetry link
Digital PCM telemetry link coding techniques, discussing encoding-decoding complexity, and concatenated block scheme for channel
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Digital PCM telemetry link coding techniques, discussing encoding-decoding complexity, and concatenated block scheme for channel
An adaptive variable length coding system is presented. Although developed primarily for the proposed Grand Tour missions, many features of this system clearly indicate a much wider applicability. Using sample to sample prediction, the coding system produces output rates within 0.25 bit/picture element (pixel) of the one-dimensional difference entropy for entropy values ranging from 0 to 8 bit/pixel. This is accomplished without the necessity of storing any code words. Performance improvements of 0.5 bit/pixel can be simply achieved by utilizing previous line correlation. A Basic Compressor, using concatenated codes, adapts to rapid changes in source statistics by automatically selecting one of three codes to use for each block of 21 pixels. The system adapts to less frequent, but more dramatic, changes in source statistics by adjusting the mode in which the Basic Compressor operates on a line-to-line basis. Furthermore, the compression system is independent of the quantization requirements of the pulse-code modulation system.
A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.
A recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.
Results of research on the use of convolutional codes in data communications are presented. Convolutional coding fundamentals are discussed along with modulation and coding interaction. Concatenated coding systems and data compression with convolutional codes are described.
It is shown that (n sub 0, k sub 0) convolutional codes with unit memory always achieve the largest free distance among all codes of the same rate k sub 0/n sub 0 and same number 2MK sub 0 of encoder states, where M is the encoder memory. A unit-memory code with maximal free distance is given at each place where this free distance exceeds that of the best code with k sub 0 and n sub 0 relatively prime, for all Mk sub 0 less than or equal to 6 and for R = 1/2, 1/3, 1/4, 2/3. It is shown that the unit-memory codes are byte-oriented in such a way as to be attractive for use in concatenated coding systems.
The capacity of an M-ary channel with N-ary coding is computed. It is found that the capacity of a very noisy channel is reduced by the factor (N-1)(log M)/(M-1)(log N). The results are applied to channels with noncoherent multifrequency shift keying and to concatenation of codes and interleaving.
The phenomenology was studied of the processes of vortex formation and transport in the near wake, at a Reynolds number sufficiently high to insure a fully turbulent wake, but low enough to insure a laminar separation. The apparatus developed for measuring this flow consisted of X-array hot wire probes mounted on the ends of a pair of whirling arms. A computer controlled data acquisition system was slaved to the position of the rotating arm and managed, monitored, edited, and recorded the vast profusion of data which is continuously poured out by the device. Results are presented which show the instantaneous velocity, intermittency, vorticity, and stress fields as a function of phase for the first six diameters of the near wake. The stresses in the near wake emerge as a concatenation of peaks and valleys, some the result of strong induced motions in the outer flow which cause free stream fluid to move rapidly inward toward the center of the wake, others the result of the random motions of the background turbulence.
The current literature on image bandwidth compression was surveyed and those methods relevant to compression of multispectral imagery were selected. Typical satellite multispectral data was then analyzed statistically and the results used to select a smaller set of candidate bandwidth compression techniques particularly relevant to earth resources data. These were compared using both theoretical analysis and simulation, under various criteria of optimality such as mean square error (MSE), signal-to-noise ratio, classification accuracy, and computational complexity. By concatenating some of the most promising techniques, three multispectral data compression systems were synthesized which appear well suited to current and future NASA earth resources applications. The performance of these three recommended systems was then examined in detail by all of the above criteria. Finally, merits and deficiencies were summarized and a number of recommendations for future NASA activities in data compression proposed.
Relationships between LANDSAT-1 multispectral scanner (MSS) data and the trophic status of a group of lakes in the north-northeastern part of the United States were studied by predicting the magnitudes of two trophic state indicators, estimating lake position on a multivariate trophic scale, and automatically classifying lakes according to their trophic state. Initially, the principal component ordination was employed with 100 lakes. MSS data for some 20 lakes was then extracted from computer-compatible tapes (CCT) using a binary marking technique. The output was in the form of descriptive statistics and photographic concatenations. Color ratios were incorporated into regression models for the prediction of Secchi disc transparency, chlorophyll a, and lake position on the tropic scale. Results indicate that the LANDSAT-1 system, although handicapped by low spectral and spatial resolutions as well as excessive cloud cover, can be used as a supplemental data source in lake survey programs.
The joint optimization of the coding and modulation systems employed in telemetry systems was investigated. Emphasis was placed on formulating inner and outer coding standards used by the Goddard Spaceflight Center. Convolutional codes were found that are nearly optimum for use with Viterbi decoding in the inner coding of concatenated coding systems. A convolutional code, the unit-memory code, was discovered and is ideal for inner system usage because of its byte-oriented structure. Simulations of sequential decoding on the deep-space channel were carried out to compare directly various convolutional codes that are proposed for use in deep-space systems.
Buxbaum has reported on three algorithms for computing least squares estimates that are based on fixed amounts of data. In this correspondence, the filter is arranged as a point-deleting Kalman filter concatenated with the standard point-inclusion Kalman filter. The resulting algorithm is couched in a square root framework for greater numerical stability, and special attention is given to computer implementation.
An advanced imaging communication system (AICS) for planetary exploration is presented. The system offers 'end-to-end' information rate improvements of 3 to 5 times over existing systems in addition to extensive user flexibility to adapt his rate/fidelity priorities to fit a particular mission. AICS contains two major system elements. The first is a concatenated Reed-Solomon/Viterbi coded channel. This provides a powerful, yet practical, solution to the usual 'error vulnerability' problem associated with compressed data. The second major element is an extremely adaptive image data compression algorithm called RM2. The details of this algorithm as presently simulated are discussed in considerable detail. Used in conjunction with the virtually error free performance of the Reed-Solomon/Viterbi channel the stated AICS advantages are obtained.
As part of the continuing effort to introduce standardization of spacecraft and ground equipment in satellite systems, NASA's Goddard Space Flight Center and other NASA facilities have supported the development of a set of standards for the use of error control coding in telemetry subsystems. These standards are intended to ensure compatibility between spacecraft and ground encoding equipment, while allowing sufficient flexibility to meet all anticipated mission requirements. The standards which have been developed to date cover the application of block codes in error detection and error correction modes, as well as short and long constraint length convolutional codes decoded via the Viterbi and sequential decoding algorithms, respectively. Included are detailed specifications of the codes, and their implementation. Current effort is directed toward the development of standards covering channels with burst noise characteristics, channels with feedback, and code concatenation.
The means by which the data collected by the Voyager 1 mission to Jupiter were returned to earth are presented. Radio links between the earth and the spacecraft are used for the transmission of both imaging and nonimaging telemetry from the spacecraft and commands from the earth and for radiometric observations of the spacecraft and its environment. Features which have lead to vast improvements in the capability of the Voyager telecommunications system over that of previous space probes include the use of X-band rather than S-band telemetry, a dual power X-band traveling wave tube amplifier, a 3.7 m spacecraft antenna and a single channel telemetry system with concatenated coding. Communications equipment at the three ground complexes of the Deep Space Network for telemetry reception includes 64 m steerable antennas, cryogenic maser preamplifiers and a phase-lock loop receiver. Voyager 1 has met or exceeded all of its telecommunications requirements, providing a 98% data return and a total of 2 x 10 to the 11th data bits during the Jupiter encounter.
The theory, design, and results of optical fiber pulse dispersion measurements are considered. Both the hardware and software required to perform this type of measurement are described. Hardware includes a thermoelectrically cooled injection laser diode source, an 800 GHz gain bandwidth produce avalanche photodiode and an input mode scrambler. Software for a HP 9825 computer includes fast Fourier transform, inverse Fourier transform, and optimal compensation deconvolution. Test set construction details are also included. Test results include data collected on a 1 Km fiber, a 4 Km fiber, a fused spliced, eight 600 meter length fibers concatenated to form 4.8 Km, and up to nine optical connectors.
A software system for reducing PAM-II data was constructed. The data reduction process concatenates data tapes; determines ephemeris; and inverts full sun extinction data. Tests of this data reduction process show that PAM-II data can be compared with data from other, similar satellites.
Different methods are considered for frame synchronization of a concatenated block code/Viterbi link. Synchronization after Viterbi decoding, synchronization before Viterbi decoding based on hard-quantized channel symbols are all compared. For each scheme, the probability under certain conditions of true detection of sync within four 10,000 bit frames is tabulated.