Search NASA⌕ Search

SEARCH · Search NASA

Results for “Decoder”

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.

At least 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
NASA NTRS1975

Some long, rate one-half, binary convolutional codes with an optimum distance profile and the systematic versus nonsystematic code question

A tabulation is given of long systematic and long quick-look-in (QLI) nonsystematic rate R = 1/2 binary convolutional codes with an optimum distance profile (ODP). These codes appear attractive for use with sequential decoders. Simulations for two of the new codes are reported and confirm Massey's conjecture that systematic and non-systematic codes of the same rate yield nearly identical computational and error probability performance with sequential decoding when the number of digits transmitted in the tail of the encoded frame is the same for both codes.

Johannesson, R.↗
NASA NTRS1974

Convolutional code performance in fading channels

The performance of convolutional codes in fading channels typical of the planetary entry channel is examined in detail. Short constraint length codes are considered in conjunction with binary phase-shift-keyed (BPSK) modulation and Viterbi maximum likelihood decoding while for longer constraint length codes we consider sequential decoding utilizing both the Fano and Zigangirov-Jelinek (ZJ) algorithms. For short constraint length codes we are primarily interested in the bit error probability performance parameterized by the fading channel parameters. For longer constraint length codes interest will center on the effect of the fading channel parameters on the computational requirements of both the Fano and ZJ algorithms. In either case the effects of simple block interleaving in combatting the memory of the channel is thoroughly explored. The approach is analytic where possible otherwise resort is made to digital computer simulation.

Modestino, J. W.↗
NASA NTRS1975

Short constraint length rate 1/2 'quick-look' codes

Quick-look nonsystematic convolutional codes have the property that the information sequence may be recovered from the encoded sequence in straightforward fashion and with a minimum of error amplification. In this concise paper we investigate their relevant characteristics for constraint lengths less than eight and rate 1/2 and obtain a number of interesting and practically useful results. In particular, for the best of these codes, we derive their free distance and error amplification, their decoded bit error probability when used over the binary symmetric channel in conjunction with Viterbi decoding, and show how they can be employed to measure the channel bit error rate.

Helgert, H. J.↗
NASA NTRS1976

Coordinated design of coding and modulation systems

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.

Massey, J. L.↗
NASA NTRS1975

Correction of burst errors containing bit slippages for cyclic block codes

A technique is presented for correction of an (n,k) cyclic block code subjected to a noise disturbance consisting of an arbitrary number of both bit deletions and bit inversions contained within a single error burst. Following the procedure described by Meggitt (1961), the correction of a b-bit burst is attempted by first loading the initial error syndrome into an (n-k) order feedback shift register with taps selected for the code's generating polynomial; the register is then successively shifted one bit position in the direction of lower order. The discussion covers burst correction with m-bit deletion, burst/deletion decoder implementation, false correction probability, and bit slippage involving bit insertions. The principal elements of the burst/deletion correction decoder are presented in schematic form.

Green, E. P.↗
NASA NTRS1977

Class of near-perfect coded apertures

Coded aperture imaging of gamma ray sources has long promised an improvement in the sensitivity of various detector systems. The promise has remained largely unfulfilled, however, for either one of two reasons. First, the encoding/decoding method produces artifacts, which even in the absence of quantum noise, restrict the quality of the reconstructed image. This is true of most correlation-type methods. Second, if the decoding procedure is of the deconvolution variety, small terms in the transfer function of the aperture can lead to excessive noise in the reconstructed image. It is proposed to circumvent both of these problems by use of a uniformly redundant array (URA) as the coded aperture in conjunction with a special correlation decoding method.

Cannon, T. M.↗
NASA NTRS1977

High-radix transforms for Reed-Solomon codes over Fermat primes

A method is proposed to streamline the transform decoding algorithm for Reed-Solomon (RS) codes of length equal to 2 raised to the power 2n. It is shown that a high-radix fast Fourier transform (FFT) type algorithm with generator equal to 3 on GF(F sub n), where F sub n is a Fermat prime, can be used to decode RS codes of this length. For a 256-symbol RS code, a radix 4 and radix 16 FFT over GF(F sub 3) require, respectively, 30 and 70% fewer modulo F sub n multiplications than the usual radix 2 FFT.

Liu, K. Y.↗
NASA NTRS1977

A programmable microcomputer for real time speech processing

The implementation of a programmable microprocessor for real time speech processing is described. The design of a fast special-purpose computer operating at 150 nsec per instruction time reduces the problem of speech encoding and decoding to a software problem. Each instruction is a twelve-bit word, and the information conveyed by a word is explained. The microprocessor is controlled by two clocks - the A/D clock, or input sampling clock, which loads the digital input into the input register and presets the counter to a value set by the external switches; and the instruction clock, or system clock, which operates at 6 MHz. At this system clock rate and a sampling clock rate of 30 KHz, 200 instructions can be executed between samples, and for many speech encoding and decoding algorithms, 200 instructions are more than enough. The microcomputer is being used to test various delta modulator encoding algorithms.

Apelewicz, T.↗
NASA NTRS1977

The proposed coding standard at GSFC

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.

Morakis, J. C.↗
NASA NTRS1978

Communication system analysis for manned space flight

