Search NASA⌕ Search

SEARCH · Search NASA

Results for “codes”

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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Permanence analysis of a concatenated coding scheme for error control

A concatenated coding scheme for error control in data communications is analyzed. In this scheme, the inner code is used for both error correction and detection, however, the outer code is used only for error detection. A retransmission is requested if the outer code detects the presence of errors after the inner code decoding. Probability of undetected error is derived and bounded. A particular example, proposed for the planetary program, is analyzed.

Costello, D. J., Jr.↗
NASA NTRS1984

Performance analysis of the word synchronization properties of the outer code in a TDRSS decoder

A self-synchronizing coding scheme for NASA's TDRSS satellite system is a concatenation of a (2,1,7) inner convolutional code with a (255,223) Reed-Solomon outer code. Both symbol and word synchronization are achieved without requiring that any additional symbols be transmitted. An important parameter which determines the performance of the word sync procedure is the ratio of the decoding failure probability to the undetected error probability. Ideally, the former should be as small as possible compared to the latter when the error correcting capability of the code is exceeded. A computer simulation of a (255,223) Reed-Solomon code as carried out. Results for decoding failure probability and for undetected error probability are tabulated and compared.

Costello, D. J., Jr.↗
NASA NTRS1983

The SIFT Code Specification

The specification of Software Implemented Fault Tolerance (SIFT) consists of two parts, the specifications of the SIFT models and the specifications of the SIFT PASCAL program which actually implements the SIFT system. The code specifications are the last of a hierarchy of models describing the operation of the SIFT system and are related to the SIFT models as well as the PASCAL program. These Specifications serve to link the SIFT models to the running program. The specifications are very large and detailed and closely follow the form and organization of the PASCAL code. In addition to describing each of the components of the SIFT code, the code specifications describe the assumptions of the upper SIFT models which are required to actually prove that the code will work as specified. These constraints are imposed primarily on the schedule tables.

Source record↗
NASA NTRS1984

Fast decoding techniques for extended single-and-double-error-correcting Reed Solomon codes

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. For example, some 256K-bit dynamic random access memories are organized as 32K x 8 bit-bytes. Byte-oriented codes such as Reed Solomon (RS) codes provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. Some special high speed decoding techniques for extended single and double error correcting RS codes. These techniques are designed to find the error locations and the error values directly from the syndrome without having to form the error locator polynomial and solve for its roots.

Costello, D. J., Jr.↗
NASA NTRS1983

Pulse compression using binary phase codes

In most MST applications pulsed radars are peak power limited and have excess average power capacity. Short pulses are required for good range resolution, but the problem of range ambiguity (signals received simultaneously from more than one altitude) sets a minimum limit on the interpulse period (IPP). Pulse compression is a technique which allows more of the transmitter average power capacity to be used without sacrificing range resolution. As the name implies, a pulse of power P and duration T is in a certain sense converted into one of power nP and duration T/n. In the frequency domain, compression involves manipulating the phases of the different frequency components of the pulse. One way to compress a pulse is via phase coding, especially binary phase coding, a technique which is particularly amenable to digital processing techniques. This method, which is used extensively in radar probing of the atmosphere and ionosphere is discussed. Barker codes, complementary and quasi-complementary code sets, and cyclic codes are addressed.

Farley, D. T.↗
NASA NTRS1984

Reed Solomon codes for error control in byte organized computer memory systems

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K-bit DRAM's are organized in 32Kx8 bit-bytes. Byte oriented codes such as Reed Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. Some special decoding techniques for extended single-and-double-error-correcting RS codes which are capable of high speed operation are presented. These techniques are designed to find the error locations and the error values directly from the syndrome without having to use the iterative algorithm to find the error locator polynomial.

Lin, S.↗
NASA NTRS1984

Probability of undetected error after decoding for a concatenated coding scheme

