Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “code”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

Performance of convolutionally coded unbalanced QPSK systems

An evaluation is presented of the performance of three representative convolutionally coded unbalanced quadri-phase-shift-keying (UQPSK) systems in the presence of noisy carrier reference and crosstalk. The use of a coded UQPSK system for transmitting two telemetry data streams with different rates and different powers has been proposed for the Venus Orbiting Imaging Radar mission. Analytical expressions for bit error rates in the presence of a noisy carrier phase reference are derived for three representative cases: (1) I and Q channels are coded independently; (2) I channel is coded, Q channel is uncoded; and (3) I and Q channels are coded by a common 1/2 code. For rate 1/2 convolutional codes, QPSK modulation can be used to reduce the bandwidth requirement.

Divsalar, D.↗
NASA NTRS1984

Undetected error probability and throughput analysis of a concatenated coding scheme

The performance of a proposed concatenated coding scheme for error control on a NASA telecommand system is analyzed. In this scheme, the inner code is a distance-4 Hamming code used for both error correction and error detection. The outer code is a shortened distance-4 Hamming code used only for error detection. Interleaving is assumed between the inner and outer codes. A retransmission is requested if either the inner or outer code detects the presence of errors. Both the undetected error probability and the throughput of the system are analyzed. Results indicate that high throughputs and extremely low undetected error probabilities are achievable using this scheme.

Costello, D. J.↗
NASA NTRS1985

Codes with Parity Conditions on Subsets of Coordinates

Binary codes with the constraint that the codes restricted to certain subsets of columns must be contained in particular codes of the shorter lengths are considered. In particular, codes of even length 2k, and of minimum distance approximately greater than d, where in the code obtained by restricting to the first k positions has even weight and at the same time the code obtained by restricting to the last k positions also has even weight are considered. If k = 2n, n odd, and d = 2n, it is proved that the code has at most 8n - 4 codewords, and 8n - 4 is attainable for n = 3. This permits a file-transfer protocol control function assignment for personal computers to be chosen for 20 control functions using essentially just pairs of upper-case alphabetic ASCII characters where the Hamming distance between the binary forms of every two different control functions is at least six.

Posner, E. C.↗
NASA NTRS1985

Combined trellis coding with asymmetric MPSK modulation: An MSAT-X report

Traditionally symmetric, multiple phase-shift-keyed (MPSK) signal constellations, i.e., those with uniformly spaced signal points around the circle, have been used for both uncoded and coded systems. Although symmetric MPSK signal constellations are optimum for systems with no coding, the same is not necessarily true for coded systems. This appears to show that by designing the signal constellations to be asymmetric, one can, in many instances, obtain a significant performance improvement over the traditional symmetric MPSK constellations combined with trellis coding. The joint design of n/(n + 1) trellis codes and asymmetric 2 sup n + 1 - point MPSK is considered, which has a unity bandwidth expansion relative to uncoded 2 sup n-point symmetric MPSK. The asymptotic performance gains due to coding and asymmetry are evaluated in terms of the minimum free Euclidean distance free of the trellis. A comparison of the maximum value of this performance measure with the minimum distance d sub min of the uncoded system is an indication of the maximum reduction in required E sub b/N sub O that can be achieved for arbitrarily small system bit-error rates. It is to be emphasized that the introduction of asymmetry into the signal set does not effect the bandwidth of power requirements of the system; hence, the above-mentioned improvements in performance come at little or no cost. MPSK signal sets in coded systems appear in the work of Divsalar.

Simon, M. K.↗
NASA NTRS1984

Sidelobe reduction of Barker codes, part 7.1C

Barker codes can be realized as simple digital preprocessors, or with the use of a delay line, can be realized as an analogue device. Assuming the process observed has an autocorrelation time that is long compared to the code length, a gain in signal to noise, G = N where N is the number of elements in the code, may be realized. Typically Barker codes are implemented by shifting the phase of the transmitted signal by 0 or 180 degrees according to the code pattern. A typical detection scheme is shown where the output of the radar receiver is delayed by an analogue delay line or a shift register. The signal in each element of the delay line or shift register is continuously multiplied by the code and all elements are summed. A principal disadvantage was the sidelobe response. In the case of MST or ST radar echoes where there is a dynamic range as large as 60 dB, these unwanted sidelobes cause an increase in the apparent width of atmospheric layers, or some narrow layer to appear at several altitudes. The sidelobes of a Barker code may be reduced by tapering the response of the decoder. Optimum tapers, are shown. It is found that the sidelobe response is greatly reduced with very little loss in G.

Green, J. L.↗
NASA NTRS1985

New short constraint length, rate 1/N convolutional codes which minimize the required SNR for given desired bit error rates

