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 433 records · Page 24

A concatenated coding scheme for error control

In this paper, a concatenated coding scheme for error control in data communications is presented and 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 either the inner code decoder fails to make a successful decoding or the outer code decoder detects the presence of errors after the inner code decoding. Probability of undetected error (or decoding error) of the proposed scheme is derived. An efficient method for computing this probability is presented. Throughput efficiency of the proposed error control scheme incorporated with a selective-repeat ARQ retransmission strategy is also analyzed. Three specific examples are presented. One of the examples is proposed for error control in the NASA Telecommand System.

Kasami, T.↗

A cascaded coding scheme for error control and its performance analysis

A coding scheme for error control in data communication systems is investigated. The scheme is obtained by cascading two error correcting codes, called the inner and the outer codes. The error performance of the scheme is analyzed for a binary symmetric channel with bit error rate epsilon < 1/2. It is shown that, if the inner and outer codes are chosen properly, extremely high reliability can be attained even for a high channel bit error rate. Various specific example schemes with inner codes ranging from high rates to very low rates and Reed-Solomon codes are considered, and their probabilities are evaluated. They all provide extremely high reliability even for very high bit error rates, say 0.1 to 0.01. Several example schemes are being considered by NASA for satellite and spacecraft down link error control.

Lin, S.↗

Multiple Trellis Coded Modulation (MTCM): An MSAT-X report

Conventional trellis coding outputs one channel symbol per trellis branch. The notion of multiple trellis coding is introduced wherein more than one channel symbol per trellis branch is transmitted. It is shown that the combination of multiple trellis coding with M-ary modulation yields a performance gain with symmetric signal set comparable to that previously achieved only with signal constellation asymmetry. The advantage of multiple trellis coding over the conventional trellis coded asymmetric modulation technique is that the potential for code catastrophe associated with the latter has been eliminated with no additional cost in complexity (as measured by the number of states in the trellis diagram).

Divsalar, D.↗

User manual for semi-circular compact range reflector code: Version 2

A computer code has been developed at the Ohio State University ElectroScience Laboratory to analyze a semi-circular paraboloidal reflector with or without a rolled edge at the top and a skirt at the bottom. The code can be used to compute the total near field of the reflector or its individual components at a given distance from the center of the paraboloid. The code computes the fields along a radial, horizontal, vertical or axial cut at that distance. Thus, it is very effective in computing the size of the sweet spot for a semi-circular compact range reflector. This report describes the operation of the code. Various input and output statements are explained. Some results obtained using the computer code are presented to illustrate the code's capability as well as being samples of input/output sets.

Gupta, Inder J.↗

Rate 5/6 Trellis-coded 8-PSK

Some new short constraint length codes are described for satellite channels which are constant-envelope and which have spectral and energy efficiencies intermediate to other recent coded techniques, namely r = 2/3 coded 8-PSK and r = 3/4 coded 16-PSK. Two intervals of 8-PSK transmission are used to form a modulation base for r = 5/6 Trellis codes. A particularly attractive design is an eight-state code, producing 6.2 dB gain on the Gaussian channel over uncoded 8-PSK, yet sacrificing only 16 percent in spectral efficiency.

Wilson, S. G.↗

Multiple trellis coded modulation (MTCM)

A new trellis coded modulation technique, referred to as multiple trellis coded modulation wherein more than one channel symbol per trellis branch is transmitted and demonstrated. Simple two state trellis codes for symmetric MPSK and AM modulations, which can achieve 3 dB gain over uncoded modulation at very high signal-to-noise ratios without bandwidth expansion and without reduction in information bit rate have been found. The gain of the new trellis codes with respect to previously reported two state trellis codes is between 1 to 2 dB at very high signal-to-noise ratios, depending on the number of bits per hertz transmitted. These gains are achieved with no additional cost in complexity; while indeed additional computations per branch are needed for the multiple trellis coding scheme. This concept can be extended to higher number of states and other type of modulations; i.e., quadrature amplitude modulation.

Divsalar, D.↗

More on the decoder error probability for Reed-Solomon codes