The development of adaptive delta modulators capable of digitizing a video signal is summarized. The delta modulator encoder accepts a 4 MHz black and white composite video signal or a color video signal and encodes it into a stream of binary digits at a rate which can be adjusted from 8 Mb/s to 24 Mb/s. The output bit rate is determined by the user and alters the quality of the video picture. The digital signal is decoded using the adaptive delta modulator decoder to reconstruct the picture.

Schilling, D. L.↗
NASA NTRS1978

A miniaturized digital telemetry system for physiological data transmission

A physiological date telemetry system, consisting basically of a portable unit and a ground base station was designed, built, and tested. The portable unit to be worn by the subject is composed of a single crystal controlled transmitter with AM transmission of digital data and narrowband FM transmission of voice; a crystal controlled FM receiver; thirteen input channels follwed by a PCM encoder (three of these channels are designed for ECG data); a calibration unit; and a transponder control system. The ground base station consists of a standard telemetry reciever, a decoder, and an FM transmitter for transmission of voice and transponder signals to the portable unit. The ground base station has complete control of power to all subsystems in the portable unit. The phase-locked loop circuit which is used to decode the data, remains in operation even when the signal from the portable unit is interrupted.

Portnoy, W. M.↗
NASA NTRS1981

An experimental study of the concatenated Reed-Solomon/Viterbi channel coding system performance and its impact on space communications

The need for efficient space communication at very low bit error probabilities to the specification and implementation of a concatenated coding system using an interleaved Reed-Solomon code as the outer code and a Viterbi-decoded convolutional code as the inner code. Experimental results of this channel coding system are presented under an emulated S-band uplink and X-band downlink two-way space communication channel, where both uplink and downlink have strong carrier power. This work was performed under the NASA End-to-End Data Systems program at JPL. Test results verify that at a bit error probability of 10 to the -6 power or less, this concatenated coding system does provide a coding gain of 2.5 dB or more over the Viterbi-decoded convolutional-only coding system. These tests also show that a desirable interleaving depth for the Reed-Solomon outer code is 8 or more. The impact of this "virtually" error-free space communication link on the transmission of images is discussed and examples of simulation results are given.

Liu, K. Y.↗
NASA NTRS1981

On counters used for node synchronization

A suboptimal quick look decoding algorithm for the deep space network convolutional code is discussed. Particular emphasis is given to the encoding and decoding schemes.

Greenhall, C. A.↗
NASA NTRS1981

Development of a fault-tolerant microprocessor based computer system for space flight

A methodology for the design of a tightly coupled, highly reliable microprocessor based computer system is described. The concept of triple modular redundancy with sparing is used. The notion of synchronizing by using a single crystal oscillator is examined. The use of decoders to replace voters is also used. The decoders not only isolate the failed module but also allow error identification to be accomplished. Each module is to have its own RAM memory. The necessary circuitry to select a correct memory and the corresponding DMA controller was designed.

Montgomery, V. T.↗
NASA NTRS1983

Implementing Exclusive-OR Logic

Two integrated circuits, BCD-to-decimal decoder and four-input NAND gate, form basic four, input XOR circuit. Multiple-input exclusive-OR logic is implemented by combining several basic elements. 16-input XOR gate is assembled from five NAND gates and five decoders. Same principle extended to handle more inputs.

Hough, M. E.↗
NASA NTRS1982

Performance of an optical relay satellite using Reed-Solomon coding over a cascaded optical PPM and BPSK channel

The nature of the optical/microwave interface aboard the relay satellite is considered. To allow for the maximum system flexibility, without overburdening either the optical or RF channel, demodulating the optical on board the relay satellite but leaving the optical channel decoding to be performed at the ground station is examined. The occurrence of erasures in the optical channel is treated. A hard decision on the erasure (i.e., the relay selecting a symbol at random in case of erasure occurrence) seriously degrades the performance of the overall system. Coding the erasure occurrences at the relay and transmitting this information via an extra bit to the ground station where it can be used by the decoder is suggested. Many examples with varying bit/photon energy efficiency and for the noisy and noiseless optical channel are considered. It is shown that coding the erasure occurrences dramatically improves the performance of the cascaded channel relative to the case of hard decision on the erasure by the relay.

Divsalar, D.↗
NASA NTRS1980

The effects of receiver tracking phase error on the performance of the concatenated Reed-Solomon Viterbi channel coding system

In connection with attempts to achieve very low error probabilities, Odenwalder (1970) proposed a concatenated coding system using the Viterbi-decoded convolutional codes as the inner code and Reed-Solomon (RS) codes as the outer code. Analytical and experimental results are presented concerning the effects of the receiver tracking phase error on the performance of the concatenated RS/Viterbi channel coding system. On the basis of these results it is concluded that certain problems regarding communication operations on deep-space missions can be alleviated by employing the RS/Viterbi coding system. In one-way communication, an employment of RS/Viterbi coding will also provide greater data protection than the Viterbi-decoded convolutional-only coding system.

Liu, K. Y.↗
NASA NTRS1982

Error bounds for multi-h phase codes

Upper and lower bounds for the probability of a decoding error event and for symbol error probability are developed for the class of time-varying phase codes known as multi-h codes. The effect of finite decoder memory is also treated. The analysis is illustrated with numerical examples, and simulation results are compared.

Wilson, S. G.↗