SEARCH · Search NASA

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,009 records · Page 56

All sources NASA NTRS DOE OSTI

NASA NTRS1974

Coded spread spectrum digital transmission system design study

Results are presented of a comprehensive study of the performance of Viterbi-decoded convolutional codes in the presence of nonideal carrier tracking and bit synchronization. A constraint length 7, rate 1/3 convolutional code and parameters suitable for the space shuttle coded communications links are used. Mathematical models are developed and theoretical and simulation results are obtained to determine the tracking and acquisition performance of the system. Pseudorandom sequence spread spectrum techniques are also considered to minimize potential degradation caused by multipath.

Heller, J. A.↗

NASA NTRS1974

Real-time minimal-bit-error probability decoding of convolutional codes

A recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.

Lee, L.-N.↗

NASA NTRS1974

The effectiveness of correcting codes in reception in the whole in additive normal white noise

Some possible criteria for estimating the effectiveness of correcting codes are presented, and the energy effectiveness of correcting codes is studied for symbol-by-symbol reception. Expressions for the energetic effectiveness of binary correcting codes for reception in the whole are produced. Asymptotic energetic effectiveness and finite signal/noise ratio cases are considered.

Shtarkov, Y. M.↗

NASA NTRS1974

Convolutional code performance in planetary entry channels

The planetary entry channel is modeled for communication purposes representing turbulent atmospheric scattering effects. The performance of short and long constraint length convolutional codes is investigated in conjunction with coherent BPSK modulation and Viterbi maximum likelihood decoding. Algorithms for sequential decoding are studied in terms of computation and/or storage requirements as a function of the fading channel parameters. The performance of the coded coherent BPSK system is compared with the coded incoherent MFSK system. Results indicate that: some degree of interleaving is required to combat time correlated fading of channel; only modest amounts of interleaving are required to approach performance of memoryless channel; additional propagational results are required on the phase perturbation process; and the incoherent MFSK system is superior when phase tracking errors are considered.

Modestino, J. W.↗

NASA NTRS1975

FORTRAN Automated Code Evaluation System (faces) system documentation, version 2, mod 0

A system is presented which processes FORTRAN based software systems to surface potential problems before they become execution malfunctions. The system complements the diagnostic capabilities of compilers, loaders, and execution monitors rather than duplicating these functions. Also, it emphasizes frequent sources of FORTRAN problems which require inordinate manual effort to identify. The principle value of the system is extracting small sections of unusual code from the bulk of normal sequences. Code structures likely to cause immediate or future problems are brought to the user's attention. These messages stimulate timely corrective action of solid errors and promote identification of 'tricky' code. Corrective action may require recoding or simply extending software documentation to explain the unusual technique.

Source record↗

NASA NTRS1974

Frame sync acquisition for biorthogonally coded data

The paper analyzes the optimum frame-synchronization problem for biorthogonally coded data received over the additive white Gaussian noise (AWGN) channel and decoded prior to sync acquisition. In deriving the optimum frame-sync algorithm, the discussion is restricted to the case in which each frame contains F complete code words, including a frame-sync prefix of P complete code words. The k-bit source words and k-bit decoded words are regarded as super symbols from an alphabet of binary k-tuples. The biorthogonal encoder, the AWGN channel, and the decoder are lumped into a super symbol channel whose characteristics determine the form of the optimum frame-sync decision rule. A union-bound approach is used to provide a quantitative measure of the probability of false synchronization for the algorithm derived.

Levitt, B. K.↗

NASA NTRS1975

Robustly optimal rate one-half binary convolutional codes

Three optimality criteria for convolutional codes are considered in this correspondence: namely, free distance, minimum distance, and distance profile. Here we report the results of computer searches for rate one-half binary convolutional codes that are 'robustly optimal' in the sense of being optimal for one criterion and optimal or near-optimal for the other two criteria. Comparisons with previously known codes are made. The results of a computer simulation are reported to show the importance of the distance profile to computational performance with sequential decoding.

Johannesson, R.↗

NASA NTRS1976

Coding for a multiple-access channel

In a simple multiple-access communication system, two geographically separated users attempt to communicate binary data to two data sinks over a common channel called a multiple access channel. User one sends codewords from a block code C sub one, while user two sends codewords from a block code C sub two. The two users occupy the same frequency slot, transmit at the same time, and use the same type of modulation. Block codes which are uniquely decodable and capable of correcting errors are constructed for two multiple-access channel models. The first model is referred to as a noiseless multiple-access binary erasure channel. If the two transmitted bits from the two users are zeros, a zero is transmitted over the channel to the receiver; if the two transmitted bits are ones, a one is transmitted to the receiver; if the two bits are different, an erasure symbol is transmitted to the receiver. The second model is also a multiple-access binary erasure channel but with noise introduced.