The decoder error probability for Reed-Solomon codes (more generally, linear maximum distance separable codes) is examined. McEliece and Swanson offered an upper bound on P sub E (u), the decoder error probability given that u symbol errors occurs. This upper bound is slightly greater than Q, the probability that a completely random error pattern will cause decoder error. By using a combinatoric technique, the principle of inclusion and exclusion, an exact formula for P sub E (u) is derived. The P sub e (u) for the (255, 223) Reed-Solomon Code used by NASA, and for the (31,15) Reed-Solomon code (JTIDS code), are calculated using the exact formula, and the P sub E (u)'s are observed to approach the Q's of the codes rapidly as u gets larger. An upper bound for the expression is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P sub E (u) indeed approaches Q as u becomes large, and some laws of large numbers come into play.

Cheung, K.-M.↗

Further results on finite-state codes

A general construction for finite-state (FS) codes is applied to some well-known block codes. Subcodes of the (24,12) Golay code are used to generate two optimal FS codes with d sub free = 12 and 16. A partition of the (16,8) Nordstrom-Robinson code yields a d sub free = 10 FS code. Simulation results are shown and decoding algorithms are briefly discussed.

Pollara, F.↗

Manual for obscuration code with space station applications

The Obscuration Code, referred to as SHADOW, is a user-oriented computer code to determine the case shadow of an antenna in a complex environment onto the far zone sphere. The surrounding structure can be composed of multiple composite cone frustums and multiply sided flat plates. These structural pieces are ideal for modeling space station configurations. The means of describing the geometry input is compatible with the NEC-BASIC Scattering Code. In addition, an interactive mode of operation has been provided for DEC VAX computers. The first part of this document is a user's manual designed to give a description of the method used to obtain the shadow map, to provide an overall view of the operation of the computer code, to instruct a user in how to model structures, and to give examples of inputs and outputs. The second part is a code manual that details how to set up the interactive and non-interactive modes of the code and provides a listing and brief description of each of the subroutines.

Marhefka, R. J.↗

New coding advances for deep space communications

Advances made in error-correction coding for deep space communications are described. The code believed to be the best is a (15, 1/6) convolutional code, with maximum likelihood decoding; when it is concatenated with a 10-bit Reed-Solomon code, it achieves a bit error rate of 10 to the -6th, at a bit SNR of 0.42 dB. This code outperforms the Voyager code by 2.11 dB. The use of source statics in decoding convolutionally encoded Voyager images from the Uranus encounter is investigated, and it is found that a 2 dB decoding gain can be achieved.

Yuen, Joseph H.↗

An upwind parabolized Navier-Stokes code for real gas flows

A real gas, upwind, parabolized Navier-Stokes (PNS) code has been developed to compute the two-dimensional/axisymmetric hypersonic flow of equilibrium air around various body shapes. The new code is an extension of the upwind (perfect gas) PNS code of Lawrence, Tannehill and Chaussee. The upwind algorithm is based on Roe's flux-difference splitting scheme which has been modified to account for real gas effects. Simplified curve fits are used to obtain the thermodynamic and transport properties of equilibrium air. The new code has been validated by computing the hypersonic laminar flow of air over a flat plate, a wedge, a ramp, and a cone. The results of these computations are compared with the results from a conventional centrally-differenced, real gas, PNS code and the agreement is excellent, except in the vicinity of shock waves where the present code exhibits far superior shock capturing capabilities.

Tannehill, John C.↗

An upwind parabolized Navier-Stokes code for chemically reacting flows

A new upwind, parabolized Navier-Stokes (PNS) code has been developed to compute the hypersonic, viscous, chemically reacting flow around two-dimensional or axisymmetric bodies. The new code is an extension of the upwind (perfect gas) PNS code of Lawrence et al. (1986). The upwind algorithm is based on Roe's flux-difference splitting scheme which has been modified to account for real gas effects. The algorithm solves the gas dynamic and species continuity equations in a 'loosely' coupled manner. The new code has been validated by computing the laminar flow (at free stream Mach number 25) of chemically reacting air over a wedge and a cone. The results of these computations are compared with the results from a centrally-differenced, fully coupled, nonequilibrium PNS code. The agreement is excellent, except in the vicinity of the shock wave where the present code exhibits superior shock capturing capabilities.

Tannehill, John C.↗

Design Of Trellis Codes For Fading Channels