A concatenated coding scheme for error control in data communications is analyzed. In this scheme, the inner code is used for both error correction and detection, however the outer code is used only for error detection. A retransmission is requested if the outer code detects the presence of errors after the inner code decoding. Probability of undetected error is derived and bounded. A particular example, proposed for NASA telecommand system is analyzed.

Costello, D. J., Jr.↗
NASA NTRS1984

GCKP84--General Chemical Kinetics Code for Gas-Phase Flow and Batch Processes Including Heat Transfer Effects

A general chemical kinetics code is described for complex, homogeneous ideal gas reactions in any chemical system. The main features of the GCKP84 code are flexibility, convenience, and speed of computation for many different reaction conditions. The code, which replaces the GCKP code published previously, solves numerically the differential equations for complex reaction in a batch system or one dimensional inviscid flow. It also solves numerically the nonlinear algebraic equations describing the well stirred reactor. A new state of the art numerical integration method is used for greatly increased speed in handling systems of stiff differential equations. The theory and the computer program, including details of input preparation and a guide to using the code are given.

David A Bittker↗
NASA NTRS1984

Error-trellis Syndrome Decoding Techniques for Convolutional Codes

An error-trellis syndrome decoding technique for convolutional codes is developed. This algorithm is then applied to the entire class of systematic convolutional codes and to the high-rate, Wyner-Ash convolutional codes. A special example of the one-error-correcting Wyner-Ash code, a rate 3/4 code, is treated. The error-trellis syndrome decoding method applied to this example shows in detail how much more efficient syndrome decoding is than Viterbi decoding if applied to the same problem. For standard Viterbi decoding, 64 states are required, whereas in the example only 7 states are needed. Also, within the 7 states required for decoding, many fewer transitions are needed between the states.

Reed, I. S.↗
NASA NTRS1984

Validation of a transonic analysis code for use in preliminary design of advanced transport configurations

The WBPPW code has the capability of analyzing flow-field effects about configurations which include wing pylons and engine nacelles or pods in addition to the basic wing/fuselage combination. Using the concept of grid embedding, the code solves the extended small disturbance transonic flow equation for complex flow interactions of the various configuration components. A general description of the code and solution algorithm is included. Results are presented and compared with experiment for various configurations which encompass the code capabilities. These include wing planform and wing contour modifications and variations in nacelle position beneath a high-aspect-ratio wing. Results are analyzed in the light of preliminary design, where the capability to accurately compute flow-field effects resulting from various configuration perturbations is important. The comparisons show that the computational results are sensitive to subtle design modifications and that the code could be used as an effective guide during the design process for transport configurations.

Waggoner, E. G.↗
NASA NTRS1983

Standard methods for telemetry and telecommand channel coding

Recommendations being developed by the NASA-ESA Working Group (NEWG) for Space Data Systems Standardization and the Consultative Committee for Space Data Systems (CCSDS) to standardize spacecraft telemetry and command coding are characterized. The telemetry convolutional codes used by JPL, ESA, and GSFC are found to be similar but incompatible, and it is recommended that a secondary capability for the other two schemes be developed at each facility, with the GSFC scheme as the ultimate standard, a periodic convolutional interleaving procedure for use with the NASA Tracking and Data Relay Satellite, and an optional concatenation of the convolutional code with a Reed-Solomon code to achieve up to 6.8 dB of gain. The telecommand-coding approach adopted by CCSDS is based on the schemes in use at JPL and GSFC.

Macmedan, M. L.↗
NASA NTRS1986

Coding for Electronic Mail

Scheme for coding facsimile messages promises to reduce data transmission requirements to one-tenth current level. Coding scheme paves way for true electronic mail in which handwritten, typed, or printed messages or diagrams sent virtually instantaneously - between buildings or between continents. Scheme, called Universal System for Efficient Electronic Mail (USEEM), uses unsupervised character recognition and adaptive noiseless coding of text. Image quality of resulting delivered messages improved over messages transmitted by conventional coding. Coding scheme compatible with direct-entry electronic mail as well as facsimile reproduction. Text transmitted in this scheme automatically translated to word-processor form.