It is pointed out that for a convolutional coding system, the Bit Error Rate (BER) at the Viterbi decoder output is upper-bounded by the transfer function bound. A large number of rate 1/N convolutional codes have been reported. The criteria used for determining the quality of a code in code search procedures, however, may not be very suited for cases in which the required BER is in the moderate range. For this reason, it may be best to select the code with the aim to minimize the required SNR for a given disired BER. Partial code searching techniques are presented, and a table listing the code search results is provided.

Lee, P. J.↗
NASA NTRS1985

High-rate convolutional code construction with the minimum required SNR criterion

New short constraint length, high-rate convolutional codes which minimize the required signal to noise ratios (SNR) are found and tabulated for rates 2/3, 3/4, and 4/5, and for constraint length K up to 10. When compared with previously reported codes, most of the new codes reduce the required SNR only slightly. However, there are some pairs of K and code rate for which the new codes require considerably less SNR. The most significant one is the new K = 8, ate 4/5 code which requires 1.2 dB less SNR than the known code with the same parameters, for a desired bit error rate of 0.000001.

Lee, P. J.↗
NASA NTRS1986

A cascaded coding scheme for error control and its performance analysis

A coding scheme is investigated for error control in data communication systems. The scheme is obtained by cascading two error correcting codes, called the inner and 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 form high rates to very low rates and Reed-Solomon codes as inner codes are considered, and their error probabilities are evaluated. They all provide extremely high reliability even for very high bit error rates. Several example schemes are being considered by NASA for satellite and spacecraft down link error control.

Lin, Shu↗
NASA NTRS1987

NASCRAC - A computer code for fracture mechanics analysis of crack growth

NASCRAC - a computer code for fracture mechanics analysis of crack growth - is described in this paper. The need for such a code is increasing as requirements grow for high reliability and low weight in aerospace components. The code is comprehensive and versatile, as well as user friendly. The major purpose of the code is calculation of fatigue, corrosion fatigue, or stress corrosion crack growth, and a variety of crack growth relations can be selected by the user. Additionally, crack retardation models are included. A very wide variety of stress intensity factor solutions are contained in the code, and extensive use is made of influence functions. This allows complex stress gradients in three-dimensional crack problems to be treated easily and economically. In cases where previous stress intensity factor solutions are not adequate, new influence functions can be calculated by the code. Additional features include incorporation of J-integral solutions from the literature and a capability for estimating elastic-plastic stress redistribution from the results of a corresponding elastic analysis. An example problem is presented which shows typical outputs from the code.

Harris, D. O.↗
NASA NTRS1987

The design of trellis codes for fading channels

The appropriate criterion for optimum trellis coded modulation design on the additive white Gaussian noise channel is maximization of the free Euclidean distance. When trellis coded modulation is used on a Rician fading channel with interleaving/deinterleaving, the design of the code for optimum performance is guided by other factors, in particular the length of the shortest error event path, and the product of branch distances (possibly normalized by the Euclidean distance of the path) along that path. Although maximum free distance (d sub free) is still an important consideration, it plays a less significant role the more severe the fading is on the channel. These considerations lead to the definition of a new distance measure for optimization of trellis codes transmitted over Rician fading channels. If no interleaving/deinterleaving is used, then once again the design of the trellis code is guided by maximizing d sub free. It is also shown that allowing for multiple symbols per trellis branch, i.e., multiple trellis coded modulation (MTCM), provides an additional degree of freedom for designing a code to meet the above optimization criteria on the fading channel. It is here where the MTCM technique exploits its full potential.

Divsalar, Dariush↗
NASA NTRS1987

Efficiency of a model human image code

Hypothetical schemes for neural representation of visual information can be expressed as explicit image codes. Here, a code modeled on the simple cells of the primate striate cortex is explored. The Cortex transform maps a digital image into a set of subimages (layers) that are bandpass in spatial frequency and orientation. The layers are sampled so as to minimize the number of samples and still avoid aliasing. Samples are quantized in a manner that exploits the bandpass contrast-masking properties of human vision. The entropy of the samples is computed to provide a lower bound on the code size. Finally, the image is reconstructed from the code. Psychophysical methods are derived for comparing the original and reconstructed images to evaluate the sufficiency of the code. When each resolution is coded at the threshold for detection artifacts, the image-code size is about 1 bit/pixel.

Watson, Andrew B.↗
NASA NTRS1988

Capacity and cutoff rate calculations for a concatenated coding system

A model is developed for a concatenated coding system, and from it the overall channel cutoff rate and capacity is found using random coding arguments. The effects of interleaving between the inner and outer codes and of the availability of side information to the outer decoder are considered. The performance of several specific concatenated coding systems is calculated and used for comparison with the random coding results. From the analysis, a number of general conclusions regarding the design of concatenated coding systems are presented. All the results are derived assuming a block inner code.

Herro, Mark A.↗
NASA NTRS1988

Long decoding runs for Galileo's convolutional codes