Report develops theoretical basis for design of trellis codes that perform optimally when used in multiple trellis-coded modulation on Rician fading communication channels. Codes perform better than codes designed to be optimal on nonfading channels with only additive white Gaussian noise (AWGN). Design of improved codes based on new distance measure suitable for fading channels. ("Distance" denotes measure of separation in abstract space in theory of codes rather than in ordinary three-dimensional space.)

Simon, Marvin K.↗

A new look at coding for APD-based direct-detection optical channels

Coding for avalanche-photodiode (APD)-based direct-detection optical channels is investigated using a simple channel model that clearly points out the difference between the signal-dependent optical noise channel model and the additive white Gaussian noise channel model. Coding and modulation are viewed as a single entity, and the coding/modulation gain (CMG) is used to analyze and construct good codes for APD-based optical receivers. It is shown that the structure of block codes, when used in conjunction with on-off keying signaling, renders these codes fairly inefficient with respect to obtaining reasonable CMG on the optical channel. In contrast, codes (or modulations) that use fewer channel ones (pulses) than information ones per block can offer substantial CMG on the optical channel. For bandwidth-constrained applications, it is proposed that pulse-position modulation be used with more than one pulse per word to obtain reasonable CMG while consuming small amounts of bandwidth.

Herro, Mark A.↗

A three-dimensional upwind parabolized Navier-Stokes code for real gas flows

A real gas, upwind, parabolized Navier-Stokes (PNS) code has been developed to compute the three-dimensional hypersonic flow of equilibrium air around various body shapes. The new code is an extension of the upwind (perfect gas) PNS code of Lawrence et al. (1986). The upwind algorithm is based on Roe's (1981) flux-difference splitting scheme which has been modified to account for real gas effects using the nearly exact approach of Vinokur and Liu (1988). Simplified curve fits are employed to obtain the thermodynamic and transport properties of equilibrium air. The new code has been validated by computing the M-infinity = 25 laminar flow of air over cones at various angles of attack. The results of these computations are compared with the results from a conventional centrally-differenced, real gas PNS code and the previous axisymmetric, upwind, real gas code. The agreement is excellent in all cases.

Tannehill, John C.↗

General linear codes for fault-tolerant matrix operations on processor arrays

Various checksum codes have been suggested for fault-tolerant matrix computations on processor arrays. Use of these codes is limited due to potential roundoff and overflow errors. Numerical errors may also be misconstrued as errors due to physical faults in the system. In this a set of linear codes is identified which can be used for fault-tolerant matrix operations such as matrix addition, multiplication, transposition, and LU-decomposition, with minimum numerical error. Encoding schemes are given for some of the example codes which fall under the general set of codes. With the help of experiments, a rule of thumb for the selection of a particular code for a given application is derived.

Nair, V. S. S.↗

More on the decoder error probability for Reed-Solomon codes

The decoder error probability for Reed-Solomon codes (more generally, linear maximum distance separable codes) is examined. McEliece and Swanson offered an upper bound on P sub E (u), the decoder error probability given that u symbol errors occur. This upper bound is slightly greater than Q, the probability that a completely random error pattern will cause decoder error. By using a combinatoric technique, the principle of inclusion and exclusion, an exact formula for P sub E (u) is derived. The P sub E (u) for the (255,223) Reed-Solomon Code used by NASA, and for the (31,15) Reed-Solomon code (JTIDS code), are calculated using the exact formula, and the P sub E (u)'s are observed to approach the Q's of the codes rapidly as u gets larger. An upper bound for the expression is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P sub E (u) indeed approaches Q as u becomes large, and some laws of large numbers come into play.

Cheung, Kar-Ming↗

Simulation of spacecraft attitude dynamics using TREETOPS and model-specific computer Codes

The simulation of spacecraft attitude dynamics and control using the generic, multi-body code called TREETOPS and other codes written especially to simulate particular systems is discussed. Differences in the methods used to derive equations of motion--Kane's method for TREETOPS and the Lagrangian and Newton-Euler methods, respectively, for the other two codes--are considered. Simulation results from the TREETOPS code are compared with those from the other two codes for two example systems. One system is a chain of rigid bodies; the other consists of two rigid bodies attached to a flexible base body. Since the computer codes were developed independently, consistent results serve as a verification of the correctness of all the programs. Differences in the results are discussed. Results for the two-rigid-body, one-flexible-body system are useful also as information on multi-body, flexible, pointing payload dynamics.

Cochran, John E.↗