Rice, R. F.↗
NASA NTRS1984

Analysis of a Coded, M-ary Orthogonal Input Optical Channel with Random-gain Photomultiplier Detection

Performance of two coding systems is analyzed for a noisy optical channel with M(=2(L)-ary orthogonal signaling and random gain photomultiplier detection. The considered coding systems are the Reed Solomon (RS) coding with error only correction decoding and the interleaved binary convolutional system with soft decision Viterbi decoding. The required average number of received signal photons per information bit, N sub b, for a desired bit error of 0.000001 is found for a set of commonly used parameters and with a high background noise level. We find that the interleaved binary convolutional coding system is preferable to the RS coding system in performance complexity tradeoffs.

Lee, P. J.↗
NASA NTRS1985

Reed-solomon Code Synchronization Revisited

A concatenated coding consisting of an inner (7, 1/2) convolutional code and an outer (255, 223) Reed-Solomon code was recommended by the Consultative Committee for Space Data Systems for cross-supported space missions. The Reed-Solomon code that was chosen makes use of the Berlekamp encoding algorithm. Some peculiarities of this code that could give rise to synchronization problems are examined. Suggestions are given to alleviate these problems.

Deutsch, L. J.↗
NASA NTRS1985

Liquid rocket combustor computer code development

The Advanced Rocket Injector/Combustor Code (ARICC) that has been developed to model the complete chemical/fluid/thermal processes occurring inside rocket combustion chambers are highlighted. The code, derived from the CONCHAS-SPRAY code originally developed at Los Alamos National Laboratory incorporates powerful features such as the ability to model complex injector combustion chamber geometries, Lagrangian tracking of droplets, full chemical equilibrium and kinetic reactions for multiple species, a fractional volume of fluid (VOF) description of liquid jet injection in addition to the gaseous phase fluid dynamics, and turbulent mass, energy, and momentum transport. Atomization and droplet dynamic models from earlier generation codes are transplated into the present code. Currently, ARICC is specialized for liquid oxygen/hydrogen propellants, although other fuel/oxidizer pairs can be easily substituted.

Liang, P. Y.↗
NASA NTRS1985

Error-trellis syndrome decoding techniques for convolutional codes

An error-trellis syndrome decoding technique for convolutional codes is developed. This algorithm is then applied to the entire class of systematic convolutional codes and to the high-rate, Wyner-Ash convolutional codes. A special example of the one-error-correcting Wyner-Ash code, a rate 3/4 code, is treated. The error-trellis syndrome decoding method applied to this example shows in detail how much more efficient syndrome decordig is than Viterbi decoding if applied to the same problem. For standard Viterbi decoding, 64 states are required, whereas in the example only 7 states are needed. Also, within the 7 states required for decoding, many fewer transitions are needed between the states.

Reed, I. S.↗
NASA NTRS1985

On the undetected error probability for shortened Hamming codes

Shortened Hamming codes are widely used for error detection in data communications. In this paper, a method for computing the probability of an undetected error for these codes is presented. This method is then used to evaluate the error-detection performance of the shortened codes obtained from the two distance-four Hamming codes adopted by CCITT X.25 for error control for packet-switched networks. It is shown that shortening a code does affect its error-detection performance.

Fujiwara, T.↗
NASA NTRS1985

In search of a 2-dB coding gain

A recent code search found a (15,1/5), a (14,1/6), and a (15,1/6) convolutional code which, when concatenated with a 10-bit (1023,959) Reed-Solomon (RS) code, achieves a bit-error rate (BER) of 0.000001 at a bit signal-to-noise ratio (SNR) of 0.50 dB, 0.47 dB and 0.42 B, respectively. All of these three codes outperform the Voyager communication system, our baseline, which achieves a BER of 10.000001 at bit SNR of 2.53 db, by more than 2 dB. The 2 dB coding improvement goal was exceeded.

Yuen, J. H.↗