Decoding results are described for long decoding runs of Galileo's convolutional codes. A 1 k-bit/sec hardware Viterbi decoder is used for the (15, 1/4) convolutional code, and a software Viterbi decoder is used for the (7, 1/2) convolutional code. The output data of these long runs are stored in data files using a data compression format which can reduce file size by a factor of 100 to 1 typically. These data files can be used to replicate the long, time-consuming runs exactly and are useful to anyone who wants to analyze the burst statistics of the Viterbi decoders. The 1 k-bit/sec hardware Viterbi decoder was developed in order to demonstrate the correctness of certain algorithmic concepts for decoding Galileo's experimental (15, 1/4) code, and for the long-constraint-length codes in general. The hardware decoder can be used both to search for good codes and to measure accurately the performance of known codes.

Lahmeyer, C. R.↗
NASA NTRS1988

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 outer codes. Its error performance is analyzed for a binary symmetric channel with bit-error rate epsilon less than 1/2. It is shown that, if the inner and outer codes are chosen properly, high reliability can be attained even for a high-channel bit-error rate. Specific examples with inner codes ranging from high rates and Reed-Solomon codes as outer codes are considered, and their error probabilities evaluated. They all provide high reliability even for high bit-error rates, say 0.1-0.01. Several example schemes are being considered for satellite and spacecraft downlink error control.

Kasami, Tadao↗
NASA NTRS1988

dc-free coset codes

A class of block coset codes with disparity and run-length constraints are studied. They are particularly well suited for high-speed optical fiber links and similar channels, where dc-free pulse formats, channel error control, and low-complexity encoder-decoder implementations are required. The codes are derived by partitioning linear block codes. The encoder and decoder structures are the same as those of linear block codes with only slight modifications. A special class of dc-free coset block codes are derived from BCH codes with specified bounds on minimum distance, disparity, and run length. The codes have low disparity levels (a small running digital sum) and good error-correcting capabilities.

Deng, Robert H.↗
NASA NTRS1988

A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes

A lower bound on the minimum free Euclidean distance of trellis-coded modulation (TCM) is derived that guarantees the existence of good TCM codes of any complexity. The bound is used to compare trellis codes combined with phase-shift keying, pulse amplitude modulation, and quadrature amplitude-shift keying modulation. This random coding bound is the first lower bound on the free distance of trellis codes, is tighter than any upper bound for large constraint lengths, and predicts the asymptotic performance of TCM when the complexity of the code becomes large. The bound can be used with any code rate and any modulation scheme and shows that the free distance increases linearly with the constraint length for large values of the constraint length.

Rouanne, Marc↗
NASA NTRS1990

Users Manual for the NASA Lewis Ice Accretion Prediction Code (LEWICE)

LEWICE is an ice accretion prediction code that applies a time-stepping procedure to calculate the shape of an ice accretion. The potential flow field is calculated in LEWICE using the Douglas Hess-Smith 2-D panel code (S24Y). This potential flow field is then used to calculate the trajectories of particles and the impingement points on the body. These calculations are performed to determine the distribution of liquid water impinging on the body, which then serves as input to the icing thermodynamic code. The icing thermodynamic model is based on the work of Messinger, but contains several major modifications and improvements. This model is used to calculate the ice growth rate at each point on the surface of the geometry. By specifying an icing time increment, the ice growth rate can be interpreted as an ice thickness which is added to the body, resulting in the generation of new coordinates. This procedure is repeated, beginning with the potential flow calculations, until the desired icing time is reached. The operation of LEWICE is illustrated through the use of five examples. These examples are representative of the types of applications expected for LEWICE. All input and output is discussed, along with many of the diagnostic messages contained in the code. Several error conditions that may occur in the code for certain icing conditions are identified, and a course of action is recommended. LEWICE has been used to calculate a variety of ice shapes, but should still be considered a research code. The code should be exercised further to identify any shortcomings and inadequacies. Any modifications identified as a result of these cases, or of additional experimental results, should be incorporated into the model. Using it as a test bed for improvements to the ice accretion model is one important application of LEWICE.

Ruff, Gary A.↗
NASA NTRS1990

Finding the complete path and weight enumerators of convolutional codes

A method for obtaining the complete path enumerator T(D, L, I) of a convolutional code is described. A system of algebraic equations is solved, using a new algorithm for computing determinants, to obtain T(D, L, I) for the (7,1/2) NASA standard code. Generating functions, derived from T(D, L, I) are used to upper bound Viterbi decoder error rates. This technique is currently feasible for constraint length K less than 10 codes. A practical, fast algorithm is presented for computing the leading nonzero coefficients of the generating functions used to bound the performance of constraint length K less than 20 codes. Code profiles with about 50 nonzero coefficients are obtained with this algorithm for the experimental K = 15, rate 1/4, code in the Galileo mission and for the proposed K = 15, rate 1/6, 2-dB code.

Onyszchuk, I.↗