Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “L 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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1973

On the error probability of general tree and trellis codes with applications to sequential decoding

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random binary tree codes is derived and shown to be independent of the length of the tree. An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n is derived which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence. This implication is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication and further suggest an empirical formula for the true undetected decoding error probability with sequential decoding.

Johannesson, R.↗
NASA NTRS1966

Uniform codes.

Existence of q-ary uniform convolutional codes where q is any prime-power, noting error- correcting ability comparable to familiar maximal- length block codes

ENCODING↗
NASA NTRS1972

The inner zone electron model AE-5

A description is given of the work performed in the development of the inner radiation zone electron model, AE-5. A complete description of the omnidirectional flux model is given for energy thresholds E sub T in the range 4.0 E sub T/(MeV) 0.04 and for L values in the range 2.8 L 1.2 for an epoch of October 1967. Confidence codes for certain regions of B-L space and certain energies are given based on data coverage and the assumptions made in the analysis. The electron model programs that can be supplied to a user are referred to. One of these, a program for accessing the model flux at arbitrary points in B-L space and arbitrary energies, includes the latest outer zone electron model and proton model. The model AE-5, is based on data from five satellites, OGO 1, OGO 3, 1963-38C, OV3-3, and Explorer 26, spanning the period December 1964 to December 1967.

Teague, M. J.↗
NASA NTRS1983

Architecture and performance of a new GPS time transfer and positioning receiver

This paper describes the Interstate Electronics 4200 GPS Receiver System that has been developed for time transfer and low dynamic positioning applications. The receiver employs the NAVSTAR Global Positioning System (GPS) l sub 1 C/A code and has three optional solution modes fo the clock/navigation state estimation.

Kido, T. I.↗
NASA NTRS1971

A character string scanner

A computer program called Character String Scanner (CSS), is presented. It is designed to search a data set for any specified group of characters and then to flag this group. The output of the CSS program is a listing of the data set being searched with the specified group of characters being flagged by asterisks. Therefore, one may readily identify specific keywords, groups of keywords or specified lines of code internal to a computer program, in a program output, or in any other specific data set. Possible applications of this program include the automatic scan of an output data set for pertinent keyword data, the editing of a program to change the appearance of a certain word or group of words, and the conversion of a set of code to a different set of code.

Enison, R. L.↗
NASA NTRS1973

Polynomial weights and code constructions.

Study of certain polynomials with the 'weight-retaining' property that any linear combination of these polynomials with coefficients in a general finite field has Hamming weight at least as great as that of the minimum-degree polynomial included. This fundamental property is used in applications to Reed-Muller codes, a new class of 'repeated-root' binary cyclic codes, two new classes of binary convolutional codes derived from binary cyclic codes, and two new classes of binary convolutional codes derived from Reed-Solomon codes.

Massey, J. L.↗
NASA NTRS1974

Multifunction audio digitizer

An illustrative embodiment of the invention includes apparatus which simultaneously produces both direct delta modulation and pulse code modulation. An input signal, after amplification, is supplied to a window comparator which supplies a polarity control signal to gate the output of a clock to the appropriate input of a binary up-down counter. The control signals provide direct delta modulation while the up-down counter output provides pulse code modulation.

Monford, L. G., Jr.↗
NASA NTRS1974

A users manual for a computer program which calculates time optical geocentric transfers using solar or nuclear electric and high thrust propulsion

This manual is a guide for using a computer program which calculates time optimal trajectories for high-and low-thrust geocentric transfers. Either SEP or NEP may be assumed and a one or two impulse, fixed total delta V, initial high thrust phase may be included. Also a single impulse of specified delta V may be included after the low thrust state. The low thrust phase utilizes equinoctial orbital elements to avoid the classical singularities and Kryloff-Boguliuboff averaging to help insure more rapid computation time. The program is written in FORTRAN 4 in double precision for use on an IBM 360 computer. The manual includes a description of the problem treated, input/output information, examples of runs, and source code listings.

Sackett, L. L.↗
NASA NTRS1975

Short, unit-memory, Byte-oriented, binary convolutional codes having maximal free distance

It is shown that (n sub 0, k sub 0) convolutional codes with unit memory always achieve the largest free distance among all codes of the same rate k sub 0/n sub 0 and same number 2MK sub 0 of encoder states, where M is the encoder memory. A unit-memory code with maximal free distance is given at each place where this free distance exceeds that of the best code with k sub 0 and n sub 0 relatively prime, for all Mk sub 0 less than or equal to 6 and for R = 1/2, 1/3, 1/4, 2/3. It is shown that the unit-memory codes are byte-oriented in such a way as to be attractive for use in concatenated coding systems.

Lee, L. N.↗