Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “coding”

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 1,225 records · Page 68

An integrated radiation physics computer code system.

An integrated computer code system for the semi-automatic and rapid analysis of experimental and analytic problems in gamma photon and fast neutron radiation physics is presented. Such problems as the design of optimum radiation shields and radioisotope power source configurations may be studied. The system codes allow for the unfolding of complex neutron and gamma photon experimental spectra. Monte Carlo and analytic techniques are used for the theoretical prediction of radiation transport. The system includes a multichannel pulse-height analyzer scintillation and semiconductor spectrometer coupled to an on-line digital computer with appropriate peripheral equipment. The system is geometry generalized as well as self-contained with respect to material nuclear cross sections and the determination of the spectrometer response functions. Input data may be either analytic or experimental.

Steyn, J. J.↗

On the performance of block codes

It is important to define and evaluate measures which incorporate most, if not all, of the quantities affecting the overall system reliability. For the simple types of block codes normally employed in space communication systems, the complexity of the encoder and decoder is of little consequence, since the use of integrated circuit technology allows the construction of the basic components in an inexpensive fashion. The complexity is essentially independent of the particular code-decoder used. The processing speed is generally a function of the type of logic used and the technology in the construction of the integrated circuits.

Helgert, H. J.↗

Ground Operations Aerospace Language (GOAL). Volume 4: Interpretive code translator

This specification identifies and describes the principal functions and elements of the Interpretive Code Translator which has been developed for use with the GOAL Compiler. This translator enables the user to convert a compliled GOAL program to a highly general binary format which is designed to enable interpretive execution. The translator program provides user controls which are designed to enable the selection of various output types and formats. These controls provide a means for accommodating many of the implementation options which are discussed in the Interpretive Code Guideline document. The technical design approach is given. The relationship between the translator and the GOAL compiler is explained and the principal functions performed by the Translator are described. Specific constraints regarding the use of the Translator are discussed. The control options are described. These options enable the user to select outputs to be generated by the translator and to control vrious aspects of the translation processing.

Source record↗

Program user's manual for optimizing the design of a liquid or gaseous propellant rocket engine with the automated combustor design code AUTOCOM

This computer program manual describes in two parts the automated combustor design optimization code AUTOCOM. The program code is written in the FORTRAN 4 language. The input data setup and the program outputs are described, and a sample engine case is discussed. The program structure and programming techniques are also described, along with AUTOCOM program analysis.

Reichel, R. H.↗

Method and apparatus for decoding compatible convolutional codes

This invention relates to learning decoders for decoding compatible convolutional codes. The decoder decodes signals which have been encoded by a convolutional coder and allows performance near the theoretical limit of performance for coded data systems. The decoder includes a sub-bit shift register wherein the received sub-bits are entered after regeneration and shifted in synchronization with a clock signal recovered from the received sub-bit stream. The received sub-bits are processed by a sub-bit decision circuit, entered into a sub-bit shift register, decoded by a decision circuit, entered into a data shift register, and updated to reduce data errors. The bit decision circuit utilizes stored sub-bits and stored data bits to determine subsequent data-bits. Data errors are reduced by using at least one up-date circuit.

Doland, G. D.↗

Possibilities for the evolution of the genetic code from a preceding form

Analysis of the interaction between mRNA codons and tRNA anticodons suggests a model for the evolution of the genetic code. Modification of the nucleic acid following the anticodon is at present essential in both eukaryotes and prokaryotes to ensure fidelity of translation of codons starting with A, and the amino acids which could be coded for before the evolution of the modifying enzymes can be deduced.

Jukes, T. H.↗

Information preserving coding for multispectral data

A general formulation of the data compression system is presented. A method of instantaneous expansion of quantization levels by reserving two codewords in the codebook to perform a folding over in quantization is implemented for error free coding of data with incomplete knowledge of the probability density function. Results for simple DPCM with folding and an adaptive transform coding technique followed by a DPCM technique are compared using ERTS-1 data.

Duan, J. R.↗

Computer algorithm for coding gain

Development of a computer algorithm for coding gain for use in an automated communications link design system. Using an empirical formula which defines coding gain as used in space communications engineering, an algorithm is constructed on the basis of available performance data for nonsystematic convolutional encoding with soft-decision (eight-level) Viterbi decoding.

Dodd, E. E.↗

A stack algorithm for source coding with a fidelity criterion