Kasami, T.↗

NASA NTRS1977

Efficient bit-error detecting code

Two highly reliable codes termed "Modified b-adjacent interleaving codes" provide fail-safe operation of launch processing and control system in which common memory is coordination point for interconnection of up to 64 minicomputers. Codes detect and correct bit errors in computer data transmission.

Hockenberger, R. W.↗

NASA NTRS1976

The fast decoding of Reed-Solomon codes using fermat theoretic transforms and continued fractions

It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform algorithm over finite fields GF(F sub n) where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.

Welch, L. R.↗

NASA NTRS1977

Limiter-discriminator detection performance of Manchester and NRZ coded FSK

The theory of limiter-discriminator detection of a frequency shift keyed (FSK) carrier is reviewed and this theory is used to predict the bit error probability performance of Manchester coded and nonreturn-to-zero (NRZ) coded data. A major result of the study is that the predetection time bandwidth product BT and the deviation ratio h needed to give optimum performance for Manchester coding are seen to be larger than optimum NRZ FSK. Specifically, BT of about 2 and h of about 1 will result in Manchester performance about 2 dB worse than optimum NRZ.

Cartier, D. E.↗

NASA NTRS1977

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

An upper bound on the rate of a binary code as a function of minimum code distance (using a Hamming code metric) is arrived at from Delsarte-MacWilliams inequalities. The upper bound so found is asymptotically less than Levenshtein's bound, and a fortiori less than Elias' bound. Appendices review properties of Krawtchouk polynomials and Q-polynomials utilized in the rigorous proofs.

Mceliece, R. J.↗

NASA NTRS1977

Nearest-neighbor doublets in protein-coding regions of MS2 RNA

'Nearest neighbor' base pairs ('doublets') in the protein-coding regions of MS2 RNA have been tabulated with respect to their positions in the first two bases of amino acid codons, in the second two bases, or paired by contact between adjoining codons. Considerable variation is evident between numbers of doublets in each of these three possible positions, but the totals of each of the 16 doublets in the coding regions of the MS2 RNA molecule show much less variation. Compilations of doublets in nucleic acid strands have no predictive value for the amino acid composition of proteins coded by such strands.

Jukes, T. H.↗

NASA NTRS1976

Convolutional coding at 50 Mbps for the Shuttle Ku-band return link

Error correcting coding is required for 50 Mbps data link from the Shuttle Orbiter through the Tracking and Data Relay Satellite System (TDRSS) to the ground because of severe power limitations. Convolutional coding has been chosen because the decoding algorithms (sequential and Viterbi) provide significant coding gains at the required bit error probability of one in 10 to the sixth power and can be implemented at 50 Mbps with moderate hardware. While a 50 Mbps sequential decoder has been built, the highest data rate achieved for a Viterbi decoder is 10 Mbps. Thus, five multiplexed 10 Mbps Viterbi decoders must be used to provide a 50 Mbps data rate. This paper discusses the tradeoffs which were considered when selecting the multiplexed Viterbi decoder approach for this application.

Batson, B. H.↗

NASA NTRS1978

User's manual: Subsonic/supersonic advanced panel pilot code

Sufficient instructions for running the subsonic/supersonic advanced panel pilot code were developed. This software was developed as a vehicle for numerical experimentation and it should not be construed to represent a finished production program. The pilot code is based on a higher order panel method using linearly varying source and quadratically varying doublet distributions for computing both linearized supersonic and subsonic flow over arbitrary wings and bodies. This user's manual contains complete input and output descriptions. A brief description of the method is given as well as practical instructions for proper configurations modeling. Computed results are also included to demonstrate some of the capabilities of the pilot code. The computer program is written in FORTRAN IV for the SCOPE 3.4.4 operations system of the Ames CDC 7600 computer. The program uses overlay structure and thirteen disk files, and it requires approximately 132000 (Octal) central memory words.

Moran, J.↗

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 NTRS1978

The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions

It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform (FFT) algorithm over finite fields GF(F sub n), where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.

Reed, I. S.↗

NASA NTRS1978

An upper bound for codes in a two-access binary erasure channel

A method for determining an upper bound for the size of a code for a two-access binary erasure channel is presented. For uniquely decodable codes, this bound gives a combinatorial proof of a result by Liao. Examples of the bound are given for codes with minimum distance 4.

Van Tilborg, H. C. A.↗