Although coding of sources with respect to a fidelity criterion was first proposed by Shannon in 1959, only recently have effective schemes been developed. Another such algorithm based on a stack is described. Like the author's other algorithms (Jelinek and Anderson, 1971, 1973), this algorithm is conceived with tree codes in mind. It has various strengths and weaknesses relative to the earlier two, which are explored. By itself, the algorithm has an interesting mathematical analysis that yields insight into the faster-than-exponential behavior of tree variables and provides a new characterization of the rate-distortion function.

Anderson, J. B.↗

Operations analysis (study 2.1). Program listing for the LOVES computer code

A listing of the LOVES computer program is presented. The program is coded partially in SIMSCRIPT and FORTRAN. This version of LOVES is compatible with both the CDC 7600 and the UNIVAC 1108 computers. The code has been compiled, loaded, and executed successfully on the EXEC 8 system for the UNIVAC 1108.

Wray, S. T., Jr.↗

SOLPRO: A computer code to calculate probabilistic energetic solar proton fluences

A code was developed for the calculation of interplanetary solar proton fluences at 1 AU for the active years 1977 to 1983. The fluences are presented as functions of mission duration tau, energy threshold E, and confidence level Q. For a given combination of tau and Q, the routine determines whether ordinary or anomalously large events are to be considered, and in the latter case, the number of anomalously large events that are predicted by probabilistic theory for the specified mission duration. The code is described in detail. A listing and sample calculations are included.

Stassinopoulos, E. G.↗

The NATA code: Theory and analysis, volume 1

A computer program for calculating quasi-one-dimensional gas flow in axisymmetric and two-dimensional nozzles and rectangular channels is presented. Flow is assumed to start from a state of thermochemical equilibrium at a high temperature in an upstream reservoir. The program provides solutions based on frozen chemistry, chemical equilibrium, and nonequilibrium flow with finite reaction rates. Electronic nonequilibrium effects can be included using a two-temperature model. An approximate laminar boundary layer calculation is given for the shear and heat flux on the nozzle wall. Boundary layer displacement effects on the inviscid flow are considered also. Chemical equilibrium and transport property calculations are provided by subroutines. The code contains precoded thermochemical, chemical kinetic, and transport cross section data for high-temperature air, CO2-N2-Ar mixtures, helium, and argon. It provides calculations of the stagnation conditions on axisymmetric or two-dimensional models, and of the conditions on the flat surface of a blunt wedge. The primary purpose of the code is to describe the flow conditions and test conditions in electric arc heated wind tunnels.

Bade, W. L.↗

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.↗

Random coding strategies for minimum entropy

This paper proves that there exists a fixed random coding strategy for block coding a memoryless information source to achieve the absolute epsilon entropy of the source. That is, the strategy can be chosen independent of the block length. The principal new tool is an easy result on the semicontinuity of the relative entropy functional of one probability distribution with respect to another. The theorem generalizes a result from rate-distortion theory to the 'zero-infinity' case.

Posner, E. C.↗

On the effect of timing errors in run length codes

Many redundancy removal algorithms employ some sort of run length code. Blocks of timing words are coded with synchronization words inserted between blocks. The probability of incorrectly reconstructing a sample because of a channel error in the timing data is a monotonically nondecreasing function of time since the last synchronization word. In this paper we compute the 'probability that the accumulated magnitude of timing errors equal zero' as a function of time since the last synchronization word for a zero-order predictor (ZOP). The result is valid for any data source that can be modeled by a first-order Markov chain and any digital channel that can be modeled by a channel transition matrix. An example is presented.

Wilkins, L. C.↗

A hybrid computer time code reader used to digitize sounding rocket data

A technique is described for utilizing a hybrid computer as a time code reader and digitizer. The NASA 36-bit time code is an absolute time reference for digitizing analog signals to 1 mV resolution at a 1 kHz sampling rate. The analog computer circuit and the operation of the merged analog and digital computer systems is described. A result of this digitization process applied to analog signals recorded on magnetic tape during an auroral sounding rocket flight is given as an example. This is a general technique that could be applied to other areas such as geology, meteorology, oceanography, and seismology.

Dukich, T.↗

FORTRAN Automated Code Evaluation System (FACES) user's manual, version 2

A system which provides analysis services for FORTRAN based software systems not normally available from system software is presented. The system is not a compiler, and compiler syntax diagnostics are not duplicated. For maximum adaptation to FORTRAN dialects, the code presented to the system is assumed to be compiler acceptable. The system concentrates on acceptable FORTRAN code features which are likely to produce undesirable results and identifies potential trouble areas before they become execution time malfunctions.

Source record↗